Professional Documents
Culture Documents
2.NOMA Empowered Integrated Sensing and Communication
2.NOMA Empowered Integrated Sensing and Communication
2.NOMA Empowered Integrated Sensing and Communication
Abstract— A non-orthogonal multiple access (NOMA) Thus, even the requirement of the communication-only system
empowered integrated sensing and communication (ISAC) cannot be satisfied. In this case, it is generally impossible to
framework is investigated. A dual-functional base station serves integrate the sensing function into the communication system.
multiple communication users employing NOMA, while the
superimposed NOMA communication signal is simultaneously
As a remedy, non-orthogonal multiple access (NOMA) can
exploited for target sensing. A beamforming design problem is multiplex communication users in the power domain and
formulated to maximize the weighted sum of the communication mitigate the inter-user interference by exploiting successive
throughput and the effective sensing power. To solve this problem, interference cancellation (SIC) [9], which provides extra DoFs.
an efficient double-layer penalty-based algorithm is proposed Furthermore, NOMA can benefit ISAC by allowing more users
by invoking successive convex approximation. Numerical to be served than the conventional multiple access techniques,
results show that the proposed NOMA-ISAC outperforms the
conventional ISAC in the underloaded regime experiencing thus achieving higher spectral efficiency. However, to the best
highly correlated channels and in the overloaded regime. of the authors’ knowledge, the application of NOMA in ISAC
has not been studied yet, which motivates this work.
Index Terms— Beamforming design, integrated sensing and
communication (ISAC), non-orthogonal multiple access (NOMA).
In this letter, we propose a NOMA-ISAC framework,
in which the transmitted superimposed signal is exploited
I. I NTRODUCTION for communication and sensing simultaneously and SIC is
exploited for inter-user interference mitigation. We formulate
Authorized licensed use limited to: Heilongjiang University. Downloaded on December 13,2023 at 05:48:11 UTC from IEEE Xplore. Restrictions apply.
678 IEEE COMMUNICATIONS LETTERS, VOL. 26, NO. 3, MARCH 2022
Furthermore, We define Hk hk hH k . Then, for j ≥ k and s.t. (9c) − (9e), (10c), (10d), (14b), (14c). (16b)
k ∈ K, k = K, the constraint (10a) can be rewritten as
However, the second term in the penalty term makes the
Rk→j = log2 σn2 + Tr (Hj Wi ) objective not convex. By exploiting the first-order Taylor
i∈K,i≥k expansion at point Wkn , its upper bound of is given by
− log2 σn2 + Tr (Hj Wi ) ≥ γk . (11) n
−Wk 2 ≤ W
i∈K,i>k
k
n
−Wk 2 − Tr vmax,k
n n
(vmax,k )H (Wk − Wkn ) ,
Fj,k (17)
The non-convexity of this constraint lies in the second term
where vmax,k
n
is the eigenvector corresponding to the largest
Fj,k . To address this, we invoke the SCA. By using the
eigenvalue of Wkn . Thus, the problem (16) can be approxi-
first-order Taylor expansion at point W1n , . . . , WK
n
), we have
mated by the following problem
Fj,k ≥ Fj,k − log2 σn2 + Tr (Hj Win ) 1 kn
i∈K,i>k
max f (ρc , ρr , γk , Wk ) − Wk ∗ + W
γk ,Wk η
k∈K
i∈K,i>k Tr Hj (Wi − Win ) (18a)
− .
i∈K,i>k Tr (Hj Wi ) s.t. (9c) − (9e), (10c), (10d), (14b), (14c).
σn2 + n ln 2 (18b)
(12) The problem (18) is a quadratic semidefinite program (QSDP),
Then, we define which can be efficiently solved by the CVX toolbox [15].
It is worth noting that the choice of parameter η plays an
k→j log2 σn2 +
R Tr (Hj Wi ) + Fj,k , (13) important role in the objective function. If this parameter is
i∈K,i≥k chosen to be η → 0 ( δ1 → ∞), the rank of matrix Wk will be
which is a lower bound of Rk→j . By exploiting it, the definitely one. Nevertheless, in this case, we cannot obtain
k→j ≥ γk . Thus,
constraint (10a) can be approximated by R a good solution regarding the maximization of throughput
problem (10) can be reformulated as and effective sensing power, since the objective function is
dominated by the penalty term. To tackle this, we can initialize
max f (ρc , ρr , γk , Wk ) (14a) a large η to obtain a good starting point for the throughput
γk ,Wk
and the effective sensing power. Then, by gradually reducing
s.t. Rk→j ≥ γk , j ≥ k, ∀k ∈ K, k = K, (14b) η to a sufficiently small value via η = η, 0 < < 1,
RK ≥ γK , (14c) an overall suboptimal solution can be obtained. This procedure
(9c) − (9e), (10c) − (10e). (14d) is terminated
when the penalty term is sufficiently small,
i.e., k∈K (Wk ∗ − Wk 2 ) ≤ ε2 . The overall algorithm
For this optimization problem, the non-convexity is only to problem (9) is summarized in Algorithm 1. The complexity
from the rank-one constraint (10e). Generally, the semidefinite of this algorithm is O(Io Ii (K 6.5 N 6.5 log(1/e))), where Io
relaxation (SDR) [13] is exploited to solve this problem by and Ii are the number of iterations of the outer and inner
omitting the rank-one constraint. Then, the eigenvalues decom- layers, e is the solution accuracy, and O(K 6.5 N 6.5 log(1/e))
position or Gaussian randomization is used to reconstruct the is the complexity for solving the QSDP (18) [6].
rank-one solution from the general-rank solution obtained by
SDR, which may lead to a significant performance loss and IV. N UMERICAL R ESULTS
not ensure the feasibility of the reconstructed matrix. To avoid
In this section, the numerical results are provided to demon-
these drawbacks, we attempt to transform the rank-one
strate the characteristics of NOMA in ISAC systems. As shown
constraints to a penalty term in the objective function [14],
in Fig. 2, we assume a BS equipped with a ULA with
which can also be solved by SCA. Toward this idea, we firstly
N = 4 antennas, serving K = 2 or 6 communication users and
introduce an equivalent equality constraint:
tracking M = 2 radar targets in θ1 = −40◦ and θ2 = 40◦ . The
Wk ∗ − Wk 2 = 0, k ∈ K, (15) overall power budget is Pt = 20 dBm and the noise power at
where · ∗ is the nuclear norm, which is the sum of singular
values of the matrix, and · 2 is the spectral norm, which
Algorithm 1 Proposed Double-Layer Penalty-Based Algo-
is the largest singular values of the matrix. Thus, when the
rithm for Solving Problem (9)
matrix Wk is a rank-one matrix, the equality (15) holds.
1: Initialize the feasible Wk0 , ∀k ∈ K.
Otherwise, as Wk is semidefinite, we must have that the sum 2: repeat
of singular values is larger than the largest singular value, 3: n ← 0.
i.e., Wk ∗ − Wk 2 > 0. In order to obtain a rank-one 4: repeat
matrix, we introduce a penalty term to the objective function 5: Update Wkn+1 by solving (18) with Wkn , ∀k ∈ K.
6: n ← n + 1.
based on (15), yielding 7: until the fractional reduction of the objective function value falls below
1 a predefined threshold ε1 .
max f (ρc , ρr , γk , Wk ) − (Wk ∗ − Wk 2 ) 8: Wk0 ← Wkn , ∀k ∈ K.
γk ,Wk η
k∈K
9: η ← η.
10: until k∈K Wkn ∗ − Wkn 2 ≤ ε2 .
(16a)
Authorized licensed use limited to: Heilongjiang University. Downloaded on December 13,2023 at 05:48:11 UTC from IEEE Xplore. Restrictions apply.
680 IEEE COMMUNICATIONS LETTERS, VOL. 26, NO. 3, MARCH 2022
A. Convergence of Algorithm 1
In Fig. 3, the convergence behavior of the proposed algo-
rithm over one random channel realization is studied with
K = 6, t = 0, ρc = 10, and ρr = 1. We can observe that for
any values of the reduction factor , the objective value quickly
converges to a stable value while the penalty term converges
to almost zero after several outer iterations. It reveals that the
proposed algorithm is capable of finding a feasible rank-one
solution with high performance. Furthermore, it can be seen
that as the value of becomes smaller, the proposed algorithm
has higher convergence speed while achieves lower objective
value, i.e., worse system performance, which is a trade-off. Fig. 4. Trade-off between throughput and effective sensing power.
Thus, in the following simulation, we set = 0.2, which
achieves the suitable convergence speed and system perfor- C. Performance Trade-off
mance simultaneously. In Fig. 4, we demonstrate the performance trade-off,
i.e., the communication throughput versus the effective radar
B. Baseline sensing power, of NOMA-ISAC and the conventional ISAC.
For comparison, we consider the conventional ISAC system The results are obtained via Monte Carlo simulation over
without the employment of NOMA [5], where the achievable 400 random channel realizations. Two cases are consid-
rate at user k is given by ered, namely the underloaded regime (K = 2) and the
overloaded regime (K = 6). As seen in Fig. 4, in both
k wk |
|hH 2 underloaded and overloaded regimes, the spatial factor has
Rk = log2 1 +
b
. (20) no effect on the NOMA-ISAC system. The reason is that
i∈K,i=k |hk wi | + σn
H 2 2
the communication throughput is dominated by the strongest
The corresponding problem of maximizing the throughput NOMA user. However, the performance of the conventional
Rb = k∈K Rkb and effective sensing power at the sensing ISAC system is subject to the spatial factor, i.e., as the
targets can be solved using Algorithm 1 with the interference spatial correlation increases, the performance achievable area
term in (20). becomes smaller. Specifically, in the underloaded regime
Authorized licensed use limited to: Heilongjiang University. Downloaded on December 13,2023 at 05:48:11 UTC from IEEE Xplore. Restrictions apply.
WANG et al.: NOMA EMPOWERED INTEGRATED SENSING AND COMMUNICATION 681
V. C ONCLUSION
A NOMA-ISAC framework has been proposed. A beam-
forming optimization problem was formulated to obtain the
communication-sensing trade-off, which was solved by the
proposed double-layer penalty-based algorithm. Our numerical
results indicated that the NOMA-ISAC framework outper-
forms the conventional one when the spatial DoFs are insuf-
ficient and can provide high quality communication and radar
Fig. 5. Obtained transmit beampattern by different schemes when the sensing functions simultaneously in the overloaded regime.
communication throughput is 13.5 bit/s/Hz.
Authorized licensed use limited to: Heilongjiang University. Downloaded on December 13,2023 at 05:48:11 UTC from IEEE Xplore. Restrictions apply.