Improved Sphere Bound on the MLD Performance of Binary Linear Block Codes via Voronoi Region
Summary :
In this paper, the Voronoi region of the transmitted codeword is employed to improve the sphere bound on the maximum-likelihood decoding (MLD) performance of binary linear block codes over additive white Gaussian noise (AWGN) channels. We obtain the improved sphere bounds both on the frame-error probability and the bit-error probability. With the framework of the sphere bound proposed by Kasami et al., we derive the conditional decoding error probability on the spheres by defining a subset of the Voronoi region of the transmitted codeword, since the Voronoi regions of a binary linear block code govern the decoding error probability analysis over AWGN channels. The proposed bound improves the sphere bound by Kasami et al. and the sphere bound by Herzberg and Poltyrev. The computational complexity of the proposed bound is similar to that of the sphere bound by Kasami et al.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.12 pp.2572-2577
- Publication Date
- 2017/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.2572
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory and Techniques
Authors
Jia LIU
Zhongkai University of Agriculture and Engineering
Meilin HE
Doshisha University
Jun CHENG
Doshisha University
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
Jia LIU, Meilin HE, Jun CHENG, "Improved Sphere Bound on the MLD Performance of Binary Linear Block Codes via Voronoi Region" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 12, pp. 2572-2577, December 2017, doi: 10.1587/transfun.E100.A.2572.
Abstract: In this paper, the Voronoi region of the transmitted codeword is employed to improve the sphere bound on the maximum-likelihood decoding (MLD) performance of binary linear block codes over additive white Gaussian noise (AWGN) channels. We obtain the improved sphere bounds both on the frame-error probability and the bit-error probability. With the framework of the sphere bound proposed by Kasami et al., we derive the conditional decoding error probability on the spheres by defining a subset of the Voronoi region of the transmitted codeword, since the Voronoi regions of a binary linear block code govern the decoding error probability analysis over AWGN channels. The proposed bound improves the sphere bound by Kasami et al. and the sphere bound by Herzberg and Poltyrev. The computational complexity of the proposed bound is similar to that of the sphere bound by Kasami et al.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.2572/_p
Copy
@ARTICLE{e100-a_12_2572,
author={Jia LIU, Meilin HE, Jun CHENG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Improved Sphere Bound on the MLD Performance of Binary Linear Block Codes via Voronoi Region},
year={2017},
volume={E100-A},
number={12},
pages={2572-2577},
abstract={In this paper, the Voronoi region of the transmitted codeword is employed to improve the sphere bound on the maximum-likelihood decoding (MLD) performance of binary linear block codes over additive white Gaussian noise (AWGN) channels. We obtain the improved sphere bounds both on the frame-error probability and the bit-error probability. With the framework of the sphere bound proposed by Kasami et al., we derive the conditional decoding error probability on the spheres by defining a subset of the Voronoi region of the transmitted codeword, since the Voronoi regions of a binary linear block code govern the decoding error probability analysis over AWGN channels. The proposed bound improves the sphere bound by Kasami et al. and the sphere bound by Herzberg and Poltyrev. The computational complexity of the proposed bound is similar to that of the sphere bound by Kasami et al.},
keywords={},
doi={10.1587/transfun.E100.A.2572},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Improved Sphere Bound on the MLD Performance of Binary Linear Block Codes via Voronoi Region
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2572
EP - 2577
AU - Jia LIU
AU - Meilin HE
AU - Jun CHENG
PY - 2017
DO - 10.1587/transfun.E100.A.2572
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2017
AB - In this paper, the Voronoi region of the transmitted codeword is employed to improve the sphere bound on the maximum-likelihood decoding (MLD) performance of binary linear block codes over additive white Gaussian noise (AWGN) channels. We obtain the improved sphere bounds both on the frame-error probability and the bit-error probability. With the framework of the sphere bound proposed by Kasami et al., we derive the conditional decoding error probability on the spheres by defining a subset of the Voronoi region of the transmitted codeword, since the Voronoi regions of a binary linear block code govern the decoding error probability analysis over AWGN channels. The proposed bound improves the sphere bound by Kasami et al. and the sphere bound by Herzberg and Poltyrev. The computational complexity of the proposed bound is similar to that of the sphere bound by Kasami et al.
ER -
English
