Andrieu, C

Coon, J

Piechocki, RJ

Vithanage, CM

English

Crossref

Tree-Based Reparameterization for Symbol Detection in Spatially Multiplexed MIMO Systems in Frequency Flat Fading

Reduced complexity detection of spatially multiplexed data transmissions under frequency flat fading is considered. Noting that the optimal detection is the generation of marginal distributions of a joint probability distribution, we use the approximate marginal generating algorithm termed the treebased reparameterization. The resulting system complexity is having an order which is less than quadratic in the number of transmit antennas. Simulation of a 8 × 8 BPSK system shows a coded bit error rate of 10−3 at an SNR level of only 1dB greater than required by the optimal method

Explore Bristol Research

A fast recursive algorithm for optimum sequential signal detection in a BLAST system,”

A revolution: Belief propagation in graphs with cycles,”

A universal lattice code decoder for fading channels,”

Capacity of the multi antenna Gaussian channel,”

Factor graphs and the sum–product algorithm,”

Gaussian approximation based mixture reduction for near optimum detection in

On performance of sphere decoding and Markov chain monte carlo detection methods,”

Tree-based reparameterization framework for analysis of sum-product and related algorithms,”

V-BLAST: an architecture for realizing very high data rates over the rich scattering wireless channel,” in

Tree-based reparameterisation for symbol detection in spatially multiplexed MIMO systems in frequency flat fading

https://research-information.bris.ac.uk/files/3003979/vithanage_IEEE_SPAWC_2006.pdf

Tree-based reparameterisation for symbol detection in spatially multiplexed MIMO systems in frequency flat fading

Abstract

Similar works

Full text

Available Versions

Crossref

Explore Bristol Research