Skip to main content

The Walsh transform and its relatives

  • Chapter
  • First Online:

Abstract

We describe several variants of the Walsh transform, sometimes called Walsh-Hadamard transform or just Hadamard transform. The Walsh transform has the same complexity as the Fourier transform but does not involve any multiplications. The XOR (dyadic) convolution that can be computed efficiently by the Walsh transform is introduced. We also give related transforms like the slant transform, the Reed-Muller transform, and the arithmetic transform.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   279.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jörg Arndt .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Berlin Heidelberg

About this chapter

Cite this chapter

Arndt, J. (2011). The Walsh transform and its relatives. In: Matters Computational. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14764-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14764-7_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14763-0

  • Online ISBN: 978-3-642-14764-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics