Novel code-construction of high rate (3, k) regular LDPC codes

Anggraeni, S. and Jeoti, V. (2010) Novel code-construction of high rate (3, k) regular LDPC codes. In: UNSPECIFIED.

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

This paper proposes a novel code-construction method for constructing (3, k) regular low density parity check (LDPC) codes. Other methods of designing regular LDPC codes suffer from rank-deficiency of H and high encoding complexity. The basic design of the proposed code-construction utilizes deterministic base matrices of information part and parity part in three stages of code-construction to achieve no rank-deficiency of H, no girth of 4-cycles, non-singular parity part (Hpar) and low encoding complexity. It is shown that the proposed (3, k) regular LDPC codes perform better in high code rate application. The result of (3, 42) regular code performs 0.97 dB from Shannon limit at BER 10-6 when the value of code rate R = 0.928, code length N = 14364 and encoding complexity of the order of O(1.0225 N).

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: cited By 0; Conference of 2010 International Conference on Intelligent and Advanced Systems, ICIAS 2010 ; Conference Date: 15 June 2010 Through 17 June 2010; Conference Code:84196
Uncontrolled Keywords: Encoding complexity; Low density parity check; Non-singular parity part; Rank-deficiency of H; Regular LDPC, Encoding (symbols), Error correction
Depositing User: Mr Ahmad Suhairi UTP
Date Deposited: 09 Nov 2023 15:49
Last Modified: 09 Nov 2023 15:49
URI: https://khub.utp.edu.my/scholars/id/eprint/896

Actions (login required)

View Item
View Item