| 摘要: |
| 针对简化核函数FFT能提高FFT运算速度却引入一定频谱杂散的问题，讨论了其运算复
杂度和动态性能的优化方法。首先推导简化核函数Cooley-Tukey FFT算法的运算量公式，
给出不同简化点数下的运算量比较；然后通过仿真分析了不同核函数简化点数的频谱杂散分
布
规律；最后综合评价不同简化点数的运算时间和瞬时动态性能。所得结论对宽带数字接收机
的性能优化有一定指导意义。 |
| 关键词: 宽带数字接收机 实时数据处理 简化核函数 运算复杂度 瞬
时动态 优化设计 |
| DOI： |
|
| 基金项目: |
|
| Optimization between computation complexity and dynamic range of FFT with simplified kernel function |
| BI Ting-feng,ZHOU Tao,LI Tao |
| () |
| Abstract: |
| FFT（Fast Fourier Transform） with simplified kernel function can speed up compu
tation but cause
certain frequency spurs. Therefore optimization method between its computation
complexity and dynamic range is discussed. The formula on computation quantity o
f simplified FFT is derived based on Cooley-Tukey algorithm, and computation qu
antity of FFT with different simplified points is also compared. Based on simula
tion, frequency spur′s distribution of simplified FFT is analysed. The computat
ion period and instantaneous dynamic range concerning different simplified point
s are then evaluated. The conclusion is useful for wideband digital receiver′s
o
ptimal design. |
| Key words: wideband digital receiver real-time data processing simplified kernel function computation complexity instantaneous dyn
amic range optimal design |
