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.
| Original language | English |
|---|---|
| Pages (from-to) | 2596-2600 |
| Number of pages | 5 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E86-A |
| Issue number | 10 |
| Publication status | Published - Oct 2003 |
| Externally published | Yes |
Fingerprint
Keywords
- Iterative decoding
- Minimum distance search
- Near optimality condition
- Reed-Muller code
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Hardware and Architecture
- Information Systems
Cite this
Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search. / Asatani, Jun; Kusaka, Takuya; Tomita, Kenichi; Kasami, Tadao.
In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E86-A, No. 10, 10.2003, p. 2596-2600.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search
AU - Asatani, Jun
AU - Kusaka, Takuya
AU - Tomita, Kenichi
AU - Kasami, Tadao
PY - 2003/10
Y1 - 2003/10
N2 - 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.
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.
KW - Iterative decoding
KW - Minimum distance search
KW - Near optimality condition
KW - Reed-Muller code
UR - http://www.scopus.com/inward/record.url?scp=0242496288&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0242496288&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0242496288
VL - E86-A
SP - 2596
EP - 2600
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
SN - 0916-8508
IS - 10
ER -