VLSI Implementation of LDPC Codes

作者: Soumya Ranjan Biswal

DOI:

关键词:

摘要: Coded modulation is a bandwidth-efficient scheme that integrates channel coding and into one single entity to improve performance with the same spectral efficiency compared uncoded modulation. Low-density parity-check (LDPC) codes are most powerful error correction (ECCs) approach Shannon limit, while having relatively low decoding complexity. Therefore, idea of combining LDPC has been widely considered. In this thesis we will consider as an Error Correcting Code study it’s BPSK system in AWGN environment different kind characteristics system. consists two parts Encoder Decoder. encoder encodes data sends it channel. The encoding depends on Parity matrix behavior which like Rate, Girth, Size Regularity. We according these find variation term SNR performance. decoder receives from decodes it. time iteration addition all parity check characteristics. also main objective implement FPGA. implementation done using Shift-Register based design reduce used decode information received message information. have Modified Sum Product (MSP) Algorithm decode, MSP some quantized values Look Up Table (LUT) approximation. Finally compare theoretical system’s FPGA implemented

参考文章(16)
Niclas Wiberg, Codes and Decoding on General Graphs Ph. D. dissertation, Linkoping Univ., Sweden. ,(1996)
Jorge Castiñeira Moreira, Patrick Guy Farrell, Essentials of Error-control Coding ,(2006)
David J. C. MacKay, Radford M. Neal, Good Codes Based on Very Sparse Matrices Proceedings of the 5th IMA Conference on Cryptography and Coding. pp. 100- 111 ,(1995) , 10.1007/3-540-60693-9_13
M.P.C. Fossorier, Quasicyclic low-density parity-check codes from circulant permutation matrices IEEE Transactions on Information Theory. ,vol. 50, pp. 1788- 1793 ,(2004) , 10.1109/TIT.2004.831841
N. Alon, M. Luby, A linear time erasure-resilient code with nearly optimal recovery IEEE Transactions on Information Theory. ,vol. 42, pp. 1732- 1736 ,(1996) , 10.1109/18.556669
S. Papaharalabos, P. Sweeney, B.G. Evans, P.T. Mathiopoulos, G. Albertazzi, A. Vanelli-Coralli, G.E. Corazza, Modified sum-product algorithms for decoding low-density parity-check codes Iet Communications. ,vol. 1, pp. 294- 300 ,(2007) , 10.1049/IET-COM:20060173
S. Myung, K. Yang, J. Kim, Quasi-cyclic LDPC codes for fast encoding IEEE Transactions on Information Theory. ,vol. 51, pp. 2894- 2901 ,(2005) , 10.1109/TIT.2005.851753
Y. Kou, S. Lin, M.P.C. Fossorier, Low-density parity-check codes based on finite geometries: a rediscovery and new results IEEE Transactions on Information Theory. ,vol. 47, pp. 2711- 2736 ,(2001) , 10.1109/18.959255
R. Tanner, A recursive approach to low complexity codes IEEE Transactions on Information Theory. ,vol. 27, pp. 533- 547 ,(1981) , 10.1109/TIT.1981.1056404
D.J.C. MacKay, Good error-correcting codes based on very sparse matrices international symposium on information theory. ,vol. 45, pp. 399- 431 ,(1997) , 10.1109/18.748992