The identification of parameter in a finite set under one-bit quantized observations
From MaRDI portal
Cites work
- A unified identification algorithm of FIR systems based on binary observations with time-varying thresholds
- An optimality property of the integer least-squares estimator
- Asymptotically efficient parameter estimation using quantized output observations
- Asymptotically efficient quasi-Newton type identification with quantized observations under bounded persistent excitations
- Bandwidth-constrained distributed estimation for wireless sensor Networks-part I: Gaussian case
- Channel Estimation and Performance Analysis of One-Bit Massive MIMO Systems
- Closest point search in lattices
- Covering convex bodies and the closest vector problem
- Finding closest lattice vectors using approximate Voronoi cells
- Fundamentals of Wireless Communication
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1825544 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Lattice sparsification and the approximate closest vector problem
- Optimization of lattices for quantization
- Probability: a graduate course
- Radar target recognition algorithm based on RCS observation sequence -- set-valued identification method
- Recursive projection algorithm on FIR system identification with binary-valued observations
- System identification using binary sensors
- System identification with quantized observations
- The hardness of the closest vector problem with preprocessing
- Threshold selection and resource allocation for quantized identification
- Universal Decentralized Estimation in a Bandwidth Constrained Sensor Network
This page was built for publication: The identification of parameter in a finite set under one-bit quantized observations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933808)
