Iterative reduced-complexity detection for LDPC coded 2-D recording channels

In this paper, we consider iterative graph-based detection for low-density parity-check (LDPC) coded two-dimensional (2-d) intersymbol interference (ISI) channels and propose a novel approach to reduce the complexity of the check node operation in the channel Tanner Graph by restricting the computation to a small subset of binary vectors. Simulation results show that the proposed receiver approaches closely the performance of the full-complexity receiver with a much lower complexity.