Recent worksshowedhowlow-densityparity-check (LDPC) erasure correcting codes, under maximumlikelihood (ML) decoding, are capable of tightly approaching the per- formance of anideal maximum-distance-separable codeonthe binaryerasure channel. Suchresult is achievable downtolow error rates, even for small and moderate block sizes, while keeping the decoding complexity low, thanks to a class of decodingalgorithmswhichexploitsthesparsenessof theparity- checkmatrixtoreducethecomplexityof Gaussianelimination (GE).InthispaperthemainconceptsunderlyingMLdecodingof LDPCcodesarerecalled. Aperformanceanalysisamongvarious LDPCcodeclasses is thencarriedout, includingacomparison withfixed-rateRaptorcodes. Theresults showthat LDPCand Raptorcodes providealmost identical performanceinterms of decodingfailureprobability.
Low- complexity LDPC codes with near-optimum performance over the BEC
PAOLINI, ENRICO;CHIANI, MARCO;
2008
Abstract
Recent worksshowedhowlow-densityparity-check (LDPC) erasure correcting codes, under maximumlikelihood (ML) decoding, are capable of tightly approaching the per- formance of anideal maximum-distance-separable codeonthe binaryerasure channel. Suchresult is achievable downtolow error rates, even for small and moderate block sizes, while keeping the decoding complexity low, thanks to a class of decodingalgorithmswhichexploitsthesparsenessof theparity- checkmatrixtoreducethecomplexityof Gaussianelimination (GE).InthispaperthemainconceptsunderlyingMLdecodingof LDPCcodesarerecalled. Aperformanceanalysisamongvarious LDPCcodeclasses is thencarriedout, includingacomparison withfixed-rateRaptorcodes. Theresults showthat LDPCand Raptorcodes providealmost identical performanceinterms of decodingfailureprobability.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
