{"title":"一种用于超宽带应用的高速低复杂度双并行基数24 FFT/IFFT处理器","authors":"Hanho Lee, Minhyeok Shin","doi":"10.1109/ASSCC.2007.4425686","DOIUrl":null,"url":null,"abstract":"This paper presents a high-speed, low-complexity two data-path 128-point radix-24 FFT/IFFT processor for MB-OFDM ultrawideband (UWB) systems. The proposed FFT processor uses a method for compensating the truncation error of fixed-with Booth multipliers with Dadda reduction network, which keep the input and output the 8-bit width. This method leads to reduction of truncation errors compared with direct-truncated multipliers. It provides lower hardware complexity and high throughput with almost same SQNR compared with direct-truncated Booth multipliers. The proposed FFT/IFFT processor has been designed and implemented with 0.18-mum CMOS technology in a supply voltage of 1.8 V. The proposed two-parallel FFT/IFFT processor has a throughput rate of up to 900 Msample/s at 450 MHz while requiring much smaller hardware complexity.","PeriodicalId":186095,"journal":{"name":"2007 IEEE Asian Solid-State Circuits Conference","volume":"228 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A high-speed low-complexity two-parallel radix-24 FFT/IFFT processor for UWB applications\",\"authors\":\"Hanho Lee, Minhyeok Shin\",\"doi\":\"10.1109/ASSCC.2007.4425686\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a high-speed, low-complexity two data-path 128-point radix-24 FFT/IFFT processor for MB-OFDM ultrawideband (UWB) systems. The proposed FFT processor uses a method for compensating the truncation error of fixed-with Booth multipliers with Dadda reduction network, which keep the input and output the 8-bit width. This method leads to reduction of truncation errors compared with direct-truncated multipliers. It provides lower hardware complexity and high throughput with almost same SQNR compared with direct-truncated Booth multipliers. The proposed FFT/IFFT processor has been designed and implemented with 0.18-mum CMOS technology in a supply voltage of 1.8 V. The proposed two-parallel FFT/IFFT processor has a throughput rate of up to 900 Msample/s at 450 MHz while requiring much smaller hardware complexity.\",\"PeriodicalId\":186095,\"journal\":{\"name\":\"2007 IEEE Asian Solid-State Circuits Conference\",\"volume\":\"228 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Asian Solid-State Circuits Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASSCC.2007.4425686\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Asian Solid-State Circuits Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASSCC.2007.4425686","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14
摘要
本文提出了一种高速、低复杂度的双数据路径128点基数24 FFT/IFFT处理器,用于MB-OFDM超宽带(UWB)系统。所提出的FFT处理器使用Dadda约简网络补偿固定布氏乘法器的截断误差,使输入和输出保持8位宽度。与直接截断乘法器相比,该方法可以减少截断误差。与直接截断的布斯乘数器相比,它提供了更低的硬件复杂性和几乎相同的SQNR的高吞吐量。所提出的FFT/IFFT处理器已在1.8 V电源电压下采用0.18 μ m CMOS技术设计和实现。所提出的双并行FFT/IFFT处理器在450 MHz时的吞吐量高达900 Msample/s,同时所需的硬件复杂性要小得多。
A high-speed low-complexity two-parallel radix-24 FFT/IFFT processor for UWB applications
This paper presents a high-speed, low-complexity two data-path 128-point radix-24 FFT/IFFT processor for MB-OFDM ultrawideband (UWB) systems. The proposed FFT processor uses a method for compensating the truncation error of fixed-with Booth multipliers with Dadda reduction network, which keep the input and output the 8-bit width. This method leads to reduction of truncation errors compared with direct-truncated multipliers. It provides lower hardware complexity and high throughput with almost same SQNR compared with direct-truncated Booth multipliers. The proposed FFT/IFFT processor has been designed and implemented with 0.18-mum CMOS technology in a supply voltage of 1.8 V. The proposed two-parallel FFT/IFFT processor has a throughput rate of up to 900 Msample/s at 450 MHz while requiring much smaller hardware complexity.