Tractable Transmit MIMO Beampattern Design under a Constant Modulus Constraint

Omar Aldayel, Vishal Monga, Muralidhar Rangaswamy

    Research output: Contribution to journalArticle

    21 Citations (Scopus)

    Abstract

    Multiple-input multiple-output (MIMO) radar systems allow each antenna element to transmit a different waveform. This waveform diversity can be exploited to enhance the beampattern design, in particular, effective management of radar radiation power in directions of interest. We address the problem of designing a beampattern for MIMO radar, which in turn is determined by the transmit waveform. While unconstrained design is straightforward, a key open challenge is enforcing the constant modulus constraint on the radar waveform. It is well known that the problem of minimizing deviation of the designed beampattern from an idealized one subject to the constant modulus constraint constitutes a hard nonconvex problem. Existing methods that address constant modulus invariably lead to a stiff tradeoff between analytical tractability (achieved by relaxations and approximations) and realistic design that exactly achieves constant modulus but is computationally burdensome. A new approach is proposed in our paper, which involves solving a sequence of convex equality constrained quadratic programs, each of which has a closed form solution and such that constant modulus is achieved at convergence. We further prove that the converged solution satisfies the Karush-Kuhn-Tucker optimality conditions of the aforementioned hard nonconvex problem. We evaluate the proposed successive closed forms (SCF) algorithm against the state-of-the art MIMO beampattern design techniques in both narrowband and wideband setups and show that the SCF breaks the tradeoff between desirable performance and the associated computation cost.

    Original languageEnglish (US)
    Article number7840054
    Pages (from-to)2588-2599
    Number of pages12
    JournalIEEE Transactions on Signal Processing
    Volume65
    Issue number10
    DOIs
    StatePublished - May 15 2017

    Fingerprint

    Radar
    Radar systems
    Antennas
    Radiation
    Costs

    All Science Journal Classification (ASJC) codes

    • Signal Processing
    • Electrical and Electronic Engineering

    Cite this

    Aldayel, Omar ; Monga, Vishal ; Rangaswamy, Muralidhar. / Tractable Transmit MIMO Beampattern Design under a Constant Modulus Constraint. In: IEEE Transactions on Signal Processing. 2017 ; Vol. 65, No. 10. pp. 2588-2599.
    @article{fd2cbf589aa04b1b81da6226f2ec59e0,
    title = "Tractable Transmit MIMO Beampattern Design under a Constant Modulus Constraint",
    abstract = "Multiple-input multiple-output (MIMO) radar systems allow each antenna element to transmit a different waveform. This waveform diversity can be exploited to enhance the beampattern design, in particular, effective management of radar radiation power in directions of interest. We address the problem of designing a beampattern for MIMO radar, which in turn is determined by the transmit waveform. While unconstrained design is straightforward, a key open challenge is enforcing the constant modulus constraint on the radar waveform. It is well known that the problem of minimizing deviation of the designed beampattern from an idealized one subject to the constant modulus constraint constitutes a hard nonconvex problem. Existing methods that address constant modulus invariably lead to a stiff tradeoff between analytical tractability (achieved by relaxations and approximations) and realistic design that exactly achieves constant modulus but is computationally burdensome. A new approach is proposed in our paper, which involves solving a sequence of convex equality constrained quadratic programs, each of which has a closed form solution and such that constant modulus is achieved at convergence. We further prove that the converged solution satisfies the Karush-Kuhn-Tucker optimality conditions of the aforementioned hard nonconvex problem. We evaluate the proposed successive closed forms (SCF) algorithm against the state-of-the art MIMO beampattern design techniques in both narrowband and wideband setups and show that the SCF breaks the tradeoff between desirable performance and the associated computation cost.",
    author = "Omar Aldayel and Vishal Monga and Muralidhar Rangaswamy",
    year = "2017",
    month = "5",
    day = "15",
    doi = "10.1109/TSP.2017.2664040",
    language = "English (US)",
    volume = "65",
    pages = "2588--2599",
    journal = "IEEE Transactions on Signal Processing",
    issn = "1053-587X",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "10",

    }

    Tractable Transmit MIMO Beampattern Design under a Constant Modulus Constraint. / Aldayel, Omar; Monga, Vishal; Rangaswamy, Muralidhar.

    In: IEEE Transactions on Signal Processing, Vol. 65, No. 10, 7840054, 15.05.2017, p. 2588-2599.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Tractable Transmit MIMO Beampattern Design under a Constant Modulus Constraint

    AU - Aldayel, Omar

    AU - Monga, Vishal

    AU - Rangaswamy, Muralidhar

    PY - 2017/5/15

    Y1 - 2017/5/15

    N2 - Multiple-input multiple-output (MIMO) radar systems allow each antenna element to transmit a different waveform. This waveform diversity can be exploited to enhance the beampattern design, in particular, effective management of radar radiation power in directions of interest. We address the problem of designing a beampattern for MIMO radar, which in turn is determined by the transmit waveform. While unconstrained design is straightforward, a key open challenge is enforcing the constant modulus constraint on the radar waveform. It is well known that the problem of minimizing deviation of the designed beampattern from an idealized one subject to the constant modulus constraint constitutes a hard nonconvex problem. Existing methods that address constant modulus invariably lead to a stiff tradeoff between analytical tractability (achieved by relaxations and approximations) and realistic design that exactly achieves constant modulus but is computationally burdensome. A new approach is proposed in our paper, which involves solving a sequence of convex equality constrained quadratic programs, each of which has a closed form solution and such that constant modulus is achieved at convergence. We further prove that the converged solution satisfies the Karush-Kuhn-Tucker optimality conditions of the aforementioned hard nonconvex problem. We evaluate the proposed successive closed forms (SCF) algorithm against the state-of-the art MIMO beampattern design techniques in both narrowband and wideband setups and show that the SCF breaks the tradeoff between desirable performance and the associated computation cost.

    AB - Multiple-input multiple-output (MIMO) radar systems allow each antenna element to transmit a different waveform. This waveform diversity can be exploited to enhance the beampattern design, in particular, effective management of radar radiation power in directions of interest. We address the problem of designing a beampattern for MIMO radar, which in turn is determined by the transmit waveform. While unconstrained design is straightforward, a key open challenge is enforcing the constant modulus constraint on the radar waveform. It is well known that the problem of minimizing deviation of the designed beampattern from an idealized one subject to the constant modulus constraint constitutes a hard nonconvex problem. Existing methods that address constant modulus invariably lead to a stiff tradeoff between analytical tractability (achieved by relaxations and approximations) and realistic design that exactly achieves constant modulus but is computationally burdensome. A new approach is proposed in our paper, which involves solving a sequence of convex equality constrained quadratic programs, each of which has a closed form solution and such that constant modulus is achieved at convergence. We further prove that the converged solution satisfies the Karush-Kuhn-Tucker optimality conditions of the aforementioned hard nonconvex problem. We evaluate the proposed successive closed forms (SCF) algorithm against the state-of-the art MIMO beampattern design techniques in both narrowband and wideband setups and show that the SCF breaks the tradeoff between desirable performance and the associated computation cost.

    UR - http://www.scopus.com/inward/record.url?scp=85017718819&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85017718819&partnerID=8YFLogxK

    U2 - 10.1109/TSP.2017.2664040

    DO - 10.1109/TSP.2017.2664040

    M3 - Article

    AN - SCOPUS:85017718819

    VL - 65

    SP - 2588

    EP - 2599

    JO - IEEE Transactions on Signal Processing

    JF - IEEE Transactions on Signal Processing

    SN - 1053-587X

    IS - 10

    M1 - 7840054

    ER -