Approximately universal MIMO diversity embedded codes

Francis Lu*

*此作品的通信作者

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications
頁面25-30
頁數6
DOIs
出版狀態Published - 2010
事件2010 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
持續時間: 17 10月 201020 10月 2010

出版系列

名字ISITA/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
國家/地區Taiwan
城市Taichung
期間17/10/1020/10/10

指紋

深入研究「Approximately universal MIMO diversity embedded codes」主題。共同形成了獨特的指紋。

引用此