In-Sensor Classification With Boosted Race Trees.
When extremely low-energy processing is required, the choice of data representation makes a tremendous difference. Each representation (e.g., frequency domain, residue coded, and log-scale) embodies a different set of tradeoffs based on the algebraic operations that are either easy or hard to perfor...
| Publicado en: | Communications of the ACM Vol. 64; no. 6; pp. 99 - 106 |
|---|---|
| Autores principales: | , , , , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Jun2021
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=150508516&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 150508516 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Jun2021 vid: 64 iid: 6 pid: 68 pub: Association for Computing Machinery artinfo: ui: 150508516 10.1145/3460223 ppf: 99 ppct: 7 formats: tig: atl: In-Sensor Classification With Boosted Race Trees. aug: au: Tzimpragos, Georgios Madhavan, Advait Vasudevan, Dilip Strukov, Dmitri Sherwood, Timothy affil: Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA, USA Physical Measurements Laboratory, National Institute of Standards and Technology, Gaithersburg, MD, USA Lawrence Berkeley National Laboratory, Berkeley, CA, USA Electrical and Computer Engineering Department, University of California at Santa Barbara, Santa Barbara, CA, USA su: Computer operating systems Computer architecture Analog function generators Computer logic sug: subj: Computer operating systems Computer architecture Analog function generators Computer logic ab: When extremely low-energy processing is required, the choice of data representation makes a tremendous difference. Each representation (e.g., frequency domain, residue coded, and log-scale) embodies a different set of tradeoffs based on the algebraic operations that are either easy or hard to perform in that domain. We demonstrate the potential of a novel form of encoding, race logic, in which information is represented as the delay in the arrival of a signal. Under this encoding, the ways in which signal delays interact and interfere with one another define the operation of the system. Observations of the relative delays (for example, the outcome of races between signals) define the output of the computation. Interestingly, completely standard hardware logic elements can be repurposed to this end and the resulting embedded systems have the potential to be extremely energy efficient. To realize this potential in a practical design, we demonstrate two different approaches to the creation of programmable tree-based ensemble classifiers in an extended set of race logic primitives; we explore the trade-offs inherent to their operation across sensor, hardware architecture, and algorithm; and we compare the resulting designs against traditional state-of-the-art hardware techniques. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2021 holdings: @attributes: islocal: N |
|---|