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.
Jangyong PARK
Yonsei University
Yunho JUNG
Korea Aerospace University
Jaeseok KIM
Yonsei University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Jangyong PARK, Yunho JUNG, Jaeseok KIM, "A Low Complexity Fixed Sphere Decoder with Statistical Threshold for MIMO Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 2, pp. 735-739, February 2015, doi: 10.1587/transfun.E98.A.735.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.735/_p
Copy
@ARTICLE{e98-a_2_735,
author={Jangyong PARK, Yunho JUNG, Jaeseok KIM, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Low Complexity Fixed Sphere Decoder with Statistical Threshold for MIMO Systems},
year={2015},
volume={E98-A},
number={2},
pages={735-739},
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.},
keywords={},
doi={10.1587/transfun.E98.A.735},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - A Low Complexity Fixed Sphere Decoder with Statistical Threshold for MIMO Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 735
EP - 739
AU - Jangyong PARK
AU - Yunho JUNG
AU - Jaeseok KIM
PY - 2015
DO - 10.1587/transfun.E98.A.735
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2015
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.
ER -