Sciweavers

2621 search results - page 5 / 525
» Near orders and codes
Sort
View
VTC
2008
IEEE
120views Communications» more  VTC 2008»
14 years 2 months ago
Near-Capacity Iteratively Decoded Space-Time Block Coding
— Iteratively decoded near-capacity Space-Time Block Coding (STBC) schemes are designed. Recursive unity-rate codes and IRregular Convolutional Codes (IRCCs) are employed for ass...
Soon Xin Ng, Sushanta Das, Jin Wang, Lajos Hanzo
VTC
2008
IEEE
119views Communications» more  VTC 2008»
14 years 2 months ago
Near-Capacity Irregular Bit-Interleaved Coded Modulation
Abstract— An Irregular Bit-Interleaved Coded Modulation based Iterative Decoding (Ir-BICM-ID) aided scheme is proposed. The irregularity of the scheme pervades the three basic co...
Ronald Y. S. Tee, Robert G. Maunder, Jin Wang, Laj...
GLOBECOM
2008
IEEE
14 years 2 months ago
Rate Adaptive Binary Erasure Quantization with Dual Fountain Codes
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...
Dino Sejdinovic, Robert J. Piechocki, Angela Doufe...
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 8 months ago
A Combinatorial Family of Near Regular LDPC Codes
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandr...
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 8 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, ...