Incremental coding over MIMO channels

2011 IEEE Information Theory Workshop, ITW 2011

Volumn , Issue , 2011, Pages 400-404

  Khina, Anatoly ^a   Kochman, Yuval ^b   Erez, Uri ^a   Wornell, Gregory W ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL MATRICES; CLOSED-LOOP; CODING SCHEME; GAUSSIAN CHANNELS; GAUSSIANS; HALF-DUPLEX RELAY; HYBRID ARQ; INTERFERENCE CANCELLATION; LOW-COMPLEXITY; MIMO CHANNEL; MUTUAL INFORMATIONS; PARALLEL CHANNEL; POST PROCESSING; PRACTICAL SOLUTIONS; SIGNAL TO NOISE; SINGLE INPUT SINGLE OUTPUT; SINGLE USERS; SUCCESSIVE DECODING; TRANSMISSION SCHEMES; USER NEED;

DECODING; INFORMATION THEORY; MIMO SYSTEMS; MULTICASTING; OPTIMIZATION; SIGNAL TO NOISE RATIO; TELECOMMUNICATION; TRANSMISSIONS;

CHANNEL CODING;

EID: 83655191125     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2011.6089488     Document Type: Conference Paper

References (20)

1. A. Shokrollahi. Raptor codes. IEEE Trans. Info. Theory, 52:2551-2567, June 2006.
2. M. Luby. Information additive code generator and decoder for communication systems. U. S. Pat. No. 6307487, Oct. 23, 2001.
3. J. W. Byers, M. Luby, and M. Mitzenmacher. A digital fountain approach to asynchronous reliable multicast. IEEE Journ. Selected Areas in Comm., 20:1528-1540, Oct. 2002.
4. U. Erez, M. D. Trott, and G. Wornell. Rateless coding for Gaussian channels. IEEE Tram. Info. Theory, submitted. Available on arXiv:cs. IT/0708.2575.
5. A. S. Barbulescu and S. S. Pietrobon. Rate compatible turbo codes. Electronics Letters, 31(7):535-536, mar. 1995.
6. D. N. Rowitch and L. B. Milstein. On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes. IEEE Trans. Comm., COM-48:948-959, June 2000.
7. Ruoheng Liu, P. Spasojevic, and E. Soljanin. Incremental redundancy cooperative coding for wireless networks: Cooperative diversity, coding, and transmission energy gains. Information Theory, IEEE Transactions on, 54(3):1207-1224, mar. 2008.
8. O. Etesami and A. Shokrollahi. Raptor codes on binary memoryless symmetric channels. IEEE Trans. Info. Theory, 52:2033-2051, May 2006.
9. J. Ha, J. Kim, D. Klinc, and S. W. McLaughlin. Rate-compatible punctured low-density parity-check codes with short block lengths. Information Theory, IEEE Transactions on, 52(2):728-738, Feb. 2006.
10. E. N. Onggosanusi, A. G. Dabak, Y. Hui, and G. Jeong. Hybrid ARQ transmission and combining for MIMO systems. in ICC2003, Anchorage, Alaska, USA, volume 5, pages 3205-3209, June 2003.
11. Y. Fan, E. Erkip L. Lai, and V. H. Poor. Rateless coding for MIMO fading channels: performance limits and code construction. IEEE Trans. Wireless Communications, 9:1288-1292, April 2010.
12. H. Sun, J. H. Manton, and Z. Ding. Progressive linear precoder optimization for MIMO packet retransmissions. IEEE Journ. Selected Areas in Comm., 24:448-456, March 2006.
13. P. Mtran, H. Ochiai, and V. Tarokh. Space-time diversity enhancements using collaborative communications. IEEE Trans. Info. Theory, 51:2041-2057, June 2005.
14. J. Castura and Y. Mao. Rateless coding and relay networks. IEEE Signal Processing Magazine, 24:27-35, Sept. 2007.
15. J. Castura and Y. Mao. Rateless coding for wireless relay channels. IEEE Trans. Comm., 6:1638-1642, May 2007.
16. N. Shulman. Universal Channel Coding. PhD thesis, Tel-Aviv University, 2004.
17. A. Khina, Y. Kochman, and U. Erez. Joint unitary triangularization for MIMO networks. IEEE Trans. Signal Processing, Submitted, Dec. 2010. Availabel: arXiv:cs/1012.4715.
18. Y. Jiang, W. Hager, and J. Li. Uniform channel decomposition for MIMO communications. IEEE Trans. Signal Processing, vol. 53:4283-4294, Nov. 2005.
19. A. Khina, A. Hitron, and U. Erez. Modulation for MIMO networks with several users. in Proc. Int. Symp. Inform. Theory (ISIT), St. Petersburg, Russia, July 31-Aug. 2011.
20. Y. Jiang, W. Hager, and J. Li. The geometric mean decompostion. Linear Algebra and Its Applications, vol. 396:373-384, Feb. 2005.