Zaloguj się

Gotowe bibliografie tematyczne / Computer organization / Rozprawy doktorskie

Rozprawy doktorskie na temat „Computer organization”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Computer organization.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 28 lipca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Computer organization”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Tarnoff, David. "Episode 6.03 – Makin’ Rectangles". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/43.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Tarnoff, David. "Episode 6.09 – Multiplexers". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/49.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Tarnoff, David. "Episode 6.10 – Demultiplexers". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/50.

Pełny tekst źródła

Streszczenie:

A demultiplexer takes a single data stream and routes it to a selected output channel, a bit like one of those old A-B printer switches we used to physically select which printer we were sending data to. In this episode, we show how to design one.

Style APA, Harvard, Vancouver, ISO itp.

4

Tarnoff, David. "Episode 0.0 – Prologue". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Tarnoff, David. "Episode 1.1 – The Importance of Hardware Design". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Tarnoff, David. "Episode 4.09 - Simplification of Boolean Expressions". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/2.

Pełny tekst źródła

Streszczenie:

In this episode, we take a break from proving identities of Boolean algebra and start applying them. Why? Well, so we can build our Boolean logic circuits with fewer gates. That means they’ll be cheaper, smaller, and faster. That’s why.

Style APA, Harvard, Vancouver, ISO itp.

7

Tarnoff, David. "Episode 1.2 – Analog vs. Digital". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/4.

Pełny tekst źródła

Streszczenie:

In this episode, we make the distinction between analog (real-world) values and the values that a computer uses, i.e., digital. We discuss the benefits of digital over analog and describe a simple system to capture analog values.

Style APA, Harvard, Vancouver, ISO itp.

8

Tarnoff, David. "Episode 1.3 – Anatomy of a Binary Signal". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/5.

Pełny tekst źródła

Streszczenie:

In this episode, we define the components of a single binary signal as its value changes over time. This will provide us with a starting point for the terminology we will be using throughout the rest of the series.

Style APA, Harvard, Vancouver, ISO itp.

9

Tarnoff, David. "Episode 2.1 – How Computers Count without Fingers". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/7.

Pełny tekst źródła

Streszczenie:

In this episode, we visit some ancient Sumerians so we can expand our view of finger counting and see how this applies to counting with transistors. From this, we will have the basis for unsigned binary integers and the humble binary digit or bit. We also show how to calculate the upper limit to which a fixed number of transistors can count.

Style APA, Harvard, Vancouver, ISO itp.

10

Tarnoff, David. "Episode 2.3 – Hexadecimal or Sixteen ways to nibble at binary". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/9.

Pełny tekst źródła

Streszczenie:

Binary can be challenging. The values tend to have a lot of digits, long sequences of ones or zeros can be difficult to distinguish, and the relative magnitudes of multiple binary values can be difficult to resolve. In this episode, we discuss a couple of the popular methods to quickly represent binary in a more human readable form.

Style APA, Harvard, Vancouver, ISO itp.

11

Tarnoff, David. "Episode 2.9 – Introduction to Gray Code". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/15.

Pełny tekst źródła

Streszczenie:

Counting is pretty basic, right? Zero, one, two, three, four, and so on. This episode of Geek Author presents a situation where we might want to rearrange the sequence of integers in order to provide better reliability in our digital circuits.

Style APA, Harvard, Vancouver, ISO itp.

12

Tarnoff, David. "Episode 3.02 – Tens Complement Arithmetic". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/18.

Pełny tekst źródła

Streszczenie:

In 1645, Blaise Pascal presented his Pascaline to the public. Using only addition and the method of tens complement, the device could add, subtract, multiply, and divide. We discuss tens complement as an introduction to signed representations in binary.

Style APA, Harvard, Vancouver, ISO itp.

13

Tarnoff, David. "Episode 3.03 – An Introduction to Twos Complement Representation". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/19.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Tarnoff, David. "Episode 4.01 – Intro to Logic Gates". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/29.

Pełny tekst źródła

Streszczenie:

Logic gates are the fundamental building blocks of digital circuits. In this episode, we take a look at the four most basic gates: AND, OR, exclusive-OR, and the inverter, and show how an XOR gate can be used to compare two digital values. Click here to read the show transcript.

Style APA, Harvard, Vancouver, ISO itp.

15

Tarnoff, David. "Episode 4.02 – Truth Tables". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/30.

Pełny tekst źródła

Streszczenie:

In this episode, we introduce one of the most important tools in the description of logic operations: the truth table. Not only do truth tables allow us to describe a logic operation, they provide a means for us to prove logical equivalence.

Style APA, Harvard, Vancouver, ISO itp.

16

Tarnoff, David. "Episode 4.03 – Combinational Logic". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/31.

Pełny tekst źródła

Streszczenie:

Individual logic gates are not very practical. Their power comes when you combine them to create combinational logic. This episode takes a look at combinational logic by working through an example in order to generate its truth table.

Style APA, Harvard, Vancouver, ISO itp.

17

Tarnoff, David. "Episode 4.05 – Introduction to Boolean Algebra". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/33.

Pełny tekst źródła

Streszczenie:

Truth tables and circuit diagrams fall short in many ways including their abilities to evaluate and manipulate combinational logic. By using algebraic methods to represent logic expressions, we can apply properties and identities to improve performance.

Style APA, Harvard, Vancouver, ISO itp.

18

Tarnoff, David. "Episode 4.08 – DeMorgan’s Theorem". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/36.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Tarnoff, David. "Episode 4.10 – More Boolean Simplifications". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/37.

Pełny tekst źródła

Streszczenie:

Because many students have trouble when trying to simplify Boolean expressions, we’re going to dedicate another episode to examples of simplification. We’re also going to show how sometimes, there’s more than one way to crack an egg.

Style APA, Harvard, Vancouver, ISO itp.

20

Tarnoff, David. "Episode 5.02 – NAND Logic". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/39.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Tarnoff, David. "Episode 6.01 – Introduction to Karnaugh Maps". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/41.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Tarnoff, David. "Episode 6.08 – Binary Decoders". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/48.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Tarnoff, David. "Episode 7.01 – The Need for Bitwise Operations". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/51.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Tarnoff, David. "Episode 7.03 – Coding Bitwise Operations". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/53.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Tarnoff, David. "Episode 7.04 – Setting Bits using the Bitwise-OR". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/54.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Tarnoff, David. "Episode 1.4 – Pulse Width Modulation". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Tarnoff, David. "Episode 2.2 – Unsigned Binary Conversion". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/8.

Pełny tekst źródła

Streszczenie:

This episode continues the work of the previous episode by examining the methods used to convert between decimal and binary and vice versa. We also take a look at the effects of shifting the bits of a binary number both left and right and how those operations can be used to simulate multiplication and division. Oh, and since we will be discussing a lot of different numbers, it couldn’t hurt to have a piece of paper and a pencil close by.

Style APA, Harvard, Vancouver, ISO itp.

28

Tarnoff, David. "Episode 2.4 – Packed BCD: Taking More Nibbles out of Binary". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/10.

Pełny tekst źródła

Streszczenie:

Ask a computer to store a decimal whole number in binary and it will do it without any fuss. A decimal fraction, however, that’s another thing. In this episode, we will present a method called Packed BCD that is used to accurately represent decimal values in binary by storing each digit in its own nibble.

Style APA, Harvard, Vancouver, ISO itp.

29

Tarnoff, David. "Episode 2.8 – Quantization Noise in Analog Sampling". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/14.

Pełny tekst źródła

Streszczenie:

Dividing up the range of analog values into discrete binary values during the analog to digital conversion process forces us to incur a rounding error. See what that error looks and sounds like in this episode of Geek Author.

Style APA, Harvard, Vancouver, ISO itp.

30

Tarnoff, David. "Episode 3.04 – The Application of Twos Complement". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/20.

Pełny tekst źródła

Streszczenie:

In this episode, we continue our discussion of twos complement binary representation by covering overflow and how shifting left and right can be used to perform multiplication and division by powers of two.

Style APA, Harvard, Vancouver, ISO itp.

31

Tarnoff, David. "Episode 3.05 – Introduction to Offset or Biased Notation". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/21.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Tarnoff, David. "Episode 3.08 – Intro to ASCII Character Encoding". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/24.

Pełny tekst źródła

Streszczenie:

In 1963, the American Standards Association released a standard defining an 8-bit method to represent letters, punctuation, and control characters. This episode examines ASCII so that we can begin to see how computers represent language.

Style APA, Harvard, Vancouver, ISO itp.

33

Tarnoff, David. "Episode 4.06 – Properties of Boolean Algebra". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/34.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Tarnoff, David. "Episode 4.07 – Identities of Boolean Algebra". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/35.

Pełny tekst źródła

Streszczenie:

We are familiar with algebraic laws such as multiply zero by anything, and we get zero. In this episode, we see how a Boolean expression containing a constant, a duplicated signal, or a signal being combined with its inverse will simplify…always.

Style APA, Harvard, Vancouver, ISO itp.

35

Tarnoff, David. "Episode 6.05 – Don’t Cares, the Logical Kind". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/45.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Tarnoff, David. "Episode 6.06 – Don’t Cares as Inputs". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/46.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Tarnoff, David. "Episode 7.06 – Stupid Binary Tricks". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/56.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Tarnoff, David. "Episode 8.01 – Intro to Error Detection". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/57.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Tarnoff, David. "Episode 2.5 – Binary Representation of Analog Values: Fitting Infinite Inside a Computer". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/11.

Pełny tekst źródła

Streszczenie:

Computers don’t cope well with infinite, but that’s pretty much what the real world is about, limitless accuracy with as near to limitless boundaries as can be imagined. So how do we fit infinite inside the computer? That’s what this episode is about: converting analog measurements to binary with suitable accuracy. And we will do all of this with an eye to using these techniques later in our applications.

Style APA, Harvard, Vancouver, ISO itp.

40

Tarnoff, David. "Episode 2.6 – Analog to Digital Conversion with Arduino". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/12.

Pełny tekst źródła

Streszczenie:

Does capturing analog measurements with a computer sound like so much hocus pocus? In this episode, we will take a stab at lessening some of that mystic by showing how the Arduino platform can be used to perform this conversion.

Style APA, Harvard, Vancouver, ISO itp.

41

Tarnoff, David. "Episode 2.7 – The Effect of Sampling Rates on Digital Signals". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/13.

Pełny tekst źródła

Streszczenie:

Converting an analog signal to digital involves more than just digitizing some measurements. Consequences result from sampling an analog signal and care has to be taken to capture all the desired frequencies and avoid creating new ones.

Style APA, Harvard, Vancouver, ISO itp.

42

Tarnoff, David. "Episode 2.10 – Gray Code Conversion and Applications". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/16.

Pełny tekst źródła

Streszczenie:

We continue our discussion of Gray code by presenting algorithms used to convert between the weighted numeral system of unsigned binary and the Gray code ordered sequence. We also show how to implement these algorithms in our code.

Style APA, Harvard, Vancouver, ISO itp.

43

Tarnoff, David. "Episode 3.01 – Adding and Subtracting Ones and Zeros". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/17.

Pełny tekst źródła

Streszczenie:

It may sound trivial, but in this episode we’re going to learn to add and subtract…in binary. This will serve as a basis for learning about negative binary representations and the circuitry needed to perform additions in hardware.

Style APA, Harvard, Vancouver, ISO itp.

44

Tarnoff, David. "Episode 3.06 – Fixed Point Binary Representation". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/22.

Pełny tekst źródła

Streszczenie:

Up to this point, we’ve limited our discussion to binary integers. In this episode, we are moving the curtain to reveal the powers of two to the right of the binary point in order to begin representing fractions.

Style APA, Harvard, Vancouver, ISO itp.

45

Tarnoff, David. "Episode 3.10 – Signaling and Unipolar Line Coding Schemes". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/26.

Pełny tekst źródła

Streszczenie:

When sending digital data from one device to another, both devices must agree on how to represent ones and zeros. This episode presents how signal levels affect the delivery of data and how line codes are used to represent the ones and the zeros.

Style APA, Harvard, Vancouver, ISO itp.

46

Tarnoff, David. "Episode 3.11 – Polar and Bipolar Line Coding". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/27.

Pełny tekst źródła

Streszczenie:

In this episode, we continue our discussion of line codes by examining five schemes used with polar and bipolar signaling: NRZ-L, NRZ-I, RZ-AMI, Manchester, and differential Manchester. We also discuss differential coding and its benefits.

Style APA, Harvard, Vancouver, ISO itp.

47

Tarnoff, David. "Episode 3.12 – Run Length Limited Coding". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/28.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Tarnoff, David. "Episode 4.04 – NAND, NOR, and Exclusive-NOR Logic". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/32.

Pełny tekst źródła

Streszczenie:

The simplest combinational logic circuits are made by inverting the output of a fundamental logic gate. Despite this simplicity, these gates are vital. In fact, we can realize any truth table using a circuit made only from AND gates with inverted outputs.

Style APA, Harvard, Vancouver, ISO itp.

49

Tarnoff, David. "Episode 5.01 – The Sum-of-Products Expression". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/38.

Pełny tekst źródła

Streszczenie:

Who knew how easy it would be to derive a Boolean expression from a truth table? By following a few simple steps, sum-of-products expressions are quickly converted to and from truth tables. In addition, the SOP expression is a heck of a performer.

Style APA, Harvard, Vancouver, ISO itp.

50

Tarnoff, David. "Episode 5.03 – The Product-of-Sums Expression". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/40.

Pełny tekst źródła

Streszczenie:

Now that we’ve studied the sum-of-products form of Boolean expressions, it’s time to take a look at the product-of-sums. This form uses logical OR’s to generate zeros which are passed to the output through an AND gate.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!