Journal ArticleDOI
Subband DFT—part II: accuracy, complexity and applications
Reads0
Chats0
TLDR
This paper analyzes 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 and compared to existing methods.About:
This article is published in Signal Processing.The article was published on 1995-02-01. It has received 24 citations till now. The article focuses on the topics: Aliasing (computing) & Discrete Fourier transform.read more
Citations
More filters
Book
Introduction to Wavelets and Wavelet Transforms: A Primer
TL;DR: This work describes the development of the Basic Multiresolution Wavelet System and some of its components, as well as some of the techniques used to design and implement these systems.
Journal ArticleDOI
Subband decomposition soft-decision algorithm for heart rate variability analysis in patients with obstructive sleep apnea and normal controls
TL;DR: A new method for screening of obstructive sleep apnea (OSA) is investigated, based on the estimation of the energy distribution of the R-R interval (RRI) signals in the time domain, which results in the best classification accuracy approaches 93% using the LF/VLF ratio.
Journal ArticleDOI
Power spectral density estimation via wavelet decomposition
TL;DR: In this article, a soft decision algorithm for wavelet decomposition, in which a probability measure is assigned to each frequency band bearing energy, is used as an approximate estimator of power spectral density.
References
More filters
The fast Fourier Transform
TL;DR: A computer algorithm that computes the discrete Fourier transform much faster than other algorithms, is explained and examples and detailed procedures are provided to assist the reader in learning how to use the algorithm.
Journal Article
FFT pruning
TL;DR: It is shown that for situations in which the relative number of zero-valued samples is quite large, significant time-saving can be obtained by pruning the FFT algorithm.
Journal ArticleDOI
On computing the split-radix FFT
TL;DR: This paper presents an efficient Fortran program that computes the Duhamel-Hollmann split-radix FFT, which seems to require the least total arithmetic of any power-of-two DFT algorithm.
Journal ArticleDOI
Pruning the decimation-in-time FFT algorithm with frequency shift
TL;DR: A new pruning method is proposed here which invloves frequency shift and simplifies the pruning algorithm because its flowgraph has a repetitive pattern of butterflies between adjacent stages.