DocumentCode :
586684
Title :
An efficient method for computing the weight spectrum of LDPC convolutional codes constructed from quasi-cyclic codes
Author :
Hirotomo, Masanori ; Morii, Masakatu
Author_Institution :
Comput. & Network Center, Saga Univ., Saga, Japan
fYear :
2012
fDate :
28-31 Oct. 2012
Firstpage :
551
Lastpage :
555
Abstract :
In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes constructed from quasi-cyclic block codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as original codes, and apply a forward and backward tree search algorithm to the parity-check matrices of reduced memory. We show numerical results of computing the minimum free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.
Keywords :
convolutional codes; cyclic codes; matrix algebra; parity check codes; search problems; trees (mathematics); LDPC convolutional codes; backward tree search algorithm; low-part weight spectrum; parity-check matrices; quasicyclic block codes; Block codes; Convolutional codes; Educational institutions; Joining processes; Parity check codes; Polynomials; Random access memory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and its Applications (ISITA), 2012 International Symposium on
Conference_Location :
Honolulu, HI
Print_ISBN :
978-1-4673-2521-9
Type :
conf
Filename :
6400997
Link To Document :
بازگشت