An Empirical Comparison of Encoding Algorithms of the Low Density Parity Check Code for Decode and Forward Protocol Relay System

Abstract

Decode and a forward (DF) protocol relay technique in cooperative communication is becoming a more attractive method to achieve a higher throughput requirement for wireless communication these days. But the high complexity operation is a major issue in the DF protocol relay processing system. The encoding operation which is a pre-processing stage of the decoding process consumes high complexity in the DF protocol relay system. Thus, it is important to tackle the encoding operation to ensure low complexity and good performance of the subsequent decoding operation in the DF protocol relay system. Thus far, very limited works have been reported on identifying a suitable encoding algorithm of encoding operation for the DF protocol relay system using the Low Density Parity Check (LDPC) code. In this paper, we present a suitable encoding algorithm for the DF protocol relay system using the LDPC code. To find out the most suitable encoding algorithm for the DF protocol relay system using LDPC code, we introduce the LDPC code encoding model. Eight different encoding algorithms based on Lower Upper and Orthogonal Upper algorithms presented in the LDPC code encoding model. The encoding execution time, the number of nonzero, and the pattern of nonzero was used to evaluate the computational complexity performance of the designed LDPC code encoding model. The most suitable encoding algorithm for the required criteria of the DF protocol relay system using the LDPC code is identified.