Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/12207
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vukobratović, Dejan | en |
dc.contributor.author | Šenk, Vojin | en |
dc.date.accessioned | 2020-03-03T14:47:35Z | - |
dc.date.available | 2020-03-03T14:47:35Z | - |
dc.date.issued | 2008-01-01 | en |
dc.identifier.issn | 10897798 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/12207 | - |
dc.description.abstract | In 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.ispartof | IEEE Communications Letters | en |
dc.title | Generalized ACE constrained progressive edge-growth LDPC code design | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.1109/LCOMM.2008.071457 | en |
dc.identifier.scopus | 2-s2.0-39549120408 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/39549120408 | en |
dc.relation.lastpage | 34 | en |
dc.relation.firstpage | 32 | en |
dc.relation.issue | 1 | en |
dc.relation.volume | 12 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Fakultet tehničkih nauka, Departman za energetiku, elektroniku i telekomunikacije | - |
crisitem.author.dept | Fakultet tehničkih nauka, Departman za energetiku, elektroniku i telekomunikacije | - |
crisitem.author.parentorg | Fakultet tehničkih nauka | - |
crisitem.author.parentorg | Fakultet tehničkih nauka | - |
Appears in Collections: | FTN Publikacije/Publications |
SCOPUSTM
Citations
58
checked on May 10, 2024
Page view(s)
30
Last Week
1
1
Last month
1
1
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.