滑动窗复数哈达玛变换的快速算法及其应用研究.pptVIP

Tapped-delay-line(TDL) form * Tapped-delay-line(TDL) form * DN is a diagonal matrix whose elements alternate between +1 and -1. PN is the perfect (or ideal) shuffle permutation matrix. * DN is a diagonal matrix whose elements alternate between +1 and -1. PN is the perfect (or ideal) shuffle permutation matrix. * * * * * * * * * * Fig. 4-15 that the learning curves for TDLMSAF using the sliding CS-SCHT algorithm, sliding SCHT algorithm, and sliding FFT algorithm are exactly the same. * The proposed Scheme 1 (algorithm 2) of sliding CS-SCHT algorithm (1.178 ms) [61] allows us to save 40.0% in terms of computational time compared to block CS-SCHT one (1.962 ms) [57], 28.8% compared to sliding FFT one (1.515 ms) [17-20] and 79.7% compared to block FFT one (5.791 ms) [66] in the process of sliding transformations. However, the proposed sliding CS-SCHT algorithm is 9.3 % slower than sliding SCHT one (1.069 ms) [60]. * The proposed Scheme 1 (algorithm 2) of sliding CS-SCHT (0.901 s) [61] saves 34.6% compared to block CS-SCHT (1.379 s) [57], 42.1% compared to sliding FFT (1.557 s) [17-20], 66.1% compared to RDFT (2.661 s) [66], 11.5% compared to sliding SCHT (1.018 s) [60], -14.3% compared to sliding WHT (0.772 s) [22], 25.0% compared to RWHT (1.202 s) [67] and 68.2% compared to RDHT (2.831 s) [66] in terms of the execution time. * * * Radix-4 sliding algorithm (11) If we use the algorithm presented in [Farhang-Boroujeny,1995] to compute Modified WHT, we have If we implement the length-N/4 WHT by [Ouyang, 2011] Radix-4 sliding algorithm (12) Complex input 4 8 16 32 N = 2n, n ≥ 4 Proposed sliding CS-SCHT M(j) 2 5 12 23 2N/3+2log4N-8/3, N=2n, n=4,6,… 2N/3+2log4(N/2)-7/3, N=2n, n=5,7,… Adds 10 26 66 142 44N/9+(log4N-14/3)(log4N-1)-86/9, N=2n, n=4,6,… 44N/9+(log4(N/2)-10/3)(log4(N/2)-1)-118/9, N=2n, n=5,7,… Me 10 36 64 128 N/2+max{7N/2, +N(log2N–1)/2} Proposed sliding SCHT [60] M(j) 2 5 13 28 5N/6+log4N-7/3, N=2n, n=4,6,… 5N/6+log4(N/2) –8/3, N=2n, n=5,7,… Add