{"title":"实现分集-复用折衷的多块空时码的低复杂度结构","authors":"Hsiao-feng Lu","doi":"10.1109/GLOCOM.2007.332","DOIUrl":null,"url":null,"abstract":"A construction of low complexity multi-block space- time codes that is optimal with respect to the diversity- multiplexing tradeoff (DMT) when the coding is applied over any number of independent fading blocks is presented in this paper. Specifically, for a MIMO system over a quasi-static Rayleigh block fading channel with quasi-static interval T, the present construction requires a number field that is cyclic Galois over Q(i) of degree only T, while the previously known construction requires a number field of degree mT, where m is the number of coded fading blocks. Thus, the present construction provides a great reduction on both the encoding and decoding complexities of multi-block space-time codes comparing to earlier constructions, and it achieves complexity at the same level as that of the conventional DMT-optimal single block space-time codes.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Low Complexity Constructions of Multi-Block Space-Time Codes Achieving Diversity-Multiplexing Tradeoff\",\"authors\":\"Hsiao-feng Lu\",\"doi\":\"10.1109/GLOCOM.2007.332\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A construction of low complexity multi-block space- time codes that is optimal with respect to the diversity- multiplexing tradeoff (DMT) when the coding is applied over any number of independent fading blocks is presented in this paper. Specifically, for a MIMO system over a quasi-static Rayleigh block fading channel with quasi-static interval T, the present construction requires a number field that is cyclic Galois over Q(i) of degree only T, while the previously known construction requires a number field of degree mT, where m is the number of coded fading blocks. Thus, the present construction provides a great reduction on both the encoding and decoding complexities of multi-block space-time codes comparing to earlier constructions, and it achieves complexity at the same level as that of the conventional DMT-optimal single block space-time codes.\",\"PeriodicalId\":370937,\"journal\":{\"name\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2007.332\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2007.332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low Complexity Constructions of Multi-Block Space-Time Codes Achieving Diversity-Multiplexing Tradeoff
A construction of low complexity multi-block space- time codes that is optimal with respect to the diversity- multiplexing tradeoff (DMT) when the coding is applied over any number of independent fading blocks is presented in this paper. Specifically, for a MIMO system over a quasi-static Rayleigh block fading channel with quasi-static interval T, the present construction requires a number field that is cyclic Galois over Q(i) of degree only T, while the previously known construction requires a number field of degree mT, where m is the number of coded fading blocks. Thus, the present construction provides a great reduction on both the encoding and decoding complexities of multi-block space-time codes comparing to earlier constructions, and it achieves complexity at the same level as that of the conventional DMT-optimal single block space-time codes.