A comprehensive review of parallel concatenation of LDPC code techniques
| Autor: | A M Harisha, Bangalore Vivarttana Technologies, S Chaitra, S Mallikarjunaswamy, V Rekha, H N Mahendra, N Sharmila, T A Madhu |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Indian Journal of Science and Technology. 14:432-444 |
| ISSN: | 0974-5645 0974-6846 |
| DOI: | 10.17485/ijst/v14i5.2171 |
| Popis: | Objective: In the code theory, parallel concatenation of codes becomes more popular after the introduction of turbo codes. In recent years, the Low Density Parity Check (LDPC) code has found remarkable advancement and has seen them outshine turbo codes in terms of performance especially in the error floor and higher code rate. The main objective of this paper is to address the various techniques of a parallel concatenation of LDPC code in code theory. Method/Finding: To reduce the complexity of encoding and decoding for longer codes various parallel concatenation of LDPC coding methods were introduced and the performance was compared with other work. Novelty: When a longer block length is used, the parallel LDPC decoder is suffered from the complexity of prohibitive implementation. To overcome this issue and to achieve the best performance for longer codes, the different methods for parallel concatenation of LDPC codes were introduced with reduced complexity. This will helps to break the long and complex LDPC code into less complex and smaller LDPC to distribute the decoding and encoding load. Also, this will provides scalability and scope for improving the performance of LDPC codes in practical delay-sensitive and energy-aware applications. Keywords: Parallel concatenation; LowDensity ParityCheck (LDPC); turbo codes; Parallel Concatenated Gallager Codes (PCGC) |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|