Sphere decoding with a probabilistic tree pruning

Byonghyo Shim, Insung Kang

Research output: Contribution to journalArticle

84 Citations (Scopus)

Abstract

In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a probabilistic noise constraint on top of the sphere constraint, a more stringent necessary condition is provided, particularly at an early stage, and, hence, branches unlikely to be survived are removed in the early stage of sphere search. The tradeoff between the performance and complexity is easily controlled by a single parameter, so-called pruning probability. Through the analysis and simulations, we show that the complexity reduction is significant while maintaining the negligible performance degradation.

Original languageEnglish
Pages (from-to)4867-4878
Number of pages12
JournalIEEE Transactions on Signal Processing
Volume56
Issue number10 I
DOIs
Publication statusPublished - 2008 Oct 8

Fingerprint

Decoding
Degradation

Keywords

  • Lattice
  • Maximum likelihood decoding
  • Multiple-input-multiple-output (MIMO) system
  • Probabilistic noise constraint
  • Probabilistic tree pruning
  • Sphere constraint
  • Sphere decoding (SD)

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Sphere decoding with a probabilistic tree pruning. / Shim, Byonghyo; Kang, Insung.

In: IEEE Transactions on Signal Processing, Vol. 56, No. 10 I, 08.10.2008, p. 4867-4878.

Research output: Contribution to journalArticle

@article{3899a725495a4a578bbd6d2dca9d88ab,
title = "Sphere decoding with a probabilistic tree pruning",
abstract = "In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a probabilistic noise constraint on top of the sphere constraint, a more stringent necessary condition is provided, particularly at an early stage, and, hence, branches unlikely to be survived are removed in the early stage of sphere search. The tradeoff between the performance and complexity is easily controlled by a single parameter, so-called pruning probability. Through the analysis and simulations, we show that the complexity reduction is significant while maintaining the negligible performance degradation.",
keywords = "Lattice, Maximum likelihood decoding, Multiple-input-multiple-output (MIMO) system, Probabilistic noise constraint, Probabilistic tree pruning, Sphere constraint, Sphere decoding (SD)",
author = "Byonghyo Shim and Insung Kang",
year = "2008",
month = "10",
day = "8",
doi = "10.1109/TSP.2008.923808",
language = "English",
volume = "56",
pages = "4867--4878",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10 I",

}

TY - JOUR

T1 - Sphere decoding with a probabilistic tree pruning

AU - Shim, Byonghyo

AU - Kang, Insung

PY - 2008/10/8

Y1 - 2008/10/8

N2 - In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a probabilistic noise constraint on top of the sphere constraint, a more stringent necessary condition is provided, particularly at an early stage, and, hence, branches unlikely to be survived are removed in the early stage of sphere search. The tradeoff between the performance and complexity is easily controlled by a single parameter, so-called pruning probability. Through the analysis and simulations, we show that the complexity reduction is significant while maintaining the negligible performance degradation.

AB - In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a probabilistic noise constraint on top of the sphere constraint, a more stringent necessary condition is provided, particularly at an early stage, and, hence, branches unlikely to be survived are removed in the early stage of sphere search. The tradeoff between the performance and complexity is easily controlled by a single parameter, so-called pruning probability. Through the analysis and simulations, we show that the complexity reduction is significant while maintaining the negligible performance degradation.

KW - Lattice

KW - Maximum likelihood decoding

KW - Multiple-input-multiple-output (MIMO) system

KW - Probabilistic noise constraint

KW - Probabilistic tree pruning

KW - Sphere constraint

KW - Sphere decoding (SD)

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

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

U2 - 10.1109/TSP.2008.923808

DO - 10.1109/TSP.2008.923808

M3 - Article

AN - SCOPUS:53149108983

VL - 56

SP - 4867

EP - 4878

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 10 I

ER -