Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound

Ramanan Subramanian; Badri Vellambi; Ingmar Land

Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound

Information Theory 2013-01-29 v1 math.IT Probability Applications

Authors: Ramanan Subramanian , Badri Vellambi , Ingmar Land

Abstract

A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of Additive White Gaussian Noise links each having an input power constraint. Intermediate nodes are allowed to perform arbitrary encoding/decoding operations, but the block length and the encoding rate are fixed. The bound presented in this paper is fundamental and depends only on the design parameters namely, the network size, block length, transmission rate, and signal-to-noise ratio.

Keywords

finite block length information loss Gaussian line network maximum transmission rate additive white Gaussian noise cascade channel fundamental bound

Cite

@article{arxiv.1301.6255,
  title  = {Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound},
  author = {Ramanan Subramanian and Badri Vellambi and Ingmar Land},
  journal= {arXiv preprint arXiv:1301.6255},
  year   = {2013}
}

Comments

7 pages, 4 figures. To be submitted to ISIT 2013 conference

Information Loss due to Finite Block Length in a Gaussian Line Network: An Improved Bound

Abstract

Keywords

Cite

Comments

Related papers