Aiming at the error propagation problem and other shortcomings of existing distributed source coding (DSC) schemes, we propose a DSC scheme based on the denoising theory (DSCBDT). First, the amount of data that need t...
详细信息
ISBN:
(数字)9781728147437
ISBN:
(纸本)9781728147444
Aiming at the error propagation problem and other shortcomings of existing distributed source coding (DSC) schemes, we propose a DSC scheme based on the denoising theory (DSCBDT). First, the amount of data that need to be transmitted is reduced by sampling the source output sequence. The un-sampled sequence is compressed by conventional arithmetic coder. Finally, the receiver recovers the sampled symbols by making full use of the correlation between the side-information (SI) sequence and the un-sampled sequence. The experiment results show that compared with the low-density parity-check (LDPC) code-based DSC scheme, the proposed scheme shows higher compression ratios and lower error rate when the correlation between the sources is weak. Specifically, the error propagation problem is effectively avoided. The DSCBDT scheme is highly efficient, practical and easy to implement.
The complementary problems of masking and amplifying channel state information in the Gel'fand-Pinsker channel have recently been solved by Merhav and Shamai, and Kim et al., respectively. In this paper, we study ...
详细信息
The complementary problems of masking and amplifying channel state information in the Gel'fand-Pinsker channel have recently been solved by Merhav and Shamai, and Kim et al., respectively. In this paper, we study a related source coding problem. Specifically, we consider the two-encoder source coding setting where one source is to be amplified, while the other source is to be masked. In general, there is a tension between these two objectives which is characterized by the amplification-masking tradeoff. In this paper, we give a single-letter description of this tradeoff. We apply this result, together with a recent theorem by Courtade and Weissman on multiterminal source coding, to solve a fundamental entropy characterization problem.
A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes...
详细信息
ISBN:
(纸本)9781509018079
A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under addition. We argue that these codes provide gains in terms of achievable Rate-Distortions (RD) in different multi-terminal source coding problems. We derive the necessary covering bounds for analyzing the performance of QLC's. We then consider the Multiple-Descriptions (MD) problem, and prove through an example that the application of QLC's gives an improved achievable RD region for this problem. Finally, we derive an inner bound to the achievable RD region for the general MD problem which strictly contains all of the previous known achievable regions.
We introduce a new problem of broadcast source coding with a discrimination requirement - there is an eavesdropping user from whom we wish to withhold the true message in an entropic sense. Binning can achieve the Sle...
详细信息
We introduce a new problem of broadcast source coding with a discrimination requirement - there is an eavesdropping user from whom we wish to withhold the true message in an entropic sense. Binning can achieve the Slepian-Wolf rate, but at the cost of full information leakage to the eavesdropper. Our main result is a lower bound that implies that any entropically efficient broadcast scheme must be "like binning" in that it also must leak significant information to eavesdroppers
A two-terminal interactive distributed source coding problem with alternating messages is studied. The focus is on function computation at both locations with a probability which tends to one as the blocklength tends ...
详细信息
ISBN:
(纸本)9781424422562
A two-terminal interactive distributed source coding problem with alternating messages is studied. The focus is on function computation at both locations with a probability which tends to one as the blocklength tends to infinity. A single-letter characterization of the rate region is provided. It is observed that interaction is useless (in terms of the minimum sum-rate) if the goal is pure source reproduction at one or both locations but the gains can be arbitrarily large for (general) function computation. For doubly symmetric binary sources and any function, interaction is useless with even infinite messages, when computation is desired at only one location, but is useful, when desired at both locations. For independent Bernoulli sources and the Boolean AND function computation at both locations, an interesting achievable infinite-message sum-rate is derived. This sum-rate is expressed, in analytic closed-form, in terms of a two-dimensional definite integral with an infinitesimal rate for each message.
Multiple description source coding concerns situations in which the transmission of the source information is distributed over two channels at rates R/sub 1/ and R/sub 2/, respectively. When both channels are operativ...
详细信息
Multiple description source coding concerns situations in which the transmission of the source information is distributed over two channels at rates R/sub 1/ and R/sub 2/, respectively. When both channels are operative, the decoder receives data at rate R/sub 1/+R/sub 2/ which is used to reconstruct the source information with average distortion d/sub 0/. If one of the channels breaks down, the receiver has to base its reconstruction solely on the data available at rate either R/sub 1/ or R/sub 2/, depending on which channel is operative. This results in a higher distortion of either d/sub 1/ or d/sub 2/, respectively. The region R of all quintuples (R/sub 1/,R/sub 2/, d/sub 0/, d/sub l/, d/sub 2/) has been determined in the so-called /spl Sigma/'no excess rate' case defined by imposing the requirement R/sub 1/+R/sub 2/=R(d/sub 0/), where R(/spl middot/) is the rate-distortion function of the source. The case with excess rate in which R/sub 1/+R/sub 2/>R(d/sub 0/) is permitted seems difficult. Hence we study here a special case of the excess rate problem.< >
We consider a multiterminal source coding problem in which a source is estimated at a central processing unit from lossy-compressed remote observations. Each lossy-encoded observation is produced by a remote sensor. T...
详细信息
We consider a multiterminal source coding problem in which a source is estimated at a central processing unit from lossy-compressed remote observations. Each lossy-encoded observation is produced by a remote sensor. The sensor first obtains a noisy version of the source, then compresses this observation based on minimizing a local distortion measure that depends only on the marginal distribution of its observation. The central node, on the other hand, has knowledge of the joint distribution of the source and all the observations and produces the source estimate that minimizes a different distortion measure between the source and its reconstruction. In this paper, we investigate the problem of optimally choosing the rate of each lossy-compressed remote estimate so as to minimize the distortion at the central processor, subject to bound on the sum of the communication rate between the sensors and the central unit. We focus, in particular, on two models of practical relevance: the case of a Gaussian source observed in additive Gaussian noise and reconstructed under quadratic distortion, and the case of a binary source observed in bit-flipping noise and reconstructed under Hamming distortion. In both scenarios we show that there exist regimes under which having more remote encoders does not reduce the source distortion. In other words, having fewer, high-quality remote estimates provides a smaller distortion than having more, lower-quality estimates.
Variable length source coding schemes offer substantial improvements in data rate for a wide variety of data compression techniques. Unfortunately, practical considerations have limited their use. This paper describes...
详细信息
Variable length source coding schemes offer substantial improvements in data rate for a wide variety of data compression techniques. Unfortunately, practical considerations have limited their use. This paper describes several techniques which allow these powerful codes to be effectively applied. In particular, the problem of loss of code word synchronization due to channel errors is addressed. It is shown how self-synchronizing codes limit error propagation. Also, variable delay and the associated difficulties of buffer synchronization and buffer overflow are considered. The variable delay at the transmitter can be coupled with a variable delay at the receiver to give a fixed system delay. Buffer control then becomes the allocation of this delay between transmitter and receiver. Finally, a switching property of variable length codes to better match the bimodal operation of the source is presented.
Communication is an important issue in cyber physical systems (CPS), which conveys information from sensor(s) to controller(s) in order to control the physical dynamics. When there are multiple sensors receiving corre...
详细信息
ISBN:
(纸本)9781479935130
Communication is an important issue in cyber physical systems (CPS), which conveys information from sensor(s) to controller(s) in order to control the physical dynamics. When there are multiple sensors receiving correlated observations, it is important to design an efficient distributed source coding scheme. Although distributed source coding has been widely studied in the context of pure data communication networks, such as the information theoretic argument (such as Slepian-Wolf coding schemes) and practical codes design (such as the nested lattice based ones), there are many new challenges in the context of CPS, e.g., the cost function for the purpose of control. In this paper, we propose schemes of lattice based quantization, efficient coloring coding scheme and adaptation to physical dynamics. Numerical simulations with application in smart grids demonstrate that the proposed distributed source coding scheme can efficiently suppress the information source.
This paper deals with the relationship between the intrinsic randomness (IR) problem and the fixed-length source coding problem. The IR problem is one of random number generation problems and optimum achievable rates ...
详细信息
ISBN:
(数字)9781665421591
ISBN:
(纸本)9781665421607
This paper deals with the relationship between the intrinsic randomness (IR) problem and the fixed-length source coding problem. The IR problem is one of random number generation problems and optimum achievable rates (optimum IR rate) with respect to several approximation measures such as the variational distance, the Kullback-Leibler (KL) divergence and f-divergences, have been investigated. In particular, it has been shown that the optimum IR rate with respect to the variational distance has a close relationship with the supremum of the unachievable rate in the source coding problem. Inspired by this result, in this paper, we consider the optimum IR rate with respect to a subclass of f-divergences and try to show a relationship with the unachievable rate in the source coding problem. The subclass of f-divergences considered in this paper includes several well-known measures, such as the variational distance, the KL divergence, the Hellinger distance. We also consider a class of normalized f-divergences, which includes the normalized KL divergence.
暂无评论