Skip to Main content Skip to Navigation
Journal articles

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

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.
Complete list of metadatas

Cited literature [50 references]  Display  Hide  Download
Contributor : Lotfi Senhadji <>
Submitted on : Friday, June 15, 2012 - 4:25:03 PM
Last modification on : Thursday, January 14, 2021 - 11:25:01 AM
Long-term archiving on: : Sunday, September 16, 2012 - 3:00:10 AM


Files produced by the author(s)




Jiasong Wu, Lu Wang, Guanyu Yang, Lotfi Senhadji, Limin Luo, et al.. Sliding Conjugate Symmetric Sequency-Ordered Complex Hadamard Transform:FastAlgorithm and Applications. IEEE Transactions on Circuits and Systems Part 1 Fundamental Theory and Applications, Institute of Electrical and Electronics Engineers (IEEE), 2012, 59 (6), pp.1321 - 1334. ⟨10.1109/TCSI.2011.2173386⟩. ⟨inserm-00708773⟩



Record views


Files downloads