1. Henry Hexmoor1 Chapter 3 Henry Hexmoor Types of Logic Circuits Combinational logic circuits: –Outputs depend only on its current inputs. –A combinational circuit may contain an arbitrary number of logic gates and inverters but no feedback loops. A feedback loop is a connection from the output of one gate to propagate back into the input of that same gate –The function of a combinational circuit represented by a logic diagram is formally described using logic expressions and truth tables. Sequential logic circuits: –Outputs depend not only on the current inputs but also on the past sequences of inputs. –Sequential logic circuits contain combinational logic in addition to memory elements formed with feedback loops. –The behavior of sequential circuits is formally described with state transition tables and diagrams.

2. Henry Hexmoor2 Combinational Circuit Analysis:Combinational Circuit Analysis: –Start with a logic diagram of the circuit. –Proceed to a formal description of the function of the circuit using truth tables or logic expressions. Combinational Circuit Synthesis:Combinational Circuit Synthesis: –May start with an informal (possibly verbal) description of the function performed. –A formal description of the circuit function in terms of a truth table or logic expression. –The logic expression is manipulated using Boolean (or switching) algebra and optimized to minimize the number of gates needed, or to use specific type of gates. –A logic diagram is generated based on the resulting logic expression.

3. Henry Hexmoor3 Sequential Circuits The general structure of a sequential Circuit: –Combinational logic + Memory Elements Combinational logic Memory elements Combinational outputs Memory outputs External inputs Memory element: a device that can remember value indefinitely, or change value on command from its inputs. Examples: latches and flip-flops

4. Henry Hexmoor4 Combinational Circuits A combinational logic circuit has: –A set of m Boolean inputs, –A set of n Boolean outputs, and –n switching functions, each mapping the 2 m input combinations to an output such that the current output depends only on the current input values A block diagram: m Boolean Inputs n Boolean Outputs Combinatorial Logic Circuit

5. Henry Hexmoor5 Integrated Circuits (IC) Integrated circuit (informally, a “chip”) is a semiconductor crystal (most often silicon) containing the electronic components for the digital gates and storage elements which are interconnected on the chip. Terminology - Levels of chip integration –SSI (small-scale integrated) - fewer than 10 gates –MSI (medium-scale integrated) - 10 to 100 gates –LSI (large-scale integrated) - 100 to thousands of gates –VLSI (very large-scale integrated) - thousands to 100s of millions of gates

6. Henry Hexmoor6 Hierarchical Design To control the complexity of the function mapping inputs to outputs: –Decompose the function into smaller pieces called blocks –Decompose each block’s function into smaller blocks, repeating as necessary until all blocks are small enough –Any block not decomposed is called a primitive block –The collection of all blocks including the decomposed ones is a hierarchy Example: 9-input parity tree (see next slide) –Top Level: 9 inputs, one output –2nd Level: Four 3-bit odd parity trees in two levels –3rd Level: Two 2-bit exclusive-OR functions –Primitives: Four 2-input NAND gates –Design requires 4 X 2 X 4 = 32 2-input NAND gates

7. Henry Hexmoor7 Hierarchy for Parity Tree Example B O X 0 X 1 X 2 X 3 X 4 X 5 X 6 X 7 X 8 Z O 9-Input odd function (a) Symbol for circuit 3-Input odd function A 0 A 1 A 2 B O 3-Input odd function A 0 A 1 A 2 B O 3-Input odd function A 0 A 1 A 2 B O 3-Input odd function A 0 A 1 A 2 X 0 X 1 X 2 X 3 X 4 X 5 X 6 X 7 X 8 Z O (b) Circuit as interconnected 3-input odd function blocks B O A 0 A 1 A 2 (c) 3-input odd function circuit as interconnected exclusive-OR blocks (d) Exclusive-OR block as interconnected NANDs

8. Henry Hexmoor8 Reusable Functions and CAD Whenever possible, we try to decompose a complex design into common, reusable function blocks These blocks are –verified and well-documented –placed in libraries for future use Representative Computer-Aided Design Tools: –Schematic Capture –Logic Simulators –Timing Verifiers –Hardware Description Languages Verilog and VHDL –Logic Synthesizers –Integrated Circuit Layout

9. Henry Hexmoor9 Top-Down versus Bottom-Up Design A top-down design proceeds from an abstract, high- level specification to a more and more detailed design by decomposition and successive refinement A bottom-up design starts with detailed primitive blocks and combines them into larger and more complex functional blocks Designs usually proceed from both directions simultaneously –Top-down design answers: What are we building? –Bottom-up design answers: How do we build it? Top-down controls complexity while bottom-up focuses on the details

10. Henry Hexmoor10 Technology Parameters Specific gate implementation technologies are characterized by the following parameters: –Fan-in – the number of inputs available on a gate –Fan-out – the number of standard loads driven by a gate output –Logic Levels – the signal value ranges for 1 and 0 on the inputs and 1 and 0 on the outputs (see Figure 1-1) –Noise Margin – the maximum external noise voltage superimposed on a normal input value that will not cause an undesirable change in the circuit output –Cost for a gate - a measure of the contribution by the gate to the cost of the integrated circuit –Propagation Delay – The time required for a change in the value of a signal to propagate from an input to an output –Power Dissipation – the amount of power drawn from the power supply and consumed by the gate

11. Henry Hexmoor11 Propagation Delay Propagation delay is the time for a change on an input of a gate to propagate to the output. Delay is usually measured at the 50% point with respect to the H and L output voltage levels. High-to-low (t PHL ) and low-to-high (t PLH ) output signal changes may have different propagation delays. High-to-low (HL) and low-to-high (LH) transitions are defined with respect to the output, not the input. An HL input transition causes: –an LH output transition if the gate inverts and –an HL output transition if the gate does not invert.

12. Henry Hexmoor12 Propagation Delay (continued) Propagation delays measured at the midpoint between the L and H values What is the expression for the t PHL delay for: –a string of n identical buffers? –a string of n identical inverters?

13. Henry Hexmoor13 Delay Models Transport delay - a change in the output in response to a change on the inputs occurs after a fixed specified delay rejection time is a specified value no larger than the propagation delay and it is often equal to it. (page 99) Inertial delay - similar to transport delay, except that if the input changes such that the output is to change twice in a time interval less than the rejection time, the output changes do not occur. Models typical electronic circuit behavior, namely, rejects narrow “pulses” on the outputs

14. Henry Hexmoor14 Cost In an integrated circuit: –The cost of a gate is proportional to the chip area occupied by the gate –The gate area is roughly proportional to the number and size of the transistors and the amount of wiring connecting them –Ignoring the wiring area, the gate area is roughly proportional to the gate input count –So gate input count is a rough measure of gate cost If the actual chip layout area occupied by the gate is known, it is a far more accurate measure

15. Henry Hexmoor15 Hardware Description Languages 3-1 OR Gate A HDL – Hardware Description Languages allow rigidly defined language to represent logic circuits. –AHDL – Altera Hardware Description Language. –VHDL – Very High Speed Integrated circuit Hardware Description Language. –Developed by DoD –Standardized by IEEE –Widely used to translate designs into bit patterns that program actual devices.

16. Henry Hexmoor16 HDL Format and Syntax Boolean Description Using VHDL Example defines an AND gate. –The keyword ENTITY names the circuit block, in this case: and_gate –The keyword PORT defines the inputs and outputs. –The keyword ARCHITECTURE describes the operation inside the block. –The BEGIN and END contain a description of the operation

17. Henry Hexmoor17 Design Procedure 3-3 1.Specification: the circuit functions 2.Formulation: truth table or I/O mapping 3.Optimization: draw logic diagrams 4.Technology Mapping: map logic components to available components 5.Verification: correctness check See Examples 3-2, 3-3, 3-4

18. Henry Hexmoor18 Design Procedure 1.Specification –Write a specification for the circuit if one is not already available 2.Formulation –Derive a truth table or initial Boolean equations that define the required relationships between the inputs and outputs, if not in the specification 3.Optimization –Apply 2-level and multiple-level optimization –Draw a logic diagram or provide a netlist for the resulting circuit using ANDs, ORs, and inverters

19. Henry Hexmoor19 Design Procedure 4.Technology Mapping –Map the logic diagram or netlist to the implementation technology selected 5.Verification –Verify the correctness of the final design

20. Henry Hexmoor20 Intentionally left blank

21. Henry Hexmoor21 Design Example 3-2 1.Specification –BCD to Excess-3 code converter –Transforms BCD code for the decimal digits to Excess-3 code for the decimal digits –BCD code words for digits 0 through 9: 4-bit patterns 0000 to 1001, respectively –Excess-3 code words for digits 0 through 9: 4- bit patterns consisting of 3 (binary 0011) added to each BCD code word –Implementation: multiple-level circuit NAND gates (including inverters)

22. Henry Hexmoor22 Design Example (continued) 2. Formulation –Conversion of 4-bit codes can be most easily formulated by a truth table –Variables - BCD: A,B,C,D –Variables - Excess-3 W,X,Y,Z –Don’t Cares - BCD 1010 to 1111

23. Henry Hexmoor23 Design Example (continued) 3.Optimization a.2-level using K-maps W = A + BC + BD X = C + D + B Y = CD + Z = BCDB CD D

24. Henry Hexmoor24 Design Example (continued) 3.Optimization (continued) b.Multiple-level using transformations T 1 = C + D W = A + BT 1 X = T 1 + B Y = CD + Z = –An additional extraction not shown in the text since it uses a Boolean transformation: ( = C + D = ): W = A + BT 1 X = T 1 + B Y = CD + Z = B C D C D D B T1T1 D T1T1 C D T1T1

25. Henry Hexmoor25 Design Example (continued) 4.Technology Mapping: page 107 – 3 rd ed. Mapping with a library containing inverters and 2-input NAND, 2-input NOR, and 2-2 AOI gates A B C D W X Y Z

26. Henry Hexmoor26 Design Example: BCD to BCD-to-Seven-Segment Decoder 1.Specification A BCD-to-seven-segment-decoder is a combinational circuit that accepts a decimal digit in BCD and generates the appropriate output for the selection of segments that display the decimal digit. Each digit is formed from 7 segments, each consisting of 1 LED that can be illuminated by digital signals.

27. Henry Hexmoor27 b c d e f g 2. Formulation (Truth table) : 2. Formulation (Truth table) To display the input BCD digit :  Which segment(s) should illuminate (be turned on)?  Which segment(s) should not illuminate (be turned off)?

28. Henry Hexmoor28 3. Optimization: 3. Optimization: Boolean Function for each output  a=? b=? c=? d=?  e=? f=? g=? 4. Draw the logic diagram

29. Henry Hexmoor29 Technology Mapping 1.Custom design 2.Cell design: reuse 3.Gate array: VLSI fabrication

30. Henry Hexmoor30 Chip Design Styles Full custom - the entire design of the chip down to the smallest detail of the layout is performed –Expensive –Justifiable only for dense, fast chips with high sales volume Standard cell - blocks have been design ahead of time or as part of previous designs –Intermediate cost –Less density and speed compared to full custom Gate array - regular patterns of gate transistors that can be used in many designs built into chip - only the interconnections between gates are specific to a design –Lowest cost –Less density compared to full custom and standard cell

31. Henry Hexmoor31 Cell Libraries Cell - a pre-designed primitive block Cell library - a collection of cells available for design using a particular implementation technology Cell characterization - a detailed specification of a cell for use by a designer - often based on actual cell design and fabrication and measured values Cells are used for gate array, standard cell, and in some cases, full custom chip design

32. Henry Hexmoor32 Example Cell Library

33. Henry Hexmoor33 Basic Verification Methods Manual Logic Analysis –Find the truth table or Boolean equations for the final circuit –Compare the final circuit truth table with the specified truth table, or –Show that the Boolean equations for the final circuit are equal to the specified Boolean equations Simulation –Simulate the final circuit (or its netlist, possibly written as an HDL) and the specified truth table, equations, or HDL description using test input values that fully validate correctness. –The obvious test for a combinational circuit is application of all possible “care” input combinations from the specification

34. Henry Hexmoor34 Programmable Configurations Read Only Memory (ROM) - a fixed array of AND gates and a programmable array of OR gates Programmable Array Logic (PAL)  - a programmable array of AND gates feeding a fixed array of OR gates. Programmable Logic Array (PLA) - a programmable array of AND gates feeding a programmable array of OR gates. Complex Programmable Logic Device (CPLD) /Field- Programmable Gate Array (FPGA) - complex enough to be called “architectures” - See VLSI Programmable Logic Devices reading supplement PAL is a registered trademark of Lattice Semiconductor Corp.

35. Henry Hexmoor35 ROM, PAL and PLA Configurations (a) Programmable read-only memory (PROM) Inputs Fixed AND array (decoder) Programmable OR array Outputs Programmable Connections (b) Programmable array logic (PAL) device Inputs Programmable AND array Fixed OR array Outputs Programmable Connections (c) Programmable logic array (PLA) device Inputs Programmable OR array Outputs Programmable Connections Programmable Connections Programmable AND array

36. Henry Hexmoor36 Read Only Memory Read Only Memories (ROM) or Programmable Read Only Memories (PROM) have: –N input lines, –M output lines, and –2 N decoded minterms. Fixed AND array with 2 N outputs implementing all N-literal minterms. Programmable OR Array with M outputs lines to form up to M sum of minterm expressions. A program for a ROM or PROM is simply a multiple-output truth table –If a 1 entry, a connection is made to the corresponding minterm for the corresponding output –If a 0, no connection is made Can be viewed as a memory with the inputs as addresses of data (output values), hence ROM or PROM names!

37. Henry Hexmoor37 Example: A 8 X 4 ROM (N = 3 input lines, M= 4 output lines) The fixed "AND" array is a “decoder” with 3 inputs and 8 outputs implementing minterms. The programmable "OR“ array uses a single line to represent all inputs to an OR gate. An “X” in the array corresponds to attaching the minterm to the OR Read Example: For input (A 2,A 1,A 0 ) = 011, output is (F 3,F 2,F 1,F 0 ) = 0011. What are functions F 3, F 2, F 1 and F 0 in terms of (A 2, A 1, A 0 )? Read Only Memory Example D7 D6 D5 D4 D3 D2 D1 D0 A2 A1 A0 A B C F0 F1F2 F3 X X X X X X X X X X

38. Henry Hexmoor38 Programmable Array Logic (PAL) The PAL is the opposite of the ROM, having a programmable set of ANDs combined with fixed ORs. Disadvantage –ROM guaranteed to implement any M functions of N inputs. PAL may have too few inputs to the OR gates. Advantages –For given internal complexity, a PAL can have larger N and M –Some PALs have outputs that can be complemented, adding POS functions –No multilevel circuit implementations in ROM (without external connections from output to input). PAL has outputs from OR terms as internal inputs to all AND terms, making implementation of multi-level circuits easier.

39. Henry Hexmoor39 P rogrammable Logic Array (PLA ) Compared to a ROM and a PAL, a PLA is the most flexible having a programmable set of ANDs combined with a programmable set of ORs. Advantages –A PLA can have large N and M permitting implementation of equations that are impractical for a ROM (because of the number of inputs, N, required –A PLA has all of its product terms connectable to all outputs, overcoming the problem of the limited inputs to the PAL Ors –Some PLAs have outputs that can be complemented, adding POS functions Disadvantage –Often, the product term count limits the application of a PLA. Two-level multiple-output optimization reduces the number of product terms in an implementation, helping to fit it into a PLA.

40. Henry Hexmoor40 HW 3 1. A majority function has an output value of 1 if there are more 1’s than 0’s on its inputs. The output is 0 otherwise. Design a three-input majority function. 3-10 2. design a circuit with a 4-bit BCD input A, B, C, D that produces an output W, X, Y, Z that is equal to the input + 6 in binary. For example 9(1001) + 6 (0110) = 15 (1111). 3-17