{"title":"准正交设计的分集嵌入空时码","authors":"K. Gowda, C. Yuen, Sumei Sun","doi":"10.1109/ISITA.2008.4895635","DOIUrl":null,"url":null,"abstract":"This paper proposes a class of space-time (ST) codes for supporting applications that demand unequal error protection. Traditionally, an ST code is designed to support a single information stream aiming to achieve a point on the fundamental rate versus diversity trade-off curve. The construction in this paper is based on the diversity-embedded codes recently proposed by Diggavi et.al., where-in ST codes need to encode multiple information streams, with each stream demanding a different level of reliability. In this paper, we propose to use an existing class of ST codes with low maximum-likelihood decoding complexity, as diversity embedded codes. For this class of codes, we are able to characterize the different diversity levels achievable for every message symbol.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Diversity embedded space-time code from quasi-orthogonal designs\",\"authors\":\"K. Gowda, C. Yuen, Sumei Sun\",\"doi\":\"10.1109/ISITA.2008.4895635\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a class of space-time (ST) codes for supporting applications that demand unequal error protection. Traditionally, an ST code is designed to support a single information stream aiming to achieve a point on the fundamental rate versus diversity trade-off curve. The construction in this paper is based on the diversity-embedded codes recently proposed by Diggavi et.al., where-in ST codes need to encode multiple information streams, with each stream demanding a different level of reliability. In this paper, we propose to use an existing class of ST codes with low maximum-likelihood decoding complexity, as diversity embedded codes. For this class of codes, we are able to characterize the different diversity levels achievable for every message symbol.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"40 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 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895635\",\"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 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Diversity embedded space-time code from quasi-orthogonal designs
This paper proposes a class of space-time (ST) codes for supporting applications that demand unequal error protection. Traditionally, an ST code is designed to support a single information stream aiming to achieve a point on the fundamental rate versus diversity trade-off curve. The construction in this paper is based on the diversity-embedded codes recently proposed by Diggavi et.al., where-in ST codes need to encode multiple information streams, with each stream demanding a different level of reliability. In this paper, we propose to use an existing class of ST codes with low maximum-likelihood decoding complexity, as diversity embedded codes. For this class of codes, we are able to characterize the different diversity levels achievable for every message symbol.