{"title":"变长基数4 FFT的数字反转电路","authors":"Seung-Ho Ok, Byungin Moon","doi":"10.1109/FGCN.2007.7","DOIUrl":null,"url":null,"abstract":"When the fast Fourier transform (FFT) is executed using an in-place method, the input or output data must be accessed in a digit-reversed order. The previous digit reversal circuits, which are based on a binary counter, require complex multiplexers. This paper proposes a new digit reversal circuit based on two-bit counter modules for the variable-length radix-4 FFT. This circuit can be designed with minimal multiplexers, and thus can efficiently generate digit-reversed sequences compared with digit reversal circuits based on a binary counter.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Digit Reversal Circuit for the Variable-Length Radix-4 FFT\",\"authors\":\"Seung-Ho Ok, Byungin Moon\",\"doi\":\"10.1109/FGCN.2007.7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When the fast Fourier transform (FFT) is executed using an in-place method, the input or output data must be accessed in a digit-reversed order. The previous digit reversal circuits, which are based on a binary counter, require complex multiplexers. This paper proposes a new digit reversal circuit based on two-bit counter modules for the variable-length radix-4 FFT. This circuit can be designed with minimal multiplexers, and thus can efficiently generate digit-reversed sequences compared with digit reversal circuits based on a binary counter.\",\"PeriodicalId\":254368,\"journal\":{\"name\":\"Future Generation Communication and Networking (FGCN 2007)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Future Generation Communication and Networking (FGCN 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FGCN.2007.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Communication and Networking (FGCN 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FGCN.2007.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Digit Reversal Circuit for the Variable-Length Radix-4 FFT
When the fast Fourier transform (FFT) is executed using an in-place method, the input or output data must be accessed in a digit-reversed order. The previous digit reversal circuits, which are based on a binary counter, require complex multiplexers. This paper proposes a new digit reversal circuit based on two-bit counter modules for the variable-length radix-4 FFT. This circuit can be designed with minimal multiplexers, and thus can efficiently generate digit-reversed sequences compared with digit reversal circuits based on a binary counter.