Signal position-based adaptive QR decomposition-based M detection algorithm for multiple-input multiple-output systems

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The QR decomposition-based M (QRD-M) algorithm is a suboptimal detection algorithm that achieves near-maximum-likelihood detection (MLD) performance with low complexity. Some conventional QRD-M algorithms that directly determine the number of surviving paths have simple structures and are consequently cost effective and easy to implement. However, it is possible that surviving paths are chosen that have unnecessarily low reliability. The authors propose an algorithm, termed signal position-based QRD-M, to solve this problem using position estimation of the received signal. The position estimation process is accomplished using the most reliable candidate symbol to minimise additional processing. Computer simulations demonstrated that the proposed algorithm can achieve near-MLD performance with lower complexity than the fixed QRD-M algorithm.

Original languageEnglish
Pages (from-to)598-602
Number of pages5
JournalIET Signal Processing
Volume5
Issue number6
DOIs
Publication statusPublished - 2011 Sep 1

Fingerprint

Decomposition
Maximum likelihood
Computer simulation
Processing
Costs

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{e0b6ad52f46840e6ae8577a1f5f4b392,
title = "Signal position-based adaptive QR decomposition-based M detection algorithm for multiple-input multiple-output systems",
abstract = "The QR decomposition-based M (QRD-M) algorithm is a suboptimal detection algorithm that achieves near-maximum-likelihood detection (MLD) performance with low complexity. Some conventional QRD-M algorithms that directly determine the number of surviving paths have simple structures and are consequently cost effective and easy to implement. However, it is possible that surviving paths are chosen that have unnecessarily low reliability. The authors propose an algorithm, termed signal position-based QRD-M, to solve this problem using position estimation of the received signal. The position estimation process is accomplished using the most reliable candidate symbol to minimise additional processing. Computer simulations demonstrated that the proposed algorithm can achieve near-MLD performance with lower complexity than the fixed QRD-M algorithm.",
author = "H. Yoo and Jichai Jeong and Lee, {Jae Hoon}",
year = "2011",
month = "9",
day = "1",
doi = "10.1049/iet-spr.2010.0179",
language = "English",
volume = "5",
pages = "598--602",
journal = "IET Signal Processing",
issn = "1751-9675",
publisher = "Institution of Engineering and Technology",
number = "6",

}

TY - JOUR

T1 - Signal position-based adaptive QR decomposition-based M detection algorithm for multiple-input multiple-output systems

AU - Yoo, H.

AU - Jeong, Jichai

AU - Lee, Jae Hoon

PY - 2011/9/1

Y1 - 2011/9/1

N2 - The QR decomposition-based M (QRD-M) algorithm is a suboptimal detection algorithm that achieves near-maximum-likelihood detection (MLD) performance with low complexity. Some conventional QRD-M algorithms that directly determine the number of surviving paths have simple structures and are consequently cost effective and easy to implement. However, it is possible that surviving paths are chosen that have unnecessarily low reliability. The authors propose an algorithm, termed signal position-based QRD-M, to solve this problem using position estimation of the received signal. The position estimation process is accomplished using the most reliable candidate symbol to minimise additional processing. Computer simulations demonstrated that the proposed algorithm can achieve near-MLD performance with lower complexity than the fixed QRD-M algorithm.

AB - The QR decomposition-based M (QRD-M) algorithm is a suboptimal detection algorithm that achieves near-maximum-likelihood detection (MLD) performance with low complexity. Some conventional QRD-M algorithms that directly determine the number of surviving paths have simple structures and are consequently cost effective and easy to implement. However, it is possible that surviving paths are chosen that have unnecessarily low reliability. The authors propose an algorithm, termed signal position-based QRD-M, to solve this problem using position estimation of the received signal. The position estimation process is accomplished using the most reliable candidate symbol to minimise additional processing. Computer simulations demonstrated that the proposed algorithm can achieve near-MLD performance with lower complexity than the fixed QRD-M algorithm.

UR - http://www.scopus.com/inward/record.url?scp=80052794239&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052794239&partnerID=8YFLogxK

U2 - 10.1049/iet-spr.2010.0179

DO - 10.1049/iet-spr.2010.0179

M3 - Article

AN - SCOPUS:80052794239

VL - 5

SP - 598

EP - 602

JO - IET Signal Processing

JF - IET Signal Processing

SN - 1751-9675

IS - 6

ER -