Sciweavers

97 search results - page 5 / 20
» New Criteria for Iterative Decoding
Sort
View
TCOM
2010
111views more  TCOM 2010»
14 years 10 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. ...
TCOM
2010
133views more  TCOM 2010»
14 years 6 months ago
Low-complexity decoding for non-binary LDPC codes in high order fields
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
Adrian Voicila, David Declercq, François Ve...
ICC
2007
IEEE
15 years 6 months ago
Low-Complexity, Low-Memory EMS Algorithm for Non-Binary LDPC Codes
— In this paper, we propose a new implementation of the EMS decoder for non binary LDPC codes presented in [7]. A particularity of the new algorithm is that it takes into account...
Adrian Voicila, David Declercq, François Ve...
CORR
2006
Springer
94views Education» more  CORR 2006»
14 years 11 months ago
Single-Symbol-Decodable Differential Space-Time Modulation Based on QO-STBC
We show that Minimum-Decoding-Complexity QuasiOrthogonal Space-Time Block Code (MDC-QOSTBC) can be used to form a new differential space-time modulation (DSTM) scheme to provide f...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
TIT
2010
124views Education» more  TIT 2010»
14 years 6 months ago
Soft-input soft-output single tree-search sphere decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
Christoph Studer, Helmut Bölcskei