Authors: Li Peng Guangxi Zhu
Publish Date: 2006/01/01
Volume: 23, Issue: 1, Pages: 35-38
Abstract
This paper presents a matrix permuting approach to the construction of LowDensity ParityCheck LDPC code It investigates the structure of the sparse paritycheck matrix defined by Gallager It is discovered that the problem of constructing the sparse paritycheck matrix requires an algorithm that is efficient in search environments and also is able to work with constraint satisfaction problem The definition of Qmatrix is given and it is found that the queen algorithm enables to search the Qmatrix With properly permuting Qmatrix as submatrix the sparse paritycheck matrix which satisfied constraint condition is created and the good regularLDPC code that is called the Qmatrix LDPC code is generated The result of this paper is significant not only for designing low complexity encoder improving performance and reducing complexity of iterative decoding arithmetic but also for building practical system of encodable and decodable LDPC code
Keywords: