DSpace Repository

Dual channel addition based FFT processor architecture for signal and image processing

Show simple item record

dc.contributor.author Gupta, Anu
dc.contributor.author Shekhar, Chandra
dc.contributor.author Asati, Abhijit
dc.date.accessioned 2023-02-10T03:54:07Z
dc.date.available 2023-02-10T03:54:07Z
dc.date.issued 2009-12
dc.identifier.uri https://dl.acm.org/doi/abs/10.1504/IJHPSA.2009.030097
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9129
dc.description.abstract This paper presents a novel fixed-point 16-bit word-width 16-point FFT/IFFT processor architecture designed primarily for the signal and image processing application. The 16-point FFT is realised by using Cooley-Tukey decimation in time algorithm. This approach reduces the number of required complex multiplications compared to a normal discrete Fourier transform. Since multipliers are very power hungry elements in VLSI designs, they result in significant power consumption. So, the complex multiplication operations are realised using shift-and-add operations. The proposed algorithm performs all intermediate addition operation using a novel dual channel addition technique, which avoids carry propagation delay. Only in the last stage, carry look ahead adders are used to give final result. This dual channel addition algorithm reduces the critical delay path by 42% and 38.29% as compared to traditional and Maharatna approach respectively. en_US
dc.language.iso en en_US
dc.publisher ACM Digital Library en_US
dc.subject EEE en_US
dc.subject FFT processor en_US
dc.subject Architecture en_US
dc.subject Image processing en_US
dc.title Dual channel addition based FFT processor architecture for signal and image processing en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account