Archivio Istituzionale della RicercaAn 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.
An asymptotic approximation of the ISI channel capacity / Taricco, Giorgio; Joseph J., Boutros. - ELETTRONICO. - (2014), pp. 1-5. (Intervento presentato al convegno Information Theory and Applications Workshop 2014 tenutosi a San Diego, CA (USA) nel 9-14 Feb 2014) [10.1109/ITA.2014.6804211].
An asymptotic approximation of the ISI channel capacity
TARICCO, GIORGIO;
2014
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2543956
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo