Draw a datapath for a pipelined complex multiplier. Unlike the sequential multiplier in Example 4.13 that takes five cycles to do each multiplication, the pipelined multiplier should take just two cycles for each pair of complex operands: one cycle for the four multiplications and one cycle for the subtraction and addition. The multiplier should accept new operand inputs on each clock cycle and produce a product on each clock cycle.
example 4.13
Develop a datapath to perform a complex multiplication of two complex numbers. The operands and product are all in Cartesian form. The real and imaginary parts of the operands are represented as signed fi xedpoint numbers with 4 pre-binary-point and 12 post-binary-point bits. The real and imaginary parts of the product are similarly represented, but with 8 prebinary-point and 24 post-binary-point bits. The complex multiplier is subject to constraints that strongly limit the circuit area.