Achievable rates of coded linear systems with iterative MMSE detection

Authors:
Xiaojun Yuan;Li Ping
Affiliations:
Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China;Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 11
Cited 0

Elements of information theory

Elements of information theory
Fundamentals of statistical signal processing: estimation theory

Fundamentals of statistical signal processing: estimation theory
Joint Tx-Rx beamforming design for multicarrier MIMO channels: a unified framework for convex optimization

IEEE Transactions on Signal Processing
Probability of error in MMSE multiuser detection

IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Analyzing the turbo decoder using the Gaussian approximation

IEEE Transactions on Information Theory
Extrinsic information transfer functions: model and erasure channel properties

IEEE Transactions on Information Theory
Mutual information and minimum mean-square error in Gaussian channels

IEEE Transactions on Information Theory
An MSE-Based Transfer Chart for Analyzing Iterative Decoding Schemes Using a Gaussian Approximation

IEEE Transactions on Information Theory
Evolution analysis of low-cost iterative equalization in coded linear systems with cyclic prefixes

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the area property to more general linear channel models (including inter-symbol-interference (ISI) and multiple-input multiple-output (MIMO) systems) with arbitrary input constellations. We show that the theoretical limit of a channel (i.e., the mutual information) can be achieved under some assumptions. Several engineering techniques are examined to ensure these assumptions. It is shown that the required assumptions can be approximately materialized using superposition coded modulation (SCM) and a precoding technique.