1 / 35

Lecture 1 Design Hierarchy

Lecture 1 Design Hierarchy. Chapter 1. Digital System Design Flow. Register-Transfer Levl (RTL) e.g. VHDL/Verilog Gate Level Design Circuit Level Design Physical Layout. Verilog. Include a set of 26 predefined functional models of common combinational logic gates called primitives .

yuki
Télécharger la présentation

Lecture 1 Design Hierarchy

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. Lecture 1Design Hierarchy Chapter 1

  2. Digital System Design Flow • Register-Transfer Levl (RTL) • e.g. VHDL/Verilog • Gate Level Design • Circuit Level Design • Physical Layout

  3. Verilog • Include a set of 26 predefined functional models of common combinational logic gates called primitives. • Primitives • The most basic functional objects that can be used to compose a design • Are built into the language by means of internal truth tables • Examples: and, nand, or, nor, xor, xnor

  4. More on Primitives • 3-input nand primitive • Input signal a, b, and c • Output signal y • Each primitive has ports (corresponding to hardware pins and terminals) • The output port(s) of a primitive must be first in the list, followed by the primitive’s input ports.

  5. Instantiated Primitives • Instantiated Primitives (nor, and,nand) are connected by wires. • A wire is a data-type which is used to establish connectivity in a design, just as a physical wire establishes connectivity between gates.

  6. Example: a Full Adder • Binary Addition • Gate-Level Synthesis • Verilog Representation

  7. Binary Addition (1)

  8. Binary Addition (2)

  9. Derivation of ∑ • Question: What primitive best implements ∑? • Inputs: A, B • Outputs: xor (∑, A, B)

  10. Derivation of Carry Out • Question: What primitive best implements Co? • Inputs: A, B • Outputs: and (Co, A, B)

  11. A Half Adder A half adder is useful for adding LSB.

  12. Limitation of a Half Adder A half-adder does not account for carry-in.

  13. Truth Table of ∑ of a Full Adder Identical to ∑ of a Half Adder Cin+B+A=Cin+∑HA=Cin XOR ∑HA

  14. Truth Table of Co of a Full Adder Identical to ∑ of a Half Adder Use a Half Adder with Cin and ∑HA to generate Co

  15. Schematic of a Full Adder

  16. A 3 bit parallel adder

  17. Gate Level vs. Verilog Model of a Full Adder

  18. Explanation • The keywords module and endmoduleencapsulate the text that describes the module • The module name is Add_full • Module Ports are • Input a, b, c_in • Output c_out, sum • Module instances: Add_half, or

  19. Nested Module • Add_half is a child module of Add_full

  20. Gate Level Design • Basic Gates • AND, NAND,OR, NOR, XOR, XNOR,NOT • Universal Gates • NAND Gates • NOR Gates • Multiple Inputs Logic Gates

  21. NAND Based Logic Gates

  22. NOR Based Logic Gates

  23. Multiple Inputs Logic Gates

  24. Circuit Level

  25. Physical Design • Floor Planning • Estimates of the area of major units in the chip and defines their relative placements. • Estimate wire lengths and wring congestions. • Challenge: estimate the size of each unit without proceeding through a detailed design of the chip. • Layout • Design Verification • Tapeout

  26. A Sample Floor Plan λ= ½ of minimum channel length

  27. A Sample Layout

  28. Layout of an Inverter In a 0.6 um process 4/2=1.2 um/0.6 um.

  29. Design Verification • LVS (Layout vs. Schematic) checks that transistors in a layout are connected in the same way as in the circuit schematic. • DRC (Design Rule Checkers) verify that the layout satisfies design rules. • ERC (Electrical Rule Checkers) scan for problems such as noise or premature wearout.

  30. Tapeout • Tapeoutgets its name from the old practice of writing a specifications of masks to a magnetic tape. • GDS • Foundries: • TSMC • UMC • IBM

  31. Fabricated Chip

  32. IC Decapsulation

  33. Cross Section

  34. 1 • Red: Top layer trace • Green: Via • Blue: Bottom layer trace 7 Low Cost Package 12

  35. Package Parasitics

More Related