# -*- coding: utf-8 -*-
"""
@author: Ranbo桑
Created on Wed jun 22 20:46:46 2022
"""
from numpy import *
import numpy as np
np.random.seed(1)
M = 1 # UAV元素的个数
ric = 10 ** (0.3) # K_AR,k_RU Rician factor
ric1 = np.sqrt(ric / (ric + 1))
ric2 = np.sqrt(1 / (ric + 1))
r_bs_ris = 2.2 # 路径损耗指数
def main():
BS_pos = np.array([[0, 0, 50]]) # BS 位置 (X,Y,Z)
UAV_pos = np.array([[100, 100, 100]]) #一个UAV用户的位置 (X,Y,Z)
dis = np.sqrt(np.sum((BS_pos - UAV_pos) ** 2, axis=1)) # 基站与UAV的距离
sin_B_UAV = 100 / np.sqrt(100 ** 2 + 100 ** 2)
C0 = 10 ** (-3) # path loss when d0=1m
PL = np.sqrt(C0 * (dis) ** (-r_bs_ris)) # bs_uav路径损耗
return PL, sin_B_UAV # 返回的是大尺度路径损耗
if __name__ == '__main__':
PL_BS_UAV, sin_BR = main()
T = 10 # 时隙长
H = [] # 基站与UAV
temp = 1 / pow(2, 1 / 2)
for i in range(T):
h = []
h_e = [] # 人为加噪之后
v = []
w = 1
for m in range(0, M):
real = mat(np.random.normal(0, 1, M)) # 瑞利分布实数
imag = mat(np.random.normal(0, 1, M)) # 瑞利分布虚数部分
real = temp * real
imag = temp * imag
rayleign = complex(real[0, m], imag[0, m]) # 复高斯瑞利分布
g_NLOS = rayleign * PL_BS_UAV * ric2 # 这是RICIAN中的瑞利分布,V*NLOS部分
g_LOS = PL_BS_UAV * ric1 * exp(complex(0, m * np.pi * sin_BR)) # 这是RICIAN中的第一部分,V*LOS部分
g = g_NLOS + g_LOS
h.append(g)
# 根据论文计算得到从基站到RIS也就是从基站到UAV的真实信道h
H.append(h)
H = np.array(H).squeeze()
print("真实信道:",H)
print("对真实信道的取模:",abs(H))
固定随机种子后,输出结果:
真实信道: [1.89022128e-04-3.19260888e-05j 7.66874618e-05-5.59956393e-05j
1.49415002e-04-1.20111742e-04j 1.95308978e-04-3.97255485e-05j
1.20901349e-04-1.30140372e-05j 1.80555349e-04-1.07513765e-04j
8.74252944e-05-2.00428686e-05j 1.63420156e-04-5.74006671e-05j
9.52528577e-05-4.58133093e-05j 1.06454503e-04+3.04157175e-05j]
对真实信道的取模: [1.91699348e-04 9.49551390e-05 1.91707260e-04 1.99308094e-04
1.21599758e-04 2.10141485e-04 8.96933592e-05 1.73207922e-04
1.05697522e-04 1.10714394e-04]
参考文献:
[1] R. Zhong, Y. Liu, X. Mu, Y. Chen and L. Song, "AI Empowered RIS-Assisted NOMA Networks: Deep Learning or Reinforcement Learning?," in IEEE Journal on Selected Areas in Communications, vol. 40, no. 1, pp. 182-196, Jan. 2022, doi: 10.1109/JSAC.2021.3126068.