University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Approximate MIMO Iterative Processing with Adjustable Complexity Requirements

Nikitopoulos, K and Ascheid, G (2011) Approximate MIMO Iterative Processing with Adjustable Complexity Requirements IEEE Transactions on Vehicular Technology, vol. 61, no. 2, pp. 639-650, Feb. 2012.

Full text not available from this repository.

Abstract

Targeting always the best achievable bit error rate (BER) performance in iterative receivers operating over multiple-input multiple-output (MIMO) channels may result in significant waste of resources, especially when the achievable BER is orders of magnitude better than the target performance (e.g., under good channel conditions and at high signal-to-noise ratio (SNR)). In contrast to the typical iterative schemes, a practical iterative decoding framework that approximates the soft-information exchange is proposed which allows reduced complexity sphere and channel decoding, adjustable to the transmission conditions and the required bit error rate. With the proposed approximate soft information exchange the performance of the exact soft information can still be reached with significant complexity gains.

Item Type: Article
Authors :
NameEmailORCID
Nikitopoulos, Kk.nikitopoulos@surrey.ac.ukUNSPECIFIED
Ascheid, GUNSPECIFIEDUNSPECIFIED
Date : 13 April 2011
Identification Number : 10.1109/TVT.2011.2179324
Uncontrolled Keywords : cs.IT, cs.IT, math.IT
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/837965

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