检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《微电子学与计算机》2007年第3期15-19,共5页Microelectronics & Computer
摘 要:提出一种基于存储器交织架构的FFT处理器设计方法,并且针对基-8FFT提出一种无冲突地址生成算法,数据按帧进行操作。每个存储器均划分为8个独立的存储体,通过对循环移位寄存器译码,蝶式运算单元并行无冲突读写操作数,8通道输入数据进行并行的复数乘法运算。每级运算引入完全流水,减少了运算的时钟周期开销,同时推导出局部流水线设计必须满足的不等式条件。输入、输出存储器采用乒乓操作,按帧轮换,FFT运算连续输入、输出,采样频率与系统工作频率一致,具有很好的实时性,运算精度通过块浮点得到保证。该设计方法可以扩展至基-16FFT处理器设计。In this paper, memory architecture based FIT processor design methodology is presented. An efficient implementation of conflict free address generation for radix-8 algorithm is realized. Every RAM is interleaved with 8 blocks. The circulation registers are introduced and the decoding result in the conflict free addressing. Parallel processing is acquired when the butterfly elements access 8 data in a cycle. By means of pipeline in every stage, the computing is efficient in cycles. The design specification of local pipeline is also presented. With the ping-pong RAM operation in the interface module, the output data could be get continuously. By introducing the block floating point module, high accuracy is acquired without much hardware penalty. This methodology is also applicable for radix-16 FFT memory conffict free access.
关 键 词:快速傅立叶变换 存储器交织 无冲突地址生成 高基 固定基
分 类 号:TN431.2[电子电信—微电子学与固体电子学] TN911.72
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117