Estimating Per-Substream Minimum Euclidean Distances for MIMO Systems

Masaaki FUJII  

IEICE TRANSACTIONS on Communications   Vol.E90-B   No.6   pp.1551-1554
Publication Date: 2007/06/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.6.1551
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Wireless Communication Technologies
MIMO,  minimum Euclidean distance,  QR decomposition,  MLD,  

Full Text: PDF(750.9KB)>>
Buy this Article

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.