DSpace Repository

A call-by-need recursive algorithm for the LogMAP decoding of a binary linear block code

Show simple item record

dc.contributor.author Ishida, Toshiyuki en
dc.contributor.author Kaji, Yuichi en
dc.date.accessioned 2009-02-12T06:23:26Z en
dc.date.available 2009-02-12T06:23:26Z en
dc.date.issued 2003-12-01 en
dc.identifier.issn 0916-8508 en
dc.identifier.uri http://hdl.handle.net/10061/4979 en
dc.description.abstract A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes. en
dc.language.iso en en
dc.publisher Institute of Electronics, Information and Communication Engineers en
dc.rights Copyright (C)2003 IEICE en
dc.title A call-by-need recursive algorithm for the LogMAP decoding of a binary linear block code en
dc.type.nii Journal Article en
dc.textversion publisher en
dc.identifier.ncid AA10826239 en
dc.identifier.jtitle IEICE transactions on fundamentals of electronics, communications and computer sciences en
dc.identifier.volume E86-A en
dc.identifier.issue 12 en
dc.identifier.spage 3306 en
dc.identifier.epage 3309 en
dc.identifier.NAIST-ID 73292336 en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account