2014/07/16 by Jossy Sayir, Sayir, Jossy
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1407.4342
openalex publication_date 2014/07/16 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
The Extended Min-Sum (EMS) algorithm for non-binary low-density parity-check\n(LDPC) defined over an alphabet of size q operates on truncated messages of\nlength q' to achieve a complexity of the order q'2. In contrast,\nWalsh-Hadamard (WH) transform based iterative decoders achieve a complexity of\nthe order q\log q, which is much larger for q'<<q. In this paper, we\ndemonstrate that considerable savings can be achieved by letting WH based\ndecoders operate on truncated messages as well. We concentrate on the direct WH\ntransform and compute the number of operations required if only q' of the q\ninputs are non-zero. Our paper does not cover the inverse WH transform and\nhence further research is needed to construct WH based decoders that can\ncompete with the EMS algorithm on complexity terms.\n