A Digit Reversal Circuit for the Variable-Length Radix-4 FFT

Seung-Ho Ok, Byungin Moon
{"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}
引用次数: 4

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.
变长基数4 FFT的数字反转电路
当使用就地方法执行快速傅里叶变换(FFT)时,必须以数字倒序访问输入或输出数据。以前的数字反转电路是基于二进制计数器的,需要复杂的多路复用器。针对变长基数4 FFT,提出了一种基于2位计数器模块的数字反转电路。与基于二进制计数器的数字反转电路相比,该电路可以用最少的复用器设计,从而有效地生成数字反转序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信