University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Complexity-Efficient Enumeration Techniques for Soft-Input, Soft-Output Sphere Decoding

Nikitopoulos, K, Zhang, D, Lai, I-W and Ascheid, G (2009) Complexity-Efficient Enumeration Techniques for Soft-Input, Soft-Output Sphere Decoding Nikitopoulos, K., Dan Zhang, I-wei Lai;, Ascheid, G. "Complexity-efficient enumeration techniques for soft-input, soft-output sphere decoding," IEEE Communications Letters, vol.14, no.4, pp.312-314, Apr. 2010.

Full text not available from this repository.

Abstract

In this paper two complexity efficient soft sphere-decoder modifications are proposed for computing the max-log LLR values in iterative MIMO systems, which avoid the costly, typically needed, full enumeration and sorting (FES) procedure during the tree traversal without compromising the max-log performance. It is shown that despite the resulting increase in the number of expanded nodes, they can be more computationally efficient than the typical soft sphere decoders by avoiding the unnecessary complexity of FES.

Item Type: Article
Authors :
NameEmailORCID
Nikitopoulos, Kk.nikitopoulos@surrey.ac.ukUNSPECIFIED
Zhang, DUNSPECIFIEDUNSPECIFIED
Lai, I-WUNSPECIFIEDUNSPECIFIED
Ascheid, GUNSPECIFIEDUNSPECIFIED
Date : 17 June 2009
Identification Number : 10.1109/LCOMM.2010.04.092230
Uncontrolled Keywords : cs.NI, cs.NI
Related URLs :
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 13:06
Last Modified : 17 May 2017 15:08
URI: http://epubs.surrey.ac.uk/id/eprint/837968

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800