Complexity Comparison of Non-Binary LDPC Decoders
Laura Conde-Canencia, Ali Chamas Al Ghouwayel, Emmanuel Boutillon, Laura Conde-Canencia, Ali Al-ghouwayel, Emmanuel Boutillon, Complexity Comparison, Laura Conde-Canencia, Ali Chamas Al Ghouwayel, Emmanuel Boutillon · 2009
Abstract: This paper presents a detailed complexity study of the existing non-binary LDPC decoding algorithms in order to rigorously compare them from a hardware perspective. The Belief Propagation algorithm is first considered as well as its derivative versions in the frequency and logarithm domains. We then focus on the