On the Dynamics of Analog Asynchronous Iterative Decoders
Saied Hemati, Amir H. Banihashemi
Abstract
Iterative decoding with flooding schedule can be formulated as a fixedpoint problem solved iteratively by successive substitution method.In this work, we investigate the dynamics of analog asynchronous implementation of iterative decoding, and show that it can be approximated as the application of the well-known successive over relaxation (SOR) method for solving the fixed-point problem.Simulation results confirm that SOR, which is in general superior to the simpler successive substitution method, can considerably improve the performance of belief propagation or sum-product iterative decoding algorithm for short codes.This implies that analog asynchronous decoders can outperform their digital synchronous counterparts.