Lower bounds on the minimal delay of complex orthogonal designs with maximal rates
Date
2006
Authors
Kan, H.
Shen, H.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
IEEE Transactions on Communications, 2006; 54(3):383-388
Statement of Responsibility
Haibin Kan and Hong Shen
Conference Name
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 orthogonal 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.
School/Discipline
Dissertation Note
Provenance
Description
Copyright © 2006 IEEE