Approximately universal MIMO diversity embedded codes

Francis Lu*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In diversity embedded coding, information streams are divided into two sub-streams with different priorities. If the optimal DMT performance of each coded stream can be achieved, then such code is said to be successive refinable. For the cases of SISO, SIMO, and MISO Rayleigh slow fading channels, Diggavi and Tse [1] had shown that superposition coding with successive cancellation receiver achieves successive refinability in these channels. However, such optimality might not be extended to MIMO channel due to the strictly sub-optimality of successive cancellation receiver. In this paper, we first provide an explicit construction of MIMO diversity embedded codes that is sphere decodable.We then show that the proposed code is approximately universal, if joint ML decoding is used, and hence extend the notion of successive refinability to general MIMO channels.

Original languageEnglish
Title of host publicationISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications
Pages25-30
Number of pages6
DOIs
StatePublished - 1 Dec 2010
Event2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010 - Taichung, Taiwan
Duration: 17 Oct 201020 Oct 2010

Publication series

NameISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications

Conference

Conference2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010
CountryTaiwan
CityTaichung
Period17/10/1020/10/10

Fingerprint Dive into the research topics of 'Approximately universal MIMO diversity embedded codes'. Together they form a unique fingerprint.

Cite this