Iterative Decoding of Serially Concatenated Arithmetic and Channel Codes With JPEG 2000 Applications

2007 ◽  
Vol 16 (6) ◽  
pp. 1557-1567 ◽  
Author(s):  
Marco Grangetto ◽  
Bartolo Scanavino ◽  
Gabriella Olmo ◽  
Sergio Benedetto
2021 ◽  
Author(s):  
Weilong Dou ◽  
Ming-Min Zhao ◽  
Ming Lei ◽  
Min-Jian Zhao

2016 ◽  
Vol 10 ◽  
pp. 2179-2188 ◽  
Author(s):  
Fouad Ayoub ◽  
Abderrazak Farchane ◽  
Askali Mohamed ◽  
Mostafa Belkasmi ◽  
Mohammed Majid Himmi

2012 ◽  
Vol 532-533 ◽  
pp. 1135-1139
Author(s):  
Dan Hu

Low-Density Parity-Check(LDPC) codes are a class of channel codes based on matrix encoding and iterative decoding. It has low decoding complexity as well as capacity approaching performance. Until now, the best designed LDPC codes can achieve the performance within only 0.0045dB of the Shannon limit. With the in-depth study, the encoding complexity of LDPC codes is not a difficult problem for application any more. Today, we can see LDPC codes widely used in many practical systems, such as wireless communication system, deep-space communication system, optical-fiber communication system and media storage system. This thesis first introduces the development of channel coding, and then the basic principles and concepts of LDPC codes. The following parts discuss several techniques of LDPC codes, including the construction methods of low-density parity matrix, the iterative decoding algorithms and performance analysis methods. Besides, we propose our opinions and our improved algorithms.


Sign in / Sign up

Export Citation Format

Share Document