【ISAC】paper_NOMA Empowered Integrated Sensing and Communication

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 iK: where w i ∈ C N × 1 \mathbf{w}_i\in\mathbb{C}^{N\times1} wiCN×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=hkHiKwisi+nk=iKhkHwisi+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=Λk1/2h k,kK denotes the BS-user channel, Λ k − 1 / 2 \Lambda_k^{-1/2} Λk1/2 and h ~ k ∈ C N × 1 \widetilde{\mathbf{h}}_k\in\mathbb{C}^{N\times1} h kCN×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 Λ11Λ21 Λ K − 1 . \Lambda _K^{- 1}. ΛK1. 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) Rkk=log2(1+iK,i>khkHwi2+σn2hkHwk2), 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 kK,k=K
  • Note: 要解码第 k k k个用户,先利用将前 k − 1 k-1 k1移除,然后将 k k k之后的用户当做噪声.
  • R k = min ⁡ { R k → k , … , R k → K } . R_k=\min\{R_{k\to k}
  • 20
    点赞
  • 20
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

|7_7|

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值