Computation over Gaussian networks with orthogonal components

Citations

WEB OF SCIENCE

27
Citations

SCOPUS

29

초록

Function computation over Gaussian networks with orthogonal components is studied for arbitrarily correlated discrete memoryless sources. Two classes of functions are considered: 1) the arithmetic sum function and 2) the type function. The arithmetic sum function in this paper is defined as a set of multiple weighted arithmetic sums, which includes averaging of the sources and estimating each of the sources as special cases. The type or frequency histogram function counts the number of occurrences of each argument, which yields various fundamental statistics, such as mean, variance, maximum, minimum, median, and so on. The proposed computation coding first abstracts Gaussian networks into the corresponding modulo sum multiple-access channels via nested lattice codes and linear network coding and then computes the desired function using linear Slepian-Wolf source coding. For orthogonal Gaussian networks (with no broadcast and multiple-access components), the computation capacity is characterized for a class of networks. For Gaussian networks with multiple-access components (but no broadcast), an approximate computation capacity is characterized for a class of networks. © 2014 IEEE.

키워드

Distributed averaging; function computation; joint source-channel coding; lattice codes; linear source coding; network coding; sensor networks; LINEAR FUNCTIONS; INFORMATION; CHANNEL; CAPACITY; CODES
제목
Computation over Gaussian networks with orthogonal components
저자
Jeon, Sang-Woon; Wang, Chien-Yi; Gastpar, Michael
DOI
10.1109/TIT.2014.2364572
발행일
2014-12
유형
Article
저널명
IEEE Transactions on Information Theory
권
60
호
12
페이지
7841 ~ 7861