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

DOI10.1137/0220043zbMATH Open0731.65129OpenAlexW2030282784MaRDI QIDQ3357508FDOQ3357508

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

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

zbMATH Keywords

algorithmWalsh-Hadamard transformsHadamard transformfast Walsh transformlinear and nonlinear systemsfast cross-correlationbinary m-sequencesm-transform

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)

Cited In (3)

• Title not available (Why is that?)
• Using \(M\)-sequences for determining the impulse responses of LTI-systems
• Title not available (Why is that?)

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)