完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHan, Yunghsiang S.en_US
dc.contributor.authorWu, Ting-Yien_US
dc.contributor.authorPai, Hung-Taen_US
dc.contributor.authorChen, Po-Ningen_US
dc.contributor.authorShieh, Shin-Linen_US
dc.date.accessioned2017-04-21T06:49:15Z-
dc.date.available2017-04-21T06:49:15Z-
dc.date.issued2008en_US
dc.identifier.isbn978-1-4244-2068-1en_US
dc.identifier.urihttp://hdl.handle.net/11536/135064-
dc.description.abstractDue to rapid interest on the applications of convolutional tail-biting to communication systems, several suboptimal algorithms have been proposed to achieve near-optimal Word error rate (WER) performances with circular Viterbi decoding approach. Among them, the wrap-around Viterbi algorithm (WAVA) proposed in [1] is the one with least decoding complexity. Very recently, a maximum likelihood (ML) decoding algorithm has been proposed in [2]. The scheme has two phases. The Viterbi algorithm is applied to the trellis of the convolutional tail-biting code and the information obtained in the first phase is used by algorithm A*, which is performed to all subtrellises, in the second phase. In this work, a new two-phase ML decoding algorithm is proposed. From the simulation results for the. (2,1,12) convolutional tail-biting code, the proposed algorithm has 16 times less average decoding complexity in the second phase when compared to the one using algorithm A* and 15123 times less than that of the WAVA., respectively, when SNRb = 4 dB.en_US
dc.language.isoen_USen_US
dc.titlePriority-First Search Decoding for Convolutional Tail-biting Codesen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3en_US
dc.citation.spage1089en_US
dc.citation.epage+en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000273504800197en_US
dc.citation.woscount0en_US
顯示於類別:會議論文