In-filter Computing For Designing Ultra-light Acoustic Pattern Recognizers

  title={In-filter Computing For Designing Ultra-light Acoustic Pattern Recognizers},
  author={Abhishek Nair and Shantanu Chakrabartty and Chetan Singh Thakur},
We present a novel in-filter computing framework that can be used for designing ultra-light acoustic classifiers for use in smart internet-of-things (IoTs). Unlike a conventional acoustic pattern recognizer, where the feature extraction and classification are designed independently, the proposed architecture integrates the convolution and nonlinear filtering operations directly into the kernels of a Support Vector Machine (SVM). The result of this integration is a template-based SVM whose… Expand


Binary Deep Neural Networks for Speech Recognition
Binary DNNs are utilized in speech recognition, which can achieve competitive performance and substantial speed up and results in much faster DNN inference since matrix multiplication is the most computationally expensive operation. Expand
Efficient FPGA-based architecture of an automatic wheeze detector using a combination of MFCC and SVM algorithms
Two hardware architectures (default and optimized) of the SVM classifier are implemented and compared in terms of resource utilization, maximum operating frequency, and power consumption for the Artix-7 XC7A100T FPGA Chip. Expand
Sub-Microwatt Analog VLSI Trainable Pattern Classifier
The design and implementation of an analog system-on-chip template-based pattern classifier for biometric signature verification at sub-microwatt power is presented and delivers real-time recognition accuracy on par with floating-point emulation in software. Expand
Neuromorphic In-Memory Computing Framework using Memtransistor Cross-bar based Support Vector Machines
This paper presents a novel framework for designing support vector machines (SVMs), which does not impose restriction on the SVM kernel to be positive-definite and allows the user to define memoryExpand
SVM speaker verification system based on a low-cost FPGA
Experimental results show as the implementation of a SVM (Support Vector Machines) speaker verification system on a low-cost FPGA is able to verify a person's identity as fast as a high-performance microprocessor based on a Pentium IV personal computer. Expand
Classification of acoustic events using SVM-based clustering schemes
This paper focuses on the problem of classifying 16 types of meeting-room acoustic events and develops several classifiers based on support vector machines (SVM) using confusion matrix based clustering schemes to deal with the multi-class problem. Expand
Content-based audio classification and retrieval by support vector machines
  • G. Guo, S. Li
  • Computer Science, Medicine
  • IEEE Trans. Neural Networks
  • 2003
The SVMs with a binary tree recognition strategy are used to tackle the audio classification problem and experimental comparisons for audio retrieval are presented to show the superiority of this novel metric, called distance-from-boundary (DFB). Expand
Hardware-based support vector machine for phoneme classification
This paper presents the design of a digital hardware implementation based on Support Vector Machines (SVMs), for the task of multi-speaker phoneme recognition, and a priority scheme was also included in the architecture, in order to forecast the three most likely phonemes. Expand
Detection of human speech in structured noise
  • J. Hoyt, H. Wechsler
  • Computer Science
  • Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing
  • 1994
This paper describes research to develop an efficient system that provides a binary decision as to the presence of speech in a short (one to three second) time sample of an acoustic signal. A methodExpand
A FPGA Implementation of the CAR-FAC Cochlear Model
The fully digital reconfigurable CAR-FAC system is stable, scalable, easy to use, and provides an excellent input stage to more complex machine hearing tasks such as sound localization, sound segregation, speech recognition, and so on. Expand