Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
On some inequalities for the incomplete gamma function
Mathematics of Computation
Computing moments of ratios of quadratic forms in normal variables
Computational Statistics & Data Analysis - Special issue: Computational econometrics
Convex Optimization
Fundamentals of wireless communication
Fundamentals of wireless communication
Cognitive radio: an information-theoretic perspective
IEEE Transactions on Information Theory
Dirty paper coding for the MIMO cognitive radio channel with imperfect CSIT
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Diversity and outage performance in space-time block coded Ricean MIMO channels
IEEE Transactions on Wireless Communications
Nested linear/lattice codes for structured multiterminal binning
IEEE Transactions on Information Theory
Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels
IEEE Transactions on Information Theory
A close-to-capacity dirty paper coding scheme
IEEE Transactions on Information Theory
A unified framework for tree search decoding: rediscovering the sequential decoder
IEEE Transactions on Information Theory
On compound channels with side information at the transmitter
IEEE Transactions on Information Theory
Achievable rates in cognitive radio channels
IEEE Transactions on Information Theory
On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel
IEEE Transactions on Information Theory
Hi-index | 0.01 |
In this paper, we present the design of cognitive radio in the Rician channel with partial channel state information at the transmitter (CSIT). We replace the dirty paper coding (DPC) used in the cognitive radio with full CSIT by the linear assignment Gel'fand-Pinsker coding (LA-GPC) which can achieve better error performance when there is only partial CSIT. Based on the achievable rate derived from the LA-GPC, two optimization problems under the fast and slow fading channels are formulated. We derive semi-analytical solutions to find the relaying ratios and precoding coefficients. We also show that the parameters derived by the proposed methods converge to the optimal full CSIT solutions in the asymptotic cases. This result verifies the correctness of the proposed methods asymptotically. Moreover, a new coding scheme is proposed to implement the LA-GPC in practice. Simulation results show that the proposed semi-analytical solutions perform close to the optimal solutions found by brute-force search, and outperform the systems based on naive DPC. Simulation results also show that the proposed practical coding scheme can effectively approach the theoretical rate performance.