Close category search window
 

Natural, Dyadic, and Sequency Order Algorithms and Processors for the Walsh-Hadamard Transform

Full text access may be available

To access full text, please use your member or institutional sign in.


This paper appears in:
Computers, IEEE Transactions on
Date of Publication: May 1977
Author(s): Geadah, Y.A.
Bell-Northern Research
Corinthios, M.J.G.
Volume: C-26 , Issue: 5
Page(s): 435 - 442
Product Type: Journals & Magazines

Available Formats Non-Member Price Member Price
US$31.00 US$10.00
Learn how you can qualify for the best price for the item!
  • Email
  • Print
  • Rights And Permissions

Abstract

The Walsh-Hadamard transform has recently received increasing attention in engineering applications due to the simplicity of its implementation and to its properties which are similar to the familiar Fourier transform. The transform matrices found so far to possess fast algorithms are the naturally ordered and dyadically ordered matrices, whose algorithms are similar to the Cooley-Tukey algorithm, and to the machine-oriented algorithm of Corinthios [2], respectively.

Index Terms

Index Terms are available to subscribers and IEEE members.

 





Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A non-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2012 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.