A Gaussian tree approximation for integer least-squares

Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference

Volumn , Issue , 2009, Pages 638-645

  Goldberger, Jacob ^a   Leshem, Amir ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FORESTRY; LEAST SQUARES APPROXIMATIONS; MIMO SYSTEMS; TREES (MATHEMATICS);

BELIEF PROPAGATION ALGORITHM; COMPLETE GRAPHS; FACTOR GRAPHS; FINITE SET; GAUSSIAN DENSITY; GAUSSIANS; INTEGER LEAST SQUARES; LINEAR LEAST-SQUARE PROBLEMS; PERFORMANCE; TREE APPROXIMATION;

LINEAR SYSTEMS;

EID: 84858734518     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger. Closest point search in lattices. IEEE Transactions on Information Theory, 48(8):2201-2214, 2002.
2. C. K. Chow and C. N. Liu. Approximating discrete probability distributions with dependence trees. IEEE Trans. on Info. Theory, pages 462-467, 1968.
3. B. Dong, X. Wang, and A. Doucet. A new class of soft MIMO demodulation algorithms. IEEE Trans. Signal Processing, pages 2752-63, 2003.
4. P. F. Felzenszwalb and D. P. Huttenlocher. Efficient belief propagation for early vision. International Journal of Computer Vision, pages 41-54, 2006.
5. G.J. Foschini. Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas. Bell Labs Technical Journal, 1(2):41-59, 1996.
6. R. G. Gallager. Low density parity check codes. IRE Trans. Inform. Theory, pages 21-28, 1962.
7. B. M. Hochwald and S. ten Brink. Achieving near-capacity on a multiple antenna channel. IEEE Trans. Commun., pages 389-399, 2003.
8. J. Hu and T. M. Duman. Graph-based detector for BLAST architecture. IEEE Communications Society ICC, 2007.
9. J. Jalden and B. Ottersten. An exponential lower bound on the expected complexity of sphere decoding. IEEE Intl. Conf. Acoustic, Speech, Signal Processing, 2004.
10. M. Kaynak, T. Duman, and E. Kurtas. Belief propagation over SISO/MIMO frequency selective fading channels. IEEE Transactions on Wireless Communications, pages 2001-5, 2007.
11. J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. J. ACM, 32(1):229-246, 1985.
12. T. Minka and Y. Qi. Tree-structured approximations by expectation propagation. Advances in Neural Information Processing Systems, 2004.
13. M. Opper and O. Winther. Expectation consistent approximate inference. Journal of Machine Learning Research, pages 2177-2204, 2005.
14. O. Shental, N. Shental, S. Shamai (Shitz), I. Kanter, A.J. Weiss, and Y. Weiss. Discrete-input two-dimensional gaussian channels with memory: Estimation and information rates via graphical models and statistical mechanics. Information Theory, IEEE Transactions on, pages 1500-1513, 2008.
15. P.J.G. Teunissen. Success probability of integer GPS ambiguity rounding and bootstrapping. Journal of Geodesy, 72:606-612, 1998.
16. Y. Weiss and W.T. Freeman. Correctness of belief propagation in Gaussian graphical models of arbitrary topology. Neural Computation, pages 2173-2200, 2001.
17. A. Wiesel, Y. C. Eldar, and S. Shamai. Semidefinite relaxation for detection of 16-QAM signaling in MIMO channels. IEEE Signal Processing Letters, 2005.
18. J. S. Yedidia, W. T. Freeman, and Y. Weiss. Understanding belief propagation and its generalizations. IJCAI, 2001.