Answers are grounded in this paper and cite their sources.
Effective analyses of performance for detection schemes that optimally decode digital data in the presence of intersymbol interference have been slow in coming. Recently, however, Forney has given an upper bound on the bit error probability for maximum-likelihood sequence estimation. Starting from a standard geometrical framework, we give a much simplified derivation of this upper bound. Our derivation places the validity of this important bound more in evidence in that the concepts of whitened matched filter and error event are not introduced.
No takes yet. Share an insight, caveat, or question.
J. E. Mazo (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: