Orthogonal Transforms for Digital Signal Processing

  title={Orthogonal Transforms for Digital Signal Processing},
  author={Kamisetty Ramamohan Rao and Nasir Ahmed},
  journal={IEEE Transactions on Systems, Man, and Cybernetics},
  • K. Rao, N. Ahmed
  • Published 1979
  • Computer Science
  • IEEE Transactions on Systems, Man, and Cybernetics
A tutorial-review paper on discrete orthogonal transforms and their applications in digital signal and image (both monochrome and color) processing is presented. [] Key Method Efficient algorithms for fast implementation of these transforms based on matrix partitioning or matrix factoring are presented.

Figures and Tables from this paper

Multichannel transforms for signal/image processing
The discrete-time one-dimensional multichannel transforms proposed in this paper are related to two-dimensional single-channel transforms, notably to the discrete Fourier transform (DFT) and to the DHT.
Transform Coding of Signals with Bounded Finite Differences: from Fourier to Walsh, to Wavelets
A unified approach is presented for deriving upper bounds of spectra of orthogonal transforms on classes of input signals with bounded first and second order finite differences to select the significant transform coefficient packets a priori and compute the maxima of mean-square errors of reconstruction for a given compression ratio.
Orthogonal Discrete Fourier and Cosine Matrices for Signal Processing
Interestingly, the Reverse Jacket Transform(RJT) matrix has a strong geometric structure that reveals a circulant expansion and contraction properties from a basic 2x2 sparse matrix.
Transform-domain adaptive filters: an analytical approach
  • F. Beaufays
  • Computer Science
    IEEE Trans. Signal Process.
  • 1995
The effects of the preprocessing performed in DFT-L MS and DCT-LMS for first-order Markov inputs are analyzed and it is shown that for Markov-1 inputs of correlation parameter /spl rho//spl isin/[0,1], the eigenvalue spread after DFT and power normalization tends to (1+/ spl rho/)l as the size of the filter gets large.
This paper presents a convolution formula for some selected discrete orthogonal transforms (DOT) and shows how to compute convolution using LaSalle's inequality.
Coshar transform
Discrete Orthogonal Multi-transform on Chip (DOMoC)
Two kinds of architectures to perform multiple N-point 1D-discrete orthogonal transforms on single chip are proposed, FFT parallel architecture based and matrix-vector multiplier based.
Upper bounds of wavelet spectra on the class of discrete Lipschitzian signals
These estimates allow not only to a priori select the wavelet coefficient packets that have minimum input in signal reconstruction, but also to compute the maximum mean-square errors of reconstruction for a particular compression ratio and to analyze efficacy of different wavelets based on that criterion.
The Haar-Wavelet Transform in Digital Image Processing: Its Status and Achievements
It is presented that two-dimensional both, the Haar and wavelets functions products man be treated as extractors of particular image features and shown that some coefficients from both spectra are proportional, which s slightly computations and analyses.