Lower bounds on the minimal delay of complex orthogonal designs with maximal rates

Haibin Kan; Hong Shen

doi:10.1109/TCOMM.2006.869880

Lower bounds on the minimal delay of complex orthogonal designs with maximal rates

Haibin Kan, Hong Shen

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

Abstract

The maximal rates and the minimal delays are basic problems of space-time block codes from complex orthogonal designs. Liang systematically solved the problem on the maximal rates of complex othogonal designs, and posed an open problem on the minimal delays. Recently, the authors gave the negative answer for the open problem. In this letter, we give lower bounds on the minimal delays.

Original language	English
Pages (from-to)	383-388
Number of pages	6
Journal	IEEE Transactions on Communications
Volume	54
Issue number	3
DOIs	https://doi.org/10.1109/TCOMM.2006.869880
Publication status	Published - Mar 2006
Externally published	Yes

Keywords

Complex orthogonal designs
Delays
Maximal rates
Space-time block codes (STBCs)

Access to Document

10.1109/TCOMM.2006.869880

Cite this

@article{e3298a9e3c6b4ea7bccc00e792f4f6f7,

title = "Lower bounds on the minimal delay of complex orthogonal designs with maximal rates",

abstract = "The maximal rates and the minimal delays are basic problems of space-time block codes from complex orthogonal designs. Liang systematically solved the problem on the maximal rates of complex othogonal designs, and posed an open problem on the minimal delays. Recently, the authors gave the negative answer for the open problem. In this letter, we give lower bounds on the minimal delays.",

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

author = "Haibin Kan and Hong Shen",

note = "Funding Information: Paper approved by A. Anastasopoulos, the Editor for Wireless Communications of the IEEE Communications Society. Manuscript received August 13, 2004; revised May 24, 2005. This work was supported in part by the National Science Foundation of China under Grant 60472038, and in part by the Japan Society for Promotion of Science (JSPS) under Research Grant 17700008.",

year = "2006",

month = mar,

doi = "10.1109/TCOMM.2006.869880",

language = "English",

volume = "54",

pages = "383--388",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

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

number = "3",

}

TY - JOUR

T1 - Lower bounds on the minimal delay of complex orthogonal designs with maximal rates

AU - Kan, Haibin

AU - Shen, Hong

N1 - Funding Information: Paper approved by A. Anastasopoulos, the Editor for Wireless Communications of the IEEE Communications Society. Manuscript received August 13, 2004; revised May 24, 2005. This work was supported in part by the National Science Foundation of China under Grant 60472038, and in part by the Japan Society for Promotion of Science (JSPS) under Research Grant 17700008.

PY - 2006/3

Y1 - 2006/3

N2 - The maximal rates and the minimal delays are basic problems of space-time block codes from complex orthogonal designs. Liang systematically solved the problem on the maximal rates of complex othogonal designs, and posed an open problem on the minimal delays. Recently, the authors gave the negative answer for the open problem. In this letter, we give lower bounds on the minimal delays.

AB - The maximal rates and the minimal delays are basic problems of space-time block codes from complex orthogonal designs. Liang systematically solved the problem on the maximal rates of complex othogonal designs, and posed an open problem on the minimal delays. Recently, the authors gave the negative answer for the open problem. In this letter, we give lower bounds on the minimal delays.

KW - Complex orthogonal designs

KW - Delays

KW - Maximal rates

KW - Space-time block codes (STBCs)

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

U2 - 10.1109/TCOMM.2006.869880

DO - 10.1109/TCOMM.2006.869880

M3 - Article

AN - SCOPUS:33644999310

SN - 0090-6778

VL - 54

SP - 383

EP - 388

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 3

ER -

Lower bounds on the minimal delay of complex orthogonal designs with maximal rates

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this