A New Partial Product Reduction Algorithm using Modified Counter and Optimized Hybrid Network

Abstract

In this paper, a new multiplier is presented which uses modified fourteen transistor adder and optimized hybrid counter for partial product reduction step. Conventional adder is modified to improve Wallace tree functionality. Reducing critical path in counter structure can reduce VLSI area in whole multiplier structure. This paper uses a new structure in partial product reduction step to increase speed. Four to two compressors are used in modified Wallace structure to minimize the critical path. In final addition step of algorithm a new carry lookahead network is presented which adds two final operands efficiently. It uses dynamic CMOS in transistor level to reduce power consumption. Proposed multiplier reduces critical path, increases speed and decreases wiring problems in compare with previous algorithms efficiently. A new Booth encoder is presented in radix 16 circuitry. It decreases number of partial products while hardware overhead is minimized.

Enhancing ASIC chip performance through integrated algorithm optimization

“…The rich diversity of image and video processing applications spans from the subtle art of image enhancement to the intricate science of video compression [15]. Our integrated scheme finds its niche in this domain by seamlessly integrating two powerhouse algorithmsthe Booth Algorithm and the Wallace Tree Algorithm.…”