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.

Saved in:
Bibliographic Details
Published in:2022 Asia Communications and Photonics Conference (ACP) pp. 774 - 777
Main Authors: Zhu, Miao, Wang, Liqian, Zhao, Yatong, Chen, Xue, Wang, Weiming, Tao, Kai, Shi, Yinlong
Format: Conference Proceeding
Language:English
Published: IEEE 05.11.2022
Subjects:
Asia
Codes
Complexity theory
Encoding
linear complexity encoding
modified permutation algorithm
NB-QC-LDPC codes
Photonics
Simulation
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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