{"title":"High performance and low power modified radix-25 FFT architecture for high rate WPAN application","authors":"B. Pushparaj, C. Paramasivam","doi":"10.1109/ICEVENT.2013.6496560","DOIUrl":null,"url":null,"abstract":"This paper present a high-performance and low-complexity modified radix-25 512-point Fast Fourier transform (FFT) architecture using an eight data-path pipelined approach for high rate wireless personal area network applications. A novel modified radix-25 FFT algorithm that reduces the hardware complexity is proposed. This method can reduce the number of complex multiplications and the size of the twiddle factor memory. It also uses a complex constant multiplier instead of a complex Booth multiplier. The results demonstrate that the total gate count of the proposed FFT architecture is 11, 894. Furthermore the highest throughput rate is up to 2.4 GS/s at 310 MHz while requiring much less hardware complexity.","PeriodicalId":6426,"journal":{"name":"2013 International Conference on Emerging Trends in VLSI, Embedded System, Nano Electronics and Telecommunication System (ICEVENT)","volume":"20 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Emerging Trends in VLSI, Embedded System, Nano Electronics and Telecommunication System (ICEVENT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEVENT.2013.6496560","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper present a high-performance and low-complexity modified radix-25 512-point Fast Fourier transform (FFT) architecture using an eight data-path pipelined approach for high rate wireless personal area network applications. A novel modified radix-25 FFT algorithm that reduces the hardware complexity is proposed. This method can reduce the number of complex multiplications and the size of the twiddle factor memory. It also uses a complex constant multiplier instead of a complex Booth multiplier. The results demonstrate that the total gate count of the proposed FFT architecture is 11, 894. Furthermore the highest throughput rate is up to 2.4 GS/s at 310 MHz while requiring much less hardware complexity.