𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound on the integral of the nonlinear filtering error

✍ Scribed by H. Barak

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
388 KB
Volume
7
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear lower bound on the unbounded er
A linear lower bound on the unbounded error probabilistic communication complexity
✍ JΓΌrgen Forster πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 187 KB

The main mathematical result of this paper may be stated as follows: Given a matrix MAfΓ€1; 1g nΓ‚n and any matrix MAR nΓ‚n such that signΓ° Mi;j Þ ΒΌ M i;j for all i; j; then rankΓ° MÞXn=jjMjj: Here jjMjj denotes the spectral norm of the matrix M: This implies a general lower bound on the complexity of

Approximate lower bound for the SNR of m
Approximate lower bound for the SNR of matched filters
✍ B.V.K. Vijaya Kumar; Venugopal V. Veeravalli πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 449 KB

## For the simple binary detection problem of detecting a known signal in the presence of additive noise, the matched.filter is well known to yield the highest output signalto-noise ratio (SNR). When the detection is carried out in discrete time, selecting an optimal Jilter length for a speciJc dete