Abstract
A complexity reducing method for iterative message passing decoding algorithms of low-density parity-check (LDPC) codes is described. It is based on lazy scheduling which involves a partial update of messages in the iterations. A density evolution (DE) approach is developed for optimization of the parameters for choice of the messages to be updated. Combined with an efficient serial scheduling, the resulting method reduces the decoding complexity by about 70-75% compared to the classical belief propagation (BP) scheme, while maintaining the same performance
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
