2019 IEEE International Symposium on Information Theory (ISIT) 2019
DOI: 10.1109/isit.2019.8849626
|View full text |Cite
|
Sign up to set email alerts
|

Binary Recursive Estimation on Noisy Hardware

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 21 publications
0
7
0
Order By: Relevance
“…In order to reduce its energy consumption, the quantized Kalman filter can be implemented on unreliable hardware [ 8 , 10 , 11 , 12 ]. Here, we assume, as in [ 10 , 12 ], that only the memory is faulty. In this case, each memory cell of a memory bank has a bit flipping probability p .…”
Section: System Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to reduce its energy consumption, the quantized Kalman filter can be implemented on unreliable hardware [ 8 , 10 , 11 , 12 ]. Here, we assume, as in [ 10 , 12 ], that only the memory is faulty. In this case, each memory cell of a memory bank has a bit flipping probability p .…”
Section: System Modelmentioning
confidence: 99%
“…The robustness to unreliability in computation operations and memories has been investigated for several signal processing and machine-learning applications, including binary recursive estimation [ 10 ], binary linear transformation [ 11 ], deep neural networks [ 12 , 13 ], multi-agent systems [ 14 ] and distributed logistic regression [ 15 ]. Moreover, several techniques have been proposed to compensate for faults introduced by unreliable systems.…”
Section: Introductionmentioning
confidence: 99%
“…In order to reduce its energy consumption, the Kalman filter can be implemented using unreliable hardware. Here, we assume, as in [18], that only the memory is faulty. In this case, each memory cell has a bit flipping probability p. We use the model of [10] to express p with respect to the memory cell energy consumption e as p = exp(−ea) ,…”
Section: Unreliable Implementation Of the Filtermentioning
confidence: 99%
“…Therefore, in the Kalman filter, instead of having an estimate componentx we have a possibly incorrect estimate componentx. Using the binary representation given in Section 2.2, we define an energy per memory cell vector: As the filter would be particularly sensitive to a fault on the sign bit,we consider a sign-preserving model, as in [18]. This can be implemented by storing the sign bits in a reliable memory.…”
Section: Unreliable Implementation Of the Filtermentioning
confidence: 99%
See 1 more Smart Citation