Distributed sphere decoding

Authors:
Charlotte Dumard;Erwin Riegler
Affiliations:
Ftw. Forschungszentrum Telekommunikation Wien, Vienna, Austria;Ftw. Forschungszentrum Telekommunikation Wien, Vienna, Austria
Venue:
ICT'09 Proceedings of the 16th international conference on Telecommunications
Year:
2009

Citing 6
Cited 1

Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Distributed gradient systems and dynamic coordination

Distributed gradient systems and dynamic coordination
Geographic Gossip: Efficient Averaging for Sensor Networks

IEEE Transactions on Signal Processing
On the sphere-decoding algorithm I. Expected complexity

IEEE Transactions on Signal Processing - Part I
On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications

IEEE Transactions on Signal Processing - Part I

Distributed QR factorization based on randomized algorithms

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on a simple gossip algorithm, which computes the sum of values known by several nodes, we investigate the research challenge of distributed sphere decoding. We provide distributed algorithms to perform both the QR decomposition as well as the tree search. Compared to the case where one declares one node as a centralized unit, this approach is much more robust against node and link failures. This is due to the fact that the target nodes for the gossip algorithm are chosen uniformly at random in each iteration. Numerical simulations show that even for a very small number of iterations the results coincide with the traditional centralized sphere decoder.