DocumentCode :
640299
Title :
Amplify-and-compute: Function computation over layered networks
Author :
Nokleby, Matthew ; Nazer, Bobak
Author_Institution :
Duke Univ., Durham, NC, USA
fYear :
2013
fDate :
7-12 July 2013
Firstpage :
2314
Lastpage :
2318
Abstract :
We study layered wireless networks in which destinations decode linear combinations of transmitted messages over a finite field. We propose amplify-and-compute, a simple but effective scheme in which sources encode their messages with lattice codes, relays employ amplify-and-forward relaying, and destinations decode incoming signals to integer combinations of lattice codewords. We focus on the two-user setting and show that, by carefully choosing relay amplification weights, it is possible to align the equivalent end-to-end channel to an arbitrary matrix of non-zero integers (up to a set of channel matrices of zero measure). Such a choice achieves a computation rate to within a gap to capacity that is independent of the SNR. Amplify-and-compute therefore achieves the maximum degrees of freedom while providing good performance at moderate SNR. Finally, we show that amplify-and-compute offers similar performance when applied to layered two-user interference networks.
Keywords :
amplify and forward communication; matrix algebra; radio networks; telecommunication channels; amplify-and-compute; amplify-and-forward relaying; arbitrary matrix; channel matrices; degrees of freedom; equivalent end-to-end channel; lattice codes; lattice codewords; layered networks; linear combinations; non-zero integers; two-user interference networks; wireless networks; Encoding; Interference channels; Lattices; Relays; Signal to noise ratio;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
ISSN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2013.6620639
Filename :
6620639
Link To Document :
بازگشت