The maximal rates of more general complex orthogonal designs

Haibin Kan; Hong Shen

The maximal rates of more general complex orthogonal designs

Haibin Kan, Hong Shen

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

2 Citations (Scopus)

Abstract

The maximal rates and the minimal delays are basic problems of space-time block codes from complex orthogonal designs. Liang [5] systematically solved the problem on the maximal rates for a special kind of complex othogonal designs, and posed an open problem on the minimal delays. Recently, Kan & Shen [3] gave a negative answer for the open problem. In the paper, we prove that the maximal code rates that Liang gave in [5] also hold for more general complex orthogonal designs.

Original language	English
Title of host publication	Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Pages	177-179
Number of pages	3
Publication status	Published - 2005
Externally published	Yes
Event	6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005 - Dalian, China Duration: 5 Dec 2005 → 8 Dec 2005

Publication series

Name	Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
Volume	2005

Conference

Conference	6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Country/Territory	China
City	Dalian
Period	5/12/05 → 8/12/05

Keywords

Complex orthogonal designs
Delays
Maximal rates
Space-time block codes

Cite this

@inproceedings{86333a8788bf49418f82760874054fc2,

title = "The maximal rates of more general complex orthogonal designs",

abstract = "The maximal rates and the minimal delays are basic problems of space-time block codes from complex orthogonal designs. Liang [5] systematically solved the problem on the maximal rates for a special kind of complex othogonal designs, and posed an open problem on the minimal delays. Recently, Kan & Shen [3] gave a negative answer for the open problem. In the paper, we prove that the maximal code rates that Liang gave in [5] also hold for more general complex orthogonal designs.",

keywords = "Complex orthogonal designs, Delays, Maximal rates, Space-time block codes",

author = "Haibin Kan and Hong Shen",

year = "2005",

language = "English",

isbn = "0769524052",

series = "Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings",

pages = "177--179",

booktitle = "Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005",

note = "6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005 ; Conference date: 05-12-2005 Through 08-12-2005",

}

Kan, H & Shen, H 2005, The maximal rates of more general complex orthogonal designs. in Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005., 1578892, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, vol. 2005, pp. 177-179, 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005, Dalian, China, 5/12/05.

The maximal rates of more general complex orthogonal designs. / Kan, Haibin; Shen, Hong.
Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005. 2005. p. 177-179 1578892 (Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings; Vol. 2005).

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

TY - GEN

T1 - The maximal rates of more general complex orthogonal designs

AU - Kan, Haibin

AU - Shen, Hong

PY - 2005

Y1 - 2005

N2 - The maximal rates and the minimal delays are basic problems of space-time block codes from complex orthogonal designs. Liang [5] systematically solved the problem on the maximal rates for a special kind of complex othogonal designs, and posed an open problem on the minimal delays. Recently, Kan & Shen [3] gave a negative answer for the open problem. In the paper, we prove that the maximal code rates that Liang gave in [5] also hold for more general complex orthogonal designs.

AB - The maximal rates and the minimal delays are basic problems of space-time block codes from complex orthogonal designs. Liang [5] systematically solved the problem on the maximal rates for a special kind of complex othogonal designs, and posed an open problem on the minimal delays. Recently, Kan & Shen [3] gave a negative answer for the open problem. In the paper, we prove that the maximal code rates that Liang gave in [5] also hold for more general complex orthogonal designs.

KW - Complex orthogonal designs

KW - Delays

KW - Maximal rates

KW - Space-time block codes

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

M3 - Conference contribution

AN - SCOPUS:33745120831

SN - 0769524052

SN - 9780769524054

T3 - Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

SP - 177

EP - 179

BT - Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005

T2 - 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005

Y2 - 5 December 2005 through 8 December 2005

ER -

The maximal rates of more general complex orthogonal designs

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this