Performance and Complexity of Circular Decoding for Tail-Biting Convolutional Codes
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E85-B No.5 pp.967-971
- Publication Date
- 2002/05/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Wireless Communications Issue)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Wonjin SUNG, "Performance and Complexity of Circular Decoding for Tail-Biting Convolutional Codes" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 5, pp. 967-971, May 2002, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_5_967/_p
Copy
@ARTICLE{e85-b_5_967,
author={Wonjin SUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance and Complexity of Circular Decoding for Tail-Biting Convolutional Codes},
year={2002},
volume={E85-B},
number={5},
pages={967-971},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Performance and Complexity of Circular Decoding for Tail-Biting Convolutional Codes
T2 - IEICE TRANSACTIONS on Communications
SP - 967
EP - 971
AU - Wonjin SUNG
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2002
AB - 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.
ER -
English
