In the above-titled paper (see ibid., vol.26, no.4, July 1990), the authors presented a simple approach to suppressing Barker code compression sidelobes. It consists of approximating an inverse filter in a finite series of terms with unknown coefficients. The coefficients are then determined by a simplex solution to an appropriate linear programming problem. The commenter indicates the results are correct, but the steps taken contain two errors which, however, compensate for each other. The corrections are given by the authors in their reply.<>
Comments, with reply, on "A new algorithm to optimize Barker code sidelobe suppression filters" by X.H. Chen and J. Oksman
IEEE Transactions on Aerospace and Electronic Systems ; 27 , 6 ; 921-922
1991-11-01
76489 byte
Article (Journal)
Electronic Resource
English
CORRESPONDENCE - Multiplicative Mismatched Filters for Sidelobe Suppression in Barker Codes
Online Contents | 2008
|Range Sidelobe Suppression for Barker Codes
IEEE | 1971
|A parallel Jacobson-Oksman optimization algorithm
TIBKAT | 1975
|