Estimating Per-Substream Minimum Euclidean Distances for MIMO Systems

Masaaki FUJII

doi:10.1093/ietcom/e90-b.6.1551

Estimating Per-Substream Minimum Euclidean Distances for MIMO Systems

Masaaki FUJII

Full Text Views

0

Share
Cite this

Summary :

A method for searching minimum Euclidean distances of respective substreams for different modulation orders of M-ary quadrature amplitude modulation signals in multiple-input and multiple-output systems is described. A channel matrix is cyclically-sorted sequentially and QR-decomposed. Using upper triangular matrices obtained by QR decomposition, minimum Euclidean distances are searched over trellis diagrams consisting of symbol-difference lattice points by computationally efficient multiple trellis-search algorithms. The simulation results demonstrate that per-substream minimum Euclidean distances can be detected with a high correct-estimation probability by path-re-searching controls over different modulation orders.

Publication: IEICE TRANSACTIONS on Communications Vol.E90-B No.6 pp.1551-1554

Publication Date: 2007/06/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e90-b.6.1551

Type of Manuscript: LETTER

Category: Wireless Communication Technologies

Cite this

Copy

Masaaki FUJII, "Estimating Per-Substream Minimum Euclidean Distances for MIMO Systems" in IEICE TRANSACTIONS on Communications, vol. E90-B, no. 6, pp. 1551-1554, June 2007, doi: 10.1093/ietcom/e90-b.6.1551.
Abstract: A method for searching minimum Euclidean distances of respective substreams for different modulation orders of M-ary quadrature amplitude modulation signals in multiple-input and multiple-output systems is described. A channel matrix is cyclically-sorted sequentially and QR-decomposed. Using upper triangular matrices obtained by QR decomposition, minimum Euclidean distances are searched over trellis diagrams consisting of symbol-difference lattice points by computationally efficient multiple trellis-search algorithms. The simulation results demonstrate that per-substream minimum Euclidean distances can be detected with a high correct-estimation probability by path-re-searching controls over different modulation orders.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.6.1551/_p

Copy

@ARTICLE{e90-b_6_1551,
author={Masaaki FUJII, },
journal={IEICE TRANSACTIONS on Communications},
title={Estimating Per-Substream Minimum Euclidean Distances for MIMO Systems},
year={2007},
volume={E90-B},
number={6},
pages={1551-1554},
abstract={A method for searching minimum Euclidean distances of respective substreams for different modulation orders of M-ary quadrature amplitude modulation signals in multiple-input and multiple-output systems is described. A channel matrix is cyclically-sorted sequentially and QR-decomposed. Using upper triangular matrices obtained by QR decomposition, minimum Euclidean distances are searched over trellis diagrams consisting of symbol-difference lattice points by computationally efficient multiple trellis-search algorithms. The simulation results demonstrate that per-substream minimum Euclidean distances can be detected with a high correct-estimation probability by path-re-searching controls over different modulation orders.},
keywords={},
doi={10.1093/ietcom/e90-b.6.1551},
ISSN={1745-1345},
month={June},}

Copy

TY - JOUR
TI - Estimating Per-Substream Minimum Euclidean Distances for MIMO Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 1551
EP - 1554
AU - Masaaki FUJII
PY - 2007
DO - 10.1093/ietcom/e90-b.6.1551
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2007
AB - A method for searching minimum Euclidean distances of respective substreams for different modulation orders of M-ary quadrature amplitude modulation signals in multiple-input and multiple-output systems is described. A channel matrix is cyclically-sorted sequentially and QR-decomposed. Using upper triangular matrices obtained by QR decomposition, minimum Euclidean distances are searched over trellis diagrams consisting of symbol-difference lattice points by computationally efficient multiple trellis-search algorithms. The simulation results demonstrate that per-substream minimum Euclidean distances can be detected with a high correct-estimation probability by path-re-searching controls over different modulation orders.
ER -