TY - GEN

T1 - Case studies of logical computation on stochastic bit streams

AU - Li, Peng

AU - Qian, Weikang

AU - Lilja, David J

AU - Bazargan, Kia

AU - Riedel, Marc

PY - 2013/12/1

Y1 - 2013/12/1

N2 - Most digital systems operate on a positional representation of data, such as binary radix. An alternative is to operate on random bit streams where the signal value is encoded by the probability of obtaining a one versus a zero. This representation is much less compact than binary radix. However, complex operations can be performed with very simple logic. Furthermore, since the representation is uniform, with all bits weighted equally, it is highly tolerant of soft errors (i.e., bit flips). Both combinational and sequential constructs have been proposed for operating on stochastic bit streams. Prior work has shown that combinational logic can implement multiplication and scaled addition effectively; linear finitestate machines (FSMs) can implement complex functions such as exponentiation and tanh effectively. Building on these prior results, this paper presents case studies of useful circuit constructs implement with the paradigm of logical computation on stochastic bit streams. Specifically, it describes finite state machine implementations of functions such as edge detection and median filter-based noise reduction.

AB - Most digital systems operate on a positional representation of data, such as binary radix. An alternative is to operate on random bit streams where the signal value is encoded by the probability of obtaining a one versus a zero. This representation is much less compact than binary radix. However, complex operations can be performed with very simple logic. Furthermore, since the representation is uniform, with all bits weighted equally, it is highly tolerant of soft errors (i.e., bit flips). Both combinational and sequential constructs have been proposed for operating on stochastic bit streams. Prior work has shown that combinational logic can implement multiplication and scaled addition effectively; linear finitestate machines (FSMs) can implement complex functions such as exponentiation and tanh effectively. Building on these prior results, this paper presents case studies of useful circuit constructs implement with the paradigm of logical computation on stochastic bit streams. Specifically, it describes finite state machine implementations of functions such as edge detection and median filter-based noise reduction.

UR - http://www.scopus.com/inward/record.url?scp=84893352759&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893352759&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-36157-9_24

DO - 10.1007/978-3-642-36157-9_24

M3 - Conference contribution

AN - SCOPUS:84893352759

SN - 9783642361562

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 235

EP - 244

BT - Integrated Circuit and System Design

T2 - 22nd International Workshop on Power and Timing Modeling, Optimization and Simulation, PATMOS 2012

Y2 - 4 September 2012 through 6 September 2012

ER -