{"title":"A Space Time Code to Achieve Generalized Optimal Diversity","authors":"J. Hou","doi":"10.1109/ICCIT.2009.286","DOIUrl":null,"url":null,"abstract":"In this paper, we propose some higher rate simple space time codes achieving the generalized optimal diversity for wireless networking. The proposed scheme is simply extended from some polyphase orthogonal patterns, which are adapted for any modulations without additional multiplications.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT.2009.286","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose some higher rate simple space time codes achieving the generalized optimal diversity for wireless networking. The proposed scheme is simply extended from some polyphase orthogonal patterns, which are adapted for any modulations without additional multiplications.