This paper proposes a new method for building low-density-parity-check codes, click here exempt of cycle of length 4, based on a circulant permutation matrix, which needs very little memory for storage it in the encoder and a dual diagonal structure is applied to guarantee that parity check bits can be recursively computed with linear calculation complexity.The Bit Error Rate performance of the new low-density-parity-check codes was compared us polo assn mens sweaters to the uncoded bi-phase-shift-keying over additive-white-gaussian-noise channel.This simulation shows that the proposed codes are very efficient over additive-white-gaussian-noise.
The proposed codes ensure a very low encoding complexity and reduce the memory storage required for the parity-check matrix, which can be more easily built than others codes used in channel coding.