The Fast m-Transform: A Fast Computation of Cross-Correlations with Binary m-Sequences

DOI10.1137/0220043MaRDI QIDQ3357508zbMATH OpenOpenAlexFDO

Authors Erich E. Sutter

Publication date 1991

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0220043

zbMATH Keywords

algorithmbinary m-sequencesfast cross-correlationfast Walsh transformHadamard transformlinear and nonlinear systemsm-transformWalsh-Hadamard transforms

Mathematics Subject Classification ID

Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 5046521
• scientific article; zbMATH DE number 3949544
• scientific article; zbMATH DE number 3951888
• scientific article; zbMATH DE number 3956396
• Computation of the Fast Walsh-Fourier Transform

Cited in

(3)

• Using M-sequences for determining the impulse responses of LTI-systems
• scientific article; zbMATH DE number 5003232 (Why is no real title available?)
• scientific article; zbMATH DE number 5046521 (Why is no real title available?)

This page was built for publication: The Fast m-Transform: A Fast Computation of Cross-Correlations with Binary m-Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3357508)