Generalized ACE constrained progressive edge-growth LDPC code design

Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке: https://open.uns.ac.rs/handle/123456789/12207

Назив:	Generalized ACE constrained progressive edge-growth LDPC code design
Аутори:	Vukobratović, Dejan Šenk, Vojin
Датум издавања:	1-јан-2008
Часопис:	IEEE Communications Letters
Сажетак:	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.
URI:	https://open.uns.ac.rs/handle/123456789/12207
ISSN:	10897798
DOI:	10.1109/LCOMM.2008.071457
Налази се у колекцијама:	FTN Publikacije/Publications