The code computes CN in a complex manner which is hard to understand. I've learned the article of 07TCOM and 10TCOM (Low-Complexity Decoding for Non-Binary LDPC Codes in High Order Fields), and I am wondering whether this code matches which article, and how to evaluate the computational complexity of this code? (Considering CN and VN, operations including comparisons, real additions and GF(q) additions)
The code computes CN in a complex manner which is hard to understand. I've learned the article of 07TCOM and 10TCOM (Low-Complexity Decoding for Non-Binary LDPC Codes in High Order Fields), and I am wondering whether this code matches which article, and how to evaluate the computational complexity of this code? (Considering CN and VN, operations including comparisons, real additions and GF(q) additions)