Transmitter cooperation by recycling dirty paper

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 777-781

  Shum, Kenneth W ^a   Sung, Chi Wan ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE RATE REGION; CODING SCHEMES; DECODE-AND-FORWARD; DIRTY PAPERS; DIRTY-PAPER CODING; HALF-DUPLEX; INTERNATIONAL SYMPOSIUM; RELAY NODES; SOURCE NODES; SOURCE-DESTINATION PAIRS;

CYBERNETICS; INFORMATION THEORY; PROGRAMMING THEORY; TRANSMITTERS;

TECHNICAL PRESENTATIONS;

EID: 52349115293     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595092     Document Type: Conference Paper

References (9)

1. J. Laneman and G. Wornell, "Exploiting distributed spatial diversity in wirless networks," in Proc. 38th Allerton Conf. Comm. Control and Computing, Monticello, IL, Dec. 2000, pp. 3062-3080.
2. A. Høst-Madsen, "Capacity bounds for cooperative diversity," IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1522-1544, Apr. 2006.
3. C. T. K. Ng, N. Jindal, A. J. Goldsmith, and U. Mitra, "Capacity gain from two-transmitter and two-receiver cooperation," IEEE Trans. Inform. Theory, vol. 53, no. 10, pp. 3822-3827, Oct. 2007.
4. A. Høst-Madsen, "On the capacity of wireless relaying," in Proc. of IEEE 56th Vehicular Tech. Conf. VTC2002-Fall, 2002, pp. 1333-1337.
5. M. Costa, "Writing on dirty paper," IEEE Trans. Inform. Theory, vol. 29, no. 3, pp. 439-441, May 1983.
6. A. S. Cohen and A. Lapidoth, "The Gaussian watermarking game," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1639-1667, June 2002.
7. G. Caire and S. Shamai (Shitz), "On the achievable throughput of a multiantenna Gaussian broadcast channel," IEEE Trans. Inform. Theory, vol. 49, no. 7, pp. 1691-1706, July 2003.
8. A. Lapidoth, "Nearest neighbor decoding for additive non-Gaussian noise channels," IEEE Trans. Inform. Theory, vol. 42, no. 5, pp. 1520-1529, Sept. 1996.
9. M. A. Khojastepour, A. Sabharwal, and B. Aazhang, "Bounds on achievable rates for general multi-terminal networks with practical constraints," in Information Processing in Sensor Networks (IPSN'03), ser. Lecture Notes in Computer Sciences, F. Zhao and L. Guibas, Eds., vol. 2634. Berlin Heidelberg: Springer-Verlag, Apr. 2004, pp. 146-161.