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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Comments, with reply, on "A new algorithm to optimize Barker code sidelobe suppression filters" by X.H. Chen and J. Oksman


    Contributors:
    Urkowitz, H. (author) / Chen, X.H. (author) / Oksman, J. (author)


    Publication date :

    1991-11-01


    Size :

    76489 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    Range Sidelobe Suppression for Barker Codes

    Rihaczek, August W. / Golden, Roger M. | IEEE | 1971


    A parallel Jacobson-Oksman optimization algorithm

    Straeter, Terry A. / Markos, Athene T. | TIBKAT | 1975