Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations
| DWPI Title: Method for increasing efficiency at which set of threshold gates, involves performing linear algebraic calculation in manner that is simultaneously efficient and at near constant depth by using set of threshold gates |
| 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 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. |
| Use: Method for increasing efficiency at which a set of threshold gates arranged as neuromorphic hardware to perform linear algebraic calculation by using a neuromorphic computer (claimed). |
| Advantage: The method enables providing the multi-threshold gates are required to communicate non-binary numbers of growing precision to subsequent stages of the algorithm, so that a sub-set of the set of threshold gates or spiking neurons are dedicated to communicate non-binary numbers that require to increase precision to define during subsequent stages of the calculation algorithm. |
| Novelty: The method (400) involves performing (402) linear algebraic calculation in a manner that is simultaneously efficient and at near constant depth by using a set of threshold gates, where efficient is defined as calculation algorithm that uses fewer of the set of threshold gates than nave algorithm, the nave algorithm is a straightforward algorithm for solving the linear algebraic calculation, constant depth is defined as algorithm that provides execution time that is independent of size of input to the linear algebraic calculation, and the near constant depth comprises computing depth equal to or between and the constant depth. |
| Filed: 9/8/2017 |
| Application Number: US15699077A |
| Tech ID: SD 14103.0 |
| 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. |
| Data from Derwent World Patents Index, provided by Clarivate All rights reserved. Republication or redistribution of Clarivate content, including by framing or similar means, is prohibited without the prior written consent of Clarivate. Clarivate and its logo, as well as all other trademarks used herein are trademarks of their respective owners and used under license. |