Abstract
A low complexity LDPC encoder based on classic RU Algorithm is presented for CMMB. The RU Algorithm uses an optimized greedy algorithm for approximate triangulation with sparse matrix of LDPC codes. Results show that this optimized algorithm can reduce complexity of encoding and the consumption of hardware resource effectively.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
