Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

56 results about "Givens rotation" patented technology

In numerical linear algebra, a Givens rotation is a rotation in the plane spanned by two coordinates axes. Givens rotations are named after Wallace Givens, who introduced them to numerical analysts in the 1950s while he was working at Argonne National Laboratory.

Channel information feedback method and system

The invention discloses a channel information feedback method and a system. The channel information feedback method comprises the following steps: a pre-coding matrix required to be fed back can be decomposed into the product of a plurality of Givens rotating matrixes, wherein each rotating matrix is only related to a rotating angle; and the corresponding rotating angle of the rotating matrix after being decomposed is fed back. The method and the system provided by the invention are a channel compression quantized feedback solution based on the Givens transformation, wherein the pre-coding matrix required to be fed back can be transformed into a limited angle value through continuous Givens rotation, and a base station can rebuild a channel matrix by using the fed-back quantitative angles so as to calculate a pre-coding vector, so that the feedback cost can be effectively reduced. Compared with the traditional scalar quantization, the channel information feedback method can effectively reduce the number of the quantitative elements, thereby decreasing the feedback quantity. With respect to the vector quantization, the only requirement is to carry out the operation of decomposition and quantization, so that the system complexity can be effectively lowered under the condition of ensuring the system performance.
Owner:ZTE CORP

Low-complexity quick parallel matrix inversion method

The invention discloses a low-complexity quick parallel matrix inversion method. The method comprises the following steps that first, a matrix A is given, a matrix E is made to be a unit matrix with the same order as the matrix A, the matrix A and the matrix E form an expanding matrix B, modified Givens rotation (MSGR, Modified Square Givens Rotations) is carried out on the matrix B, an upper triangular matrix U and , wherein according to the define of the matrix U and , an SGR (Squared Givens Rotations) method is used for deforming the QR division of the matrix A according to the equation, and the relation between the QR division and original QR division meets the equations , , , and ; according to the MSRG method, the square root operation in the process of Givens rotation can be omitted while division operation is reduced, and algorithm complexity is obviously reduced; second, a back substitution method is used for working out the inverse matrix U-1 of the upper triangular matrix U; third, matrix inversion is carried out according to the equation . According to the low-complexity quick parallel matrix inversion method, a large amount of division operation and a large amount of square root operation are omitted, algorithm complexity is reduced, and the method can be used for matrix inversion of the fields of wireless communication, signal processing and numerical calculation.
Owner:南京易太可通信技术有限公司

Extensible QR decomposition method based on pipeline working mode

The invention provides an extensible QR decomposition method based on a pipeline working mode. A layered and cascaded structure is adopted, wherein pipeline operation is realized among layers; two lines of matrix data of each layer are subject to Givens rotation; the Givens rotation is conducted by using a coordinate rotation digital computer (CORDIC) algorithm and realized by using operations of addition and displacement; the layer number is determined by the line number or the row number of matrices; a whole QR decomposition module consists of a controller and a data processing module; a line rotation module is arranged on each layer of the data processing module; output ports of upper layers of line rotation modules are connected with input ports of lower layers of line rotation modules; the matrix data to be composed are input from an input port of the first layer of line rotation module, and sequentially flow through all the line rotation modules; and all the line rotation modules work in parallel. The scalable QR decomposition method has the advantages that hardware resources are saved; and as the iterative process of the CORDIC algorithm is split at the inner part of each layer of the data processing module, a pipeline structure is formed, the rotation operation of multiple vector groups is processed in a time sharing manner, the throughput rate is increased, and the extension is flexible.
Owner:TSINGHUA UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products