The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
O algoritmo de decodificação circular para códigos convolucionais tail-biting é executado usando um número fixo de cálculos e é adequado para implementações DSP/ASIC. Esta carta apresenta a compensação entre desempenho e complexidade no algoritmo de decodificação circular usando um limite analítico na probabilidade de erro. Uma melhoria incremental de desempenho é mostrada à medida que a complexidade aumenta de O(L) A O(L+10K) Onde L é o comprimento da treliça de decodificação e K é o comprimento da restrição. É apresentada a complexidade de decodificação necessária para produzir o desempenho de máxima verossimilhança, que é aplicável a muitos códigos de interesse prático.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -