1 / 36

EE121 John Wakerly Lecture #5

This lecture discusses documentation standards for programmable logic devices, including block diagrams, schematic diagrams, and HDL programs. It also covers topics such as timing diagrams, circuit descriptions, and specialized tools for drawing timing diagrams. The lecture explores the use of gate symbols, DeMorgan equivalent symbols, and the choice of symbols based on signal names and active levels. Additionally, it introduces programmable logic arrays (PLAs) and their electrical design, as well as programmable array logic (PALs) and designing with PALs. The lecture concludes with a discussion of decoders and their applications.

ehogan
Download Presentation

EE121 John Wakerly Lecture #5

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. EE121 John Wakerly Lecture #5 Documentation StandardsProgrammable Logic DevicesDecoders

  2. Documentation Standards • Block diagrams • first step in hierarchical design • Schematic diagrams • HDL programs (ABEL, Verilog, VHDL) • Timing diagrams • Circuit descriptions

  3. Block Diagram

  4. Schematic diagrams • Details of component inputs, outputs, and interconnections • Reference designators • Pin numbers • Title blocks • Names for all signals • Page-to-page connectors

  5. Example schematic

  6. Flat schematic structure

  7. Hierarchichal schematic structure

  8. Other Documentation • Timing diagrams • Output from simulator • Specialized timing-diagram drawing tools • Circuit descriptions • Text (word processing) • E102E • Can be as big as a book (e.g., typical Cisco ASIC descriptions) • Typically incorporate other elements (block diagrams, timing diagrams, etc.)

  9. Gate symbols

  10. DeMorgan equivalent symbols Which symbol to use? Answer depends on signal names and active levels.

  11. Signal names and active levels • Signal names are chosen to be descriptive. • Active levels -- HIGH or LOW • named condition or action occurs in either the HIGH or the LOW state, according to the active-level designation in the name.

  12. LOW when error occurs Logic Circuit ERROR ERROR1_L Example HIGH when error occurs Logic Circuit ERROR OK_L ERROR_L

  13. Programmable Logic Arrays (PLAs) • Any combinational logic function can be realized as a sum of products. • Idea: Build a large AND-OR array with lots of inputs and product terms, and programmable connections. • n inputs • AND gates have 2n inputs -- true and complement of each variable. • m outputs, driven by large OR gates • Each AND gate is programmably connected to each output’s OR gate. • p AND gates (p<<2n)

  14. Example: 4x3 PLA, 6 product terms

  15. Compact representation • Actually, closer to physical layout (“wired logic”).

  16. Some product terms

  17. PLA Electrical Design • See Section 5.3.5 -- wired-AND logic

  18. Programmable Array Logic (PALs) • How beneficial is product sharing? • Not enough to justify the extra AND array • PALs ==> fixed OR array • Each AND gate is permanently connected to a certain OR gate. • Example: PAL16L8

  19. 10 primary inputs • 8 outputs, with 7 ANDs per output • 1 AND for 3-state enable • 6 outputs available as inputs • more inputs, at expense of outputs • two-pass logic, helper terms • Note inversion on outputs • output is complement of sum-of-products • newer PALs have selectable inversion

  20. Designing with PALs • Compare number of inputs and outputs of the problem with available resources in the PAL. • Write equations for each output using ABEL. • Compile the ABEL program, determine whether minimimized equations fit in the available AND terms. • If no fit, try modifying equations or providing “helper” terms. • Lab #2

  21. Decoders • General decoder structure • Typically n inputs, 2n outputs • 2-to-4, 3-to-8, 4-to-16, etc.

  22. Note “x” (don’t care) notation. Binary 2-to-4 decoder

  23. 2-to-4-decoder logic diagram

  24. MSI 2-to-4 decoder • Input buffering (less load) • NAND gates (faster)

  25. Decoder Symbol

  26. Complete 74x139 Decoder

  27. More decoder symbols

  28. 3-to-8 decoder

  29. 74x138 3-to-8-decoder symbol

  30. Decoder cascading 4-to-16 decoder

  31. More cascading 5-to-32 decoder

  32. ABEL / PAL Version of 74x138

  33. ABEL decoder program (continued)

  34. An easier way to decode

  35. Decoder applications • Microprocessor memory systems • selecting different banks of memory • Microprocessor input/output systems • selecting different devices • Microprocessor instruction decoding • enabling different functional units • Memory chips • enabling different rows of memory depending on address • Lots of other applications

  36. Next time • Encoders • Three-state devices • Multiplexers • XOR gates • Comparators • Adders

More Related