Performance studies of single parity check product codes for packet switched networks

Abstract

The thesis aims to analyze the performance characteristics of single newlineparity check product code Here two types of problems are considered One newlineproblem deals with the structural analysis of the erasure pattern of single parity newlinecheck product code and the other deals with the recoverability of erasures In newlinestructural analysis based on the position of the erasure bits, the erasure pattern newlineis classified into two types namely basic patterns and generated patterns Based newlineon the number of rows and number of columns of the occupied erasure bits the newlinebasic pattern is classified into recoverable basic pattern and unrecoverable basic newlinepattern The mathematical analysis has been carried out to find the number of newlinerecoverable and unrecoverable basic patterns for a given number of erasures newlineThe method to find number of patterns generated from all the recoverable basic newlinepatterns for a given number of erasures are presented The numerical solution of newlinesingle parity check product code has been studied for different number of newlineerasures Simulation of the post decoding erasure rate has been done under newlinethree different conditions namely based on minimum distance based on newlinethe conditions that all erasure pattern up to five erasures are recoverable and newline based on the condition that all erasure patterns generated from the newlinerecoverable basic pattern are recoverable The post decoding erasure rate for newlinevarious boundary conditions are studied graphically newline newline