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 posit...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 chan-nels.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)algo-rithm is used to quantize the data according to the statistical characteristics of the sparse coeffi-cients.Quantized results are then coded with an arithmetic coding method which can further com-press data.Numerical results indicate that this tracking data compression algorithm drops the com-munication bandwidth to 4%at the cost of a 16%root mean squared error(RMSE)loss.展开更多
基金supported in part by the National Laboratory of Radar Signal Processing Xidian Univrsity,Xi’an 710071,China。
文摘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 chan-nels.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)algo-rithm is used to quantize the data according to the statistical characteristics of the sparse coeffi-cients.Quantized results are then coded with an arithmetic coding method which can further com-press data.Numerical results indicate that this tracking data compression algorithm drops the com-munication bandwidth to 4%at the cost of a 16%root mean squared error(RMSE)loss.
