A Modified Permutation Algorithm for Low Complexity Encoding in NB-QC-LDPC Codes

A modified permutation algorithm that optimizes the preprocessing step of the efficient encoding algorithm is proposed for nonbinary quasi-cyclic low-density parity-check (NB-QC-LDPC) codes. Linear complexity encoding is implemented and at least 0.15dB performance loss is avoided.

Uloženo v:
Podrobná bibliografie
Vydáno v:2022 Asia Communications and Photonics Conference (ACP) s. 774 - 777
Hlavní autoři: Zhu, Miao, Wang, Liqian, Zhao, Yatong, Chen, Xue, Wang, Weiming, Tao, Kai, Shi, Yinlong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 05.11.2022
Témata:
Asia
Codes
Complexity theory
Encoding
linear complexity encoding
modified permutation algorithm
NB-QC-LDPC codes
Photonics
Simulation
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í:A modified permutation algorithm that optimizes the preprocessing step of the efficient encoding algorithm is proposed for nonbinary quasi-cyclic low-density parity-check (NB-QC-LDPC) codes. Linear complexity encoding is implemented and at least 0.15dB performance loss is avoided.
DOI:10.1109/ACP55869.2022.10088896