A Pseudo-Inverse Based Iterative Decoding Method for DFT Codes in Erasure Channels

Paeiz AZMI  Farokh MARVASTI  

IEICE TRANSACTIONS on Communications   Vol.E87-B   No.10   pp.3092-3095
Publication Date: 2004/10/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
DFT codes,  iterative decoding,  Reed-Solomon codes,  erasure channels,  pseudo-inverse,  

Full Text: PDF(150.2KB)>>
Buy this Article

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.