Low-Complexity Decoding of a Class of Reed-Muller Subcodes for Low-Capacity Channels

We present a low-complexity and low-latency decoding algorithm for a class of Reed-Muller (RM) subcodes that are defined based on the product of smaller RM codes. More specifically, the input sequence is shaped as a multi-dimensional array, and the encoding over each dimension is done separately via...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE International Conference on Communications (2003) s. 123 - 128
Hlavní autoři: Jamali, Mohammad Vahid, Fereydounian, Mohammad, Mahdavifar, Hessam, Hassani, Hamed
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 16.05.2022
Témata:
Codes
Complexity theory
Conferences
Decoding
Encoding
Iterative methods
Low latency communication
ISSN:1938-1883
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present a low-complexity and low-latency decoding algorithm for a class of Reed-Muller (RM) subcodes that are defined based on the product of smaller RM codes. More specifically, the input sequence is shaped as a multi-dimensional array, and the encoding over each dimension is done separately via a smaller RM encoder. Similarly, the decoding is performed over each dimension via a low-complexity decoder for smaller RM codes. The proposed construction is of particular interest to low-capacity channels that are relevant to emerging low-rate communication scenarios. We present an efficient soft-input soft-output (SISO) iterative decoding algorithm for the product of RM codes and demonstrate its superiority compared to hard decoding over RM code components. The proposed coding scheme has decoding (as well as encoding) complexity of {\mathcal{O}}(n\log n) and latency of {\mathcal{O}}(\log n) for blocklength n. This research renders a general framework toward efficient decoding of RM codes.
ISSN:1938-1883
DOI:10.1109/ICC45855.2022.9838861