Precoder Optimization in Cognitive Radio with Interference Constraints

Communications(2011)

引用 11|浏览1
暂无评分
摘要
We consider precoding strategies at the secondary base station (SBS) in a cognitive radio network with interference constraints at the primary users (PUs). Precoding strategies at the SBS which satisfy interference constraints at the PUs in cognitive radio networks have not been adequately addressed in the literature so far. In this paper, we consider two scenarios: i) when the primary base station (PBS) data is not available at SBS, and ii) when the PBS data is made available at the SBS. We derive the optimum MMSE and Tomlinson-Harashima precoding (THP) matrix Alters at the SBS which satisfy the interference constraints at the PUs for the former case. For the latter case, we propose a precoding scheme at the SBS which performs pre-cancellation of the PBS data, followed by THP on the pre-cancelled data. The optimum precoding matrix filters are computed through an iterative search. To illustrate the robustness of the proposed approach against imperfect CSI at the SBS, we then derive robust precoding filters under imperfect CSI for the latter case. Simulation results show that the proposed optimum precoders achieve good bit error performance at the secondary users while meeting the interference constraints at the PUs.
更多
查看译文
关键词
cognitive radio,error statistics,filtering theory,iterative methods,least mean squares methods,matrix algebra,optimisation,precoding,radiofrequency interference,PBS data,PU,SBS,THP matrix filters,Tomlinson-Harashima precoding matrix,bit error performance,cognitive radio network,imperfect CSI,interference constraints,iterative search,optimum MMSE,optimum precoders,optimum precoding matrix filters,pre-cancellation,pre-cancelled data,precoder optimization,precoding scheme,precoding strategy,primary base station data,primary users,robust precoding filters,secondary base station
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要