- 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 21 to 30 of 67 (0.049 seconds)| 21 |
Episode 2.9 – Introduction to Gray CodeTarnoff, David 01 January 2020 (has links)
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.
|
| 22 |
Episode 2.10 – Gray Code Conversion and ApplicationsTarnoff, David 01 January 2020 (has links)
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.
|
| 23 |
Episode 3.01 – Adding and Subtracting Ones and ZerosTarnoff, David 01 January 2020 (has links)
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.
|
| 24 |
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.
|
| 25 |
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.
|
| 26 |
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.
|
| 27 |
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.
|
| 28 |
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.
|
| 29 |
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.
|
| 30 |
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.
|
Page generated in 0.0553 seconds