摘要
从素基数DFT出发,应用数论理论讨论了一种应用二阶递归滤波结构的算法及零因子转换算法(ZFT).由于该算法退化为应用一阶递归滤波器结构,且递归系数为正负1,从而可使在递归循环内不用乘法器,只用廉价的TTL电路进行加法及延时运算便可实现.为提高精度,采用了并联校正网络,在实现高精度转换的同时并不影响运算速度.已在实验室建立了一个31点硬件实验系统,所得到的实验结果令人满意.
Based on the prime radix DFT and number theory,an algorithm using the second order recursive filter and the zero factor prime radix Fourier Transform (ZFT) is presented. Since the algorithm has reduced to a structure of the first order recursive filter and the recursive coefficient is±1, it will be possible that no multiplier is required in the loop and only the cheeper TTL circuits are employed. To increase the accuracy, the parallel correction network is adopted, with which both the precision and the calculating speed can be improved. A 31-point hardware system has been built in the laboratory and the experimental results obtained are satisfactory.
关键词
滤波
素数
傅里叶变换
转移函数
filtering
prime number
transfer function
fourier transform
