Optimized 4-Parallel 1024-Point MSC FFT

被引:0
作者
Kaya, Zeynep [1 ]
Garrido, Mario [2 ]
机构
[1] Bilecik Seyh Edebali Univ, Osmaneli Vocat Sch, Dept Elect & Energy, TR-11500 Bilecik, Turkiye
[2] Univ Politecn Madrid, ETSI Telecomunicac, Dept Elect Engn, Madrid 28040, Spain
来源
IEEE ACCESS | 2024年 / 12卷
关键词
MSC; FFT; parallel pipeline; matrix transposition; shift-and-add; ARCHITECTURE; ALGORITHM;
D O I
10.1109/ACCESS.2024.3414928
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a 4-parallel 1024-point multi-path delay commutator (MSC) fast Fourier transform (FFT) architecture. The aim of this work is to provide multiple optimizations of this type of FFT at the architectural level. This results in a highly optimized FFT architecture that uses significantly fewer resources than previous ones. One advantage of the proposed approach is that it uses two identical processing modules, which simplifies the development of architecture. Between the modules, instead of permutation circuits, we use matrix transposition with memories, which results in a more compact and hardware-efficient solution. Additionally, a tailor-made design of the rotations and the application of shift-and-add techniques lead to a reduction in their number and complexity. Experimental results show that the proposed architecture requires significantly fewer hardware components than previous comparable parallel pipeline FFT architectures.
引用
收藏
页码:84110 / 84121
页数:12
相关论文
共 45 条
  • [1] Andersson R., 2014, M.S. thesis
  • [2] Using Rotator Transformations to Simplify FFT Hardware Architectures
    Andersson, Rikard
    Garrido, Mario
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2020, 67 (12) : 4784 - 4793
  • [3] An Area Efficient 1024-Point Low Power Radix-22 FFT Processor With Feed-Forward Multiple Delay Commutators
    Ba, Ngoc Le
    Kim, Tony Tae-Hyoung
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2018, 65 (10) : 3291 - 3299
  • [4] Bautista V. M., 2023, P 38 C DES CIRC INT, P61
  • [5] Serial Butterflies for Non-Power-of-Two FFT Architectures in 5G and Beyond
    Bautista, Victor Manuel
    Garrido, Mario
    Lopez-Vallejo, Marisa
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2023, 70 (10) : 3992 - 4003
  • [6] An Efficient VLSI Architecture for Normal I/O Order Pipeline FFT Design
    Chang, Yun-Nan
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2008, 55 (12) : 1234 - 1238
  • [7] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES
    COOLEY, JW
    TUKEY, JW
    [J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &
  • [8] Radix-2k MSC FFT Architectures
    Deng, Guang-Ting
    Garrido, Mario
    Chen, Sau-Gee
    Huang, Shen-Jui
    [J]. IEEE ACCESS, 2023, 11 : 81497 - 81510
  • [9] INDEX TRANSFORMATION ALGORITHMS IN A LINEAR ALGEBRA FRAMEWORK
    EDELMAN, A
    HELLER, S
    JOHNSSON, SL
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (12) : 1302 - 1309
  • [10] Optimised Serial Commutator FFT Architecture in Terms of Multiplexers
    Fang, Hongji
    Ma, Zhenguo
    Yu, Feng
    Zhao, Bei
    Zhang, Bo
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2024, 71 (01) : 445 - 449