- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 31 to 40 of 75 (0.137 seconds)Spelling suggestions: "subject:"computer organization"" "subject:"eomputer organization""
| 31 |
Episode 3.02 – Tens Complement ArithmeticTarnoff, David 01 January 2020 (has links)
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.
|
| 32 |
Episode 3.03 – An Introduction to Twos Complement RepresentationTarnoff, David 01 January 2020 (has links)
In this episode, we switch from base ten to binary as we introduce twos complement representation and show how computers store and manipulate signed integers.
|
| 33 |
Episode 3.04 – The Application of Twos ComplementTarnoff, David 01 January 2020 (has links)
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.
|
| 34 |
Episode 3.05 – Introduction to Offset or Biased NotationTarnoff, David 01 January 2020 (has links)
It turns out that twos complement is just one of many ways to use binary to represent negative numbers. In this episode, we examine the use of offset or biased notation to represent signed integers.
|
| 35 |
Episode 3.06 – Fixed Point Binary RepresentationTarnoff, David 01 January 2020 (has links)
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.
|
| 36 |
Episode 3.08 – Intro to ASCII Character EncodingTarnoff, David 01 January 2020 (has links)
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.
|
| 37 |
Episode 3.10 – Signaling and Unipolar Line Coding SchemesTarnoff, David 01 January 2020 (has links)
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.
|
| 38 |
Episode 3.11 – Polar and Bipolar Line CodingTarnoff, David 01 January 2020 (has links)
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.
|
| 39 |
Episode 3.12 – Run Length Limited CodingTarnoff, David 01 January 2020 (has links)
By examining Run Length Limited (RLL) coding, we discover a way to compress the ones and zeros of our binary data by using differential coding. We also chat a bit about magnetic storage media.
|
| 40 |
Episode 4.01 – Intro to Logic GatesTarnoff, David 01 January 2020 (has links)
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.
|
Page generated in 0.1526 seconds