| Presentation | 2001/3/15 A New Iterative Soft-Decision Decoding Algorithm Using List Decoding of Minimum Weight Sub-trellis Search Jun Asatani, Kenichi Tomita, Takuya Koumoto, Toyoo Takata, Tadao Kasami, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Iterative decoding algorithm using minimum weight sub-trellis search, which is one of minimum distance search (MDS), has been proposed by Koumoto et al. Their decoding algo-rithm achieve not only almost optimum error performance with for all Reed-Muller(RM) codes and extended BCH(EBCH) codes of length 64 but also near optimum for the (128, 29) and the (128, 36) EBCH code with a drastic reduction of decoding complexity. In this paper, We present a new iterative soft-decision decoding algorithm using effcient MDS algorithm. In the proposed decoding algorithm, to make improvement of error performance, we devise two methods, (1) which improve the quality of initial candidate codewords and (2) in the case previously generated code-words appear twice in iterative decoding, instead of finishing decoding, continue decoding by using list decoding of MDS. The simulation results show that the proposed decoding algorithm achieves near error performance with MLD for any RM codes of length 128 and practically optimum for the (256, 37), (256, 93) and (256, 163) RM codes. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | minimum weight codeword / iterative decoding / list decoding / ReednMuller code |
| Paper # | ISEC2000-103 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2001/3/15(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Information Security (ISEC) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A New Iterative Soft-Decision Decoding Algorithm Using List Decoding of Minimum Weight Sub-trellis Search |
| Sub Title (in English) | |
| Keyword(1) | minimum weight codeword |
| Keyword(2) | iterative decoding |
| Keyword(3) | list decoding |
| Keyword(4) | ReednMuller code |
| 1st Author's Name | Jun Asatani |
| 1st Author's Affiliation | Graduate School of Information Sciences, Hiroshima City University() |
| 2nd Author's Name | Kenichi Tomita |
| 2nd Author's Affiliation | Dept. of Information Processing and Management, Shiga University |
| 3rd Author's Name | Takuya Koumoto |
| 3rd Author's Affiliation | Faculty of Software and Information Science, Iwate Prefectural University |
| 4th Author's Name | Toyoo Takata |
| 4th Author's Affiliation | NTT DoCoMo R&D Center |
| 5th Author's Name | Tadao Kasami |
| 5th Author's Affiliation | Graduate School of Information Sciences, Hiroshima City University |
| Date | 2001/3/15 |
| Paper # | ISEC2000-103 |
| Volume (vol) | vol.100 |
| Number (no) | 691 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |