Low-Cost Approximate Constant Coefficient Hybrid Binary-Unary Multiplier for DSP Applications

Faraji, Somayeh; Abillama, Pierre; Bazargan, Kia

doi:10.1109/fccm48280.2020.00022

Cited by 5 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…V LSI is good for the fast implementation of complex DSP functions [1]. On the other hand, it is a challenging task to implement complex DSP systems with small areas, optimal performance, and minimal power usage, especially, in battery dependent portable devices, like mobile phones [2].…”

Section: Introductionmentioning

confidence: 99%

Analysis of Existing and Proposed 3-Bit and Multi-Bit Multiplier Algorithms for FIR Filters and Adaptive Channel Equalizers on FPGA

Pathan

Memon

Sohu

et al. 2021

QUEST Research Journal

View full text Add to dashboard Cite

Different multiplication algorithms have different performance characteristics. Some are good at speed while others consume less area when implemented on hardware, like Field Programmable Gate Array (FPGA)-the advanced implementation technology for DSP systems. The eminent parallel and sequential multiplication algorithms include Shift and Add, Wallace Tree, Booth, and Array. The multiplier optimization attempts have also been reported in adders used for partial product addition. In this paper, analogous to conventional multipliers, two new multiplication algorithms implemented on FPGA are shown and compared with conventional algorithms as stand-alone and by using them in the implementation of FIR filters and adaptive channel equalizer using the LMS algorithm. The work is carried out on Spartan-6 FPG that may be extended for any type of FPGA. Results are compared in terms of resource utilization, power consumption, and maximum achieved frequency. The results show that for a small length of coefficients like 3-bit, the proposed algorithms work very well in terms of achieved frequency, consumed power, and even resource utilization. Whilst for the length greater than 3-bit, the Pipelined multiplier is much better in frequency than the proposed and conventional ones, and the Booth multiplier consumes fewer resources in terms of lookup tables.

show abstract

Section: Introductionmentioning

confidence: 99%