Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0...

31
Decoder
  • date post

    20-Dec-2015
  • Category

    Documents

  • view

    216
  • download

    3

Transcript of Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0...

Page 1: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

Decoder

Page 2: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

2

Decoder

ABC ABC ABC ABC ABC ABC

ABC ABC

3:8 dec

O0 O1

O2

A

B

C

Enb

S2

S1

S0

O3

O4

O5

O6

O7

A B C O0 O1 O2 O3 O4 O5 O6 O7

0 X X X 0 0 0 0 0 0 0 0

0 0 0 1 0 0 0 0 0 0 0

0 0 1 0 1 0 0 0 0 0 0

0 1 0 0 0 1 0 0 0 0 0

0 1 1 0 0 0 1 0 0 0 0

1 0 0 0 0 0 0 1 0 0 0

1 0 1 0 0 0 0 0 1 0 0

1 1 0 0 0 0 0 0 0 1 0

1 1 1 0 0 0 0 0 0 0 1

E

1

1

1

1

1

1

1

1

• 2-to-4,• 3-to-8,• …• n-to-2n

Page 3: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

3

Decoder

Page 4: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

4

Design Using Decoder• Applications:

Implementing General Logic Any combinational circuit can be constructed using decoders

and OR gates!

F1 = A' B C' D + A' B' C D + A B C DF2 = A B C' D' + A B CF3 = (A' + B' + C' + D')

• Example: A ‘B’C’D’ A ‘B’C’D A ‘B’CD’A ‘B’CD A ‘BC’D’ A ‘BC’D A ‘BCD’ A ‘ BCD A B’C’D’ A B’C’D A B’CD’ A B’CD

A B C’D’A B C’D A B C D’ A B C D

F 1

F 3

F 2

A

B

C

D

S2

S1

S0

S3

0 1 2 3 4 5 6 7 8 9

10 1 1 12 13 14 15

4:16 dec

Enb

Page 5: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

5

Active Low

• Decoder with Active Low Enable Active Low Outputs

G A B Y0 Y1 Y2 Y3

1 X X 1 1 1 1

0 0 0 0 1 1 1

0 0 1 1 0 1 1

0 1 0 1 1 0 1

0 1 1 1 1 1 0

Page 6: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

6

74x139 dual 2-to-4 decoder

Page 7: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

7

74x138 3-8 Decoder

Page 8: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

8

74x138 3-8 Decoder

Page 9: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

9

Using 3-State Buffers

Can use 3-state buffers to share a single line for several devices.

Decoder guarantees that no two buffers are on simultaneously.

Some decoders have hi-Z outputs.

Page 10: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

10

Decoders

Can build a decoder by smaller decoders

A

B

C

D

S2

S1

S0

S3

0 1 2 3 4 5 6 7 8 9

10 1 1 12 13 14 15

4:16 dec

Enb

3:8 dec

O0

O1 O2

B C D

Enb

S2 S1 S0

O3O4

O5

O6

O7

3:8 dec

O0

O1 O2

B C

D

Enb

S2 S1 S0

O3O4

O5

O6

O7

A

B

C

D

Page 11: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

11

Decoders

How to build a 5-32 decoder by using 4-16 and 2-4 decoders?

Page 12: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

12

Decoders

• Decoder: a more general term Our focus was on “binary decoders”

Page 13: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

13

7-Segment Decoder

• Seven-segment display:7 LEDs (light emitting diodes), each one

controlled by an input1 means “on”, 0 means “off”Display digit “3”?

Set a, b, c, d, g to 1Set e, f to 0

d

a

b

c e

f g

Page 14: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

14

7-Segment Decoder

C 5

C 0

C 6

C 3

C 4

C 1

C 2

C 0

C 1

C 2

C 3

C 4

C 5

C 6

BCD-to-7-segment control signal

decoder

A B C D

Page 15: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

15

7-Segment Decoder

• 7-Segment Decoder:Input is a 4-bit BCD code 4 inputs (A, B, C,

D).Output is a 7-bit code (a,b,c,d,e,f,g) that

allows for the decimal equivalent to be displayed.

• Example: Input: 0000BCD

Output: 1111110 (a=b=c=d=e=f=1, g=0)

d

a

b

c e

f g

Page 16: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

16

BCD-to-7Segment Truth Table

11100X001117

X01111101106

101101101015

011001101004

111100100113

110110100102

011000000011

111111000000

abcdefgABCDDigit abcdefgABCDDigit

XXXXXXX1111XXXXXXX1110XXXXXXX1101XXXXXXX1100

XXXXXXX1011XXXXXXX1010111X01110019111111110008

??

1011111

1110000

1110011

Page 17: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

17

K-maps

a = A + B D + C + B' D'b = A + C' D' + C D + B'c = A + B + C' + D

d = B' D' + C D' + B C' D + B' Ce = B' D' + C Df = A + C' D' + B D' + B C'g = A + C D' + B C' + B' C

AB

CD 00 01 11 10

00

01

11

10

D

B

C

A

1 0 X 1

0 1 X 1

1 1 X X

1 1 X X

K-map for a

AB

CD 00 01 11 10

00

01

11

10

D

B

C

A

1 1 X 1

1 0 X 1

1 1 X X

1 0 X X

K-map for b

AB

CD 00 01 11 10

00

01

11

10

D

B

C

A

1 1 X 1

1 1 X 1

1 1 X X

0 1 X X

K-map for c

AB

CD 00 01 11 10

00

01

11

10

D

B

C

A

1 0 X 1

0 1 X 0

1 0 X X

1 1 X X

K-map for d

AB

CD 00 01 11 10

00

01

11

10

D

B

C

A

1 0 X 1

0 0 X 0

0 0 X X

1 1 X X

K-map for e

AB

CD 00 01 11 10

00

01

11

10

D

B

C

A

1 1 X 1

0 1 X 1

0 0 X X

0 1 X X

K-map for f

AB

CD 00 01 11 10

00

01

11

10

D

B

C

A

0 1 X 1

0 1 X 1

1 0 X X

1 1 X X

K-map for g

Page 18: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

Encoder

Page 19: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

19

Encoder

• Encoder: the inverse operation of a decoder. Has 2n input lines and n output lines. The output lines generate the binary

equivalent of the input line whose value is 1.

I0

I1

I2

I3

z1

z2

4-2

Binary

Encoder

Page 20: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

20

Encoder

3:8 decoder

O0 O1

O2

A

B

C

S2

S1

S0

O3

O4

O5

O6

O7

8:3 encoder

I0 I1

I2

A

B

C

Z2

Z1

Z0

I3

I4

I5

I6

I7

Page 21: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

21

Encoder Circuit Design• Example:

8-3 Binary Encoder

A0 = D1 + D3 + D5 + D7

A1 = D2 + D3 + D6 + D7

A2 = D4 + D5 + D6 + D7

Page 22: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

22

Encoder CircuitWith Enable

With Acknowledge

Page 23: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

23

Application

The number of inputs: large

fewer lines

Page 24: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

24

Encoder Design Issues

Only one input can be active at any given time. If two inputs are active simultaneously,

the output produces an undefined combination (for example, if D3 and D6 are 1 simultaneously,

the output of the encoder will be 111.

A0 = D1 + D3 + D5 + D7

A1 = D2 + D3 + D6 + D7

A2 = D4 + D5 + D6 + D7

Page 25: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

25

Priority Encoder

Multiple asserted inputs are allowed; one has priority over all others.

Page 26: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

26

K-Maps

Page 27: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

27

Circuit

Page 28: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

28

8-3 Priority Encoder

Page 29: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

29

74x148

• Features: inputs and outputs are active low. EI_L must be asserted for any of its outputs to

be asserted. GS_L is asserted when the device is enabled

and one or more of the request inputs is asserted. (“Group Select” or “Got Something.” )

EO_L is an enable output designed to be connected to the EI_L input of another ’148 that handles lower-priority requests. It is asserted if EI_L is asserted but no request

input is asserted; thus, a lower-priority ’148 may be enabled.

Page 30: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

30

74x148 Truth Table

Page 31: Decoder. 2 ABC 3:8 dec O0O0 O1O1 O2O2 A B C Enb S2S2 S1S1 S0S0 O3O3 O4O4 O5O5 O6O6 O7O7 ABC O0O0 O1O1 O2O2 O3O3 O4O4 O5O5 O6O6 O7O7 0XXX00000000 00010000000.

32

Datasheets

http://www.techlearner.com/C&D/index.htm http://users.otenet.gr/~athsam/database.htm Some sample datasheets in the course site.