A Pseudo-Inverse Based Iterative Decoding Method for DFT Codes in Erasure Channels
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.10 pp.3092-3095
- Publication Date
- 2004/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Fundamental Theories for Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Paeiz AZMI, Farokh MARVASTI, "A Pseudo-Inverse Based Iterative Decoding Method for DFT Codes in Erasure Channels" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 10, pp. 3092-3095, October 2004, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_10_3092/_p
Copy
@ARTICLE{e87-b_10_3092,
author={Paeiz AZMI, Farokh MARVASTI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Pseudo-Inverse Based Iterative Decoding Method for DFT Codes in Erasure Channels},
year={2004},
volume={E87-B},
number={10},
pages={3092-3095},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Pseudo-Inverse Based Iterative Decoding Method for DFT Codes in Erasure Channels
T2 - IEICE TRANSACTIONS on Communications
SP - 3092
EP - 3095
AU - Paeiz AZMI
AU - Farokh MARVASTI
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2004
AB - 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.
ER -
English
