15 search results - page 1 / 3 » On Low-Complexity Maximum-Likelihood Decoding of Convolution... |
68
Voted
TIT
2008
14 years 10 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
98
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— This paper presents a low complexity iteratively detected space-time transmission architecture based on Generalized Layered Space-Time (GLST) codes and IRregular Convol...
119
Voted
ETT
2000
14 years 10 months ago
2000
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
98
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
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...