An Empirical Comparison of Encoding Algorithms of the Low Density Parity Check Code for Decode and Forward Protocol Rela
- PDF / 2,964,850 Bytes
- 20 Pages / 439.37 x 666.142 pts Page_size
- 111 Downloads / 187 Views
An Empirical Comparison of Encoding Algorithms of the Low Density Parity Check Code for Decode and Forward Protocol Relay System S. Jamaah1 · Z. Hushairi1 · O. Al‑Khalid1 · A. H. Khairuddin1 Accepted: 5 November 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
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. Keywords Cooperative communication · Decode and forward · Execution time · LDPC code · LU algorithm · QR algorithm
* S. Jamaah [email protected] Z. Hushairi [email protected] O. Al‑Khalid [email protected] A. H. Khairuddin [email protected] 1
Faculty of Engineering, University Malaysia Sarawak, Kota Samarahan, Kuching, Sarawak, Malaysia
13
Vol.:(0123456789)
S. Jamaah et al.
1 Introduction Cooperative communication is one of the techniques that has been introduced in Long Term Evolution-Advanced (LTE-Advanced) as a new generation main technology operational in wireless communication systems [1]. A key aspect of cooperative communication is the processing of the signal received from the base station to the relay. DF protocol was one of the cooperative relay technologies exist that can produce higher throughput and better error rate performance [2]. LDPC codes are implemented well into the DF protocol system for its capability of achieving a significant fraction of channel capacity at a moderate implementation effort [3]. In 1962, Gallager developed the LDPC code. He explored on designing the regular LDPC code and introduced iterative decoding algorithms. From his research, the finding showed that LDPC codes are able in achieving channel capac
Data Loading...
