Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-06-20
Computer Science
Distributed, Parallel, and Cluster Computing
17 pages, 9 figures, Transaction on Signal Processing, accepted
Scientific paper
In this paper, we study the convergence behavior of distributed iterative algorithms with quantized message passing. We first introduce general iterative function evaluation algorithms for solving fixed point problems distributively. We then analyze the convergence of the distributed algorithms, e.g. Jacobi scheme and Gauss-Seidel scheme, under the quantized message passing. Based on the closed-form convergence performance derived, we propose two quantizer designs, namely the time invariant convergence-optimal quantizer (TICOQ) and the time varying convergence-optimal quantizer (TVCOQ), to minimize the effect of the quantization error on the convergence. We also study the tradeoff between the convergence error and message passing overhead for both TICOQ and TVCOQ. As an example, we apply the TICOQ and TVCOQ designs to the iterative waterfilling algorithm of MIMO interference game.
Cui Ying
Lau Vincent K. N.
No associations
LandOfFree
Convergence-Optimal Quantizer Design of Distributed Contraction-based Iterative Algorithms with Quantized Message Passing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Convergence-Optimal Quantizer Design of Distributed Contraction-based Iterative Algorithms with Quantized Message Passing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence-Optimal Quantizer Design of Distributed Contraction-based Iterative Algorithms with Quantized Message Passing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-185988