Interference alignment based on adaptive eigenmodes in a multiple-input, multiple-output cognitive radio network
Yibing Li, Xueying Diao, Qianhui Dong and 1 more
International Journal of Distributed Sensor Networks · 2018
doi:10.1177/1550147718759219 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
This article aims to optimize the information rate of a cognitive radio network with multiple secondary users. A primary user rate optimization approach based on dichotomy of the degree of freedom is proposed, where the primary users’ eigenmodes are adjusted according to its rate requirement. In order to provide a higher sum rate of secondary users, two interference alignment schemes are presented. The first one is an interference sub-space alignment scheme, which aims to align the sub-spaces spanned by interference from other secondary users with the sub-space spanned by interference from primary user. However, interference sub-space alignment may not be favorable in low signal-to-interference ratio region due to the negligence of the influence of noise. Thus, an iterative interference alignment scheme which maximizes the secondary system sum rate based on Grassmann manifold is developed. To accelerate the convergence speed, the objective function in Grassmann manifold is transformed into two parts without the inversion operation using the extensions of the Minkowski inequality. Simulation results show that interference sub-space alignment is more effective than Grassmann manifold to mitigate interference in the system with more secondary users. We further validate the effectiveness of Grassmann manifold and interference sub-space alignment in comparison with the existing schemes employing a water filling algorithm.
Abstract licence: CC BY
References24
24 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.