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
조회수
116
채널 디코딩에서는 채널 통계의 불확실성이나 디코더의 한계로 인해 최적이 아닌 메트릭을 가진 디코더가 사용될 수 있습니다. 이 경우 디코딩 메트릭이 실제 채널 메트릭과 다르기 때문에 불일치 디코딩이라고 합니다. 본 논문에서는 DS2 바운드 기법을 적용하여 Hof, Sason 및 Shamai가 정의한 선형 블록 코드의 앙상블에 대해 일반 채널에서 불일치 디코딩의 오류 확률에 대한 상한을 도출합니다. Gallager가 정의한 무작위 선형 블록 코드의 앙상블을 가정하면 얻은 경계가 기존 경계보다 느슨하지 않음을 보여줍니다. 우리는 또한 Gallager가 도입한 LDPC 코드의 앙상블에 대한 수치적 예를 제시하는데, 이는 우리가 제안한 경계가 기존 경계보다 더 엄격하다는 것을 보여줍니다. 또한 선형 블록 코드에 대한 단일 문자 오류 지수를 얻습니다.
Toshihiro NIINOMI
Tokyo City University
Hideki YAGI
the University of Electro-Communications
Shigeichi HIRASAWA
Waseda University
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.
부
Toshihiro NIINOMI, Hideki YAGI, Shigeichi HIRASAWA, "Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 3, pp. 363-371, March 2022, doi: 10.1587/transfun.2021TAP0001.
Abstract: In channel decoding, a decoder with suboptimal metrics may be used because of the uncertainty of the channel statistics or the limitations of the decoder. In this case, the decoding metric is different from the actual channel metric, and thus it is called mismatched decoding. In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding over a regular channel for the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound. We also give a numerical example for the ensemble of LDPC codes also introduced by Gallager, which shows that our proposed bound is tighter than the conventional bound. Furthermore, we obtain a single letter error exponent for linear block codes.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021TAP0001/_p
부
@ARTICLE{e105-a_3_363,
author={Toshihiro NIINOMI, Hideki YAGI, Shigeichi HIRASAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding},
year={2022},
volume={E105-A},
number={3},
pages={363-371},
abstract={In channel decoding, a decoder with suboptimal metrics may be used because of the uncertainty of the channel statistics or the limitations of the decoder. In this case, the decoding metric is different from the actual channel metric, and thus it is called mismatched decoding. In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding over a regular channel for the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound. We also give a numerical example for the ensemble of LDPC codes also introduced by Gallager, which shows that our proposed bound is tighter than the conventional bound. Furthermore, we obtain a single letter error exponent for linear block codes.},
keywords={},
doi={10.1587/transfun.2021TAP0001},
ISSN={1745-1337},
month={March},}
부
TY - JOUR
TI - Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 363
EP - 371
AU - Toshihiro NIINOMI
AU - Hideki YAGI
AU - Shigeichi HIRASAWA
PY - 2022
DO - 10.1587/transfun.2021TAP0001
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2022
AB - In channel decoding, a decoder with suboptimal metrics may be used because of the uncertainty of the channel statistics or the limitations of the decoder. In this case, the decoding metric is different from the actual channel metric, and thus it is called mismatched decoding. In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding over a regular channel for the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound. We also give a numerical example for the ensemble of LDPC codes also introduced by Gallager, which shows that our proposed bound is tighter than the conventional bound. Furthermore, we obtain a single letter error exponent for linear block codes.
ER -