采用异步实现的快速傅里叶变换处理器  

An Asynchronous Implementation of Fast Fourier Transform Processor

作　　者：赵冰[1] 仇玉林[1] 吕铁良[1] 黑勇[1] 

机构地区：[1]中国科学院微电子研究所,北京100029

出　　处：《微电子学》2006年第4期396-399,共4页Microelectronics

基　　金：国家自然科学基金资助项目(90307004)

摘　　要：介绍一种采用异步实现结构的快速傅里叶变换处理器,该处理器的控制采用本地握手信号取代传统的系统时钟。给出了处理器中异步加法器的电路结构,设计了一个采用Booth译码Wallace tree结构的异步乘法器。通过对一个8点的异步快速傅里叶变换处理器进行电路仿真,得到该处理器完成一次变换的平均响应时间为31.15 ns,仅为最差响应时间42.85 ns的72.7%。可见,采用异步方式的快速傅里叶变换处理器在性能方面较同步处理器存在优势。A novel asynchronous implementation of fast Fourier transform （FFT） processor is described. The asynchronous FFT processor controls the sequence of logic circuits by local handshake signals, instead of the globe clock. Circuits of asynchronous adder are proposed, An asynchronous multiplier using booth decode and based on Wallace tree architecture is designed, Results of the performance analysis of an 8-point asynchronous FFT processor show that the average case response time, which is 31.15 ns, is only 72.7% of the worst-case response time, which is 42, 85 ns, for completing a transform. It reveals that the asynchronous FFT processor has some performance advantages than the synchronous one.

关 键 词：异步集成电路 异步数据通路 异步乘法器 快速傅里叶变换 

分 类 号：TN402[电子电信—微电子学与固体电子学]