Search

Content caching has emerged as an effective approach to combat the increasing strains on our current network infrastructure. This method is further improved when combining caching with source coding. However, additional complexity is incurred by creating this hybrid method, as the source coding component comes with associated feasibility constraints and decoding costs. This paper presents an approach to balance this complexity with the coding gains by selecting the best-performing subset of files to compress, while the others are left uncoded. This problem is shown to be NP-hard in general and difficult to solve in an iteration-free manner. To this end, two novel approaches are outlined: an iterative-based solution, which uses the features of the entropy function to derive the most suitable files to compress jointly, and a meta-heuristic version, which is based on the Genetic Algorithm. When compared to an exhaustive search, the proposed solutions are found to be sub-optimal but falling above the 90th percentile of all possible solutions on average. Significantly, the iterative method produces results within one percentile of the meta-heuristic approach yet it finds a solution 2.31 times faster. The iterative approach has an additional benefit, in that it is able to predict the relative gains when adding more files to a compression group. It is thus able to terminate prematurely if the estimated gains are less than a chosen threshold.

Considering the shortcomings of the existing Distributed Source Coding schemes on the bit error rate and the compression ratio, a side information-based distributed source coding scheme with Low-Density Parity-Check code is proposed. In the design of source encoder, redundancy is used to provide error protection, which is similar to insert redundancy to error protection in convolution coding; Set redundancy and Side Information approach is applied in the paper. Because of the correlation along the source, Low-Density Parity-Check code based Slepian-Wolf bound is adopted to implement the distributed source coding strategy. Experimental results are shown that the proposed method in paper can reach high compression ratio when the correlation among neighboring symbols is strong. The bit error rate of the sequence can be kept low between the sources are weak. It is an efficient distributed source coding scheme and is easy to be implemented. [ABSTRACT FROM AUTHOR]

Modern media data such as 360° videos and light field (LF) images are typically captured in much higher dimensions than the observers’ visual displays. To efficiently browse high-dimensional media, a navigational streaming model is considered: a client navigates the media space by dictating a navigation path to a server, who in response transmits the corresponding pre-encoded media data units (MDU) to the client one-by-one in sequence. Assuming that the MDU quality is pre-chosen and fixed, the problem resides in selecting and storing redundant representations of MDUs at the server in order to best trade off storage and transmission costs, while enabling adequate user’s random access. We address this problem with a landmark-based MDU optimization framework. The media space is divided into neighborhoods, each containing one landmark (a chosen MDU). MDUs in a neighborhood use the associated landmark as a predictor for inter-coding. Thus, for any MDU transition within the same neighborhood, only one inter-coded MDU transmission is required when the landmark resides in the decoder buffer. It results in lower transmission cost and enables navigational random access. To optimize an MDU structure, we employ tree-structured vector quantizer (TSVQ) to first optimize landmark locations, then iteratively add P-MDUs as refinements using a fast branch-and-bound technique. Taking interactive LF images and viewport adaptive 360° images as illustrative applications, and I-, P- and previously proposed merge frames to intra- and inter-code MDUs, we show experimentally that landmarked MDU structures can noticeably reduce the expected transmission cost compared with MDU structures without landmarks. [ABSTRACT FROM AUTHOR]

Cloud radio-access networks (C-RAN) have been proposed as an enabling technology for keeping up with the requirements of next-generation wireless networks. Most existing works on C-RAN study the uplink or the downlink separately. However, designing the uplink and the downlink jointly may bring additional advantages, especially if message source-destination information is taken into account. In this paper, this idea is demonstrated by considering pairwise message exchange between users in a C-RAN. A multi-pair two-way transmission scheme is proposed which targets maximizing the end-to-end sum rate. In the proposed scheme, a lattice-based computation strategy is used, where the baseband processing unit (BBU) pool decodes integer linear combinations of paired users’ codewords instead of decoding linear combinations of individual codewords. The BBU pool then precodes the computed signals, compresses, and forwards them to the remote radio heads (RRHs), which in turn decompress the signals and send them to the users. Finally, each user decodes its desired message using its own message as side information. The achievable rate of this scheme is derived, optimized, and evaluated numerically. Simulation results reveal that significant end-to-end rate improvement can be achieved using the proposed scheme compared to existing schemes. [ABSTRACT FROM AUTHOR]

This paper addresses the optimization of distributed compression in a sensor network with partial cooperation among sensors. The widely known Chief Executive Officer (CEO) problem, where each sensor has to compress its measurements locally in order to forward them over capacity limited links to a common receiver is extended by allowing sensors to mutually communicate. This extension comes along with modified statistical dependencies among involved random variables compared to the original CEO problem, such that well-known outer and inner bounds do not hold anymore. Three different inter-sensor communication protocols are investigated. The successive broadcast approach allows each sensor to exploit instantaneous side-information of all previously transmitting sensors. As this leads to dimensionality problems for larger networks, a sequential point-to-point communication scheme is considered forwarding instantaneous side-information to only one successor. Thirdly, a two-phase transmission protocol separates the information exchange between sensors and the communication with the common receiver. Inspired by algorithmic solutions for the original CEO problem, the sensors are optimized in a greedy manner. It turns out that partial communication among sensors improves the performance significantly. In particular, the two-phase transmission can reach the performance of a fully cooperative CEO scenario, where each sensor has access to all measurements and the knowledge about all channel conditions. Moreover, exchanging instantaneous side-information increases the robustness against bad Wyner–Ziv coding strategies, which can lead to significant performance losses in the original CEO problem. [ABSTRACT FROM AUTHOR]

Light fields enable increasing the degree of realism and immersion of visual experience by capturing a scene with a higher number of dimensions than conventional 2D imaging. On another side, higher dimensionality entails significant storage and transmission overhead compared to traditional video. Conventional coding schemes achieve high coding gains by employing an asymmetric codec design, where the encoder is significantly more complex than the decoder. However, in the case of light fields, the communication and processing among different cameras could be expensive, and the possibility of trading the complexity between the encoder and the decoder becomes a desirable feature. We leverage the distributed source coding paradigm to effectively reduce the encoder’s complexity at the cost of increased computation at the decoder side. Specifically, we train two deep neural networks to improve the two most critical parts of a distributed source coding scheme: the prediction of side information and the estimation of the uncertainty in the prediction. Experiments show considerable BD-rate gains, above 59% over HEVC-Intra and 17.45% over our previous method DLFC-I.

This paper addresses the optimization of distributed compression in a sensor network. A direct communication among the sensors is not possible so that noisy measurements of a single relevant signal have to be locally compressed in order to meet the rate constraints of the communication links to a common receiver. This scenario is widely known as the Chief Executive Officer (CEO) problem and represents a long-standing problem in information theory. In recent years significant progress has been achieved and the rate region has been completely characterized for specific distributions of involved processes and distortion measures. While algorithmic solutions of the CEO problem are principally known, their practical implementation quickly becomes challenging due to complexity reasons. In this contribution, an efficient greedy algorithm to determine feasible solutions of the CEO problem is derived using the information bottleneck (IB) approach. Following the Wyner-Ziv coding principle, the quantizers are successively designed using already optimized quantizer mappings as side-information. However, processing this side-information in the optimization algorithm becomes a major bottleneck because the memory complexity grows exponentially with number of sensors. Therefore, a sequential compression scheme leading to a compact representation of the side-information and ensuring moderate memory requirements even for larger networks is introduced. This internal compression is optimized again by means of the IB method. Numerical results demonstrate that the overall loss in terms of relevant mutual information can be made sufficiently small even with a significant compression of the side-information. The performance is compared to separately optimized quantizers and a centralized quantization. Moreover, the influence of the optimization order for asymmetric scenarios is discussed.

An $n$ -dimensional source with memory is observed by $K$ isolated encoders via parallel channels, who compress their observations to transmit to the decoder via noiseless rate-constrained links while leveraging their memory of the past. At each time instant, the decoder receives $K$ new codewords from the observers, combines them with the past received codewords, and produces a minimum-distortion estimate of the latest block of $n$ source symbols. This scenario extends the classical one-shot CEO problem to multiple rounds of communication with communicators maintaining the memory of the past. We extend the Berger-Tung inner and outer bounds to the scenario with inter-block memory, showing that the minimum asymptotically (as $n \to \infty $) achievable sum rate required to achieve a target distortion is bounded by minimal directed mutual information problems. For the Gauss-Markov source observed via $K$ parallel AWGN channels, we show that the inner bound is tight and solve the corresponding minimal directed mutual information problem, thereby establishing the minimum asymptotically achievable sum rate. Finally, we explicitly bound the rate loss due to a lack of communication among the observers; that bound is attained with equality in the case of identical observation channels. The general coding theorem is proved via a new nonasymptotic bound that uses stochastic likelihood coders and whose asymptotic analysis yields an extension of the Berger-Tung inner bound to the causal setting. The analysis of the Gaussian case is facilitated by reversing the channels of the observers. [ABSTRACT FROM AUTHOR]

Distributed Arithmetic Coding (DAC) is a practical realization of Slepian-Wolf coding that partitions source space into cosets. Coset Cardinality Spectrum (CCS) is an important property of DAC that was defined in our previous work. In this paper, we give two applications of CCS. First, we find that DAC bitstream is not compact. The rate loss of DAC bitstream is caused by two factors: unequal coset partitioning and bit indivisibility. It is proved that as code length goes to infinity, the expected value of bit-indivisibility rate loss will tend to 0.5 for any irrational Rate Change Step (RCS), where the RCS refers to the rate change when one source bit is flipped. With the help of CCS, the bit-indivisibility rate loss can be compensated to some extend. Especially, for any irrational RCS, as code length goes to infinity, the expected value of the remaining bit-indivisibility rate loss after compensation will tend to about 0.47. The second application of CCS is DAC decoder design. We derive the formula of path metric and find that in the original paper on DAC, the intuitive formula of path metric is not correct. The backward-replacing algorithm is proposed to make full use of memory. Experimental results confirm the correctness of theoretical analyses. [ABSTRACT FROM AUTHOR]

In a wireless sensor network (WSN), the data transmission technique based on the cooperative multiple‐input multiple‐output (CMIMO) scheme reduces the energy consumption of sensor nodes quite effectively by utilizing the space‐time block coding scheme. However, in networks with high node density, the scheme is ineffective due to the high degree of correlated data. Therefore, to enhance the energy efficiency in high node density WSNs, we implemented the distributed source coding (DSC) with the virtual multiple‐input multiple‐output (MIMO) data transmission technique in the WSNs. The DSC‐MIMO first compresses redundant source data using the DSC and then sends it to a virtual MIMO link. The results reveal that, in the DSC‐MIMO scheme, energy consumption is lower than that in the CMIMO technique; it is also lower in the DSC single‐input single‐output (SISO) scheme, compared to that in the SISO technique at various code rates, compression rates, and training overhead factors. The results also indicate that the energy consumption per bit is directly proportional to the velocity and training overhead factor in all the energy saving schemes.

Distributed Source Coding (DSC) schemes rely on separate encoding but joint decoding of statistically dependent sources, which exhibit correlation. More specifically, Distributed Joint Source-Channel coding (DJSC) is associated with the scenario, where the correlated source signals are transmitted through a noisy channel. On one hand, employing DSC or DJSC schemes exploits the existing correlation between sensors resulting in minimising the transmission energy required by the sources, while maintaining reliable communication. On the other hand, Network Coding (NC) is an efficient data transport technique leveraging network efficiency, by allowing Relay Nodes (RNs) in a communication network to combine multiple data packets received via the incoming links before transmitting them to the Destination Node (DN). In this paper, the bandwidth-efficient Distributed Joint Turbo Trellis-Coded Modulation (DJTTCM) aided by both Dynamic Network Coding (DNC) and Adaptive DNC (ADNC)-based cooperative transmission schemes are proposed. Both systems are proposed for supporting correlated source transmissions over hostile channels experiencing both small-scale and large-scale fading in which the RNs dynamically transmit its non-binary linear combinations to the DN. A substantial gain of 19.5 dB was attained at a correlation coefficient of ρ = 0.8 over its counterpart dispensing with NC.

In this work, lossy distributed compression of a pair of correlated sources is considered. Conventionally, Shannon’s random coding arguments — using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically large — are used to derive achievability results. However, in some multi-terminal communications scenarios, using random codes with constant finite blocklength in certain coding architectures leads to improved achievable regions compared to the conventional approach. In other words, in some network communication scenarios, there is a finite optimal value in the blocklength of the randomly generated code used for distributed processing of information sources. Motivated by this, a coding scheme is proposed which consists of two codebook layers: i) the primary codebook which has constant finite blocklength, and ii) the secondary codebook whose blocklength is taken to be asymptotically large. The achievable performance is analyzed in two steps. In the first step, a characterization of an inner bound to the achievable region is derived in terms information measures which are functions of multi-letter probability distributions. In the next step, a computable single-letter inner-bound to the achievable region is extracted. It is shown through an example that the resulting rate-distortion region is strictly larger than the Berger-Tung achievable region. [ABSTRACT FROM AUTHOR]

• Application of a deep learning to the compression of local visual descriptors. • Combination of distributed source coding and autoencoders. • Definition of a low-complexity encoder suitable for mobile low-cost boards. • Competitive compression and reconstruction performances w.r.t existing solutions. • Optimization of the coding scheme for 3D scene reconstruction applications. [Display omitted] This paper presents a local descriptor coding scheme for multicamera surveillance and 3D reconstruction embedding an autoencoder into a traditional distributed source coding strategy. The proposed solution permits shifting most of the computational complexity at the decoder/receiver and exploiting the correlation among descriptors of different cameras (thus reducing the coded bit rate) without increasing the inter-device communication load. Experimental results show that the proposed scheme permits obtaining a satisfying accuracy with respect to the most recent solutions while generating a limited bit rate. [ABSTRACT FROM AUTHOR]

Multimedia is the process of handling multiple medium of messages over network with high rate data services in wireless cellular area networks. Communication is the process of exchanging information form one service to another. In wireless networks are significantly growth of affecting network performance and energy consumption. The major problem is end to end delay in each node and meets the quality of services. The followings are considered for implementing wireless sensor network such as reduces the network delay, propagation delay and energy consumption. The senor node can sense the encoding value and reduce the network traffic delay using mitigation method. This paper propose a unique approach to provide simple routing services with reduced traffic delay, end to end delay network performance and to achieve better performance using Distributed Source Coding and Effective Energy Consumption methods. In this paper we use optimal early detection algorithm for improving network performance and energy consumption problem. An iterative Shannon fano and Tuker method is used for finding optimal solution of each node values. Network Simulator-3 is used for simulating network environments and setup the experiments. Our proposed method shows high data rate, good performance and low energy consumptions. The results compare with existing methodologies and performance is good. [ABSTRACT FROM AUTHOR]

In recent times, the wireless sensor network (WSN) has been designed to save energy for prolonging its lifetime. Minimize the implementation cost and energy utilization of sensors, and various data compression techniques have been used. We propose a new algorithm, semi-variance based compressive sensing (SCS), in this paper. The proposed scheme works with the spatio-temporal correlation of the signal and its performance investigated based on energy utilization and data quality. The new technique outperforms the existing data compression methods discussed in the literature survey. The simulation results prove that SCS effectively minimizes the computational and transmission cost of data and extends the life period of the WSN. [ABSTRACT FROM AUTHOR]

This paper addresses the optimization of distributed compression in a sensor network with partial cooperation among sensors. The widely known Chief Executive Officer (CEO) problem, where each sensor has to compress its measurements locally in order to forward them over capacity limited links to a common receiver is extended by allowing sensors to mutually communicate. This extension comes along with modified statistical dependencies among involved random variables compared to the original CEO problem, such that well-known outer and inner bounds do not hold anymore. Three different inter-sensor communication protocols are investigated. The successive broadcast approach allows each sensor to exploit instantaneous side-information of all previously transmitting sensors. As this leads to dimensionality problems for larger networks, a sequential point-to-point communication scheme is considered forwarding instantaneous side-information to only one successor. Thirdly, a two-phase transmission protocol separates the information exchange between sensors and the communication with the common receiver. Inspired by algorithmic solutions for the original CEO problem, the sensors are optimized in a greedy manner. It turns out that partial communication among sensors improves the performance significantly. In particular, the two-phase transmission can reach the performance of a fully cooperative CEO scenario, where each sensor has access to all measurements and the knowledge about all channel conditions. Moreover, exchanging instantaneous side-information increases the robustness against bad Wyner–Ziv coding strategies, which can lead to significant performance losses in the original CEO problem.

It was demonstrated that, as a nonlinear implementation of Slepian-Wolf Coding, Distributed Arithmetic Coding (DAC) outperforms traditional Low-Density Parity-Check (LPDC) codes for short code length and biased sources. This fact triggers research efforts into theoretical analysis of DAC. In our previous work, we proposed two analytical tools, Codebook Cardinality Spectrum (CCS) and Hamming Distance Spectrum, to analyze DAC for independent and identically-distributed (i.i.d.) binary sources with uniform distribution. This article extends our work on CCS from uniform i.i.d. binary sources to biased i.i.d. binary sources. We begin with the final CCS and then deduce each level of CCS backwards by recursion. The main finding of this article is that the final CCS of biased i.i.d. binary sources is not uniformly distributed over [0, 1). This article derives the final CCS of biased i.i.d. binary sources and proposes a numerical algorithm for calculating CCS effectively in practice. All theoretical analyses are well verified by experimental results. [ABSTRACT FROM AUTHOR]

The problem of robust distributed source coding for three correlated sources is studied in this work. A lattice-based scheme is proposed and the analysis of its performance is provided in the high resolution regime. Special attention is paid to the degenerate case where the three sources are Gaussian and identical. In this case, our scheme is shown to achieve within an asymptotic gap of 0.069 bits in terms of rate per description from the information-theoretic limit of quadratic symmetric Gaussian multiple description coding with central and individual decoders, when the side distortion and the ratio between the central and side distortions both approach 0. [ABSTRACT FROM AUTHOR]

In this paper, we study the vector Gaussian Chief Executive Officer (CEO) problem under logarithmic loss distortion measure. Specifically, ${K} \geq 2$ agents observe independently corrupted Gaussian noisy versions of a remote vector Gaussian source, and communicate independently with a decoder or CEO over rate-constrained noise-free links. The CEO also has its own Gaussian noisy observation of the source and wants to reconstruct the remote source to within some prescribed distortion level where the incurred distortion is measured under the logarithmic loss penalty criterion. We find an explicit characterization of the rate-distortion region of this model. The result can be seen as the counterpart to the vector Gaussian setting of that by Courtade-Weissman which provides the rate-distortion region of the model in the discrete memoryless setting. For the proof of this result, we obtain an outer bound by means of a technique that relies on the de Bruijn identity and the properties of Fisher information. The approach is similar to Ekrem-Ulukus outer bounding technique for the vector Gaussian CEO problem under quadratic distortion measure, for which it was there found generally non-tight; but it is shown here to yield a complete characterization of the region for the case of logarithmic loss measure. Also, we show that Gaussian test channels with time-sharing exhaust the Berger-Tung inner bound, which is optimal. Furthermore, application of our results allows us to find the complete solutions of two related problems: a quadratic vector Gaussian CEO problem with determinant constraint and the vector Gaussian distributed Information Bottleneck problem. Finally, we develop Blahut-Arimoto type algorithms that allow to compute numerically the regions provided in this paper, for both discrete and Gaussian models. With the known relevance of the logarithmic loss fidelity measure in the context of learning and prediction, the proposed algorithms may find usefulness in a variety of applications where learning is performed distributively. We illustrate the efficiency of our algorithms through some numerical examples. [ABSTRACT FROM AUTHOR]

Signal processing applications dealing with secure transmission are enjoying increasing attention lately. This paper provides some theoretical insights as well as a practical solution for transmitting a hash of an image to a central server to be compared with a reference image. The proposed solution employs a rigid image registration technique viewed in a distributed source coding perspective. In essence, it embodies a phase encoding framework to let the decoder estimate the transformation parameters using a very modest amount of information about the original image. The problem is first cast in an ideal setting and then it is solved in a realistic scenario, giving more prominence to low computational complexity in both the transmitter and receiver, minimal hash size, and hash security. Satisfactory experimental results are reported on a standard images set. [ABSTRACT FROM AUTHOR]

In a wireless sensor network (WSN), the data transmission technique based on the cooperative multiple‐input multiple‐output (CMIMO) scheme reduces the energy consumption of sensor nodes quite effectively by utilizing the space‐time block coding scheme. However, in networks with high node density, the scheme is ineffective due to the high degree of correlated data. Therefore, to enhance the energy efficiency in high node density WSNs, we implemented the distributed source coding (DSC) with the virtual multiple‐input multiple‐output (MIMO) data transmission technique in the WSNs. The DSC‐MIMO first compresses redundant source data using the DSC and then sends it to a virtual MIMO link. The results reveal that, in the DSC‐MIMO scheme, energy consumption is lower than that in the CMIMO technique; it is also lower in the DSC single‐input single‐output (SISO) scheme, compared to that in the SISO technique at various code rates, compression rates, and training overhead factors. The results also indicate that the energy consumption per bit is directly proportional to the velocity and training overhead factor in all the energy saving schemes. [ABSTRACT FROM AUTHOR]

Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user’s local cache memory, even without knowledge of user’s later demands. Maddah-Ali and Niesen proposed a two-phase (placement phase and delivery phase) coded caching strategy for broadcast channels with cache-aided users. This paper investigates the same model under the constraint that content is placed uncoded within the caches, that is, when bits of the files are simply copied within the caches. When the cache contents are uncoded and the users’ demands are revealed, the caching problem can be connected to an index coding problem. This paper focuses on deriving fundamental performance limits for the caching problem by using tools for the index coding problem that were either known or are newly developed in this work. First, a converse bound for the caching problem under the constraint of uncoded cache placement is proposed based on the “acyclic index coding converse bound.” This converse bound is proved to be achievable by the Maddah-Ali and Niesen’s scheme when the number of files is not less than the number of users, and by a newly derived index coding achievable scheme otherwise. The proposed index coding achievable scheme is based on distributed source coding and strictly improves on the widely used “composite (index) coding” achievable bound and its improvements, and is of independent interest. An important consequence of the findings of this paper is that advancements on the coded caching problem posed by Maddah-Ali and Niesen are thus only possible by considering strategies with coded placement phase. A recent work by Yu et al has however shown that coded cache placement can at most half the network load compared to the results presented in this paper. [ABSTRACT FROM AUTHOR]

Polar codes have strongly entered into action within the standardization of the next generation 5G mobile communication systems, which are expected to be an enabling technology for the Internet of Things where networks with a large number of sensors have to handle massive connectivity demands. This paper proposes and investigates the use of systematic polar codes for joint source-channel coding of correlated sources in wireless sensor networks, thus allowing the compression of the volume of data to be transmitted over the network on one hand, and on the other hand, the protection of this data from channel impairments. Results show that systematic polar codes can achieve a distributed compression with rates close to theoretical limits, with better error rates obtained for larger blocks, and a better robustness against transmission errors obtained with stronger compression and shorter block lengths. Furthermore, while the system is able to overcome the effect of noise on parity information with adequate power management, noisy side information significantly degrades system performance with remarkable gaps towards the case of distributed compression with an ideal transmission channel. [ABSTRACT FROM AUTHOR]

A distributed arithmetic coding algorithm based on source symbol purging and using the context model is proposed to solve the asymmetric Slepian–Wolf problem. The proposed scheme is to make better use of both the correlation between adjacent symbols in the source sequence and the correlation between the corresponding symbols of the source and the side information sequences to improve the coding performance of the source. Since the encoder purges a part of symbols from the source sequence, a shorter codeword length can be obtained. Those purged symbols are still used as the context of the subsequent symbols to be encoded. An improved calculation method for the posterior probability is also proposed based on the purging feature, such that the decoder can utilize the correlation within the source sequence to improve the decoding performance. In addition, this scheme achieves better error performance at the decoder by adding a forbidden symbol in the encoding process. The simulation results show that the encoding complexity and the minimum code rate required for lossless decoding are lower than that of the traditional distributed arithmetic coding. When the internal correlation strength of the source is strong, compared with other DSC schemes, the proposed scheme exhibits a better decoding performance under the same code rate.

A new class of structured codes called quasi group codes (QGCs) is introduced. A QGC is a subset of a group code. In contrast with the group codes, QGCs are not closed under group addition. The parameters of the QGC can be chosen, such that the size of $\mathcal {C}+\mathcal {C}$ is equal to any number between $|\mathcal {C}|$ and $|\mathcal {C}|^{2}$. We analyze the performance of a specific class of QGCs. This class of QGCs is constructed by assigning single-letter distributions to the indices of the codewords in a group code. Then, the QGC is defined as the set of codewords whose index is in the typical set corresponding to these single-letter distributions. The asymptotic performance limits of this class of QGCs are characterized using single-letter information quantities. Corresponding covering and packing bounds are derived. It is shown that the point-to-point channel capacity and optimal rate-distortion function are achievable using QGCs. Coding strategies based on QGCs are introduced for three fundamental multi-terminal problems: the Körner-Marton problem for modulo prime-power sums, computation over the multiple access channel (MAC), and MAC with distributed states. For each problem, a single-letter achievable rate-region is derived. It is shown, through examples, that the coding strategies improve upon the previous strategies based on the unstructured codes, linear codes, and group codes. [ABSTRACT FROM AUTHOR]

In this paper, we propose a lattice-based robust distributed source coding system for two correlated sources and provide a detailed performance analysis under the high resolution assumption. It is shown, among other things, that, in the asymptotic regime where: 1) the side distortion approaches 0 and 2) the ratio between the central and side distortions approaches 0, our scheme is capable of achieving the information-theoretic limit of quadratic multiple description coding when the two sources are identical, whereas a variant of the random coding scheme by Chen and Berger with Gaussian codes has a performance loss of 0.5 bits relative to this limit. [ABSTRACT FROM AUTHOR]

We consider a function computation problem in a three-node wireless network. Nodes A and B observe two correlated sources $X$ and $Y$ , respectively, and want to compute a function $f(X,Y)$. To achieve this, nodes A and B send messages to a relay node C at rates $R_{A}$ and $R_{B}$ , respectively. The relay C then broadcasts a message to A and B at rate $R_{C}$. We allow block coding and study the achievable region of rate triples under both zero-error and $\epsilon $ -error. As a preparation, we first consider a broadcast network from the relay to A and B. A and B have side information $X$ and $Y$ , respectively. The relay node C observes both $X$ and $Y$ and broadcasts an encoded message to A and B. We want to obtain the optimal broadcast rate such that A and B can recover the function $f(X,Y)$ from the received message and their individual side information $X$ and $Y$ , respectively. For this problem, we show equivalence between $\epsilon $ -error and zero-error computations–this gives a rate characterization for zero-error computation. As a corollary, this also gives a rate characterization for the relay network under zero error for a class of functions called component-wise one-to-one functions when the support set of $p_{XY}$ is full. For the relay network, the zero-error rate region for arbitrary functions is characterized in terms of graph coloring of some suitably defined probabilistic graphs. We then give a single-letter inner bound to this rate region. Furthermore, we extend the graph theoretic ideas to address the $\epsilon $ -error problem and obtain a single-letter inner bound. [ABSTRACT FROM AUTHOR]

This paper investigates a multi-terminal source coding problem under a logarithmic loss fidelity which does not necessarily lead to an additive distortion measure. The problem is motivated by an extension of the information bottleneck method to a multi-source scenario where several encoders have to build cooperatively rate-limited descriptions of their sources in order to maximize information with respect to other unobserved (hidden) sources. More precisely, we study fundamental information-theoretic limits of the so-called: 1) two-way collaborative information bottleneck (TW-CIB) and 2) the collaborative distributed information bottleneck (CDIB) problems. The TW-CIB problem consists of two distant encoders that separately observe marginal (dependent) components $X_{1}$ and $X_{2}$ and can cooperate through multiple exchanges of limited information with the aim of extracting information about hidden variables $(Y_{1},Y_{2})$ , which can be arbitrarily dependent on $(X_{1},X_{2})$. On the other hand, in CDIB, there are two cooperating encoders which separately observe $X_{1}$ and $X_{2}$ and a third node which can listen to the exchanges between the two encoders in order to obtain information about a hidden variable $Y$. The relevance (figure-of-merit) is measured in terms of a normalized (per-sample) multi-letter mutual information metric (log-loss fidelity), and an interesting tradeoff arises by constraining the complexity of descriptions, measured in terms of the rates needed for the exchanges between the encoders and decoders involved. Inner and outer bounds to the complexity-relevance region of these problems are derived from which optimality is characterized for several cases of interest. Our resulting theoretical complexity-relevance regions are finally evaluated for binary symmetric and Gaussian statistical models, showing theoretical tradeoffs between the complexity-constrained descriptions and their relevance with respect to the hidden variables. [ABSTRACT FROM AUTHOR]

Compute-and-forward (CF) harnesses interference in wireless communications by exploiting structured coding. The key idea of CF is to compute integer combinations of code words from multiple source nodes, rather than to decode individual code words by treating others as noise. Compute-compress-and-forward (CCF) can further enhance the network performance by introducing compression operations at receivers. In this paper, we develop a more general compression framework, termed generalized CCF (GCCF), where the compression function involves the selection of message segments over finite fields. We show that GCCF achieves a broader compression rate region than CCF. We also compare our compression rate region with the fundamental Slepian–Wolf (SW) region. We show that GCCF is optimal in the sense of achieving the minimum total compression rate. We also establish the criteria under which GCCF achieves the SW region. In addition, we consider a two-hop relay network employing the GCCF scheme. We formulate a sum-rate maximization problem and develop an approximate algorithm to solve the problem. Numerical results are presented to demonstrate the performance superiority of GCCF over CCF and other schemes. [ABSTRACT FROM AUTHOR]

In the context of distributed joint source-channel coding, we conceive a joint decoding and estimation scheme for binary Markov sources exhibiting spatio-temporal correlation. The proposed scheme is designed based on the serial concatenation of a trellis coded modulation (TCM) scheme and a unity-rate code. The symbol-based maximum a posteriori algorithm employed for TCM decoding is modified in order to exploit the source correlation. The estimation of both the spatial and temporal correlation parameters is performed jointly with the iterative decoding, hence allowing the estimated parameters to be updated after each iteration. Our simulation results reveal that when both the spatial and temporal correlation parameters are unknown, the proposed joint decoding and estimation scheme approaches the performance to the ideal system relying on perfectly known correlation parameters, therefore, demonstrating the superiority of the proposed scheme. [ABSTRACT FROM AUTHOR]

Image authentication using distributed arithmetic coding (DAC) is studied in this paper. The quantized random projections of the original image are compressed by a DAC encoder and the codeword is taken as the authentication data. With the help of a target image as side information, the DAC decoder could recover the projections. The authentication process is achieved by examining the Euclidean distance between the reconstructed projections and the side information. Compared with existing approaches, the proposed approach has a simpler structure without the help of an additional cryptographic hash function to verify the decoding result. Moreover, the authentication data is more compact with fewer size. Simulation results justify that the proposed approach achieves a comparable performance as existing schemes. [ABSTRACT FROM AUTHOR]

A distributed joint source-channel coding scheme based on a unity-rate code (URC) assisted trellis coded modulation (TCM) is proposed, which exploits the spatiotemporal correlation of symbol-based sources. More specifically, asymmetric distributed source coding of two spatially correlated Markov sources is considered, where one of the sources is assumed to be perfectly decoded and to be available at the receiver of the other source as side information. In order to exploit the temporal correlation statistics, an iterative decoding process exchanging extrinsic information between the amalgamated URC-assisted TCM and a soft-symbol source decoder employing a modified symbol-based maximum a posteriori algorithm is invoked. Furthermore, the Slepian–Wolf (SW) bound of symbol-based sources having spatiotemporal correlation is derived and the benefits of exploiting the spatiotemporal correlation using the proposed coding scheme are demonstrated by our extrinsic information transfer chart analysis. It is shown from our simulation results that upon exploiting the spatiotemporal correlation of the sources, the proposed coding scheme is capable of operating within 0.02 b of the SW bound. [ABSTRACT FROM PUBLISHER]

To reduce the possibility of poor efficiency and weak anti-error capability while encoding and transmitting hyperspectral images, we present a distributed source coding scheme for hyperspectral images based on three-dimensional (3D) set partitioning in hierarchical trees (SPIHT). First, the 3D wavelet transform is performed on the hyperspectral image. Thereafter, the low frequency section is regarded as the Key frame and the high frequency section as the Wyner-Ziv frame to enable independent SPIHT coding through different transmission channels. The Wyner-Ziv encoder uses Turbo channel coding to create high frequency information that reflects the details of the image with better anti-error capacity, while the low frequency information shows the main energy of the image. In this study, we used SPIHT coding to acquire a bit stream with quality scalability. Results show that the proposed scheme is more efficient during coding, while at the same time providing improved anti-error capability and quality scalability of the bit stream. [ABSTRACT FROM AUTHOR]

Summary: Distributed compressive sensing (DCS) usually improves the signal recovery performance of multi‐signal ensembles by exploiting both intra‐ and inter‐signal correlation and sparsity structure. However, the existing DCS had proposed for a very limited ensemble of signals that has only single common information. This paper proposes a generalized DCS (GDCS) framework which can improve sparse signal detection performance given arbitrary types of common information, which are classified into full common information and partial common information after overcoming against existing limitation. Specifically, the theoretical bound on the required number of measurements under the GDCS is obtained. We also develop a practical algorithm to obtain benefits using the GDCS. At the end of this paper, it simply summarizes the potential security issues when it gets all sensing information in a sensor network. Finally, numerical results verify that the proposed algorithm reduces the required number of measurements for correlated sparse signal detection compared to the DCS algorithm. This research lays down the basis for efficient distributed signal detection so that it can improve the detection performance or it can detect the signal reliably when the number of signal observations is limited. [ABSTRACT FROM AUTHOR]

Lattices provide useful structure for distributed coding of correlated sources. A common lattice encoder construction is to first round an observed sequence to a ‘fine’ lattice with dither, then produce the result’s modulo to a ‘coarse’ lattice as the encoding. However, such encodings may be jointly-dependent. A class of upper bounds is established on the conditional entropy-rates of such encodings when sources are correlated and Gaussian and the lattices involved are a from an asymptotically-well-behaved sequence. These upper bounds guarantee existence of a joint−compression stage which can increase encoder efficiency. The bounds exploit the property that the amount of possible values for one encoding collapses when conditioned on other sufficiently informative encodings. The bounds are applied to the scenario of communicating through a many-help-one network in the presence of strong correlated Gaussian interferers, and such a joint−compression stage is seen to compensate for some of the inefficiency in certain simple encoder designs.

A scheme for recovery of a signal by distributed listeners in the presence of Gaussian interference is constructed by exhausting an “iterative power reduction” property. An upper bound for the scheme’s achieved mean-squared-error distortion is derived. The strategy exposes a parameter search problem, which, when solved, causes the scheme to outperform others of its kind. Performance of a blocklength-one scheme is simulated and is seen to improve over plain source coding without compression in the presence of many interferers, and experiences less outages over ensembles of channels.

Two correlated sources emit a pair of sequences, each of which is observed by a different encoder. Each encoder produces a rate-limited description of the sequence it observes, and the two descriptions are presented to a guessing device that repeatedly produces sequence pairs until correct. The number of guesses until correct is random, and it is required that it have a moment (of some prespecified order) that tends to one as the length of the sequences tends to infinity. The description rate pairs that allow this are characterized in terms of the Rényi entropy and the Arimoto–Rényi conditional entropy of the joint law of the sources. This solves the guessing analog of the Slepian–Wolf distributed source-coding problem. The achievability is based on random binning, which is analyzed using a technique by Rosenthal.

In this paper, we develop accurate distortion models for the lossy transmission of two correlated sources in a multiple access Rayleigh fading channel. We focus on a class of real-life communication systems, where the source and channel coders have already been designed separately and can only be configured during the system operation. We investigate three different source coding schemes: distributed source coding (DSC), layered source coding, and independent compression through quantization. With the later scheme the sources are jointly decoded with minimum mean square error (MMSE) estimation at the receiver. We also consider two different transmission schemes: Orthogonal transmissions and interfering transmissions decoded with a successive interference cancellation (SIC) decoder. Our final closed-form analytical models are used to determine the optimal combination of source coding and transmission schemes, as well as their optimal configuration. Hence, we exercise joint source and channel coding (JSCC) by optimizing the system configuration. Through simulations, we first validate the analytical model and illustrate the performance of different schemes. Finally, we demonstrate the JSCC gains achieved by our system. [ABSTRACT FROM AUTHOR]

To improve the rate stability and make a balance for different viewpoints in distributed multi-view video coding (DMVC) system, a novel symmetric DMVC (SDMVC) scheme is proposed in this paper. In the proposed scheme, every frame from all views adopts the same encoding mode and stable output rates are achieved, which are significant to improve the transmission efficiency in the channel. Both temporal and spatial correlations are exploited, in addition, a novel side information (SI) generation algorithm aiming at better exploring the correlations of proposed scheme has been proposed to obtain better performance. The simulation results show that the proposed SDMVC scheme gets a much more stable rate than the asymmetric scheme, only with neglectable bit-rate increasing. Meanwhile, the proposed SI generation algorithm significantly improves the coding performance. [ABSTRACT FROM AUTHOR]

In the age of big data, distributed data providers need to ensure the privacy, while data analysts need to mine the value of data. Therefore, how to find the privacy-utility tradeoff has become a research hotspot. Besides, the adversary may have the background knowledge of the data source. Therefore, it is significant to solve the privacy-utility tradeoff problem in the distributed environment with side information. This paper proposes a distributed privacy-utility tradeoff method using distributed lossy source coding with side information, and quantitatively gives the privacy-utility tradeoff region and Rate-Distortion-Leakage region. Four results are shown in the simulation analysis. The first result is that both the source rate and the privacy leakage decrease with the increase of source distortion. The second result is that the finer relevance between the public data and private data of source, the finer perturbation of source needed to get the same privacy protection. The third result is that the greater the variance of the data source, the slighter distortion is chosen to ensure more data utility. The fourth result is that under the same privacy restriction, the slighter the variance of the side information, the less distortion of data source is chosen to ensure more data utility. Finally, the provided method is compared with current ones from five aspects to show the advantage of our method. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is becoming an increasingly growing topic of interest in the research community. Its requirements meet those of the next generation 5G mobile communication system which is expected to be an enabling technology for IoT, where networks of large numbers of sensors require massive connectivity demands. As polar codes have strongly entered into action within the standardization of 5G, this paper proposes and investigates the use of systematic polar codes for joint-source channel coding of correlated sources thus allowing, on one hand, the compression of the volume of data to be transmitted over the network, and on the other hand, the protection of this data from channel impairments. Results show that systematic polar codes can achieve a distributed compression with rates close to the theoretical bound, with better error rates obtained for larger blocks. However, stronger compression and shorter block lengths allow for a better robustness against transmission errors. [ABSTRACT FROM AUTHOR]