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
ICC 2003
Conference paper
Bit error rate analysis on iterative two-stage decoding of two dimensional codes by importance sampling
Abstract
We present a bit error rate analysis for iterative two-stage hard decision decoding of product codes and proposed concatenated codes suitable for optical communication. Our method is based on an importance sampling technique characterized by recursive calculation of cumulative binomial probabilities and direct biasing of error patterns. We can accelerate the Monte Carlo simulations by several orders of magnitude such as 108 and estimate the coding gains at the BERs as low as 10-15 required in optical communications. We apply the method to comparative BER analysis of product codes and proposed concatenated codes and show that product codes of small minimum distance have error floors at low BERs while proposed concatenated codes of large minimum distance do not.