可变2n点流水线FFT处理器的设计与实现

Design and Implementation of a Pipeline Processor for Various-Size FFTs

  • 摘要: 设计一种可以连续计算N点复数序列傅里叶变换(FFT)的流水线结构处理器,其序列长度N(为2的幂)可变.流水线结构由乒乓存储器将基本运算模块级联而成,对输入数据的顺序以及流水运算的级数加以控制便可计算不同长度序列FFT.给出了由序列长度控制输入数据倒序、旋转因子寻址以及数据输出的实现方法.数据采用块浮点表示,提高了运算精度.用硬件描述语言VHDL在寄存器传输级(RTL级)进行描述,并在单片FPGA上实现.该芯片可工作在80MHz,连续计算时,处理长度为1024点的序列仅需12.8μs.

     

    Abstract: A pipeline processor which may compute various 2n points FFT is proposed for continuously performing complex points fast Fourier transforms (FFTs). The processor consists of several stages of butterfly computational elements connected with ping-pang RAMs that reorder the data between the butterfly stages. By properly ordering the input data to the pipeline and addressing the twiddle factors ROM, and by controlling the stage's operating status, it is shown that any FFT whose sizes are powers of the pipeline's radix can be performed. Using block-floating point arithmetic, the processor can provide a high quality. The design is written in VHDL at RTL level, and implemented on a single FPGA chip. The processor can operate at (80 MHz,) and compute a 1 024 complex points FFT in 12.8 μs when operating continuously.

     

/

返回文章
返回
Baidu
map