Summary: Bonferroni­Type Bounds on the Frame and Bit Error Rates
of Coded AWGN and Block Rayleigh Fading Channels
Firouz Behnamfar y , Fady Alajaji yz , and Tam’as Linder yz
y Department of Electrical and Computer Engineering, z Department of Mathematics and Statistics
Queen's University, Kingston, Ontario, Canada.
ffirouz, fady, linderg@mast.queensu.ca
Abstract --- We present a method to find Bonferroni­type
upper and lower bounds for the end­to­end frame error
rate and bit error rate of a general communication system.
The KAT lower bound of [2] is also studied. Knowledge
of a particular structure in the system, such as the weight
distribution of the channel code, can be used to speed­up
the computations or reduce complexity. Tightness of the
bounds is demonstrated for various channel codes and sig­
naling schemes.
I. INTRODUCTION
The KAT bound derived in [2] and the algorithmic Bonfer­
roni bounds in [3, 10, 1] are used to find tight lower and upper
bounds on the symbol error rate and bit error rate (BER) of un­
coded data sent over PSK/QAM modulated AWGN, Rayleigh

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