Precoding method based on CSM (Cholesky-Decompositionand Sherman-Morrison lemma)

A precoding and modulation technology, applied in the field of communication, can solve the problems of high algorithm complexity, poor bit error rate, high bit error rate, etc.

Inactive Publication Date: 2016-10-12
BEIJING UNIV OF POSTS & TELECOMM
View PDF2 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] Although the precoding method based on the Neumann algorithm can significantly reduce the complexity of matrix inversion, its performance (such as: combined rate, bit error rate and robustness) is poor. Although the SOR algorithm can approach the RZF algorithm in terms of channel capacity, but The bit error rate is very high, and compared with the Neumann algorithm, the complexity of the algorithm will become very high when the number of iterations is large

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
  • Precoding method based on CSM (Cholesky-Decompositionand Sherman-Morrison lemma)
  • Precoding method based on CSM (Cholesky-Decompositionand Sherman-Morrison lemma)
  • Precoding method based on CSM (Cholesky-Decompositionand Sherman-Morrison lemma)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0077] In order to solve the problem that the high-dimensional matrix inversion complexity is too high in the precoding problem of the existing Massive MIMO technology, the embodiment of the present invention provides a C (Cholesky-Decomposition) SM (Sherman-Morrison lemma) RZF precoding method, the method flow chart is as figure 2 As shown, the method includes:

[0078] In the first step, using the nature of TDD modulation, the terminal sends signaling to the base station on the uplink channel so that the base station can use the channel reciprocity of TDD to obtain the channel state information (CSI) of the downlink channel and obtain the channel gain matrix H.

[0079] In the second step, according to the precoding formula of RZF, the matrix W=H H that needs to be inverted is obtained H +ω·I.

[0080] The third step is to use the computing advantages of the hardware pipeline to perform fast Cholesky decomposition on the matrix W and obtain the lower triangular matrix L. ...

Embodiment 2

[0084] For the problem of high-dimensional matrix inversion in the precoding problem of the existing Massive MIMO technology, the embodiment of the present invention can also provide a MMSE based on C (Cholesky-Decomposition) SM (Sherman-Morrison lemma) on the basis of the traditional MMSE algorithm Precoding algorithm, the flow chart of the method is as follows figure 2 As shown, the method includes:

[0085] In the first step, using the nature of TDD modulation, the terminal sends signaling to the base station on the uplink channel so that the base station can use the channel reciprocity of TDD to obtain the channel state information (CSI) of the downlink channel and obtain the channel gain matrix H.

[0086] In the second step, according to the precoding formula of MMSE, the matrix W=H H that needs to be inverted is obtained H +ω·I.

[0087] The third step is to use the computing advantages of the hardware pipeline to perform fast Cholesky decomposition on the matrix W a...

Embodiment 3

[0091] In order to solve the problem that the high-dimensional matrix inversion complexity is too high in the precoding problem of the existing Massive MIMO technology, when the matrix that needs to be inverted satisfies Such a form or the matrix W that needs to be inverted satisfies the premise of a positive definite Hermitian matrix, and the precoding method based on C (Cholesky-Decomposition) SM (Sherman-Morrison lemma) proposed in this patent can be used. The method flow Figure such as figure 2 As shown, the method includes:

[0092] In the first step, using the nature of TDD modulation, the terminal sends signaling to the base station on the uplink channel so that the base station can use the channel reciprocity of TDD to obtain the channel state information (CSI) of the downlink channel and obtain the channel gain matrix H.

[0093] In the second step, according to all the precoding formulas that meet the above conditions, the matrix W=H H that needs to be inverted is ...

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 embodiment of this invention discloses a precoding method based on CSM (Cholesky-Decompositionand Sherman-Morrison lemma). The method is applicable when an inversion matrix satisfies the form of W=H.HH+omega.I or the character of positive definite hermitian in precoding. The method provided in this invention uses regularized zero-forcing precoding algorithm to illustrate, and comprises the following steps: complete procedure declaration and theoretical proof (method process and theoretical proof of Cholesky decomposition and Sherman-Morrison formula), performance analysis of improved regularized zero-forcing precoding algorithm, and applicable situation and performance optimization of the structure given in the form of the embodiment. The method provided in this invention uses regularized zero-forcing precoding algorithm to illustrate, but is not limited to the algorithm; for example, this method is further applicable to MMSE (Minimum Mean Square Error) algorithm, and the like. The method provided by this embodiment of this invention effectively reduces the computation complexity of precoding in Massive MIMO (Multiple Input Multiple Output) communication system, improves the resultant velocity, reduces the bit error rate, and improves and optimizes the performance of this type of technology.

Description

technical field [0001] The present invention relates to the field of communication technology, in particular to when the matrix that needs to be inverted in precoding satisfies W=H·H H The precoding method in the form of +ω·I or the positive definite Hermetian property. [0002] This patent uses RZF as an example to introduce the principle of the present invention, but it is not limited to the RZF algorithm, as long as the matrix that needs to be inverted in the precoding satisfies W=H·H H +ω·I form or positive definite Hermetian properties, the technology of the present invention can be used. [0003] It should be noted that this patent uses precoding in communication as an example to introduce the principle of the method, but the method proposed in this patent is not limited to the communication field, as long as any modern industrial technology needs to perform matrix inversion operation, and the matrix satisfies certain conditions , just can utilize the method that this ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L25/03H04B7/04
CPCH04L25/0391H04B7/0456
Inventor 邹卫霞徐悦杜刘通
Owner BEIJING UNIV OF POSTS & TELECOMM
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap