The Error Probability of the Fixed-Complexity Sphere Decoder

Jaldén, Joakim; Barbero, L.G.; Ottersten, Björn; Thompson, John

doi:10.1109/tsp.2009.2017574

Cited by 74 publications

(60 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With some fixed performance degradation (14) [16], the SD has an exponential complexity (in both the worst and the average cases) of C SD = O(m γ n T ) with γ ∈ (0, 1] [16]. The fixed-complexity sphere decoder (FSD) is proved to maintain full diversity with a complexity of C FSD = O(m √ n T ) that is 'subexponential' [17]. On the other hand, the linear receivers, e.g., zero-forcing (ZF) and minimum mean square error schemes, have low complexity but quite poor diversity order n R − n T + 1 [1].…”

Section: Research On Mimo Detectionmentioning

confidence: 99%

Scale effect analysis of early-termination fixed-complexity sphere detector

Qian

Peng

et al. 2013

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

In this paper, we show that the early-termination fixed-complexity sphere detector (ET-FSD) has a scale effect when being employed in multi-antenna systems that have to detect signals of multiple users under the constraint of sum complexity. The so-called scale effect stands for a kind of effect in which the complexity per user can be reduced as the number of users increases without loss of diversity order. The main contributions of this study are as follows: (1) we establish a mathematical model based on the large deviation principle to apply the concept of scale effect to ET-FSD; (2) we prove the existence of the scale effect of ET-FSD in a multi-user scenario; and (3) we demonstrate that within multi-user systems, the scale effect can be exploited to realize ET-FSD that has the optimal performance in the point view of diversity order under polynomial complexity constraint per user.

show abstract

Section: Research On Mimo Detectionmentioning

confidence: 99%

Scale effect analysis of early-termination fixed-complexity sphere detector

Qian

Peng

et al. 2013

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

show abstract

“…At the FE stage, for each survivor path, all the possible values of the constellation are assigned to the symbol at the current level. The SE stage starts from each retained path and proceeds down in the tree calculating the solution of the remaining successive-interferencecancellation (SIC) problem [16] as:…”

Section: A U T H O R C O P Ymentioning

confidence: 99%

“…The symbols are detected following a specific ordering also proposed by the authors in [7]. As it was shown in [16], the maximum detection diversity can be achieved with the FSD if the following value of T is chosen: Figure 2 shows the search tree of the FSD algorithm for the case with n T = 4 (T = 1) and QPSK symbols. It can be seen that in the first level all branches are taken into account, meanwhile in the following levels only one branch per level is explored.…”

Section: A U T H O R C O P Ymentioning

confidence: 99%

High-Speed RS(255, 239) Decoder Based on LCC Decoding

García-Herrero

Valls

Meher

2011

Circuits Syst Signal Process

View full text Add to dashboard Cite

Abstract. The use of many-core processors such as general purpose Graphic Processing Units (GPUs) has recently become attractive for the efficient implementation of signal processing algorithms for communication systems. This is due to the costeffectiveness of GPUs together with their potential capability of parallel processing. This paper presents an implementation of the widely employed fixed-complexity sphere decoder on GPUs, which allows to considerably decrease the computational time required for the data detection stage in multiple-input multiple-output systems. Both, the hard-and soft-output versions of the method have been implemented. Speedup results show the proposed GPU implementation boosts the runtime of the parallel execution of the methods in a high performance multi-core CPU. In addition, the throughput of the algorithm is evaluated and is shown to outperform other recent implementations and to fulfill the real-time requirements of several LTE configurations.

show abstract

“…The basic principle of FCLSD algorithm is: not search candidate points in a ball of certain radius, but choose the candidate points which are nearest to the center of the sphere according to set C . For a model o M sume the set of candidate points searched by the receiver is: In the how to de (10) Therefore, the number of the candidate poi la (11) It's found in [7] that, in order pe former section, it has not mentioned termine the number set C in the FCLSD algorithm.…”

Section: Complexity Soft-output Complex List Spher Decoding（fclsd）mentioning

confidence: 99%

Improved FCLSD algorithm based on LTE/LTE-A system

Liu

Liu²,

He³

2011

IJCNIS

View full text Add to dashboard Cite

Abstract-In order to meet the high data rate, large capacity and low latency in LTE, advanced MIMO technology has been introduced in LTE system, which becomes one of the core technologies in physical layer. In a variety of MIMO detection algorithms, the ZF and MMSE linear detection algorithms are the most simple, but the performance is poor. MLD algorithm can achieve optimal detection performance, but it's too complexity to be applied in practice. CLSD algorithm has similar detection performance and lower complexity with the MLD algorithm, but the uncertainty of complexity will bring hardware difficulties. FCLSD algorithm can maximize the advantages of CLSD algorithm and solve difficult problems in practice. Based on advanced FCLSD algorithm and combined with LTE / LTE-A practical system applications, this article designed two improved algorithms. The two improved algorithms can be flexibly and adaptively used in various antenna configurations and modulation scene in LTE / LTE-A spatial multiplexing MIMO system. The Simulation results show that the improved algorithm can achieve an approximate performance to the original FCLSD algorithm; in addition, it has a fixed complexity and could be carried out by parallel processing.

show abstract

The Error Probability of the Fixed-Complexity Sphere Decoder

Cited by 74 publications

References 30 publications

Scale effect analysis of early-termination fixed-complexity sphere detector

Scale effect analysis of early-termination fixed-complexity sphere detector

High-Speed RS(255, 239) Decoder Based on LCC Decoding

Improved FCLSD algorithm based on LTE/LTE-A system

Contact Info

Product

Resources

About