Upper and lower bounds to probability of error in binary communication systems with intersymbol interference are presented. Closed-form formulas are given for systems with filters having a finite number of lumped elements. Explicit results are given when the filters are Butterworth filters of order
Published in:
Communications, IEEE Transactions on
(Volume:21
,
Issue:
8
)
Date of Publication: Aug 1973