跳到主要导航 跳到搜索 跳到主要内容

Upper bounds of rates of space-time block codes from complex orthogonal designs

  • University of Delaware

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Some upper bounds on the rates of complex orthogonal space-time (COST) block codes were derived. A construction of rate 1/2 COST block codes for phase shift keying (PSK) and QAM symbols was provided using real orthogonal space-time block codes of rate 1. To maintain the fast maximum likelihood (ML) decoding and the full diversity of a space-time block code, the orthonormality that the norms of all column vectors were the same can be relaxed to general orthogonality.

源语言英语
主期刊名Proceedings - 2002 IEEE International Symposium on Information Theory, ISIT 2002
出版商Institute of Electrical and Electronics Engineers Inc.
303
页数1
ISBN(印刷版)0780375017
DOI
出版状态已出版 - 2002
已对外发布
活动2002 IEEE International Symposium on Information Theory, ISIT 2002 - Lausanne, 瑞士
期限: 30 6月 20025 7月 2002

丛书

姓名IEEE International Symposium on Information Theory - Proceedings
ISSN(印刷版)2157-8095

会议

会议2002 IEEE International Symposium on Information Theory, ISIT 2002
国家/地区瑞士
Lausanne
时期30/06/025/07/02

学术指纹

探究 'Upper bounds of rates of space-time block codes from complex orthogonal designs' 的科研主题。它们共同构成独一无二的学术指纹。

引用此