Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations
Abstract
A method of increasing an efficiency at which a plurality of threshold gates arranged as neuromorphic hardware is able to perform a linear algebraic calculation having a dominant size of N. The computerimplemented method includes using the plurality of threshold gates to perform the linear algebraic calculation in a manner that is simultaneously efficient and at a near constant depth. “Efficient” is defined as a calculation algorithm that uses fewer of the plurality of threshold gates than a naïve algorithm. The naïve algorithm is a straightforward algorithm for solving the linear algebraic calculation. “Constant depth” is defined as an algorithm that has an execution time that is independent of a size of an input to the linear algebraic calculation. The near constant depth comprises a computing depth equal to or between O(log(log(N)) and the constant depth.
 Inventors:
 Issue Date:
 Research Org.:
 Sandia National Lab. (SNLNM), Albuquerque, NM (United States)
 Sponsoring Org.:
 USDOE
 OSTI Identifier:
 1600161
 Patent Number(s):
 10445065
 Application Number:
 15/699,077
 Assignee:
 National Technology & Engineering Solutions of Sandia, LLC (Albuquerque, NM)
 Patent Classifications (CPCs):

G  PHYSICS G06  COMPUTING G06N  COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
G  PHYSICS G06  COMPUTING G06F  ELECTRIC DIGITAL DATA PROCESSING
 DOE Contract Number:
 NA0003525
 Resource Type:
 Patent
 Resource Relation:
 Patent File Date: 09/08/2017
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICS AND COMPUTING
Citation Formats
Aimone, James Bradley, Parekh, Ojas D., and Phillips, Cynthia A. Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations. United States: N. p., 2019.
Web.
Aimone, James Bradley, Parekh, Ojas D., & Phillips, Cynthia A. Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations. United States.
Aimone, James Bradley, Parekh, Ojas D., and Phillips, Cynthia A. Tue .
"Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations". United States. https://www.osti.gov/servlets/purl/1600161.
@article{osti_1600161,
title = {Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations},
author = {Aimone, James Bradley and Parekh, Ojas D. and Phillips, Cynthia A.},
abstractNote = {A method of increasing an efficiency at which a plurality of threshold gates arranged as neuromorphic hardware is able to perform a linear algebraic calculation having a dominant size of N. The computerimplemented method includes using the plurality of threshold gates to perform the linear algebraic calculation in a manner that is simultaneously efficient and at a near constant depth. “Efficient” is defined as a calculation algorithm that uses fewer of the plurality of threshold gates than a naïve algorithm. The naïve algorithm is a straightforward algorithm for solving the linear algebraic calculation. “Constant depth” is defined as an algorithm that has an execution time that is independent of a size of an input to the linear algebraic calculation. The near constant depth comprises a computing depth equal to or between O(log(log(N)) and the constant depth.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2019},
month = {10}
}