Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 6, JUNE 2007 1093 Transactions Letters
 

Summary: IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 6, JUNE 2007 1093
Transactions Letters
An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes
Firouz Behnamfar, Member, IEEE, Fady Alajaji, Senior Member, IEEE, and Tamás Linder, Senior Member, IEEE
Abstract--We present an efficient algorithmic lower bound for
the block error rate of linear binary block codes under soft max-
imum-likelihood decoding over binary phase-shift keying modu-
lated additive white Gaussian noise channels. We cast the problem
of finding a lower bound on the probability of a union as an op-
timization 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 de-
noted 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 spe-
cially at low SNRs. Numerical results for binary block codes indi-
cate that at high SNRs, the LB-s bound is tighter than other recent
lower bounds in the literature, which comprise the lower bound

  

Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston)
Linder, Tamás - Department of Mathematics and Statistics, Queen's University (Kingston)

 

Collections: Engineering