Journal ArticleDOI
Spectral analysis of linear digital systems using BIFORE
N. U. Ahmed,K. R. Rao +1 more
Reads0
Chats0
TLDR
In this paper, a spectral analysis of linear digital systems using BIFORE is carried out, where expressions for power and amplitude spectra of the input and output signals are developed.Abstract:
A spectral analysis of linear digital systems using BIFORE is carried out. Expressions for power and amplitude spectra of the input and output signals are developed. The frequency-sequency structure of the power spectra, which are invariant to cyclic shift of the sampled data, is analysed.read more
Citations
More filters
Journal ArticleDOI
BIFORE or Hadamard transform
TL;DR: Multidimensional BIFore transform is defined and a physical interpretation of its power spectrum is presented andvantages and as well the limitations of the BIFORE transform in its application in information processing are cited.
Journal ArticleDOI
A phase spectrum for binary fourier Representation
TL;DR: It is shown that the BIFORE and discrete Fourier phase spectra have several analogous properties and a fast algorithm which yields the BifORE power andphase spectra in approximately N log2 N arithmetic operations is developed.
Journal ArticleDOI
The Generalized Transform
TL;DR: Generalized transforms for decomposing a signal in terms of discrete orthogonal transformation are developed and general relationships for factoring the transform matrices into a product of sparse matrices are derived.
Journal ArticleDOI
Roundoff error in multidimensional generalized discrete transforms
TL;DR: In this paper, the analysis of rounding error in the one-dimensional fast Fourier transform (FFT) is extended to a class of generalized orthogonal transforms with a common fast algorithm similar to the FFT algorithm.
Journal Article
Class of discrete orthogonal transforms.
TL;DR: In this paper, a class of log 2 N discrete orthogonal transforms ranging from Walsh-Hadamard transform to discrete Fourier transform (DFT) is defined and the power spectra invariant to circular shift of the sampled data for these transforms are developed.
References
More filters
Journal ArticleDOI
Hadamard transform image coding
TL;DR: A high-speed computational algorithm, similar to the fast Fourier transform algorithm, which performs the Hadamard transformation has been developed, which provides a potential toleration to channel errors and the possibility of reduced bandwidth transmission.
Journal ArticleDOI
What is the fast Fourier transform
W.T. Cochran,J.W. Cooley,D.L. Favin,H. Helms,R. A. Kaenel,W.W. Lang,G. Maling,D.E. Nelson,C. Rader,Peter D. Welch +9 more
TL;DR: The discrete Fourier transform of a time series is defined, some of its properties are discussed, the associated fast method for computing this transform is derived, and some of the computational aspects of the method are presented.