Abstract
The discrete Fourier transform of a set of data, say x 0, x 1,…, x N -1 is given by the transform coefficients X 0, X 1,…, X N -1 by the relation
where \( W = {e^{{ - j\frac{{2\pi }}{N}}}} \) In symbolic form, (100) can be written as
and the inverse transform as
where ‘*’ denotes conjugation, and a typical entry, a ik , in A N is given by
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Yarlagadda, R.K.R., Hershey, J.E. (1997). The Fast Fourier Transform and the Hadamard Transform. In: Hadamard Matrix Analysis and Synthesis. The Springer International Series in Engineering and Computer Science, vol 383. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6313-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6313-6_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7898-3
Online ISBN: 978-1-4615-6313-6
eBook Packages: Springer Book Archive