Pith. sign in

REVIEW

Asymptotic Performance Analysis for 1-bit Bayesian Smoothing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1511.05318 v1 pith:VX5SL2UO submitted 2015-11-17 cs.IT math.IT

Asymptotic Performance Analysis for 1-bit Bayesian Smoothing

classification cs.IT math.IT
keywords bayesianperformancesmoothingadditionalanalysisbeenestimationfiltering
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Energy-efficient signal processing systems require estimation methods operating on data collected with low-complexity devices. Using analog-to-digital converters (ADC) with $1$-bit amplitude resolution has been identified as a possible option in order to obtain low power consumption. The $1$-bit performance loss, in comparison to an ideal receiver with $\infty$-bit ADC, is well-established and moderate for low SNR applications ($2/\pi$ or $-1.96$ dB). Recently it has been shown that for parameter estimation with state-space models the $1$-bit performance loss with Bayesian filtering can be significantly smaller ($\sqrt{2/\pi}$ or $-0.98$ dB). Here we extend the analysis to Bayesian smoothing where additional measurements are used to reconstruct the current state of the system parameter. Our results show that a $1$-bit receiver performing smoothing is able to outperform an ideal $\infty$-bit system carrying out filtering by the cost of an additional processing delay $\Delta$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.