This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ECE 3504 ECE 3504 Digital Design 1 Digital Design 1 Section 5f: OneHot Code State Assignments On On Hot Code Hot Code One OneHot Codes Hot Codes Anbit code is a on ho code if An n bit code is a one hot code if exactly one of the n bits equals one. There are n n bit onehot d codes. We can make a state assignment that uses only onehot codes. Using such a state assignment requires n flipflops for n states. One OneHot Code State Hot Code State Assignment Assignment One of the advantages of a on  One of the advantages of a one hot code state assignment is that a designer can make the assignment i t i l l b i t f h i in an essentially arbitrary fashion. The designer need only ensure that each of n states receives a unique nbit state code where exactly one of the bits equals one. Exampl Exampl Example Example P x y 1 y 2 y 3 y 4 PS 1 1 A A / 1 B / 1 B A / 0 C / 0 1 B A / 0 C / 0 1 C A / D / 1 D A / 0 D / 1 1 D A / 0 D / 1 y 1 y 2 y 3 y 4 PS x 1 2 3 4 1 1 A A / 1 B / 1 B A / 0 C / 0 1 B A / 0 C / 0 1 C A / D / 1 D A / 0 D / 1 Implementation Implementation Implementation Implementation Instead of using Karnaugh maps to...
View Full
Document
 '06
 JSThweatt

Click to edit the document details