.png){kind=icon}
返回
Efficient Circuit for Parallel Bit Reversal
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2015.2504943.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Bit reversal is an essential part of the fast Fourier transform (FFT). However, compared to the amount of works on FFT architectures, far fewer works are dedicated to bit-reversal circuits until recent years. In this brief, the minimum latency and memory required for calculating the bit reversal of continuous-flow parallel data are formulated. The formulas are generic for all power of two parallelism, including the serial bit reversal. Furthermore, an efficient circuit for calculating the parallel bit reversal is proposed. The circuit not only achieves the lowest latency but also uses the minimum memory. This is achieved by breaking the bit-reversal permutation into two subpermutations, which are implemented by a sub-bit-reversal module and a group of P buffer banks. In addition, two commutators are adopted to access the P buffer banks efficiently. The proposed circuit is simple and efficient for reordering the output samples of parallel pipelined FFT processors.
Keyword:
Bit-reversal circuit
fast Fourier transform (FFT)
parallel pipelined architecture
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
AB initio electron density analysis of β-fluoroethyl anion: The non-importance of anionic fluorine hyperconjugation.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏
Facile Utilization of Carbon Dioxide for the Esterification of Potassium Lactate to Butyl Lactate二氧化碳在乳酸钾酯化为乳酸丁酯中的简易利用
PREAI
分享收藏
查看更多内容