About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE International Symposium on Information Theory - Proceedings
Paper
Deriving performance bounds for ISI channels using Gallager codes
Abstract
We develop density evolution methods for evaluating the performance of Gallager's low-density parity-check (LDPC) codes over binary inter-symbol interference (ISI) channels. In contrast to previous work on memoryless channels, the noise tolerance thresholds for ISI channels depend on the transmitted sequences. The concentration statements are appropriately adjusted to reflect this difference. We compare the thresholds of regular Gallager codes over the 1 - D partial response channel to the i.i.d. information rate, showing that at high code rates, regular Gallager codes are asymptotically optimal.