Scribd
Upload
44 views5 pages

Running ECE LEDs Design

The document summarizes the design of an LED circuit using three LEDs (E, C, A) and describes its operation through state tables. It shows the decimal encoding of the 8 possible states. State transition tables and Karnaugh maps are used to derive simplified Boolean expressions for the control signals to transition between states. Specifically, the control logics are derived as Ja=CX, Jb=AX+CX, Jc=A'X+BX, Ka=A'X+CX, Kb=A'X+CX, Kc=BX.

Uploaded by

Marvin Atienza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
44 views5 pages

Running ECE LEDs Design

The document summarizes the design of an LED circuit using three LEDs (E, C, A) and describes its operation through state tables. It shows the decimal encoding of the 8 possible states. State transition tables and Karnaugh maps are used to derive simplified Boolean expressions for the control signals to transition between states. Specifically, the control logics are derived as Ja=CX, Jb=AX+CX, Jc=A'X+BX, Ka=A'X+CX, Kb=A'X+CX, Kc=BX.

Uploaded by

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

ECE WORKSHOP

Design of Running ECE LEDs

Sequence C B A Decimal Value

1. E is ON C is OFF E is OFF 1 0 0 4
2. E is OFF C is ON E is OFF 0 1 0 2
3. E is OFF C is OFF E is ON 0 0 1 1
4. E is ON C is ON E is ON 1 1 1 7

For the State-Transition Table

Decimal Present te Next State


Sta
X=0 X=1
A B C A B C A B C
0 0 0 0 0 0 0 0 0 1
1 0 0 1 0 0 1 1 1 1
2 0 1 0 0 1 0 0 0 1
3 0 1 1 0 1 1 1 0 0
4 1 0 0 1 0 0 0 1 0
5 1 0 1 1 0 1 1 1 1
6 1 1 0 1 1 0 1 1 1
7 1 1 1 1 1 1 1 0 0

Decimal Present te Contro Next Flip-Flop Status


Sta l State

A B C X A B C Ja Ka Jb Kb Jc Kc

0 0 0 0 0 0 0 0 0 X 0 X 0 X
0 0 0 0 1 0 0 1 0 X 0 X 1 X
1 0 0 1 0 0 0 1 0 X 0 X X 0
1 0 0 1 1 1 1 1 1 X 1 X X 0
2 0 1 0 0 0 1 0 0 X X 0 0 X
2 0 1 0 1 0 0 1 0 X X 1 1 X
3 0 1 1 0 0 1 1 0 X X 0 X 0
3 0 1 1 1 1 0 0 1 X X 1 X 1
4 1 0 0 0 1 0 0 X 0 0 X 0 X
4 1 0 0 1 0 1 0 X 1 1 X 0 X
5 1 0 1 0 1 0 1 X 0 0 X X 0
5 1 0 1 1 1 1 1 X 0 1 X X 0
6 1 1 0 0 1 1 0 X 0 X 0 0 X
6 1 1 0 1 1 1 1 X 0 X 0 1 X
7 1 1 1 0 1 1 1 X 0 X 0 X 0
7 1 1 1 1 1 0 0 X 0 X 1 X 1

Note:

Q(t) Q(t+1) J K

0 0 0 X

0 1 1 X

1 0 X 1

1 1 X 0

To simplify using Karnaugh Map,

For Ja, For Ka,

CD 00 01 11 10
AB
00 1
01 1
11 X X X X
10 X X X X

1st
Group
A B C X
0 0 1 1
0 1 1 1
1 1 1 1
1 0 1 1
_ _ 1 1

Thus
Ja =
CX
For Jb, For Kb,

CD 00 01 11 10 CD 00 01 11 10
AB AB
00 1 00 X X X X
01 X X X X 01 1 1
11 X X X X 11 1
10 1 1 10 X X X X

1st 1st
Group Group
A B C X A B C X
1 1 0 1 0 0 0 1
1 1 1 1 0 0 1 1
1 0 0 1 0 1 0 1
1 0 1 1 0 1 1 1
1 _ _ 1 0 _ _ 1

2nd Group 2nd Group


A B C X A B C X
0 0 1 1 0 0 1 1
0 1 1 1 0 1 1 1
1 1 1 1 1 1 1 1
1 0 1 1 1 0 1 1
_ _ 1 1 _ _ 1 1

Thus Thus
Jb = AX + CX Kb = A'X + CX

For Jc, For Kc,


CD 00 01 CD 00 01 11 10
AB AB
00 1 00 X X
01 1 01 X X 1
11 1 11 X X 1
10 10 X X

1st 1st
Group Group
A B C A B C X
0 0 0 0 1 0 1
0 0 1 0 1 1 1
0 1 0 1 1 0 1
0 1 1 1 1 1 1
0 _ _ _ 1 _ 1

2nd Thus
Group Kc =
A B C BX
0 1 0
0 1 1
1 1 0
1 1 1
_ 1 _

Thus
Jc = A'X + BX

Designed by:

Engr. Robert G. de Luna, PECE, MSECE

You might also like