Name
Abstract | ||
|---|---|---|
The problem of designing optimal quantization rules for sequential detectors is investigated. First, it is shown that this task can be solved within the general framework of active sequential detection. Using this approach, the optimal sequential detector and the corresponding quantizer are characterized and their properties are briefly discussed. In particular, it is shown that designing optimal quantization rules requires solving a nonconvex optimization problem, which can lead to issues in terms of computational complexity and numerical stability. Motivated by these difficulties, two performance bounds are proposed that are easier to evaluate than the true performance measures and are potentially tighter than the bounds currently available in the literature. The usefulness of the bounds and the properties of the optimal quantization rules are illustrated with two numerical examples. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TSP.2022.3198173 | IEEE TRANSACTIONS ON SIGNAL PROCESSING |
Keywords | DocType | Volume |
Quantization (signal), Task analysis, Detectors, Testing, Random variables, Bayes methods, Analog-digital conversion, Sequential detection, active detection, optimal quantization rules, performance bounds | Journal | 70 |
ISSN | Citations | PageRank |
1053-587X | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Fauss | 1 | 6 | 9.05 |
| Manuel Stein | 2 | 4 | 4.49 |
| H. V. Poor | 3 | 25411 | 1951.66 |