The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Dec. 27, 2022

Filed:

Nov. 08, 2019
Applicant:

Tencent Technology (Shenzhen) Company Limited, Shenzhen, CN;

Inventors:

Xiaoyu Yu, Shenzhen, CN;

Yuwei Wang, Shenzhen, CN;

Bo Zhang, Shenzhen, CN;

Lixin Zhang, Shenzhen, CN;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 30/18 (2020.01); G06F 30/13 (2020.01); G06F 30/15 (2020.01); G06F 30/17 (2020.01); G06F 30/27 (2020.01); G06F 17/15 (2006.01); G06F 17/16 (2006.01); G06N 3/063 (2006.01);
U.S. Cl.
CPC ...
G06N 3/063 (2013.01); G06F 17/15 (2013.01); G06F 17/16 (2013.01); G06F 30/13 (2020.01); G06F 30/15 (2020.01); G06F 30/17 (2020.01); G06F 30/18 (2020.01); G06F 30/27 (2020.01);
Abstract

This application discloses a pooling processing method, applied to a pooling processing system of a convolutional neural network. The pooling processing system includes a first storage device, a data region, a pooling computation kernel, and a pooling controller. The method includes: reading, by the pooling controller, k pieces of feature data from the first storage device in each reading cycle, the k pieces of feature data being components in a feature map generated by a convolution operation of the convolutional neural network, and k being an integer greater than 1; writing, by the pooling controller, the k pieces of feature data read from the first storage device into the data region, wherein the k pieces of feature data form one group among n groups of k pieces of data with each group arranged in a first dimension and the n groups arranged in a second dimension, wherein the n groups of k pieces of data are written into the data region in an updating cycle, wherein a duration of the updating cycle is n times a duration of the reading cycle, and wherein n cis an integer greater than 1; and transmitting, after the updating cycle is ended, data in the data region to the pooling computation kernel to perform a pooling operation, wherein the data in the data region comprises the n groups of k pieces of data and last m groups of data from a previous updating cycle with each group along the second dimension, wherein the last m groups of data are temporarily stored in the data region for use in pooling calculation by the pooling computation kernel in a next updating cycle. The technical solution in this application reduces the number of storage, numbers of reading and writing due to data reuses, and improves the efficiency of pooling processing.


Find Patent Forward Citations

Loading…