Cognitive Radio with Partial Channel State Information at the Transmitter

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.

[1]  Horst Alzer,et al.  On some inequalities for the incomplete gamma function , 1997, Math. Comput..

[2]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

[3]  Giuseppe Caire,et al.  Construction of Structured LaST Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[4]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[5]  Vahid Tarokh,et al.  Fundamental Limits of Cognitive Radio Networks , 2007 .

[6]  Patrick Mitran,et al.  Information Theoretic Analysis of Cognitive Radio Systems , 2007 .

[7]  Mahesh K. Varanasi,et al.  On the achievable rate of the fading dirty paper channel with imperfect CSIT , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[8]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[9]  Hsuan-Jung Su,et al.  Cognitive radio in slow fading channels with partial channel state information at the transmitter , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[10]  Pramod Viswanath,et al.  Cognitive Radio: An Information-Theoretic Perspective , 2009, IEEE Transactions on Information Theory.

[11]  Stephan ten Brink,et al.  A close-to-capacity dirty paper coding scheme , 2004, IEEE Transactions on Information Theory.

[12]  Giuseppe Caire,et al.  A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[13]  Pin-Hsun Lin,et al.  Design of the cognitive radio with partial channel state information at the transmitter , 2008, 2009 43rd Annual Conference on Information Sciences and Systems.

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[15]  Giuseppe Caire,et al.  Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels , 2004, IEEE Transactions on Information Theory.

[16]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[17]  A. Paulraj,et al.  Diversity and outage performance in space-time block coded Ricean MIMO channels , 2005, IEEE Transactions on Wireless Communications.

[18]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[19]  D. Owen.  Handbook of Mathematical Functions with Formulas , 1965 .

[20]  Patrick Mitran,et al.  On compound channels with side information at the transmitter , 2006, IEEE Transactions on Information Theory.

[21]  Mahesh K. Varanasi,et al.  Dirty Paper Coding for the MIMO cognitive radio channel with imperfect CSIT , 2009, 2009 IEEE International Symposium on Information Theory.

[22]  János D. Pintér,et al.  Deterministic approximations of probability inequalities , 1989, ZOR Methods Model. Oper. Res..

[23]  David Burshtein,et al.  On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel , 2008, IEEE Transactions on Information Theory.

[24]  R. A. Ion,et al.  Nonparametric statistical process control , 2001 .

[25]  Hsuan-Jung Su,et al.  Lattice coding for the vector fading paper problem , 2007, 2007 IEEE Information Theory Workshop.

[26]  Joseph Mitola,et al.  Cognitive Radio An Integrated Agent Architecture for Software Defined Radio , 2000 .

[27]  Thomas C. Hales.  Sphere packings, I , 1997, Discret. Comput. Geom..

[28]  M. Kendall,et al.  The advanced theory of statistics , 1945 .

[29]  J. Nicholas Laneman,et al.  Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels , 2007, 2007 IEEE International Symposium on Information Theory.

[30]  A. M. Mathai.  Quadratic forms in random variables , 1992 .

[31]  Marc S. Paolella.  Computing moments of ratios of quadratic forms in normal variables , 2003, Comput. Stat. Data Anal..

[32]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[33]  L. Jain,et al.  Evolutionary multiobjective optimization : theoretical advances and applications , 2005 .

[34]  S PaolellaMarc.  Computing moments of ratios of quadratic forms in normal variables , 2003 .