Parallel vector multidimensional slant, Haar, and Walsh-Hadamard transforms | Multidimensional Systems and Signal Processing Skip to main content
Log in

Parallel vector multidimensional slant, Haar, and Walsh-Hadamard transforms

  • Communication Briefs
  • Published:
Multidimensional Systems and Signal Processing Aims and scope Submit manuscript

Abstract

A new factorization for the slant matrix is developed. The structure of the proposed slant algorithm based on the new factorization is suitable for vector and parallel processing of one- and two-dimensional slant transforms. A unified approach to compute the Walsh-Hadamard, Haar, and slant transforms is presented. Multitasking with four processors is implemented to improve the speed performance of two-dimensional transforms. Simulation results on CRAY X-MP/48 using single-processor and multiprocessors are also included.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. William K. Pratt, “Slant Transform Image Coding,”IEEE Trans. Comm., vol. Com-22, 1974.

  2. M. El-Sharkawy, W. Tsang, and M. Aburdene, “Parallel Vector Processing of Multidimensional Orthogonal Transforms for Digital Signal Processing Applications,”Multidimensional Systems Signal Process., vol. 1, 1990, pp. 199–216.

    Article  Google Scholar 

  3. M. El-Sharkawy, W. Tsang, and M. Aburdene, “Parallel Hadamard Transform with Transputers,”Int. J. Mini Microcomputers, vol. 12, 1990, pp. 20–24.

    Google Scholar 

  4. Harry C. Andrews,Computer Techniques in Image Processing, New York: Academic Press, 1970.

    Google Scholar 

  5. Bernard J. Fino, “A Unified Treatment of Discrete Fast Unitary Transforms,”SIAM J. Comput., vol. 6, 1977.

  6. M. El-Sharkawy, W. Tsang, and M. Aburdene, “Vector Processing of Orthogonal Transforms for Digital Signal Processing Application,”Proc. 1989 Summer Computer Simulation Conf., 1989, pp. 203–210.

  7. Paul N. Swarztrauber, “FFT Algorithms for Vector Computers,”Parallel Computing, 1984, pp. 45–63.

  8. David G. Korn, “Computing the Fast Fourier Transform on a Vector Computer,”Math. Comp. vol. 33, 1979, pp. 977–992.

    Google Scholar 

  9. Ramesh C. Agarwal and James W. Cooley, “Vectorized Mixed Radix Discrete Fourier Transform Algorithms,”Proc. IEEE, vol. 75, 1987.

  10. W.P. Petersen, “Vector FORTRAN for Numerical Problems on CRAY-1,”Comm. ACM, vol. 26, 1983.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work is supported in part by the National Science Foundation, Pittsburgh Supercomputing Center and by the PEW Science Education Program.

Rights and permissions

Reprints and permissions

About this article

Cite this article

El-Sharkawy, M., Aburdene, M. & Tsang, W. Parallel vector multidimensional slant, Haar, and Walsh-Hadamard transforms. Multidim Syst Sign Process 3, 409–419 (1992). https://doi.org/10.1007/BF01940233

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01940233

Key Words

Navigation