For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Performance and Complexity of Circular Decoding for Tail-Biting Convolutional Codes
IEICE TRANSACTIONS on Communications
Publication Date: 2002/05/01
Print ISSN: 0916-8516
Type of Manuscript: Special Section LETTER (Wireless Communications Issue)
tail-biting, convolutional code, circular decoding, error bound, wireless communication,
Full Text: PDF>>
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.