Partial Parallel Encoding and Algorithmic Construction of Non-Binary Structured IRA Codes

The non-binary(NB) Irregular Repeat Accumulate(IRA) codes, as a subclass of NB LDPC codes, potentially have an excellent error-correcting performance. They are also known to provide linear complexity of encoding, but the basic encoding method with the serial rate-1 accumulator significantly limits the encoder throughput. Then the objective of the research presented in this paper is to develop an encoding method pro- viding significantly increased throughput of an NB-IRA encoder altogether with a flexible code construction methods for the structured(S-NB-IRA) codes eligible for the proposed encoding method. For this purpose, we reformulate the classic encoding algorithm to fit into the partial parallel encoder architecture. We propose the S-NB-IRA encoder block diagram and show that its estimated throughput is proportional to the submatrix size of the parity check matrix, which guarantees a wide complexity- throughput tradeoff. Then, in order to facilitate the S-NB-IRA coding systems design, we present a computer search algorithm for the construction of good S-NB-IRA codes. The algorithm aims at optimizing the code graph topology along with selecting an appropriate non-binary elements in the parity check matrix. Numerical results show that the constructed S-NB-IRA codes significantly outperform the binary IRA and S-IRA codes, while their performance is similar to the best unstructured NB-LDPC codes.

Design of rate compatible punctured IRA codes for IR-HARQ schemes

An incremental redundancy hybrid automatic repeat- request （IR-HARQ）scheme based on irregular repeat-accumulate （IRA）codes is proposed. The design of rate compatible punctured IRA codes suitable for an IR-HARQ scheme is well formulated and efficiently solved by a linear-programming method, along with a one-dimensional approach for density evolution. Compared to IR-HARQ schemes based on turbo codes, simulation shows that the proposed IR-HARQ schemes based on IRA codes may achieve almost the same performance at a block size of 1 024, but better throughput at a block size of 4 096. The advantages of the proposed scheme in implementation, including decoding complexity and parallelism, make it more attractive in practice than the IR-HARQ schemes based on both turbo and LDPC codes.