|
naistar (NAIST Academic Repository) >
学術リポジトリ naistar / NAIST Academic Repository naistar >
テクニカルレポート / Technical Report >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10061/3123
|
| Title: | An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes. |
| Authors: | Tang, Yuansheng
Kasami, Tadao
Fujiwara, Toru
カサミ, タダオ
フジワラ, トオル
嵩, 忠雄
藤原, 融 |
| Issue Date: | Oct-1998 |
| Publisher: | Nara Institute of Science and Technology |
| Series/Report no.: | Information Science Technical Report ~ TR98012 |
| Abstract: | For the iterative soft-decision decoding algorithms, a testing condition on the optimality of a decoded codeword based on h candidate codewords is proposed by Kasami et.al. recently. The greater the number h of the candidate codewords, the stronger the testing condition. The computational complexity and the effectiveness of the testing condition of the cases h ≤ 3 have been investigated by Kasami et.al. In this paper we propose an algorithm to compute the testing condition of the case h ＝ 4, the computational complexity of this algorithm is also discussed. |
| URI: | http://hdl.handle.net/10061/3123 |
| URI: | http://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=20936 |
| Fulltext: | http://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=20936 |
| ISSN: | 0919-9527 |
| Text Version: | author |
| Appears in Collections: | テクニカルレポート / Technical Report
|
Files in This Item:
There are no files associated with this item.
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
