A Novel Iterative Decoding Method for DFT Codes in Erasure Channels
One of the categories of decoding techniques for DFT codes in erasure channels is the class of iterative algorithms. Iterative algorithms can be considered as kind of alternating mapping methods using the given information in a repetitive way. In this paper, we propose a new iterative method for decoding DFT codes. It will be shown that the proposed method outperforms the well-known methods such as Wiley/Marvasti, and ADPW methods in the decoding of DFT codes in erasure channels.
Unable to display preview. Download preview PDF.
- 2.Marvasti, F., Nafie, M.: Using FFT for Error Correction Decoders. In: Proc. IEE colloquium on DSP Applications on Communication systems, pp. 9/1–9/4 (1993)Google Scholar
- 5.Ferreira, P.j.S.G., Vieira, J.M.N.: Locating and Correcting Errors in Images. In: Proc. IEEE Conf on Image Processing, ICIP 1997, October 1997, pp. 691–694 (1997)Google Scholar
- 7.Sauer, S.A., Allbach, J.P.: Iterative Reconstruction of Band-Limited Images from Non-uniformly Spaced Samples. IEEE Trans. on Circuit and Systems 34(12) (December 1987)Google Scholar