This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Power Allocation for Coexisting Multicarrier Radar and Communication Systems in Cluttered Environments thanks: This work was supported in part by the National Science Foundation under grants ECCS-1609393 and ECCS-1923739.

Fangzhou Wang and Hongbin Li Fangzhou Wang and Hongbin Li are with the Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ 07030 USA (fwang11@stevens.edu; hli@stevens.edu).
Abstract

In this paper, power allocation is examined for the coexistence of a radar and a communication system that employ multicarrier waveforms. We propose two designs for the considered spectrum sharing problem by maximizing the output signal-to-interference-plus-noise ratio (SINR) at the radar receiver while maintaining certain communication throughput and power constraints. The first is a joint design where the subchannel powers of both the radar and communication systems are jointly optimized. Since the resulting problem is highly nonconvex, we introduce a reformulation by combining the power variables of both systems into a single stacked variable, which allows us to bypass a conventional computationally intensive alternating optimization procedure. The resulting problem is then solved via a quadratic transform method along with a sequential convex programming (SCP) technique. The second is a unilateral design which optimizes the radar transmission power with fixed communication power. The unilateral design is suitable for cases where the communication system pre-exists while the radar occasionally joins the channel as a secondary user. The problem is solved by a Taylor expansion based iterative SCP procedure. Numerical results are presented to demonstrate the effectiveness of the proposed joint and unilateral designs in comparison with a subcarrier allocation based method.

Index Terms:
radar and communication coexistence, multicarrier signal, power allocation, nonconvex optimization, cluttered environment

I Introduction

In recent years, radar has been utilized to numerous civilian applications such as traffic control, remote sensing, car cruise control, and collision avoidance. On the other hand, there is a tremendous demand for additional bandwidth from the wireless sector. Thus, the coexistence between radar and communication systems using shared spectrum has attracted significant attention (e.g. [1, 2, 3, 4, 5, 6, 7]). The coexistence, if improperly implemented, can cause significant interference and performance degradation for both systems [8, 9, 10]. Extensive research has been directed to employing various signal processing techniques, i.e., interference mitigation, power and/or subcarrier allocation, precoding, and waveform design, to allow both radar and communication systems to efficiently share the spectrum.

Depending on the number of systems involved in the design, the research can be classified into two types. The first is based on joint design that addresses the radar and communication coexistence by jointly optimizing performance metrics and simultaneously adjusting parameters for both systems [11, 12, 13, 14], e.g., the throughput for the communication system and the signal-to-interference-plus-noise ratio (SINR) for the radar. Specifically, [11] considered the co-design of the communication transmit covariance matrix and radar sampling scheme for multiple-input multiple-output (MIMO) radar and communication systems, where the design was formulated as a nonconvex problem that was solved via an alternating optimization algorithm. In [12], the radar pulse and communication encoding matrix were jointly designed for the coexistence of a communication system and a pulsed radar. The coexistence of MIMO radar and downlink multiple-input signle-output (MISO) communication systems was considered in [13] by minimizing the Cramér-Rao bound of direction-of-arrival estimation while imposing an appropriate constraint on the communication quality of service. In addition, [14] studied the joint design problem of radar and communication coexistence by considering both radar-centric and communication-centric formulations.

The second type is based on unilateral design from either the radar or communication perspective [15, 16, 17, 18, 19, 20], i.e., only parameters of one system are adjusted by using the information of the other system. One standard approach for the unilateral design is to mitigate mutual interference via either signal processing [15, 16, 17] or constrained optimization [18, 19, 20] techniques. Specifically, [15] employed receiving beamforming at the radar to cancel the sidelobe interference, while [16] proposed a spatial filtering technique to mitigate the wireless interference in both mainlobe and sidelobe directions in coherent MIMO radar. An uncoordinated radar and communication coexistence scenario was considered in [17], where compressed sensing based radar parameter estimation was used in the communication demodulation process to remove the radar interference. Meanwhile, [18] proposed a unilateral design scheme by minimizing the total radar transmission power for an orthogonal frequency division multiplexing (OFDM) radar. Radar waveform design using constrained optimization techniques to control the amount of radar-to-communication interference and other waveform properties was investigated in [19, 20].

Given the wide use of multicarrier signals in communication systems, multicarrier waveforms have become increasingly popular in radar as well due to several advantages such as frequency diversity, waveform diversity, and easy implementation [21, 22]. At any time instant, since the desired subcarriers can be digitally selected at the transmitter, narrowband jamming/interferences mitigation can be achieved by simply turning off affected subcarriers. OFDM waveforms with pulse-to-pulse agility was investigated in [23] for Doppler processing from the radar point of view. In [24], a sparse spectrum allocation algorithm for an OFDM-type radar was presented by using the integrate sidelobe level (ISL) as an optimization metric. Multicarrier waveforms were also employed by radar and communication systems to tackle coexistence applications [25].

We consider spectrum sharing between a multicarrier radar and a communication system operating in a cluttered environment, where the communication or radar receiver observes not only the cross-interference from its counterpart but also a multi-path or clutter signal, which arises from the system’s own transmission. While multi-path can be exploited for communication, clutter is a self-interference to the radar system and must be adequately mitigated in order to expose weak targets. Clutter is also a signal-dependent interference, i.e., it depends on the transmitted signal to be determined, which makes the design problem considerably more challenging [26, 27, 28]. It is noted that multi-path and clutter were neglected in earlier multicarrier-based spectrum sharing studies to ease the development of proposed solutions (e.g., [4, 6, 25])

Specifically, we propose a joint design approach to jointly optimize the radar and communication transmission power allocated to each subcarrier. The optimum power allocation strategies are obtained for both systems by maximizing the radar output SINR while maintaining a minimum communication throughput constraint, along with a total transmission power constraint and subchannel peak power constraints for each system. The joint power allocation problem is highly nonconvex with respect to (w.r.t.) the design variables. To address this challenge, we reformulate the problem by combining the radar and communication power variables into a single stacked variable. This allows us to bypass a conventional alternating optimization procedure, which is computationally intensive. The resulting problem is then solved by using a quadratic transform method along with a sequential convex programming (SCP) technique.

In addition, we also propose a unilateral design from the radar perspective for the case when the communication system is a primary user of the frequency band, while the radar joins occasionally as a secondary user. The unilateral design optimizes the radar transmission power with throughput and power constraints under the condition that the communication transmission power is a prior knowledge and fixed [18]. The communication system employs a waterfilling solution to allocate subchannel power based on its channel condition when radar is absent. The unilateral design is solved by a Taylor expansion based iterative SCP procedure. Simulation results validate the effectiveness of the proposed joint and unilateral designs over a subcarrier-allocation based method.

The remainder of the paper is organized as follows. The signal model and problem of interest are introduced in II. The proposed designs along with their solutions are developed in Section III. Section IV contains numerical results and discussions, followed by conclusions in Section V.

Notations: We use boldface symbols for vectors (lower case) and matrices (upper case). ()T(\cdot)^{T} the transpose, 𝔼{}\mathbb{E}\{\cdot\} represents the statistical expectation, and 𝒪()\mathcal{O}(\cdot) denotes the Landau notation for complexity.

II Signal Model

Refer to caption
Figure 1: A radar and communication coexistence scenario in a cluttered environment.

Consider a radar system that coexists with a communication system in a cluttered environment as depicted in Fig. 1. Both systems share a frequency band of bandwidth BB Hz and employ multicarrier waveforms with NN subcarriers, where the subcarrier spacing Δf=B/N\Delta f=B/N. Under the considered set-up, the communication or radar receiver (RX) receives not only the direct useful signal (indicated by the solid lines in Fig. 1), but the direct cross interference (dashed lines in Fig. 1) and reflections from the environment (dotted lines in Fig. 1) as well.

Let 𝐩c=[pc,1,,pc,N]T{\bf p}_{\text{c}}=[p_{\text{c},1},\cdots,p_{\text{c},N}]^{T} denote the communication powers allocated to the NN subcarriers, which are to be determined. Then, the transmitted communication signal can be represented as

xc(t)=qc(t)n=1Ndnpc,nej2π(fc+nΔf)tn=1Nxc,n(t),x_{\text{c}}(t)=q_{\text{c}}(t)\sum_{n=1}^{N}d_{n}\sqrt{p_{\text{c},n}}e^{j2\pi(f_{\text{c}}+n\Delta f)t}\triangleq\sum_{n=1}^{N}x_{\text{c},n}(t), (1)

where fcf_{\text{c}} is the carrier frequency, qc(t)q_{\text{c}}(t) the communication waveform with a duration TcT_{\text{c}}, and dnd_{n} the symbol carried by the nn-th subcarrier. Without loss of generality, we assume E{|dn|2}=1E\{|d_{n}|^{2}\}=1.

The multicarrier radar system uses the same carrier frequency fcf_{\text{c}} and intercarrier spacing Δf\Delta f, and a radar waveform qr(t)q_{\text{r}}(t) with a duration TrT_{\text{r}}. For simplicity, we assume Tr=Tc=TT_{\text{r}}=T_{\text{c}}=T. Then, the transmitted radar signal can be written as

xr(t)=qr(t)n=1Npr,nej2π(fc+nΔf)tn=1Nxr,n(t),x_{\text{r}}(t)=q_{\text{r}}(t)\sum_{n=1}^{N}\sqrt{p_{\text{r},n}}e^{j2\pi(f_{\text{c}}+n\Delta f)t}\triangleq\sum_{n=1}^{N}x_{\text{r},n}(t), (2)

where 𝐩r=[pr,1,,pr,N]T{\bf p}_{\text{r}}=[p_{\text{r},1},\cdots,p_{\text{r},N}]^{T} denote the radar powers that are to be determined.

As illustrated in Fig. 1, the signal received at the communication RX on the nn-th subcarrier is given by111The channel coefficient are represented by using the following convention. α\alpha^{\prime} denotes a desired (e.g., communication-to-communication or radar-to-radar) channel while β\beta^{\prime} denotes an interference (e.g., radar-to-communication) channel. The subscripts “cc” (or “rc”) indicate the channel starts from the communication (or radar) TX and ends in the communication RX.

yc,n(t)\displaystyle y_{\text{c},n}(t) =k=1Kccαcc,n,kxc,n(tτcc,k)\displaystyle=\sum_{k=1}^{K_{\text{cc}}}\alpha^{\prime}_{\text{cc},n,k}x_{\text{c},n}(t-\tau_{\text{cc},k})
+k=1Krcβrc,n,kxr,n(tτ~rc,k)+wc,n(t),\displaystyle+\sum_{k=1}^{K_{\text{rc}}}\beta^{\prime}_{\text{rc},n,k}x_{\text{r},n}(t-\widetilde{\tau}_{\text{rc},k})+w^{\prime}_{\text{c},n}(t), (3)

where αcc,n,k\alpha^{\prime}_{\text{cc},n,k} is the channel coefficient of the kk-th communication path with propagation delay τcc,k\tau_{\text{cc},k}, KccK_{\text{cc}} denotes the total number of communication paths, βrc,n,k\beta^{\prime}_{\text{rc},n,k} is the channel coefficient from the radar transmitter (TX) to the communication RX due to the kk-th clutter scatterer with propagation delay τ~rc,k\widetilde{\tau}_{\text{rc},k}, KrcK_{\text{rc}} denotes the total number of clutter scatterers, and wc,n(t)w^{\prime}_{\text{c},n}(t) is the additive channel noise. Note that the channel coefficients αcc,n,k\alpha^{\prime}_{\text{cc},n,k} and βrc,n,k\beta^{\prime}_{\text{rc},n,k} are frequency dependent as indicated by the subscript nn, which is standard in multicarrier systems.

In the first sum of (II), αcc,n,1\alpha^{\prime}_{\text{cc},n,1} refers to the direct desired signal depicted in Fig. 1, i.e., the line of sight (LOS) path between the communication TX and RX. Meanwhile, in the second sum of (II), βrc,n,1\beta^{\prime}_{\text{rc},n,1} refers to the direct cross interference from the radar TX to the communication RX. This is usually the strongest interference to the communication RX induced by spectrum sharing.

Assumption 1: The propagation delay spread Δτ\Delta\tau, i.e., the difference between the smallest delay and largest delay, from the communication/radar TXs to the communication/radar RX is small with respect to (w.r.t.) the pulse duration TT.

Assumption 1 is usually satisfied in a multicarrier system since each subcarrier is a narrowband system with a bandwidth Δf1/Δτ\Delta f\ll 1/\Delta\tau [29, Section 12.1]. In other words, Assumption 1 implies |τcc,kτcc,1|T|\tau_{\text{cc},k}-\tau_{\text{cc},1}|\ll T, for k>1k>1, and |τ~rc,kτcc,1|T|\widetilde{\tau}_{\text{rc},k}-\tau_{\text{cc},1}|\ll T, k\forall k, in (II).

After down-conversion, yc,n(t)y_{\text{c},n}(t) passes through a matched filter (MF) matched to the LOS communication waveform qc(tτcc,1)q_{\text{c}}(t-\tau_{\text{cc},1}) and is sampled at the symbol rate, which yields [30, Section 5.1]

yc,n=αcc,ndnpc,n+βrc,npr,n+wc,n,y_{\text{c},n}=\alpha_{\text{cc},n}d_{n}\sqrt{p_{\text{c},n}}+\beta_{\text{rc},n}\sqrt{p_{\text{r},n}}+w_{\text{c},n}, (4)

where

αcc,n\displaystyle\alpha_{\text{cc},n} =Tk=1Kccαcc,n,kqc(tτcc,k)qc(tτcc,1)dt,\displaystyle=\int_{T}\sum_{k=1}^{K_{\text{cc}}}\alpha^{\prime}_{\text{cc},n,k}q_{\text{c}}(t-\tau_{\text{cc},k})q_{\text{c}}^{\ast}(t-\tau_{\text{cc},1})dt, (5)
βrc,n\displaystyle\beta_{\text{rc},n} =Tk=1Krcβrc,n,kqr(tτ~rc,k)qc(tτcc,1)dt,\displaystyle=\int_{T}\sum_{k=1}^{K_{\text{rc}}}\beta^{\prime}_{\text{rc},n,k}q_{\text{r}}(t-\widetilde{\tau}_{\text{rc},k})q_{\text{c}}^{\ast}(t-\tau_{\text{cc},1})dt, (6)

and wc,nw_{\text{c},n} is a zero-mean noise with variance σc2\sigma_{\text{c}}^{2}.

Now consider the radar received signal. Although the target is illuminated by both the radar TX and communication TX, we assume

Assumption 2: The target echo due to the illumination from the communication source is negligible.

This assumption is valid because the communication source usually employs an omni-directional antenna for transmission, which leads to a much weaker target reflection compared with the target reflection due to the illumination from a directional radar TX.

Suppose there is a moving target located at range RR from the radar with a target radial velocity vv. The round-trip delay between the radar and target is τrr=2R/c\tau_{\text{rr}}=2R/c, where cc is the speed of light. Then, the received signal at the radar RX on the nn-th subcarrier can be written as [21]

yr,n(t)\displaystyle y_{\text{r},n}(t) =α¯αrr,nxr,n(ε(tτrr))+k=1Krrβrr,n,kxr,n(tτ~rr,k)\displaystyle=\bar{\alpha}\alpha^{\prime}_{\text{rr},n}x_{\text{r},n}\big{(}\varepsilon(t-\tau_{\text{rr}})\big{)}+\sum_{k=1}^{K_{\text{rr}}}\beta^{\prime}_{\text{rr},n,k}x_{\text{r},n}(t-\widetilde{\tau}_{\text{rr},k})
+k=1Kcrβcr,n,kxc,n(tτ~cr,k)+wr,n(t),\displaystyle+\sum_{k=1}^{K_{\text{cr}}}\beta^{\prime}_{\text{cr},n,k}x_{\text{c},n}(t-\widetilde{\tau}_{\text{cr},k})+w^{\prime}_{\text{r},n}(t), (7)

where α¯\bar{\alpha} is the radar cross-section (RCS), αrr,n\alpha^{\prime}_{\text{rr},n} is a complex quantity representing the channel coefficient of the target path, ε=1+2vc\varepsilon=1+\frac{2v}{c} is a scaling factor for the target Doppler shift, βrr,n,k\beta^{\prime}_{\text{rr},n,k} denotes the complex scattering coefficient of the kk-th clutter scatterer due to radar illumination with propagation delay τ~rr,k\widetilde{\tau}_{\text{rr},k}, βcr,n,k\beta^{\prime}_{\text{cr},n,k} and τ~cr,k\widetilde{\tau}_{\text{cr},k} are the scattering coefficient and, respectively, propagation delay associated with the kk-th clutter scatterer due to the communication illumination, KrrK_{\text{rr}} and KcrK_{\text{cr}} are the total numbers of clutter scatterers observed at the radar RX due to the illumination of the radar TX and, respectively, communication TX, and wr,n(t)w^{\prime}_{\text{r},n}(t) is the additive channel noise. Note that the direct-path interference from the communication TX to the radar RX is included as the first term of the second sum in (II), with τ~cr,1\widetilde{\tau}_{\text{cr},1} corresponding to the propagation delay between the communication TX and radar RX.

The radar signal yr,n(t)y_{\text{r},n}(t) is down-converted, Doppler compensated, filtered by a MF matched to the radar waveform qr(tτrr)q_{\text{r}}(t-\tau_{\text{rr}}), and sampled at the pulse rate. Like in the communication system, the propagation spread is assumed to be relatively small compared with the pulse duration TT. The MF output can be written as [31, Section 4.2]:

yr,n=αrr,npr,n+βrr,npr,n+βcr,ndnpc,n+wr,n,\displaystyle y_{\text{r},n}=\alpha_{\text{rr},n}\sqrt{p_{\text{r},n}}+\beta_{\text{rr},n}\sqrt{p_{\text{r},n}}+\beta_{\text{cr},n}d_{n}\sqrt{p_{\text{c},n}}+w_{\text{r},n}, (8)

where

αrr,n=\displaystyle\alpha_{\text{rr},n}= α¯Tαrr,nqr(tτrr)qr(tτrr)𝑑t,\displaystyle\bar{\alpha}\int_{T}\alpha^{\prime}_{\text{rr},n}q_{\text{r}}(t-\tau_{\text{rr}})q_{\text{r}}^{\ast}(t-\tau_{\text{rr}})dt, (9)
βrr,n=\displaystyle\beta_{\text{rr},n}= Tk=1Krrβrr,n,kqr(tτ~rr,k)qr(tτrr)dt,\displaystyle\int_{T}\sum_{k=1}^{K_{\text{rr}}}\beta^{\prime}_{\text{rr},n,k}q_{\text{r}}(t-\widetilde{\tau}_{\text{rr},k})q_{\text{r}}^{\ast}(t-\tau_{\text{rr}})dt, (10)
βcr,n=\displaystyle\beta_{\text{cr},n}= Tk=1Kcrβcr,n,kqc(tτ~cr,k)qr(tτrr)dt,\displaystyle\int_{T}\sum_{k=1}^{K_{\text{cr}}}\beta^{\prime}_{\text{cr},n,k}q_{\text{c}}(t-\widetilde{\tau}_{\text{cr},k})q_{\text{r}}^{\ast}(t-\tau_{\text{rr}})dt, (11)

and wr,nw_{\text{r},n} is the output noise with zero mean and variance σr2\sigma_{\text{r}}^{2}.

In this paper, the problem of interest is to jointly design the power allocation vectors 𝐩r{\bf p}_{\text{r}} and 𝐩c{\bf p}_{\text{c}} based on the radar-communication coexistence model in (4) and (8).

III Proposed Approaches

In this section, we propose two power allocation designs for the coexistence problem. The first one is a joint design, which considers the case when the radar and communication systems are fully cooperative, i.e., parameters of both systems are jointly designed to tackle the cross-interference induced by coexistence. The second one is a unilateral design, which is useful when the communication system is the primary user of the frequency band and the radar system wants to join and co-exist as a secondary user.

III-A Joint Design

The figure of merit for the communication system is the achievable channel throughput, which is given by

C(𝐩r,𝐩c)=n=1Nlog2(1+γcc,npc,nηrc,npr,n+1),\displaystyle C({\bf p}_{\text{r}},{\bf p}_{\text{c}})=\sum_{n=1}^{N}\log_{2}\Big{(}1+\frac{\gamma_{\text{cc},n}p_{\text{c},n}}{\eta_{\text{rc},n}p_{\text{r},n}+1}\Big{)}, (12)

where γcc,n=𝔼{|αcc,n|2}σc2\gamma_{\text{cc},n}=\frac{\mathbb{E}\{|\alpha_{\text{cc},n}|^{2}\}}{\sigma_{\text{c}}^{2}} and ηrc,n=𝔼{|αrc,n|2}σc2\eta_{\text{rc},n}=\frac{\mathbb{E}\{|\alpha_{\text{rc},n}|^{2}\}}{\sigma_{\text{c}}^{2}} denote the normalized signal-to-noise ratio (SNR) and normalized interference-to-noise ratio (INR) at the communication receiver, which are effectively the SNR or INR per unit transmission power. 𝔼{}\mathbb{E}\{\cdot\} represents the statistical expectation. For the radar system, the figure of merit is the SINR

SINR(𝐩r,𝐩c)=n=1Nγrr,npr,nηrr,npr,n+ηcr,npc,n+1,\displaystyle\text{SINR}({\bf p}_{\text{r}},{\bf p}_{\text{c}})=\sum_{n=1}^{N}\frac{\gamma_{\text{rr},n}p_{\text{r},n}}{\eta_{\text{rr},n}p_{\text{r},n}+\eta_{\text{cr},n}p_{\text{c},n}+1}, (13)

where γrr,n=𝔼{|αrr,n|2}σr2\gamma_{\text{rr},n}=\frac{\mathbb{E}\{|\alpha_{\text{rr},n}|^{2}\}}{\sigma_{\text{r}}^{2}}, ηrr,n=𝔼{|βrr,n|2}σr2\eta_{\text{rr},n}=\frac{\mathbb{E}\{|\beta_{\text{rr},n}|^{2}\}}{\sigma_{\text{r}}^{2}}, and ηcr,n=𝔼{|βcr,n|2}σr2\eta_{\text{cr},n}=\frac{\mathbb{E}\{|\beta_{\text{cr},n}|^{2}\}}{\sigma_{\text{r}}^{2}} are the normalized SNR, clutter-to-noise ratio (CNR), and INR, respectively. The joint power allocation problem is formulated as maximizing the radar SINR under throughput and power constraints:

max𝐩r,𝐩cSINR(𝐩r,𝐩c),\displaystyle\max\limits_{{\bf p}_{\text{r}},{\bf p}_{\text{c}}}~{}~{}\text{SINR}({\bf p}_{\text{r}},{\bf p}_{\text{c}}), (14a)
s.t.n=1Npr,nPr,n=1Npc,nPc,\displaystyle\text{s.t.}~{}\sum_{n=1}^{N}p_{\text{r},n}\leq P_{\text{r}},~{}\sum_{n=1}^{N}p_{\text{c},n}\leq P_{\text{c}}, (14b)
0pr,nξr,0pc,nξc,n,\displaystyle 0\leq p_{\text{r},n}\leq\xi_{\text{r}},~{}0\leq p_{\text{c},n}\leq\xi_{\text{c}},~{}\forall~{}n, (14c)
C(𝐩r,𝐩c)κ,\displaystyle C({\bf p}_{\text{r}},{\bf p}_{\text{c}})\geq\kappa, (14d)

where (14b) represents the total transmission power constraint for each system, (14c) denotes subchannel peak power constraints, and (14d) is a communication throughput constraint.

The joint design problem (14) is nonconvex since the objective function and the constraint (14d) are both nonconvex. The above problem may be solved by employing an alternating optimization procedure [32]. The idea is to iteratively solve (14) w.r.t. 𝐩r{\bf p}_{r} while keeping 𝐩c{\bf p}_{c} fixed, and vice versa, until convergence is reached. However, this alternating maximization method is computationally intensive and does not guarantee convergence. This is particularly so for the considered cluttered environment, where the clutter term in the SINR depends on the power allocation variable 𝐩r{\bf p}_{\text{r}}, which makes the optimization problem significantly more challenging even with fixed 𝐩c{\bf p}_{\text{c}}. To address these challenges, we consider a different approach that is described next.

Specifically, let us define 𝜼c,n=[ηrc,n, 0]T\boldsymbol{\eta}_{\text{c},n}=[\eta_{\text{rc},n},\ 0]^{T}, 𝜼r,n=[ηrr,n,ηcr,n]T\boldsymbol{\eta}_{\text{r},n}=[\eta_{\text{rr},n},\ \eta_{\text{cr},n}]^{T}, 𝜸r,n=[γrr,n, 0]T\boldsymbol{\gamma}_{\text{r},n}=[\gamma_{\text{rr},n},\ 0]^{T}, 𝜸c,n=[0,γcc,n]T\boldsymbol{\gamma}_{\text{c},n}=[0,\ \gamma_{\text{cc},n}]^{T}, and 𝐏=[𝐩rT;𝐩cT]{\bf P}=[{\bf p}_{\text{r}}^{T};\ {\bf p}_{\text{c}}^{T}] is a 2×N2\times N matrix. Then, (14) can be rewritten as

max𝐏n=1N𝜸r,nT𝐏𝐬n𝜼r,nT𝐏𝐬n+1,\displaystyle\max\limits_{{\bf P}}~{}~{}\sum_{n=1}^{N}\frac{\boldsymbol{\gamma}_{\text{r},n}^{T}{\bf P}{\bf s}_{n}}{\boldsymbol{\eta}_{\text{r},n}^{T}{\bf P}{\bf s}_{n}+1}, (15a)
s.t.(14b),(14c),\displaystyle\text{s.t.}~{}\eqref{equ:sharing_c1},~{}\eqref{equ:sharing_c2}, (15b)
n=1Nlog2(1+𝜸c,nT𝐏𝐬n𝜼c,nT𝐏𝐬n+1)κ,\displaystyle\sum_{n=1}^{N}\log_{2}\Big{(}1+\frac{\boldsymbol{\gamma}_{\text{c},n}^{T}{\bf P}{\bf s}_{n}}{\boldsymbol{\eta}_{\text{c},n}^{T}{\bf P}{\bf s}_{n}+1}\Big{)}\geq\kappa, (15c)

where 𝐬n{\bf s}_{n} is a N×1N\times 1 selection vector given by

𝐬n(i)={1,i=n,0,otherwise.{\bf s}_{n}(i)=\begin{cases}1,~{}i=n,\\ 0,~{}\text{otherwise}.\end{cases} (16)

Note that (15) is a fractional programming (FP) with the objective function being a sum of multiple ratios.

Remark 1: The conventional alternating optimization approach usually decomposes the original nonconvex problem (14) into two subproblems in 𝐩r{\bf p}_{r} and 𝐩c{\bf p}_{c}, respectively [33, 11, 12, 32, 34, 13]. Although the subproblems are simpler than the original problem, they are still nonconvex and require convex relaxation techniques to solve. Specifically, when 𝐩c{\bf p}_{c} is fixed, the subproblem in 𝐩r{\bf p}_{r} has a similar form as (15), which is multiple-ratio FP problem. On the other hand, when fixing 𝐩r{\bf p}_{r}, the resulting subproblem is also nonconvex. The alternating approach needs to solve both nonconvex subproblems multiple times till convergence or a fixed number of iterations is completed. To bypass the alternating procedure, we combine the design variables into a single stacked variable and transfer the original problem into a simplified form. A direct benefit is computational saving since we need to solve the multiple-ratio FP problem only once. Simulation results show that the complexity of the proposed algorithm is considerably lower than that of the alternating procedure.

The multiple-ratio FP problem (15) is nonconvex since the objective function is a sum of ratios, which is nonconvex, and the throughput constraint (15c) imposes a nonconvex feasible set. To solve (15), we can reformulate the objective function and employ an inner iteration based on convex relaxation for the throughput constraint. First, for the objective function, a quadratic transform can be used [35]. This approach introduces a set of slack variables 𝝀=[λ1,,λN]T\boldsymbol{\lambda}=[\lambda_{1},\cdots,\lambda_{N}]^{T} to deal with the nonconvexity. Specifically, problem (15) is equivalent to

max𝐏,𝝀F(𝝀,𝐏),\displaystyle\max\limits_{{\bf P},\boldsymbol{\lambda}}~{}~{}F(\boldsymbol{\lambda},{\bf P}), (17a)
s.t.(14b),(14c),(15c),\displaystyle\text{s.t.}~{}\eqref{equ:sharing_c1},~{}\eqref{equ:sharing_c2},~{}\eqref{equ:sharingNon_c3}, (17b)

where

F(𝝀,𝐏)=n=1N(2λn𝜸r,nT𝐏𝐬nλn2(𝜼r,nT𝐏𝐬n+1)).\displaystyle F(\boldsymbol{\lambda},{\bf P})=\sum_{n=1}^{N}\Big{(}2\lambda_{n}\sqrt{\boldsymbol{\gamma}_{\text{r},n}^{T}{\bf P}{\bf s}_{n}}-\lambda_{n}^{2}\big{(}\boldsymbol{\eta}_{\text{r},n}^{T}{\bf P}{\bf s}_{n}+1\big{)}\Big{)}. (18)

Let λn(1)\lambda_{n}^{(\ell-1)} and 𝐏~(1)\tilde{{\bf P}}^{(\ell-1)} denote the solutions obtained from the (1)(\ell-1)-st iteration. Then, λn()\lambda_{n}^{(\ell)} can be updated by solving the following problem:

max𝝀F(𝝀,𝐏~(1)),\max\limits_{\boldsymbol{\lambda}}~{}~{}F(\boldsymbol{\lambda},\tilde{{\bf P}}^{(\ell-1)}), (19)

which has a closed-form solution:

λn()=𝜸r,nT𝐏~(1)𝐬n𝜼r,nT𝐏~(1)𝐬n+1.\lambda_{n}^{(\ell)}=\frac{\sqrt{\boldsymbol{\gamma}_{\text{r},n}^{T}\tilde{{\bf P}}^{(\ell-1)}{\bf s}_{n}}}{\boldsymbol{\eta}_{\text{r},n}^{T}\tilde{{\bf P}}^{(\ell-1)}{\bf s}_{n}+1}. (20)

In turn, 𝐏~()\tilde{{\bf P}}^{(\ell)} can be obtained by solving

max𝐏F(𝝀(),𝐏),\displaystyle\max\limits_{{\bf P}}~{}~{}F(\boldsymbol{\lambda}^{(\ell)},{\bf P}), (21a)
s.t.(14b),(14c),(15c),\displaystyle\text{s.t.}~{}\eqref{equ:sharing_c1},~{}\eqref{equ:sharing_c2},~{}\eqref{equ:sharingNon_c3}, (21b)

Note that the above problem is nonconvex since (15c) imposes a nonconvex set. We can use a SCP process to relax constraint (15c) by converting it into a convex set along with an inner iteration to solve (21). Specifically, (15c) can be relaxed into a linear form as

n=1Nlog2(𝜸c,nT𝐏𝐬n+𝜼c,nT𝐏𝐬n+1)G(𝐏,𝐏^(s1))κ,\sum_{n=1}^{N}\log_{2}\big{(}\boldsymbol{\gamma}_{\text{c},n}^{T}{\bf P}{\bf s}_{n}+\boldsymbol{\eta}_{\text{c},n}^{T}{\bf P}{\bf s}_{n}+1\big{)}-G({\bf P},\hat{{\bf P}}^{(\ell_{\text{s}}-1)})\geq\kappa, (22)

where 𝐏^(s1)\hat{{\bf P}}^{(\ell_{\text{s}}-1)} is the power vector from the (s1)(\ell_{\text{s}}-1)-st inner SCP iteration and

G(𝐏,𝐏^(s1))\displaystyle G({\bf P},\hat{{\bf P}}^{(\ell_{\text{s}}-1)}) log2(𝜼c,nT𝐏^(s1)𝐬n+1)\displaystyle\triangleq\log_{2}(\boldsymbol{\eta}_{\text{c},n}^{T}\hat{{\bf P}}^{(\ell_{\text{s}}-1)}{\bf s}_{n}+1)
+𝜼c,nT(𝐏𝐏^(s1))𝐬nln2(𝜼c,nT𝐏^(s1)𝐬n+1).\displaystyle+\frac{\boldsymbol{\eta}_{\text{c},n}^{T}({\bf P}-\hat{{\bf P}}^{(\ell_{\text{s}}-1)}){\bf s}_{n}}{\ln 2(\boldsymbol{\eta}_{\text{c},n}^{T}\hat{{\bf P}}^{(\ell_{\text{s}}-1)}{\bf s}_{n}+1)}. (23)

Thus, during the s\ell_{\text{s}}-th inner SCP iteration, the following convex optimization problem is solved to obtain 𝐏^(s)\hat{{\bf P}}^{(\ell_{\text{s}})}:

max𝐏F(𝝀(),𝐏),\displaystyle\max\limits_{{\bf P}}~{}~{}F(\boldsymbol{\lambda}^{(\ell)},{\bf P}), (24a)
s.t.(14b),(14c),(22).\displaystyle\text{s.t.}~{}\eqref{equ:sharing_c1},~{}\eqref{equ:sharing_c2},~{}\eqref{equ:consrate}. (24b)

After convergence, 𝐏~()=𝐏^(s)\tilde{{\bf P}}^{(\ell)}=\hat{{\bf P}}^{(\ell_{\text{s}})} is used in (20) to compute λn\lambda_{n} for the next quadratic transform iteration. Our proposed solution to the joint design problem is summarized in Algorithm 1.

The computational complexity of Algorithm 1 depends on the number of the quadratic transform iterations LL as well as the number of the SCP iterations LsL_{\text{s}}. Simulations show that the required number of the inner or outer iteration is relatively small. In addition, the convex problem (24) inside the iteration has a complexity of 𝒪(N3.5)\mathcal{O}(N^{3.5}) when an interior-point method is used [36]. Thus, the overall complexity of the proposed solution is 𝒪(LLsN3.5)\mathcal{O}(LL_{\text{s}}N^{3.5}).

Algorithm 1 Proposed Joint Design
  Input: Channel SNRs γrr,n\gamma_{\text{rr},n} and γcc,n\gamma_{\text{cc},n}, channel INRs ηrc,n\eta_{\text{rc},n} and ηcr,n\eta_{\text{cr},n}, CNR ηrr,n\eta_{\text{rr},n}, total powers PrP_{\text{r}} and PcP_{\text{c}}, peak power constraints ξr\xi_{\text{r}} and ξc\xi_{\text{c}}, throughput constraint κ\kappa, and tolerance ϵ\epsilon.
  Output: Radar and communication powers 𝐏{\bf P}.
  Initialization: Initialize 𝐏~(0)\tilde{{\bf P}}^{(0)} and set iteration index =0\ell=0.
  repeat
     
  1. 1.

    Set =+1\ell=\ell+1.

  2. 2.

    Solve problem (20) to obtain λn()\lambda_{n}^{(\ell)}.

  3. 3.

    Initialization: s=0\ell_{\text{s}}=0 and 𝐏^(s)=𝐏~(1)\hat{{\bf P}}^{(\ell_{\text{s}})}=\tilde{{\bf P}}^{(\ell-1)}.

  4. 4.

    repeat

    1. (a)

      Set s=s+1\ell_{\text{s}}=\ell_{\text{s}}+1.

    2. (b)

      Solve problem (24) with fixed 𝐏^(s1)\hat{{\bf P}}^{(\ell_{\text{s}}-1)} and λn()\lambda_{n}^{(\ell)} to obtain 𝐏^(s)\hat{{\bf P}}^{(\ell_{\text{s}})}.

  5. 5.

    until convergence.

  6. 6.

    Update 𝐏~()=𝐏^(s)\tilde{{\bf P}}^{(\ell)}=\hat{{\bf P}}^{(\ell_{\text{s}})}.

  until convergence.
  return  𝐏=𝐏~(){\bf P}=\tilde{{\bf P}}^{(\ell)}.

III-B Unilateral Design

The above joint design requires mutual cooperation of both radar and communication systems. However, in some scenarios, the communication system may be the primary and pre-existing user of the frequency band, while the radar occasionally joins and co-exists with the primary user. Thus, we consider a second spectrum sharing framework based on a unilateral design from the radar perspective that optimizes the radar transmission power 𝐩r{\bf p}_{\text{r}} when the communication transmission power is known and fixed [18].

Specifically, suppose the communication system pre-exists and employs a waterfilling approach to allocate subchannel power before the radar enters the channel:

𝐩~c=argmax𝐩cn=1Nlog2(1+γcc,npc,n),\displaystyle\tilde{{\bf p}}_{\text{c}}=\arg~{}\max\limits_{{\bf p}_{\text{c}}}~{}~{}\sum_{n=1}^{N}\log_{2}\Big{(}1+\gamma_{\text{cc},n}p_{\text{c},n}\Big{)}, (25a)
s.t.n=1Npc,nPc,0pc,nξc,n,\displaystyle\text{s.t.}~{}\sum_{n=1}^{N}p_{\text{c},n}\leq P_{\text{c}},~{}0\leq p_{\text{c},n}\leq\xi_{\text{c}},~{}\forall~{}n, (25b)

which is convex and can be solved by waterfilling.

When the radar needs to access the channel, it acquires the knowledge of communication power allocation and uses a strategy to maximize its SINR, subject to a minimum communication throughput constraint and power constraints:

max𝐩rn=1Nγrr,npr,nηrr,npr,n+ηcr,np~c,n+1,\displaystyle\max\limits_{{\bf p}_{\text{r}}}~{}~{}\sum_{n=1}^{N}\frac{\gamma_{\text{rr},n}p_{\text{r},n}}{\eta_{\text{rr},n}p_{\text{r},n}+\eta_{\text{cr},n}\tilde{p}_{\text{c},n}+1}, (26a)
s.t.0pr,nξr,n,n=1Npr,nPr,\displaystyle\text{s.t.}~{}0\leq p_{\text{r},n}\leq\xi_{\text{r}},~{}\forall~{}n,~{}\sum_{n=1}^{N}p_{\text{r},n}\leq P_{\text{r}}, (26b)
n=1Nlog2(1+γcc,np~c,nηrc,npr,n+1)κ.\displaystyle\sum_{n=1}^{N}\log_{2}\Big{(}1+\frac{\gamma_{\text{cc},n}\tilde{p}_{\text{c},n}}{\eta_{\text{rc},n}p_{\text{r},n}+1}\Big{)}\geq\kappa. (26c)

The objective function can be rewritten as

n=1Nγrr,nηrr,nn=1Nγrr,n(ηcr,np~c,n+1)ηrr,n2pr,n+ηrr,n(ηcr,np~c,n+1).\sum_{n=1}^{N}\frac{\gamma_{\text{rr},n}}{\eta_{\text{rr},n}}-\sum_{n=1}^{N}\frac{\gamma_{\text{rr},n}(\eta_{\text{cr},n}\tilde{p}_{\text{c},n}+1)}{\eta_{\text{rr},n}^{2}p_{\text{r},n}+\eta_{\text{rr},n}(\eta_{\text{cr},n}\tilde{p}_{\text{c},n}+1)}. (27)

Thus, problem (26) is equivalent to

min𝐩rn=1Nγrr,n(ηcr,np~c,n+1)ηrr,n2pr,n+ηrr,n(ηcr,np~c,n+1),\displaystyle\min\limits_{{\bf p}_{\text{r}}}~{}~{}\sum_{n=1}^{N}\frac{\gamma_{\text{rr},n}(\eta_{\text{cr},n}\tilde{p}_{\text{c},n}+1)}{\eta_{\text{rr},n}^{2}p_{\text{r},n}+\eta_{\text{rr},n}(\eta_{\text{cr},n}\tilde{p}_{\text{c},n}+1)}, (28a)
s.t.(26b),(26c),\displaystyle\text{s.t.}~{}\eqref{equ:c1_ad-scp},~{}\eqref{equ:c2_ad-scp}, (28b)

Note that while the objective (28a) is convex, the above problem is nonconvex since (26c) is a nonconvex set. We can use the first-order Taylor expansion to convert the nonconvex constraint into a convex one and solve the relaxed problem using an SCP process. Specifically, rewrite the left side of (26c) as

n=1Nf(pr,n),\sum_{n=1}^{N}f(p_{\text{r},n}), (29)

where

f(pr,n)F1(pr,n|p~c,n)log2(ηrc,npr,n+1),f(p_{\text{r},n})\triangleq F_{1}(p_{\text{r},n}|\tilde{p}_{\text{c},n})-\log_{2}\big{(}\eta_{\text{rc},n}p_{\text{r},n}+1\big{)}, (30)

and

F1(pr,n|p~c,n)=log2(ηrc,npr,n+1+γcc,np~c,n).F_{1}(p_{\text{r},n}|\tilde{p}_{\text{c},n})=\log_{2}\big{(}\eta_{\text{rc},n}p_{\text{r},n}+1+\gamma_{\text{cc},n}\tilde{p}_{\text{c},n}\big{)}. (31)

It can be shown that f(pr,n)f(p_{\text{r},n}) is nonconvex w.r.t. pr,np_{\text{r},n} since it is a difference of two concave functions. The second concave function in (30) can be upper bounded by a first-order Taylor expansion at p~r,n(r1)\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)}:

log2(ηrc,npr,n+1)F2(pr,n|p~r,n(r1))log2(ηrc,np~r,n(r1)+1)+ηrc,n(pr,np~r,n(r1))ln2(ηrc,np~r,n(r1)+1),\begin{split}&\log_{2}\big{(}\eta_{\text{rc},n}p_{\text{r},n}+1\big{)}\leq F_{2}(p_{\text{r},n}|\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)})\\ &\triangleq\log_{2}\big{(}\eta_{\text{rc},n}\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)}+1\big{)}+\frac{\eta_{\text{rc},n}(p_{\text{r},n}-\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)})}{\ln 2(\eta_{\text{rc},n}\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)}+1)},\end{split} (32)

where p~r,n(r1)\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)} is the radar power from the (r1)(\ell_{\text{r}}-1)-st inner iteration. Clearly, the bound is tight at pr,n=p~r,n(r1)p_{\text{r},n}=\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)}:

log2(ηrc,np~r,n(r1)+1)=F2(p~r,n(r1)|p~r,n(r1)).\log_{2}\big{(}\eta_{\text{rc},n}\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)}+1\big{)}=F_{2}(\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)}|\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)}). (33)

Substituting (32) back into (30) gives the lower bound of f(pr,n)f(p_{\text{r},n}): f~(pr,n)=F1(pr,n|p~c,n)F2(pr,n|p~r,n(r1))\tilde{f}(p_{\text{r},n})=F_{1}(p_{\text{r},n}|\tilde{p}_{\text{c},n})-F_{2}(p_{\text{r},n}|\tilde{p}_{\text{r},n}^{(\ell_{\text{r}}-1)}). We can see that f~(pr,n)\tilde{f}(p_{\text{r},n}) is now an affine function of pr,np_{\text{r},n} and constraint (26c) becomes

n=1Nf~(pr,n)κ,\sum_{n=1}^{N}\tilde{f}(p_{\text{r},n})\geq\kappa, (34)

which is a convex set. Thus, during the r\ell_{\text{r}}-th inner SCP iteration, the following convex problem is solved for p~r,n(r)\tilde{p}_{\text{r},n}^{(\ell_{\text{r}})} until convergence:

min𝐩rn=1Nγrr,n(ηcr,np~c,n+1)ηrr,n2pr,n+ηrr,n(ηcr,np~c,n+1),\displaystyle\min\limits_{{\bf p}_{\text{r}}}~{}~{}\sum_{n=1}^{N}\frac{\gamma_{\text{rr},n}(\eta_{\text{cr},n}\widetilde{p}_{\text{c},n}+1)}{\eta_{\text{rr},n}^{2}p_{\text{r},n}+\eta_{\text{rr},n}(\eta_{\text{cr},n}\widetilde{p}_{\text{c},n}+1)}, (35a)
s.t.(26b),(34).\displaystyle\text{s.t.}~{}\eqref{equ:c1_ad-scp},~{}\eqref{equ:relaxc}. (35b)

The proposed solution is summarized in Algorithm 2.

Similar to Algorithm 1, the complexity of Algorithm 2 depends on the number of the SCP iterations LrL_{\text{r}} required for convergence, and the overall computational complexity is 𝒪(LrN3.5)\mathcal{O}(L_{\text{r}}N^{3.5}).

Algorithm 2 Proposed Unilateral Design
  Input: γrr,n\gamma_{\text{rr},n}, γcc,n\gamma_{\text{cc},n}, ηrc,n\eta_{\text{rc},n}, ηcr,n\eta_{\text{cr},n}, ηrr,n\eta_{\text{rr},n}, PrP_{\text{r}}, 𝐩~c\widetilde{{\bf p}}_{\text{c}}, ξr\xi_{\text{r}}, and κ\kappa (same as in Algorithm 1).
  Output: Radar powers 𝐩r{\bf p}_{\text{r}}.
  Initialization: Initialize p~r,n(0)\tilde{p}_{\text{r},n}^{(0)} and set iteration index r=0\ell_{\text{r}}=0.
  repeat
     
  1. 1.

    Set r=r+1\ell_{\text{r}}=\ell_{\text{r}}+1.

  2. 2.

    Solve problem (35) to obtain p~r,n(r)\tilde{p}_{\text{r},n}^{(\ell_{\text{r}})}.

  until convergence.
  return  pr,n=p~r,n(r)p_{\text{r},n}=\tilde{p}_{\text{r},n}^{(\ell_{\text{r}})}.

III-C Feasibility and Initialization Analysis

For the joint design problem (14), its feasibility depends on if the maximum achievable throughput (e.g., CmaxC_{\text{max}}) under the power constraints is no less than the minimum throughput constraint κ\kappa, that is, CmaxκC_{\text{max}}\geq\kappa. Clearly, CmaxC_{\text{max}} is achieved when the radar is absent while the communication system uses all subcarriers to maximize its throughput, which is the same as problem (25). In other words, problem (14) is feasible if the following condition is statisfied:

n=1Nlog2(1+γcc,np~c,n)κ.\sum_{n=1}^{N}\log_{2}\Big{(}1+\gamma_{\text{cc},n}\tilde{p}_{\text{c},n}\Big{)}\geq\kappa. (36)

It is easy to show that (36) provides also the feasible condition for the unilateral design.

Note that the proposed solutions for the joint and unilateral design requires initial values of 𝐩c{\bf p}_{c} and, respectively, 𝐩r{\bf p}_{\text{r}}. A simple way of initialization is to consider only the power constraints (14b) and (14c). A better way that also takes into account the throughput constraint (14d)\eqref{equ:sharing_c3} is a greedy search (GS) method, i.e., the communication system uses its best subcarriers to maintain the throughput constraint, while the radar employs the remaining subcarriers to maximize its SINR. The detailed steps of the GS method is summarized in Algorithm 3.

Algorithm 3 Greedy Search
  Input: γrr,n\gamma_{\text{rr},n}, γcc,n\gamma_{\text{cc},n}, ηrc,n\eta_{\text{rc},n}, ηcr,n\eta_{\text{cr},n}, ηrr,n\eta_{\text{rr},n}, PrP_{\text{r}}, PcP_{\text{c}}, ξr\xi_{\text{r}}, ξc\xi_{\text{c}}, and κ\kappa.
  Output: Radar and communication powers 𝐩r{\bf p}_{\text{r}} and 𝐩c{\bf p}_{\text{c}}.
  1. 1.

    Define a binary selection vector 𝐮=[u1,,uN]T{\bf u}=[u_{1},\cdots,u_{N}]^{T} with un{0,1}u_{n}\in\{0,1\}: un=1u_{n}=1 indicates the communication system uses the nn-th subcarrier; otherwise, the radar uses it.

  2. 2.

    Sort the normalized communication channel SNRs γcc,n\gamma_{cc,n} in a descending order. The SNRs after sorting are denoted by γcc,n,m\gamma_{\text{cc},n,m}, where the subscripts (n,m)(n,m) indicate the indices of a subcarrier before and after sorting.

  3. 3.

    Set ι=0\iota=0, which denotes the partial sum of the communication throughput, 𝐮=0{\bf u}=0, and m=1m=1.

  4. 4.

    repeat

  5. 5.
    1. (a)

      un=1u_{n}=1 and m=m+1m=m+1.

    2. (b)

      Solve the following convex problem and denote the solution by 𝐩^c\hat{{\bf p}}_{\text{c}}:

      max𝐩cn=1Nlog2(1+unγcc,n,mpc,n),\displaystyle\max\limits_{{\bf p}_{\text{c}}}~{}\sum_{n=1}^{N}\log_{2}\Big{(}1+u_{n}\gamma_{\text{cc},n,m}p_{\text{c},n}\Big{)}, (37a)
      s.t.n=1Nunpc,nPc,\displaystyle\text{s.t.}~{}\sum_{n=1}^{N}u_{n}p_{\text{c},n}\leq P_{\text{c}}, (37b)
      0unpc,nξc,n,\displaystyle~{}0\leq u_{n}p_{\text{c},n}\leq\xi_{\text{c}},~{}\forall~{}n, (37c)
    3. (c)

      Compute ι=n=1Nlog2(1+unγcc,n,mp^c,n)\iota=\sum_{n=1}^{N}\log_{2}\big{(}1+u_{n}\gamma_{\text{cc},n,m}\hat{p}_{\text{c},n}\big{)}.

  6. 6.

    until ικ\iota\geq\kappa.

  7. 7.

    Compute the radar power 𝐩^r\hat{{\bf p}}_{\text{r}} by solving:

    min𝐩rn=1Nγrr,n(ηcr,nunp^c,n+1)ηrr,n2(1un)pr,n+ηrr,n(ηcr,nunp^c,n+1),\displaystyle\min\limits_{{\bf p}_{\text{r}}}~{}\sum_{n=1}^{N}\frac{\gamma_{\text{rr},n}(\eta_{\text{cr},n}u_{n}\hat{p}_{\text{c},n}+1)}{\eta_{\text{rr},n}^{2}(1-u_{n})p_{\text{r},n}+\eta_{\text{rr},n}(\eta_{\text{cr},n}u_{n}\hat{p}_{\text{c},n}+1)}, (38a)
    s.t.n=1N(1un)pr,nPr,\displaystyle\text{s.t.}~{}\sum_{n=1}^{N}(1-u_{n})p_{\text{r},n}\leq P_{\text{r}}, (38b)
    0(1un)pr,nξr,n,\displaystyle~{}0\leq(1-u_{n})p_{\text{r},n}\leq\xi_{\text{r}},~{}\forall~{}n, (38c)
  return  𝐩c=𝐩^c𝐮{\bf p}_{\text{c}}=\hat{{\bf p}}_{\text{c}}\odot{\bf u} and 𝐩r=(𝟏1×N𝐮)𝐩^r{\bf p}_{\text{r}}=(\mathbf{1}_{1\times N}-{\bf u})\odot\hat{{\bf p}}_{\text{r}}.

IV Numerical Simulations

In this section, numerical results are presented to illustrate the performance of different methods for spectrum sharing between multicarrier radar and communication systems. Specifically, we compare the proposed joint design in Section III-A and unilateral design in Section III-B with the heuristic greedy search method. In addition, we include the optimum radar output SINR, under the condition when the communication system is absent (denoted as comm absent), as an upper bound.

Unless stated otherwise, the number of subcarriers N=16N=16, the convergence tolerance is 0.010.01, the noise variance σr2=σc2=1\sigma^{2}_{\text{r}}=\sigma_{\text{c}}^{2}=1, and the communication throughput constraint is κ=2.5\kappa=2.5 bits/s/Hz in most examples. The subcarrier channel coefficients αrr,n\alpha_{\text{rr},n}, αcc,n\alpha_{\text{cc},n}, βrc,n\beta_{\text{rc},n}, βrr,n\beta_{\text{rr},n}, and βcr,n\beta_{\text{cr},n} are generated with Gaussian distribution 𝒞𝒩(0,σrr2)\mathcal{C}\mathcal{N}(0,\sigma_{\text{rr}}^{2}), 𝒞𝒩(0,σcc2)\mathcal{C}\mathcal{N}(0,\sigma_{\text{cc}}^{2}), 𝒞𝒩(0,σrc2)\mathcal{C}\mathcal{N}(0,\sigma_{\text{rc}}^{2}), 𝒞𝒩(0,σ2)\mathcal{C}\mathcal{N}(0,\sigma^{2}) and 𝒞𝒩(0,σcr2)\mathcal{C}\mathcal{N}(0,\sigma_{\text{cr}}^{2}), respectively. The strength of the desired signal for both systems, indicated by σrr2\sigma_{\text{rr}}^{2} and σcc2\sigma_{\text{cc}}^{2}, are normalized as σrr2=σcc2=1\sigma_{\text{rr}}^{2}=\sigma_{\text{cc}}^{2}=1. The clutter strength σ2=0.05\sigma^{2}=0.05. In the sequel, we consider two coexistence scenarios characterized by the strength of the cross interference:

  • Case 1 (weak cross interference): σrc2=σcr2=0.01\sigma_{\text{rc}}^{2}=\sigma_{\text{cr}}^{2}=0.01.

  • Case 2 (strong cross interference): σrc2=σcr2=0.1\sigma_{\text{rc}}^{2}=\sigma_{\text{cr}}^{2}=0.1.

In the simulation, 50 trials of channel realization are utilized to obtain the average performance.

First, we consider the computational complexity of the conventional alternating optimization approach, which decompose the original problem into two subproblems in 𝐩r{\bf p}_{\text{r}} and 𝐩c{\bf p}_{\text{c}}, and the proposed non-alternating method as discussed in Section III-A. Fig. 2 shows the CPU time measured by Matlab versus the total number of subcarriers NN for Case 1, where Pr=Pc=600P_{\text{r}}=P_{\text{c}}=600 and κ=1.5\kappa=1.5. It can be seen that the complexity of both methods grows as the number of subcarriers increase. However, the alternating algorithm is seen to take a longer time to converge for all cases considered. In particular, the alternating algorithm is around 8 times slower than the proposed non-alternating method at N=512N=512.

Refer to caption
Figure 2: Computer simulation time versus the number of subcarrier for the conventional alternating algorithm and the proposed non-alternating algorithm.

Fig. 3 shows the output radar SINR versus the total radar transmission power when Pc=600P_{\text{c}}=600 and κ=2.5\kappa=2.5 for Case 1 and Case 2, respectively. It can be seen from Fig. 3 (a) that with weak cross interference (Case 1), the output SINR of the joint design is very close to that of the comm absent scenario since the weak cross interference creates limited impact from one system to the other. On the other hand, there is a notable performance loss for the radar unilateral design due to the fixed communication power allocation. When the cross interference gets stronger (Case 2), as indicated in Fig. 3 (b), both the joint design and unilateral design degrade, although the unilateral design experiences a more severe performance loss. In both Case 1 and Case 2, the joint design and unilateral design, which involve subcarrier sharing between the radar and communication systems, outperform the GS method, which is a subcarrier-allocation based method. As the total radar transmission power increases, the output SINR of all considered scenarios increases.

Refer to caption
(a)
Refer to caption
(b)
Figure 3: Output SINR versus the total radar transmission power. (a) Weak cross interference (Case 1); (b) strong cross interference (Case 2).

Next, we evaluate the effects of the communication throughput constraint. Fig. 4 shows the output SINR versus κ\kappa, where Pr=Pc=600P_{\text{r}}=P_{\text{c}}=600. It can be seen that as the communication throughput constraint increases, the output SINR of all methods except for the comm absent degrades. This is because the communication needs to increase its transmission power to meet the increasing throughput constraint, which causes stronger interference to the radar system. Note, however, that the degradation of the joint design and unilateral design is considerably smaller in Case 1 than that in Case 2.

Refer to caption
(a)
Refer to caption
(b)
Figure 4: Output SINR versus the communication service constraint κ\kappa. (a) Weak cross interference (Case 1); (b) strong cross interference (Case 2).

Fig. 5 depicts the contour plot of the output SINR versus the total transmission power PrP_{\text{r}} and PcP_{\text{c}}. Each plot contains the isolines of the output SINR with a stepsize of 60. For the comm absent design, the contour lines are vertical, as its output SINR only depends on the total radar transmission power. The contour plot of the joint design is almost identical to that of the comm absent in Case 1 as indicated by Fig. 5 (a). This is because when the cross interference is weak, the impact from one system to the other is limited. On the other hand, the greedy search design has the worst performance since it requires the most radar and communication transmission power to achieve the same output SINR.

Fig. 5 (b) shows that the comm absent and greedy search in Case 2 share the same performance trend as those in Fig. 5 (a) since they are independent of cross interference. On the other hand, both the joint design and unilateral design are observed to degrade in Case 2, although the latter exhibits a larger performance degradation.

Refer to caption
(a)
Refer to caption
(b)
Figure 5: Contour plot of the output SINR versus the total radar power PrP_{\text{r}} and total communication power PcP_{\text{c}}. (a) Case 1; (b) Case 2.
Refer to caption
Figure 6: The channel strength of γrr,n\gamma_{\text{rr},n} and γcc,n\gamma_{\text{cc},n}.

To offer further insight, we look into the specific power allocation provided by different designs. We assume the multicarrier systems employ N=128N=128 subcarriers divided into four groups with each consisting of 32 subcarriers. The normalized INRs for the cross interference ηrc,n\eta_{\text{rc},n} and ηcr,n\eta_{\text{cr},n} are fixed as ηrc,n=ηcr,n=0.01\eta_{\text{rc},n}=\eta_{\text{cr},n}=0.01, n=1,,128n=1,\dots,128. The normalized CNR is ηrr,n=0.05\eta_{rr,n}=0.05. The desired channel strength γrr,n\gamma_{\text{rr},n} and γcc,n\gamma_{\text{cc},n} are depicted in Fig. 6, which show the first group of subcarriers (n=1,,32n=1,\dots,32) is good for both radar and communication, the second group (n=33,,64n=33,\dots,64) bad for both systems, the third group (n=65,,96n=65,\dots,96) good for radar but bad for the communication system, and the fourth group (n=97,,128n=97,\dots,128) is the opposite of the third group. The other parameters are Pr=Pc=600P_{\text{r}}=P_{\text{c}}=600 and κ=2.5\kappa=2.5 bits/s/Hz.

The specific subcarrier power allocation results are shown in Fig. 7, where the resulting SINR obtained by greedy search, unilateral design, and joint design are 28.4, 30.2 dB, and 31.3 dB, respectively. It is seen from Fig. 7 (a) that the greedy search design assigns to the communication system from its best subcarriers (n=1,32n=1,\dots 32 and n=99,,128n=99,\dots,128) until the throughput constraint is satisfied, whereas the radar employs the rest subcarrier to maximize its SINR as shown in Fig. 7 (b). For the unilateral design, the communication system first utilizes waterfilling to allocate its power [cf. (25)], and then the radar maximizes its output SINR based on (26). Interestingly, it is observed that the joint design reduces the communication power on the first and third groups of subcarriers to lower its interference to the radar and at the same time, increases the communication power on groups 2 and 4. This leads to an improved SINR for the radar system.

Refer to caption
(a)
Refer to caption
(b)
Figure 7: Power allocation for Pr=Pc=600P_{\text{r}}=P_{\text{c}}=600 and κ=2.5\kappa=2.5 bits/s/Hz. (a) Communication power allocation; (b) radar power allocation.

V Conclusion

Power allocation based spectrum sharing between multicarrier radar and communication systems was considered by maximizing the radar output SINR while meeting a communication throughput requirement along with total/peak power constraints. A joint design as well as a unilateral design were proposed to tackle the coexistence problem. Through suitable reformulation, the nonconvex joint design was solved by a computationally efficient non-alternating method, while the unilateral design was solved by a Taylor expansion based iterative convex relaxation procedure. Simulation results validated the effectiveness of the proposed spectrum sharing methods over the subcarrier-allocation based GS scheme.

References

  • [1] L. Zheng, M. Lops, Y. C. Eldar, and X. Wang, “Radar and communication coexistence: An overview: A review of recent methods,” IEEE Signal Processing Magazine, vol. 36, no. 5, pp. 85–99, Sep. 2019.
  • [2] A. Aubry, V. Carotenuto, A. De Maio, A. Farina, and L. Pallotta, “Optimization theory-based radar waveform design for spectrally dense environments,” IEEE Aerospace and Electronic Systems Magazine, vol. 31, no. 12, pp. 14–25, December 2016.
  • [3] B. Li and A. Petropulu, “Spectrum sharing between matrix completion based MIMO radars and a MIMO communication system,” in 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), April 2015, pp. 2444–2448.
  • [4] M. Bica˘\breve{a}, K. Huang, V. Koivunen, and U. Mitra, “Mutual information based radar waveform design for joint radar and cellular communication systems,” in 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), March 2016, pp. 3671–3675.
  • [5] F. Liu, C. Masouros, A. Li, T. Ratnarajah, and J. Zhou, “MIMO radar and cellular coexistence: A power-efficient approach enabled by interference exploitation,” IEEE Transactions on Signal Processing, vol. 66, no. 14, pp. 3681–3695, July 2018.
  • [6] F. Wang, H. Li, and M. A. Govoni, “Power allocation and co-design of multicarrier communication and radar systems for spectral coexistence,” IEEE Transactions on Signal Processing, vol. 67, no. 14, pp. 3818–3831, July 2019.
  • [7] B. Kang, O. Aldayel, V. Monga, and M. Rangaswamy, “Spatio-spectral radar beampattern design for coexistence with wireless communication systems,” IEEE Transactions on Aerospace and Electronic Systems, vol. 55, no. 2, pp. 644–657, April 2019.
  • [8] H. Shajaiah, A. Abdelhadi, and C. Clancy, “Spectrum sharing approach between radar and communication systems and its impact on radar’s detectable target parameters,” in 2015 IEEE 81st Vehicular Technology Conference (VTC Spring), May 2015, pp. 1–6.
  • [9] N. Nartasilpa, D. Tuninetti, N. Devroye, and D. Erricolo, “Let’s share commrad: Effect of radar interference on an uncoded data communication system,” in 2016 IEEE Radar Conference (RadarConf), May 2016, pp. 1–5.
  • [10] A. R. Chiriyath, B. Paul, G. M. Jacyna, and D. W. Bliss, “Inner bounds on performance of radar and communications co-existence,” IEEE Transactions on Signal Processing, vol. 64, no. 2, pp. 464–474, Jan 2016.
  • [11] B. Li and A. P. Petropulu, “Joint transmit designs for coexistence of MIMO wireless communications and sparse sensing radars in clutter,” IEEE Transactions on Aerospace and Electronic Systems, vol. 53, no. 6, pp. 2846–2864, Dec 2017.
  • [12] L. Zheng, M. Lops, X. Wang, and E. Grossi, “Joint design of overlaid communication systems and pulsed radars,” IEEE Transactions on Signal Processing, vol. 66, no. 1, pp. 139–154, Jan 2018.
  • [13] Z. Cheng, B. Liao, S. Shi, Z. He, and J. Li, “Co-design for overlaid MIMO radar and downlink MISO communication systems via Cramér–Rao Bound minimization,” IEEE Transactions on Signal Processing, vol. 67, no. 24, pp. 6227–6240, Dec 2019.
  • [14] F. Wang and H. Li, “Joint power allocation for radar and communication co-existence,” IEEE Signal Processing Letters, vol. 26, no. 11, pp. 1608–1612, Nov 2019.
  • [15] H. Deng and B. Himed, “Interference mitigation processing for spectrum-sharing between radar and wireless communications systems,” IEEE Transactions on Aerospace and Electronic Systems, vol. 49, no. 3, pp. 1911–1919, July 2013.
  • [16] Z. Geng, H. Deng, and B. Himed, “Adaptive radar beamforming for interference mitigation in radar-wireless spectrum sharing,” IEEE Signal Processing Letters, vol. 22, no. 4, pp. 484–488, April 2015.
  • [17] L. Zheng, M. Lops, and X. Wang, “Adaptive interference removal for uncoordinated radar/communication coexistence,” IEEE Journal of Selected Topics in Signal Processing, vol. 12, no. 1, pp. 45–60, Feb 2018.
  • [18] C. Shi, F. Wang, M. Sellathurai, J. Zhou, and S. Salous, “Power minimization-based robust OFDM radar waveform design for radar and communication systems in coexistence,” IEEE Transactions on Signal Processing, vol. 66, no. 5, pp. 1316–1330, March 2018.
  • [19] A. Aubry, A. De Maio, Y. Huang, M. Piezzo, and A. Farina, “A new radar waveform design algorithm with improved feasibility for spectral coexistence,” IEEE Transactions on Aerospace and Electronic Systems, vol. 51, no. 2, pp. 1029–1038, April 2015.
  • [20] A. Aubry, V. Carotenuto, and A. De Maio, “Forcing multiple spectral compatibility constraints in radar waveforms,” IEEE Signal Processing Letters, vol. 23, no. 4, pp. 483–487, April 2016.
  • [21] S. Sen and A. Nehorai, “Adaptive OFDM radar for target detection in multipath scenarios,” IEEE Transactions on Signal Processing, vol. 59, no. 1, pp. 78–90, Jan 2011.
  • [22] M. Bica˘\breve{a} and V. Koivunen, “Generalized multicarrier radar: Models and performance,” IEEE Transactions on Signal Processing, vol. 64, no. 17, pp. 4389–4402, Sept 2016.
  • [23] G. Lellouch, P. Tran, R. Pribic, and P. van Genderen, “OFDM waveforms for frequency agility and opportunities for Doppler processing in radar,” in 2008 IEEE Radar Conference, May 2008, pp. 1–6.
  • [24] P. S. Tan, J. M. Stiles, and S. D. Blunt, “Optimizing sparse allocation for radar spectrum sharing,” in 2016 IEEE Radar Conference (RadarConf), May 2016, pp. 1–6.
  • [25] M. Bica˘\breve{a} and V. Koivunen, “Radar waveform optimization for target parameter estimation in cooperative radar-communications systems,” IEEE Transactions on Aerospace and Electronic Systems, vol. 55, no. 5, pp. 2314–2326, Oct 2019.
  • [26] A. Aubry, A. De Maio, M. Piezzo, M. M. Naghsh, M. Soltanalian, and P. Stoica, “Cognitive radar waveform design for spectral coexistence in signal-dependent interference,” in 2014 IEEE Radar Conference, May 2014, pp. 0474–0478.
  • [27] J. Qian, M. Lops, L. Zheng, X. Wang, and Z. He, “Joint system design for coexistence of MIMO radar and MIMO communication,” IEEE Transactions on Signal Processing, vol. 66, no. 13, pp. 3504–3519, July 2018.
  • [28] E. Grossi, M. Lops, and L. Venturino, “Joint design of surveillance radar and MIMO communication in cluttered environments,” IEEE Transactions on Signal Processing, vol. 68, pp. 1544–1557, 2020.
  • [29] A. Goldsmith, Wireless Communications.   USA: Cambridge University Press, 2005.
  • [30] J. Proakis, Digital Communications, Forth Edition.   McGraw-Hill, 2001.
  • [31] M. Richards, Fundamentals of Radar Signal Processing, Second Edition.   McGraw-Hill Education, 2014.
  • [32] A. Aubry, A. De Maio, A. Zappone, M. Razaviyayn, and Z. Luo, “A new sequential optimization procedure and its applications to resource allocation for wireless systems,” IEEE Transactions on Signal Processing, vol. 66, no. 24, pp. 6518–6533, Dec 2018.
  • [33] B. Li, A. P. Petropulu, and W. Trappe, “Optimum co-design for spectrum sharing between matrix completion based MIMO radars and a MIMO communication system,” IEEE Transactions on Signal Processing, vol. 64, no. 17, pp. 4562–4575, Sep. 2016.
  • [34] M. Rihan and L. Huang, “Optimum co-design of spectrum sharing between MIMO radar and MIMO communication systems: An interference alignment approach,” IEEE Transactions on Vehicular Technology, vol. 67, no. 12, pp. 11 667–11 680, Dec 2018.
  • [35] K. Shen and W. Yu, “Fractional programming for communication systems—part i: Power control and beamforming,” IEEE Transactions on Signal Processing, vol. 66, no. 10, pp. 2616–2630, May 2018.
  • [36] S. Boyd and L. Vandenberghe, Convex Optimization.   Cambridge University Press, 2004.