Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations

Patent Number: 10,445,065
Issued: 10/15/2019
Official Filing: View the Complete Patent
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 computer-implemented 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 naive algorithm. The naive 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.
Filed: 9/8/2017
Application Number: 15/699,077
Related Opportunity: Full Stack Neuromorphic
Government Interests: STATEMENT OF GOVERNMENT INTEREST This invention was made with Government support under Contract No. DE-NA0003525 awarded by the United States Department of Energy/National Nuclear Security Administration. The Government has certain rights in the invention.