Asymptotic Performance Analysis for 1-bit Bayesian Smoothing

November 17, 2015 Β· Declared Dead Β· πŸ› IEEE International Conference on Acoustics, Speech, and Signal Processing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Lin Zhang, Manuel Stein, Josef A. Nossek arXiv ID 1511.05318 Category cs.IT: Information Theory Citations 0 Venue IEEE International Conference on Acoustics, Speech, and Signal Processing Last Checked 4 months ago
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/Ο€$ 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/Ο€}$ 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 $Ξ”$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted