| Abstract: | A two-stage approach to computationally efficient signal detection is to nominate candidate signal vectors using a suboptimal, but computationally cheap, detection scheme, and subsequently perform optimal detection on the candidates. Bounds on the detection performance of this approach are presented along with sufficient conditions for optimality. Examples are presented of an optimal and nearly optimal two-stage detection scheme where computational costs are drastically reduced relative to the singli-stage optimal detector. |
