Share Email Print
cover

Proceedings Paper

Handling side information for data compression of radar pulse trains
Author(s): J. Andrew Johnson; Mark L. Fowler
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Previously a method has been proposed for a high-performance compression method designed expressly for compressing intercepted radar pulse trains for the purpose of locating the transmitter. The method relies on gating pulses, putting them into a pulse matrix and then using the singular value decomposition (SVD) to compress the signal data. This paper reformulates the pulse gating method and shows that it requires the solution of an integer linear programming problem and several standard methods are first considered. It is shown that the large number of constraints in the original formulation can be significantly reduced by replacing the constraint set by its convex hull; simple rules for identifying the convex hull are given. However, even with these reductions the execution time for these methods can be prohibitive at very large pulse counts; furthermore, these methods exhibited numerical precision and convergence problems as the number of pulses increased. Therefore, an efficient non-standard method for solving this integer optimization problem is developed by exploiting characteristics of the objective function. This method solves the pulse gating problem with short execution times that grow negligibly with increasing pulse counts.

Paper Details

Date Published: 30 January 2003
PDF: 12 pages
Proc. SPIE 4793, Mathematics of Data/Image Coding, Compression, and Encryption V, with Applications, (30 January 2003); doi: 10.1117/12.453514
Show Author Affiliations
J. Andrew Johnson, Univ. at Binghamton (United States)
Mark L. Fowler, Univ. at Binghamton (United States)


Published in SPIE Proceedings Vol. 4793:
Mathematics of Data/Image Coding, Compression, and Encryption V, with Applications
Mark S. Schmalz, Editor(s)

© SPIE. Terms of Use
Back to Top