A study of Finite Field -based Quasi-cyclic LDPC Codes over Markov Gaussian Channels

• Main Authors: Jyun-Yi Lin, 林峻毅
• Other Authors: Der-Feng Tseng
• Format: Others
• Language: zh-TW
• Published: 2018
• Online Access: http://ndltd.ncl.edu.tw/handle/66k6c2

碩士 === 國立臺灣科技大學 === 電機工程系 === 106 === In this paper, we study the performance of LDPC code which have different Coding rate over Markov-Gaussian channels. We construct parity check matrices base on subgroups of a finite field, and its matrix is a quasi-cyclic form. And simulation in different channel environment. LDPC code which based on finite fields perform well over the binary-input AWGN channel. Most importantly, these finite-field LDPC codes were shown to have low error floors, which is important for communication and data-storage systems. Most of the LDPC code constructions base on finite fields are quasi-cyclic and hence they can be efficiently encoded using simple shift-registers[1] with linear complexity[2]. In the wired and wireless communication systems Impulse noise is a important issue . The common impulse noise models. they are memoryless, which mean that their occurrences are random. However, they can’t describe the characteristics of the real channel. A memory channel such as Markov-Gaussian is introduced to address the characteristics of the real channel. To address the impulsive noise, QC-LDPC base on finite field is used in this paper to combine the maximum a posteriori (MAP) Estimation for channel estimation and use the SPA algorithm to reduce the bit error rate.