Recoverability study of SPC product codes under erasure decoding

Product codes are powerful codes that can be used to correct errors or recover erasures. The simplest form of a product code is that where every row and every column is terminated by a single parity bit referred to as single parity check (SPC) product code. This code has a minimum distance of four and is thus guaranteed to recover all single, double, and triple erasure patterns. Judging the code performance based on its minimum distance is very pessimistic because the code is actually capable of recovering many higher erasure patterns. Kousa [IEEE Trans. Commun. 50 (Jan) (2002) 7] develops a novel approach for deriving an upper bound on the post-decoding erasure rate for the SPC product code with iterative decoding. We derive a formula for finding the number of unrecoverable basic pattern and the number of recoverable pattern generated from the unrecoverable basic pattern. The results are compared with that of Kousa [IEEE Trans. Commun. 50 (Jan) (2002) 7].

[1]  G. Taricco,et al.  Weight distribution and performance of the iterated product of single-parity-check codes , 1994, 1994 IEEE GLOBECOM. Communications: Communications Theory Mini-Conference Record,.

[2]  Trieu-Kien Truong,et al.  VLSI architecture of modified Euclidean algorithm for Reed-Solomon code , 2003, Inf. Sci..

[3]  Hiroshi Ohta,et al.  A Cell Loss Recovery Method Using FEC in ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[4]  Hyotaek Lim,et al.  Cell loss recovery method in B-ISDN/ATM networks , 1995 .

[5]  Maan A. Kousa.  A novel approach for evaluating the performance of SPC product codes under erasure decoding , 2002, IEEE Trans. Commun..

[6]  Ezio Biglieri,et al.  Approximately Gaussian weight distribution of the iterated product of single-parity-check codes , 1994 .

[7]  Robert G. Gallager,et al.  Design of error detection scheme for class C service in ATM , 1994, TNET.

[8]  Ahmed K. Elhakeem,et al.  Performance of ATM networks under hybrid ARQ/FEC error control scheme , 1999, TNET.

[9]  Tarek N. Saadawi,et al.  Fundamentals of Telecommunication Networks , 1994, Wiley series in telecommunications and signal processing.

[10]  Li Ping,et al.  Efficient soft-in-soft-out sub-optimal decoding rule for single parity check codes , 1997 .

[11]  Hyotaek Lim,et al.  Improving the performance of cell-loss recovery in ATM networks , 1996 .

[12]  Xiaoling Huang,et al.  BER bounds on parallel concatenated single parity check arrays and zigzag codes , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).