从非全码转换到全码,具有更好的误码性能

Ankur Jain, A. Laufer, Y. Bar-Ness
{"title":"从非全码转换到全码,具有更好的误码性能","authors":"Ankur Jain, A. Laufer, Y. Bar-Ness","doi":"10.1109/WCSN.2008.4772716","DOIUrl":null,"url":null,"abstract":"In the paper, ldquoImproved Transmission Scheme for Orthogonal Space Time Codesrdquo, a new scheme is proposed that uses an iterative Expectation Maximization (EM) algorithm for decoding and provides full rate and full diversity. For full rate, some of the codeword symbols are not transmitted but rather estimated at the receiver using the expectation maximization (EM) algorithm. In this paper, we prove analytically that the EM algorithm converges exponentially and unconditionally to the least squares (LS) estimate and the rate of convergence depends on the channel parameters and not on the initial vector. We also propose a new very low complexity decoding for the aforementioned transmission scheme with identical error performance.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On converting OSTC scheme from non-full rate to full-rate with better error performance\",\"authors\":\"Ankur Jain, A. Laufer, Y. Bar-Ness\",\"doi\":\"10.1109/WCSN.2008.4772716\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the paper, ldquoImproved Transmission Scheme for Orthogonal Space Time Codesrdquo, a new scheme is proposed that uses an iterative Expectation Maximization (EM) algorithm for decoding and provides full rate and full diversity. For full rate, some of the codeword symbols are not transmitted but rather estimated at the receiver using the expectation maximization (EM) algorithm. In this paper, we prove analytically that the EM algorithm converges exponentially and unconditionally to the least squares (LS) estimate and the rate of convergence depends on the channel parameters and not on the initial vector. We also propose a new very low complexity decoding for the aforementioned transmission scheme with identical error performance.\",\"PeriodicalId\":338962,\"journal\":{\"name\":\"2008 Fourth International Conference on Wireless Communication and Sensor Networks\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth International Conference on Wireless Communication and Sensor Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSN.2008.4772716\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSN.2008.4772716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种利用迭代期望最大化(EM)算法进行译码并提供全速率和全分集的改进的正交空时码传输方案。对于全速率,一些码字符号不发送,而是在接收端使用期望最大化(EM)算法进行估计。本文分析证明了该算法无条件地指数收敛于最小二乘估计,且收敛速度与信道参数无关,而与初始向量无关。对于上述传输方案,我们还提出了一种新的低复杂度的译码方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On converting OSTC scheme from non-full rate to full-rate with better error performance
In the paper, ldquoImproved Transmission Scheme for Orthogonal Space Time Codesrdquo, a new scheme is proposed that uses an iterative Expectation Maximization (EM) algorithm for decoding and provides full rate and full diversity. For full rate, some of the codeword symbols are not transmitted but rather estimated at the receiver using the expectation maximization (EM) algorithm. In this paper, we prove analytically that the EM algorithm converges exponentially and unconditionally to the least squares (LS) estimate and the rate of convergence depends on the channel parameters and not on the initial vector. We also propose a new very low complexity decoding for the aforementioned transmission scheme with identical error performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信