Cognitive radio with partial channel state information at the transmitter

IEEE Transactions on Wireless Communications

Volumn 9, Issue 11, 2010, Pages 3402-3413

  Lin, Pin Hsun ^a   Lin, Shih Chun ^b   Lee, Chung Pi ^a   Su, Hsuan Jung ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Cognitive radio; dirty paper coding; linear assignment Gel'fand Pinsker coding; nested lattice; partial CSIT

Indexed keywords

COGNITIVE RADIO; DIRTY PAPER CODING; LINEAR ASSIGNMENT GEL'FAND-PINSKER CODING; NESTED LATTICE; PARTIAL CSIT;

ASYMPTOTIC ANALYSIS; CHANNEL STATE INFORMATION; FADING (RADIO); FADING CHANNELS; GELS; OPTICAL PHASE CONJUGATION; OPTIMIZATION; RADIO BROADCASTING; TRANSMITTERS;

RADIO;

EID: 78449293767     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2010.092410.090725     Document Type: Article

References (29)

1. J. Mitola, "Cognitive radio: an integrated agent architecture for software defined radio," Ph.D. dissertation, KTH Royal Inst. Technology, Stockholm, Sweden, 2000.
2. N. Devroye, P. Mitran, and V. Tarokh, "Achievable rates in cognitive radio channels," IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 1813-1827, May 2006.
3. A. Jovicic and P. Viswanath, "Cognitive radio: an information-theoretic perspective," IEEE Trans. Inf. Theory, vol. 55, no. 9, pp. 3945-3958, Sep. 2009.
4. M. H. M. Costa, "Writing on dirty paper," IEEE Trans. Inf. Theory, vol. 29, pp. 439-441, May 1983.
5. P. Mitran, N. Devroye, and V. Tarokh, "On compound channels with side-information at the transmitter," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1745-1755, Apr. 2006.
6. A. Bennatan and D. Burshtein, "On the fading-paper achievable region of the fading MIMO broadcast channel," IEEE Trans. Inf. Theory, vol. 54, no. 1, pp. 100-115, Jan. 2008.
7. C. S. Vaze and M. K. Varanasi, "On the achievable rate of the fading dirty paper channel with imperfect CSIT," in Proc. IEEE 43rd Annual Conference on Information Sciences and Systems, John Hopkins University, Mar. 2009.
8. -, "Dirty paper coding for the MIMO cognitive radio channel with imperfect CSIT," in IEEE International Symposium on Information Theory (ISIT), Mar. 2009.
9. S. I. Gelfand and M. S. Pinsker, "Coding for channel with random parameters," Problems of Control and Information Theory, vol. 9, no. 1, pp. 19-31, 1980.
10. D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge University Press, 2005.
11. J. Pinter, "Deterministic approximations of probability inequalities," Methods and Models of Operations Research, vol. 33, pp. 219-239, 1989.
12. R. Nabar, H. Bolcskei, and A. Paulraj, "Diversity and outage performance in space-time block coded Ricean MIMO channels," IEEE Trans. Wireless Commun., vol. 4, no. 5, pp. 2519-2532, 2005.
13. P.-H. Lin, S.-C. Lin, and H.-J. Su, "Cognitive radio with partial channel state information at the transmitter," in Proc. IEEE Int. Conf. on Commun. (ICC 2008), Beijing, China, May 2008.
14. M. S. Paollela, "Computing moments of ratios of quadratic forms in normal variables," Computational Statistics and Data Analysis, vol. 42, pp. 313-331, 2003.
15. A. M. Mathai and S. B. Provost, Quadratic Forms in Random Variables. New York: Marcel Dekker, 1992.
16. R. A. Ion, "Nonparametric statistical process control," Ph.D. dissertation, Wiskunde en Informatica, Universiteit van Amsterdam, Netherlands, 2001.
17. R. Zamir, S. Shamai, and U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1250-1276, June 2002.
18. H. E. Gamal, G. Caire, and M. O. Damen, "Lattice coding and decoding achieve the optimal diversity-vs-multiplexing tradeoff of MIMO channels," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 968-985, June 2004.
19. S.-C. Lin, P.-H. Lin, and H.-J. Su, "Lattice coding for the vector fading paper problem," in Proc. IEEE Information Theory Workshop, Tahoe City, CA, USA, Sep. 2007.
20. S.-C. Lin, "Coding for vector dirty-paper channels: theory, implementation, and duality," Ph.D. dissertation, National Taiwan University, 2007.
21. U. Erez and S. ten Brink, "A close to capacity dirty paper coding scheme," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3417-3432, Oct. 2005.
22. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups. New York: Springer-Verlag, 1988.
23. A. D. Murugan, H. El-Gamal, M. O. Damen, and G. Caire, "A unified framework for tree search decoding: rediscovering the sequential decoder," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 933-953, 2006.
24. P.-H. Lin, C.-P. Lee, S.-C. Lin, and H.-J. Su, "Cognitive radio in slow fading channels with partial channel state information at the transmitter," in Proc. 42th Annual Conf. on Information Sciences and Systems (CISS2008), Princeton, NJ, USA, Mar. 2008.
25. K. R. Kumar and G. Caire, "Construction of structured LaST codes," in Proc. IEEE International Symposium on Information Theory (ISIT), 2006, pp. 2834-2838.
26. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2008.
27. O. Lieberman, "A Laplace approximation for the distribution of a ratio of quadratic forms in normal variables," J. Amer. Statist. Assoc, vol. 89, pp. 924-928, 1994.
28. P. Billingsley, Probability and Measure, 3rd edition. J. Wiley and Sons, 1995.
29. H. Alzer, "On some inequalities for the incomplete gamma function," Mathematics of Computation, vol. 66, no. 218, pp. 771-778, Apr. 1997.