Year: 2014
Type: conference-paper
Abstract: The Extended Min-Sum (EMS) algorithm for non-binary low-density parity-check (LDPC) defined over an alphabet of size $q$ operates on truncated messages of length $q'$ to achieve a complexity of the order $q'^2$. In contrast, Walsh-Hadamard (WH) transform based iterative decoders achieve a complexity of the order $q\log q$, which is much larger for $q'<
Source: Apollo (University of Cambridge)
Author: Sayir, Jossy
Institution: University of Cambridge
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1707494457