573 search results - page 31 / 115 » Parallel Algorithms for Dandelion-Like Codes |
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
GLOBECOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— In forward error correction, convolutional turbo codes were introduced to increase error correction capability approaching the Shannon bound. Decoding of these codes, however, ...
SIPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Stochastic decoding is a new alternative method for low complexity decoding of error-correcting codes. This paper presents the first hardware architecture for stochastic decoding...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— In this paper, we propose a sub-operation parallelism optimization algorithm in SIMD processor synthesis. Given an initial assembly code and timing constraints, our alg...
ICS
2010
Tsinghua U.
15 years 2 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...