Message Passing Algorithms for Phase Noise Tracking Using Tikhonov Mixtures
نویسندگان
چکیده
منابع مشابه
Solving Sudoku Using Combined Message Passing Algorithms
In this paper we apply message-passing algorithms to solve Sudoku puzzles. We provide explicit expression for the sum-product algorithm and the max-product algorithm and analyze the difference between the algorithms in terms of performance and efficiency. The failure of the max-product algorithm when been applied to Sudoku problem is due to the existence of stopping-sets. We show empirically th...
متن کاملA reduced-complexity scheme using message passing for location tracking
This article presents a low-complexity and high-accuracy algorithm using message-passing approach to reduce the computational load of the traditional tracking algorithm for location estimation. In the proposed tracking scheme, a state space model for the location-estimation problem can be divided into many mutual-interaction local constraints based on the inherent message-passing features of fa...
متن کاملUniversality in Polytope Phase Transitions and Message Passing Algorithms
We consider a class of nonlinear mappings FA,N in R N indexed by symmetric random matrices A ∈ R with independent entries. Within spin glass theory, special cases of these mappings correspond to iterating the TAP equations and were studied by Erwin Bolthausen. Within information theory, they are known as ‘approximate message passing’ algorithms. We study the high-dimensional (large N) behavior ...
متن کاملMessage-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of difference of convex functions (DC) programming, and use the concaveconvex procedure (CCCP) to develop efficient message-passing solvers. The resulting algorithms are guaranteed to converge to a global optimum of the we...
متن کاملMessage Passing Algorithms for Compressed Sensing
Compressed sensing aims to undersample certain high-dimensional signals yet accurately reconstruct them by exploiting signal characteristics. Accurate reconstruction is possible when the object to be recovered is sufficiently sparse in a known basis. Currently, the best known sparsity-undersampling tradeoff is achieved when reconstructing by convex optimization, which is expensive in important ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2016
ISSN: 0090-6778
DOI: 10.1109/tcomm.2015.2506553