Delay optimized array multiplier for signal and image processing

The signal and image processing algorithm use multiplication as one of the basic arithmetic operation. So the efficient implementation of multiplier is always a challenge. The present work describes a method to build a faster array multiplier by delay optimized inter connection globally. The proposed array multiplier architecture performance in terms of delay and hardware is compared with conventional as well as recent reported one. This shows that for any length of multiplication the reported architecture is better than the conventional one. In terms of hard ware this architecture is also better than the last reported and gives less delay for length up to 12. But the reported one gives more delay for higher bit length multiplication. A detail analysis of all three architecture is give based on which a designer can decide to chose the specific array architecture for his multiplier as to requirement.

[1]  Israel Koren Computer arithmetic algorithms , 1993 .

[2]  Atsuki Inoue,et al.  A 4.1-ns Compact 54 54-b Multiplier Utilizing Sign-Select Booth Encoders , 1997 .

[3]  Yousef R. Shayan,et al.  A versatile signed array multiplier suitable for VLSI implementation , 2003, CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436).

[4]  Poras T. Balsara,et al.  High performance low power array multiplier using temporal tiling , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[5]  A. Inoue,et al.  A 4.1 ns compact 54/spl times/54 b multiplier utilizing sign select Booth encoders , 1997, 1997 IEEE International Solids-State Circuits Conference. Digest of Technical Papers.

[6]  Kwen-Siong Chong,et al.  Low energy 16-bit Booth leapfrog array multiplier using dynamic adders , 2007, IET Circuits Devices Syst..

[7]  Earl E. Swartzlander,et al.  Analysis of column compression multipliers , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.