z-transform DFT filters and FFT's

G. Bruun

    Research output: Contribution to journalJournal articleResearchpeer-review

    1299 Downloads (Pure)

    Abstract

    The paper shows how discrete Fourier transformation can be implemented as a filter bank in a way which reduces the number of filter coefficients. A particular implementation of such a filter bank is directly related to the normal complex FFT algorithm. The principle developed further leads to types of DFT filter banks which utilize a minimum of complex coefficients. These implementations lead to new forms of FFT's, among which is acos/sinFFT for a real signal which only employs real coefficients. The new FFT algorithms use only half as many real multiplications as does the classical FFT.
    Original languageEnglish
    JournalIEEE Transactions on Acoustics, Speech, and Signal Processing
    Volume26
    Issue number1
    Pages (from-to)56-63
    ISSN0096-3518
    DOIs
    Publication statusPublished - 1978

    Bibliographical note

    Copyright: 1978 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

    Fingerprint

    Dive into the research topics of 'z-transform DFT filters and FFT's'. Together they form a unique fingerprint.

    Cite this