US20190073219A1 - Apparatus and methods for vector operations - Google Patents

Apparatus and methods for vector operations Download PDF

Info

Publication number
US20190073219A1
US20190073219A1 US16/171,987 US201816171987A US2019073219A1 US 20190073219 A1 US20190073219 A1 US 20190073219A1 US 201816171987 A US201816171987 A US 201816171987A US 2019073219 A1 US2019073219 A1 US 2019073219A1
Authority
US
United States
Prior art keywords
vector
bitwise
elements
address
length
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US16/171,987
Inventor
Tao Luo
Tian Zhi
Shaoli Liu
Tianshi Chen
Yunji Chen
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Cambricon Technologies Corp Ltd
Original Assignee
Cambricon Technologies Corp Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Cambricon Technologies Corp Ltd filed Critical Cambricon Technologies Corp Ltd
Assigned to CAMBRICON TECHNOLOGIES CORPORATION LIMITED reassignment CAMBRICON TECHNOLOGIES CORPORATION LIMITED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: LUO, TAO, LIU, SHAOLI, CHEN, Tianshi, CHEN, Yunji, ZHI, Tian
Priority to US16/250,148 priority Critical patent/US11126429B2/en
Publication of US20190073219A1 publication Critical patent/US20190073219A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/38Concurrent instruction execution, e.g. pipeline or look ahead
    • G06F9/3836Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution
    • G06F9/3838Dependency mechanisms, e.g. register scoreboarding
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003Arrangements for executing specific machine instructions
    • G06F9/30007Arrangements for executing specific machine instructions to perform operations on data operands
    • G06F9/30036Instructions to perform operations on packed data, e.g. vector, tile or matrix operations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/16Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003Arrangements for executing specific machine instructions
    • G06F9/30007Arrangements for executing specific machine instructions to perform operations on data operands
    • G06F9/30029Logical and Boolean instructions, e.g. XOR, NOT
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003Arrangements for executing specific machine instructions
    • G06F9/3004Arrangements for executing specific machine instructions to perform operations on memory
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003Arrangements for executing specific machine instructions
    • G06F9/3004Arrangements for executing specific machine instructions to perform operations on memory
    • G06F9/30043LOAD or STORE instructions; Clear instruction
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks

Definitions

  • Multilayer neural networks are widely applied to the fields such as pattern recognition, image processing, functional approximation and optimal computation.
  • multilayer artificial neural networks have received increasing attention by academic and industrial communities. More specifically, logical operations for vectors may be performed frequently in deep learning processes in MMNs.
  • a known method to perform logical operations for vectors in a multilayer artificial neural network is to use a general-purpose processor.
  • one of the defects of the method is low performance of a single general-purpose processor which cannot meet performance requirements for usual multilayer neural network operations with respect to a vector with a large number of elements.
  • GPU graphics processing unit
  • SIMD single-instruction-multiple-data
  • the example apparatus may include a vector caching unit configured to store a first vector and a second vector, wherein the first vector includes one or more first elements and the second vector includes one or more second elements.
  • the example apparatus may further include a computation module that includes one or more bitwise processors and a combiner.
  • the bitwise processors may be configured to perform bitwise operations between each of the first elements and a corresponding one of the second elements to generate one or more operation results.
  • the combiner may be configured to combine the one or more operation results into an output vector.
  • Another example apparatus may include a vector caching unit configured to store a vector that includes one or more elements.
  • the example apparatus may further include a computation module that includes one or more bitwise processors configured to perform bitwise operations to the one or more elements to generate an output result.
  • the example aspect of the present disclosure provides an example method for vector operations in a neural network.
  • the example method may include storing, by a vector caching unit, a first vector and a second vector, wherein the first vector includes one or more first elements and the second vector includes one or more second elements; performing, by one or more bitwise processors of a computation module, bitwise operations between each of the first elements and a corresponding one of the second elements to generate one or more operation results; and combining, by a combiner of the computation module, the one or more operation results into an output vector.
  • Another example method may include storing, by a vector caching unit, a vector that includes one or more elements; and performing, by one or more bitwise processors of a computation module, bitwise operations to the one or more elements to generate an output result.
  • the one or more aspects comprise the features herein after fully described and particularly pointed out in the claims.
  • the following description and the annexed drawings set forth in detail certain illustrative features of the one or more aspects. These features are indicative, however, of but a few of the various ways in which the principles of various aspects may be employed, and this description is intended to include all such aspects and their equivalents.
  • FIG. 1 illustrates a block diagram of an example neural network acceleration processor by which vector operations may be implemented in a neural network
  • FIG. 2A illustrates an example logical operation process between two vectors that may be performed by the example neural network acceleration processor
  • FIG. 2B illustrates an example logical operation process that may be performed by the example neural network acceleration processor
  • FIG. 3 illustrates an example computation module in the example neural network acceleration processor by which vector operations may be implemented in a neural network
  • FIG. 4 illustrates a flow chart of an example method for performing logical operations between two vectors in a neural network
  • FIG. 5 illustrates a flow chart of an example method for performing logical operation for a vector in a neural network.
  • a vector may refer to one or more values formatted in a one-dimensional data structure.
  • the values included in a vector may be referred to as elements.
  • the number of the elements in the vector may be referred to as a length of the vector.
  • the vector operations may include a logical AND between two vectors, a logical OR between two vectors, a logical AND for the elements in a vector, and a logical OR for the elements in a vector.
  • FIG. 1 illustrates a block diagram of an example neural network acceleration processor by which vector operations may be implemented in a neural network.
  • the example neural network acceleration processor 100 may include an instruction caching unit 104 , a controller unit 106 , a direct memory access unit 102 , a computation module 110 , and a vector caching unit 112 .
  • Any of the above-mentioned components or devices may be implemented by a hardware circuit (e.g., application specific integrated circuit (ASIC), Coarse-grained reconfigurable architectures (CGRAs), field-programmable gate arrays (FPGAs), analog circuits, memristor, etc.).
  • ASIC application specific integrated circuit
  • CGRAs Coarse-grained reconfigurable architectures
  • FPGAs field-programmable gate arrays
  • analog circuits memristor, etc.
  • a vector bitwise operation instruction may originate from an instruction storage device 134 to the controller unit 106 .
  • An instruction obtaining module 132 may be configured to obtain a vector bitwise operation instruction from the instruction storage device 134 and transmit the instruction to a decoding module 130 .
  • the decoding module 130 may be configured to decode the instruction.
  • the instruction may include one or more operation fields that indicate parameters for executing the instruction.
  • the parameters may refer to identification numbers of different registers (“register ID” hereinafter) in the instruction register 126 .
  • register ID identification numbers of different registers
  • the neural network acceleration processor 100 may modify the instruction without receiving new instructions.
  • the decoded instruction may be transmitted by the decoding module 130 to an instruction queue module 128 .
  • the one or more operation fields may store immediate values such as addresses in the memory 101 and a scalar value, rather than the register IDs.
  • the instruction queue module 128 may be configured to temporarily store the received instruction and/or one or more previously received instructions. Further, the instruction queue module 128 may be configured to retrieve information according to the register IDs included in the instruction from the instruction register 126 .
  • the instruction queue module 128 may be configured to retrieve information corresponding to operation fields in the instruction from the instruction register 126 .
  • Information for the operation fields in a vector-AND instruction may include a starting address of a vector, a length of the vector, and an address for an output result.
  • the instruction register 126 may be implemented by one or more registers external to the controller unit 106 .
  • the instruction may be sent to a dependency processing unit 124 .
  • the dependency processing unit 124 may be configured to determine whether the vector bitwise operation instruction has a dependency relationship with the data of the previous instruction that is being executed. This vector bitwise operation instruction may be stored in the storage queue module 122 until it has no dependency relationship on the data with the previous instruction that has not finished executing. If the dependency relationship does not exist, the controller unit 106 may be configured to decode the vector bitwise operation into micro-instructions for controlling operations of other modules including the direct memory access unit 102 and the computation module 110 .
  • the controller unit 106 may receive a vector-AND-vector (VAV) instruction that includes a starting address of a first vector, a length of the first vector, a starting address of a second vector, a length of the second vector, and an address for an output vector.
  • VAV vector-AND-vector
  • the direct memory access unit 102 may be configured to retrieve the first vector and the second vector from the memory 101 according to the respective addresses included in the VAV instruction.
  • the retrieved vectors may be transmitted to and stored in the vector caching unit 112 .
  • the controller unit 106 may receive a vector-AND (VAND) instruction that includes a starting address of a vector, a length of the vector, and an address for an output result.
  • VAND vector-AND
  • the direct memory access unit 102 may be configured to retrieve the vector from the memory 101 according to the address.
  • the vector may be transmitted to and stored in the vector caching unit 112 .
  • the controller unit 106 may receive a vector-OR-vector (VOV) instruction that includes a starting address of a first vector, a length of the first vector, a starting address of a second vector, a length of the second vector, and an address for an output vector.
  • VOV vector-OR-vector
  • the direct memory access unit 102 may be configured to retrieve the first vector and the second vector from the memory 101 according to the respective addresses included in the VOV instruction. The retrieved vectors may be transmitted to and stored in the vector caching unit 112 .
  • the controller unit 106 may receive a vector-OR (VOR) instruction that includes a starting address of a vector, a length of the vector, and an address for an output result.
  • VOR vector-OR
  • the direct memory access unit 102 may be configured to retrieve the vector from the memory 101 according to the address.
  • the vector may be transmitted to and stored in the vector caching unit 112 .
  • the above mentioned instructions may be formatted as follows and may be stored in the instruction caching unit 104 :
  • Register 0 Register 1 Register 2 Register 3 Register 4 VAV Starting Length of Starting Length of Address for address the first address of the second output of the first vector the second vector vector vector vector VAND Starting Length of Output address the vector result of a vector VOV Starting Length of Starting Length of Address for address the first address of the second output of the first vector the second vector vector vector vector VOR Starting Length of Output address the vector result of a vector
  • a caching unit may refer to an on-chip caching unit integrated in the neural network acceleration processor 100 , rather than other storage devices in memory 101 or other external devices.
  • the on-chip caching unit may be implemented as a register file, an on-chip buffer, an on-chip Static Random Access Memory (SRAM), or other types of on-chip storage devices that may provide higher access speed than the external memory.
  • the instruction register 126 may be implemented as a scratchpad memory, e.g., Dynamic random-access memory (DRAM), embedded DRAM (eDRAM), memristor, 3D-DRAM, non-volatile memory, etc.
  • FIG. 2A illustrates an example logical operation process between two vectors that may be performed by the example neural network acceleration processor.
  • a first vector may include one or more elements respectively denoted as A( 1 ), A( 2 ), . . . A(n) and, similarly, a second vector (“Vector B”) may include one or more elements respectively denoted as B( 1 ), B( 2 ), . . . B(n).
  • the elements in the first vector may be referred to as first elements.
  • the elements in the second vector may be referred to as second elements.
  • the computation module 110 may include one or more bitwise processors and a combiner.
  • each of the bitwise processors may be configured to perform a bitwise AND operation between a first element in the first vector to a corresponding second element in the second vector e.g., A( 1 ) AND B( 1 ), A( 2 ) AND B( 2 ), . . . A(n) AND B(n).
  • a bitwise AND operation may refer to an operation between two values that only yields a value of “1” if both the two values are 1.
  • the operation results generated respectively by the bitwise processors may be directly transmitted to a combiner. In other words, the operation results may be transmitted to the combiner without being temporarily stored in the vector caching unit 112 .
  • the combiner may be configured to combine the operation results to generate an output vector.
  • the output vector may be represented as A( 1 ) AND B( 1 ), A( 2 ) AND B( 2 ), . . . A(n) AND B(n).
  • each of the bitwise processors may be configured to perform a bitwise OR operation between a first element in the first vector to a corresponding second element in the second vector e.g., A( 1 ) OR B( 1 ), A( 2 ) OR B( 2 ), . . . A(n) OR B(n).
  • a bitwise OR operation may refer to an operation between two values that yields a value of “1” if either the two values is 1.
  • the operation results generated respectively by the bitwise processors may be directly transmitted to a combiner without being temporarily stored in the vector caching unit 112 .
  • the combiner may be configured to combine the operation results to generate an output vector.
  • the output vector may be represented as A( 1 ) OR B( 1 ), A( 2 ) OR B( 2 ), . . . A(n) OR B(n).
  • FIG. 2B illustrates an example logical operation process that may be performed by the example neural network acceleration processor.
  • the computation module 110 may be configured to perform logical operation to a vector (“Vector A”).
  • the vector may include one or more elements respectively denoted as A( 1 ), A( 2 ), . . . A(n).
  • the computation module 110 may include one or more bitwise processors.
  • the one or more bitwise processors may be configured to perform a bitwise AND operation for all the elements in the vector to generate an output result.
  • the output result is a value of 1 only when all the elements in the vector are 1.
  • the one or more bitwise processors may be configured to perform a bitwise OR operation for all the elements in the vector to generate an output result.
  • the output result is a value of 1 when at least one of the elements in the vectors is 1.
  • FIG. 3 illustrates an example computation module 110 in the example neural network acceleration processor by which vector operations may be implemented in a neural network.
  • the computation module 110 may include a computation unit 302 , a data dependency relationship determination unit 304 , a neuron caching unit 306 .
  • the computation unit 302 may further include one or more bitwise processors 310 and a combiner 318 .
  • the data dependency relationship determination unit 304 may be configured to perform data access operations (e.g., reading or writing operations) on the caching units including the neuron caching unit 306 during the computation process.
  • the data dependency relationship determination unit 304 may be configured to prevent conflicts in reading and writing of the data in the caching units.
  • the data dependency relationship determination unit 304 may be configured to determine whether there is dependency relationship in terms of data between a micro-instruction which to be executed and a micro-instruction being executed. If no dependency relationship exists, the micro-instruction may be allowed to be executed; otherwise, the micro-instruction may not be allowed to be executed until all micro-instructions on which it depends have been executed completely.
  • the dependency relationship may be determined when a target operation range of the micro-instruction to be executed overlaps a target operation range of a micro-instruction being executed.
  • all micro-instructions sent to the data dependency relationship determination unit 304 may be stored in an instruction queue within the data dependency relationship determination unit 304 .
  • the instruction queue may indicate the relative priorities of the stored micro-instructions. In the instruction queue, if the target operation range of reading data by a reading instruction conflicts with or overlaps the target operation range of writing data by a writing instruction of higher priority in the front of the instruction queue, then the reading instruction may not be executed until the writing instruction is executed.
  • the neuron caching unit 306 may be configured to store the elements in the first vector and the second vector.
  • the computation unit 302 may be configured to receive the micro-instructions decoded from the vector operation instruction from the controller unit 106 .
  • each of the bitwise processors 310 may be configured to perform a bitwise AND operation between a first element in the first vector to a corresponding second element in the second vector e.g., A( 1 ) AND B( 1 ), A( 2 ) AND B( 2 ), . . . A(n) AND B(n).
  • the operation results generated respectively by the bitwise processors 310 may be directly transmitted to the combiner 318 .
  • the operation results may be transmitted to the combiner without being temporarily stored in the vector caching unit 112 .
  • the combiner 318 may be configured to combine the operation results to generate an output vector.
  • the output vector may be represented as A( 1 ) AND B( 1 ), A( 2 ) AND B( 2 ), . . . A(n) AND B(n).
  • each of the bitwise processors 310 may be configured to perform a bitwise OR operation between a first element in the first vector to a corresponding second element in the second vector e.g., A( 1 ) OR B( 1 ), A( 2 ) OR B( 2 ), . . . A(n) OR B(n).
  • a bitwise OR operation may refer to an operation between two values that yields a value of “1” if either the two values is 1.
  • the operation results generated respectively by the bitwise processors 310 may be directly transmitted to the combiner 318 without being temporarily stored in the vector caching unit 112 .
  • the combiner 318 may be configured to combine the operation results to generate an output vector.
  • the output vector may be represented as A( 1 ) OR B( 1 ), A( 2 ) OR B( 2 ), . . . A(n) OR B(n).
  • the one or more bitwise processors 310 may be configured to perform a bitwise AND operation for all the elements in a single vector to generate an output result, e.g., A( 1 ) AND A( 2 ) AND A( 3 ) . . . . AND A(n).
  • the output result is a value of 1 only when all the elements in the vector are 1.
  • the one or more bitwise processors 310 may be configured to perform a bitwise OR operation for all the elements in the vector to generate an output result e.g., A( 1 ) OR A( 2 ) OR A( 3 ) . . . . OR A(n).
  • the output result is a value of 1 when at least one of the elements in the vectors is 1.
  • FIG. 4 illustrates a flow chart of an example method 400 for performing logical operations between two vectors in a neural network.
  • the method 400 may be performed by one or more components the apparatus of FIGS. 1 and 3 .
  • the example method 400 may include receiving, by a controller unit, a vector bitwise operation instruction that includes a first address of the first vector and a second address of a second vector.
  • the controller unit 106 may be configured to receive a vector bitwise operation instruction that includes a first address of the first vector and a second address of a second vector.
  • the example method 400 may include receiving, by a computation module, the first vector and the second vector based on the first address and the second address in response to the vector bitwise operation instruction, wherein the first vector includes one or more first elements and the second vector includes one or more second elements.
  • the computation module 110 may receive a first vector that may include one or more elements respectively denoted as A( 1 ), A( 2 ), . . . A(n) and, similarly, a second vector that may include one or more elements respectively denoted as B( 1 ), B( 2 ), . . . B(n).
  • the example method 400 may include performing, by one or more bitwise processors of the computation module, bitwise operations between each of the first elements and a corresponding one of the second elements to generate one or more operation results.
  • each of the bitwise processors 310 may be configured to perform a bitwise AND operation between a first element in the first vector to a corresponding second element in the second vector e.g., A( 1 ) AND B( 1 ), A( 2 ) AND B( 2 ), . . . A(n) AND B(n).
  • each of the bitwise processors 310 may be configured to perform a bitwise OR operation between a first element in the first vector to a corresponding second element in the second vector e.g., A( 1 ) OR B( 1 ), A( 2 ) OR B( 2 ), . . . A(n) OR B(n).
  • the example method 400 may include combining, by a combiner of the computation module, the one or more operation results into an output vector.
  • the operation results generated respectively by the bitwise processors 310 may be directly transmitted to the combiner 318 without being temporarily stored in the vector caching unit 112 .
  • the combiner 318 may be configured to combine the operation results to generate an output vector.
  • FIG. 5 illustrates a flow chart of an example method 500 for performing logical operation for a vector in a neural network.
  • the method 500 may be performed by one or more components the apparatus of FIGS. 1 and 3 .
  • the example method 500 may include receiving, by a controller unit, a vector bitwise operation instruction that includes an address of a vector.
  • the controller unit 106 may receive a vector bitwise operation instruction that includes an address of a vector.
  • the example method 500 may include receiving, by a computation module, the vector that includes one or more elements based on the address of the vector included in the vector bitwise operation instruction.
  • the computation module 110 may receive a vector that includes one or more elements.
  • the vector caching unit 112 may be configured to store a vector that may include one or more elements respectively denoted as A( 1 ), A( 2 ), . . . A(n).
  • the example 500 may include performing, by one or more bitwise processors of the computation module, bitwise operations to the one or more elements to generate an output result.
  • the one or more bitwise processors 310 may be configured to perform a bitwise AND operation for all the elements in a single vector to generate an output result, e.g., A( 1 ) AND A( 2 ) AND A( 3 ) . . . AND A(n).
  • the output result is a value of 1 only when all the elements in the vector are 1.
  • the one or more bitwise processors 310 may be configured to perform a bitwise OR operation for all the elements in the vector to generate an output result e.g., A( 1 ) OR A( 2 ) OR A( 3 ) . . . . OR A(n).
  • the output result is a value of 1 when at least one of the elements in the vectors is 1.
  • process logic including hardware (for example, circuit, specific logic etc.), firmware, software (for example, a software being externalized in non-transitory computer-readable medium), or the combination of the above two.
  • process logic including hardware (for example, circuit, specific logic etc.), firmware, software (for example, a software being externalized in non-transitory computer-readable medium), or the combination of the above two.
  • the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise, or clear from the context, the phrase “X employs A or B” is intended to mean any of the natural inclusive permutations. That is, the phrase “X employs A or B” is satisfied by any of the following instances: X employs A; X employs B; or X employs both A and B.
  • the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more” unless specified otherwise or clear from the context to be directed to a singular form.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Data Mining & Analysis (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computing Systems (AREA)
  • Algebra (AREA)
  • Databases & Information Systems (AREA)
  • Advance Control (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Computational Linguistics (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Complex Calculations (AREA)

Abstract

Aspects for vector operations in neural network are described herein. The aspects may include a vector caching unit configured to store a first vector and a second vector, wherein the first vector includes one or more first elements and the second vector includes one or more second elements. The aspects may further include a computation module that includes one or more bitwise processors and a combiner. The bitwise processors may be configured to perform bitwise operations between each of the first elements and a corresponding one of the second elements to generate one or more operation results. The combiner may be configured to combine the one or more operation results into an output vector.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • The present invention is a continuation-in-part of PCT Application No. PCT/CN2016/081525, filed on May 10, 2016, which claims priority to commonly owned CN application number 201610267024.2, filed on Apr. 26, 2016. The entire contents of each of the aforementioned applications are incorporated herein by reference.
  • BACKGROUND
  • Multilayer neural networks (MNN) are widely applied to the fields such as pattern recognition, image processing, functional approximation and optimal computation. In recent years, due to the higher recognition accuracy and better parallelizability, multilayer artificial neural networks have received increasing attention by academic and industrial communities. More specifically, logical operations for vectors may be performed frequently in deep learning processes in MMNs.
  • A known method to perform logical operations for vectors in a multilayer artificial neural network is to use a general-purpose processor. However, one of the defects of the method is low performance of a single general-purpose processor which cannot meet performance requirements for usual multilayer neural network operations with respect to a vector with a large number of elements.
  • Another known method to perform logical operations for vectors of the multilayer artificial neural network is to use a graphics processing unit (GPU). Such a method uses a general-purpose register file and a general-purpose stream processing unit to execute general purpose single-instruction-multiple-data (SIMD) instructions to support the algorithms in MNNs. However, since GPU only contains rather small on-chip caching, then data of the vector elements may be repeatedly moved from the off-chip, and off-chip bandwidth becomes a main performance bottleneck, causing huge power consumption.
  • SUMMARY
  • The following presents a simplified summary of one or more aspects in order to provide a basic understanding of such aspects. This summary is not an extensive overview of all contemplated aspects, and is intended to neither identify key or critical elements of all aspects nor delineate the scope of any or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified form as a prelude to the more detailed description that is presented later.
  • One example aspect of the present disclosure provides an example apparatus for vector operations in a neural network. The example apparatus may include a vector caching unit configured to store a first vector and a second vector, wherein the first vector includes one or more first elements and the second vector includes one or more second elements. The example apparatus may further include a computation module that includes one or more bitwise processors and a combiner. The bitwise processors may be configured to perform bitwise operations between each of the first elements and a corresponding one of the second elements to generate one or more operation results. The combiner may be configured to combine the one or more operation results into an output vector.
  • Another example apparatus may include a vector caching unit configured to store a vector that includes one or more elements. The example apparatus may further include a computation module that includes one or more bitwise processors configured to perform bitwise operations to the one or more elements to generate an output result.
  • The example aspect of the present disclosure provides an example method for vector operations in a neural network. The example method may include storing, by a vector caching unit, a first vector and a second vector, wherein the first vector includes one or more first elements and the second vector includes one or more second elements; performing, by one or more bitwise processors of a computation module, bitwise operations between each of the first elements and a corresponding one of the second elements to generate one or more operation results; and combining, by a combiner of the computation module, the one or more operation results into an output vector.
  • Another example method may include storing, by a vector caching unit, a vector that includes one or more elements; and performing, by one or more bitwise processors of a computation module, bitwise operations to the one or more elements to generate an output result.
  • To the accomplishment of the foregoing and related ends, the one or more aspects comprise the features herein after fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative features of the one or more aspects. These features are indicative, however, of but a few of the various ways in which the principles of various aspects may be employed, and this description is intended to include all such aspects and their equivalents.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The disclosed aspects will hereinafter be described in conjunction with the appended drawings, provided to illustrate and not to limit the disclosed aspects, wherein like designations denote like elements, and in which:
  • FIG. 1 illustrates a block diagram of an example neural network acceleration processor by which vector operations may be implemented in a neural network;
  • FIG. 2A illustrates an example logical operation process between two vectors that may be performed by the example neural network acceleration processor;
  • FIG. 2B illustrates an example logical operation process that may be performed by the example neural network acceleration processor;
  • FIG. 3 illustrates an example computation module in the example neural network acceleration processor by which vector operations may be implemented in a neural network;
  • FIG. 4 illustrates a flow chart of an example method for performing logical operations between two vectors in a neural network; and
  • FIG. 5 illustrates a flow chart of an example method for performing logical operation for a vector in a neural network.
  • DETAILED DESCRIPTION
  • Various aspects are now described with reference to the drawings. In the following description, for purpose of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects. It may be evident, however, that such aspect(s) may be practiced without these specific details.
  • In the present disclosure, the term “comprising” and “including” as well as their derivatives mean to contain rather than limit; the term “or”, which is also inclusive, means and/or.
  • In this specification, the following various embodiments used to illustrate principles of the present disclosure are only for illustrative purpose, and thus should not be understood as limiting the scope of the present disclosure by any means. The following description taken in conjunction with the accompanying drawings is to facilitate a thorough understanding to the illustrative embodiments of the present disclosure defined by the claims and its equivalent. There are specific details in the following description to facilitate understanding. However, these details are only for illustrative purpose. Therefore, persons skilled in the art should understand that various alternation and modification may be made to the embodiments illustrated in this description without going beyond the scope and spirit of the present disclosure. In addition, for clear and concise purpose, some known functionality and structure are not described. Besides, identical reference numbers refer to identical function and operation throughout the accompanying drawings.
  • Various types of vector operations may be performed in a neural network. A vector may refer to one or more values formatted in a one-dimensional data structure. The values included in a vector may be referred to as elements. The number of the elements in the vector may be referred to as a length of the vector. For example, the vector operations may include a logical AND between two vectors, a logical OR between two vectors, a logical AND for the elements in a vector, and a logical OR for the elements in a vector.
  • FIG. 1 illustrates a block diagram of an example neural network acceleration processor by which vector operations may be implemented in a neural network. As depicted, the example neural network acceleration processor 100 may include an instruction caching unit 104, a controller unit 106, a direct memory access unit 102, a computation module 110, and a vector caching unit 112. Any of the above-mentioned components or devices may be implemented by a hardware circuit (e.g., application specific integrated circuit (ASIC), Coarse-grained reconfigurable architectures (CGRAs), field-programmable gate arrays (FPGAs), analog circuits, memristor, etc.).
  • In some examples, a vector bitwise operation instruction may originate from an instruction storage device 134 to the controller unit 106. An instruction obtaining module 132 may be configured to obtain a vector bitwise operation instruction from the instruction storage device 134 and transmit the instruction to a decoding module 130.
  • The decoding module 130 may be configured to decode the instruction. The instruction may include one or more operation fields that indicate parameters for executing the instruction. The parameters may refer to identification numbers of different registers (“register ID” hereinafter) in the instruction register 126. Thus, by modifying the parameters in the instruction register 126, the neural network acceleration processor 100 may modify the instruction without receiving new instructions. The decoded instruction may be transmitted by the decoding module 130 to an instruction queue module 128. In some other examples, the one or more operation fields may store immediate values such as addresses in the memory 101 and a scalar value, rather than the register IDs.
  • The instruction queue module 128 may be configured to temporarily store the received instruction and/or one or more previously received instructions. Further, the instruction queue module 128 may be configured to retrieve information according to the register IDs included in the instruction from the instruction register 126.
  • For example, the instruction queue module 128 may be configured to retrieve information corresponding to operation fields in the instruction from the instruction register 126. Information for the operation fields in a vector-AND instruction, for example, may include a starting address of a vector, a length of the vector, and an address for an output result. As depicted, in some examples, the instruction register 126 may be implemented by one or more registers external to the controller unit 106.
  • Once the relevant values are retrieved, the instruction may be sent to a dependency processing unit 124. The dependency processing unit 124 may be configured to determine whether the vector bitwise operation instruction has a dependency relationship with the data of the previous instruction that is being executed. This vector bitwise operation instruction may be stored in the storage queue module 122 until it has no dependency relationship on the data with the previous instruction that has not finished executing. If the dependency relationship does not exist, the controller unit 106 may be configured to decode the vector bitwise operation into micro-instructions for controlling operations of other modules including the direct memory access unit 102 and the computation module 110.
  • For example, the controller unit 106 may receive a vector-AND-vector (VAV) instruction that includes a starting address of a first vector, a length of the first vector, a starting address of a second vector, a length of the second vector, and an address for an output vector. According to the VAV instruction, the direct memory access unit 102 may be configured to retrieve the first vector and the second vector from the memory 101 according to the respective addresses included in the VAV instruction. The retrieved vectors may be transmitted to and stored in the vector caching unit 112.
  • In some examples, the controller unit 106 may receive a vector-AND (VAND) instruction that includes a starting address of a vector, a length of the vector, and an address for an output result. According to the VAND instruction, the direct memory access unit 102 may be configured to retrieve the vector from the memory 101 according to the address. The vector may be transmitted to and stored in the vector caching unit 112.
  • In some examples, the controller unit 106 may receive a vector-OR-vector (VOV) instruction that includes a starting address of a first vector, a length of the first vector, a starting address of a second vector, a length of the second vector, and an address for an output vector. According to the VOV instruction, the direct memory access unit 102 may be configured to retrieve the first vector and the second vector from the memory 101 according to the respective addresses included in the VOV instruction. The retrieved vectors may be transmitted to and stored in the vector caching unit 112.
  • In some examples, the controller unit 106 may receive a vector-OR (VOR) instruction that includes a starting address of a vector, a length of the vector, and an address for an output result. According to the VOR instruction, the direct memory access unit 102 may be configured to retrieve the vector from the memory 101 according to the address. The vector may be transmitted to and stored in the vector caching unit 112.
  • The above mentioned instructions may be formatted as follows and may be stored in the instruction caching unit 104:
  • Register 0 Register 1 Register 2 Register 3 Register 4
    VAV Starting Length of Starting Length of Address for
    address the first address of the second output
    of the first vector the second vector vector
    vector vector
    VAND Starting Length of Output
    address the vector result
    of a vector
    VOV Starting Length of Starting Length of Address for
    address the first address of the second output
    of the first vector the second vector vector
    vector vector
    VOR Starting Length of Output
    address the vector result
    of a vector
  • Hereinafter, a caching unit (e.g., the vector caching unit 112 etc.) may refer to an on-chip caching unit integrated in the neural network acceleration processor 100, rather than other storage devices in memory 101 or other external devices. In some examples, the on-chip caching unit may be implemented as a register file, an on-chip buffer, an on-chip Static Random Access Memory (SRAM), or other types of on-chip storage devices that may provide higher access speed than the external memory. In some other examples, the instruction register 126 may be implemented as a scratchpad memory, e.g., Dynamic random-access memory (DRAM), embedded DRAM (eDRAM), memristor, 3D-DRAM, non-volatile memory, etc.
  • FIG. 2A illustrates an example logical operation process between two vectors that may be performed by the example neural network acceleration processor.
  • As depicted, a first vector (“Vector A”) may include one or more elements respectively denoted as A(1), A(2), . . . A(n) and, similarly, a second vector (“Vector B”) may include one or more elements respectively denoted as B(1), B(2), . . . B(n). The elements in the first vector may be referred to as first elements. The elements in the second vector may be referred to as second elements.
  • The computation module 110 may include one or more bitwise processors and a combiner. In response to a VAV instruction, each of the bitwise processors may be configured to perform a bitwise AND operation between a first element in the first vector to a corresponding second element in the second vector e.g., A(1) AND B(1), A(2) AND B(2), . . . A(n) AND B(n). A bitwise AND operation may refer to an operation between two values that only yields a value of “1” if both the two values are 1. The operation results generated respectively by the bitwise processors may be directly transmitted to a combiner. In other words, the operation results may be transmitted to the combiner without being temporarily stored in the vector caching unit 112. The combiner may be configured to combine the operation results to generate an output vector. The output vector may be represented as A(1) AND B(1), A(2) AND B(2), . . . A(n) AND B(n).
  • In response to a VOV instruction, each of the bitwise processors may be configured to perform a bitwise OR operation between a first element in the first vector to a corresponding second element in the second vector e.g., A(1) OR B(1), A(2) OR B(2), . . . A(n) OR B(n). A bitwise OR operation may refer to an operation between two values that yields a value of “1” if either the two values is 1. The operation results generated respectively by the bitwise processors may be directly transmitted to a combiner without being temporarily stored in the vector caching unit 112. The combiner may be configured to combine the operation results to generate an output vector. The output vector may be represented as A(1) OR B(1), A(2) OR B(2), . . . A(n) OR B(n).
  • FIG. 2B illustrates an example logical operation process that may be performed by the example neural network acceleration processor.
  • As depicted, the computation module 110 may be configured to perform logical operation to a vector (“Vector A”). The vector may include one or more elements respectively denoted as A(1), A(2), . . . A(n).
  • The computation module 110 may include one or more bitwise processors. In response to a VAND instruction, the one or more bitwise processors may be configured to perform a bitwise AND operation for all the elements in the vector to generate an output result. In other words, the output result is a value of 1 only when all the elements in the vector are 1.
  • In response to a VOR instruction, the one or more bitwise processors may be configured to perform a bitwise OR operation for all the elements in the vector to generate an output result. In other words, the output result is a value of 1 when at least one of the elements in the vectors is 1.
  • FIG. 3 illustrates an example computation module 110 in the example neural network acceleration processor by which vector operations may be implemented in a neural network.
  • As depicted, the computation module 110 may include a computation unit 302, a data dependency relationship determination unit 304, a neuron caching unit 306. The computation unit 302 may further include one or more bitwise processors 310 and a combiner 318.
  • The data dependency relationship determination unit 304 may be configured to perform data access operations (e.g., reading or writing operations) on the caching units including the neuron caching unit 306 during the computation process. The data dependency relationship determination unit 304 may be configured to prevent conflicts in reading and writing of the data in the caching units. For example, the data dependency relationship determination unit 304 may be configured to determine whether there is dependency relationship in terms of data between a micro-instruction which to be executed and a micro-instruction being executed. If no dependency relationship exists, the micro-instruction may be allowed to be executed; otherwise, the micro-instruction may not be allowed to be executed until all micro-instructions on which it depends have been executed completely. The dependency relationship may be determined when a target operation range of the micro-instruction to be executed overlaps a target operation range of a micro-instruction being executed. For example, all micro-instructions sent to the data dependency relationship determination unit 304 may be stored in an instruction queue within the data dependency relationship determination unit 304. The instruction queue may indicate the relative priorities of the stored micro-instructions. In the instruction queue, if the target operation range of reading data by a reading instruction conflicts with or overlaps the target operation range of writing data by a writing instruction of higher priority in the front of the instruction queue, then the reading instruction may not be executed until the writing instruction is executed.
  • The neuron caching unit 306 may be configured to store the elements in the first vector and the second vector.
  • The computation unit 302 may be configured to receive the micro-instructions decoded from the vector operation instruction from the controller unit 106. In the example that the computation unit 302 receives micro-instructions decoded from a VAV instruction, each of the bitwise processors 310 may be configured to perform a bitwise AND operation between a first element in the first vector to a corresponding second element in the second vector e.g., A(1) AND B(1), A(2) AND B(2), . . . A(n) AND B(n). The operation results generated respectively by the bitwise processors 310 may be directly transmitted to the combiner 318. In other words, the operation results may be transmitted to the combiner without being temporarily stored in the vector caching unit 112. The combiner 318 may be configured to combine the operation results to generate an output vector. The output vector may be represented as A(1) AND B(1), A(2) AND B(2), . . . A(n) AND B(n).
  • In response to a VOV instruction, each of the bitwise processors 310 may be configured to perform a bitwise OR operation between a first element in the first vector to a corresponding second element in the second vector e.g., A(1) OR B(1), A(2) OR B(2), . . . A(n) OR B(n). A bitwise OR operation may refer to an operation between two values that yields a value of “1” if either the two values is 1. The operation results generated respectively by the bitwise processors 310 may be directly transmitted to the combiner 318 without being temporarily stored in the vector caching unit 112. The combiner 318 may be configured to combine the operation results to generate an output vector. The output vector may be represented as A(1) OR B(1), A(2) OR B(2), . . . A(n) OR B(n).
  • In response to a VAND instruction, the one or more bitwise processors 310 may be configured to perform a bitwise AND operation for all the elements in a single vector to generate an output result, e.g., A(1) AND A(2) AND A(3) . . . . AND A(n). In other words, the output result is a value of 1 only when all the elements in the vector are 1.
  • In response to a VOR instruction, the one or more bitwise processors 310 may be configured to perform a bitwise OR operation for all the elements in the vector to generate an output result e.g., A(1) OR A(2) OR A(3) . . . . OR A(n). In other words, the output result is a value of 1 when at least one of the elements in the vectors is 1.
  • FIG. 4 illustrates a flow chart of an example method 400 for performing logical operations between two vectors in a neural network. The method 400 may be performed by one or more components the apparatus of FIGS. 1 and 3.
  • At block 402, the example method 400 may include receiving, by a controller unit, a vector bitwise operation instruction that includes a first address of the first vector and a second address of a second vector. For example, the controller unit 106 may be configured to receive a vector bitwise operation instruction that includes a first address of the first vector and a second address of a second vector.
  • At block 404, the example method 400 may include receiving, by a computation module, the first vector and the second vector based on the first address and the second address in response to the vector bitwise operation instruction, wherein the first vector includes one or more first elements and the second vector includes one or more second elements. For example, the computation module 110 may receive a first vector that may include one or more elements respectively denoted as A(1), A(2), . . . A(n) and, similarly, a second vector that may include one or more elements respectively denoted as B(1), B(2), . . . B(n).
  • At block 406, the example method 400 may include performing, by one or more bitwise processors of the computation module, bitwise operations between each of the first elements and a corresponding one of the second elements to generate one or more operation results. In the example that the computation unit 302 receives micro-instructions decoded from a VAV instruction, each of the bitwise processors 310 may be configured to perform a bitwise AND operation between a first element in the first vector to a corresponding second element in the second vector e.g., A(1) AND B(1), A(2) AND B(2), . . . A(n) AND B(n). In response to a VOV instruction, each of the bitwise processors 310 may be configured to perform a bitwise OR operation between a first element in the first vector to a corresponding second element in the second vector e.g., A(1) OR B(1), A(2) OR B(2), . . . A(n) OR B(n).
  • At block 406, the example method 400 may include combining, by a combiner of the computation module, the one or more operation results into an output vector. For example, the operation results generated respectively by the bitwise processors 310 may be directly transmitted to the combiner 318 without being temporarily stored in the vector caching unit 112. The combiner 318 may be configured to combine the operation results to generate an output vector.
  • FIG. 5 illustrates a flow chart of an example method 500 for performing logical operation for a vector in a neural network. The method 500 may be performed by one or more components the apparatus of FIGS. 1 and 3.
  • At block 502, the example method 500 may include receiving, by a controller unit, a vector bitwise operation instruction that includes an address of a vector. For example, the controller unit 106 may receive a vector bitwise operation instruction that includes an address of a vector.
  • At block 504, the example method 500 may include receiving, by a computation module, the vector that includes one or more elements based on the address of the vector included in the vector bitwise operation instruction. For example, the computation module 110 may receive a vector that includes one or more elements. For example, the vector caching unit 112 may be configured to store a vector that may include one or more elements respectively denoted as A(1), A(2), . . . A(n).
  • At block 506, the example 500 may include performing, by one or more bitwise processors of the computation module, bitwise operations to the one or more elements to generate an output result. For example, in response to a VAND instruction, the one or more bitwise processors 310 may be configured to perform a bitwise AND operation for all the elements in a single vector to generate an output result, e.g., A(1) AND A(2) AND A(3) . . . AND A(n). In other words, the output result is a value of 1 only when all the elements in the vector are 1.
  • In response to a VOR instruction, the one or more bitwise processors 310 may be configured to perform a bitwise OR operation for all the elements in the vector to generate an output result e.g., A(1) OR A(2) OR A(3) . . . . OR A(n). In other words, the output result is a value of 1 when at least one of the elements in the vectors is 1.
  • The process or method described in the above accompanying figures can be performed by process logic including hardware (for example, circuit, specific logic etc.), firmware, software (for example, a software being externalized in non-transitory computer-readable medium), or the combination of the above two. Although the process or method is described above in a certain order, it should be understood that some operations described may also be performed in different orders. In addition, some operations may be executed concurrently rather than in order.
  • In the above description, each embodiment of the present disclosure is illustrated with reference to certain illustrative embodiments. Apparently, various modifications may be made to each embodiment without going beyond the wider spirit and scope of the present disclosure presented by the affiliated claims. Correspondingly, the description and accompanying figures should be understood as illustration only rather than limitation. It is understood that the specific order or hierarchy of steps in the processes disclosed is an illustration of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged. Further, some steps may be combined or omitted. The accompanying method claims present elements of the various steps in a sample order, and are not meant to be limited to the specific order or hierarchy presented.
  • The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein but is to be accorded the full scope consistent with the language claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.” Unless specifically stated otherwise, the term “some” refers to one or more. All structural and functional equivalents to the elements of the various aspects described herein that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims. No claim element is to be construed as a means plus function unless the element is expressly recited using the phrase “means for.”
  • Moreover, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise, or clear from the context, the phrase “X employs A or B” is intended to mean any of the natural inclusive permutations. That is, the phrase “X employs A or B” is satisfied by any of the following instances: X employs A; X employs B; or X employs both A and B. In addition, the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more” unless specified otherwise or clear from the context to be directed to a singular form.

Claims (24)

We claim:
1. An apparatus for vector operations in a neural network, comprising:
a controller unit configured to receive a vector bitwise operation instruction that indicates a first address of the first vector and a second address of a second vector; and
a computation module configured to receive the first vector and the second vector based on the first address and the second address in response to the vector bitwise operation instruction, wherein the first vector includes one or more first elements and the second vector includes one or more second elements, and wherein the computation module includes:
one or more bitwise processors configured to perform bitwise operations between each of the first elements and a corresponding one of the second elements to generate one or more operation results, and
a combiner configured to combine the one or more operation results into an output vector.
2. The apparatus of claim 1, wherein the vector bitwise operation instruction includes one or more register IDs that identify one or more registers configured to store the first address of the first vector, the second address of the second vector, a length of the first vector, and a length of the second vector.
3. The apparatus of claim 1, further comprising one or more registers configured to store a length of the first vector and a length of the second vector.
4. The apparatus of claim 3, further comprising a direct memory access unit configured to retrieve the first vector and the second vector from a storage device based on the starting address of the first vector, the length of the first vector, the starting address of the second vector, and the length of the second vector.
5. The apparatus of claim 1, wherein the one or more bitwise processors are configured to perform a logical AND operation between each of the first elements and a corresponding one of the second elements to generate the one or more operation results when the vector bitwise operation instruction includes an operation code that indicates an AND operation between the first vector and the second vector.
6. The apparatus of claim 1, wherein the one or more bitwise processors are configured to perform a logical OR operation between each of the first elements and a corresponding one of the second elements to generate the one or more operation results when the vector bitwise operation instruction includes an operation code that indicates an OR operation between the first vector and the second vector.
7. An apparatus for vector operations in a neural network, comprising:
a controller unit configured to receive a vector bitwise operation instruction that includes an address of a vector;
a computation module configured to receive the vector that includes one or more elements based on the address of the vector included in the vector bitwise operation instruction, wherein the computation module includes one or more bitwise processors configured to perform bitwise operations to the one or more elements to generate an output result.
8. The apparatus of claim 7, wherein the vector bitwise operation instruction includes one or more register IDs that identify one or more registers configured to store the address of the vector and a length of the vector.
9. The apparatus of claim 7, further comprising one or more registers configured to store a length of the first vector.
10. The apparatus of claim 9, further comprising a direct memory access unit configured to retrieve the vector from a storage device based on the starting address of the vector and the length of the first vector.
11. The apparatus of claim 7, wherein the one or more bitwise processors are configured to perform a logical AND operation to the one or more elements in the vector to generate the output result when the vector bitwise operation instruction includes an operation code that indicates an AND operation between the elements of the vector.
12. The apparatus of claim 7, wherein the one or more bitwise processors are configured to perform a logical OR operation to the one or more elements in the vector to generate the output result when the vector bitwise operation instruction includes an operation code that indicates an OR operation between the elements of the vector.
13. A method for vector operations in a neural network, comprising:
receiving, by a controller unit, a vector bitwise operation instruction that indicates a first address of the first vector and a second address of a second vector;
receiving, by a computation module, the first vector and the second vector based on the first address and the second address in response to the vector bitwise operation instruction, wherein the first vector includes one or more first elements and the second vector includes one or more second elements;
performing, by one or more bitwise processors of the computation module, bitwise operations between each of the first elements and a corresponding one of the second elements to generate one or more operation results; and
combining, by a combiner of the computation module, the one or more operation results into an output vector.
14. The method of claim 13, wherein the vector bitwise operation instruction includes one or more register IDs that identify one or more registers configured to store the first address of the first vector, the second address of the second vector, a length of the first vector, and a length of the second vector.
15. The method of claim 13, further comprising storing, by one or more registers, a length of the first vector and a length of the second vector.
16. The method of claim 15, further comprising retrieving, by a direct memory access unit, the first vector and the second vector from a storage device based on the starting address of the first vector, the length of the first vector, the starting address of the second vector, and the length of the second vector.
17. The method of claim 13, further comprising performing, by the one or more bitwise processors, a logical AND operation between each of the first elements and a corresponding one of the second elements to generate the one or more operation results when the vector bitwise operation instruction includes an operation code that indicates an AND operation between the first vector and the second vector.
18. The method of claim 13, further comprising performing, by the one or more bitwise processors, a logical OR operation between each of the first elements and a corresponding one of the second elements to generate the one or more operation results when the vector bitwise operation instruction includes an operation code that indicates an OR operation between the first vector and the second vector.
19. A method for vector operations in a neural network, comprising:
receiving, by a controller unit, a vector bitwise operation instruction that includes an address of a vector;
receiving, by a computation module, the vector that includes one or more elements based on the address of the vector included in the vector bitwise operation instruction; and
performing, by one or more bitwise processors of the computation module, bitwise operations to the one or more elements to generate an output result.
20. The method of claim 19, wherein the vector bitwise operation instruction includes one or more register IDs that identify one or more registers configured to store the address of the vector and a length of the vector.
21. The method of claim 19, further comprising storing, by one or more registers a length of the first vector.
22. The method of claim 21, further comprising retrieving, by a direct memory access unit, the vector from a storage device based on the starting address of the vector and the length of the first vector.
23. The method of claim 19, wherein the performing bitwise operations further comprises performing, by the one or more bitwise processors, a logical AND operation to the one or more elements in the vector to generate the output result when the vector bitwise operation instruction includes an operation code that indicates an AND operation between the elements of the vector.
24. The method of claim 19, wherein the performing bitwise operations further comprises performing, by the one or more bitwise processors, a logical OR operation to the one or more elements in the vector to generate the output result when the vector bitwise operation instruction includes an operation code that indicates an OR operation between the elements of the vector.
US16/171,987 2016-04-26 2018-10-26 Apparatus and methods for vector operations Abandoned US20190073219A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/250,148 US11126429B2 (en) 2016-04-26 2019-01-17 Apparatus and methods for bitwise vector operations

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
CN201610267024.2 2016-04-26
CN201610267024.2A CN107315568B (en) 2016-04-26 2016-04-26 Device for executing vector logic operation
PCT/CN2016/081525 WO2017185404A1 (en) 2016-04-26 2016-05-10 Apparatus and method for performing vector logical operation

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/081525 Continuation-In-Part WO2017185404A1 (en) 2016-04-26 2016-05-10 Apparatus and method for performing vector logical operation

Related Child Applications (2)

Application Number Title Priority Date Filing Date
PCT/CN2016/081525 Continuation WO2017185404A1 (en) 2016-04-26 2016-05-10 Apparatus and method for performing vector logical operation
US16/250,148 Continuation US11126429B2 (en) 2016-04-26 2019-01-17 Apparatus and methods for bitwise vector operations

Publications (1)

Publication Number Publication Date
US20190073219A1 true US20190073219A1 (en) 2019-03-07

Family

ID=60161748

Family Applications (2)

Application Number Title Priority Date Filing Date
US16/171,987 Abandoned US20190073219A1 (en) 2016-04-26 2018-10-26 Apparatus and methods for vector operations
US16/250,148 Active US11126429B2 (en) 2016-04-26 2019-01-17 Apparatus and methods for bitwise vector operations

Family Applications After (1)

Application Number Title Priority Date Filing Date
US16/250,148 Active US11126429B2 (en) 2016-04-26 2019-01-17 Apparatus and methods for bitwise vector operations

Country Status (4)

Country Link
US (2) US20190073219A1 (en)
EP (1) EP3451159B1 (en)
CN (2) CN107315568B (en)
WO (1) WO2017185404A1 (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107315568B (en) 2016-04-26 2020-08-07 中科寒武纪科技股份有限公司 Device for executing vector logic operation
CN109754062B (en) * 2017-11-07 2024-05-14 上海寒武纪信息科技有限公司 Execution method of convolution expansion instruction and related product
CN111338694B (en) * 2018-12-19 2022-05-31 上海寒武纪信息科技有限公司 Operation method, device, computer equipment and storage medium
CN111079912B (en) * 2018-10-19 2021-02-12 中科寒武纪科技股份有限公司 Operation method, system and related product
CN111079910B (en) * 2018-10-19 2021-01-26 中科寒武纪科技股份有限公司 Operation method, device and related product
TWI733334B (en) 2020-02-15 2021-07-11 財團法人工業技術研究院 Convolutional neural-network calculating apparatus and operation methods thereof

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080244193A1 (en) * 2007-03-31 2008-10-02 Krishnakanth Sistla Adaptive range snoop filtering methods and apparatuses
US20120137090A1 (en) * 2010-11-29 2012-05-31 Sukalpa Biswas Programmable Interleave Select in Memory Controller
US20150100755A1 (en) * 2013-10-09 2015-04-09 Arm Limited Data processing apparatus and method for controlling performance of speculative vector operations
US20160098200A1 (en) * 2014-10-01 2016-04-07 Zvi GUZ In-memory popcount support for real time analytics

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5838984A (en) * 1996-08-19 1998-11-17 Samsung Electronics Co., Ltd. Single-instruction-multiple-data processing using multiple banks of vector registers
CN1142484C (en) * 2001-11-28 2004-03-17 中国人民解放军国防科学技术大学 Vector processing method of microprocessor
CN101826142B (en) * 2010-04-19 2011-11-09 中国人民解放军信息工程大学 Reconfigurable elliptic curve cipher processor
CN102156637A (en) * 2011-05-04 2011-08-17 中国人民解放军国防科学技术大学 Vector crossing multithread processing method and vector crossing multithread microprocessor
CN102262525B (en) * 2011-08-29 2014-11-19 孙瑞玮 Vector-operation-based vector floating point operational device and method
SE536462C2 (en) * 2011-10-18 2013-11-26 Mediatek Sweden Ab Digital signal processor and baseband communication device
GB201217531D0 (en) * 2012-10-01 2012-11-14 Advanced Risc Mach Ltd ARMv7-M Asset Protection Proposal
CN103699360B (en) * 2012-09-27 2016-09-21 北京中科晶上科技有限公司 A kind of vector processor and carry out vector data access, mutual method
CN107315568B (en) 2016-04-26 2020-08-07 中科寒武纪科技股份有限公司 Device for executing vector logic operation

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080244193A1 (en) * 2007-03-31 2008-10-02 Krishnakanth Sistla Adaptive range snoop filtering methods and apparatuses
US20120137090A1 (en) * 2010-11-29 2012-05-31 Sukalpa Biswas Programmable Interleave Select in Memory Controller
US20150100755A1 (en) * 2013-10-09 2015-04-09 Arm Limited Data processing apparatus and method for controlling performance of speculative vector operations
US20160098200A1 (en) * 2014-10-01 2016-04-07 Zvi GUZ In-memory popcount support for real time analytics

Also Published As

Publication number Publication date
CN111651202A (en) 2020-09-11
CN111651202B (en) 2023-09-22
WO2017185404A1 (en) 2017-11-02
EP3451159A4 (en) 2020-04-01
CN107315568B (en) 2020-08-07
US20190171454A1 (en) 2019-06-06
EP3451159A1 (en) 2019-03-06
CN107315568A (en) 2017-11-03
EP3451159B1 (en) 2021-05-26
US11126429B2 (en) 2021-09-21

Similar Documents

Publication Publication Date Title
US10860316B2 (en) Apparatus and methods for generating dot product
US10860681B2 (en) Apparatus and methods for matrix addition and subtraction
US11126429B2 (en) Apparatus and methods for bitwise vector operations
US11157593B2 (en) Apparatus and methods for combining vectors
US10761991B2 (en) Apparatus and methods for circular shift operations
US10534841B2 (en) Appartus and methods for submatrix operations
US10853069B2 (en) Apparatus and methods for comparing vectors
US11436301B2 (en) Apparatus and methods for vector operations
US10831861B2 (en) Apparatus and methods for vector operations
US11080049B2 (en) Apparatus and methods for matrix multiplication
US11409524B2 (en) Apparatus and methods for vector operations
US10489704B2 (en) Operation unit, method and device capable of supporting operation data of different bit widths
US11263530B2 (en) Apparatus for operations at maxout layer of neural networks
US11501158B2 (en) Apparatus and methods for generating random vectors
US20190235871A1 (en) Operation device and method of operating same

Legal Events

Date Code Title Description
STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

AS Assignment

Owner name: CAMBRICON TECHNOLOGIES CORPORATION LIMITED, CHINA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LUO, TAO;ZHI, TIAN;LIU, SHAOLI;AND OTHERS;SIGNING DATES FROM 20180622 TO 20180702;REEL/FRAME:047860/0373

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION