Improved Upper Bound for Erasure Recovery in Binary Product Codes

Konferenz: PIMRC 2005 - 16th Annual IEEE International Symposium on Personal Indoor and Mobile Radio Communications
11.09.2005 - 14.09.2005 in Berlin, Germany

Tagungsband: PIMRC 2005

Seiten: 5Sprache: EnglischTyp: PDF

Persönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt

Autoren:
Al-Shaikhi, Ali A.; Ilow, Jacek (Dalhousie University, Department of Electrical and Computer Engineering, Halifax, NS, Canada B3J 2X4)

Inhalt:
Product codes are powerful codes that can be used to correct errors and/or recover erasures. The focus of this paper is to evaluate the performance of such codes under the erasure scenarios. Judging the erasure recovery performance of a product code based on its minimum distance is pessimistic because the code is actually capable of recovering many erasure patterns beyond those with the number of erasures determined by the minimum distance. By investigating the non-correctable erasure patterns, this paper develops a tight upper bound on the post-decoding erasure rate for any binary product code. The analytical derivations are verified through computer simulations using Hamming and single parity check (SPC) product codes. A good agreement between the derived formulas and simulation results is documented.