Pre-Decoder Processing Functions for a DMC with Mismatched Decoding
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909231178842112 |
|---|---|
| author | Solel, Jonathan Somekh-Baruch, Anelia |
| author_facet | Solel, Jonathan Somekh-Baruch, Anelia |
| contents | This paper analyzes the effect of adding a pre-decoder processing function to a receiver that contains a fixed mismatched decoder at the output of a discrete memoryless channel. We study properties of the symbolwise pre-processing function and show that it is a simple yet very powerful tool which enables to obtain reliable transmission at a positive rate for almost every metric. We present lower and upper bounds on the capacity of a channel with mismatched decoding and symbolwise(scalar-to-scalar) pre-processing, and show that the optimal pre-processing function for random coding is deterministic. We also characterize achievable error exponents. Finally, we prove that a separation principle holds for vectorwise(vector-to-vector) pre-processing functions and further, that deterministic functions maximize the reliably transmitted rate in this case. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_17476 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Pre-Decoder Processing Functions for a DMC with Mismatched Decoding Solel, Jonathan Somekh-Baruch, Anelia Information Theory This paper analyzes the effect of adding a pre-decoder processing function to a receiver that contains a fixed mismatched decoder at the output of a discrete memoryless channel. We study properties of the symbolwise pre-processing function and show that it is a simple yet very powerful tool which enables to obtain reliable transmission at a positive rate for almost every metric. We present lower and upper bounds on the capacity of a channel with mismatched decoding and symbolwise(scalar-to-scalar) pre-processing, and show that the optimal pre-processing function for random coding is deterministic. We also characterize achievable error exponents. Finally, we prove that a separation principle holds for vectorwise(vector-to-vector) pre-processing functions and further, that deterministic functions maximize the reliably transmitted rate in this case. |
| title | Pre-Decoder Processing Functions for a DMC with Mismatched Decoding |
| topic | Information Theory |
| url | https://arxiv.org/abs/2406.17476 |