Title :
Efficient Ranking of Rate-Compatible Puncturing Patterns for a Given LDPC Code Matrix
Author :
Wu, Sissi X. ; Mow, Wai Ho
Author_Institution :
Dept. of Electron. & Comput. Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong, China
Abstract :
In this paper, we introduce a novel criterion to rank puncturing patterns for rate-compatible LDPC codes. Specifically, based on Gaussian approximation density evolution, a cost function is devised to characterize the degree distribution of the punctured code matrices, which are derived from a mother code matrix by matrix transformation. This cost function allows us to effectively compare the expected performance of candidate puncturing patterns and to sort out good ones. Combined with well-designed search algorithms, the proposed criterion can be applied on both standardized block-LDPC codes and generic binary LDPC codes to get good puncturing patterns with manageable complexity. Numerical simulation results verify the effectiveness of the proposed ranking criterion, and demonstrate that a series of good rate-compatible LDPC codes can be obtained by the proposed ranking criterion.
Keywords :
binary codes; block codes; matrix algebra; parity check codes; Gaussian approximation density evolution; LDPC code matrix; binary LDPC codes; block-LDPC codes; cost function; degree distribution; matrix transformation; punctured code matrices; rate-compatible LDPC codes; rate-compatible puncturing patterns; Algorithm design and analysis; Approximation algorithms; Cost function; Encoding; Gaussian approximation; Iterative decoding; Linear matrix inequalities; Matrix decomposition; Numerical simulation; Parity check codes;
Conference_Titel :
Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE
Conference_Location :
Honolulu, HI
Print_ISBN :
978-1-4244-4148-8
DOI :
10.1109/GLOCOM.2009.5425627