DocumentCode :
2049857
Title :
A class of (3, k) quasi-cyclic LDPC codes from difference sequences with girth 8
Author :
Bing Li ; Lijun Zhang ; Lee Lung Cheng
Author_Institution :
Sch. of Electron. & Inf. Eng., Beijing Jiaotong Univ., Beijing, China
fYear :
2011
fDate :
27-30 Nov. 2011
Firstpage :
108
Lastpage :
113
Abstract :
An approach for constructing a class of (3, k)-regular quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed, which is based on combinatorial objects termed difference sequences. By an efficient algorithm for searching good difference sequences, codes in this class have girth at least eight. Simulation results show that the codes slightly outperform the counterpart PEG codes and have better performance than the corresponding MacKay codes and array codes.
Keywords :
cyclic codes; parity check codes; sequences; combinatorial object; difference sequences; girth 8; least eight; quasicyclic LDPC codes; regular quasicyclic low density parity check codes; difference sequences; girth; quasi-cyclic low-density parity-check codes;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Wireless, Mobile & Multimedia Networks (ICWMMN 2011), 4th IET International Conference on
Conference_Location :
Beijing
Electronic_ISBN :
978-1-84919-507-2
Type :
conf
DOI :
10.1049/cp.2011.0969
Filename :
6197836
Link To Document :
بازگشت