Matrix operation circuits, processors, integrated circuit systems, electronic components and equipment
By designing M×N calculation units and compression buffer units in the matrix calculation circuit, the compression and matrix multiplication and addition operations of sparse matrix are realized, and the efficiency problem of sparse matrix in the high-speed multiplication and addition circuit in the prior art is solved, which improves the calculation rate and reduces power consumption.
Patent Information
- Application Number
- CN202410257138.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-03-07
- Publication Date
- 2025-03-18
- Estimated Expiration
- 2044-03-07
AI Technical Summary
The prior art is difficult to effectively compress sparse matrixes in two-dimensional and three-dimensional high-speed multiplication and addition circuits, especially in the matrix multiplication or matrix multiplication and addition operation, and it is impossible to effectively utilize sparseness to improve the calculation rate and reduce power consumption.
A matrix calculation circuit is designed, including M×N calculation units and M×N compression buffer units. Sparse compression is achieved by discarding 0-value data pairs, and the compressed data is output to the calculation unit within one clock cycle, supporting the point multiplication and multiplication operations of the matrix.
It realizes sparse compression during the two-dimensional and three-dimensional hardware point multiplication operation, improves the utilization rate of matrix multiplication or matrix multiplication calculation unit, improves the calculation rate and effectively reduces power consumption.