I have several doubts about this coded forms.
It is known that Reed-Solomon is a good code agains burns errors.
Also, it is known that Concatenated Reed-Solomon and convolutional coding
with interlaving run very cool.
But i want compare only a simple Reed-Solomon versus a Convolutional
c...
Hi!!!!!!!!!!!!!!!!
I am a Engineering Student and i am making a Reed Solomon Codec that
will encode any file and the decoder will fix errors introduced in the
file. The decoder will be able to fix upto 16 symbol errors.
I need Detailed Theory on Reed Solomon Encoders and Decoders. I will
have...
Hi There,
I am a bit confused. If I recall correctly, I have read/learned that
any submatrix of a generator matrix is invertible. If one considers
the non-systematic Reed-Solomon code generated by a Vandermonde matrix,
this is true.
However, if one considers the "Reed-Solomon" code genera...
I use Maple to construct the binary code for a Reed Solomon RS(n,k). I use
the construction from this website, omitting all the steps after the
construction.
http://www.mapleprimes.com/blog/dcasimir/reed-solomon-error-correcting-code
.
So, basically, i get a code for RS(2^n - 1, t) code. I pre-a...
Hi all,
I'd like to announce that the open source Schifra C++
Reed-Solomon error correcting code library is now
available and awaiting your download.
What is it?
Schifra is a very robust, highly optimized and extremely
configurable Reed-Solomon error correcting code library
implemented ...
Hi,
I have worked a bit on Reed-Solomon codes over GF(2^m).
However, a co-student of mine asked me to help him with a Reed-Solomon
code over GF(3^2).
I have two questions:
How do I construct the field GF(3^2)? With a GF(2^m) field it is
quite easy. You derive the field using a primitiv...
Hi all,
I am doing some research on implementing Reed-Solomon Codes and would like
to read some information about the computational complexity in implementing
Reed-Solomon Codes.
Could anyone site some nice references to reed about this.
I would like to know the details of the number of mul...
Hi,
In [1], a decoding algorithm for errors and erasures for Reed-Solomon
codes is briefly stated. The algorithm uses the Massey-Berlekamp
algorithm to find the error-locators, and Forney's algorithm to find
the values of the errors and erasures.
However, the decoding algorithm is for the ...
"reedsolomon" wrote in message
news:frSdnROhUP8aevTZRVn-ig@giganews.com...
> Hi,
>
> Is anyone out there aware of any implementations (C/MATLAB) of Soft
> Decision Decoding for Reed Solomon, that I could use for research work?
>
> Thanks alot
> RS.
>
>
I would figure that...
Hi All,
I want to use the Reed Solomon (255,247) codedec from :
http://www.humanistic.org/~hendrik/reed-solomon/index.html
My question is about the polynomial generator that is used to build the
encoder of RS (255,247) codec.
as the literature says, g(x) is calculated like this :
g(x) = (x- a^...
Hi all,
please i need a matlab code related to the concatenation between
convolutionnel code and reed solomon, please could you help me in this
topic,
i am waiting to your help ,
regards!
...
Hello,
I am trying to implement a COFDM System which has an IFFT/FFT length
of 64. Out of 64 carriers, 8 are set aside for nulls and pilots (56
remaining).
So, out of Reed Solomon encoder I want to get 56 bits which will
then be convolutionally encoded and modulated using QPSK before
...
Hello:
I had a query regarding the encoder transmission format order at the
Reed-Solomon encoder output for the commercial standards such as
European DVB, North American ATSC/ITU-J83 standards etc.
For a RS (n,k) code, if the message polynomial is :
m(x)=m(0)+m(1)*x+m(2)*x^2+......+m(k-1)*x^(...
Hi,
I need an algorithm for decoding errors-and-erasures of Reed-Solomon
codes. Can anyone recommend literature (books and/or articles) that
explains such an algorithm which is also quite easy to implement? (I
am still trying to get the algorithm working given in "A new decoding
algorithm f...
Hello
I wanted to know the difference that can exist between(among) a flow of
bits that goes out of a decodificador viterbi + Reed solomon and the flow
of bits originally in a transmission of tdt cofdm
That is to say: do I obtain the same result to the exit of the corrector
Reed Solomon with ...
Hi all,
What does the reed solomon decoder outputs in the case when we have
more than "t" errors to correct?
Does he correct some errors and leave other errors as they came, or he
will correct any thing (i.e the data that was in the input will appear
in the output)?
Thanks in advance!
...
Hello Patrick,
we have it on Blackfin DSP.
if you want we can port it on 2191 as well for you.
Kind Regards
jk@epigon.co.in
Patrick wrote:
> Hello,
>
> I'm looking for a Reed Solomon Decoder with RS(204,188) GF(256)
>
> I would like to have a 500 kB/s on a 16 bit 160 MHz ADSP-2191...
Hi,
I work out a method soft decision decoding of Reed-Solomon codes.
Somebody is known on this method or has some information on this theme?
I will very grateful for every help.
Regards. Wojtek Lach
...
Hi all, I would like to have your opignon, which transform is better :
Z-transform or Fourier transform for implementation of reed solomon
codec? if it will be implemented on a DSP processor,
what would be the performance? will I get a high speed with Z-
transform or Fourier transform ?
Thanks
...
Hi--
I'm having difficulty getting the same results as the Reed-Solomon encoded
test vectors provided in the 802.16 standard. The systematic part is fine,
the problem is with the parity bits. I'm using Matlab to simulate the RS
encoding (using rsenc). Anybody has had a similar problem? Any Ma...
Hi All,
I'm have just been asked to try and implement a Matlab version of
encoding for the Reed Solomon algorithm. I have done some research and
have found information, but I think I am still missin one piece to the
puzzle. I have an array of 1115 bytes that I am trying to encode with the
(255,...
Hi all, In designing a reed-solomon code, one has to choose the appropriate
code size. If the constraint is computational complexity and delay, is it
better to use a large block size, or use several numbers of small blocks?
In other words, for RS(n,k), is it computationally more efficient to have
n=...
Hi:
I am a newbie on Reed-Solomon coding, and I was wondering what happens
when the received message has more errors than the error correcting
capacity 2t. I would say that the decoding fails completely, but I am not
sure.
Could anybody explain this to me?, is there anyway to prevent my decodin...
Hi All
I want to simulate Reed Solomon code with code rate 1/2 to compare rate
1/2 convolution code, I know that rate 1/2 RS will perform better.
So far I was using RS code of polynomial [255 239];
Can anybody please tell me how to simulate rate 1/2 code?
Your help will be appreciated.
...
Hi,
Two traditional ways to decode Reed-Solomon codes include the
Massey-Berlekamp and Euclidean decoding algorithms.
Can someone please explain the underlying theory on which the
Euclidean algorithm is based, or perhaps give some pointers in
literature where it is covered?
Does it have ...
Hi,
According to the RTCA's VDL mode specifications for
reed-solomon (which btw is the same as the CCSDS),
for messages less than NN (code length) padding of 0
bytes has to be appiled.
The padding is not transmitted, however at the reciever
it is reapplied, my question is that along wi...
Hello,
I am new to Reed Solomon coding theory. Can anybody help me on the
following issues:
1. How to compute Generator matrix for RS code over binary field ?
2. What are the ways for decoding a received binary pattern (length n) to a
RS code [say, k is given]?
3. How can a binary pattern...
Hello all,
I am Amit Gupta, I have implemented Reed Solomon decoder
RS(255,191) in Verilog, But to make confirm that i have implemented all
the block correct I need C code, Because i have not implemented all the
blocks till now, they are in progress. But to know which block is giving
Er...
Hello,
I'm interested in using RS- Reed solomon codes with erasures.
I know the RS code can correct 2g+e=n-k, where g is erasure and e is
error.
My system can find the erasures with high probability.
My question is, if the system can detect X erasures but 50% of them are
correct.
Meaning ...
Does any one know of any research which attempts to analytically determine
the the binary codeword subspace (BCH code) of a Reed-Solomon code, that is
the binary vector subspace of a subspace of GF(2^m - 1)^n?
--
% Randy Yates % "My Shangri-la has gone away, fading like
%% F...
Hello People
I want to compare Reed Solomon code [255,239] and rate 1/2 convolution
code with constraint length 5, i.e. generator polynomials are [23 35]_8;
Now, my channel is frequency selective, doppler effect and noise.
Also the way I am scaling the noise is
sigma=sqrt(0.5*Eb/(Rc*snr...
Hi,
I am trying to use the Reed-Solomon encoder in the Matlab Communications
toolbox ( command rsenc). For example if you are trying to a (7,3) R-S
encoder. When you use rsenc the inputs and outputs have are alphabets in
the respective Galois fields ( GF(8) in this example). Is there a way to
c...
Hi!!!
Can somebody Please provide me with a reliable source for studding and
implementing a Reed Solomon Decoder capable of correcting Erasures?
I have already implemented the syndrome detector, the Erasure
Polynomial, Berlekamp Massey Algorithm and the program (written in C
using VC++) ...
Hi All
I would be very thankful if you could verify the result that I have got.
System-1: BPSK, AWGN, Reed Solomon Code (255,127) i.e. rate 0.5
Result: At 0 dB the BER is 0.17 and at 5.5 dB BER is 0.003
System-2: BPSK, AWGN, Reed Solomon Code (255,239) 1.e. rate 0.93
Result: At 0 dB the B...
Hi Guys,
I am hoping someone in this group would be able to answer this
question. I am working on a Reed-Solomon decoder for WiMAX
802.16-2004. Its a RS(255,239,T=8) code.
The generator polynomial is g(x) = (x + a^0)(x + a^1)(x + a^2) ...(x
+ a^(2T-1))
You'll notice that the first root of g(x...
I have a question about key eqation solver when supporting erasure in
reed solomon
B(x) = erasure locator polynomial
S(x) = syndrom polynomial
ELP(x) = error locator plonomial
Z(x) = value polynomial
key equation solver is :
ELP(x). B(x). S(x) = Z(x) mod X^2t
if T(x) = B(x). S(x)] mode...
So I've got a Reed-Solomon codec that will work for a range of code
parameters, and I'm looking to extend it (or at least use it as a starting
point) for a binary BCH decoder that is similarly flexible. I thought I'd
bounce my understanding of the practical differences between BCH and RS
codes off ...
I am designing a reed solomon decoder encoder in verilog. while designing
I was unable to calculate delta using Berlekmp massey algorithm. It will
be great help if you can give me some hint.
delta(k) = syndrome(k) - sumation( lambda(k-1) * syndrome(k -i)
lambda is something like zx^3+ ax2...
Here I post the same message I've posted in another forum, where I've
not yet received an answer.
I've a basic question about encoding with Reed Solomon code. Suppose
that C is a RS-code of length n = q-1 over the field F_q, designed
distance d and dimension k. Let b a primitive element in F_...