Work

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

Year: 2012
Type: article
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 windowi+N/4 from those of windowi, 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.
Language: English
Open Access status: green
OpenAlex ID: W2151982919
FWCI: 4.084
Cites: 56
Cited by: 23
Related to: 10