Linear Coding Schemes for the Distributed Computation of Subspaces

Abstract

Let $X_1, ..., X_m$ be a set of $m$ statistically dependent sources over the common alphabet $\mathbb{F}_q$, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation setting in which the receiver is interested in the lossless computation of the elements of an $s$-dimensional subspace $W$ spanned by the elements of the row vector $[X_1, \ldots, X_m]\Gamma$ in which the $(m \times s)$ matrix $\Gamma$ has rank $s$. A sequence of three increasingly refined approaches is presented, all based on linear encoders. The first approach uses a common matrix to encode all the sources and a Korner-Marton like receiver to directly compute $W$. The second improves upon the first by showing that it is often more efficient to compute a carefully chosen superspace $U$ of $W$. The superspace is identified by showing that the joint distribution of the $\{X_i\}$ induces a unique decomposition of the set of all linear combinations of the $\{X_i\}$, into a chain of subspaces identified by a normalized measure of entropy. This subspace chain also suggests a third approach, one that employs nested codes. For any joint distribution of the $\{X_i\}$ and any $W$, the sum-rate of the nested code approach is no larger than that under the Slepian-Wolf (SW) approach. Under the SW approach, $W$ is computed by first recovering each of the $\{X_i\}$. For a large class of joint distributions and subspaces $W$, the nested code approach is shown to improve upon SW. Additionally, a class of source distributions and subspaces are identified, for which the nested-code approach is sum-rate optimal.Comment: To appear in IEEE Journal of Selected Areas in Communications (In-Network Computation: Exploring the Fundamental Limits), April 201

A Joint Typicality Approach to Compute–Forward

“…Here, we derive an achievable rate region for the discrete memoryless setting using simultaneous joint typicality decoding. In the context of lossless distributed source coding, [21] studied the problem of compressing multiple linear combinations of dependent sources.…”

CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT

“…It is shown in [63] that if each sink requests a sum of the source symbols, the linear coding may not be sufficient in networks where non-linear coding can be sufficient. Other related works include [59], [61], [62], [64], [66].…”

Multi-Server Multi-Function Distributed Computation

“…Similarly, when function computation is introduced, data structure can be a key component. In the context of computing, we have seen the seminal work by Körner and Marton [ 62 ], which focused on efficient compression of the modulo 2 sum of two statistically dependent sources, while Lalitha et al [ 63 ] explored linear combinations of multiple statistically dependent sources. Furthermore, for general bivariate functions of correlated sources, when one of the sources is available as side information, the work of Yamamoto [ 64 ] generalized the pioneering work of Wyner and Ziv [ 65 ] to provide a rate-distortion characterization for the function computation setting.…”