For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Minimum-Latency Linear Array FFT Processor for Robotics
Somchai KITTICHAIKOONKIT Michitaka KAMEYAMA
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1993/06/25
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Speech Processing
FFT, correlation, robotics, minimum latency, linear array processor,
Full Text: PDF(629.9KB)>>
In the applications of the fast Fourier transform (FFT) to real-world computation such as robot vision, high-speed processing with small latency is an important issue. In this paper, we propose a linear array processor for the minimum-latency FFT computation. The processor is constructed by identical butterfly elements (BE's). The key concept to minimize the latency is that each BE generates its output data immediately after its input data become available, with 100% utilization of its arithmetic unit. We also introduce the real-valued FFT to perform the complex-valued FFT. We utilize a double linear array structure so that the parallel processing can be realized without communication between the linear arrays. As a result, the hardware amount of a single BE is reduced to half that of conventional designs. The latency of the proposed FFT processor is greatly reduced in comparison with conventional linear array FFT processors.