This paper discusses the construction of the Accumulate-Repeat-4-Jagged-Accumulate(AR4JA) codes which is suitable for the deep-space communication based on the protograph. Two-step construction method of designing the AR4JA codes whose minimum distance grows linearly with block size, is proposed. Two-step expansion improves the traditional PEG with adding the ACE algorithm for placing edges in a protograph-based code, which brings down the error floor. Compared to the traditional random expansion and the one step expansion like Progressive Edge-Growth(PEG), the two-step construction algorithm aims at constructing the AR4JA codes with high performance and low complexity. Verified by the simulation, the BER performance of the two-step expansion method is similar to the ideal AR4JA codes in the deep space channel condition. With the same Eb/N0, the two-step construction method shows the lower BER than random construction method and one-step extension method through the simulation results.
[1]
Richard D. Wesel,et al.
Selective avoidance of cycles in irregular LDPC code construction
,
2004,
IEEE Transactions on Communications.
[2]
Dariush Divsalar,et al.
Construction of Protograph LDPC Codes with Linear Minimum Distance
,
2006,
2006 IEEE International Symposium on Information Theory.
[3]
Dariush Divsalar,et al.
Accumulate-Repeat-Accumulate Codes
,
2007,
IEEE Trans. Commun..
[4]
Aamod Khandekar,et al.
Irregular repeat accumulate codes for non-binary modulation schemes
,
2002,
Proceedings IEEE International Symposium on Information Theory,.
[5]
J. Thorpe.
Low-Density Parity-Check (LDPC) Codes Constructed from Protographs
,
2003
.