ScholarLens Back to search
2004•Journal of Southwest Jiaotong UniversityRequires access

A Family of Irregular LDPC Codes Based on Optical Orthogonal Codes

Wen Hong

Open publisher page 0 citations

Abstract

Based on the optical orthogonal codes, a method for constructing irregular LDPC (low-density parity check) codes was presented. These LDPC codes are quasi-cyclic codes and can be encoded with low complexity with a linear relationship to code length. These codes have Tanner graphs free of 4-cycles. They perform well with the sum-product iterative decoding. Compared with random codes and regular LDPC codes based on the optical orthogonal codes with similar parameters, they have decoding performance gains respectively about 0.3 and 0.15 dB when bit error rate is 10~(-5).

About this research paper

What this paper is about

Based on the optical orthogonal codes, a method for constructing irregular LDPC (low-density parity check) codes was presented. These LDPC codes are quasi-cyclic codes and can be encoded with low complexity with a linear relationship to code length. These codes have Tanner graphs free of 4-cycles. They perform well with the sum-product iterative decoding. Compared with random codes and regular LDPC codes based on the optical orthogonal codes with similar parameters, they have decoding performance gains respectively about 0.3 and 0.15 dB when bit error rate is 10~(-5).

Why it matters

A significance statement is not available in the OpenAlex record.

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

Based on the optical orthogonal codes, a method for constructing irregular LDPC (low-density parity check) codes was presented. These LDPC codes are quasi-cyclic codes and can be encoded with low complexity with a linear relationship to code length. These codes have Tanner graphs free of 4-cycles. They perform well with the sum-product iterative decoding. Compared with random codes and regular LDPC codes based on the optical orthogonal codes with similar parameters, they have decoding performance gains respectively about 0.3 and 0.15 dB when bit error rate is 10~(-5).

Key concepts: Low-density parity-check code, Linear code, Concatenated error correction code, Block code, Serial concatenated convolutional codes, Turbo code, Tanner graph, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Family of Irregular LDPC Codes Based on Optical Orthogonal Codes — Research Paper | ScholarLens