A Unified Random Coding Bound

In this paper, we prove a unified achievability bound that generalizes and improves random coding bounds for any combination of source coding, channel coding, joint source-channel coding, and coding for computing problems assuming blockwise node operation. As a general network setup, we consider an...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 64; číslo 10; s. 6779 - 6802
Hlavní autoři: Lee, Si-Hyeon, Chung, Sae-Young
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
achievability
Channel coding
Codes
Coding
decode-compress-amplify-and-forward
Decoding
duality
Error analysis
Network coding
Noise measurement
random coding
Relaying
Relays
Source coding
Unified approach
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we prove a unified achievability bound that generalizes and improves random coding bounds for any combination of source coding, channel coding, joint source-channel coding, and coding for computing problems assuming blockwise node operation. As a general network setup, we consider an acyclic discrete memoryless network, where the network demands and constraints are specified by a joint-typicality constraint on the whole channel input and output sequences. For achievability, a basic building block for node operation consists of simultaneous nonunique decoding, simultaneous compression, and symbol-by-symbol mapping. Our bound can be useful for deriving random coding bounds without error analysis, especially for large and complex networks. In particular, our bound can be used for unifying and generalizing many known relaying strategies. For example, a generalized decode-compress-amplify-and-forward bound is obtained as a simple corollary of our main theorem, and it is shown to strictly outperform the previously known relaying schemes. Furthermore, by exploiting the symmetry in our bound, we formally define and characterize three types of network duality based on channel input-output reversal and network flow reversal combined with packing-covering duality.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2018.2864731