实现广义最优分集的空时码

2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI:10.1109/ICCIT.2009.286

J. Hou

{"title":"实现广义最优分集的空时码","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":"{\"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}","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

摘要

本文提出了几种实现无线网络广义最优分集的高速率简单空时码。该方案是简单地从一些多相正交模式扩展而来，适用于任何调制而不需要额外的乘法。

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

查看原文本刊更多论文

A Space Time Code to Achieve Generalized Optimal Diversity

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.

求助全文

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

来源期刊

2009 Fourth International Conference on Computer Sciences and Convergence Information Technology

自引率

0.00%

发文量