Low complexity orthogonal iterative beam forming method

An orthogonal iteration and beamforming technology, applied in space transmit diversity, network planning, electrical components, etc., can solve problems such as high complexity and reduce algorithm complexity, and achieve the effect of reducing algorithm complexity and ensuring system performance

Inactive Publication Date: 2012-06-13
UNIV OF ELECTRONIC SCI & TECH OF CHINA
View PDF4 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0020] The purpose of the present invention is to overcome the defect of high complexity caused by the need to calculate the beamforming vector of each data stream signal step by step in the existing method, and propose a low-complexi

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Low complexity orthogonal iterative beam forming method
  • Low complexity orthogonal iterative beam forming method
  • Low complexity orthogonal iterative beam forming method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] The design intent-driven natural language geometric modeling method of the present invention will be further described below with reference to the drawings and specific embodiments.

[0037] Such as figure 1 and figure 2 As shown, a low-complexity orthogonal iterative beamforming method includes the following steps:

[0038] Step 1: pair the matrix Perform an initialization operation to get The initialization value of I is the identity matrix, M is a natural number greater than 1, J is a natural number greater than 1 and less than M, is a matrix composed of M rows and the first J columns of the M×M identity matrix, The subscript represents the corresponding initial matrix when the loop variable K=0, K=k-1, k is a natural number greater than or equal to 1; or select is a randomly generated matrix that satisfies representation matrix The conjugate transpose matrix of .

[0039] Set the number of iterations N of the following steps 2 to 6 iteration (th...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a low complexity orthogonal iterative beam forming method. The method comprises the following steps that: step 1, initialization operation is carried out on a matrix V^K to obtain an initialization value V^0 that is equal to I M*J, wherein the following relation is satisfied: V^< ' >0*V^0=IJ*J and the V^< ' >0 expresses a conjugate transpose matrix of the matrix V^0; step 2, a transmitting terminal transmits V^<*>k-1 and a receiving terminal receives an r, wherein the r satisfies the following relation: r=HV^<*>k-1; step 3, the receiving terminal sends r<*> that expresses a conjugate matrix of the r; and under a time division duplex (TDD) mode, due to channel reciprocity, a reverse channel matrix H(S) is a transposed matrix H<T> of a forward channel matrix H, that is, H(S) is equal to H<T>; and a signal matrix t received by the transmitting terminal satisfies the following relation: t=H(S)R<*>=H<T>r<*>=H<T>H<*>V^k-1, wherein the H<*> is a conjugate matrix of the H; step 4, QR matrix decomposition is carried out at the transmitting terminal; step 5, if a cyclic variable k is greater than or is equal to Niteration, a V that is equal to V^<*>k-1 is output as a beam forming matrix V of the transmitting terminal; and step 6, the transmitting terminal sends the beam forming matrix V and the receiving terminal receives an r that is equal to a result by multiplying an H by a V, and QR matrix decomposition is carried out. According to the invention, beneficial effects are as follows: the system performance can be ensured and algorithm complexity can be substantially reduced.

Description

technical field [0001] The invention belongs to the technical field of wireless communication, and in particular relates to a method for simultaneously obtaining several beamforming vectors in a wireless communication system with low-complexity orthogonal QR iteration. Background technique [0002] In single-carrier and Orthogonal Frequency Division Multiplex (OFDM, Orthogonal Frequency Division Multiple) multi-carrier systems, the method to obtain the optimal beamforming weight is the characteristic beamforming method, which designs the beamforming at the sending end according to the maximum signal-to-noise ratio criterion vector. By performing eigenvalue decomposition on the user spatial correlation matrix, the eigenvector corresponding to the largest eigenvalue is found as the weight vector, so as to realize beamforming. Assuming that the channel matrix information H is known to the transmitting end and the receiving end, the optimal transmitting and receiving beam vecto...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04W16/28H04B7/04
Inventor 成先涛张亭亭岳光荣李少谦
Owner UNIV OF ELECTRONIC SCI & TECH OF CHINA
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