Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-06T04:00:10.507Z Has data issue: false hasContentIssue false

13 - Decoders and Encoders

from PART II - COMBINATIONAL CIRCUITS

Published online by Cambridge University Press:  05 November 2012

Guy Even
Affiliation:
Tel-Aviv University
Moti Medina
Affiliation:
Tel-Aviv University
Get access

Summary

Consider the following problem. We need a combinational circuit that controls many devices numbered 0, 1, …, 2k − 1. At every moment, the circuit instructs exactly one device to work while the others must be inactive. The input to the circuit is a k-bit string that represents the number i of the device to be active. Now, the circuit has 2k outputs, one for each device, and only the ith output should equal 1; the other outputs must equal zero. How do we design such a circuit? The circuit described previously is known as a decoder. The circuit that implements the inverse Boolean function is called an encoder.

In this chapter, we specify and design decoders and encoders. We also prove that the combinational circuit are correct, namely, they satisfy the specification. Moreover, we prove that these designs are asymptotically optimal.

BUSES

We begin this section by describing what buses are. Consider a circuit that contains an adder and a register (a memory device). The output of the adder should be stored by the register. Suppose that the adder outputs 8 bits. This means that there are eight different wires that emanate from the output of the adder to the input of the register. These eight wires are distinct and must have distinct names. Instead of naming the wires a, b, c, …, we often use names such as a[0], a[1], …, a[7].

Type
Chapter
Information
Digital Logic Design
A Rigorous Approach
, pp. 184 - 200
Publisher: Cambridge University Press
Print publication year: 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Decoders and Encoders
  • Guy Even, Tel-Aviv University, Moti Medina, Tel-Aviv University
  • Book: Digital Logic Design
  • Online publication: 05 November 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9781139226455.014
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Decoders and Encoders
  • Guy Even, Tel-Aviv University, Moti Medina, Tel-Aviv University
  • Book: Digital Logic Design
  • Online publication: 05 November 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9781139226455.014
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Decoders and Encoders
  • Guy Even, Tel-Aviv University, Moti Medina, Tel-Aviv University
  • Book: Digital Logic Design
  • Online publication: 05 November 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9781139226455.014
Available formats
×