Persistent Link:
http://hdl.handle.net/10150/606690
Title:
Permutation and Circuland Matrices and the Fast Fourier Transform
Author:
Heenan, N. I.
Affiliation:
The Mitre Corporation
Issue Date:
1969-09
Rights:
Copyright © International Foundation for Telemetering
Collection Information:
Proceedings 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.
Publisher:
International Foundation for Telemetering
Journal:
International Telemetering Conference Proceedings
Abstract:
This 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.
Sponsors:
International Foundation for Telemetering
ISSN:
0884-5123; 0074-9079
Additional Links:
http://www.telemetry.org/

Full metadata record

DC FieldValue Language
dc.language.isoen_USen
dc.titlePermutation and Circuland Matrices and the Fast Fourier Transformen_US
dc.contributor.authorHeenan, N. I.en
dc.contributor.departmentThe Mitre Corporationen
dc.date.issued1969-09en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.description.collectioninformationProceedings 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.en
dc.publisherInternational Foundation for Telemeteringen
dc.description.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.en
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/606690en
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.typetexten
dc.typeProceedingsen
dc.relation.urlhttp://www.telemetry.org/en
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.