In this paper,a fast orthogonal matching pursuit(OMP)algorithm based on optimized iterative process is proposed for sparse time-varying underwater acoustic(UWA)channel estimation.The channel estimation consists of cal...In this paper,a fast orthogonal matching pursuit(OMP)algorithm based on optimized iterative process is proposed for sparse time-varying underwater acoustic(UWA)channel estimation.The channel estimation consists of calculating amplitude,delay and Doppler scaling factor of each path using the received multi-path signal.This algorithm,called as OIP-FOMP,can reduce the computationally complexity of the traditional OMP algorithm and maintain accuracy in the presence of severe inter-carrier interference that exists in the time-varying UWA channels.In this algorithm,repeated inner product operations used in the OMP algorithm are removed by calculating the candidate path signature Hermitian inner product matrix in advance.Efficient QR decomposition is used to estimate the path amplitude,and the problem of reconstruction failure caused by inaccurate delay selection is avoided by optimizing the Hermitian inner product matrix.Theoretical analysis and simulation results show that the computational complexity of the OIP-FOMP algorithm is reduced by about 1/4 compared with the OMP algorithm,without any loss of accuracy.展开更多
基金supported in part by the National Natural Science Foundation of China(NSFC)(No.U1806201,61671261)Project of Shandong Province Higher Educational Science and Technology Program(No.J17KA058,J17KB154).
文摘In this paper,a fast orthogonal matching pursuit(OMP)algorithm based on optimized iterative process is proposed for sparse time-varying underwater acoustic(UWA)channel estimation.The channel estimation consists of calculating amplitude,delay and Doppler scaling factor of each path using the received multi-path signal.This algorithm,called as OIP-FOMP,can reduce the computationally complexity of the traditional OMP algorithm and maintain accuracy in the presence of severe inter-carrier interference that exists in the time-varying UWA channels.In this algorithm,repeated inner product operations used in the OMP algorithm are removed by calculating the candidate path signature Hermitian inner product matrix in advance.Efficient QR decomposition is used to estimate the path amplitude,and the problem of reconstruction failure caused by inaccurate delay selection is avoided by optimizing the Hermitian inner product matrix.Theoretical analysis and simulation results show that the computational complexity of the OIP-FOMP algorithm is reduced by about 1/4 compared with the OMP algorithm,without any loss of accuracy.
