Presentation 2003/3/19
Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search
Jun ASATANI, Takuya KOUMOTO, Kenicni TOMITA, Tadao KASAMI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this report, 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) minimum distance search / near optimality condition / Reed-Muller code / iterative decoding
Paper # IT2002-67,ISEC2002-125,SST2002-173,ITS2002-150
Date of Issue

Conference Information
Committee ITS
Conference Date 2003/3/19(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 Intelligent Transport Systems Technology (ITS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search
Sub Title (in English)
Keyword(1) minimum distance search
Keyword(2) near optimality condition
Keyword(3) Reed-Muller code
Keyword(4) iterative decoding
1st Author's Name Jun ASATANI
1st Author's Affiliation Department of Computer Science, Graduate School of Information Sciences, Hiroshima City University()
2nd Author's Name Takuya KOUMOTO
2nd Author's Affiliation Faculty of Information Sciences, Hiroshima City University
3rd Author's Name Kenicni TOMITA
3rd Author's Affiliation Department of Information Processing and Management, Shiga University
4th Author's Name Tadao KASAMI
4th Author's Affiliation Faculty of Information Sciences, Hiroshima City University
Date 2003/3/19
Paper # IT2002-67,ISEC2002-125,SST2002-173,ITS2002-150
Volume (vol) vol.102
Number (no) 747
Page pp.pp.-
#Pages 6
Date of Issue