Continue to Site

# FFT and forward error correction

Status
Not open for further replies.

#### tojeena

##### Member level 3
The data correlation output of FFT and forward error correction method will it be similar?

[Ah tojeena - we meet again ]

No, not at all... because they're entirely different fundamental processes. Correlation (whether implemented via an FFT, shift-multiply-adds etc) searches for statistical similarities between data sets. Forward error correction involves adding redundant data to a message to improve communication reliability (without requiring a feedback/handshaking protocol). Note that the latter process *may* use a correlation step in decoding corrupted data, but they are intended for different purposes.

[Ah tojeena - we meet again ]

No, not at all... because they're entirely different fundamental processes. Correlation (whether implemented via an FFT, shift-multiply-adds etc) searches for statistical similarities between data sets. Forward error correction involves adding redundant data to a message to improve communication reliability (without requiring a feedback/handshaking protocol). Note that the latter process *may* use a correlation step in decoding corrupted data, but they are intended for different purposes.

Thank you so much for your reply.I thought of using fft in the pre processing step of rice codes.Used for removal of correlation.In that case FEC and FFT values will it be same?

The discrete Fourier transform (DFT) is used for error detection and correction. An iterative decoder is proposed for erasure and impulsive noise which also works with moderate amount of additive random noise. The iterative method is very simple and efficient consisting of modules of fast Fourier transforms (FFT) and inverse FFTs. This iterative decoder can be implemented in a feedback configuration.

The discrete Fourier transform (DFT) is used for error detection and correction. An iterative decoder is proposed for erasure and impulsive noise which also works with moderate amount of additive random noise. The iterative method is very simple and efficient consisting of modules of fast Fourier transforms (FFT) and inverse FFTs. This iterative decoder can be implemented in a feedback configuration.

So fft has similarity to the prediction error coefficients right?

Status
Not open for further replies.