Abstract
This work investigated the performance of a newly developed protograph-based low-density parity-check code (LDPC) families belonging to accumulate-repeat-4-jagged-accumulate codes. The proposed code has hierarchical irregularity and quasi-cyclic property that retains it to be suitable for fast encoder and decoder implementation. The code used in this work is a rate-compatible linearly punctured code. The modified iterative decoding algorithm as mentioned in the literature is used along with a newly proposed encoder and simulation has been done for proposed LDPC coded orthogonal frequency division multiplexing (OFDM) link over wireless and optical wireless channels with hard- and soft-decision decoding. The code relates to new methods for designing rate-compatible families of protographs of different rates, all having the linear minimum distance property showing small performance degradation compared with the threshold. The parity-check matrix is composed of small identical modules to reduce the routing complexity of the decoder. The main essence of this code lies in the fact that LDPC codes of arbitrarily large size can be built by expanding from individual protographs or rate-compatible protograph families.
© 2015 Optical Society of America
Full Article | PDF ArticleMore Like This
Xiaole Sun, Ding Zou, Zhen Qu, and Ivan B. Djordjevic
Opt. Express 26(22) 29319-29329 (2018)
Ivan B. Djordjevic, Bane Vasic, and Mark A. Neifeld
Opt. Express 15(10) 6336-6350 (2007)
Hossein Pishro-Nik, Nazanin Rahnavard, Jeongseok Ha, Faramarz Fekri, and Ali Adibi
Appl. Opt. 42(5) 861-870 (2003)