Verification-Based Decoding with MAP Erasure Recovery
Conference: SCC 2013 - 9th International ITG Conference on Systems, Communication and Coding
01/21/2013 - 01/24/2013 at München, Deutschland
Proceedings: SCC 2013
Pages: 6Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Matuz, Balázs; Liva, Gianluigi (Deutsches Zentrum für Luft- und Raumfahrt (DLR), 82234 Wessling, Germany)
Paolini, Enrico; Chiani, Marco (CNIT, DEI, University, of Bologna, 47521 Cesena (FC), Italy)
Abstract:
Verification-based decoding (VBD) is a simple yet powerful iterative (IT) decoding technique for codes operating on packets (vector-symbols) and channels that introduce packetwise errors. An example is given by the q-ary symmetric channel (qSC) for which a simple improvement of the VBD algorithm is proposed. It consists of performing a Gaussian elimination (GE)-based erasure decoding stage whenever VBD fails, i.e., whenever β > 0 packets remain unverified. The modified decoder may recover the β unverified packets with a complexity of O(β3) by making use of the inherent code structure. Numerical results on low-density parity-check (LDPC) codes and analytical expressions for the block error probability of linear random block codes show the benefit of the proposed algorithm.