高等计算机体系结构课件第三章（英文版）.pptxVIP

Computer Architecture: A Constructive ApproachPipelining combinational circuits1 ContentsFFT: Another complex combinational circuit and its folded implementationsNew Bluespec conceptsstructure typeOverloadingElastic vs Inelastic pipelines for arithmetic circuitsValid/Invalid data and the Maybe typeMulti-rule systemsEffect of Concurrency properties of FIFOs on pipelinesBluespec execution model2 Combinational IFFTin0…in1in2in63in3in4Bfly4Bfly4Bfly4x16Bfly4Bfly4Bfly4…Bfly4Bfly4Bfly4…out0…out1out2out63out3out4PermutePermutePermuteAll numbers are complex and represented as two sixteen bit quantities. Fixed-point arithmetic is used to reduce area, power, ...****+--++--+*jt2t0t3t13 4-way Butterfly Nodefunction Vector#(4,Complex) bfly4 (Vector#(4,Complex) t, Vector#(4,Complex) x);t’s (twiddle coefficients) are mathematically derivable constants for each bfly4 and depend upon the position of bfly4 the in the network****+--++--+*ix0x1 x2 x3t0t1 t2 t34 BSV code: 4-way Butterflyfunction Vector#(4,Complex#(s)) bfly4 (Vector#(4,Complex#(s)) t, Vector#(4,Complex#(s)) x); Vector#(4,Complex#(s)) m, y, z; m[0] = x[0] * t[0]; m[1] = x[1] * t[1]; m[2] = x[2] * t[2]; m[3] = x[3] * t[3]; y[0] = m[0] + m[2]; y[1] = m[0] – m[2]; y[2] = m[1] + m[3]; y[3] = i*(m[1] – m[3]); z[0] = y[0] + y[2]; z[1] = y[1] + y[3]; z[2] = y[0] – y[2]; z[3] = y[1] – y[3]; return(z);endfunctionPolymorphic code: works on any type of numbers for which *, + and - have been defined****+--++--+*imyz Note: Vector does not mean storage; just a group of wires with names5 Language notes: Sequential assignmentsSometimes it is convenient to reassign a variable (x is zero every where except in bits 4 and 8):Order matters!This will usually result in introduction of muxes in a circuit as the following example illustrates:Bit#(32) x = 0;let y = x+1;if(p) x = 100;let z = x+1;x0100p+1+1zyBit#(32) x = 0;x[4] = 1; x[8] = 1;6 Complex ArithmeticAdditionzR = xR + yRzI = xI + yIMultiplicationzR = xR * yR - x