Optimal communication scheduling for iterative decoding of irregular codes


Many important and newer classes of error-correction codes, such as LDPC, expander, repeat-accumulate or polar codes have a bipartite graph representation of their computation. Decoders for such codes are practically implemented using iterative decoding over such bipartite graphs. The iterative decoding progresses as per various communication schedules… (More)
DOI: 10.1109/NCC.2014.6811240


2 Figures and Tables