On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity

Haiquan Wang; Dong Wang; Xiang Gen Xia

doi:10.1109/isit.2005.1523525

On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity

Haiquan Wang
, Dong Wang
, Xiang Gen Xia

University of Delaware

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

20 引用（Scopus）

摘要

In this paper, we first present a necessary and sufficient condition on linear transformations for an QOSTBC to possess the minimum ML decoding complexity, i.e., real symbol pair-wise decoding. We then present optimal linear transformations of information symbols for quasi-orthogonal space-time block codes (QOSTBC) with minimum ML decoding complexity, The optimality is in the sense that the diversity product (or product distance) is maximized when the mean transmission power is fixed.

源语言	英语
页（从-至）	1168-1172
页数	5
期刊	IEEE International Symposium on Information Theory - Proceedings
DOI	https://doi.org/10.1109/isit.2005.1523525
出版状态	已出版 - 2005
已对外发布	是
活动	2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, 澳大利亚期限: 4 9月 2005 → 9 9月 2005

访问文件

10.1109/isit.2005.1523525

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{9424f1dd2a084e6eab04eef8b6a48b78,

title = "On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity",

abstract = "In this paper, we first present a necessary and sufficient condition on linear transformations for an QOSTBC to possess the minimum ML decoding complexity, i.e., real symbol pair-wise decoding. We then present optimal linear transformations of information symbols for quasi-orthogonal space-time block codes (QOSTBC) with minimum ML decoding complexity, The optimality is in the sense that the diversity product (or product distance) is maximized when the mean transmission power is fixed.",

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

year = "2005",

doi = "10.1109/isit.2005.1523525",

language = "English",

pages = "1168--1172",

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

issn = "2157-8095",

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

}

TY - JOUR

T1 - On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity

AU - Wang, Haiquan

AU - Wang, Dong

AU - Xia, Xiang Gen

PY - 2005

Y1 - 2005

N2 - In this paper, we first present a necessary and sufficient condition on linear transformations for an QOSTBC to possess the minimum ML decoding complexity, i.e., real symbol pair-wise decoding. We then present optimal linear transformations of information symbols for quasi-orthogonal space-time block codes (QOSTBC) with minimum ML decoding complexity, The optimality is in the sense that the diversity product (or product distance) is maximized when the mean transmission power is fixed.

AB - In this paper, we first present a necessary and sufficient condition on linear transformations for an QOSTBC to possess the minimum ML decoding complexity, i.e., real symbol pair-wise decoding. We then present optimal linear transformations of information symbols for quasi-orthogonal space-time block codes (QOSTBC) with minimum ML decoding complexity, The optimality is in the sense that the diversity product (or product distance) is maximized when the mean transmission power is fixed.

UR - https://www.scopus.com/pages/publications/105029346354

U2 - 10.1109/isit.2005.1523525

DO - 10.1109/isit.2005.1523525

M3 - Conference article

AN - SCOPUS:105029346354

SN - 2157-8095

SP - 1168

EP - 1172

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05

Y2 - 4 September 2005 through 9 September 2005

ER -

On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity

摘要

访问文件

其它文件与链接

指纹

引用此