Skip to Main content Skip to Navigation
Journal articles

Fast algorithms for the computation of sliding sequency-ordered complex Hadamard transform

Abstract : Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decomposing a length-N inverse SCHT (ISCHT) into two length-N/2 ISCHTs. The second algorithm, calculating the values of window i+N/4 from those of window i and one length-N/4 ISCHT and one length-N/4 modified ISCHT (MISCHT), is implemented by two schemes to achieve a good compromise between the computation complexity and the implementation complexity. The forward SCHT algorithm can be obtained by transposing the signal flow graph of the ISCHT. The proposed algorithms require O(N) arithmetic operations and thus are more efficient than the block-based algorithms as well as those based on the sliding FFT or the sliding DFT. The application of the sliding ISCHT in transform domain adaptive filtering (TDAF) is also discussed with supporting simulation results.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download
Contributor : Lotfi Senhadji <>
Submitted on : Friday, February 18, 2011 - 2:33:44 PM
Last modification on : Friday, July 5, 2019 - 10:16:02 AM
Long-term archiving on: : Thursday, May 19, 2011 - 2:37:50 AM


Files produced by the author(s)




Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji. Fast algorithms for the computation of sliding sequency-ordered complex Hadamard transform. IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2010, 58 (11), pp.5901-5909. ⟨10.1109/TSP.2010.2063026⟩. ⟨inserm-00502110⟩



Record views


Files downloads