The distortion-rate function of output-constrained lossy source coding with limited common randomness is analyzed for the special case of the squared error distortion measure. An explicit expression is obtained when both the source and reconstruction distributions are Gaussian. This further leads to a partial characterization of the information-theoretic limit of quadratic Gaussian rate-distortion-perception coding, with the perception measure given by either the Kullback-Leibler divergence or the squared quadratic Wasserstein distance, from which Wagner’s result for the perfect realism setting and Zhang et al.’s result for the unlimited common randomness setting can be recovered as special cases.
10 December 2018 in IEEE Transactions on Communications
Consider a lossy compression system with ℓ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under the mean squared error distortion constraint. It is assumed that the observed sources can be expressed as the sum of the target signals and the corruptive noises, which are generated independently from two symmetric multivariate Gaussian distributions. Depending on the parameters of such distributions, the rate-distortion limit of this system is characterized either completely or at least for sufficiently low distortions. The results are further extended to the robust distributed compression setting, where the outputs of a subset of encoders may also be used to produce a non-trivial reconstruction of the corresponding target signals. In particular, we obtain in the high-resolution regime a precise characterization of the minimum achievable reconstruction distortion based on the outputs of k+1 or more encoders when every k out of all ℓ encoders are operated collectively in the same mode that is greedy in the sense of minimizing the distortion incurred by the reconstruction of the corresponding k target signals with respect to the average rate of these k encoders.
4 October 2022 in IEEE Transactions on Vehicular Technology
In the next-generation wireless networks, full-duplex, relaying, and random linear network coding (RLNC) are popular techniques to enhance the network performance such as efficiency and reliability. For full-duplex relay networks, a perfect RLNC scheme known as FBPF (Fewest Broadcast Packet First) was recently proposed and demonstrated a better throughput, or equivalently, expected completion delay performance than the Automatic Repeat Request scheme. However, the original FBPF scheme assumes unlimited buffer and does not take the buffer size into consideration. In this paper, we generalize the FBPF scheme to consider the buffer size as a new parameter. Based on a novel Markov chain model, explicit formulae to characterize the expected completion delay are deduced. Moreover, we present a criterion on the optimal selection of the buffer size under a quality of service constraint, so that the selected buffer size is significantly reduced while the completion delay performance is comparable to the original FBPF scheme with unlimited buffer.
A constrained version of Talagrand’s transportation inequality is established, which reveals an intrinsic connection between the Gaussian distortion-rate-perception functions with limited common randomness under the Kullback–Leibler divergence-based and squared Wasserstein-2 distance-based perception measures. This connection provides an organizational framework for assessing existing bounds on these functions. In particular, we show that the best-known bounds of Xie et al. are nonredundant when examined through this connection.
Consider a symmetric multivariate Gaussian source with ℓ components, which are corrupted by independent and identically distributed Gaussian noises; these noisy components are compressed at a certain rate, and the compressed version is leveraged to reconstruct the source subject to a mean squared error distortion constraint. The rate-distortion analysis is performed for two scenarios: centralized encoding (where the noisy source components are jointly compressed) and distributed encoding (where the noisy source components are separately compressed). It is shown, among other things, that the gap between the rate-distortion functions associated with these two scenarios admits a simple characterization in the large ℓ limit.
12 January 2026 in IEEE Transactions on Communications
This paper investigates the tightness of existing bounds on the quadratic Gaussian distortion-rate-perception functions with limited common randomness and the i.i.d. output constraint, under perception measures based on the Kullback–Leibler divergence and the squared Wasserstein-2 distance. For the squared Wasserstein-2 distance-based perception measure, we improve the best-known lower bound by introducing a tunable parameter. Moreover, via the connection between rate-distortion-perception coding and entropy-constrained scalar quantization, it is revealed that all existing bounds, including the improved one, are generally not tight in the weak perception constraint regime. Our findings shed light on the information-theoretic performance limits of rate-distortion-perception coding and offer guidelines for developing practical schemes.