Article

Construction of multiple-rate LDPC codes using modified PEG

Tengfei ChuDepartment of Information Security, Tashkent University of Information Technologies, Tashkent, UzbekistanXueqin JiangDepartment of Cryptology and discrete mathematics, Tashkent University of Information Technologies, Tashkent, UzbekistanJia HouDepartment of Cryptology and discrete mathematics, Tashkent University of Information Technologies, Tashkent, UzbekistanHui-Ming WangLingjun Kong

2017en

ABI

Abstract

Progressive edge-growth (PEG) algorithm was proven to be a simple and effective approach to design good LDPC codes. However, the low-density parity-check (LDPC) constructed by PEG algorithm is of a single code rate. In this paper, we propose a modified PEG algorithm to construct multiple-rate LDPC codes, which is referred to as the multiple-rate PEG (MR-PEG) algorithm. The obtained LDPC codes with various code rates have the same blocklength and can share common hardware resources to reduce the implementation complexity. Simulation results show that the obtained codes outperform other multiple-rate LDPC codes constructed from random row-splitting operations.

Topics

Error Correcting Code Techniques Advanced Wireless Communication Techniques Cooperative Communication and Network Coding

Identifiers

DOI: 10.1109/wcsp.2017.8171095

Citations and references

Cited by 012 references

Metrics — AkademScholar · Coming soon