We consider receiver design for coded transmission over linear Gaussian channels. We
restrict ourselves to the class of lattice codes and formulate the joint detection and decoding …

We start by identifying a relatively efficient version of sphere decoding algorithm (SDA) that
performs exact maximum-likelihood (ML) decoding. We develop novel algorithms based on …

In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the
number of search operations in the sphere-constrained search. Specifically, by adding a …

Lattice reduction-aided decoding (LRAD) features reduced decoding complexity and near-
optimum performance in multiinput multioutput communications. In this paper, a quantitative …

Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The
computational complexity of SISO detection often poses significant challenges for practical …

The fixed-complexity sphere decoder (FSD) has been previously proposed for multiple-input
multiple-output (MIMO) detection in order to overcome the two main drawbacks of the sphere …

The idea of formulating the detection of a lattice‐type modulation, such as M‐PAM and M‐
QAM, transmitted over a linear channel as the so‐called universal lattice decoding problem …

Maximum-likelihood (ML) decoding algorithms for Gaussian multiple-input multiple-output
(MIMO) linear channels are considered. Linearity over the field of real numbers facilitates the …

A list extension for a fixed-complexity sphere decoder (FSD) to perform iterative detection
and decoding in turbo-multiple input-multiple output (MIMO) systems is proposed in this …

This paper identifies the first general, explicit, and nonrandom MIMO encoder-decoder
structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT) …