讲义微机verilog课件张伟lec03_building_blocks.pptxVIP

Microcomputer Principle and Interfacing Techniques微机原理与接口技术 张伟 同济大学电信学院控制科学与工程系Digital Design and Computer Architecture, 2nd EditionDavid Money Harris and Sarah L. HarrisBuilding BlocksIntroductionArithmetic CircuitsNumber SystemsSequential Building BlocksMemory ArraysLogic ArraysIntroductionDigital building blocks:Gates, multiplexers, decoders, registers, arithmetic circuits, counters, memory arrays, logic arraysBuilding blocks demonstrate hierarchy, modularity, and regularity:Hierarchy of simpler componentsWell-defined interfaces and functionsRegular structure easily extends to different sizesWill use these building blocks in Chapter 7 to build microprocessor1-Bit Adders1-Bit Adders1-Bit AddersMultibit Adders (CPAs)Types of carry propagate adders (CPAs):Ripple-carry (slow)Carry-lookahead (fast)Prefix (faster)Carry-lookahead and prefix adders faster for large adders but require more hardware SymbolRipple-Carry AdderChain 1-bit adders togetherCarry ripples through entire chainDisadvantage: slowRipple-Carry Adder Delay tripple = NtFA where tFA is the delay of a full adderCarry-Lookahead AdderCompute carry out (Cout) for k-bit blocks using generate and propagate signalsSome definitions:Column i produces a carry out by either generating a carry out or propagating a carry in to the carry outGenerate (Gi) and propagate (Pi) signals for each column:Column i will generate a carry out if Ai AND Bi are both 1. Gi = Ai BiColumn i will propagate a carry in to the carry out if Ai OR Bi is 1. Pi = Ai + BiThe carry out of column i (Ci) is: Ci = Ai Bi + (Ai + Bi )Ci-1 = Gi + Pi Ci-1Carry-Lookahead AdditionStep 1: Compute Gi and Pi for all columns Step 2: Compute G and P for k-bit blocksStep 3: Cin propagates through each k-bit propagate/generate blockCarry-Lookahead AdderExample: 4-bit blocks (G3:0 and P3:0) : G3:0 = G3 + P3 (G2 + P2 (G1 + P1G0 ) P3:0 = P3P2 P1P0 Generally, Gi:j = Gi + Pi (Gi-1 + Pi-1 (Gi-2 + Pi-2Gj ) Pi:j = PiPi-1 Pi-2Pj Ci = Gi:j + Pi:j Ci-132-bit