{"title":"QAM星座下准正交空时码的高效ML解码器","authors":"A. Enescu, S. Ciochină, C. Paleologu","doi":"10.1109/AICT.2008.20","DOIUrl":null,"url":null,"abstract":"The most attractive class of space-time codes comprises the full-rate orthogonal codes, such as the Alamouti code. These codes allow a simple individual decoding of each symbol of the space-time block, leading to a reduced complexity at the receiver. They exist however only for two transmit antennas. If one intends to increase the transmit diversity order, then it may either use a sub-unitary rate orthogonal code or use a full-rate quasi-orthogonal code in which the decoding is done in pairs of symbols. Unfortunately, the pair-wise decoding leads to a large search space of the Maximum Likelihood (ML) decoder, especially for high-rate constellations, such as 16-QAM or 64- QAM. This paper presents a less complex general ML decoding algorithm, with linear pre-processing phase, applicable for a class of quasi-orthogonal space-time codes with rectangular constellations (e.g. QPSK, 16-QAM, 64-QAM).","PeriodicalId":105735,"journal":{"name":"2008 Fourth Advanced International Conference on Telecommunications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient ML Decoder for Quasi-orthogonal Space-Time Codes When Using QAM Constellation\",\"authors\":\"A. Enescu, S. Ciochină, C. Paleologu\",\"doi\":\"10.1109/AICT.2008.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The most attractive class of space-time codes comprises the full-rate orthogonal codes, such as the Alamouti code. These codes allow a simple individual decoding of each symbol of the space-time block, leading to a reduced complexity at the receiver. They exist however only for two transmit antennas. If one intends to increase the transmit diversity order, then it may either use a sub-unitary rate orthogonal code or use a full-rate quasi-orthogonal code in which the decoding is done in pairs of symbols. Unfortunately, the pair-wise decoding leads to a large search space of the Maximum Likelihood (ML) decoder, especially for high-rate constellations, such as 16-QAM or 64- QAM. This paper presents a less complex general ML decoding algorithm, with linear pre-processing phase, applicable for a class of quasi-orthogonal space-time codes with rectangular constellations (e.g. QPSK, 16-QAM, 64-QAM).\",\"PeriodicalId\":105735,\"journal\":{\"name\":\"2008 Fourth Advanced International Conference on Telecommunications\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth Advanced International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICT.2008.20\",\"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 Advanced International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICT.2008.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient ML Decoder for Quasi-orthogonal Space-Time Codes When Using QAM Constellation
The most attractive class of space-time codes comprises the full-rate orthogonal codes, such as the Alamouti code. These codes allow a simple individual decoding of each symbol of the space-time block, leading to a reduced complexity at the receiver. They exist however only for two transmit antennas. If one intends to increase the transmit diversity order, then it may either use a sub-unitary rate orthogonal code or use a full-rate quasi-orthogonal code in which the decoding is done in pairs of symbols. Unfortunately, the pair-wise decoding leads to a large search space of the Maximum Likelihood (ML) decoder, especially for high-rate constellations, such as 16-QAM or 64- QAM. This paper presents a less complex general ML decoding algorithm, with linear pre-processing phase, applicable for a class of quasi-orthogonal space-time codes with rectangular constellations (e.g. QPSK, 16-QAM, 64-QAM).