Sciweavers

41 search results - page 6 / 9
» Turbo Codes in Binary Erasure Channel
Sort
View
VTC
2007
IEEE
106views Communications» more  VTC 2007»
15 years 4 months ago
Analysis and Design of Dirty Paper Coding by Transformation of Noise
— We design a coding scheme for Costa’s dirty paper coding (DPC) [6] using a channel and a shaping code. We show that by transforming the channel noise distribution the DPC cha...
Young-Seung Lee, Sae-Young Chung
TIT
2008
119views more  TIT 2008»
14 years 10 months ago
Bit-Level Equalization and Soft Detection for Gray-Coded Multilevel Modulation
This paper investigates iterative soft-in soft-out (SISO) detection in coded multiple access channels, with Gray-coded M-ary quadrature amplitude modulation (QAM) for the channel ...
Darryl Dexu Lin, Teng Joon Lim
TCOM
2010
122views more  TCOM 2010»
14 years 8 months ago
Simple capacity-achieving ensembles of rateless erasure-correcting codes
—This paper is concerned with a simple binary erasure-recovery coding scheme that falls into the family of socalled semi-random low-density-parity-check (SR-LDPC) codes. Based on...
Xiaojun Yuan, Rong Sun, Li Ping
CORR
2007
Springer
115views Education» more  CORR 2007»
14 years 10 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav
CISS
2008
IEEE
15 years 9 days ago
On the frame error rate of transmission schemes on quasi-static fading channels
It is known that the frame error rate of turbo codes on quasi-static fading channels can be accurately approximated using the convergence threshold of the corresponding iterative d...
Ioannis Chatzigeorgiou, Ian J. Wassell, Rolando A....