四个发射天线的准正交空时分组码

2011 International Conference on Computational Intelligence and Communication Networks Pub Date : 2011-10-07 DOI:10.1109/CICN.2011.78

N. Thakur, S. S. Thakur, A. Gogoi

{"title":"四个发射天线的准正交空时分组码","authors":"N. Thakur, S. S. Thakur, A. Gogoi","doi":"10.1109/CICN.2011.78","DOIUrl":null,"url":null,"abstract":"In this paper, we derive few new quasi-orthogonal space-time block codes for four transmit antennas. These codes differ from each other and existing codes in character matrices and/or correlated values in character matrices. These codes can be constructed using elementary sub-matrices. We also derive corresponding maximum-likelihood decoders for the proposed codes. We observe that decoding complexity of some of these codes is less as compared to the rest of them for rectangular-QAM modulation. Bit error rate performance of these codes have been shown to be same as those of existing quasi-orthogonal space time block codes for four transmit antennas over quasi-static flat Rayleigh fading channels.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Few More Quasi-Orthogonal Space-Time Block Codes for Four Transmit Antennas\",\"authors\":\"N. Thakur, S. S. Thakur, A. Gogoi\",\"doi\":\"10.1109/CICN.2011.78\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we derive few new quasi-orthogonal space-time block codes for four transmit antennas. These codes differ from each other and existing codes in character matrices and/or correlated values in character matrices. These codes can be constructed using elementary sub-matrices. We also derive corresponding maximum-likelihood decoders for the proposed codes. We observe that decoding complexity of some of these codes is less as compared to the rest of them for rectangular-QAM modulation. Bit error rate performance of these codes have been shown to be same as those of existing quasi-orthogonal space time block codes for four transmit antennas over quasi-static flat Rayleigh fading channels.\",\"PeriodicalId\":292190,\"journal\":{\"name\":\"2011 International Conference on Computational Intelligence and Communication Networks\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Computational Intelligence and Communication Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICN.2011.78\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Intelligence and Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2011.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

本文给出了四个发射天线的准正交空时分组码。这些代码彼此不同，不同于字符矩阵中的现有代码和/或字符矩阵中的相关值。这些码可以用初等子矩阵构造。我们还推导了相应的最大似然解码器。我们观察到，与其他矩形qam调制相比，其中一些编码的解码复杂性较低。这些码的误码率性能与现有的准正交空时分组码在准静态平坦瑞利衰落信道上的误码率性能相同。

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

查看原文本刊更多论文

Few More Quasi-Orthogonal Space-Time Block Codes for Four Transmit Antennas

In this paper, we derive few new quasi-orthogonal space-time block codes for four transmit antennas. These codes differ from each other and existing codes in character matrices and/or correlated values in character matrices. These codes can be constructed using elementary sub-matrices. We also derive corresponding maximum-likelihood decoders for the proposed codes. We observe that decoding complexity of some of these codes is less as compared to the rest of them for rectangular-QAM modulation. Bit error rate performance of these codes have been shown to be same as those of existing quasi-orthogonal space time block codes for four transmit antennas over quasi-static flat Rayleigh fading channels.

求助全文

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

来源期刊

2011 International Conference on Computational Intelligence and Communication Networks

自引率

0.00%

发文量