Computational Arrays for the Discrete Fourier Transform

Johnsson, Lennart and Cohen, Danny (1981) Computational Arrays for the Discrete Fourier Transform. Technical Report. California Institute of Technology. [CaltechCSTR:1981.4168-tr-81]

Full text available as:

	Other (Adobe PDF (1.1MB))
	Postscript - Requires a viewer, such as GhostView

Abstract

A mathematical approach towards the development of computational arrays for the Discrete Fourier Transform (DFT) is pursued in this paper. Mathematical expressions for the DFT are given a direct hardware interpretation. Different implementations are developed by formal manipulation of the equations defining the DFT. Properties of the implementations can be told directly from the corresponding equations. Special consideration is given to the performance of implementations and corresponding hardware requirements. The standard equations defining the DFT on N values corresponds if the equations are given a direct hardware interpretation to an Implementation requiring N to the power of 2 modules. By formal manipulation of the equations defining the DFT we develop implementations requiring N and Log subscript2N modules respectively.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	459
Deposited By:	Caltech Library System
Deposited On:	27 November 2002
Record Number:	CaltechCSTR:1981.4168-tr-81
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1981.4168-tr-81
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record