The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cette lettre étudie les codes de blocs spatio-temporels de conception quasi-orthogonale comme compromis entre un débit de transmission élevé et une faible complexité de décodage. En étudiant le rôle que joue l'orthogonalité dans les codes de blocs spatio-temporels, la limite supérieure du taux de transmission et la limite inférieure de la complexité de décodage pour une conception quasi-orthogonale sont revendiquées. De ce point de vue, de nouveaux algorithmes sont développés pour construire des conceptions quasi-orthogonales spécifiques atteignant ces limites.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Huanfei MA, Zhihao WU, Haibin KAN, "Space-Time Block Codes from Quasi-Orthogonal Designs with Maximal Rate or Minimal Decoding Complexity" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 2, pp. 399-402, February 2010, doi: 10.1587/transcom.E93.B.399.
Abstract: This letter investigates the space-time block codes from quasi-orthogonal design as a tradeoff between high transmission rate and low decoding complexity. By studying the role orthogonality plays in space-time block codes, upper bound of transmission rate and lower bound of decoding complexity for quasi-orthogonal design are claimed. From this point of view, novel algorithms are developed to construct specific quasi-orthogonal designs achieving these bounds.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.399/_p
Copier
@ARTICLE{e93-b_2_399,
author={Huanfei MA, Zhihao WU, Haibin KAN, },
journal={IEICE TRANSACTIONS on Communications},
title={Space-Time Block Codes from Quasi-Orthogonal Designs with Maximal Rate or Minimal Decoding Complexity},
year={2010},
volume={E93-B},
number={2},
pages={399-402},
abstract={This letter investigates the space-time block codes from quasi-orthogonal design as a tradeoff between high transmission rate and low decoding complexity. By studying the role orthogonality plays in space-time block codes, upper bound of transmission rate and lower bound of decoding complexity for quasi-orthogonal design are claimed. From this point of view, novel algorithms are developed to construct specific quasi-orthogonal designs achieving these bounds.},
keywords={},
doi={10.1587/transcom.E93.B.399},
ISSN={1745-1345},
month={February},}
Copier
TY - JOUR
TI - Space-Time Block Codes from Quasi-Orthogonal Designs with Maximal Rate or Minimal Decoding Complexity
T2 - IEICE TRANSACTIONS on Communications
SP - 399
EP - 402
AU - Huanfei MA
AU - Zhihao WU
AU - Haibin KAN
PY - 2010
DO - 10.1587/transcom.E93.B.399
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2010
AB - This letter investigates the space-time block codes from quasi-orthogonal design as a tradeoff between high transmission rate and low decoding complexity. By studying the role orthogonality plays in space-time block codes, upper bound of transmission rate and lower bound of decoding complexity for quasi-orthogonal design are claimed. From this point of view, novel algorithms are developed to construct specific quasi-orthogonal designs achieving these bounds.
ER -