Approximate MIMO iterative processing with adjustable complexity requirements

15Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Targeting only the best achievable bit error rate (BER) performance in iterative receivers operating over multipleinput-multiple-output (MIMO) channels may result in a significant waste of resources, particularly when the achievable BER is considerably 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, allowing reduced complexity sphere and channel decoding that is adjustable to the transmission conditions and the required BER. With the proposed approximate soft information exchange, the performance of the exact soft information can still be reached with significant complexity reduction. © 2011 IEEE.

Cite

CITATION STYLE

APA

Nikitopoulos, K., & Ascheid, G. (2012). Approximate MIMO iterative processing with adjustable complexity requirements. IEEE Transactions on Vehicular Technology, 61(2), 639–650. https://doi.org/10.1109/TVT.2011.2179324

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free