Matrix inversion device and method based on residue number system

Abstract

The invention discloses a matrix inversion device and a matrix inversion method based on a residue number system. Conventional matrix inversion calculation based on a binary complement numerical representation system is divided into a plurality of parallel independent data channels according to a specific residue number base, so that the system complexity and the key path time delay are reduced. Therefore, a matrix inversion calculation structure based on the residue number system comprises a mapping and demapping module, a residue number system and a binary system conversion module, an n-order following matrix calculation module based on the residue number system, an n-order row and column type calculation unit and a sign detection and value zooming module for the residue number system (RNS) integer. A realizing structure based on the residue number system is designed by taking four-order positive definite Hermite matrix inversion as an example; and finally according to the definition of an inverse matrix, only a row and column type value of an original matrix and a following matrix of the original matrix are output.

Description

technical field [0001] The invention belongs to the field of signal processing, and in particular relates to a method and a realization structure of a matrix inversion (MI) based on a remainder system (RNS) in communication and signal processing. Background technique [0002] Contemporary operations and calculations in many signal processing, image processing and communication require high throughput, and many operations are required to be completed in real time, so there is a high requirement for the implementation speed of the algorithm. In digital signal processing, many signal and image processing algorithms have the characteristics of localized operations, intensive calculations, and most of them are matrix operations. The difficulty of matrix operations lies in matrix inversion. Most traditional matrix inversion algorithms are realized by serial computing of processors, which seriously restricts the improvement of computing speed. [0003] The VLSI implementation of t...

AI Technical Summary

Problems solved by technology

[0003] The VLSI implementation of the traditional matrix inversion operation unit is based on the binary weight numerical representation system, which is characterized by maturity and simplicity, but with the increase of the processing bit width, the complexity of the basic operation unit - multiplier and adder increases , the critical path length increases, which reduces the operating frequency of the system

Images