Comparison of Various Decoding Algorithms for EG-Low Density Parity Check Codes
The latest advancements in low-density parity-check (LDPC) codes have been resulted in reducing the decoding complexity. Hence, these codes have excelled over turbo codes, BCH codes, and linear block codes in terms of evaluating the performance in higher
- PDF / 339,117 Bytes
- 9 Pages / 439.37 x 666.142 pts Page_size
- 21 Downloads / 175 Views
Abstract he latest advancements in low-density parity-check (LDPC) codes have been resulted in reducing the decoding complexity. Hence, these codes have excelled over turbo codes, BCH codes, and linear block codes in terms of evaluating the performance in higher decoding rate; hence, these decodable codes are the trending topic in coding theory of signals. Construction of LDPC codes is being elaborated in this proposed paper which further helps to study decoding and encoding of these binary and non-binary low-density parity-check codes, respectively. In this proposed design architecture, we have considered the SBF and MLDD algorithms employed here utilize reliability estimation to improve error performance and it has advantages over bit flipping (BF) algorithms. This algorithm can be improved with still more security level by having a trade-off between performance and data transmission. It can also be enhanced by implementing it in real-time applications for data decoding and correction, for smaller-size datum. Keywords LDPC codes SBF MLDD
Decoding algorithm Shannon limit Delay
1 Introduction For error-free transmission of data from source to its destination over a noisy channel, error coding is needed. Error coding uses mathematical formulae to encode the data for error-free transmission and the resultant code word is decoded at the J. Chinna Babu (&) JNTUA, Anantapur, Andhra Pradesh, India e-mail: [email protected] C. Chinnapu Reddy O/o CTE, SPFU AP, TEQIP-II, Vijayawada, Andhra Pradesh, India e-mail: [email protected] M.N. Giri Prasad Department of ECE, JNTUA, Anantapur, Andhra Pradesh, India e-mail: [email protected] © Springer Nature Singapore Pte Ltd. 2018 A. Konkani et al. (eds.), Advances in Systems, Control and Automation, Lecture Notes in Electrical Engineering 442, https://doi.org/10.1007/978-981-10-4762-6_58
605
606
J. Chinna Babu et al.
receiver to obtain the relevant information. Various error decoding schemes are selected, depends on the occurance of error types. Based on the rate of occurance of errors, we may consider the communication channel. This Channel deals that, whether the data retransmission is possible or not [1]. LDPC codes are the linear error decoding and correcting codes, where LDPC codes represent low-density parity-check codes. Here, the term ‘low density’ replies to one of the characteristic parity-check matrix H, which may contain only few numbers of ones in comparison with zeros. These low-density parity-check codes are undoubtedly the best error detection and correction codes in existence at present scenario. The parity data or redundant data is added to the original message so that the original message can be decoded at the receiver end without the need for the data retransmission and also the errors can be detected and corrected if any errors are present. Such codes are called error-correcting codes (ECCs) or forward error-correcting codes (FECs) [2–4]. Error-correcting codes are usually classified as two types: • Convolution codes: The codes whi
Data Loading...
