Algebraic relationship between amicable orthogonal designs and quasi-orthogonal STBC with minimum decoding complexity

Chau Yuen; Yong Liang Guan; Tjeng Thiang Tjhung

doi:10.1109/ICC.2006.255438

Algebraic relationship between amicable orthogonal designs and quasi-orthogonal STBC with minimum decoding complexity

Chau Yuen^*, Yong Liang Guan, Tjeng Thiang Tjhung

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Citations (Scopus)

Abstract

We show that there exists an interesting relationship between the algebraic constraints of Amicable Orthogonal Design (AOD) matrices and the dispersion matrices of Quasi-Orthogonal Space-Time Block Code with minimum decoding complexity (MDC-QOSTBC). This insight leads to a novel concept of "Preferred AOD Pair", and we show that MDC-QOSTBC can be constructed from two AODs that form a Preferred AOD Pair. With the Preferred AOD Pair concept, we are able to derive the lower bound on code rate of square MDC-QOSTBC, and show them to be 1 and 3/4 for four and eight transmit antennas respectively. We also present a systematic method to construct Preferred AOD Pair and use them to obtain new MDC-QOSTBCs.

Original language	English
Title of host publication	2006 IEEE International Conference on Communications, ICC 2006
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	4882-4887
Number of pages	6
ISBN (Print)	1424403553, 9781424403554
DOIs	https://doi.org/10.1109/ICC.2006.255438
Publication status	Published - 2006
Externally published	Yes
Event	2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey Duration: Jul 11 2006 → Jul 15 2006

Publication series

Name	IEEE International Conference on Communications
Volume	11
ISSN (Print)	0536-1486

Conference

Conference	2006 IEEE International Conference on Communications, ICC 2006
Country/Territory	Turkey
City	Istanbul
Period	7/11/06 → 7/15/06

ASJC Scopus Subject Areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/ICC.2006.255438

Cite this

Yuen, C., Guan, Y. L., & Tjhung, T. T. (2006). Algebraic relationship between amicable orthogonal designs and quasi-orthogonal STBC with minimum decoding complexity. In 2006 IEEE International Conference on Communications, ICC 2006 (pp. 4882-4887). Article 4024822 (IEEE International Conference on Communications; Vol. 11). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2006.255438

@inproceedings{00660b4a584748eaaeb4c0e8b2c6e312,

title = "Algebraic relationship between amicable orthogonal designs and quasi-orthogonal STBC with minimum decoding complexity",

abstract = "We show that there exists an interesting relationship between the algebraic constraints of Amicable Orthogonal Design (AOD) matrices and the dispersion matrices of Quasi-Orthogonal Space-Time Block Code with minimum decoding complexity (MDC-QOSTBC). This insight leads to a novel concept of {"}Preferred AOD Pair{"}, and we show that MDC-QOSTBC can be constructed from two AODs that form a Preferred AOD Pair. With the Preferred AOD Pair concept, we are able to derive the lower bound on code rate of square MDC-QOSTBC, and show them to be 1 and 3/4 for four and eight transmit antennas respectively. We also present a systematic method to construct Preferred AOD Pair and use them to obtain new MDC-QOSTBCs.",

author = "Chau Yuen and Guan, {Yong Liang} and Tjhung, {Tjeng Thiang}",

year = "2006",

doi = "10.1109/ICC.2006.255438",

language = "English",

isbn = "1424403553",

series = "IEEE International Conference on Communications",

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

pages = "4882--4887",

booktitle = "2006 IEEE International Conference on Communications, ICC 2006",

address = "United States",

note = "2006 IEEE International Conference on Communications, ICC 2006 ; Conference date: 11-07-2006 Through 15-07-2006",

}

Yuen, C, Guan, YL & Tjhung, TT 2006, Algebraic relationship between amicable orthogonal designs and quasi-orthogonal STBC with minimum decoding complexity. in 2006 IEEE International Conference on Communications, ICC 2006., 4024822, IEEE International Conference on Communications, vol. 11, Institute of Electrical and Electronics Engineers Inc., pp. 4882-4887, 2006 IEEE International Conference on Communications, ICC 2006, Istanbul, Turkey, 7/11/06. https://doi.org/10.1109/ICC.2006.255438

Algebraic relationship between amicable orthogonal designs and quasi-orthogonal STBC with minimum decoding complexity. / Yuen, Chau; Guan, Yong Liang; Tjhung, Tjeng Thiang.
2006 IEEE International Conference on Communications, ICC 2006. Institute of Electrical and Electronics Engineers Inc., 2006. p. 4882-4887 4024822 (IEEE International Conference on Communications; Vol. 11).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Algebraic relationship between amicable orthogonal designs and quasi-orthogonal STBC with minimum decoding complexity

AU - Yuen, Chau

AU - Guan, Yong Liang

AU - Tjhung, Tjeng Thiang

PY - 2006

Y1 - 2006

N2 - We show that there exists an interesting relationship between the algebraic constraints of Amicable Orthogonal Design (AOD) matrices and the dispersion matrices of Quasi-Orthogonal Space-Time Block Code with minimum decoding complexity (MDC-QOSTBC). This insight leads to a novel concept of "Preferred AOD Pair", and we show that MDC-QOSTBC can be constructed from two AODs that form a Preferred AOD Pair. With the Preferred AOD Pair concept, we are able to derive the lower bound on code rate of square MDC-QOSTBC, and show them to be 1 and 3/4 for four and eight transmit antennas respectively. We also present a systematic method to construct Preferred AOD Pair and use them to obtain new MDC-QOSTBCs.

AB - We show that there exists an interesting relationship between the algebraic constraints of Amicable Orthogonal Design (AOD) matrices and the dispersion matrices of Quasi-Orthogonal Space-Time Block Code with minimum decoding complexity (MDC-QOSTBC). This insight leads to a novel concept of "Preferred AOD Pair", and we show that MDC-QOSTBC can be constructed from two AODs that form a Preferred AOD Pair. With the Preferred AOD Pair concept, we are able to derive the lower bound on code rate of square MDC-QOSTBC, and show them to be 1 and 3/4 for four and eight transmit antennas respectively. We also present a systematic method to construct Preferred AOD Pair and use them to obtain new MDC-QOSTBCs.

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

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

U2 - 10.1109/ICC.2006.255438

DO - 10.1109/ICC.2006.255438

M3 - Conference contribution

AN - SCOPUS:42549141152

SN - 1424403553

SN - 9781424403554

T3 - IEEE International Conference on Communications

SP - 4882

EP - 4887

BT - 2006 IEEE International Conference on Communications, ICC 2006

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2006 IEEE International Conference on Communications, ICC 2006

Y2 - 11 July 2006 through 15 July 2006

ER -

Yuen C, Guan YL, Tjhung TT. Algebraic relationship between amicable orthogonal designs and quasi-orthogonal STBC with minimum decoding complexity. In 2006 IEEE International Conference on Communications, ICC 2006. Institute of Electrical and Electronics Engineers Inc. 2006. p. 4882-4887. 4024822. (IEEE International Conference on Communications). doi: 10.1109/ICC.2006.255438

Algebraic relationship between amicable orthogonal designs and quasi-orthogonal STBC with minimum decoding complexity

Abstract

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this