Andrieu, C

Jia, Y

Piechocki, RJ

Sandell, M

English

The multilevel structure of the N-QAM modulation constellations is exploited to significantly reduce the complexity of the sequential Gaussian approximation (SGA) algorithm for near optimal symbol detection in spatial multiplexing multiple- input multiple-output (MIMO) system. We propose two multilevel SGA algorithms (MSGA) which are based on depth- first search (DFS) and breadth-first search (BFS) respectively. Additionally, an important methodological contribution to this multilevel technique is proposed where the mismatch between the pseudo symbols and the true symbols is taken into consideration for the computation of posterior probabilities of symbol combinations. We justify this from a theoretical perspective as well as with numerical results. Simulation results show that the performance of the two proposed multilevel algorithms can approach that of the optimal a posteriori probability (APP) detector while its total computation cost is at most 81% and 48% of that of the original SGA algorithm for 16QAM and 64QAM modulation MIMO systems with 4 transmit/receive antennas respectively.The multilevel structure of the N-QAM modulation constellations is exploited to significantly reduce the complexity of the sequential Gaussian approximation (SGA) algorithm for near optimal symbol detection in spatial multiplexing multiple- input multiple-output (MIMO) system. We propose two multilevel SGA algorithms (MSGA) which are based on depth- first search (DFS) and breadth-first search (BFS) respectively. Additionally, an important methodological contribution to this multilevel technique is proposed where the mismatch between the pseudo symbols and the true symbols is taken into consideration for the computation of posterior probabilities of symbol combinations. We justify this from a theoretical perspective as well as with numerical results. Simulation results show that the performance of the two proposed multilevel algorithms can approach that of the optimal a posteriori probability (APP) detector while its total computation cost is at most 81% and 48% of that of the original SGA algorithm for 16QAM and 64QAM modulation MIMO systems with 4 transmit/receive antennas respectivel

Explore Bristol Research

(M’92) received the M.Sc. degree in electrical engineering and the Ph.D. degree in signal processing from

A hybrid probabilistic data association-sphere decoding detector for multiple-input-multiple-output systems,”

An improved complex sphere decoder for V-BLAST systems,”

degree from the Institut National des Telecommunications,

degree in electrical engineering from the Technical University of Wroclaw, Wroclaw, Poland, in 1997, and the Ph.D. degree in electrical engineering from the University of Bristol,

Gaussian approximation based mixture reduction for near optimal detection for MIMO system,”

He spent six months as a Research Assistant with the Division of Signal Processing at the same university before joining Bell Labs, Lucent Technologies,

Impact of the Gaussian approximation on the performance of the probabilitistic data association with

Improved methods for calculating vectors of short lengths in a lattice, including a complexity analysis,”

Iterative tree search detection for MIMO wireless systems,”

Iterative tree search detection for MIMO wireless systems,” in

Iterative trellis search detection for asynchronous MIMO systems,” in

Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas,”

Multilevel mixture Kalman ﬁlter,”

Near-optimal multiuser detection in synchronous CDMA using probabilistic data association,”

On the complexity of sphere decoder in digital communication,”

Probabilistic data association for symbol detection in

Sequential coding algorithms: A survey and cost analysis,”

Stochastics approximations for reduced complexity signal processing algorithms

The Art of Computer Programming, Vol. III: Sorting and Searching.

until 2000, he was a Research Associate with the Signal Processing Group, Cambridge University, Cambridge, U.K., and a College Lecturer at Churchill College,

Yugang Jia was born in P.R. China in 1979. He received the M.S. degree from Northwestern Polytechnic University,

Πb j,L −1 ](j,j)  , (17) ε (m) j,l =  w (m)

Depth-first and breadth-first search based multilevel SGA algorithms for near optimal symbol detection in MIMO systems

https://research-information.bris.ac.uk/files/3010358/jia_Trans Wir Comms_March 2008.pdf

Depth-first and breadth-first search based multilevel SGA algorithms for near optimal symbol detection in MIMO systems

Abstract

Similar works

Full text

Available Versions

Explore Bristol Research