Presentation 2003/2/28
Quasi-Maximum-likelihood-decoing based on Hard decision of BCH-code beyond BCH-bound
Kazuaki DOI, Hideichi SASAOKA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes quasi-Maximum-likelihood-decoding aimed at having the same decoding paformance and less calculation mount as compared with Maximum-likelihood-decoding. The proposed scheme consists of hard-decision-part and soft-decision-part. Hard-decision-part is decoding algorithm that uses inclusive relation and the state of root of error-locate-polynomial out of error-correctable-bound. Soft-decision-part is decoding algorithm that uses decoding result of hard-decision part and the list of low-hamming-weight-code. The computer simulation shows that the proposed algorithm achives the purpose at decoding paformance in (31. 16), (31. 11) and at calculation amount though addision of caluculation amount of algebra-decoding.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) error correcting code / BCH-code / soft-decision-decoding / Maximum-likelihood-decoding
Paper # SST2002-149,A・P2002-248,RCS2002-365,MoMuC2002-174,MW2002-256
Date of Issue

Conference Information
Committee AP
Conference Date 2003/2/28(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 Antennas and Propagation (A・P)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Quasi-Maximum-likelihood-decoing based on Hard decision of BCH-code beyond BCH-bound
Sub Title (in English)
Keyword(1) error correcting code
Keyword(2) BCH-code
Keyword(3) soft-decision-decoding
Keyword(4) Maximum-likelihood-decoding
1st Author's Name Kazuaki DOI
1st Author's Affiliation Faculty of Engineering, Doshiha University()
2nd Author's Name Hideichi SASAOKA
2nd Author's Affiliation Faculty of Engineering, Doshiha University
Date 2003/2/28
Paper # SST2002-149,A・P2002-248,RCS2002-365,MoMuC2002-174,MW2002-256
Volume (vol) vol.102
Number (no) 673
Page pp.pp.-
#Pages 6
Date of Issue