Skip to Main content Skip to Navigation
Conference papers

Sliding conjugate symmetric sequency-ordered complex Hadamard transform: fast algorithm and applications

Abstract : This paper presents a fast algorithm for the computation of forward and backward sliding conjugate symmetric sequency-ordered complex Hadamard transform (CSSCHT). The forward CSSCHT algorithm calculates the values of window i+N/4 from those of window i and one length-N/4 CSSCHT, one length-N/4 WHT and one length-N/4 modified WHT. The backward CSSCHT algorithm can be obtained by transposing the signal flow graph of that of the forward one. The proposed algorithm requires O(N) arithmetic operations, which is more efficient than the block-based algorithm and those based on the sliding FFT and the sliding DFT. The applications of the sliding CSSCHT in spectrum estimation and transform domain adaptive filtering (TDAF) are also provided with supporting simulation results.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://www.hal.inserm.fr/inserm-00530948
Contributor : Lotfi Senhadji <>
Submitted on : Thursday, December 5, 2013 - 8:51:58 PM
Last modification on : Friday, July 5, 2019 - 10:16:02 AM
Long-term archiving on: : Tuesday, January 3, 2017 - 5:32:10 PM

File

SLIDING_CONJUGATE.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inserm-00530948, version 1

Collections

Citation

Jiasong Wu, Lu Wang, Lotfi Senhadji, Huazhong Shu. Sliding conjugate symmetric sequency-ordered complex Hadamard transform: fast algorithm and applications. European Signal Processing Conference (EUSIPCO), Jul 2010, AALBORG, Denmark. pp.1742-6. ⟨inserm-00530948⟩

Share

Metrics

Record views

526

Files downloads

349