Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/12207
DC FieldValueLanguage
dc.contributor.authorVukobratović, Dejanen
dc.contributor.authorŠenk, Vojinen
dc.date.accessioned2020-03-03T14:47:35Z-
dc.date.available2020-03-03T14:47:35Z-
dc.date.issued2008-01-01en
dc.identifier.issn10897798en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/12207-
dc.description.abstractIn this letter, we propose a generalization of the Progressive Edge-Growth (PEG) algorithm with the aim of designing LDPC code graphs with substantially improved Approximated Cycle Extrinsic Message Degree (ACE) properties. The proposed realization of generalized PEG algorithm outperforms original PEG algorithm and its subsequent modification proposed by Xiao and Banihashemi. © 2008 IEEE.en
dc.relation.ispartofIEEE Communications Lettersen
dc.titleGeneralized ACE constrained progressive edge-growth LDPC code designen
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.1109/LCOMM.2008.071457en
dc.identifier.scopus2-s2.0-39549120408en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/39549120408en
dc.relation.lastpage34en
dc.relation.firstpage32en
dc.relation.issue1en
dc.relation.volume12en
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.deptFakultet tehničkih nauka, Departman za energetiku, elektroniku i telekomunikacije-
crisitem.author.deptFakultet tehničkih nauka, Departman za energetiku, elektroniku i telekomunikacije-
crisitem.author.parentorgFakultet tehničkih nauka-
crisitem.author.parentorgFakultet tehničkih nauka-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

58
checked on May 10, 2024

Page view(s)

30
Last Week
1
Last month
1
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


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