Tech Talk

Linear and Digital IC Applications

Name:M.Praveen Kumar,

Roll.No:19951A04A7,

Class :ECE(B),
TOPIC :-

Lowering the error floor of ADMM penalized decoder for LDPC

codes
Decoding by alternating direction method of multipliers (ADMM) is a promising linear
programming decoder for low-density parity-check (LDPC) codes. In this paper, we
propose a two-step scheme to lower the error floor of LDPC codes with ADMM
penalized decoder. For the undetected errors that cannot be avoided at the decoder side,
we modify the code structure slightly to eliminate low-weight code words. For the
detected errors induced by small error-prone structures, we propose a post-processing
method for the ADMM penalized decoder. Simulation results show that the error floor
can be reduced significantly over three illustrated LDPC codes by the proposed two-step
scheme.
Linear programming (LP) decoding for low-density parity-check (LDPC) codes
proposed by Feldman et al. is shown to have theoretical guarantees in several regimes
and empirically is not observed to suffer from an error floor. However at low signal-to-
noise ratios (SNRs), LP decoding is observed to have worse error performance than
belief propagation (BP) decoding. In this paper, we seek to improve LP decoding at low
SNRs while still achieving good high SNR performance. We first present a new
decoding framework obtained by trying to solve a non-convex optimization problem
using the alternating direction method of multipliers (ADMM). This non-convex
problem is constructed by adding a penalty term to the LP decoding objective. The goal
of the penalty term is to make "pseudocodewords", which are the non-integer vertices of
the LP relaxation to which the LP decoder fails, more costly. We name this decoder class
the "ADMM penalized decoder". In our simulation results, the ADMM penalized
ℓ ℓ
decoder with  1 and  2 penalties outperforms both BP and LP decoding at all SNRs.
For high SNR regimes where it is infeasible to simulate, we use an instanton analysis
and show that the ADMM penalized decoder has better high SNR performance than BP
decoding. We also develop a reweighted LP decoder using linear approximations to the
ℓ
objective with an  1 penalty. We show that this decoder has an improved theoretical
recovery threshold compared to LP decoding. In addition, we show that the empirical
gain of the reweighted LP decoder is significant at low SNRs.
The decoding of LDPC codes is formulated as an LP model and solved efficiently
by the ADMM technique. However, compared with traditional belief-propagation
decoding, ADMM decoding suffers from higher complexity and worse error
correction performance, which prevents the employment of ADMM decoding in
reality.

To reduce the complexity of ADMM decoding, we first focus on the simplification

of the check polytope projection, the most complex operation in ADMM decoding.
We propose an iterative check polytope projection algorithm without the sorting
operation. The proposed algorithm converges with the increase of iterations.
Moreover, for a fixed number of iterations, its average complexity and the worst-
case complexity are linear in the input dimension.

Another direction we propose to simplify ADMM decoding is to devise a better

scheduling scheme than the standard flooding scheme. We start from the node-wise
scheduling scheme which only updates the check node messages with the maximum
message residual. Then we simplify the calculation of the message residual and
propose a reduced-complexity node-wise scheduling scheme
To improve the error correction performance of ADMM decoding, we propose a novel
ADMM penalized decoding algorithm whose penalty term is based on check nodes (CN).
We investigate the properties of the CN penalty functions and show several examples. We
make conclusions on its convergence properties and prove its failure probability is
independent of the transmitted codewords for symmetric channels. Monte-Carlo
simulation and the instanton analysis show its better error correction performance in the
low and high SNR regions. Finally, we propose a post-processing technique to lower the
error floor of LDPC codes. The output of the first stage decoder can be revised if the
syndrome is found ii in a look-up table that contains the dominant trapping sets of this
code. The most complex part of the technique, the syndrome pattern matching (SPM)
operation, is simplified to a one-dimensional binary search operation. Besides, a simplified
SPM algorithm is proposed for quasi-cyclic (QC) LDPC codes.

Complexity Reduction of ADMM Decoding :-

To reduce the complexity of ADMM decoding, most works focus on simplifying the
check polytope projection operation, the most time-consuming and complicated
component in ADMM decoding. The original check polytope projection algorithm of
involves two sorting operations
The projection algorithm has the same computational complexity as since it also uses
only the partial sorting operation. However, as pointed out in , there is no efficient
hardware implementation for the partial sorting currently. As a result, the partial
sorting operation still has to be implemented as the standard sorting operation, and
the advantage in terms of the complexity brought by the partial sorting operation is
lost. In , Wei et al. reduced the computational complexity of ADMM decoding by
reducing the number of polytope projections instead of reducing the complexity of
the projection itself. The unnecessary projection operations are avoided during the
iteration, leading to a significant reduction of the execution time. Jiao et al. used
look-up tables to replace the complexity projection operation at the expense of large
memory and developed efficient look-up table searching algorithms .

Performance Improvement of ADMM Decoding :-

To improve the error correction performance of ADMM decoding at low SNR values,
penalty terms were added to the LP model’s objective function to penalize the pseudo-
codeword. Pseudo-codewords are the non-integer points in the feasible region of
ADMM decoding but have smaller objective function values than codewords. Since
ADMM decoding outputs the solution which has the smallest objective function value
from its feasible region, the penalty terms add extra barriers for the pseudocodewords to
be output.
The ADMM decoding algorithm can be seen as an iterative message-passing algorithm.
For a message-passing algorithm, the scheduling of messages plays an important role in
the convergence of the algorithm. The standard flooding scheme updates all check node
messages or all variable node messages in one iteration, which involves a significant
number of unimportant updating operations. Inspired by the effective scheduling
schemes developed for BP decoders, we investigate the node-wise scheduling scheme
which only updates the check node messages with the maximum message residual in
each iteration. Unlike BP decoders, the calculation of the check node message residuals
involves the polytope projection operation which consumes non-negligible time

Finally, the based post-processing technique to lower the error floor of LDPC codes. When
the first stage decoder of an LDPC code fails to output a codeword, the syndrome pattern
will be searched in a look-up table that contains the dominant trapping sets. The output of
the first stage decoder can be directly flipped based on the information of the matched
trapping set. The most complex part of the technique, the syndrome pattern matching
(SPM) operation3 , is simplified to a one-dimensional binary search operation by
extracting a feature value from each trapping set. A further simplified SPM algorithm is
proposed for QC LDPC codes. We analyze both the computation complexity and the
storage complexity of the proposed method. The simulation results show the trade-off
between performance improvement and complexity. It should be noted that the proposed
post-processing technique can be potentially combined with the ADMM decoding
algorithm
THANK YOU