Logo image
A shuffled message-passing decoding method for memory-based LDPC decoders
Conference paper

A shuffled message-passing decoding method for memory-based LDPC decoders

Yeong-Luh Ueng, Chung-Jay Yang and Chun-Jung Chen
Proceedings - IEEE International Symposium on Circuits and Systems, pp.892-895
2009

Abstract

Iterative decoding LDPC decoder Low-density parity-check (LDPC) codes Message-passing decoding Shuffled
The convergence speed of shuffled message passing decoding (MPD) is faster than that of standard two phase message passing (TPMP) decoding. Due to complex memory access and requirement of large storage space, the shuffled MPD is not suitable for hardware implementation especially for highrate LDPC codes. In this paper, we propose a modified shuffled MPD which can achieve a similar convergence speed but with reduced complexity in memory access and storage space as compared to the conventional shuffled MPD. We implement a rate-5/6 LDPC decoder based on the proposed algorithm. ©2009 IEEE.

Metrics

1 Record Views

Details

Logo image