Function computation via subspace coding

Christina Fragouli, Nikhil Karamchandani
2010
Rapport ou document de travail

Résumé

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.

Official source

https://infoscience.epfl.ch/record/143339?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Concepts associés

Chargement

Publications associées

Chargement

Function computation via subspace coding

Christina Fragouli, Nikhil Karamchandani, Lorenzo Keller

2010

Chargement

Function computation via subspace coding

Christina Fragouli, Nikhil Karamchandani, Lorenzo Keller

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for comput- ing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.

2013

Chargement

Computation over Gaussian networks with orthogonal components

Michael Christoph Gastpar, Chien-Yi Wang

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

2013

Chargement