Sciweavers

13 search results - page 2 / 3
» Quantized LDPC decoder design for binary symmetric channels
Sort
View
JSAC
2008
78views more  JSAC 2008»
13 years 5 months ago
Joint iterative decoding of LDPC codes for channels with memory and erasure noise
This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are presented that achieve...
Henry D. Pfister, Paul H. Siegel
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 4 months ago
Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
Enrico Paolini, Gianluigi Liva, Michela Varrella, ...
TCOM
2010
111views more  TCOM 2010»
13 years 3 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
ESANN
2003
13 years 6 months ago
Robust Vector Quantization for Burst Error Channels Using Genetic Algorithm
This paper presents a novel vector quantizer (VQ) design algorithm for a burst error channel (BEC). The algorithm minimizes the average distortion when the BEC is in normal state o...
Wen-Jyi Hwang, Chien-Min Ou, Chin-Ming Yeh
ICC
2009
IEEE
135views Communications» more  ICC 2009»
13 years 3 months ago
A Discrete Channel Model for Capturing Memory and Soft-Decision Information: A Capacity Study
A discrete (binary-input 2q -ary output) communication channel with memory is introduced with the objective to judiciously capture both the statistical memory and the soft-decision...
Cecilio Pimentel, Fady Alajaji