Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

A Simple Method for Determining Hadamard Sequency Vectors

Published: 01 June 1988 Publication History

Abstract

A simple method for determining the sequency ordering of any row in any Hadamard matrix directly from its binary representation is developed. This proposed method is proved to be much simpler than the well-known bit-reverse inverse Gray code method.

References

[1]
{1} R. Lackey and D. Meltzer, "A simplified definition of the Walsh functions," IEEE Trans. Comput., vol. C-20, pp. 211-213, Feb. 1971.
[2]
{2} D. Cheng and J. Liu, "An algorithm for sequency ordering of Hadamard function," IEEE Trans. Comput., vol. C-26, pp. 308- 309, Mar. 1977.
[3]
{3} S. Srihari and M. Ohanesian, "An efficient algorithm for determining Hadamard sequency vector," IEEE Trans. Comput., vol. C-28, pp. 243-244, Mar. 1979.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers
IEEE Transactions on Computers  Volume 37, Issue 6
June 1988
136 pages

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 June 1988

Author Tags

  1. Hadamard matrix
  2. Hadamard sequency vectors
  3. binary representation
  4. codes.
  5. sequency ordering

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024

Other Metrics

Citations

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media