摘要
地址产生器是FFT处理器的主要组成部分,地址快速生成和旋转因子读取次数是它的两个重要指标,但很少有算法能够将其统一起来。本文采取了一种新的操作数地址生成顺序并构造了一种新的FFT循环级数表示方法,基于操作数地址的位倒序方式,提出了一种兼有地址简单快速生成与避免重复读取旋转因子特点的可变长地址生成方法,解决了以往地址产生时生成速度与旋转因子重复读取之间的矛盾,实现了快速和降低系统功耗的统一。
FFT is a very important algorithm in digital signal processing, and address generator is a key component of FFT
processor. Fewer delay and lower coefficient access times are two basic factors of address generator, but few algorithms can meet
both factors at the same time. In this paper, a new sequence for operators be generated and a new expression for FFT circles were
proposed. Based on bit reverse, a new type algorithm of FFT address generator was devised. With new algorithm, the read
operation of twiddles was decreased, and the addresses can be generated quickly also.
出处
《信号处理》
CSCD
2004年第3期251-257,共7页
Journal of Signal Processing
基金
航天重点预研项目资助
