Subband DFT - Part II: Accuracy, complexity and applications

A. N. Hossen, U. Heute, O. V. Shentov, S. K. Mitra

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

A new DFT computation method based on a subband decomposition described in a companion paper (Shentov et al., 1995) is investigated. The two distinct parts of the algorithm, a preprocessing Hadamard transform stage and a 'correction' stage, were interpreted as a filter-bank-plus-recombination network. This interpretation provides a better understanding of the errors caused by dropping subbands in the approximate partial-band DFT computation. In this paper we analyze the approximation errors and computational complexity of the new algorithm in partial-band DFT computation, in addition to outlining a number of its possible applications. Specifically, formulae for the approximation errors due to linear distortions and to aliasing are derived. Two new general formulae are found for the aliasing terms under different conditions; one of them gives an interesting matrix formulation for the coefficients describing the aliasing effects of all frequency bands separately. The computational complexity of the algorithm is analyzed both theoretically and in terms of running-time measurements. This concerns both the full- and partial-band analysis cases in various realization structures as introduced in Shentov et al. (1995). With these insights, the novel algorithm is compared to existing methods, especially for the computation of a limited number of frequency points. A number of application examples are included to illustrate the efficiency of the proposed method in computing approximately the DFT of signals with energies concentrated in small parts of the spectrum.

Original languageEnglish
Pages (from-to)279-294
Number of pages16
JournalSignal Processing
Volume41
Issue number3
DOIs
Publication statusPublished - 1995

Fingerprint

Discrete Fourier transforms
Computational complexity
Hadamard transforms
Filter banks
Time measurement
Frequency bands
Decomposition

Keywords

  • Adaptive FFT
  • Approximate DFT comparison
  • Discrete Fourier tranform
  • Spectral analysis
  • Subband FFT

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Software
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Subband DFT - Part II : Accuracy, complexity and applications. / Hossen, A. N.; Heute, U.; Shentov, O. V.; Mitra, S. K.

In: Signal Processing, Vol. 41, No. 3, 1995, p. 279-294.

Research output: Contribution to journalArticle

Hossen, A. N. ; Heute, U. ; Shentov, O. V. ; Mitra, S. K. / Subband DFT - Part II : Accuracy, complexity and applications. In: Signal Processing. 1995 ; Vol. 41, No. 3. pp. 279-294.
@article{216f588035094abca5edc837a0f403a4,
title = "Subband DFT - Part II: Accuracy, complexity and applications",
abstract = "A new DFT computation method based on a subband decomposition described in a companion paper (Shentov et al., 1995) is investigated. The two distinct parts of the algorithm, a preprocessing Hadamard transform stage and a 'correction' stage, were interpreted as a filter-bank-plus-recombination network. This interpretation provides a better understanding of the errors caused by dropping subbands in the approximate partial-band DFT computation. In this paper we analyze the approximation errors and computational complexity of the new algorithm in partial-band DFT computation, in addition to outlining a number of its possible applications. Specifically, formulae for the approximation errors due to linear distortions and to aliasing are derived. Two new general formulae are found for the aliasing terms under different conditions; one of them gives an interesting matrix formulation for the coefficients describing the aliasing effects of all frequency bands separately. The computational complexity of the algorithm is analyzed both theoretically and in terms of running-time measurements. This concerns both the full- and partial-band analysis cases in various realization structures as introduced in Shentov et al. (1995). With these insights, the novel algorithm is compared to existing methods, especially for the computation of a limited number of frequency points. A number of application examples are included to illustrate the efficiency of the proposed method in computing approximately the DFT of signals with energies concentrated in small parts of the spectrum.",
keywords = "Adaptive FFT, Approximate DFT comparison, Discrete Fourier tranform, Spectral analysis, Subband FFT",
author = "Hossen, {A. N.} and U. Heute and Shentov, {O. V.} and Mitra, {S. K.}",
year = "1995",
doi = "10.1016/0165-1684(94)00104-8",
language = "English",
volume = "41",
pages = "279--294",
journal = "Signal Processing",
issn = "0165-1684",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Subband DFT - Part II

T2 - Accuracy, complexity and applications

AU - Hossen, A. N.

AU - Heute, U.

AU - Shentov, O. V.

AU - Mitra, S. K.

PY - 1995

Y1 - 1995

N2 - A new DFT computation method based on a subband decomposition described in a companion paper (Shentov et al., 1995) is investigated. The two distinct parts of the algorithm, a preprocessing Hadamard transform stage and a 'correction' stage, were interpreted as a filter-bank-plus-recombination network. This interpretation provides a better understanding of the errors caused by dropping subbands in the approximate partial-band DFT computation. In this paper we analyze the approximation errors and computational complexity of the new algorithm in partial-band DFT computation, in addition to outlining a number of its possible applications. Specifically, formulae for the approximation errors due to linear distortions and to aliasing are derived. Two new general formulae are found for the aliasing terms under different conditions; one of them gives an interesting matrix formulation for the coefficients describing the aliasing effects of all frequency bands separately. The computational complexity of the algorithm is analyzed both theoretically and in terms of running-time measurements. This concerns both the full- and partial-band analysis cases in various realization structures as introduced in Shentov et al. (1995). With these insights, the novel algorithm is compared to existing methods, especially for the computation of a limited number of frequency points. A number of application examples are included to illustrate the efficiency of the proposed method in computing approximately the DFT of signals with energies concentrated in small parts of the spectrum.

AB - A new DFT computation method based on a subband decomposition described in a companion paper (Shentov et al., 1995) is investigated. The two distinct parts of the algorithm, a preprocessing Hadamard transform stage and a 'correction' stage, were interpreted as a filter-bank-plus-recombination network. This interpretation provides a better understanding of the errors caused by dropping subbands in the approximate partial-band DFT computation. In this paper we analyze the approximation errors and computational complexity of the new algorithm in partial-band DFT computation, in addition to outlining a number of its possible applications. Specifically, formulae for the approximation errors due to linear distortions and to aliasing are derived. Two new general formulae are found for the aliasing terms under different conditions; one of them gives an interesting matrix formulation for the coefficients describing the aliasing effects of all frequency bands separately. The computational complexity of the algorithm is analyzed both theoretically and in terms of running-time measurements. This concerns both the full- and partial-band analysis cases in various realization structures as introduced in Shentov et al. (1995). With these insights, the novel algorithm is compared to existing methods, especially for the computation of a limited number of frequency points. A number of application examples are included to illustrate the efficiency of the proposed method in computing approximately the DFT of signals with energies concentrated in small parts of the spectrum.

KW - Adaptive FFT

KW - Approximate DFT comparison

KW - Discrete Fourier tranform

KW - Spectral analysis

KW - Subband FFT

UR - http://www.scopus.com/inward/record.url?scp=0029253688&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029253688&partnerID=8YFLogxK

U2 - 10.1016/0165-1684(94)00104-8

DO - 10.1016/0165-1684(94)00104-8

M3 - Article

AN - SCOPUS:0029253688

VL - 41

SP - 279

EP - 294

JO - Signal Processing

JF - Signal Processing

SN - 0165-1684

IS - 3

ER -