2013•Unpublished venueRequires access

Short-block LDPC codes design with semi-random parity-check matrix

Qingshuang Zhang, Aijun Liu, Jingbo Mao

Open publisher page 1 citations

Abstract

In this paper, we propose a design method for short block length low-density parity-check (LDPC) codes which use the structure of semi-random parity-check matrix and the optimal degree distribution pairs derived from density evolution algorithm. Simulation results show that the bit error performance of the designed code is better than Turbo codes with the same block length and code rate when Signal Noise Ratio (SNR) exceeds 2.5dB. At the same time, the complexity of decoder is lower than that of Turbo codes. This design method provides guiding significance for choosing an error-correcting code for reliable communication in narrow-band channel.

About this research paper

What this paper is about

In this paper, we propose a design method for short block length low-density parity-check (LDPC) codes which use the structure of semi-random parity-check matrix and the optimal degree distribution pairs derived from density evolution algorithm. Simulation results show that the bit error performance of the designed code is better than Turbo codes with the same block length and code rate when Signal Noise Ratio (SNR) exceeds 2.5dB. At the same time, the complexity of decoder is lower than that of Turbo codes. This design method provides guiding significance for choosing an error-correcting code for reliable communication in narrow-band channel.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we propose a design method for short block length low-density parity-check (LDPC) codes which use the structure of semi-random parity-check matrix and the optimal degree distribution pairs derived from density evolution algorithm. Simulation results show that the bit error performance of the designed code is better than Turbo codes with the same block length and code rate when Signal Noise Ratio (SNR) exceeds 2.5dB. At the same time, the complexity of decoder is lower than that of Turbo codes. This design method provides guiding significance for choosing an error-correcting code for reliable communication in narrow-band channel.

Key concepts: Low-density parity-check code, Turbo code, Serial concatenated convolutional codes, Algorithm, Concatenated error correction code, Computer science, Parity-check matrix, Block code

Related papers

Back to paper searchBrowse research topicsOriginal source
Short-block LDPC codes design with semi-random parity-check matrix — Research Paper | ScholarLens