Integer linear programming based optimization of puncturing sequences for quasi-cyclic low-density parity-check codes
2010 (English)In: Proceedings of International Symposium on Turbo Codes and Iterative Information Processing, IEEE , 2010Conference paper (Refereed)
An optimization algorithm for the design of puncturing patterns for low-density parity-check codes is proposed. The algorithm is applied to the base matrix of a quasi-cyclic code, and is expanded for each block size used. Thus, storing puncturing patterns specific to each block size is not required. Using the optimization algorithm, the number of 1-step recoverable nodes in the base matrix is maximized. The obtained sequence is then used as a base to obtain longer puncturing sequences by a sequential increase of the allowed recovery delay. The proposed algorithm is compared to one previous greedy algorithm, and shows superior performance for high rates when the heuristics are applied to the base matrix in order to create block size-independent puncturing patterns.
Place, publisher, year, edition, pages
IEEE , 2010.
Other Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:liu:diva-65507DOI: 10.1109/ISTC.2010.5613847OAI: oai:DiVA.org:liu-65507DiVA: diva2:396045