Systems and methods for performing matrix multiplication with a plurality of processing elements

The system optimizes matrix multiplication through parallel processing elements, addressing inefficiencies in large-scale computations by enhancing computational efficiency and reducing resource usage.

WO2025116950A1PCT designated stage expired Publication Date: 2025-06-05RECOGNI INC
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
PCT/US2024/024806
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-11-29
Filing Date
2024-04-16
Publication Date
2025-06-05

AI Technical Summary

Technical Problem

Existing matrix multiplication algorithms are inefficient and resource-intensive, particularly in large-scale computations, leading to suboptimal performance in parallel processing environments.

Method used

Implementing a system and method for matrix multiplication using a plurality of processing elements, optimizing data distribution and parallel processing to enhance computational efficiency and reduce resource utilization.

Benefits of technology

Improves computational performance and reduces resource consumption in large-scale matrix multiplication tasks by leveraging parallel processing elements for efficient data distribution and computation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure US2024024806_05062025_PF_FP_ABST
    Figure US2024024806_05062025_PF_FP_ABST
Patent Text Reader

Abstract

In a system with control logic and a processing element array, two modes of operation may be provided. In the first mode of operation, the control logic may configure the system to perform matrix multiplication or 1x1 convolution. In the second mode of operation, the control logic may configure the system to perform 3x3 convolution. The processing element array may include an array of processing elements. Each of the processing elements may be configured to compute the dot product of two vectors in a single clock cycle, and further may accumulate the dot products that are sequentially computed over time.
Need to check novelty before this filing date? Find Prior Art

Description

[0001]. .. . ,, , - , . , . , . , , . , , . . , . . ., , ,, .aen caon . , ., , . ., , ., , . , . . . , . . , , . . , , , , . , , . aen caon . , , . .. . . ,. , . . , ^^ ^^ ^^ ^^ ^ ^^^ ^^ aen caon , ^ ^^ ^ ^^ ^ ^^ , ^ ^^^ ^^ ^^ ^^ . . . , ^^,^^,^^,^^,^^^^,,^^^^,,^^^^,,^^^^,,'.^ ^ ^^^^,,,^ ^ ^^^^,,,^ ^ ^^^^,,,aen caon ^ ^ ^^^^,,,^ ^ ^^^^,,,^ ^ ^^^^,,,. . , . , , . , ,,, , , , , , , , , , , , , , , aen caon , , , , . ,. , , , ,, , ^ ^^^ ^ ^^^ ^ ^^ ^ ^^ , , , , ^ ^^^ ^ ^^^ ^^ , , ^ ^^^ ^ ^^ ^ ^^ , , aen caon , , , , , ^^,^^,^^,^^,^^,^^,^^,^^ ,^^,,^^, ^^, ^^,,'^ ^ ^^^^,,,^ ^ ^^^^,,,^ ^ ^^^^,,,, , ^ ^ ^^^^,,,^ ^ ^^^^,,,^ ^ ^^^^,,,. , . , ,, ,aen caon ., .., .., ,, , , , .., ,. ,...,., , , .., , . , .., . .., .., . , , . .. , , , , , , . ..,.., ..., ,, , , .. , , , .., . .., , ,aen caon , . , .., . .., .., . , . . , . , . , , . , . , . , . , . . , , , .aen caon - , ., , , - ., . , , , - . . , , . , -, , - . , . , -, . , . , . , . , . , aen caon . , , -. . . , , . . . .. , ,^^ ,. ^^.… , ^^' , , ^^, … ,“, . , ^^,*” ^^^^*. . . . --, ^^, . , - . , , -, ^^*-, . , , aen caon - - . . , . , . .., . . , , , . , , , . , , , . , . , ,, . . , “.” ,., .., “ ” , . .., ,, “ ” . aen caon “” “ ” . , , , . , , , , ,. , ,, , . , , , , ,, . , , , .. . ,, “ “” ,” , .., . . . , , . . - , . , ..,aen caon , - - , , .- , -- - - - - - - - - - -, “”-. “ ” . “ ” “” . , , - -, - - , . , ,, . . , , , , , . . , , , . . . , , . , . 2 - -,1- -,aen caon4- -, - -,, . “” . ,,.., . , , . , .. . - ,..,- .- , ,, - - - ., - , “ “ ”” . “ ” “ ” , -. , - - , - . ,., , ,. , , . . aen caon , “-”, . , , ^^ ^^ , , ^^ . , ^^ .. “ ” , ^^ . . , ^^ ^^ , ^^ ^^ , ^^ ^^ , . ^^ ^^. , . ,, ^^* . .., ^^ ^,^ …, … , ^ ,^+ ^,^+ ^^, … , ^^+. ^^, … , ^^+.. ., , ,*aen caon ,, * . . ,^^, … , ^^+. ,.., ^^, … , ^^+ ..,. . , --. –, - , …, , , …, . , , …, .., .., ^^, … , ^^+ ., ^^, … , ^^+^. . , ^^,,,..., -^^ =.,,,. ^^ , . aen caon . , , .. , , .. . *,- , ,, …, . . , , …, , ,, …, . …, - . ,, 4,..,,12,1,2-,24,2,2, .., - , “” ,.4. , , ,7,11,1,1,2,27,1, , .7. “” , ,2,,1,14,1,22,2, , aen caon , .2. “ ” , ,1,,,1,17,21,2,2, ,.1. “ ” , ,4,44,4,2,,,4, , 12 1. “” , . , , , “ ”1,2,,4 17,1,1,2. 1,2, . . ,1,2,,417,,14,1,2,.17,1,1,2“ , ”1,,2,,4,,,,7, . , ,. ,,7,1,2,,4. ,1,2,, . ,4,7, aen caon1,2,,4.., ^^^^ ^^ 1,2,,4.^.^,^^^^ ^^^^1,,7, .., ^^^^, ^^, .^ 12,,4.^,- ^^^^. ^^^^21,2,,4.., ^^.^^ ^^^ 17,1,1,2.^.,^^+^^ ^^^^,,7, .., ^^.^^, ^^^^- ^^+^^. ^^^^ 17,1,1,2..,4. , , ,,4,47,1,,, , , . . 11 1“” ,,, ,,7,21,22,,2,24.. , ,,21,7,22,2,24,.21,72,2,2,24,1,2,,4,,,,, . ,7, ,,,7,12 4. , 1,2,,4.., ^^,^^ ^^,,7, .-^.^,^^.^^ ^^^^aen caon,,7, .., ^^,^^, ^^.-^.^,- ^^.^^. ^^^^,,7, 1,2,,4.., ^^^^ ^^^ 21,22,2,24.^.,^^^^ ^^^^7,,7, .., ^^^^, ^^^ 21,22,2,24.^-.,^^^^. ^^^^. , ,4,,42,4,,4,,2, , .1 14. “” ,,1,11, ,1,11,12 2,2,,27,2. . , ,,,212,2,27,2,21,1,11,2.2272,1,2,,4,,,,7, . ,,7,1,2,,4. , 1,2,,4.., ^^+^^ ^^^^,1,11,1..,^^^^ ^^^^ 2,,7, .., ^^+^^, ^^^^-,1,11,12..,^^^^. ^^^^1aen caon1,2,,4.., ^^,^^ ^^-^ 2,2,27,2.^.,^^.^^ ^^^^11,,7, .., ^^,^^, ^^-^^- ^^^^ ^^^^ 2,2,27,2..,.. 12. , , ,7,41,4,4,,7, 1, , .1. “” , ,,, ,, 1,14,1,1 11411 2,1,2. . , ,,2,,1,2,1,14,1,,1.2 12, ,,, , ,12 4,,,7, . ,,7,12,,4. , 1,2,,4.., ^^^^ ^^^ 1,14,1,1.^.,^^,^^ ^^-^^1,,7, .., ^^^^, ^^^ 1,14,1, .^-.,^^,^^. ^^-^^ 1141,2,,4.., ^^+^^ ^^^ 2,,, .^.,^^^^ ^^^^ 121aen caon,,7, .., ^^+^^, ^^^.^-.,^^^^. ^^^^ 2,,1,21. , , ,72,7,,4,,2, ,, . .2 24“” , ,4,,,4,,4,,,1,2. . ,4,,1,2, ,,4,, .4,1,2, , 1,14,1,1,1,11,12,1,11,12,1,14,1,1., , . . , , -., , “” . ,1,11,12.., ^^^^+ ^^^^ ^^^^ ^^^^,,4,, ,,, -.. 1,^^ ^^.aen caon1,14,1,1.., ^^^^ ^^^^,^^,^^, ^^-^^-,,4,, .., 2,^^ ^^,1,11,12.., ^^+^^+ ^^,^^ 4,,1,2,^^,,^^ ^^,^^,.., ^^ ^^+1,14,1,1.., ^^+^^ ^^,^^ ^^^^ ^^^^, 4,,1,2,, , , -,.., 4,^^ ^^ . ^^'^^^ =… , - ^… , ^^ ^^ aen caon ^^ , ^ ^^^ ^^^^*^ ^^^ ⋯ ⋯ ^^ ^^^^ ^^…^^^^^^* ^^ =…^^, ^^ =. . “ , , ” - ., , , - . “,, ” , . -,. , , , - ,, . , , . , , , . ,. , aen caon “ .” , . , , , . , . , , .., ,. , . , . . . , , . , , . , , , - . . - , , -, . , ==^^^^^^^^^^^,^^^^-^^^^^^^^^^^^^^^^=^^.^^^^^^^^+^^^^^^^^,^^^^-^^^^.^^^^^…^^^^^^^^^^^^^^^^^^+^^^^^^^^^^^^aen caon ^ ^ ^^ ^^^^+^ ^ ^ ^^^^ ^ ^ ^^ , , ,, , -, . , - . ,, , ,, , ,, , . . , . , , ,. , , , , , “ ” - ..,, . , , aen caon . -,, .-., -, -, ., . , , . , , . , , . , .., , , . - . , , , , . ,, ,, . , . . , , “ ” , . , , .., , . ,aen caon , , .., , . - , , , , ,. , , . . . , , ,, , . “ ”, . ” . , “- “- ” , , . “ ” ... , , , ,, - . - , - . , . , , , . aen caon - , , . , -. ^^^^,, ^ ^^^,,^ ^^^,,^ ^^^,,^ ^^^,,^ ^^^,,^ ^^^,,^ ^^^,,^ ^^^,,^ ^^^,,^ ^^^,,,,^ ^ ^^^^,,,.^ ^ ^^^^,,,,^ ^ ^^^^,,,-+, , ^ ^^ ^^ ^ ^^ ^^ , , . , , , . ^^^, . ^aen caon^^, ^^,.^^, ^^,- , -. ^^ = ^^, ^^,^^ ^,^, ^^, ^^, ^^, ^^, ^^,, ^^, ^^,- ^^,.^^^^,+^^ = ^^, ^^, ^^^,^ ^^, ^^, ^^, ^^, ^^, ^^, ^^,, ^^, ^^,^^^ ^ -^,. , ^,+^^ = ^^,, ^^,^^, ^,^,, ^^^,^ ^^,, ^^,, ^^, ^^,,, ^^, ^^,,- ^^,,.^^,,+^^ = ^^, ^^,, ^^^,^,,. ^^,,^ ^^^,,, ^^,,^^,, ^+^, ^^,, ^^, ^^,,, ^^, ^^,,-^^ ^^, = ^^, ^^, ^^^,^,. ^^,^ ^^^, ^^,^^ ^^, ^^, ^^, ^^,, ^^, ^^,-^^, , ,+^^- = ^^, ^^, ^^^,^ ^^,^ ^^,, ^^, ^^, ^^, ^^, ^^,, ^^,, ^^,-^^-,. ^, ^^,+^^. = ^^, ^^,, ^^^,^,,. ^^,,^ ^^^,,, ^^,,^^,, ^+^, ^^,, ^^, ^^,,, ^^, ^^,,-aen caon ^^.^^ = ^^, ^^,, ^^^,^,,. ^^,,^ ^^^,,, ^^,,^^ ^^, ^^,, ^^, ^^,,, ^^,, ^^,,-^^, ,,+. , . - , . , , , ,. - . ^^ ^^^^,,, ^ ^ ^^^^,,^^ ^^, ^^ ^^ ^^ ^ ^^^,^ ^^^,,^^,,^ ^^,^,,^ ^^,^^ ^,,^,^^,^^,^ ^^^^,,,,,,aen caon ^ ^ ^^^^,,.^ ^ ^^^^,,^ ^ ^^^^,,-+, , ^ ^ ^ , , . - , -. . -^^+, … , ^^-. ^, …, ,- , . , , , ,. - . ^^ ^^^^,, ^ ^^^,,^^, ^^^^,^ ^^^,,,^ ^^^,,,^ ^ ^^^^,,,aen caon ^ ^ ^^^^,,^ ^ ^^^^,,^ ^ ^^^,,^^,^^,^,^ ^^^,,,^ ^^^,,,^ ^ ^^^^,,,,,,^ ^^ ^^ ^ ^^ ^^ , , ^^ ^^ ^^ , , . - , -. -^^., … , ^^. ., …, ,. , . , , , , , …, . . . - , ., . aen caon ,, - . - . - - - - - - - - - - - .- - . ,-,- --,- - , , , -,- - ,. -,- - - - - - - , - . - -,- - - - - - - . - -aen caon ,- , , , .., . , , . - - , . , , ,. , . ..,-. . . aen caon -,- , . - .- . - - - . - . - . - . - . - . - . - . . - - , , - - . - -, - -. , ..,- - . , , aen caon ,,,, . , ., . , , “” “” . - -. ,, , , ..,- . , , - , . . , ..., “ ” ,-,- - . , “ ” - , ,, - . - , “- ,, , , ” , ,, . .., -,- -. aen caon , . , , .- - , - - - -. -1-2, ,- -. , , , 12- -1,2. , - - - -. , , -- - -. , - - -. , - . - , .., - - ., - , -. ,- , ^^,, ^^,, ^^,, ^^,,- . , , ^^,, ^^,, ^^,, ^^,, ^^,, aen caon ^ ^^^,^ ^^^,^ ^^,, , ,^^,,- ^^,,^^,,^^^,,^^, ^^, ^^, , ^^,, ^^,, ^^,, ^^,, ^^,, ^ ^ ^^^^,,^ ^ ^^^,,^ ^^^,,^^,, ^^,,, ^^,,, ^^,,,-,^,^^,, ^^,, ^^,, ^^,, ^^,, ^^,, ^ ^^,^^,^^,,, ^^^,,^ ^^^,,^ ^^^,,,,, . , - , ^^, ^ , ^^,,,,^,^^, ^^ ^ ^^^,,, ^^,^^,, , ..., , .- .., , , , , .. , , , , , . aen caon .., , , , . , .,., , . , , . . , . . -, . , -, , , ,. . , , .. . .,.., .., . . , .., ,. . ..,, aen caon . ,, , .. , . . , ,, . =* .. , , ., , . , . , , .. ,, , , , , . , ,. , .. , , , .. -aen caon , , . . ,aen caon

Claims

. , , , , ,, , . . , aen caon, , , , , . ,. . , ,., ,- -, . ., , .. , . . . , , . , aen caon– , , – . . , , , , , , , , , , , , , , , , , , , , , , , , . aen caon. , , , , , , , , , , , , , , , , , , , , , , , , . ,. . , ,., , - -, .., , . aen caon. ,, . . , – – –. aen caon

Citation Information

Patent Citations

  • Accelerated mathematical engine

    US20190026078A1

  • Stream processor with low power parallel matrix multiply pipeline

    US20190171448A1

  • Time Domain Unrolling Sparse Matrix Multiplication System and Method

    US20220035890A1

  • Random sparsity handling in a systolic array

    US20220309124A1