Scribd
Upload
19 views16 pages

Comparators Code Converter

Uploaded by

Jemima A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
19 views16 pages

Comparators Code Converter

Uploaded by

Jemima A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 16

Code Converters

1
BCD-to-Excess-3 Code Converter -
Specificaiton

The excess-3 code for a decimal digit is the binary combination corresponding
to the decimal digit plus 3. For example, the excess-3 code for decimal digit 5
is the binary combination for 5 + 3 = 8, which is 1000.

Each BCD digit is four bits with the bits, from most significant to least
significant, labeled A, B, C, D. Each excess-3 digit is four bits, with the bits,
from most significant to least significant, labeled W, X, Y, Z.

A W
BCD B BCD-to X Excess-3
digit C Excess-3 Y digit
D Z

2
BCD-to-Excess-3 Code Converter - Formulation

3
BCD-to-Excess-3 Code Converter -
Optimization

4
BCD-to-Excess-3 Code Converter -
Optimization

5
BCD-to-Seven-Segment Decoder -
Specification

Digital readouts found in many consumer electronic products often use Light
Emitting Diodes (LEDs). Each digit of the readout is formed from seven LED
segments. Each segment can be illuminated by a digital signal. A BCD-to-
seven-
segment decoder is a combinational circuit that accepts a decimal digit in
BCD and generates the appropriate outputs for the segments of the display
for the decimal digit. The seven outputs of the decoder (a,b,c,d,e,f,g)
select the corresponding segments in the display. BCD-to-seven-segment
decoder has four inputs, A, B, C, and D for the BCD digit and seven outputs,
a through g, for controlling the segments.

6
BCD-to-Seven-Segment Decoder - Formulation

7
BCD-to-Seven-Segment Decoder -
Optimization

a= A’C + A’BD + B’C’D’ + AB’C’

b= A’B’ + A’C’D’ + A’CD + AB’C’

c= A’B + A’D + B’C’D’ + AB’C’

d= A’C^D’ + A’B’C + B’C’D’ + AB’C’ + A’BC’D

e= A’CD’ + B’C’D’

f= A’BC’ + A’C’D’ + A’BD’ + AB’C’

g= A’CD’ + A’B’C + A’BC’ + AB’C’

8
FOUR BIT BINARY TO GRAY CODE CONVERTER
–DESIGN
MSB + + + + Binary code
INPUT ( BINARY) OUTPUTS (GRAY CODE) 0 1 1 0 1

B3 B2 B1 B0 G3 G2 G1 G0 Gray code
0 1 0 1 1
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 0
0 1 0 1 0 1 1 1
0 1 1 0 0 1 0 1
0 1 1 1 0 1 0 0
1 0 0 0 1 1 0 0
1 0 0 1 1 1 0 1
1 0 1 0 1 1 1 1
1 0 1 1 1 1 1 0
1 1 0 0 1 0 1 0
1 1 0 1 1 0 1 1
1 1 1 0 1 0 0 1
1 1 1 1 1 0 0 0

9
Simplification using K-maps

10
Logic Diagram

11
FOUR BIT GRAY CODE TO BINARY CONVERTER
–DESIGN
INPUT ( GRAY CODE) OUTPUTS (BINARY )
MSB + + + + Gray code
1 0 1 0 0
G3 G2 G1 G0 B3 B2 B1 B0
Binary code

1 1 0 0 0
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 1
0 1 0 1 0 1 1 0
0 1 1 0 0 1 0 0
0 1 1 1 0 1 0 1
1 0 0 0 1 1 1 1
1 0 0 1 1 1 1 0
1 0 1 0 1 1 0 0
1 0 1 1 1 1 0 1
1 1 0 0 1 0 0 0
1 1 0 1 1 0 0 1
1 1 1 0 1 0 1 1
1 1 1 1 1 0 1 0

12
Puzzles

13
14
MIND MAP

15
Summary

Code Converters

Truth table
K-Map
Excitation Equation
Logic Diagram

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy