Rateless space-time coding

@inproceedings{citeulike:3023924, abstract = {Rateless codes are good codes of infinite length that have the property that prefixes of such codes are themselves good codes. This makes them attractive for applications in which the channel quality is uncertain, where systems transmit as much of a codeword as necessary for decoding to be possible. In particular, rateless codes are potentially attractive for wireless communication. In a recent work, a rateless coding scheme was proposed for the AWGN channel, based on layering, repetition and random dithering. We extend this scheme to multiple-input single-output (MISO) Gaussian channels. We show that the rate loss associated with orthogonal design space-time codes may be alleviated by layering and dithering, very similar to the rateless approach for the AWGN channel. We then combine the two schemes and arrive at a close-to-capacity rateless code for MISO channels. The required complexity depends on the fraction of capacity that is targeted, is linear in the capacity of the channel and does not depend on the number of transmit antennas. Furthermore, the coding scheme uses only one base AWGN code}, author = {Erez, U. and Wornell, G. W. and Trott, M. D. }, booktitle = {Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on}, citeulike-article-id = {3023924}, doi = {http://dx.doi.org/10.1109/ISIT.2005.1523683}, journal = {Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on}, keywords = {rateless, space-time-coding}, pages = {1937--1941}, posted-at = {2008-07-21 10:30:48}, priority = {3}, title = {Rateless space-time coding}, url = {http://dx.doi.org/10.1109/ISIT.2005.1523683}, year = {2005} }

TY - CONF ID - citeulike:3023924 L3 - citeulike-article-id:3023924 TI - Rateless space-time coding T2 - Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on JF - Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on SP - 1937 EP - 1941 N2 - Rateless codes are good codes of infinite length that have the property that prefixes of such codes are themselves good codes. This makes them attractive for applications in which the channel quality is uncertain, where systems transmit as much of a codeword as necessary for decoding to be possible. In particular, rateless codes are potentially attractive for wireless communication. In a recent work, a rateless coding scheme was proposed for the AWGN channel, based on layering, repetition and random dithering. We extend this scheme to multiple-input single-output (MISO) Gaussian channels. We show that the rate loss associated with orthogonal design space-time codes may be alleviated by layering and dithering, very similar to the rateless approach for the AWGN channel. We then combine the two schemes and arrive at a close-to-capacity rateless code for MISO channels. The required complexity depends on the fraction of capacity that is targeted, is linear in the capacity of the channel and does not depend on the number of transmit antennas. Furthermore, the coding scheme uses only one base AWGN code KW - rateless KW - space-time-coding AU - Erez, U AU - Wornell, GW AU - Trott, MD PY - 2005/// UR - http://dx.doi.org/10.1109/ISIT.2005.1523683 ER -