Open AccessProof on the maximal rates of space‐time block codes from complex orthogonal design
Author(s) -
Chen JunSheng,
Wang JianXin
Publication year - 2013
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2012.0816
Subject(s) - block (permutation group theory) , block code , mathematics , computer science , discrete mathematics , algorithm , arithmetic , combinatorics , decoding methods
In this study, the authors present a novel proof on the maximal rates of space‐time block codes from complex orthogonal design (COD). The method of the proof is derived from an observation about the CODs, which reveals some inherent laws of their structure. The proof is applicable to any CODs, rather than to some specific designs, and does not need any auxiliary matrix or matrix transformation. The conclusion in this study also indicates that the upper bound of the CODs’ rate conjectured by the authors is tight and achievable.