Semidefinite programming bounds on the probability of error of binary communication systems with inexactly known intersymbol interference

We consider the problem of evaluating the probability of error of binary communication systems in the presence of additive noise and intersymbol interferences whose statistics are inexactly known due to the estimation errors of the channel coefficients. We present a new method using semidefinite programming to evaluate tight bounds on the error probability based on the upper and lower bounds on the moments of those interferences. Numerical results are provided and compared with a previously published technique.