Very-high rate space-time coding

A space-time coding method with low decoding complexity suitable for large numbers of antennas and high data rates is presented. High dimensionality is accommodated through use of a sub-optimal receiver that efficiently locates short vectors in a high-dimensional lattice. These vectors are used to approximate the transmitted symbol a-posteriori probabilities, which are refined by an outer serially concatenated code. We show that the codes can achieve hundreds of bits per channel use at low signal-to-noise ratios.