Presentation 2003/7/16
Implementation and Simulation Results of Adaptive Recursive Maximum Likelihood Decoding
Takuya KOUMOTO, Yuichi KAJI, Toru FUJIWARA, Tadao KASAMI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We have proposed a new adaptive recursive maximum likelihood decoding for binary linear block code with significant reduction on computational complexity on average. The basic properties of the algorithm have been shown in another technical report. In this report, we show the useful information to implement the algorithm for the (128, 64, 16) RM code. Simulation results are also shown.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Adaptive Recursive Maximum / Likelihood Decoding / Binary Linear Block Code
Paper # IT2003-28
Date of Issue

Conference Information
Committee IT
Conference Date 2003/7/16(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 Theory (IT)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Implementation and Simulation Results of Adaptive Recursive Maximum Likelihood Decoding
Sub Title (in English)
Keyword(1) Adaptive Recursive Maximum
Keyword(2) Likelihood Decoding
Keyword(3) Binary Linear Block Code
1st Author's Name Takuya KOUMOTO
1st Author's Affiliation Faculty of Information Sciences, Hiroshima City University()
2nd Author's Name Yuichi KAJI
2nd Author's Affiliation Graduate School of Information Science, Nara Institute of Science and Technology
3rd Author's Name Toru FUJIWARA
3rd Author's Affiliation Graduate School of Information Science and Technology, Osaka University /
4th Author's Name Tadao KASAMI
4th Author's Affiliation
Date 2003/7/16
Paper # IT2003-28
Volume (vol) vol.103
Number (no) 215
Page pp.pp.-
#Pages 4
Date of Issue