Forums

reed solomon: z transform vs fourier transform

Started by nezhate April 5, 2007
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

nezhate wrote:
> 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 ?
A Reed-Solomon error correction scheme doesn't make use of either transform. http://en.wikipedia.org/wiki/Reed-Solomon_error_correction Jerry -- Engineering is the art of making what you want from things you can get. ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯
On Apr 5, 9:17 am, Jerry Avins <j...@ieee.org> wrote:
> nezhate wrote: > > 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 ? > > A Reed-Solomon error correction scheme doesn't make use of either > transform.http://en.wikipedia.org/wiki/Reed-Solomon_error_correction > > Jerry
Also, realize that the Fourier transform that can be used to define a Reed-Solomon code lives in a Galois Field, so the algebra is different from what a DSP is typically optimize to compute using (real-valued) multipliers. Finally, one does not "compute" the Z-transform of things, it's more of a notation for analysis and representation. Julius