Distributed Radar Target Tracking with Low Communication Cost

Journal of Beijing Institute of Technology ›› 2022, Vol. 31 ›› Issue (6) : 595 -604.

PDF (5423KB)
Journal of Beijing Institute of Technology ›› 2022, Vol. 31 ›› Issue (6) : 595 -604. DOI: 10.15918/j.jbit1004-0579.2022.129

Distributed Radar Target Tracking with Low Communication Cost

Author information +
History +
PDF (5423KB)

Abstract

In distributed radar, most of existing radar networks operate in the tracking fusion mode which combines radar target tracks for a higher positioning accuracy. However, as the filtering covariance matrix indicating positioning accuracy often occupies many bits, the communication cost from local sensors to the fusion is not always sufficiently low for some wireless communication channels. This paper studies how to compress data for distributed tracking fusion algorithms. Based on the K-singular value decomposition (K-SVD) algorithm, a sparse coding algorithm is presented to sparsely represent the filtering covariance matrix. Then the least square quantization (LSQ) algorithm is used to quantize the data according to the statistical characteristics of the sparse coefficients. Quantized results are then coded with an arithmetic coding method which can further compress data. Numerical results indicate that this tracking data compression algorithm drops the communication bandwidth to 4% at the cost of a 16% root mean squared error (RMSE) loss.

Keywords

distributed radar / distributed tracking fusion / data compression / K-singular value decomposition(K-SVD) algorithm / sparse coding / least square quantization (LSQ)

Cite this article

Download citation ▾
null. Distributed Radar Target Tracking with Low Communication Cost. Journal of Beijing Institute of Technology, 2022, 31(6): 595-604 DOI:10.15918/j.jbit1004-0579.2022.129

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (5423KB)

922

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/