Identification for ISI Gaussian Channels
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909006129266688 |
|---|---|
| author | Salariseddigh, Mohammad Javad Deppe, Christian |
| author_facet | Salariseddigh, Mohammad Javad Deppe, Christian |
| contents | We establish lower and upper bounds for the identification capacity of discrete-time Gaussian channels subject to inter-symbol interference (ISI), a canonical model in wireless communication. Our analysis accounts for deterministic encoders under peak power constraint. A principal finding is that, even when the number of ISI taps scales sub-linearly with the codeword length $n$ as $\sim n^κ$ with $κ\in [0,1/2),$ the number of messages that can be reliably identified grows super-exponentially in $n$ as $\sim 2^{(n \log n)R},$ where $R$ is the coding rate. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_14246 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Identification for ISI Gaussian Channels Salariseddigh, Mohammad Javad Deppe, Christian Information Theory We establish lower and upper bounds for the identification capacity of discrete-time Gaussian channels subject to inter-symbol interference (ISI), a canonical model in wireless communication. Our analysis accounts for deterministic encoders under peak power constraint. A principal finding is that, even when the number of ISI taps scales sub-linearly with the codeword length $n$ as $\sim n^κ$ with $κ\in [0,1/2),$ the number of messages that can be reliably identified grows super-exponentially in $n$ as $\sim 2^{(n \log n)R},$ where $R$ is the coding rate. |
| title | Identification for ISI Gaussian Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2603.14246 |