IP Library Granted Patent US 12,730,634
Granted Patent B2
US 12,730,634 · App. 19/024,955 · Granted Sep 8, 2026

Neural network compute tile

Inventors: Olivier Temam (Antony, FR); Ravi Narayanaswami (San Jose, CA); Harshit Khaitan (San Jose, CA); Dong Hyuk Woo (San Jose, CA)
Assignee: Google LLC
G06F9/3001G06F9/30036G06F9/30065G06F9/3824G06F13/28G06N3/04G06N3/063
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,730,634
App. No.
19/024,955
Granted
Sep 8, 2026
Kind
B2
Abstract

A computing unit is disclosed, comprising a first memory bank for storing input activations and a second memory bank for storing parameters used in performing computations. The computing unit includes at least one cell comprising at least one multiply accumulate (“MAC”) operator that receives parameters from the second memory bank and performs computations. The computing unit further includes a first traversal unit that provides a control signal to the first memory bank to cause an input activation to be provided to a data bus accessible by the MAC operator. The computing unit performs one or more computations associated with at least one element of a data array, the one or more computations being performed by the MAC operator and comprising, in part, a multiply operation of the input activation received from the data bus and a parameter received from the second memory bank.

Claims (30)

1 . A machine learning accelerator comprising a tensor traversal unit (TTU) configured to track a respective state of a plurality tensors being processed,

wherein the TTU comprises, for each tensor of the plurality of tensors being processed:

a plurality of counter registers,

a plurality of stride registers, and

a plurality of limit registers,

wherein the TTU is configured to perform operations comprising:

generating an address for a particular tensor element of a tensor based on values stored in respective counter registers, stride registers, and limit registers for the tensor, wherein the machine learning accelerator is configured to obtain one or more tensor values from memory based on the generated address;

receiving an indication of an element of a tensor being committed to the memory; and

in response, incrementing one or more counter registers for the tensor.

2 . The machine learning accelerator of claim 1 , wherein the machine learning accelerator is configured to execute a plurality of different instruction types, and wherein the machine learning accelerator has a dedicated TTU for each instruction type of the plurality of instruction types.

3 . The machine learning accelerator of claim 2 , wherein the machine learning accelerator has a direct-memory-access TTU for a first type of instruction type and a control TTU for a second type of instruction.

4 . The machine learning accelerator of claim 1 , wherein a number of counter registers for each tensor corresponds to a depth of the tensor.

5 . The machine learning accelerator of claim 1 , wherein the machine learning accelerator comprises a narrow memory bank and a wide memory bank, and wherein the TTU is configured to generate an address into the narrow memory bank, the wide memory bank, or both.

6 . The machine learning accelerator of claim 5 , wherein the narrow memory bank is configured to store input activations, and wherein the wide memory bank is configured to store weights of a particular layer of a neural network.

7 . The machine learning accelerator of claim 1 , wherein the TTU is configured to generate multiple addresses on subsequent iterations while the machine learning accelerator executes a single instruction.

8 . A method performed by a machine learning accelerator comprising a tensor traversal unit (TTU) configured to track a respective state of a plurality tensors being processed,

wherein the TTU comprises, for each tensor of the plurality of tensors being processed:

a plurality of counter registers,

a plurality of stride registers, and

a plurality of limit registers,

wherein the method comprises:

generating an address for a particular tensor element of a tensor based on values stored in respective counter registers, stride registers, and limit registers for the tensor, wherein the machine learning accelerator is configured to obtain one or more tensor values from memory based on the generated address;

receiving an indication of an element of a tensor being committed to the memory; and

in response, incrementing one or more counter registers for the tensor.

9 . The method of claim 8 , further comprising executing a plurality of different instruction types, and wherein the machine learning accelerator has a dedicated TTU for each instruction type of the plurality of instruction types.

10 . The method of claim 9 , wherein the machine learning accelerator has a direct-memory-access TTU for a first type of instruction type and a control TTU for a second type of instruction.

11 . The method of claim 8 , wherein a number of counter registers for each tensor corresponds to a depth of the tensor.

12 . The method of claim 8 , wherein the machine learning accelerator comprises a narrow memory bank and a wide memory bank, and wherein the method further comprises generating an address into the narrow memory bank, the wide memory bank, or both.

13 . The method of claim 12 , wherein the narrow memory bank is configured to store input activations, and wherein the wide memory bank is configured to store weights of a particular layer of a neural network.

14 . The method of claim 8 , further comprising generating multiple addresses on subsequent iterations while the machine learning accelerator executes a single instruction.

Assignments (3)
CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNOR'S EXECUTION DATE PREVIOUSLY RECORDED AT REEL: 69966 FRAME: 898. ASSIGNOR(S) HEREBY CONFIRMS THE ENTITY CONVERSION. Recorded May 16, 2026
From: GOOGLE INC.
To: GOOGLE LLC
Reel/Frame 075628/0152 →
CHANGE OF NAME Recorded Jan 21, 2025
From: GOOGLE INC.
To: GOOGLE LLC
Reel/Frame 069966/0898 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 21, 2025
From: TEMAM, OLIVIER; NARAYANASWAMI, RAVI; KHAITAN, HARSHIT; WOO, DONG HYUK
To: GOOGLE INC.
Reel/Frame 069945/0496 →
Continuity (5)
Continuation 18505743 · Nov 9, 2023
Continuation 17892807 · Aug 22, 2022
Continuation 16239760 · Jan 4, 2019
Continuation 15335769 · Oct 27, 2016
Related Publication 20250231765A1 · Jul 17, 2025
References Cited (194)
US 3754128A · Corinthios · 1973 [cited by applicant]
US 5138695A · Means et al. · 1992 [cited by applicant]
US 5267185A · Akabane et al. · 1993 [cited by applicant]
US 5299146A · Kanoh · 1994 [cited by applicant]
US 5400271A · Himeno · 1995 [cited by applicant]
US 5422983A · Castelaz et al. · 1995 [cited by applicant]
US 5471627A · Means et al. · 1995 [cited by applicant]
US 5742741A · Chiueh et al. · 1998 [cited by applicant]
US 5905757A · Kundmann et al. · 1999 [cited by applicant]
US 6067536A · Maruyama et al. · 2000 [cited by applicant]
US 6199057B1 · Tawel · 2001 [cited by applicant]
US 6243734B1 · Doshi et al. · 2001 [cited by applicant]
US 7426501B2 · Nugent · 2008 [cited by applicant]
US 7493498B1 · Schmidt et al. · 2009 [cited by applicant]
US 7620793B1 · Edmondson et al. · 2009 [cited by applicant]
US 7818729B1 · Plum et al. · 2010 [cited by applicant]
US 8321652B2 · Hinz · 2012 [cited by applicant]
US 9710265B1 · Temam et al. · 2017 [cited by applicant]
US 9710748B2 · Ross et al. · 2017 [cited by applicant]
US 9715642B2 · Szegedy et al. · 2017 [cited by applicant]
US 9721203B1 · Young et al. · 2017 [cited by applicant]
US 9818059B1 · Woo et al. · 2017 [cited by applicant]
US 9836691B1 · Narayanaswami et al. · 2017 [cited by applicant]
US 9875104B2 · Woo et al. · 2018 [cited by applicant]
US 9959498B1 · Narayanaswami et al. · 2018 [cited by applicant]
US 10572409B1 · Zejda et al. · 2020 [cited by applicant]
US 10621489B2 · Appuswanny et al. · 2020 [cited by applicant]
US 12061968B2 · Narayanaswami et al. · 2024 [cited by applicant]
US 20020044695A1 · Bostrom · 2002 [cited by applicant]
US 20070118727A1 · Noeske et al. · 2007 [cited by applicant]
US 20070124565A1 · Jones et al. · 2007 [cited by applicant]
US 20090128571A1 · Smith et al. · 2009 [cited by applicant]
US 20100030999A1 · Hinz · 2010 [cited by applicant]
US 20100031004A1 · Nakajima · 2010 [cited by applicant]
US 20100240330A1 · Fujisawa · 2010 [cited by applicant]
US 20110161624A1 · Flachs et al. · 2011 [cited by applicant]
US 20110161625A1 · Pechanek · 2011 [cited by applicant]
US 20110239032A1 · Masami et al. · 2011 [cited by applicant]
US 20120173004A1 · Radl · 2012 [cited by applicant]
US 20120303615A1 · Goswami et al. · 2012 [cited by applicant]
US 20130073497A1 · Akopyan et al. · 2013 [cited by applicant]
US 20140114893A1 · Arthur et al. · 2014 [cited by applicant]
US 20140115224A1 · Sanghai et al. · 2014 [cited by applicant]
US 20140169631A1 · Mizuno et al. · 2014 [cited by applicant]
US 20140188961A1 · Plotnikov et al. · 2014 [cited by applicant]
US 20140189288A1 · Hartono et al. · 2014 [cited by applicant]
US 20150071020A1 · Javanifard · 2015 [cited by applicant]
US 20150199963A1 · Maaninen · 2015 [cited by applicant]
US 20160026912A1 · Falcon et al. · 2016 [cited by applicant]
US 20160322042A1 · Vlietinck et al. · 2016 [cited by applicant]
US 20160328647A1 · Lin et al. · 2016 [cited by applicant]
US 20160342888A1 · Yang et al. · 2016 [cited by applicant]
US 20160358073A1 · Desjardins et al. · 2016 [cited by applicant]
US 20170220345A1 · Woo et al. · 2017 [cited by applicant]
US 20170221176A1 · Munteanu et al. · 2017 [cited by applicant]
US 20170316307A1 · Koster et al. · 2017 [cited by applicant]
US 20170323196A1 · Gibson et al. · 2017 [cited by applicant]
US 20180121377A1 · Woo et al. · 2018 [cited by applicant]
US 20180165577A1 · Young et al. · 2018 [cited by applicant]
US 20180189675A1 · Nurvitadhi et al. · 2018 [cited by applicant]
US 20180197068A1 · Narayanaswami et al. · 2018 [cited by applicant]
US 20180300624A1 · El-Khanny et al. · 2018 [cited by applicant]
US 20200012608A1 · Woo et al. · 2020 [cited by applicant]
US 20220067527A1 · Xu et al. · 2022 [cited by applicant]
US 20240289285A1 · Woo et al. · 2024 [cited by applicant]
US 20250045559A1 · Narayanaswami et al. · 2025 [cited by applicant]
CN 1445715A · 2003 [cited by applicant]
CN 101441441B · 2010 [cited by applicant]
CN 102037652A · 2011 [cited by applicant]
CN 102004751B · 2014 [cited by applicant]
CN 103761213A · 2014 [cited by applicant]
CN 103970720A · 2014 [cited by applicant]
CN 105230057A · 2016 [cited by applicant]
CN 105518625A · 2016 [cited by applicant]
CN 205139973U · 2016 [cited by applicant]
CN 106023065A · 2016 [cited by applicant]
CN 106127297A · 2016 [cited by applicant]
CN 106529511A · 2017 [cited by applicant]
CN 104463209B · 2017 [cited by applicant]
CN 207895435U · 2018 [cited by applicant]
CN 106023065B · 2019 [cited by applicant]
EP 0422348A2 · 1991 [cited by applicant]
EP 0156648B1 · 1992 [cited by applicant]
EP 0586999B1 · 1999 [cited by applicant]
JP S4874139A · 1973 [cited by applicant]
JP S5364439A · 1978 [cited by applicant]
JP S58134357A · 1983 [cited by applicant]
JP H03131965A · 1991 [cited by applicant]
JP H03251947A · 1991 [cited by applicant]
JP H05501317A · 1993 [cited by applicant]
JP H06139218A · 1994 [cited by applicant]
JP H07006146A · 1995 [cited by applicant]
JP H02273867A · 1995 [cited by applicant]
JP H10124473A · 1998 [cited by applicant]
JP H117432A · 1999 [cited by applicant]
JP 2001117900A · 2001 [cited by applicant]
JP 2003244190A · 2003 [cited by applicant]
JP 2009176110A · 2009 [cited by applicant]
JP 2010039625A · 2010 [cited by applicant]
JP 2010134697A · 2010 [cited by applicant]
JP 2013037488A · 2013 [cited by applicant]
WO WO1991019248A1 · 1991 [cited by applicant]
WO WO2005067572A3 · 2005 [cited by applicant]
WO WO2016118257A1 · 2016 [cited by applicant]
U.S. Appl. No. 15/014,265, filed Feb. 3, 2016, Woo et al. [cited by applicant]
‘cs231n.github.io’ [online], “CS231n Convolutional Neural Networks for Visual Recognition,” publication date not available, retrieved on Oct. 22, 2016, retrieved from URL<http://cs231n.github.io/neuralnetworks1/>, 13 pa… [cited by applicant]
‘pages.cs.wisc.edu’ [online], “A Basic Introduction to Neural Networks,” Apr. 30, 1996, retrieved on Oct. 22, 2016, retrieved from URL<http://pages.cs.wisc.edu/~bolo/shipyard/neural/local.html>, 5 pages. [cited by applicant]
Bates et al., “Configurable memory systems for embedded many-core processors,” CoRR, Submitted on Jan. 7, 2016, arXiv:1601.00894v2, 9 pages. [cited by applicant]
Bergstra, “Theano: Deep Learning on GPUs with Python,” Journal of Machine Learning Research, 2011, 4 pages. [cited by applicant]
Cabezas et al., “Automatic Parallelization of Kernels in Shared-Memory Multi-GPU Nodes,” Association for Computing Machinery, Jun. 2015, pp. 3-13. [cited by applicant]
Chang et al., “Recurrent Neural Networks Hardware Implementation FPGA,” CoRR, Submitted on Mar. 4, 2016, arXiv:1511.05552v4, 7 pages. [cited by applicant]
Chen et al., “DianNao: A Small-Footprint High-Throughput Accelerator for Ubiquitous Machine Learning,” ACM SIGARCH Computer Architecture News, Feb. 2014, 42(1):269-283. [cited by applicant]
Chen et al., “DaDianNao: A Machine-Learning Supercomputer,” Proceedings of the 47th Annual IEEE/ACM International Symposium on Microarchitecture, Cambridge, UK, Dec. 13-17, 2014, 14 pages. [cited by applicant]
Chen et al., “DianNao: A Small-Footprint High-Throughput Accelerator for Ubiquitous Machine-Learning,” ACM Sigplan Notices, Mar. 2014, 49(4):15 pages. [cited by applicant]
Chi et al., “PRIME: A Novel Processing-in-memory Architecture for Neural Network Computation in ReRAM-based Main Memory,” Proceedings of ISCA, 2016, 43:13 pages. [cited by applicant]
Curry et al., “Neural Networks, Linear functions and Neglected non-linearity,” Computational Management Science, Dec. 2003, 1:15-29. [cited by applicant]
Dauiltani et al., “Sparse Direct Convolutional Neural Network,” Advances in Neural Networks 14th International Symposium, Sapporo, Hakodate, and Muroran, Hokkaido, Japan, Jun. 21-26, 2017, pp. 293-303. [cited by applicant]
eli.thegreenplace.net [online], “Memory layout of multi-dimensional arrays,” Sep. 2015, retrieved on May 15, 2020, retrieved from URL <https://eli.thegreenplace.net/2015/nnennory-layout-of-multi-dimensional-arrays>, 12 … [cited by applicant]
Examination Report in Singaporean Appln. No. 11201903787Y, mailed on Jan. 12, 2021, 5 pages. [cited by applicant]
Extended European Search Report in European Appln. No. 22153266.6, mailed on Jul. 11, 2022, 10 pages. [cited by applicant]
Extended European Search Report in European Appln. No. 24186071.7, mailed on Nov. 11, 2024, 8 pages. [cited by applicant]
Farabet et al., “CNP: An FPGA-based processor for Convolutional Networks,” Paper, Presented at the International Conference on Field Programmable Logic and Applications, Prague, Czech Republic, Aug. 31-Sep. 2, 2009; Pro… [cited by applicant]
Guo et al., “Angel-Eye: A Complete Design Flow for Mapping CNN onto Customized Hardware,” Proceedings of the 2016 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), Pittsburgh, PA, Jul. 11-13, 2016, pp. 24-29. [cited by applicant]
Hoshi et al., “Neural Network Hardware Eliminating Negligible Connections,” The Institute of Electronics, Information and Communication Engineers, Jan. 1996, 2 pages (abstract only). [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/US2017/046963, mailed on Dec. 6, 2018, 10 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/US2017/047992, mailed on May 9, 2019, 9 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln No. PCT/US2017/049165, mailed on Dec. 1, 2017, 15 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/US2017/046963, mailed on Nov. 16, 2017, 17 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/US2017/047992, mailed on Nov. 16, 2017, 14 pages. [cited by applicant]
Kim et al., “A Large-scale Architecture for Restricted Boltzmann Machines,” IEEE International Symposium on Field-Programmable Custom Computing Machines, Boulder CO, Apr. 29-May 1, 2010, 8 pages. [cited by applicant]
Liu et al., “Efficient Sparse Matrix-Vector Multiplication on x86-Based Many-Core Processors,” ICS 13, Eugene OR, Jun. 10-14, 2013, 10 pages. [cited by applicant]
Liu et al., “Cambricon: an instruction set architecture for neural networks,” Proceedings of the 43rd ACM/IEEE International Symposium on Computer Architecture (ISCA'16), Seoul, South Korea, Jun. 18-22, 2016, pp. 393-40… [cited by applicant]
Lu et al., “SpWA: An Efficient Sparse Winograd Convolutional Neural Networks Accelerator on FPGAs,” Association of Computing Machinery, 2018, 6 pages. [cited by applicant]
Makita et al., “1.2Development of S/W Simulator for GFLOPS Neurochip,” Proceedings of the National Conference the 50th Symposium (Hardware), Mar. 15, 1995, pp. 63-64 (with machine translation). [cited by applicant]
Moons et al., “A 0.3-2.6 TOPS/W precision-scalable processor for real-time large-sclae ConvNets,” IEEE Symposium on VLSI Circuits, Honolulu HI, Jun. 15-17, 2016, 2 pages. [cited by applicant]
Mukunoki et al., “Implementation and Evaluation of Sparse Matric Iterative Solution Using Wuadruple-Preciion Operations on GPUs,” IPSJ SIG Technical Report, 2013, 9 pages. [cited by applicant]
Notice of Allowance in Japanese Appln. No. 2019-522728, mailed on Nov. 16, 2021, 7 pages (with machine translation). [cited by applicant]
Notice of Allowance in Japanese Appln. No. 2019-523062, mailed on Aug. 2, 2022, 5 pages (with English translation). [cited by applicant]
Notice of Allowance in Japanese Appln. No. 2021-123193, mailed on Sep. 13, 2022, 5 pages (with English translation). [cited by applicant]
Notice of Allowance in Japanese Appln. No. 2021-203544, mailed on Feb. 6, 2024, 7 pages (with machine translation). [cited by applicant]
Notice of Allowance in Korean Appln. No. 10-2019-7014238, mailed on Jul. 22, 2021, 4 pages (with English translation). [cited by applicant]
Notice of Allowance in Korean Appln. No. 10-2021-7033780, mailed on Jan. 20, 2022, 6 pages (with English translation). [cited by applicant]
Notice of Allowance in Korean Appln. No. 10-2022-7011447, mailed on Jan. 25, 2023, 4 pages (with English translation). [cited by applicant]
Notice of Allowance in Korean Appln. No. 10-2022-7015590, dated Jan. 30, 2023, 4 pages (with English Translation). [cited by applicant]
Notice of Allowance in Singapore Appln. No. 11201903631X, mailed on Nov. 27, 2024, 7 pages. [cited by applicant]
Office Action in British Appln. No. GB1714815.6, mailed on Feb. 8, 2018, 9 pages. [cited by applicant]
Office Action in Chinese Application No. 201710908258.5, mailed on May 21, 2021, 18 pages (with English translation). [cited by applicant]
Office Action in Chinese Appln. No. 201710889996.X, mailed on Jan. 25, 2021, 14 pages (with English translation). [cited by applicant]
Office Action in Chinese Appln. No. 201710889996.X, mailed on Jun. 24, 2020, 17 pages. [cited by applicant]
Office Action in Chinese Appln. No. 201710909908.8, mailed on May 18, 2021, 22 pages (with English translation). [cited by applicant]
Office Action in Chinese Appln. No. 201710909908.8, mailed on Nov. 24, 2021, 17 pages (with English translation). [cited by applicant]
Office Action in Chinese Appln. No. 201721254418.0, mailed on Feb. 28, 2018, 3 pages. [cited by applicant]
Office Action in European Appln. No. 17758698.9, mailed on Oct. 25, 2022, 5 pages. [cited by applicant]
Office Action in European Appln. No. 17765517.2, mailed on Aug. 11, 2020, 11 pages. [cited by applicant]
Office Action in German Appln. No. 102017120452.0, mailed on Jan. 25, 2023, 17 pages (with English translation). [cited by applicant]
Office Action in German Appln. No. 102017120588.8, mailed on Feb. 6, 2023, 16 pages (with English translation). [cited by applicant]
Office Action in Indian Appln. No. 201947016693, mailed on Apr. 8, 2021, 7 pages (with English translation). [cited by applicant]
Office Action in Indian Appln. No. 201947016694, mailed on Mar. 20, 2021, 6 pages (with English translation). [cited by applicant]
Office Action in Japanese Appln. No. 2019-522728, mailed on Dec. 1, 2020, 33 pages (with English translation). [cited by applicant]
Office Action in Japanese Appln. No. 2019-522877, mailed on Aug. 24, 2020, 30 pages (with English translation). [cited by applicant]
Office Action in Japanese Appln. No. 2019-523062, mailed on Apr. 6, 2021, 11 pages (with English translation). [cited by applicant]
Office Action in Japanese Appln. No. 2021-203544, mailed on Feb. 7, 2023, 6 pages (with English translation). [cited by applicant]
Office Action in Japanese Appln. No. 2021-203544, mailed on Oct. 10, 2023, 7 pages (with English Translation). [cited by applicant]
Office Action in Japanese Appln. No. 2022-163303, mailed on Aug. 22, 2023, 5 pages (with machine translation). [cited by applicant]
Office Action in Korean Appln. No. 10-2019-7012085, mailed on Jan. 4, 2021, 10 pages (with English translation). [cited by applicant]
Office Action in Korean Appln. No. 10-2022-7015590, mailed on Jul. 28, 2022, 8 pages (with English translation). [cited by applicant]
Office Action in Korean Appln. No. 10-2023-7013355, mailed on Jun. 2, 2023, 8 pages (with English translation). [cited by applicant]
Office Action in Singapore Appln. No. 11201903631X, mailed on Nov. 24, 2022, 6 pages. [cited by applicant]
Peemen et al., “Memory-centric accelerator design for Convolutional Neural Networks,” 2013 IEEE 31st International Conference on Computer Design, Asheville NC, Oct. 6-9, 2013, 7 pages. [cited by applicant]
Sankaradas et al., “A Massively Parallel Coprocessor for Convolutional Neural Networks,” Proceedings of the 2009 20th IEEE International Conference on Application-Specific Systems, Boston MA, Jul. 7-9, 2009, pp. 53-60. [cited by applicant]
Sato et al., “Sparse-Matrix Processor Based on Content Addressable Memory,” IPSJ SIG Technical Report, Jul. 18, 1990, 6 pages (with English abstract). [cited by applicant]
Satoshi Tsuda et al., “Proposal of Synthetic Aperture Radar Information Structurization by Using Neural Networks,” IEICE Technical Report, Aug. 20, 2015, pp. 31-36. [cited by applicant]
Search Report in Singapore Appln. No. 11201903631X, mailed on May 7, 2021, 5 pages. [cited by applicant]
Search Report in Singapore Appln. No. 11201903684R, mailed on May 7, 2021, 4 pages. [cited by applicant]
Seo et al., “Deep learning-based sentiment analysis research trends,” Journal of the Korean Multimedia Society, Sep. 2016, 20(3):8-22 (with Machine Translation). [cited by applicant]
Shafiee et al., “ISAAC: A Convolutional Neural Network Accelerator with In-Situ Analog Arithmetic in Crossbars,” 2016 ACM/IEEE 43 [cited by applicant]
Shimokawa et al., “Digital Neurocomputer, Multineuro,” Toshiba Review, Dec. 1991, 46(12):931-934 (English abstract). [cited by applicant]
Sitoh, “Deep Learning from Scratch—Deep learning theory and implementation—python,” O'Reilly Japan, Sep. 2016, 12 pages. [cited by applicant]
Siu et al., “Memory Requirements for Convolutional Neural Network Hardware Accelerators,” Institute of Electrical and Electronics Engineers, 2018, 11 pages. [cited by applicant]
Tan et al., “A comparative investigation of non-linear activation functions in neural controllers for search-based game AI engineering,” Artificial Intelligence Review, Jan. 2014, 41:1-25. [cited by applicant]
Uchizono et al, “Multiscale Transform for Dynamix Graph Signals” IEICE Technical Report, Jan. 2016, 12 pages. [cited by applicant]
ujjwalkarn.me [online], “An Intuitive Explanation of Convolutional Neural Networks,” Aug. 12, 2016, retrieved on May 15, 2020, retrieved from URL <ujjwalkarn.nne/2016/08/11/intuitive-explanation-convnets/>, 17 pages. [cited by applicant]
Watanabe et al., “A Cooperative Learning Algorithm for Multi-Layered Neural Networks by using a PC cluster,” IEICE Technical Report, Nov. 2000, 11 pages. [cited by applicant]
www.webopedia.com [online], “bus,” available on or before Nov. 11, 2014, via internet archive: Wayback Machine URL<https://web.archive.org/web/20141111152947/https://www.webopedia.com/TERM/B/bus.html>, retrieved on Dec.… [cited by applicant]
yaju3d.hatenablog.jp [online], “TensorFlowKoto Hajime Summary,” Apr. 17, 2016, retrieved on Nov. 4, 2024, retrieved from URL<https://yaju3d.hatenablog.jp/entry/2016/04/17/032555>, 17 pages (with machine translation). [cited by applicant]
Zeng et al., “Compressing and Accelerating Neural Network for Facial Point Localization,” Springer, 2018, pp. 359-367. [cited by applicant]
Zhang et al., “Error Evaluation for the Preconditioner Computer with Sherman-Morrison Formula and Its Re-construction,” IPSJ SIG Technical Report, 2006, 6 pages. [cited by applicant]
Zhang et al., “Optimizing FPGA-based Accelerator Design for Deep Convolutional Neural Networks,” Proceedings of the 2015 ACM/SIGDA International Symposium on Filed-Programmable Gate Arrays, Monterey CA, Feb. 22-24, 2015… [cited by applicant]
Zhang et al., “The Impulse Memory Controller,” Institute of Electrical and Electronics Engineers, 2001, 50(11):1117-1132. [cited by applicant]
Notice of Allowance in Chinese Appln. No. 202210121408.9, mailed on May 29, 2025, 6 pages (with English translation). [cited by applicant]
Notice of Allowance in Japanese Appln. No. 2024-074476, mailed on May 27, 2025, 5 pages (with English translation). [cited by applicant]
Office Action in Japanese Appln. No. 2024-033695, mailed on May 13, 2025, 6 pages (with English translation). [cited by applicant]
Office Action in Japanese Appln. No. 2024-060830, mailed on May 20, 2025, 4 pages (with English translation). [cited by applicant]
Office Action in German Appln. No. 102017121825.4, mailed on May 4, 2026, 12 pages (with English translation). [cited by applicant]