DocumentCode
1113102
Title
Fast Hardware Fourier Transformation Through Counting
Author
Zohar, Shalhav
Author_Institution
Jet Propulsion Laboratory, California Institute of Technology
Issue
5
fYear
1973
fDate
5/1/1973 12:00:00 AM
Firstpage
433
Lastpage
441
Abstract
Hardware Fourier transformations are considered with the goal of increasing speed through parallel operation. Two designs in which the basic element is a fast counter are developed. One is applicable when the number of transformed points N is prime while the other, requiring somewhat more hardware, is applicable to all N.
Keywords
Fast Fourier transformation for batches of arbitrary size, hardware Fourier transformation, high-precision Fourier transformation, relation of Fourier transformation to Hankel matrices, sign flipping in radix (−2), speedup through parallel computation.; Algorithm design and analysis; Concurrent computing; Costs; Counting circuits; Discrete Fourier transforms; Fast Fourier transforms; Hardware; Libraries; Propulsion; Space technology; Fast Fourier transformation for batches of arbitrary size, hardware Fourier transformation, high-precision Fourier transformation, relation of Fourier transformation to Hankel matrices, sign flipping in radix (−2), speedup through parallel computation.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1973.223745
Filename
1672338
Link To Document