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 language | English |
|---|---|
| Pages (from-to) | 735-739 |
| Number of pages | 5 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | e98 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2015 Jan 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Applied Mathematics
- Electrical and Electronic Engineering
Cite this
}
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 journal › Article
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 -