An asymptotic approximation of the ISI channel capacity

Giorgio Taricco, Joseph Boutros

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

An asymptotic method to calculate the information rate of an ISI channel is presented in this work. The method is based on an integral representation of the mutual information, which is then calculated by using a saddlepoint approximation along with an asymptotic expansion stemming from the Hubbard-Stratonovich transform. This asymptotic result is evaluated repeatedly to generate a large number of samples required for the Monte-Carlo approximation of the final result. The proposed method has the advantage of being manageable even when the channel memory becomes very large since the complexity grows with polynomial order in the memory length.

Original languageEnglish
DOIs
Publication statusPublished - 1 Jan 2014
Event2014 IEEE Information Theory and Applications Workshop, ITA 2014 - San Diego, CA, United States
Duration: 9 Feb 201414 Feb 2014

Other

Other2014 IEEE Information Theory and Applications Workshop, ITA 2014
CountryUnited States
CitySan Diego, CA
Period9/2/1414/2/14

Fingerprint

Channel capacity
Data storage equipment
Polynomials

Keywords

  • Channel capacity
  • Information rates
  • Intersymbol interference channels

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Taricco, G., & Boutros, J. (2014). An asymptotic approximation of the ISI channel capacity. Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States. https://doi.org/10.1109/ITA.2014.6804211

An asymptotic approximation of the ISI channel capacity. / Taricco, Giorgio; Boutros, Joseph.

2014. Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States.

Research output: Contribution to conferencePaper

Taricco, G & Boutros, J 2014, 'An asymptotic approximation of the ISI channel capacity' Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States, 9/2/14 - 14/2/14, . https://doi.org/10.1109/ITA.2014.6804211
Taricco G, Boutros J. An asymptotic approximation of the ISI channel capacity. 2014. Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States. https://doi.org/10.1109/ITA.2014.6804211
Taricco, Giorgio ; Boutros, Joseph. / An asymptotic approximation of the ISI channel capacity. Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States.
@conference{c0f4775161ce4e129d03ca5eed76e4e9,
title = "An asymptotic approximation of the ISI channel capacity",
abstract = "An asymptotic method to calculate the information rate of an ISI channel is presented in this work. The method is based on an integral representation of the mutual information, which is then calculated by using a saddlepoint approximation along with an asymptotic expansion stemming from the Hubbard-Stratonovich transform. This asymptotic result is evaluated repeatedly to generate a large number of samples required for the Monte-Carlo approximation of the final result. The proposed method has the advantage of being manageable even when the channel memory becomes very large since the complexity grows with polynomial order in the memory length.",
keywords = "Channel capacity, Information rates, Intersymbol interference channels",
author = "Giorgio Taricco and Joseph Boutros",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/ITA.2014.6804211",
language = "English",
note = "2014 IEEE Information Theory and Applications Workshop, ITA 2014 ; Conference date: 09-02-2014 Through 14-02-2014",

}

TY - CONF

T1 - An asymptotic approximation of the ISI channel capacity

AU - Taricco, Giorgio

AU - Boutros, Joseph

PY - 2014/1/1

Y1 - 2014/1/1

N2 - An asymptotic method to calculate the information rate of an ISI channel is presented in this work. The method is based on an integral representation of the mutual information, which is then calculated by using a saddlepoint approximation along with an asymptotic expansion stemming from the Hubbard-Stratonovich transform. This asymptotic result is evaluated repeatedly to generate a large number of samples required for the Monte-Carlo approximation of the final result. The proposed method has the advantage of being manageable even when the channel memory becomes very large since the complexity grows with polynomial order in the memory length.

AB - An asymptotic method to calculate the information rate of an ISI channel is presented in this work. The method is based on an integral representation of the mutual information, which is then calculated by using a saddlepoint approximation along with an asymptotic expansion stemming from the Hubbard-Stratonovich transform. This asymptotic result is evaluated repeatedly to generate a large number of samples required for the Monte-Carlo approximation of the final result. The proposed method has the advantage of being manageable even when the channel memory becomes very large since the complexity grows with polynomial order in the memory length.

KW - Channel capacity

KW - Information rates

KW - Intersymbol interference channels

UR - http://www.scopus.com/inward/record.url?scp=84901236322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901236322&partnerID=8YFLogxK

U2 - 10.1109/ITA.2014.6804211

DO - 10.1109/ITA.2014.6804211

M3 - Paper

AN - SCOPUS:84901236322

ER -