Performance and Complexity of Circular Decoding for Tail-Biting Convolutional Codes(Wireless Communications Issue)

スポンサーリンク

概要

• 論文の詳細を見る

• The circular decoding algorithm for tail-biting convolutional codes is executed using a fixed number of computations and is suitable for DSP/ASIC implementations. This letter presents the performance and complexity trade-off in the circular decoding algorithm using an analytic bound on the error probability. An incremental performance improvement is shown as the complexity increases from O(L) to O(L + 10K) where L is the length of the decoding trellis and K is the constraint length. The decoding complexity required to produce the maximum-likelihood performance is presented, which is applicable to many codes of practical interest.

• 一般社団法人電子情報通信学会の論文
• 2002-05-01

著者

• Sung W

  The Department Of Electronic Engineering Sogang University

• SUNG Wonjin

  the Department of Electronic Engineering, Sogang University

関連論文

• Performance and Complexity of Circular Decoding for Tail-Biting Convolutional Codes(Wireless Communications Issue)

スポンサーリンク