NDLI: Improved Hamming sphere bounds on the MLD performance of binary linear codes

Content Provider	IEEE Xplore Digital Library
Author	Jia Liu Xiao Ma
Copyright Year	2015
Description	Author affiliation: Dept. of Electron. & Commun. Eng., Sun Yat-sen Univ., Guangzhou, China (Xiao Ma) \|\| Coll. of Inf. Sci. & Technol., Zhongkai Univ. of Agric. & Eng., Guangzhou, China (Jia Liu)
Abstract	In this paper, improved Hamming sphere bounds on the maximum-likelihood decoding (MLD) performance of binary linear codes over additive white Gaussian noise (AWGN) channels are proposed. The proposed Hamming sphere bounds both on the frame and bit error probabilities are based on Gallager's first bounding technique (GFBT), where the “good” region is chosen to be an Hamming sphere, which is different from the conventional definition by the Euclidean distance. The good region is then divided into small regions to tighten the union bound on the error probability caused by the Hamming sphere. The proposed bounds require only the knowledge of the truncated weight spectrum of the code, which is helpful when the whole weight spectrum is unknown or not computable. Numerical results show that the proposed bounds are tighter than most of the upper bounds and even tighter than the tangential-sphere bound (TSB) for high code rates.
Starting Page	1756
Ending Page	1760
File Size	128558
Page Count	5
File Format	PDF
ISSN	21578117
e-ISBN	9781467377041
DOI	10.1109/ISIT.2015.7282757
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-06-14
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Upper bound Error probability Maximum likelihood decoding Linear codes AWGN channels Hamming weight
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

New techniques for upper-bounding the MLD performance of binary linear codes

On the Error Exponents of Improved Tangential-Sphere Bounds

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference

New lower bounds on the error probability of a given block code

Improved upper bounds on the performance of parallel and serial concatenated turbo codes via their ensemble distance spectrum

On the Error Exponents of Improved Tangential Sphere Bounds

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

Bounds on the performance of sphere decoding of linear block codes

Improved Hamming sphere bounds on the MLD performance of binary linear codes

Similar Documents

New techniques for upper-bounding the MLD performance of binary linear codes

On the Error Exponents of Improved Tangential-Sphere Bounds

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference

New lower bounds on the error probability of a given block code

Improved upper bounds on the performance of parallel and serial concatenated turbo codes via their ensemble distance spectrum

On the Error Exponents of Improved Tangential Sphere Bounds

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

Bounds on the performance of sphere decoding of linear block codes

Improved Hamming sphere bounds on the MLD performance of binary linear codes