On Cascaded Channels with Finite Complexity Processing at Intermediate NodesReport as inadecuate




On Cascaded Channels with Finite Complexity Processing at Intermediate Nodes - Download this document for free, or read online. Document in PDF available to download.

Presented at: 43rd Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, Urbana-Champaign, USA, 28-30 September, 2005 Publication date: 2005

We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fixed blocklength. We calculate the optimal end-to-end rate, maximized over all possible processings at the relays, and show that it coincides with the end-to-end zero-error capacity. The optimal processing is shown to be identical at each relay and to correspond to a zero-error code. We also show that the rate of convergence to the asymptotic value is exponential in the length of the cascade.

Reference ARNI-CONF-2006-007





Author: Niesen, U.; Fragouli, C.; Tuninetti, D.

Source: https://infoscience.epfl.ch/record/98358?ln=en



DOWNLOAD PDF




Related documents