A study of Finite Field -based Quasi-cyclic LDPC Codes over Markov Gaussian Channels
碩士 === 國立臺灣科技大學 === 電機工程系 === 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 channe...
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 |
Similar Items
-
On the equivalence of cyclic and quasi-cyclic codes over finite fields
by: Kenza Guenda, et al.
Published: (2017-07-01) -
A study of Euclidean Geometry-based Quasi-cyclic LDPC Codes over Memory Impulse Channels
by: CHANG-YAO XIAO, et al.
Published: (2018) -
Studies on Quasi-Cyclic LDPC Codes and the Performance over Optical CDMA Networks
by: Chun-Ming Huang, et al.
Published: (2009) -
Decoding LDPC Convolutional Codes on Markov Channels
by: Chris Winstead, et al.
Published: (2008-04-01) -
Decoding LDPC Convolutional Codes on Markov Channels
by: Kashyap Manohar, et al.
Published: (2008-01-01)