{"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}
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.