Dissemin is shutting down on January 1st, 2025

Published in

Institute of Electrical and Electronics Engineers, IEEE Transactions on Circuits and Systems I: Regular Papers, 6(59), p. 1321-1334, 2012

DOI: 10.1109/tcsi.2011.2173386

Links

Tools

Export citation

Search in Google Scholar

Sliding Conjugate Symmetric Sequency-Ordered Complex Hadamard Transform: Fast Algorithm and Applications

Journal article published in 2012 by Jiasong S. Wu, Guanyu Yang, Lu Wang, Lotfi Senhadji ORCID, Limin Luo, Huazhong Z. Shu
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

This paper presents a fast algorithm for the computation of sliding conjugate symmetric sequency-ordered complex Hadamard transform (CS-SCHT). The algorithm calculates the values of window i+ N/4 from those of window i, one length-N/4 Walsh Hadamard transform (WHT) and one length-N/4 Modified WHT (MWHT). The proposed algorithm requires O(N) arithmetic operations, which is more efficient than the block-based algorithms of various transforms and the sliding FFT algorithm, but less efficient than the sliding WHT algorithms. Compared to the recently proposed sliding inverse SCHT (ISCHT) algorithm, the proposed algorithm is more efficient for real input but less efficient for complex input. The applications of the sliding CS-SCHT in transform domain adaptive filtering (TDAF) to complex signal channel equalization and real speech signal acoustic echo cancellation are also provided.