多址信道中点阵编码和解码的最优性

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI:10.1109/ISIT.2007.4557228

Young-Han Nam, H. E. Gamal

{"title":"多址信道中点阵编码和解码的最优性","authors":"Young-Han Nam, H. E. Gamal","doi":"10.1109/ISIT.2007.4557228","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a class of multiple access lattice space-time coding and decoding schemes. We prove an extended version of the Minkowski-Hlawka theorem, utilizing independent Loeliger ensembles. Applying this extension, we prove that lattice coding and decoding achieves the optimal diversity-multiplexing tradeoff of multiple access channels.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"293 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"On the Optimality of Lattice Coding and Decoding in Multiple Access Channels\",\"authors\":\"Young-Han Nam, H. E. Gamal\",\"doi\":\"10.1109/ISIT.2007.4557228\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a class of multiple access lattice space-time coding and decoding schemes. We prove an extended version of the Minkowski-Hlawka theorem, utilizing independent Loeliger ensembles. Applying this extension, we prove that lattice coding and decoding achieves the optimal diversity-multiplexing tradeoff of multiple access channels.\",\"PeriodicalId\":193467,\"journal\":{\"name\":\"2007 IEEE International Symposium on Information Theory\",\"volume\":\"293 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2007.4557228\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557228","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 28

摘要

本文研究了一类多址点阵空时编码和解码方案。我们利用独立Loeliger系综证明了Minkowski-Hlawka定理的一个扩展版本。应用这一扩展，我们证明了点阵编码和译码实现了多址信道的分集与复用的最佳权衡。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the Optimality of Lattice Coding and Decoding in Multiple Access Channels

In this paper, we consider a class of multiple access lattice space-time coding and decoding schemes. We prove an extended version of the Minkowski-Hlawka theorem, utilizing independent Loeliger ensembles. Applying this extension, we prove that lattice coding and decoding achieves the optimal diversity-multiplexing tradeoff of multiple access channels.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 IEEE International Symposium on Information Theory

自引率

0.00%

发文量