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 -