Sciweavers

17 search results - page 2 / 4
» Sum-Product Decoding of BCH Codes
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 17 days ago
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
Davide Schipani, Michele Elia, Joachim Rosenthal
CORR
2006
Springer
163views Education» more  CORR 2006»
13 years 5 months ago
Finding roots of polynomials over finite fields
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
ICCD
2006
IEEE
275views Hardware» more  ICCD 2006»
14 years 2 months ago
Split-Row: A Reduced Complexity, High Throughput LDPC Decoder Architecture
— A reduced complexity LDPC decoding method is presented that dramatically reduces wire interconnect complexity, which is a major issue in LDPC decoders. The proposed Split-Row m...
Tinoosh Mohsenin, Bevan M. Baas
JSAC
2010
180views more  JSAC 2010»
13 years 10 days ago
List Decoding Techniques for Intersymbol Interference Channels Using Ordered Statistics
In this paper, we present a generalization of the ordered statistics decoding (OSD) techniques for the class of intersymbol interference (ISI) channels, and show decoding results f...
Fabian Lim, Aleksandar Kavcic, Marc P. C. Fossorie...
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 15 days ago
The E8 Lattice and Error Correction in Multi-Level Flash Memory
A construction using the E8 lattice and Reed-Solomon codes for error-correction in flash memory is given. Since E8 lattice decoding errors are bursty, a Reed-Solomon code over GF(2...
Brian M. Kurkoski