Performance Analysis of 8-Point FFT using Approximate Radix-8 Booth Multiplier

Y, Anil Kumar Reddy; P, Sathish Kumar

doi:10.1109/cesys.2018.8724107

Cited by 5 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table II lists the conventional structure comparison using array multiplier and different adders such as RCA, CLA, and Sklansky prefix graph adder. The proposed results having very much reduction comparing to the existing implementations [13]- [15].…”

Section: Resultsmentioning

confidence: 90%

International Journal of Electronics and Telecommunications

Jammu¹,

Muntha²,

Cheepurupalli³

et al. 2021

View full text Add to dashboard Cite

Real-time data processing systems utilize Digital Signal Processing (DSP) functions as the base modules. Most of the DSP functions involve the implementation of Fast Fourier Transform (FFT) to convert the signals from one domain to another domain. The major bottleneck of Decimation in frequency-Fast Fourier Transform (DIF-FFT) implementation lies in using a number of Multipliers. Distributed arithmetic (DA) is considered as one of the efficient techniques to implement DIF-FFT. In this approach, the multipliers are not used. The proposed technique exploits the very advantage of the look-up table by storing the Twiddle factors, thereby avoiding the multipliers required in the butterfly structure. DIF-FFT using Distributed Arithmetic (DIF-FFT DA) models, with different adders such as Ripple carry adder (RCA), Carry-lookahead adder (CLA), and Sklansky prefix graph adder, are proposed in this paper. The three proposed models are synthesized using Cadence 6.1 EDA tools with a 45nm CMOS technology. Compared to the traditional method, it is observed that the area is improved by 53.11%, 53.35%, and 50.15%, power is improved by 42.31%, 42.52%, and 40.39%, and delay is improved by 45.26%, 45.42%, 41.80%, respectively.

show abstract

Section: Resultsmentioning

confidence: 90%

International Journal of Electronics and Telecommunications

Jammu¹,

Muntha²,

Cheepurupalli³

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Since it achieves high energy efficiency, there is a trade off between energy consumption and accuracy. 8 point Fast Fourier Transform is designed using approximate radix-8 booth multiplier [11] which partially performed the operation of butterfly unit. The remaining operation of butterfly unit is performed by recoded adder and Kogge Stone adder.…”

Section: Related Workmentioning

confidence: 99%

Efficient Approximate Computing Unit Architecture for Satellite Images

A¹

2023

Preprint

View full text Add to dashboard Cite

Approximate computing plays a significant role in signal processing and image processing applications. Radix-8 approximate novel booth multiplier (R8ANBM) based on approximate novel booth encoder (ANBE) is proposed in this paper to validate approximate computing. The proposed design is synthesized and simulated in Xilinx ISE 13.2. The experimental results show that the proposed multiplier performs better in terms area, speed and energy consumption. The proposed R8ANBE reduced the number of 4 input LUTs by 23.07%, 17.94%, 19.87%, 16.66%, 13.46%, 8.33%, 12.82%, 9.61%, 12.17% and number of occupied slices by 22.33%, 30.09%, 25.24%, 29.12%, 14.56%, 17.47%, 13.59%, 12.62%, 17.47% when compared with the existing techniques such as conventional booth multiplier, R4ABM1, RAD64, ABM1, HLR-BM1, HLR-BM2, R8ABM1, R8ABM2, R8ABM3 respectively. It achieved the accuracy as 67.3% which is higher than exisitng approximate booth multipliers. The proposed R8ANBM is applied to image sharpening applications and the performances are analyzed in terms of error metrics such as ralative mean error distance, normalized mean error distance and peak signal to noise ratio. The above proposed system was implemented using 45nanometer technology library. With applications in low-power CMOS design, quantum computing, optical information processing, DNA computing, bioinformatics, and nanotechnology, there is an increasing interest in power minimization.

show abstract

A Review of Approximate Multipliers and Its Applications

Rao

Samundiswary

2021

Advances in Automation, Signal Processing, Instrumentation, and Control

View full text Add to dashboard Cite

Performance Analysis of 8-Point FFT using Approximate Radix-8 Booth Multiplier

Cited by 5 publications

References 3 publications

International Journal of Electronics and Telecommunications

International Journal of Electronics and Telecommunications

Efficient Approximate Computing Unit Architecture for Satellite Images

A Review of Approximate Multipliers and Its Applications

Contact Info

Product

Resources

About