We study the problem of communicating a distributed correlated memoryless source over a memoryless network, from source nodes to destination nodes, under quadratic distortion constraints. We establish the following two complementary results: 1) for an arbitrary memoryless network, among all distributed memoryless sources of a given correlation, Gaussian sources are least compressible, that is, they admit the smallest set of achievable distortion tuples and 2) for any memoryless source to be communicated over a memoryless additive-noise network, among all noise processes of a given correlation, Gaussian noise admits the smallest achievable set of distortion tuples. We establish these results constructively by showing how schemes for the corresponding Gaussian problems can be applied to achieve similar performance for (source or noise) distributions that are not necessarily Gaussian but have the same covariance.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC5786424 | PMC |
| http://dx.doi.org/10.1109/tit.2015.2434829 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Can the Doppler be useful for a benchmark analysis of the wave-like properties of memory-dependent telegraphers' equation.
Chaos
February 2025
Macedonian Academy of Sciences and Arts, Bul. Krste Misirkov 2, Skopje 1000, Macedonia.
Telegraphers' equation perturbed by a uniformly moving external harmonic impact is investigated to uncover information useful for distinguishing properties of the time evolution patterns that describe either memoryless or memory-dependent modeling of transport phenomena. Memory effects are incorporated into telegraphers' equation by smearing the first- and second-order time derivatives so that the memory kernel smearing the second-order time derivative acts as the smeared derivative of the smeared first-order time derivative. Such a generalized telegraphers' equation (abbreviated as GTE) is solved under initial conditions that specify the values of the solutions and their time derivatives taken at the initial time and boundary conditions that require the sought solutions to vanish either at the x space infinity or the (+l)/(-l) boundaries of a compact domain.
View Article and Find Full Text PDFA two-dimensional signal constellation scheme for binary uniform memoryless source transmission in optical fiber channels is studied in this paper. In geometric shaping (GS), optimization algorithms are usually used to change the overall position of constellation points while maintaining the probability of constellation points unchanged. Different optimization functions are used to allocate the position of constellation symbols, thereby improving constellation performance.
View Article and Find Full Text PDFOn Decoder Ties for the Binary Symmetric Channel with Arbitrarily Distributed Input.
Entropy (Basel)
April 2023
Department of Mathematics and Statistics, Queen's University, Kingston, ON K7L 3N6, Canada.
The error probability of block codes sent under a non-uniform input distribution over the memoryless binary symmetric channel (BSC) and decoded via the maximum a posteriori (MAP) decoding rule is investigated. It is proved that the ratio of the probability of MAP decoder ties to the probability of error grows most linearly in blocklength when no MAP decoding ties occur, thus showing that decoder ties do not affect the code's error exponent. This result generalizes a similar recent result shown for the case of block codes transmitted over the BSC under a uniform input distribution.
View Article and Find Full Text PDFThe spatiotemporal gradient of intrusion errors in continuous outcome source memory: Source retrieval is affected by both guessing and intrusions.
Cogn Psychol
March 2023
Melbourne School of Psychological Sciences, The University of Melbourne, Australia.
Previous research has characterized source retrieval as a thresholded process, which fails on a proportion of trials and leads to guessing, as opposed to a continuous process, in which response precision varies across trials but is never zero. The thresholded view of source retrieval is largely based on the observation of heavy tailed distributions of response errors, thought to reflect a large proportion of "memoryless" trials. In this study, we investigate whether these errors might instead reflect systematic intrusions from other list items which can mimic source guessing.
View Article and Find Full Text PDFDistributed Hypothesis Testing over a Noisy Channel: Error-Exponents Trade-Off.
Entropy (Basel)
February 2023
Department of Electrical and Electronic Engineering, Imperial College London, London SW72AZ, UK.
A two-terminal distributed binary hypothesis testing problem over a noisy channel is studied. The two terminals, called the observer and the decision maker, each has access to independent and identically distributed samples, denoted by U and V, respectively. The observer communicates to the decision maker over a discrete memoryless channel, and the decision maker performs a binary hypothesis test on the joint probability distribution of (U,V) based on V and the noisy information received from the observer.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!