Permutation and Circuland Matrices and the Fast Fourier Transform
AuthorHeenan, N. I.
AffiliationThe Mitre Corporation
MetadataShow full item record
RightsCopyright © International Foundation for Telemetering
Collection InformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.
AbstractThis paper provides a description of the Fast Fourier Transform and its connection with the circulant and permutation matrices. It is written for the case where the number of discrete time samples is equal to the number of discrete frequency samples but is otherwise not restricted. The paper demonstrates that since the modal matrix of a permutation matrix contains only one bit of information, the evaluation of the discrete Fourier Transform involves considerably fewer than N² multiplications where N is the number of samples involved and is also the order of the matrices involved.
SponsorsInternational Foundation for Telemetering