Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/35216
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMalema, G.-
dc.contributor.authorLiebelt, M.-
dc.contributor.editorYuan, B.-
dc.date.issued2006-
dc.identifier.citationProceedings of the Eighth International Conference on Signal Processing, 2006, Beijing, China / vol. 3 [CDROM]-
dc.identifier.isbn0780397371-
dc.identifier.isbn9780780397378-
dc.identifier.issn2164-5221-
dc.identifier.urihttp://hdl.handle.net/2440/35216-
dc.description© Copyright 2006 IEEE-
dc.description.abstractIn this paper a modified bit-filling algorithm is used for constructing column-weight two quasi-cyclic low-density parity-check codes with large girths. Code rows are divided into groups. A column is connected to two rows from different groups, which are apart by at least a specified minimum length. Rows that meet the minimum length are searched sequentially. Group rows are connected to consecutive columns resulting in a cyclic structure in the code matrix. Larger codes can be obtained by using larger row groups. Compared to other methods, the algorithm provides an easy and fast way to construct codes of a wide range of rates, girths and lengths. Constructed codes show good bit error rate performance. They are also easily implementable in hardware compared to those obtained using the original bit filling algorithm.-
dc.language.isoen-
dc.publisherIEEE-
dc.relation.ispartofseriesInternational Conference on Signal Processing-
dc.titleVery large girth column-weight two quasi-cyclic LDPC codes-
dc.typeConference paper-
dc.contributor.conferenceInternational Conference on Signal Processing (8th : 2006 : Beijing, China)-
dc.identifier.doi10.1109/ICOSP.2006.345788-
dc.publisher.placeCDROM-
pubs.publication-statusPublished-
dc.identifier.orcidLiebelt, M. [0000-0001-6610-2876]-
Appears in Collections:Aurora harvest
Electrical and Electronic Engineering publications
Environment Institute publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.