Mario Osta

Dr. Mario Osta

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2018
Verified
Conference Paper
Closed access
Ali IbrahimAli Ibrahim
Ali Ibrahim
MOMario Osta
Mario Osta
MAMohamad Alameh
Mohamad Alameh
MSMoustafa Saleh
Moustafa Saleh
Hussein ChibleHussein Chible
Hussein Chible
Maurizio ValleMaurizio Valle
Maurizio Valle
Embedding Machine Learning enables integrating intelligence in recent application domains such as Internet of Things, portable healthcare systems, and wearable devices. This paper presents an assessment of approximate computing methods at algorithmic, architecture, and circuit levels and draws perspectives for further developments and applications. The main goal is to investigate how approximate computing may reduce the complexity and enable the feasibility of embedded Machine Learning (ML) systems. Though ML is a powerful paradigm for applications in the perceptual domain (i.e. vision, touch, hearing, etc.), their computational complexity is very high and consequently real time operation and ultra-low power are still very challenging objectives. On the other hand, approximate computing has emerged as an effective solution to reduce hardware complexity, time latency and to increase energy efficiency.

8 January 2022 in Electronics
Verified
Journal Article
Open access
PDF file
MOMario Osta
Mario Osta
Ali IbrahimAli Ibrahim
Ali Ibrahim
Maurizio ValleMaurizio Valle
Maurizio Valle
In this paper, we demonstrate the feasibility and efficiency of approximate computing techniques (ACTs) in the embedded Support Vector Machine (SVM) tensorial kernel circuit implementation in tactile sensing systems. Improving the performance of the embedded SVM in terms of power, area, and delay can be achieved by implementing approximate multipliers in the SVD. Singular Value Decomposition (SVD) is the main computational bottleneck of the tensorial kernel approach; since digital multipliers are extensively used in SVD implementation, we aim to optimize the implementation of the multiplier circuit. We present the implementation of the approximate SVD circuit based on the Approximate Baugh-Wooley (Approx-BW) multiplier. The approximate SVD achieves an energy consumption reduction of up to 16% at the cost of a Mean Relative Error decrease (MRE) of less than 5%. We assess the impact of the approximate SVD on the accuracy of the classification; showing that approximate SVD increases the Error rate (Err) within a range of one to eight percent. Besides, we propose a hybrid evaluation test approach that consists of implementing three different approximate SVD circuits having different numbers of approximated Least Significant Bits (LSBs). The results show that energy consumption is reduced by more than five percent with the same accuracy loss.