Sequency-Ordered Complex Hadamard Transform: Properties, Computational Complexity and Applications
From MaRDI portal
Publication:4569020
DOI10.1109/TSP.2008.923195zbMATH Open1390.94081OpenAlexW2164005573MaRDI QIDQ4569020FDOQ4569020
Authors: Aye Aung, Boon Poh Ng, Susanto Rahardja
Publication date: 27 June 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2008.923195
Recommendations
- Conjugate Symmetric Sequency-Ordered Complex Hadamard Transform
- Fast Algorithms for the Computation of Sliding Sequency-Ordered Complex Hadamard Transform
- Sliding Conjugate Symmetric Sequency-Ordered Complex Hadamard Transform: Fast Algorithm and Applications
- Natural-ordered complex Hadamard transform
- Algorithms for converting sequency-, dyadic-, and Hadamard-ordered Walsh functions
- Root-Hadamard transforms and complementary sequences
- Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
- Complexity of Hartman sequences
- Complex Hadamard matrices related to Bent sequences
Cited In (4)
This page was built for publication: Sequency-Ordered Complex Hadamard Transform: Properties, Computational Complexity and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569020)