Date of Award
Spring 1976
Document Type
Thesis
Department
Electrical & Computer Engineering
Committee Director
J. W. Stoughton
Committee Member
William D. Stanley
Call Number for Print
Special Collections; LD4331.E53G46
Abstract
The matrix transformation relating the sequency and frequency domains is derived. It is shown that these frequency-to-frequency conversion can be performed via a computationally efficient sparse matrix algorithm. The sequency-to-frequency algorithm can be used with a fast Hadamard transform to implement a discrete Fourier trans form. The efficiencies of this combined algorithm and a radix-two fast Fourier transform are compared.
The algorithm is applied to the sequency domain de sign of a Wiener digital filter. Improved computational efficiencies are achieved relative to the procedure developed by Kahveci and Hall (9).
Rights
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
DOI
10.25777/z041-m843
Recommended Citation
Gerheim, Albert P..
"An Efficient DFT Algorithm Using the Walsh Transform"
(1976). Thesis, Old Dominion University, DOI: 10.25777/z041-m843
https://digitalcommons.odu.edu/ece_etds/602
Included in
Computational Engineering Commons, Electrical and Computer Engineering Commons, Theory and Algorithms Commons