Abstract
There are many advantages in the use of Hadamard matrices in digital signal processing. However one possible disadvantage is the so-called overflow, as measured by the associated Lebesgue constants. We show that for certain classes of recursively generated Hadamard matrices, there are logarithmic upper bounds for these constants. On the other hand, for some Hadamard matrices the Lebesgue constants are of order \sqr{m}. These results have natural analogues in classical Fourier analysis.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Hans G. Feichtinger.
Rights and permissions
About this article
Cite this article
Hadwin, D., Harrison, K. & Ward, J. Lebesgue Constants for Hadamard Matrices. J. Fourier Anal. Appl. 10, 247–258 (2004). https://doi.org/10.1007/s00041-004-0929-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00041-004-0929-0