Design of efficiently encodable rate-compatible LDPC codes using vandermonde extension matrices

Benmayor, D; Papaharalabos, S; Mathiopoulos, PT; Tsiropoula, G; Constantinou, P

dc.contributor.author	Benmayor, D	en
dc.contributor.author	Papaharalabos, S	en
dc.contributor.author	Mathiopoulos, PT	en
dc.contributor.author	Tsiropoula, G	en
dc.contributor.author	Constantinou, P	en
dc.date.accessioned	2014-03-01T02:01:57Z
dc.date.available	2014-03-01T02:01:57Z
dc.date.issued	2011	en
dc.identifier.issn	09296212	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/29272
dc.subject	Extending	en
dc.subject	Irregular repeat accumulate (IRA) codes	en
dc.subject	Low-complexity low-density parity-check (LDPC) codes	en
dc.subject	Rate-compatible (RC)	en
dc.subject	Vandermonde matrix (VM)	en
dc.subject.other	Extending	en
dc.subject.other	Irregular repeat-accumulate codes	en
dc.subject.other	Low-complexity	en
dc.subject.other	Rate-compatible	en
dc.subject.other	Vandermonde matrix	en
dc.subject.other	Algorithms	en
dc.subject.other	Codes (symbols)	en
dc.subject.other	Coding errors	en
dc.subject.other	Computational complexity	en
dc.subject.other	Error correction	en
dc.subject.other	Gaussian noise (electronic)	en
dc.subject.other	Optimal systems	en
dc.subject.other	Optimization	en
dc.subject.other	White noise	en
dc.subject.other	Bit error rate	en
dc.title	Design of efficiently encodable rate-compatible LDPC codes using vandermonde extension matrices	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s11277-010-9969-8	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s11277-010-9969-8	en
heal.publicationDate	2011	en
heal.abstract	Alow-complexity algorithm for the design of efficiently-encodable rate-compatible (RC) low-density parity-check (LDPC) codes by deterministically extending an irregular repeat-accumulate (IRA) is introduced. The extending structure is based on circulants shifted according a truncated Vandermonde matrix (VM) and therefore termed as ""extended VM"" (eVM). The novel extending algorithm is significantly less computationally complex than other known similar methods since it does not require any optimization of the extending profile or any post-construction girth conditioning. To improve the codes' properties and correcting capabilities in low code rate applications, the optimal proportions of degree-1 and degree-2 parity bits for the extended nodes are investigated and, in contrast to existing deterministic extending approaches for RC-IRA codes, an extending increment step equal to half the information block length is chosen. Various bit error rate (BER) and frame error rate (FER) have been obtained for different code rates, R, and information block length k0 = 512 and 1024 bits considering an additive white Gaussian noise (AWGN) channel. The results have demonstrated that the proposed eVM RC-LDPC codes, despite their very simple structure and very low computational complexity, exhibit excellent performance only slightly inferior to both dedicated IRA and previously known RC-IRA codes for different data block sizes. © Springer Science+Business Media, LLC. 2010.	en
heal.journalName	Wireless Personal Communications	en
dc.identifier.doi	10.1007/s11277-010-9969-8	en
dc.identifier.volume	60	en
dc.identifier.issue	4	en
dc.identifier.spage	695	en
dc.identifier.epage	708	en