| タイトル | Tail Biting Trellis Representation of Codes: Decoding and Construction |
| 本文（外部サイト） | http://hdl.handle.net/2060/20000017946 |
| 著者（英） | Shao. Rose Y.; Fossorier, Marc; Lin, Shu |
| 著者所属（英） | Hawaii Univ. |
| 発行日 | 1999-12-16 |
| 言語 | eng |
| 内容記述 | This paper presents two new iterative algorithms for decoding linear codes based on their tail biting trellises, one is unidirectional and the other is bidirectional. Both algorithms are computationally efficient and achieves virtually optimum error performance with a small number of decoding iterations. They outperform all the previous suboptimal decoding algorithms. The bidirectional algorithm also reduces decoding delay. Also presented in the paper is a method for constructing tail biting trellises for linear block codes. |
| NASA分類 | Computer Programming and Software |
| レポートNO | Rept-99-003 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/95386 |
