This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 1Approximate Computing
- 1FIR Filters
- 1Ising machine
- 1Logarithmic Circuits
- 1Multiplier
- 1Stochastic Computing
-
An Ising Machine based on an Improved Parallel Annealing Algorithm for Solving Traveling Salesman Problems
DownloadFall 2022
Annealing-based Ising machines have shown promising results in solving combinatorial optimization problems. As a typical class of these problems, however, traveling salesman problems (TSPs) are very challenging to solve due to the constraints imposed on the solution. This thesis proposes a...
-
Fall 2015
The compact arithmetic units in stochastic computing can potentially lower the implementation cost with respect to silicon area and power consumption. In addition, stochastic computing provides inherent tolerance of transient errors at the cost of a less efficient signal encoding. Much effort has...
-
Hardware-Efficient Approximate Arithmetic Circuits for Deep Learning and Other Computation-Intensive Applications
DownloadSpring 2020
Approximate computing (AC) is an emerging paradigm that leverages the inherent error tolerance of many applications-such as image recognition, multimedia processing, and machine learning (ML)-to allow some accuracy to be traded off to save energy consumption. AC techniques can be applied at both...