A low complexity fixed sphere decoder with statistical threshold for MIMO systems

Jangyong Park, Yunho Jung, Jaeseok Kim

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this letter, we propose a low complexity fixed sphere decoder (FSD) with statistical threshold for multiple-input and multiple-output (MIMO) systems. The proposed algorithm is developed by applying two threshold-based pruning algorithms using an initial detection and statistical noise constraint to the FSD. The proposed FSD algorithm is suitable for a fully pipelined hardware implementation and also has low complexity because the threshold of the proposed pruning algorithm is pre-calculated and independently applied to the path without sorting operation. Simulation results show that the proposed FSD has the performance of the original FSD as well as a low complexity compared to the original FSD and other low complexity FSD algorithms.

Original languageEnglish
Pages (from-to)735-739
Number of pages5
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volumee98
Issue number2
DOIs
Publication statusPublished - 2015 Jan 1

Fingerprint

Low Complexity
Output
Pruning
Hardware Implementation
Sorting
Hardware
Path
Simulation

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{c419ef2c30ab42bb95d06d3f3a6034d6,
title = "A low complexity fixed sphere decoder with statistical threshold for MIMO systems",
abstract = "In this letter, we propose a low complexity fixed sphere decoder (FSD) with statistical threshold for multiple-input and multiple-output (MIMO) systems. The proposed algorithm is developed by applying two threshold-based pruning algorithms using an initial detection and statistical noise constraint to the FSD. The proposed FSD algorithm is suitable for a fully pipelined hardware implementation and also has low complexity because the threshold of the proposed pruning algorithm is pre-calculated and independently applied to the path without sorting operation. Simulation results show that the proposed FSD has the performance of the original FSD as well as a low complexity compared to the original FSD and other low complexity FSD algorithms.",
author = "Jangyong Park and Yunho Jung and Jaeseok Kim",
year = "2015",
month = "1",
day = "1",
doi = "10.1587/transfun.E98.A.735",
language = "English",
volume = "e98",
pages = "735--739",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "2",

}

A low complexity fixed sphere decoder with statistical threshold for MIMO systems. / Park, Jangyong; Jung, Yunho; Kim, Jaeseok.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. e98, No. 2, 01.01.2015, p. 735-739.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A low complexity fixed sphere decoder with statistical threshold for MIMO systems

AU - Park, Jangyong

AU - Jung, Yunho

AU - Kim, Jaeseok

PY - 2015/1/1

Y1 - 2015/1/1

N2 - In this letter, we propose a low complexity fixed sphere decoder (FSD) with statistical threshold for multiple-input and multiple-output (MIMO) systems. The proposed algorithm is developed by applying two threshold-based pruning algorithms using an initial detection and statistical noise constraint to the FSD. The proposed FSD algorithm is suitable for a fully pipelined hardware implementation and also has low complexity because the threshold of the proposed pruning algorithm is pre-calculated and independently applied to the path without sorting operation. Simulation results show that the proposed FSD has the performance of the original FSD as well as a low complexity compared to the original FSD and other low complexity FSD algorithms.

AB - In this letter, we propose a low complexity fixed sphere decoder (FSD) with statistical threshold for multiple-input and multiple-output (MIMO) systems. The proposed algorithm is developed by applying two threshold-based pruning algorithms using an initial detection and statistical noise constraint to the FSD. The proposed FSD algorithm is suitable for a fully pipelined hardware implementation and also has low complexity because the threshold of the proposed pruning algorithm is pre-calculated and independently applied to the path without sorting operation. Simulation results show that the proposed FSD has the performance of the original FSD as well as a low complexity compared to the original FSD and other low complexity FSD algorithms.

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

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

U2 - 10.1587/transfun.E98.A.735

DO - 10.1587/transfun.E98.A.735

M3 - Article

AN - SCOPUS:84982181976

VL - e98

SP - 735

EP - 739

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 2

ER -