Logic Circuit Chapter 9 Simplification of Sequential Circuits

Chapter 9 Simplification of Sequential Circuits

Technique to remove redundant states Two state of a sequential system are equivalent if, starting in either state, any one input produces the same output and equivalent next states If two state are equivalent, remove one of them fewer states less expensive to implement

9.1 A Tabular Method for State Reduction

Example 9.2

9-1 Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/

Logic Circuit Chapter 9 Simplification of Sequential Circuits

Example 9.3

The state table cannot be reduced Example 9.4

The reducing process using the equivalence checked (A-F and D-G)

9-2 Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/

Logic Circuit Chapter 9 Simplification of Sequential Circuits

Example 9.5

Example 9.6

9.2 Partitions A partition on the states of a system is a grouping of the states of that system into one or more blocks Each state must be in one and only one block

9-3 Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/

Logic Circuit Chapter 9 Simplification of Sequential Circuits

Complete list of partition for a system with four states A, B, C, and D

P0 = ( A)( B)(C )( D) P P2 = ( AC )( B )( D) 1 = ( AB )(C )( D ) P3 = ( AD)( B )(C ) P4 = ( A)( BC )( D ) P5 = ( A)( BD)(C ) P6 = ( A)( B)(CD) P9 = ( AD)( BC ) P 12 = ( ACD )( B ) P7 = ( AB )(CD) P 10 = ( ABC )( D ) P 13 = ( A)( BCD ) P8 = ( AC )( BD) P 11 = ( ABD )(C ) PN = ( ABCD )

Three categories partitions of interest-first Any partition with two blocks can be used to assign one of the state variables Those states in the first block are assigned 0 and those in the second block 1 P7 through P13 meet the requirement
q* q A B C D x=0 C D A B x=1 A B B A z 1 0 1 0

Output consistent partition All of the states in each block have the same output for each of the inputs P0 is always output consistent
P2 = ( AC )( B )( D) P5 = ( A)( BD )(C ) P8 = ( AC )( BD )

Substitution property-SP partition Knowing the block of the partition and the input is enough information to determine the block of the next state PN , P0 : always SP partition Others: depending on the state table P7 = ( AB )(CD) P9 = ( AD)( BC ) Reduction of the system both SP and output consistent one state for each block of that partition

9-4 Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/

Logic Circuit Chapter 9 Simplification of Sequential Circuits

Example 9.7

Advantage of using an output consistent partition: the output is just equal to that variable or its complement Advantage of using an SP partition to assign a state variable: the next state of that variable is only a function of the input, x and that variable 9.2.1 Properties of Partitions Pa Pb if and only if all states in the same block of Pb are also in the same block of Pa .
P 10 = ( ABC )( D ) P 2 = ( AC )( B )( D )

Two states are in the same block of product Pc if and only if they are in the same block of both Pa and Pb .
P 12 P 13 = {( ACD )( B )}{( A)( BCD )} = ( A)( B )(CD ) = P 6 Pa P0 = P0 and Pa PN = Pa

Two states are in the same block of the sum Pd if they are in the same block of either Pa or Pb or both.
P2 + P5 = ( AC )( B )( D ) + ( A)( BD)(C ) = ( AC )( BD ) = P8 Pa + P0 = Pa and Pa + PN = PN

9-5 Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/

Logic Circuit Chapter 9 Simplification of Sequential Circuits

9.2.2 Finding SP Partitions Step 1: For each pair of states, find the smallest SP partition that puts those two states in the same block.

( AB ) (CD )

( AB )(CD ) = P 1

( AC ) ( AB ) (CD ) ( ABCD ) = PN

(AD) (BC) (AD)(BC) = P2 (BC) (AD) (AD)(BC) = P2 (BD) (AB) PN (CD) (AB) (AB)(CD) = P1 Step 2: Find the sum of all of the SP partitions found in step 1 and, if new ones are found, repeat step 2 on these new ones. Example 9.8

- Step 1 (AB) (AC) (AD) (BC) (BD) (CD) - Step 2 (BC), (BC) ok (AD) (ABD) (BC), (AD) P1 = (AB)(C)(D) P2 = (ABC)(D) P3 = (AD)(B)(C) P4 = (A)(BC)(D) P5 = (ABD)(C) PN P2 P5 P2 P5 PN not needed

P1 + P2 = (ABC)(D) P1 + P3 = (ABD)(C) P1 + P4 = (ABC)(D) P1 + P5 = (ABD)(C) P2 + P3 P2 + P4= (ABC)(D) P2 + P5

not needed not needed not needed not needed

9-6

P2 PN

Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/

Logic Circuit Chapter 9 Simplification of Sequential Circuits

P3 + P4 = (AD)(BC) P3 + P5= (ABD)(C) P4 + P5 Example 9.9

P6 = (AD)(BC) P5 not needed PN not needed

9.3 State Reduction Using Partitions Any partition that is both output consistent and SP can be used to reduce the system to one with one state for each block of that partition Example 9.8: the only SP partition that is output consistent

Example 9.9: no output consistent SP partitions can not be reduced (same NS and different output columns: Example 9.10)
9-7 Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/

Logic Circuit Chapter 9 Simplification of Sequential Circuits

Example 9.10

SP partitions P1 = (ACE)(B)(D) P5 = (A)(B)(CE)(D) P2 = (ADE)(BC) P6 = (ACE)(BD) P3 = (AE)(B)(C)(D) P7 = (AE)(BD)(C) P4 = (A)(BD)(C)(E) P8 = (A)(BD)(CE) Output consistent partitions: P1, P3, P5 P1 = (ACE)(B)(D) SP partition of reduced system P6* = (A-C-E)(BD)

Output consistent partitions: P1, P3, P4 P5, P6, and P8 P6 = (ACE)(BD)

9-8 Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/

Logic Circuit Chapter 9 Simplification of Sequential Circuits

Example 9.11

SP partitions (AB) (BD)(AE) (DF)(AG)(CE) PN (AC) (BG)(AE) (ACE) (ACE)(BG)(D)(F) Output consistent partition (ACE)(BG)(D)(F)

SP partitions of reduced system (AB) (BD) (DF) (AD) (AB)(BF) (AF) (BD)(AB) (BD) (DF)(AB) (BF) (AB) (DF) PN PN PN PN PN (A)(B)(DF)

9.4 Choosing A State Assignment Symbolic state binary encoded state Distinct state assignment different cost of CL realization Optimum state assignment: In general, the best assignment for one type of F/F, in terms of realization cost, is not the best for another type Find all of the SP partitions reduce the system if possible make a state assignment to solve the problem
9-9 Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/

Logic Circuit Chapter 9 Simplification of Sequential Circuits

Three levels of state assignment (depending upon how important it is to reduce) Absolute minimum: try to all possible sets of two-block partitions for which the product is P0 Use two-block SP partitions for one or more of the variables: almost always preferable Assignment at random: least like to produce good results

P 1 = ( AB )(CD ) P2 = ( AD )( B )(C ) P3 = ( A)( BC )( D) P2 + P3 = P4 = ( AD )( BC )

P1

P4

P1

POC

POC

P4

9-10 Edited by Il Kyu Eom, Dept. Electronics Eng., Pusan National University, Email: ikeom@pusan.ac.kr, Website: http://vspl.ee.pusan.ac.kr/