Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search
Summary :
In this letter, we propose (1) a new sub-optimum minimum distance search (sub-MDS), whose search complexity is reduced considerably compared with optimum MDSs and (2) a termination criterion, called near optimality condition, to reduce the average number of decoding iterations with little degradation of error performance for the proposed decoding using sub-MDS iteratively. Consequently, the decoding algorithm can be applied to longer codes with feasible complexity. Simulation results for several Reed-Muller (RM) codes of lengths 256 and 512 are given.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.10 pp.2596-2600
- Publication Date
- 2003/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
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
Jun ASATANI, Takuya KOUMOTO, Kenichi TOMITA, Tadao KASAMI, "Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search" in IEICE TRANSACTIONS on Fundamentals,
vol. E86-A, no. 10, pp. 2596-2600, October 2003, doi: .
Abstract: In this letter, we propose (1) a new sub-optimum minimum distance search (sub-MDS), whose search complexity is reduced considerably compared with optimum MDSs and (2) a termination criterion, called near optimality condition, to reduce the average number of decoding iterations with little degradation of error performance for the proposed decoding using sub-MDS iteratively. Consequently, the decoding algorithm can be applied to longer codes with feasible complexity. Simulation results for several Reed-Muller (RM) codes of lengths 256 and 512 are given.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_10_2596/_p
Copy
@ARTICLE{e86-a_10_2596,
author={Jun ASATANI, Takuya KOUMOTO, Kenichi TOMITA, Tadao KASAMI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search},
year={2003},
volume={E86-A},
number={10},
pages={2596-2600},
abstract={In this letter, we propose (1) a new sub-optimum minimum distance search (sub-MDS), whose search complexity is reduced considerably compared with optimum MDSs and (2) a termination criterion, called near optimality condition, to reduce the average number of decoding iterations with little degradation of error performance for the proposed decoding using sub-MDS iteratively. Consequently, the decoding algorithm can be applied to longer codes with feasible complexity. Simulation results for several Reed-Muller (RM) codes of lengths 256 and 512 are given.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2596
EP - 2600
AU - Jun ASATANI
AU - Takuya KOUMOTO
AU - Kenichi TOMITA
AU - Tadao KASAMI
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2003
AB - In this letter, we propose (1) a new sub-optimum minimum distance search (sub-MDS), whose search complexity is reduced considerably compared with optimum MDSs and (2) a termination criterion, called near optimality condition, to reduce the average number of decoding iterations with little degradation of error performance for the proposed decoding using sub-MDS iteratively. Consequently, the decoding algorithm can be applied to longer codes with feasible complexity. Simulation results for several Reed-Muller (RM) codes of lengths 256 and 512 are given.
ER -
English
