1 / 33

Sequential Circuits Problems(II)

Algorithm = Logic + Control. Sequential Circuits Problems(II). Chapter 2. Prof. Sin-Min Lee Department of Mathematics and Computer Science. A Gray Code is a binary sequence where only 1 bit ever changes between adjacent values in the sequence. Gray codes can easily be

caspar
Télécharger la présentation

Sequential Circuits Problems(II)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Algorithm = Logic + Control Sequential Circuits Problems(II) Chapter 2 Prof. Sin-Min Lee Department of Mathematics and Computer Science

  2. A Gray Code is a binary sequence where only 1 bit ever changes between adjacent values in the sequence. Gray codes can easily be produced from Karnaugh Maps simply by tracing a single looped path which enters each location in the Karnaugh Map exactly once. which gives the Gray Code

  3. BCD Counters • A special case of an arbitrary sequence counter is that of a BCD • (Binary Coded Decimal) counter. This counter counts in decimal • from 00002 to 10012 , and then sets itself back to 0 again.

More Related