View in EDS

Performance Analysis of Layer Pruning on Sphere Decoding in MIMO Systems.

Saved in:
Bibliographic Details
Title: Performance Analysis of Layer Pruning on Sphere Decoding in MIMO Systems.
Authors: Karthikeyan, Madurakavi1 karthikeyan2709@pec.edu, Saraswady, D.1 dsaraswady@pec.edu
Source: ETRI Journal. Aug2014, Vol. 36 Issue 4, p564-571. 8p.
Subject Terms: MIMO systems, Decoding algorithms, Performance evaluation, Maximum likelihood statistics, Tree pruning
Abstract: Sphere decoding (SD) for multiple-input and multipleoutput systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method -- namely, probabilistic tree pruning SD. [ABSTRACT FROM AUTHOR]
Database: Supplemental Index
Description
Abstract:Sphere decoding (SD) for multiple-input and multipleoutput systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method -- namely, probabilistic tree pruning SD. [ABSTRACT FROM AUTHOR]
ISSN:12256463
DOI:10.4218/etrij.14.0113.1182