Haibin Wang
Qiong Wu
Outlines
Background & Motivation
Principles Implementation & Simulation
Multiplication Schemes
Serial Multiplication (Shift-Add)
Computing a set of partial products, and then summing the partial products together. The implementations are primitive with simple architectures (used when there is a lack of a dedicated hardware multiplier)
Parallel Multiplication
Partial products are generated simultaneously Parallel implementations are used for high performance machines, where computation latency needs to be minimized
a1 b1 a1b0 a0b1
a0 b0 a0b0
b3 a3b0
a2b2 a3b1
p4
a3b2
p5
p2
p1
p0
For 4*4 Array Multiplier, it needs 16 AND gates, 4 HAs, 8FAs (total 12 Adders) For m*n Array Multiplier, it needs m*n AND gates, n HAs, (m-2)*n FAs, (total (m-1)*n Adders)
Testbench
Stimulus Verification & Timing
Cell
Multiplier
Disadvantages:
High power consumption More digital gates resulting in large chip area
Conclusions
Array multiplier is implemented and verified in Verilog
Although it utilizes more gates, the performance can easily be increased using pipeline technique As a parallel multiplication method, array multiplier outperforms serial multiplication schemes in terms of speed.
Reference
[1]. http://www.trivology.com/articles/534/what-is-anarray-multiplier.html
[2]. http://ece.gmu.edu ece645_lecture7.ppt
Questions?