NDLI: An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes

Content Provider	IEEE Xplore Digital Library
Author	Behnamfar, F. Alajaji, F. Linder, T.
Copyright Year	1972
Abstract	We present an efficient algorithmic lower bound for the block error rate of linear binary block codes under soft maximum-likelihood decoding over binary phase-shift keying modulated additive white Gaussian noise channels. We cast the problem of finding a lower bound on the probability of a union as an optimization problem that seeks to find the subset that maximizes a recent lower bound - due to Kuai, Alajaji, and Takahara - that we will refer to as the KAT bound. The improved bound, which is denoted by LB-s, is asymptotically tight [as the signal-to-noise ratio (SNR) grows to infinity] and depends only on the code's weight enumeration function for its calculation. The use of a subset of the codebook to evaluate the LB-s lower bound not only significantly reduces computational complexity, but also tightens the bound specially at low SNRs. Numerical results for binary block codes indicate that at high SNRs, the LB-s bound is tighter than other recent lower bounds in the literature, which comprise the lower bound due to Seguin, the KAT bound (evaluated on the entire codebook), and the dot-product and norm bounds due to Cohen and Merhav.
Starting Page	1093
Ending Page	1098
Page Count	6
File Size	291592
File Format	PDF
ISSN	00906778
Volume Number	55
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-06-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Error analysis Block codes Maximum likelihood decoding Phase shift keying Phase modulation Modulation coding Additive white noise Signal to noise ratio H infinity control Computational complexity weight spectrum of codes Additive white Gaussian noise (AWGN) binary phase-shift keying (BPSK) channel coding linear block codes lower bound maximum-likelihood (ML) decoding probability of error
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering

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

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

On the reliability-order-based decoding algorithms for binary linear block codes

Adaptive combined Chase-GMD algorithms for block codes

New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes

The ML decoding performance of LDPC ensembles over Z/sub q/

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

Design of turbo-coded modulation for the AWGN channel with Tikhonov phase error

Multilevel coded modulation for unequal error protection and multistage decoding. II. Asymmetric constellations

An analytical method for approximate performance evaluation of binary linear block codes

An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes

Similar Documents

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

On the reliability-order-based decoding algorithms for binary linear block codes

Adaptive combined Chase-GMD algorithms for block codes

New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes

The ML decoding performance of LDPC ensembles over Z/sub q/

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

Design of turbo-coded modulation for the AWGN channel with Tikhonov phase error

Multilevel coded modulation for unequal error protection and multistage decoding. II. Asymmetric constellations

An analytical method for approximate performance evaluation of binary linear block codes

An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes