Efficient Decoding for Low-Density Parity-Check Codes in Flash Channel
Flash channel is an important channel model that can be used to describe and evaluate the channel of non-volatile storage devices such as Flash memories.Bit Flipping(BF)is an important algorithm for decoding Low-Density Parity-Check(LDPC)codes in flash channel.Compared with Belief Propagation(BP)decoding methods of LDPC codes,the decoding complexity of BF algorithm is reduced at the expense of performance degradation.In order to tackle the problem,an improved BF decoding algorithm is proposed.The proposed algorithm introduces an additional term in the flipping rule of each bit in order to avoid repetitive bit flips.The value of the additional term is proportional to the number of BF in the iterative process.In order to verify the proposed algorithm,two LDPC codes are used in simulation.Results suggest that the Bit Error Rate(BER)of the proposed algorithm after decoding is lower than that of the BF algorithm at the expense of moderate complexity increase.In addition,extra operations are easy to implement,which suggests that the proposed algorithm is efficient for LDPC decoding in Flash channel.
万方数据
维普
