An Upper Bound on Bit Error Rate for Concatenated Convolutional Code
スポンサーリンク
概要
- 論文の詳細を見る
This paper presents a new upper bound on over-all 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.
- 社団法人電子情報通信学会の論文
- 1997-11-25
著者
-
Wadayama T
Okayama Prefectural Univ. Okayama Jpn
-
Kasahara Masao
Osaka Gakuin Univ. Suita‐shi Jpn
-
KASAHARA Masao
the Department of Electronics and Information Science, Kyoto Institute of Technology
-
WADAYAMA Tadashi
the Faculty of Computer Science and System Engineering, Okayama Prefectural University
-
WAKASUGI Koichiro
the Department of Electronics and Information Science, Kyoto Institute of Technology
-
Wadayama Tadashi
The Faculty Of Computer Science And System Engineering Okayama Perfectural University
-
Wakasugi Koichiro
Department Of Electronics And Information Science Kyoto Institute Of Technology
-
Kasahara Masao
Department of Faculty of Informatics, Osaka Gakuin University
関連論文
- A New Product-Sum Type Public Key Cryptosystem Based on Reduced Bases : Special Section on Cryptography and Information Security
- A New Probabilistic ID-Based Non-interactive Key Sharing Scheme(Special Section on Cryptography and Information Security)
- An Upper Bound on Frame Error Rate for Generalized Concatenated Convolutional Codes
- A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel (Special Section on Information Theory and Its Applications)
- An Upper Bound on Bit Error Rate for Concatenated Convolutional Code
- A Class of Trellis-Codes for Partial Response Channel
- Matched Design Method for Concatenated Trellis-Coded Modulation
- High Rate Binary Coset Code Used for Inner Code
- Multi-Dimensional Block Shaping
- An 8-Dimensional Trellis-Coded 8-PSK with Non-zero Crossing Constraint (Special Section on Information Theory and Its Applications)
- New Product-Sum Type Public-Key Cryptosystems with Selectable Encryption Key Based on Chinese Remainder Theorem
- A New Product-Sum Public-Key Cryptosystem Using Message Extension(Special Section on Information Theory and Its Applications)
- Some Optimal and Quasi-Optimal Binary Codes from Cyclic Codes over GF (2^m)
- On the Unequal Error Protection Capability of a q-Ary Image 0f a L0W-Rate q^m-Ary Cyclic Code (Special Section on Information Theory and Its Applications)
- A Multilevel Construction of Permutation Codes(Special Section on Information Theory and Its Applications)
- A Coded Modulation Scheme Based on Low Density Parity Check Codes(Special Section on Information Theory and Its Applications)
- An Iterative Decoding Algorithm for Channels with Additive Linear Dynamical Noise(Coding Theory)(Information Theory and Its Applications)