Results 71 to 80 of about 3,425,848 (222)
Modified Welch Berlekamp Algorithm to Decode Reed Solomon Codes
In this paper, the Reed Solomon Code is decoded using the Welch-Berlekamp Algorithm. The RS Decoder is implemented using Hardware Description Language VHDL (VHSIC hardware Description Language) and simulated on Modelsim software.
Mahmudi Ali, Achmadi Sentot, Michael
doaj +1 more source
Code-Switching na Fala de Polono-Brasileiros de Áurea/RS
O presente estudo tem como objetivo perceber e descrever casos de code-switching na fala de polono-brasileiros do município de Áurea/RS, embasando teoricamente os exemplos de fala dos informantes com as ideias de Poplack (2004); Appel e Muysken (2005 ...
Marcelo Jacó Krug +2 more
doaj +1 more source
The Reed-Solomon encoders: Conventional versus Berlekamp's architecture [PDF]
Concatenated coding was adopted for interplanetary space missions. Concatenated coding was employed with a convolutional inner code and a Reed-Solomon (RS) outer code for spacecraft telemetry.
Lee, J. J., Perlman, M.
core +1 more source
Aberrant birds: five cases of progressive graying in southern brazil
The plumage of birds can exhibit various chromatic aberrations, with progressive graying being one example. This condition is characterized by the presence of randomly scattered white feathers, giving the bird a mottled appearance.
Fernanda Machado-Teixeira +1 more
doaj +1 more source
Fast decoding of a d(min) = 6 RS code [PDF]
A method for high speed decoding a d sub min = 6 Reed-Solomon (RS) code is presented. Properties of the two byte error correcting and three byte error detecting RS code are discussed. Decoding using a quadratic equation is shown. Theorems and concomitant
Costello, D. J., Jr., Deng, H.
core +1 more source
Suboptimal soft-decision decoding for some RS-codes
A novel soft-decision algorithm is presented for Reed-Solomon (RS) codes, based on the reordering of the symbols of the received word according to some measure of reliability. The simulation results show that improvements in coding gain of > 1 dB are possible when compared to similar decoding algorithms using unsorted received words.
Wesemeyer, S, Sweeney, P
openaire +2 more sources
The performance of $M$-ary orthogonal signaling schemes employing Reed–Solomon (RS) codes and redundant residue number system (RRNS) codes is investigated over frequency-selective Rayleigh fading channels.
Hanzo, L., Yang, L-L.
core
An Application of Polynomial on RS Codes
In this paper we discuss a class of codes called RS Codes are subset of BCH Code and linear block codes can be constructed to be multiple error-correcting. We use application of polynomial on RS Codes and apply them using Maple.
Weam Mohammed Ahmed Elhadi Hamid +1 more
openaire +1 more source
An extended d(min) = 4 RS code [PDF]
A minimum distance d sub m - 4 extended Reed - Solomon (RS) code over GF (2 to the b power) was constructed. This code is used to correct any single byte error and simultaneously detect any double byte error. Features of the code; including fast encoding
Costello, D. J., Jr., Deng, H.
core +1 more source
Performance-Complexity-Latency Trade-Offs of Concatenated RS-BCH Codes
Performance-complexity-latency trade-off curves for rate-0.88 concatenated outer Reed–Solomon codes and inner Chase-algorithm-based soft-decision Bose–Ray-Chaudhuri–Hocquenghem codes with PAM4 constellation using bit-interleaved coded modulation and multilevel coding coded modulation schemes over the AWGN channel are presented.
Alvin Y. Sukmadji, Frank R. Kschischang
openaire +4 more sources

