arXiv (OAI Expanded)
open access
Asymptotically Efficient Recursive Identification Under One-Bit Communications Achieving Original CRLB
This paper develops an asymptotically efficient recursive identification algorithm for autoregressive systems with exogenous inputs under one-bit communications. In particular, the proposed method asymptotically achieves the Cramer-Rao lower bound (CRLB) based on the original data before quantizatio
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Asymptotically Efficient Recursive Identification Under One-Bit Communications Achieving Original CRLB#819313
- Quantum Barankin bounds beyond local unbiasedness: Analytic results for Gaussian states via a right-division framework#997068
- Criteria for unbiased estimation: applications to noise-agnostic sensing and quantum channel estimation#1116089
- On A Unified Cramér-Rao Bound Framework for Joint Delay-Doppler Estimation with Multi-Carrier Waveforms#792838
- On A Unified Cramér-Rao Bound Framework for Joint Delay-Doppler Estimation with Multi-Carrier Waveforms#788834
Record · ID 809320
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive