AN EFFICIENT APPROACH FOR THE HARMONIC RETRIEVAL PROBLEM VIA HAAR WAVELET TRANSFORM

Modern subspace-based algorithms can offer high-resolution spectral es timates but with a cost of high computational complexity for the eigen value decomposition (EVD) involved. In this letter, we propose a novel preprocessing scheme that can be used in conjunction with the subspac e-based algorithms to alleviate the high amount of computations previo usly required, The main crux of the new scheme lies in a subband decom position of the input data via the computationally efficient discrete- time Haar wavelet transform (HWT). Some simulation results are provide d to justify the proposed approach.