DocumentCode :
3150552
Title :
The comparative analysis of LDPC and RS code
Author :
Xiao, Youan ; Luo, Chunling ; Yang, Chao
Author_Institution :
Wuhan Univ. of Technol., Wuhan, China
fYear :
2011
fDate :
16-18 April 2011
Firstpage :
4510
Lastpage :
4513
Abstract :
LDPC code and RS code are error-correcting codes which are researched much more at present, and in the two-dimensional bar code´s applications the error correction code plays an important role. In order to accurately identify the two-dimensional bar code, error-correcting code´s performance should be further enhanced. There is a simple introduction of the LDPC decoder based on BP algorithm and decoding algorithm for RS, and it gives MATLAB simulations in different iterations while in the same code length and code rate for LDPC code and RS code. Simulation results show that the greater the number of iterations the better the LDPC decoding performance, and the more errors can be rectified; based on the same code length and rate of the cases and less than 512 yards long, LDPC decoding performance is significantly higher than the RS code. It can be seen that LDPC code can do better than the RS codes on identifying two-dimensional bar code, and the information which we want can be reproduced clearly.
Keywords :
Reed-Solomon codes; error correction codes; mathematics computing; parity check codes; LDPC; MATLAB; RS code; Reed-Solomon codes; error-correcting codes; low density parity check codes; two-dimensional bar code; Decoding; Error correction codes; Iterative decoding; Polynomials; Signal to noise ratio; Simulation; BP algorithm; LDPC code; RS code; two-dimensional bar code;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Consumer Electronics, Communications and Networks (CECNet), 2011 International Conference on
Conference_Location :
XianNing
Print_ISBN :
978-1-61284-458-9
Type :
conf
DOI :
10.1109/CECNET.2011.5768345
Filename :
5768345
Link To Document :
بازگشت