Rooting time delay estimation based on noise subspace approximation

Abstract:

The Multiple Signal Classification(MUSIC) algorithm requires multipath number estimation. The eigenvalue decomposition and spectral peak searching feature high computational complexity. To address the issues, a new root time delay estimation based on noise subspace approximation is proposed. The proposed algorithm uses the high power inverse matrix to approach the product of both noise subspace and its conjugate transpose. The polynomial is constructed for estimating time delay. The polynomial rooting avoids the spectral peak searching and reduces the computational complexity. Simulation results show that the proposed algorithm has the similar performance as the MUSIC algorithm and approaches the Cramer-Rao Bound(CRB) without multipath number estimation; and the computational complexity of the proposed algorithm is lower than that of the MUSIC algorithm.