loading...
The maximal rates of more general complex orthogonal designs
Dalian, China December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.236Sixth International Conference on Par ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Haibin Kan, Hong Shen, "The maximal rates of more general complex orthogonal designs," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 177-180, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2005.236,
author = {Haibin Kan and Hong Shen},
title = {The maximal rates of more general complex orthogonal designs},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2405-2},
pages = {177-180},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.236},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - The maximal rates of more general complex orthogonal designs
SN - 0-7695-2405-2
SP177
EP180
A1 - Haibin Kan,
A1 - Hong Shen,
PY - 2005
KW - complex orthogonal designs
KW - delays
KW - maximal rates
KW - space-time block codes
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
Haibin Kan, Fudan University, Shanghai, China
Hong Shen, Japan Advanced Institute of Science and Technology Tatsunokuchi, Ishikawa
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.
Index Terms:
complex orthogonal designs, delays, maximal rates, space-time block codes
Citation:
Haibin Kan, Hong Shen, "The maximal rates of more general complex orthogonal designs," pdcat, pp.177-180, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.