Lianglong Da
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lianglong Da has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Baoheng Liu
Naval Submarine Academy 1 , Qingdao 266199
1 shared publicationShuyang Jia
Naval Submarine Academy 1 , Qingdao 266199
1 shared publicationSichen Zou
Laoshan Laboratory 2 , Qingdao 266237
1 shared publicationXiaochuan Zhang
Naval Submarine Academy 1 , Qingdao 266199
1 shared publication
Latest Publications
- Open Access
- 1 November 2024
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 156 (5) , 3158-3168
A D* orthogonal matching pursuit algorithm for time-varying channel estimation
Orthogonal matching pursuit (OMP) combined with the A* search algorithm (A*OMP) exhibits robust reconstruction capabilities for synthesizing sparse data and signals, achieving relatively low reconstruction errors and a higher exact recovery ability than conventional OMP. However, A*OMP is only suitable for static channel estimation and cannot be applied to dynamic scenarios. This is because the channel delays for several consecutive orthogonal frequency-division multiplexing blocks per frame are similar and the path gains exhibit temporal correlation. This paper introduces a dynamic OMP approach (D*OMP) that employs a heuristic function of A*OMP and a unique reverse process, enabling sparse solutions to be identified in unknown and changing environments. The proposed method is highly practical for joint channel estimation across multiple blocks. Simulation and sea trial results indicate that D*OMP not only possesses superior channel recovery accuracy, but also has a more efficient channel reconstruction process, outperforming both A*OMP and conventional OMP.
- 1 November 2024
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 156 (5) , 3158-3168
Open AccessA D* orthogonal matching pursuit algorithm for time-varying channel estimation
Orthogonal matching pursuit (OMP) combined with the A* search algorithm (A*OMP) exhibits robust reconstruction capabilities for synthesizing sparse data and signals, achieving relatively low reconstruction errors and a higher exact recovery ability than conventional OMP. However, A*OMP is only suitable for static channel estimation and cannot be applied to dynamic scenarios. This is because the channel delays for several consecutive orthogonal frequency-division multiplexing blocks per frame are similar and the path gains exhibit temporal correlation. This paper introduces a dynamic OMP approach (D*OMP) that employs a heuristic function of A*OMP and a unique reverse process, enabling sparse solutions to be identified in unknown and changing environments. The proposed method is highly practical for joint channel estimation across multiple blocks. Simulation and sea trial results indicate that D*OMP not only possesses superior channel recovery accuracy, but also has a more efficient channel reconstruction process, outperforming both A*OMP and conventional OMP.