IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v183y2019i2d10.1007_s10957-019-01558-z.html
   My bibliography  Save this article

Frequency-Hopping Code Design for Target Detection via Optimization Theory

Author

Listed:
  • Yu Yao

    (East China Jiaotong University)

  • Junhui Zhao

    (East China Jiaotong University)

  • Lenan Wu

    (Southeast University)

Abstract

We present a signaling scheme for information embedding into the illumination of radar using frequency-hopping pulses. A frequency-hopping-based joint radar-communication system enables implementing a primary radar operation and a secondary communication function simultaneously. Then, we consider the problems of radar codes optimization under a peak-to-average-power ratio and an energy constraint. These radar codes design problems can be converted into non-convex quadratic programs with a finite or an infinite number of quadratic constraints. All problems are proved to be NP-hard optimization problems. Therefore, we develop optimization approaches, resorting to semi-definite programming relaxation technique along with to the idea of trigonometric polynomials, offering expected approximate solutions with a polynomial time calculation burden. We assess the capability of the proposed schemes, considering both the detection probability and the robustness in correspondence of Doppler shifts offered by the Neyman–Pearson detector. Simulation results show an improvement in detection performance as the average signal-to-noise ratio value increases, while still maintaining low symbol error rates between the proposed system nodes.

Suggested Citation

  • Yu Yao & Junhui Zhao & Lenan Wu, 2019. "Frequency-Hopping Code Design for Target Detection via Optimization Theory," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 731-756, November.
  • Handle: RePEc:spr:joptap:v:183:y:2019:i:2:d:10.1007_s10957-019-01558-z
    DOI: 10.1007/s10957-019-01558-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-019-01558-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-019-01558-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:183:y:2019:i:2:d:10.1007_s10957-019-01558-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.