{"title":"MIMO系统的非对称空时分组码","authors":"C. Hollanti, K. Ranto","doi":"10.1109/ITWITWN.2007.4318041","DOIUrl":null,"url":null,"abstract":"In this paper, the need for the construction of asymmetric space-time block codes (ASTBCs) is discussed, mostly concentrating on the case of four transmitting and two receiving antennas for simplicity. Above the trivial puncturing method, i.e. switching off the extra layers in the symmetric multiple input-multiple output (MIMO) setting, a more sophisticated yet simple asymmetric construction method is proposed. This method can be converted to produce multi-block space-time codes that achieve the diversity-multiplexing (D-M) tradeoff. It is also shown that maximizing the density of the newly proposed codes is equivalent to minimizing the discriminant of a certain order. The use of the general method is then demonstrated by building explicit, sphere decodable codes using different cyclic division algebras (CDAs). We verify by computer simulations that the newly proposed method can compete with the puncturing method, and in some cases outperforms it. Our conquering construction exploiting maximal orders improves even upon the punctured perfect code and the DjABBA code.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Asymmetric Space-Time Block Codes for MIMO Systems\",\"authors\":\"C. Hollanti, K. Ranto\",\"doi\":\"10.1109/ITWITWN.2007.4318041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the need for the construction of asymmetric space-time block codes (ASTBCs) is discussed, mostly concentrating on the case of four transmitting and two receiving antennas for simplicity. Above the trivial puncturing method, i.e. switching off the extra layers in the symmetric multiple input-multiple output (MIMO) setting, a more sophisticated yet simple asymmetric construction method is proposed. This method can be converted to produce multi-block space-time codes that achieve the diversity-multiplexing (D-M) tradeoff. It is also shown that maximizing the density of the newly proposed codes is equivalent to minimizing the discriminant of a certain order. The use of the general method is then demonstrated by building explicit, sphere decodable codes using different cyclic division algebras (CDAs). We verify by computer simulations that the newly proposed method can compete with the puncturing method, and in some cases outperforms it. Our conquering construction exploiting maximal orders improves even upon the punctured perfect code and the DjABBA code.\",\"PeriodicalId\":257392,\"journal\":{\"name\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWITWN.2007.4318041\",\"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 Information Theory Workshop on Information Theory for Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWITWN.2007.4318041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Asymmetric Space-Time Block Codes for MIMO Systems
In this paper, the need for the construction of asymmetric space-time block codes (ASTBCs) is discussed, mostly concentrating on the case of four transmitting and two receiving antennas for simplicity. Above the trivial puncturing method, i.e. switching off the extra layers in the symmetric multiple input-multiple output (MIMO) setting, a more sophisticated yet simple asymmetric construction method is proposed. This method can be converted to produce multi-block space-time codes that achieve the diversity-multiplexing (D-M) tradeoff. It is also shown that maximizing the density of the newly proposed codes is equivalent to minimizing the discriminant of a certain order. The use of the general method is then demonstrated by building explicit, sphere decodable codes using different cyclic division algebras (CDAs). We verify by computer simulations that the newly proposed method can compete with the puncturing method, and in some cases outperforms it. Our conquering construction exploiting maximal orders improves even upon the punctured perfect code and the DjABBA code.