scholarly journals Minimum Expected Distortion in Gaussian Source Coding With Fading Side Information

2012 ◽  
Vol 58 (9) ◽  
pp. 5725-5739 ◽  
Author(s):  
Chris T. K. Ng ◽  
Chao Tian ◽  
Andrea J. Goldsmith ◽  
Shlomo Shamai
Keyword(s):  
Source Coding ◽  
Side Information ◽  
Gaussian Source

scholarly journals Channel Coding and Source Coding With Increased Partial Side Information

Entropy ◽  
2017 ◽  
Vol 19 (9) ◽  
pp. 467
Author(s):  
Avihay Sadeh-Shirazi ◽  
Uria Basher ◽  
Haim Permuter
Keyword(s):  
Channel Coding ◽  
Source Coding ◽  
Side Information

Source coding theorem and its converse with side information

1979 ◽  
Vol 17 (3) ◽  
pp. 169-176
Author(s):  
Bhu Dev Sharma ◽  
Ved Priya
Keyword(s):  
Source Coding ◽  
Side Information

scholarly journals Distributed Recovery of a Gaussian Source in Interference with Successive Lattice Processing

Entropy ◽  
2019 ◽  
Vol 21 (9) ◽  
pp. 845 ◽  
Author(s):  
Christian Chapman ◽  
Matthew Kinsinger ◽  
Ameya Agaskar ◽  
Daniel W. Bliss
Keyword(s):  
Upper Bound ◽  
Mean Squared Error ◽  
Source Coding ◽  
Power Reduction ◽  
Search Problem ◽  
Squared Error ◽  
Reduction Property ◽  
Gaussian Source ◽  
Parameter Search

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.

Sign in / Sign up

Export Citation Format

Share Document