• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 10
  • 3
  • 3
  • Tagged with
  • 75
  • 75
  • 60
  • 58
  • 9
  • 6
  • 5
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • 4
  • 3
  • 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.
11

Episode 6.10 – Demultiplexers

Tarnoff, David 01 January 2020 (has links)
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.
12

Design and implementation of a computational cluster for high performance design and modeling of integrated circuits /

Gruener, Charles J. January 2009 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2009. / Typescript. Includes bibliographical references (leaves 109-111).
13

Episode 8.01 – Intro to Error Detection

Tarnoff, David 01 January 2020 (has links)
Digital data has many benefits, but what happens if it’s in error? Moreover, how can we tell if a bit has been flipped? Our discussion begins with parity.
14

Episode 7.06 – Stupid Binary Tricks

Tarnoff, David 01 January 2020 (has links)
Having learned how to program bitwise operations, it is now time to flex our bit bashing muscles by investigating some creative ways to perform common programming functions.
15

Episode 1.1 – The Importance of Hardware Design

Tarnoff, David 01 January 2020 (has links)
In this episode, we discuss the importance of hardware design to anyone interested in creating computing solutions.
16

Episode 4.09 - Simplification of Boolean Expressions

Tarnoff, David 01 January 2020 (has links)
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.
17

Episode 1.2 – Analog vs. Digital

Tarnoff, David 01 January 2020 (has links)
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.
18

Episode 1.3 – Anatomy of a Binary Signal

Tarnoff, David 01 January 2020 (has links)
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.
19

Episode 1.4 – Pulse Width Modulation

Tarnoff, David 01 January 2020 (has links)
In this episode, we show how a binary signal can be used to give the appearance of an analog output. We then use this understanding to show how to dim an LED on the Arduino open source platform.
20

Episode 2.1 – How Computers Count without Fingers

Tarnoff, David 01 January 2020 (has links)
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.

Page generated in 0.1348 seconds