可重构的基-2/3/22多路延迟换向器FFT架构OA
Reconfigurable Radix-2/3/22 Multi-Path Delay Commutator Fast Fourier Transform Architectures
快速傅里叶变换(fast Fourier transform,FFT)广泛应用于图像处理领域.然而,传统的FFT 在面对非2 的幂点数时,通常需要补零,这不仅浪费大量资源,还增加了处理时间.本文在 2 并行基-22多路延迟换向器架构上进行了改进,提出了一种可重构的基-2/3/22多路延迟换向器架构,可以减少50%的乘法器数量,该架构通过将相同硬件资源重构成基-2、基-3、基-22 处理单元,能够实现 1024 点内16 种长度的 FFT 运算.使用 Verilog 语言实现了该架构,实验结果表明,在使用 25 位定点数据量化时性能达到了最优,此时平均误差达到 10-4,最大误差 10-3,量化信噪比(signal to quantization noise ratio,SQNR)达到了92.19 dB.与其他文献设计相比,本文的FFT架构具有最少的乘法器资源以及最高的计算效率,具有良好的应用前景.
The fast Fourier transform(FFT)is widely used in signal processing.However,traditional FFT processing usually needs to fill zeros when dealing with non-power-of-two points,which not only wastes considerable resources but also increases the processing time.This study improved the two-parallel radix-MDC FFT architecture and developed a reconfigurable radix-MDC FFT architecture that reduced the number of multipliers by 50%.This architecture reconfigured the same hardware resources into radix-2,radix-3,and radix-22 processing units,and 16 FFT operations with 1024 points could be achieved.The architecture was implemented in Verilog.Experimental results showed that the optimum performance was achieved when using 25-bit fixed-point quantization,with an average error of 10-4,a maximum error of 10-3,and a quantization signal-to-noise ratio of 92.19 dB.Compared with other designs found in the literature,the FFT architecture developed in this study had fewer multiplier resources,the greatest computational efficiency,and good application prospects.
牟新刚;詹遇魁;周晓
武汉理工大学 机电工程学院,湖北 武汉 430070武汉理工大学 机电工程学院,湖北 武汉 430070武汉理工大学 机电工程学院,湖北 武汉 430070
信息技术与安全科学
快速傅里叶变换多路延迟换向器现场可编程门阵列
FFTMDCFPGA
《红外技术》 2026 (8)
960-968,9
评论