Ordered subsets message-passing
Joseph A. O’Sullivan, N. Singla · 2003
A algorithm is proposed for decoding on graphs having short cycles. The algo- rithm, termed the ordered subsets message-passing (OSMP) algorithm, performs on a graph in which the measured data is partitioned into subsets. The OSMP algorithm is applied for joint equalization and decoding for two-dimensional (2D) intersymbol interference (ISI) channels. Simulation results show that the OSMP algorithm outperforms its unordered counterpart i.e. when the measured data are not partitioned into subsets. Concentration results proved by KavEid et. al. in (2) for a one- dimensional IS1 channel also hold for the OSMP al- gorithm for a 2D IS1 channel.