On the Performance of Three Suboptimum Detection Schemes for Binary Signaling

The penalties incurred in using the sample-and-sum, weighted partial decision, and binary Partial decision detectors are analyzed. Even though these schemes are inferior to the digital matched filter detector, they could be used in systems with more modest computational capabilities. Analytic expressions are obtained for the losses when the number of samples
M
is large. Examples are also given which indicate how these losses vary with
M
.