NOMA Empowered Integrated Sensing and Communication.
Model
Dual-functional base station
(BS) equipped with an N N N-antennas uniform linear array (ULA).
Communication Model
- K = { 1 , … , K } \mathcal{K}=\{1,\ldots,K\} K={
1,…,K}: K K K single-antenna
users
indexed. - M = { 1 , … , M } \mathcal{M}=\{1,\ldots,M\} M={
1,…,M}: M M M radar
targets
indexed. - w i s i for ∀ i ∈ K \mathbf{w}_is_i\text{ for }\forall i\in\mathcal{K} wisi for ∀i∈K: where w i ∈ C N × 1 \mathbf{w}_i\in\mathbb{C}^{N\times1} wi∈CN×1 are
beamformers
for delivering the information symbol s i s_i si to user i i i. BS transmits the superimposed signals to all users in downlink. w i \mathbf{w}_i wi是波束形成器, s i s_i si是发给第 i i i个用户的信息。 - 第 k k k个用户的接收信号, y k = h k H ∑ i ∈ K w i s i + n k = ∑ i ∈ K h k H w i s i + n k y_k=\mathrm{h}_k^H\sum_{i\in\mathcal{K}}\mathrm{w}_is_i+n_k=\sum_{i\in\mathcal{K}}\mathrm{h}_k^H\mathrm{w}_is_i+n_k yk=hkH∑i∈Kwisi+nk=∑i∈KhkHwisi+nk
- 信道增益系数, h k = Λ k − 1 / 2 h ~ k , ∀ k ∈ K \mathrm{h}_k=\Lambda_k^{-1/2}\widetilde{\mathsf{h}}_k,\forall k\in\mathcal{K} hk=Λk−1/2h k,∀k∈K denotes the BS-user channel, Λ k − 1 / 2 \Lambda_k^{-1/2} Λk−1/2 and h ~ k ∈ C N × 1 \widetilde{\mathbf{h}}_k\in\mathbb{C}^{N\times1} h k∈CN×1 denote the large and small scale fading, respectively, and n k n_k nk denotes the circularly symmetric complex Gaussian noise with variance σ n 2 . \sigma_n^2. σn2.
- 不同用户的大尺度衰弱系数不同,即, Λ 1 − 1 ≤ Λ 2 − 1 ≤ ⋯ ≤ \Lambda _1^{- 1}\leq \Lambda _2^{- 1}\leq \cdots \leq Λ1−1≤Λ2−1≤⋯≤ Λ K − 1 . \Lambda _K^{- 1}. ΛK−1. We assume that the users’ indexes are in an increasing order with respect to their large-scale channel strength.
- R k → k = log 2 ( 1 + ∣ h k H w k ∣ 2 ∑ i ∈ K , i > k ∣ h k H w i ∣ 2 + σ n 2 ) R_{k\to k}=\log_2\left(1+\frac{|\mathrm{h}_k^H\mathrm{w}_k|^2}{\sum_{i\in\mathcal{K},i>k}|\mathrm{h}_k^H\mathrm{w}_i|^2+\sigma_n^2}\right) Rk→k=log2(1+∑i∈K,i>k∣hkHwi∣2+σn2∣hkHwk∣2), the achievable rate of s k s_k sk after SIC at user k k k for ∀ k ∈ K , k ≠ K \forall k\in\mathcal{K},k\neq K ∀k∈K,k=K
- Note: 要解码第 k k k个用户,先利用将前 k − 1 k-1 k−1移除,然后将 k k k之后的用户当做噪声.
- R k = min { R k → k , … , R k → K } . R_k=\min\{R_{k\to k}