An Upper Bound on Bit Error Rate for Concatenated Convolutional Code

Tadashi WADAYAMA; Koichiro WAKASUGI; Masao KASAHARA

An Upper Bound on Bit Error Rate for Concatenated Convolutional Code

Tadashi WADAYAMA, Koichiro WAKASUGI, Masao KASAHARA

Full Text Views

0

Cite this

Summary :

This paper presents a new upper bound on overall bit error rate (BER) for a concatenated code which consists of an inner convolutional code and an outer interleaved Reed-Solomon code. The upper bound on BER is derived based on a lower bound on the effective minimum distance of the concatenated code. This upper bound can be used for the cases when the interleaver size is small such that the conventional upper bound is not applicable.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.11 pp.2123-2129

Publication Date: 1997/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Coding Theory

Cite this

Copy

Tadashi WADAYAMA, Koichiro WAKASUGI, Masao KASAHARA, "An Upper Bound on Bit Error Rate for Concatenated Convolutional Code" in IEICE TRANSACTIONS on Fundamentals, vol. E80-A, no. 11, pp. 2123-2129, November 1997, doi: .
Abstract: This paper presents a new upper bound on overall bit error rate (BER) for a concatenated code which consists of an inner convolutional code and an outer interleaved Reed-Solomon code. The upper bound on BER is derived based on a lower bound on the effective minimum distance of the concatenated code. This upper bound can be used for the cases when the interleaver size is small such that the conventional upper bound is not applicable.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_11_2123/_p

Copy

@ARTICLE{e80-a_11_2123,
author={Tadashi WADAYAMA, Koichiro WAKASUGI, Masao KASAHARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Upper Bound on Bit Error Rate for Concatenated Convolutional Code},
year={1997},
volume={E80-A},
number={11},
pages={2123-2129},
abstract={This paper presents a new upper bound on overall bit error rate (BER) for a concatenated code which consists of an inner convolutional code and an outer interleaved Reed-Solomon code. The upper bound on BER is derived based on a lower bound on the effective minimum distance of the concatenated code. This upper bound can be used for the cases when the interleaver size is small such that the conventional upper bound is not applicable.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - An Upper Bound on Bit Error Rate for Concatenated Convolutional Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2123
EP - 2129
AU - Tadashi WADAYAMA
AU - Koichiro WAKASUGI
AU - Masao KASAHARA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1997
AB - This paper presents a new upper bound on overall bit error rate (BER) for a concatenated code which consists of an inner convolutional code and an outer interleaved Reed-Solomon code. The upper bound on BER is derived based on a lower bound on the effective minimum distance of the concatenated code. This upper bound can be used for the cases when the interleaver size is small such that the conventional upper bound is not applicable.
ER -