Successive Wyner-Ziv Coding for the Binary CEO Problem Under Logarithmic Loss
| Autor: | Tad Matsumoto, Reza Asvadi, Mahdi Nangir, Jun Chen, Mahmoud Ahmadian-Attari |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
Logarithm Computer science Computer Science - Information Theory Binary CEO problem Binary number Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Wyner-Ziv problem 0203 mechanical engineering 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Low-density parity-check code successive decoding Computer Science::Information Theory Information Theory (cs.IT) Quantization (signal processing) quantization splitting 020206 networking & telecommunications 020302 automobile design & engineering binary quantization syndrome decoding logarithmic loss Algorithm Decoding methods Coding (social sciences) |
| Zdroj: | IEEE Transactions on Communications. 67:7512-7525 |
| ISSN: | 1558-0857 0090-6778 |
| DOI: | 10.1109/tcomm.2019.2937932 |
| Popis: | The $L$ -link binary Chief Executive Officer (CEO) problem under logarithmic loss is investigated in this paper. A quantization splitting technique is applied to convert the problem under consideration to a $(2L-1)$ -step successive Wyner-Ziv (WZ) problem, for which a practical coding scheme is proposed. In the proposed scheme, Low—Density Generator—Matrix (LDGM) codes are used for binary quantization while Low—Density Parity—Check (LDPC) codes are used for syndrome generation; the decoder performs successive decoding based on the received syndromes and produces a soft reconstruction of the remote source. The simulation results indicate that the rate—distortion performance of the proposed scheme can approach the theoretical inner bound based on binary—symmetric test—channel models. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|