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

Haiquan Wang; Xiang Gen Xia

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

Haiquan Wang^*, Xiang Gen Xia

^*此作品的通讯作者

University of Delaware

科研成果: 期刊稿件 › 会议文章 › 同行评审

12 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	303
页数	1
期刊	IEEE International Symposium on Information Theory - Proceedings
出版状态	已出版 - 2002
已对外发布	是
活动	2002 IEEE International Symposium on Information Theory - Lausanne, 瑞士期限: 30 6月 2002 → 5 7月 2002

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{38666bff74904a02a184ddf3e0e35e98,

title = "Upper bounds of rates of space-time block codes from complex orthogonal designs",

abstract = "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.",

author = "Haiquan Wang and Xia, {Xiang Gen}",

year = "2002",

language = "English",

pages = "303",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2002 IEEE International Symposium on Information Theory ; Conference date: 30-06-2002 Through 05-07-2002",

}

TY - JOUR

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

AU - Wang, Haiquan

AU - Xia, Xiang Gen

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036350203&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0036350203

SN - 2157-8095

SP - 303

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - 2002 IEEE International Symposium on Information Theory

Y2 - 30 June 2002 through 5 July 2002

ER -

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

摘要

其它文件与链接

指纹

引用此