Sliding Conjugate Symmetric Sequency-Ordered Complex Hadamard Transform:FastAlgorithm and Applications - Inserm - Institut national de la santé et de la recherche médicale Access content directly
Journal Articles IEEE Transactions on Circuits and Systems Part 1 Fundamental Theory and Applications Year : 2012

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.
Fichier principal
Vignette du fichier
2012_Sliding_Conjugate_Symmetric_Sequency-Ordered_Complex_Hadamard_Transform_Fast_Algorithm_and_Applications.pdf (21.34 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inserm-00708773 , version 1 (15-06-2012)

Identifiers

Cite

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, 2012, 59 (6), pp.1321 - 1334. ⟨10.1109/TCSI.2011.2173386⟩. ⟨inserm-00708773⟩
179 View
589 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More