Distributed sphere decoding

Author

Dumard, Charlotte ; Riegler, Erwin

Author_Institution

Ftw. Forschungszentrum Telekommun. Wien, Vienna, Austria

fYear

2009

fDate

25-27 May 2009

Firstpage

172

Lastpage

177

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.

Keywords

decoding; decomposition; distributed algorithms; numerical analysis; tree codes; decomposition; distributed algorithms; distributed sphere decoding; numerical simulations; simple gossip algorithm; tree search; Batteries; Convergence; Detection algorithms; Distributed algorithms; Distributed computing; Iterative decoding; Message passing; Numerical simulation; Robustness; Transmitters;

fLanguage

English

Publisher

ieee

Conference_Titel

Telecommunications, 2009. ICT '09. International Conference on

Conference_Location

Marrakech

Print_ISBN

978-1-4244-2936-3

Electronic_ISBN

978-1-4244-2937-0

Type

conf

DOI

10.1109/ICTEL.2009.5158639

Filename

5158639