Abstract
The detection algorithm developed by Nikiforov is not recursive and has very high complexity. As an alternative, a recursive algorithm based on Page's CUSUM rule is proposed. This algorithm, as shown by two lemmas, satisfies the asymptotic optimality result of Nikiforov's algorithm.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 19 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2001 |
| Event | 2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States Duration: Jun 24 2001 → Jun 29 2001 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics