By combining an algebraic method and a random method, a hybrid method is proposed to construct LDPC codes, which can easily ensure the girth is at least six. The complexity of construction for the hybrid code is only ...
详细信息
ISBN:
(纸本)9781467318808
By combining an algebraic method and a random method, a hybrid method is proposed to construct LDPC codes, which can easily ensure the girth is at least six. The complexity of construction for the hybrid code is only a fraction of that for peg code, which facilitates the construction of long LDPC codes with very low density. Simulation results show that the hybrid code from EG-LDPC code and peg code has the identical error performance and convergence rate to the peg code with the same length.
Based on factor graph representation of EMU (Interleave Division Multiple-access) systems, an interleaver design criterion is proposed. The progressive edge growth (peg) algorithm proposed for LDPC codes is adapted to...
详细信息
ISBN:
(纸本)9781424410361
Based on factor graph representation of EMU (Interleave Division Multiple-access) systems, an interleaver design criterion is proposed. The progressive edge growth (peg) algorithm proposed for LDPC codes is adapted to multi-user interleavers pattern design. Simulation results show that the designed interleavers perform over random interleavers especially when the number of users is relative large.
Progressive edge-growth (peg) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths. A simple variation of the peg algorithm, linear-encoding peg (Lpeg) algorit...
详细信息
ISBN:
(纸本)9781424435746
Progressive edge-growth (peg) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths. A simple variation of the peg algorithm, linear-encoding peg (Lpeg) algorithm, can be applied to generate linear encodable LDPC codes. This paper presents a modified Lpeg algorithm to construct fast encodable LDPC codes with a certain girth constraint. The presented fast encodable LDPC codes facilitate the parallel encoding processes for parity bit generations. Therefore, their encoding time is much shorter than that of Lpeg codes.
暂无评论