A study of digital techniques for signal processing Semiannual status report, 1 Feb. - 31 Jul. 1970

Adaptive array processing, dynamic programming, digital data transmission, recursive adaptive equalizers, and finite memory communication system

Gaussian Belief Propagation Based Multiuser Detection

In this work, we present a novel construction for solving the linear multiuser detection problem using the Gaussian Belief Propagation algorithm. Our algorithm yields an efficient, iterative and distributed implementation of the MMSE detector. We compare our algorithm's performance to a recent result and show an improved memory consumption, reduced computation steps and a reduction in the number of sent messages. We prove that recent work by Montanari et al. is an instance of our general algorithm, providing new convergence results for both algorithms.Comment: 6 pages, 1 figures, appeared in the 2008 IEEE International Symposium on Information Theory, Toronto, July 200

MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation

This paper proposes a new detection algorithm for MIMO communication systems employing high order QAM constellations. The factor graph that corresponds to this problem is very loopy; in fact, it is a complete graph. Hence, a straightforward application of the Belief Propagation (BP) algorithm yields very poor results. Our algorithm is based on an optimal tree approximation of the Gaussian density of the unconstrained linear system. The finite-set constraint is then applied to obtain a loop-free discrete distribution. It is shown that even though the approximation is not directly applied to the exact discrete distribution, applying the BP algorithm to the loop-free factor graph outperforms current methods in terms of both performance and complexity. The improved performance of the proposed algorithm is demonstrated on the problem of MIMO detection

Adaptive multicoding and robust linear-quadratic receivers for uncertain CDMA frequency-selective fading channels

Wideband Code Division Multiple Access (WCDMA) communications in the presence of channel uncertainty poses a challenging problem with many practical applications in the wireless communications filed. In this dissertation, robust linear-quadratic (LQ) receivers for time-varying, frequency-selective CDMA channels in the presence of uncertainty regarding instantaneous channel state information are proposed and studied. In order to enhance the performance of the LQ receivers, a novel modulation technique adaptive multicoding is employed. We proposed a simple, intuitively appealing cost function the modified deflection ratio that can be maximized to find signal constellations and associated LQ receivers that are optimal in a certain sense. We discuss the properties of the proposed LQ cost function and derive a related adaptive algorithm for the simultaneous design of signals and receivers based on a simple multicoding technique. The Chernoff bound for the LQ receivers is also derived to compensate for the analytical intractability of the probability of bit error. Finally, in order to achieve higher data rate transmission in favorable channels, we extend our approach from binary signals to M-ary signal constellations in a multi-dimension subspace