Skip to main content
SpringerLink
Log in

Decomposition of the Hadamard matrices and fast Hadamard transform

  • Poster Session I
  • Conference paper
  • First Online:
Computer Analysis of Images and Patterns (CAIP 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1296))

Included in the following conference series:

Abstract

It is well known, that the classical algorithm of the Walsh-Hadamard fast transform needs only n log2 n additions moreover n is a power of two. A problem of decomposition of Hadamard matrices of arbitrary order n, n - 0(mod4) by orthogonal (-1, +1)-vectors of size k is investigated in this paper. An algorithm of the Hadamard fast transform which needs only \(nlog_2 k + n(\tfrac{n}{k} - 1)\) addition operations and in some cases is more efficient than the classical algorithm is proposed.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Seberry J., Yamada M. Hadamard matrices, sequences and block designs. Surveys in Contemporary Designs Theory, Wiley-Interscience Series in Discrete Mathematics. Jhon Wilay, New York, 1992.

    Google Scholar 

  2. Agaian S.S., Sarukhanian A.G. Recurrent formulae of the construction Williamson type matrices. Math. Notes, vol. 30, No. 1, 1981, p. 603–617.

    Google Scholar 

  3. Agaian S.S., Hadamard matrices and their applications, Lecture Notes in Math., Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, No. 1168,1985, p. 227.

    Google Scholar 

  4. Craigen R., Seberry J., Zhang X. Product of four Hadamard matrices. J. Comb. Theory, ser. A, 59, 1992, p. 318–320.

    Google Scholar 

  5. Agayan S.S., Sarukhanyan H.G. Hadamard matrices representation by (-1,+1)-vectors. Int. conference dedicated to Hadamard problem centenary, Australia, 1993, 1p.

    Google Scholar 

  6. Beauchamp K.R. Walsh functions and their applications. Academic Press, London, New York, Francisco, 1975.

    Google Scholar 

  7. Ahmed N., Rao K.R. Orthogonal transforms for digital signal processing. SpringerVerlag, Berlin, Heidelberg, New York, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Informatics and Automation Problems NAS, P.Sevak 1, 375044, Yerevan, Republic of Armenia

    Hakob G. Sarukhanyan

Authors
  1. Hakob G. Sarukhanyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerald Sommer Kostas Daniilidis Josef Pauli

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sarukhanyan, H.G. (1997). Decomposition of the Hadamard matrices and fast Hadamard transform. In: Sommer, G., Daniilidis, K., Pauli, J. (eds) Computer Analysis of Images and Patterns. CAIP 1997. Lecture Notes in Computer Science, vol 1296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63460-6_165

Download citation

  • DOI: https://doi.org/10.1007/3-540-63460-6_165

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63460-7

  • Online ISBN: 978-3-540-69556-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation