Sliding conjugate symmetric sequency-ordered complex Hadamard transform: fast algorithm and applications - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

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

(1, 2, 3) , (1, 3) , (2, 1) , (1, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
SLIDING_CONJUGATE.pdf (568.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inserm-00530948 , version 1 (05-12-2013)

Identifiers

  • HAL Id : inserm-00530948 , version 1

Cite

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⟩
293 View
216 Download

Share

Gmail Facebook Twitter LinkedIn More