CN105071849A

CN105071849A - Method for realizing multi-stream beam forming in TD-LTE-Advanced

Info

Publication number: CN105071849A
Application number: CN201510297834.8A
Authority: CN
Inventors: 王德胜; 陈长帅; 程荣涛; 林宏志; 熊磊; 常成龙
Original assignee: Huazhong University of Science and Technology
Current assignee: Huazhong University of Science and Technology
Priority date: 2015-06-03
Filing date: 2015-06-03
Publication date: 2015-11-18
Anticipated expiration: 2035-06-03
Also published as: CN105071849B

Abstract

The invention discloses a method for realizing multi-stream beamforming in TD-LTE-Advanced, comprising: obtaining a 4×8 channel matrix from an uplink sounding reference signal of a TD-LTE ^- Advanced base station, and decomposing the channel matrix A1 , to obtain two 4×4 sub-channel matrices, perform Household transformation on each sub-channel matrix to generate the upper Hessenberg matrix, and perform Givens rotation on the upper Hessenberg matrix J ⁽¹⁾ to transform the matrix J ⁽¹⁾ into a pair The above operation is repeated at least 5 times, and the matrix obtained from the previous calculation will be used as the Hessenberg matrix used in the next calculation, and the obtained right-multiplied Household transformation matrix and the obtained right-multiplied Givens matrix are multiplied to obtain Get a 4*4 matrix. Each column of the generated matrix V is weighted by using the maximum ratio transmission algorithm to generate the final beamforming weight vector. The invention can overcome the deficiency of the existing EBB algorithm, accurately calculate the multi-stream beamforming weight vector, and effectively reduce the bit error rate.

Description

A method for realizing multi-stream beamforming in TD-LTE-Advanced

技术领域 technical field

本发明属于移动通信技术领域，更具体地，涉及一种实现TD-LTE-Advanced中多流波束赋形的方法。 The invention belongs to the technical field of mobile communication, and more specifically relates to a method for realizing multi-stream beamforming in TD-LTE-Advanced.

背景技术 Background technique

近年来全球通信事业快速发展，无线通信的需求越来越大，无线通信事业得到了蓬勃发展。但是随着人们对无线通信需求的不断加大，巨大的通信需求量与十分有限的频谱资源之间的矛盾越来越突出。如何高效的利用有限的频谱资源，并在保证质量的前提下大规模的提高系统容量成了无线通信界亟待解决的重要课题，智能天线中的波束赋形已经成为解决这一问题的一个重要方向。 In recent years, with the rapid development of the global communication industry, the demand for wireless communication is increasing, and the wireless communication industry has developed vigorously. However, as people's demand for wireless communication continues to increase, the contradiction between the huge communication demand and the very limited spectrum resources is becoming more and more prominent. How to efficiently use limited spectrum resources and increase system capacity on a large scale under the premise of ensuring quality has become an important issue to be solved in the wireless communication industry. Beamforming in smart antennas has become an important direction to solve this problem. .

波束赋形是应用于小间距的天线阵列传输技术，利用空间的强相关性及波的干涉原理产生方向性的辐射方向图，使辐射方向图的主瓣自适应地指向用户来波方向，从而提高信噪比、系统容量和覆盖范围。 Beamforming is an antenna array transmission technology applied to small spacing. It uses the strong spatial correlation and wave interference principle to generate a directional radiation pattern, so that the main lobe of the radiation pattern adaptively points to the user's incoming wave direction, thereby Improve signal-to-noise ratio, system capacity and coverage.

传统的计算波束赋形权矢量的算法为基于特征分解的波束赋形(Eigen-basedBeamforming)的算法，该算法虽然实现简单，但是在计算多流波束赋形权矢量时存在两方面的不足：(一)对初始向量的选择依赖性很高，如果不能选择良好的初始迭代向量，可能导致难以收敛，不能求得波束赋形权矢量；(二)在信道矩阵存在相同特征值的情况下，只能得到单流的波束赋形权矢量，最终将导致较高的误码率。 The traditional algorithm for calculating the beamforming weight vector is the Eigen-based Beamforming algorithm. Although the algorithm is simple to implement, there are two deficiencies in the calculation of the multi-stream beamforming weight vector: ( 1) The selection of the initial vector is highly dependent. If a good initial iterative vector cannot be selected, it may be difficult to converge and the beamforming weight vector cannot be obtained; (2) In the case of the same eigenvalue of the channel matrix, only A single-stream beamforming weight vector can be obtained, which will eventually lead to a higher bit error rate.

发明内容 Contents of the invention

针对现有技术的以上缺陷或改进需求，本发明提供了一种实现TD-LTE-Advanced中多流波束赋形权矢量的方法，其目的在于，克服现有EBB算法的不足，准确地计算多流波束赋形权矢量，并有效降低误码率。 Aiming at the above defects or improvement needs of the prior art, the present invention provides a method for realizing multi-stream beamforming weight vectors in TD-LTE-Advanced, the purpose of which is to overcome the shortcomings of the existing EBB algorithm and accurately calculate multiple Stream beamforming weight vectors and effectively reduce the bit error rate.

为实现上述目的，按照本发明的一个方面，提供了一种实现TD-LTE-Advanced中多流波束赋形的方法，包括以下步骤： In order to achieve the above object, according to one aspect of the present invention, a method for realizing multi-stream beamforming in TD-LTE-Advanced is provided, comprising the following steps:

(1)从TD-LTE-Advanced基站的上行探测参考信号获取4×8的信道矩阵A¹； (1) Obtain the channel matrix A ¹ of 4×8 from the uplink sounding reference signal of the TD-LTE-Advanced base station;

(2)将信道矩阵A¹进行分解，以得到两个4×4子信道矩阵A^(p,1)，其分别对应于两个子天线阵列，其中p表示子天线阵列的序号； (2) Decompose the channel matrix A ¹ to obtain two 4×4 sub-channel matrices A ^(p,1) , which respectively correspond to two sub-antenna arrays, where p represents the serial number of the sub-antenna arrays;

(3)对每个子信道矩阵A^(p,1)进行Household变换，以生成上Hessenberg矩阵J⁽¹⁾ (3) Perform Household transformation on each sub-channel matrix A ^{(p, 1)} to generate the upper Hessenberg matrix J ⁽¹⁾

(4)对上Hessenberg矩阵J⁽¹⁾进行Givens旋转，以将该矩阵J⁽¹⁾变换成对角矩阵； (4) Carry out Givens rotation to upper Hessenberg matrix J ⁽¹⁾ , to transform the matrix J ⁽¹⁾ into a diagonal matrix;

(5)重复上述步骤(4)的运算达至少5次，其中上一次计算得到的矩阵又会作为下一次计算中所使用的Hessenberg矩阵； (5) Repeat the operation of the above step (4) for at least 5 times, wherein the matrix obtained from the previous calculation will be used as the Hessenberg matrix used in the next calculation;

(6)将步骤(3)中得到的右乘Household变换矩阵和步骤(4)中得到的右乘Givens矩阵叠乘，以得到一个4*4的矩阵V，即该矩阵V的每一列记为v₁,v₂,v₃,v₄。 (6) Multiply the right-multiplied Household transformation matrix obtained in step (3) and the right-multiplied Givens matrix obtained in step (4), to obtain a 4*4 matrix V, namely Each column of the matrix V is denoted as v ₁ , v ₂ , v ₃ , v ₄ .

(7)利用最大比传输算法对步骤(6)生成的矩阵V的每一列v₁,v₂,v₃,v₄进行加权处理，以生成最终的波束赋形权矢量v'₁,v'₂,v'₃,v'₄： (7) Use the maximum ratio transmission algorithm to weight each column v ₁ , v ₂ , v ₃ , v ₄ of the matrix V generated in step (6) to generate the final beamforming weight vector v' ₁ , v' ₂ ,v' ₃ ,v' ₄ :

v′₁＝p₁v₁ v' ₁ = p ₁ v ₁

v′₂＝p₂v₂ v′ ₂ =p ₂ v ₂

v′₃＝p₃v₃ v′ ₃ = p ₃ v ₃

v′₄＝p₄v₄ v′ ₄ ＝p ₄ v ₄

其中p为发射功率因子。 where p is the transmit power factor.

优选地，步骤(3)包括以下子步骤： Preferably, step (3) includes the following substeps:

(3-1)设置计数器k＝1； (3-1) setting counter k=1;

(3-2)构造左乘Household矩阵L^(k)，使用该矩阵对A^(p,k)进行左乘，以得到矩阵A^(p,k+1/2)＝L^(k)A^(p,k)； (3-2) Construct a left-multiplied Household matrix L ^(k) , and use this matrix to left-multiply A ^{(p, k)} to obtain the matrix A ^{(p, k+1/2)} = L ^(k) A ^{(p ,k)} ;

(3-3)判断是否有k+1＝4成立，如果是则矩阵A^(p,1)成为上Hessenberg矩阵J⁽¹⁾，过程结束，否则进入步骤(3-4)； (3-3) Judging whether k+1=4 is established, if so, matrix A ^{(p, 1)} becomes the upper Hessenberg matrix J ⁽¹⁾ , and the process ends, otherwise enter step (3-4);

(3-4)构造右乘Household矩阵R^(k)，使用右乘Household矩阵R^(k)对A^(p,k+1/2)进行右乘，以得到矩阵A^(p,k+1)＝A^(p,k+1/2)R^(k)； (3-4) Construct the right-multiplied Household matrix R ^(k) , and use the right-multiplied Household matrix R ^(k) to right-multiply A ^(p,k+1/2) to obtain the matrix A ^(p,k+1) =A ^(p,k+1/2) R ^(k) ;

(3-5)设置k＝k+1，并返回步骤(3-2)； (3-5) set k=k+1, and return to step (3-2);

优选地，构造左乘Household矩阵采用以下方式： Preferably, constructing the left-multiplied Household matrix adopts the following method:

(3-2-1)先计算缩放因子K_x，令表示被变换矩阵A^(p,k)中的第i行第j列的元素： (3-2-1) First calculate the scaling factor K _x , let Represents the elements of row i and column j in the transformed matrix A ^(p,k) :

${K K}_{x x} = = 11 + + \sqrt{\frac{{Σ Σ}_{i i = = k k}^{N N} {a a}_{i i,, k k}^{((k k))} {a a}_{i i,, k k}^{((k k)) * *}}{{a a}_{k k,, k k}^{((k k))} {a a}_{k k,, k k}^{((k k)) * *}}}$

(3-2-2)构造列向量{xtemp}^k： (3-2-2) Construct column vector {xtemp} ^k :

(3-2-3)将{xtemp}^k转化为单位向量{x}^(k)： (3-2-3) Convert {xtemp} ^k to unit vector {x} ^(k) :

${{x x}}^{((k k))} = = \frac{11}{\sqrt{{Σ Σ}_{i i = = k k}^{N N} {xtemp xtemp}_{i i}^{((k k))} {xtemp xtemp}_{i i}^{((k k)) * *}}} {{xtemp xtemp}}^{k k}$

(3-2-4)根据{x}^(k)构造左乘Household矩阵L^(k)： (3-2-4) Construct the left multiplication Household matrix L ^(k ) according to {x} ⁽ k):

L^(k)＝I-2{x}^(k){x}^(k)*，其中I是4*4的单位矩阵。 L ^(k) =I−2{x} ^(k) {x} ^(k)* , where I is a 4*4 identity matrix.

优选地，构造右乘Household矩阵采用以下方式： Preferably, constructing the right multiplication Household matrix adopts the following method:

(3-4-1)先计算缩放因子K_y，令表示被变换矩阵A^(p,k+1/2)中的第k行第i列的元素 (3-4-1) First calculate the scaling factor K _y , let Indicates the elements of row k and column i in the transformed matrix A ^(p,k+1/2)

${K K}_{y the y} = = 11 + + \sqrt{\frac{{Σ Σ}_{i i = = k k + + 11}^{N N} {a a}_{k k,, i i}^{((k k + + 11 / / 22))} {a a}_{k k,, i i}^{((k k + + 11 / / 22)) * *}}{{a a}_{k k,, k k + + 11}^{((k k + + 11 / / 22))} {a a}_{k k,, k k + + 11}^{((k k + + 11 / / 22)) * *}}}$

(3-4-2)构造列向量{ytemp}^k： (3-4-2) Construct column vector {ytemp} ^k :

(3-4-3)将{ytemp}^k化为单位向量{y}^(k)： (3-4-3) Turn {ytemp} ^k into a unit vector {y} ^(k) :

${{y the y}}^{((k k))} = = \frac{11}{\sqrt{{Σ Σ}_{i i = = k k + + 11}^{N N} {ytemp ytemp}_{i i}^{((k k))} {ytemp ytemp}_{i i}^{((k k)) * *}}} {{ytemp ytemp}}^{k k}$

(3-4-4)根据{y}^(k)构造R^(k) (3-4-4) Construct R ^(k ) according to {y} ⁽ k)

R^(k)＝I-2{y}^(k){y}^(k)*，其中I是4*4的单位矩阵。 R ^(k) =I−2{y} ^(k) {y} ^(k)* , where I is a 4*4 identity matrix.

优选地，步骤(4)包括以下子步骤： Preferably, step (4) includes the following sub-steps:

(4-1)设置计数器m＝1； (4-1) Counter m=1 is set;

(4-2)构造右旋Givens矩阵Q^(m)，对J^(m)进行右乘，以得到J^(m+1/2)。即：J^(m+1/2)＝J^(m)Q^(m)； (4-2) Construct the right-handed Givens matrix Q ^(m) , and perform right multiplication on J ^(m) to obtain J ^(m+1/2) . That is: J ^(m+1/2) = J ^(m) Q ^(m) ;

(4-3)构造左旋Givens矩阵P^(m)，对J^(m+1/2)进行左乘，得到J^(m+1)。即：J^(m+1)＝P^(m)J^(m+1/2)； (4-3) Construct a left-handed Givens matrix P ^(m) , and perform left multiplication on J ^(m+1/2) to obtain J ^(m+1) . That is: J ^(m+1) = P ^(m) J ^(m+1/2) ;

(4-4)设置计数器m＝m+1； (4-4) Counter m=m+1 is set;

(4-5)判断是否有m＝4，如果是过程结束，否则返回步骤(4-2)。 (4-5) Judge whether there is m=4, if it is the end of the process, otherwise return to step (4-2).

优选地，构造右乘Givens矩阵采用以下方式： Preferably, constructing the right multiplication Givens matrix adopts the following method:

(4-2-1)设置初始向量其中为J^(m)中的第i行第j列元素； (4-2-1) Setting the initial vector in is the i-th row and j-column element in J ^(m) ;

(4-2-2)由[f^(m),g^(m)]计算Givens右旋矩阵Q^(m)，对于Q^(m)中对角线上的元素且l≠m且l≠m+1； (4-2-2) Calculate the Givens right-handed matrix Q ^(m ) from [f ^(m) , g ^(m) ], for the elements on the diagonal in Q ^(m) And l≠m and l≠m+1;

(4-2-3)令Q^(m)中矩阵块 (4-2-3) Make the matrix block in Q ^(m)

$[\begin{matrix} {q q}_{m m,, m m}^{((m m))} & {q q}_{m m,, m m + + 11}^{((m m))} \\ {q q}_{m m + + 11,, m m}^{((m m))} & {q q}_{m m + + 11,, m m + + 11}^{((m m))} \end{matrix}] = = [\begin{matrix} {f f}^{((m m)) * *} / / r r & - - {g g}^{((m m))} {f f}^{((m m)) * *} / / ((r r . . {R R}_{f f})) \\ {g g}^{((m m)) * *} / / r r & {R R}_{f f} / / r r \end{matrix}],,$

其中r为初始向量的模，R_f为f^(m)的模； Where r is the modulus of the initial vector, R _f is the modulus of f ^(m) ;

(4-2-4)对于其余元素，取0。 (4-2-4) For the remaining elements, take 0.

优选地，构造左乘Givens矩阵采用以下方式： Preferably, constructing the left-multiplied Givens matrix adopts the following method:

(4-3-1)设置初始向量 (4-3-1) Set the initial vector

${[f^{(m + 1 / 2)}, g^{(m + 1 / 2)}]}^{T} = {[j_{m, m}^{(m + 1 / 2)}, j_{m + 1, m}^{(m + 1 / 2)}]}^{T};$ 其中为J^(m+1/2)中的第i行第j列的元素； ${[f^{(m + 1 / 2)}, g^{(m + 1 / 2)}]}^{T} = {[j_{m, m}^{(m + 1 / 2)}, j_{m + 1, m}^{(m + 1 / 2)}]}^{T};$ in is the element in row i and column j in J ^(m+1/2) ;

(4-3-2)由[f^(m+1/2),g^(m+1/2)]^T计算Givens左旋矩阵P^(m)，对于对角线上的元素且l≠m且l≠m+1； (4-3-2) Calculate the Givens left-handed matrix P ^(m ) from [f ^(m+1/2) ,g ^(m+1/2) ] ^T , for the elements on the diagonal And l≠m and l≠m+1;

(4-3-3)令矩阵块 (4-3-3) Let the matrix block

$[\begin{matrix} p_{m, m}^{(m)} & p_{m, m + 1}^{(m)} \\ p_{m + 1, m}^{(m)} & p_{m + 1, m + 1}^{(m)} \end{matrix}] = [\begin{matrix} f^{(m + 1 / 2) *} / r & g^{(m + 1 / 2) *} / r \\ - g^{(m + 1 / 2)} f^{(m + 1 / 2) *} / (r \cdot R_{f}^{(m)}) & R_{f}^{(m + 1 / 2)} / r \end{matrix}],$ 其中r为初始向量的模，R_f为f^(m+1/2)的模； $[\begin{matrix} p_{m, m}^{(m)} & p_{m, m + 1}^{(m)} \\ p_{m + 1, m}^{(m)} & p_{m + 1, m + 1}^{(m)} \end{matrix}] = [\begin{matrix} f^{(m + 1 / 2) *} / r & g^{(m + 1 / 2) *} / r \\ - g^{(m + 1 / 2)} f^{(m + 1 / 2) *} / (r \cdot R_{f}^{(m)}) & R_{f}^{(m + 1 / 2)} / r \end{matrix}],$ Where r is the modulus of the initial vector, R _f is the modulus of f ^(m+1/2) ;

(4-3-4)对于其余元素，取0。 (4-3-4) For the remaining elements, take 0.

优选地，加权因子是通过如下公式求得： Preferably, the weighting factor is obtained by the following formula:

$\begin{matrix} {p p}_{11} = = \frac{{σ σ}_{11}^{22}}{{σ σ}_{11}^{22} + + {σ σ}_{22}^{22} + + {σ σ}_{33}^{22} + + {σ σ}_{44}^{22}} \\ {p p}_{22} = = \frac{{σ σ}_{22}^{22}}{{σ σ}_{11}^{22} + + {σ σ}_{22}^{22} + + {σ σ}_{33}^{22} + + {σ σ}_{44}^{22}} \\ {p p}_{33} = = \frac{{σ σ}_{33}^{22}}{{σ σ}_{11}^{22} + + {σ σ}_{22}^{22} + + {σ σ}_{33}^{22} + + {σ σ}_{44}^{22}} \\ {p p}_{44} = = \frac{{σ σ}_{44}^{22}}{{σ σ}_{11}^{22} + + {σ σ}_{22}^{22} + + {σ σ}_{33}^{22} + + {σ σ}_{44}^{22}} \end{matrix}$

其中σ₁,σ₂,σ₃,σ₄分别为子信道矩阵A^(p,1)的奇异值。 Among them, σ ₁ , σ ₂ , σ ₃ , and σ ₄ are the singular values of the sub-channel matrix A ^(p,1) respectively.

按照本发明的另一方面，提供了一种实现TD-LTE-Advanced中多流波束赋形的，包括： According to another aspect of the present invention, a method for realizing multi-stream beamforming in TD-LTE-Advanced is provided, including:

第一模块，用于从TD-LTE-Advanced基站的上行探测参考信号获取4×8的信道矩阵A¹； The first module is used to obtain the channel matrix A ¹ of 4×8 from the uplink sounding reference signal of the TD-LTE-Advanced base station;

第二模块，用于将信道矩阵A¹进行分解，以得到两个4×4子信道矩阵A^(p,1)，其分别对应于两个子天线阵列，其中p表示子天线阵列的序号； The second module is used to decompose the channel matrix A ¹ to obtain two 4×4 sub-channel matrices A ^{(p, 1)} , which respectively correspond to two sub-antenna arrays, where p represents the serial number of the sub-antenna arrays;

第三模块，用于对每个子信道矩阵A^(p,1)进行Household变换，以生成上Hessenberg矩阵J⁽¹⁾ The third module is used to perform Household transformation on each sub-channel matrix A ^{(p, 1)} to generate the upper Hessenberg matrix J ⁽¹⁾

第四模块，用于对上Hessenberg矩阵J⁽¹⁾进行Givens旋转，以将该矩阵J⁽¹⁾变换成对角矩阵； The fourth module is used to carry out Givens rotation to the upper Hessenberg matrix J ⁽¹⁾ , to transform the matrix J ⁽¹⁾ into a diagonal matrix;

第五模块，用于重复上述第四模块的运算达至少5次，其中上一次计算得到的矩阵又会作为下一次计算中所使用的Hessenberg矩阵； The fifth module is used to repeat the operation of the fourth module above at least 5 times, wherein the matrix obtained from the previous calculation will be used as the Hessenberg matrix used in the next calculation;

第六模块，用于将第三模块得到的右乘Household变换矩阵和第四模块得到的右乘Givens矩阵叠乘，以得到一个4*4的矩阵V，即该矩阵V的每一列记为v₁,v₂,v₃,v₄。 The sixth module is used to multiply the right-multiplied Household transformation matrix obtained by the third module and the right-multiplied Givens matrix obtained by the fourth module to obtain a 4*4 matrix V, namely Each column of the matrix V is denoted as v ₁ , v ₂ , v ₃ , v ₄ .

第七模块，用于利用最大比传输算法对第六模块生成的矩阵V的每一列v₁,v₂,v₃,v₄进行加权处理，以生成最终的波束赋形权矢量v'₁,v'₂,v'₃,v'₄： The seventh module is configured to perform weighting processing on each column v ₁ , v ₂ , v ₃ , and v ₄ of the matrix V generated by the sixth module by using the maximum ratio transmission algorithm, so as to generate a final beamforming weight vector v' ₁ , v' ₂ ,v' ₃ ,v' ₄ :

v′₁＝p₁v₁ v' ₁ = p ₁ v ₁

v′₂＝p₂v₂ v′ ₂ =p ₂ v ₂

v′₃＝p₃v₃ v′ ₃ = p ₃ v ₃

v′₄＝p₄v₄ v′ ₄ ＝p ₄ v ₄

其中p为发射功率因子。 where p is the transmit power factor.

总体而言，通过本发明所构思的以上技术方案与现有技术相比，能够取得下列有益效果： Generally speaking, compared with the prior art, the above technical solutions conceived by the present invention can achieve the following beneficial effects:

1、本发明能够克服现有方法中存在的对初始向量的选择依赖性很高的问题：由于本发明没有采用初始向量，因此本发明不依赖于初始向量的选择； 1. The present invention can overcome the problem of high dependence on the selection of the initial vector existing in the existing method: since the present invention does not use the initial vector, the present invention does not depend on the selection of the initial vector;

2、由于本发明采用了豪斯霍尔德变换和吉文斯旋转实现了信道矩阵的奇异值分解。因此，本发明在信道矩阵存在相同特征值的情况下，也能得到多流的波束赋形权矢量，这样就降低了误码率。 2. The singular value decomposition of the channel matrix is realized because the present invention adopts Haushold transformation and Givens rotation. Therefore, the present invention can also obtain multi-stream beamforming weight vectors when the same eigenvalue exists in the channel matrix, thus reducing the bit error rate.

附图说明 Description of drawings

图1是本发明使用的天线阵列示意图。 Fig. 1 is a schematic diagram of an antenna array used in the present invention.

图2是本发明实现TD-LTE-Advanced中多流波束赋形的方法的流程图。 Fig. 2 is a flow chart of the method for realizing multi-stream beamforming in TD-LTE-Advanced according to the present invention.

具体实施方式 Detailed ways

为了使本发明的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本发明进行进一步详细说明。应当理解，此处所描述的具体实施例仅仅用以解释本发明，并不用于限定本发明。此外，下面所描述的本发明各个实施方式中所涉及到的技术特征只要彼此之间未构成冲突就可以相互组合。 In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not constitute a conflict with each other.

本发明的基本思路在于，通过对信道矩阵进行豪斯霍尔德变换将信道矩阵转化为上海森伯格矩阵，之后对上海森伯格矩阵进行吉文斯旋转，将其转化为对角阵，这样就实现了信道矩阵的奇异值分解，将得到信道矩阵的右奇异值矩阵的每一列作为波束赋形的权矢量使用。 The basic idea of the present invention is to transform the channel matrix into a Shanghai Senberg matrix by performing Haushold transformation on the channel matrix, and then perform Givens rotation on the Shanghai Senberg matrix to convert it into a diagonal matrix, thus The singular value decomposition of the channel matrix is realized, and each column of the obtained right singular value matrix of the channel matrix is used as a beamforming weight vector.

本发明采用图1中的4×4交叉极化天线阵列，该天线阵列由两个子阵列构成，1，2，3，4组成子阵列1，采用-45°极化，5，6，7，8组成子阵列2，采用+45°极化。 The present invention adopts the 4×4 cross-polarized antenna array in FIG. 1, which is composed of two sub-arrays, 1, 2, 3, and 4 form sub-array 1, and adopts -45° polarization, 5, 6, 7, 8 form sub-array 2, using +45° polarization.

该天线阵列模式支持2.6GHz载频，本发明基站侧配置八天线，用户侧配置四天线。 The antenna array mode supports 2.6 GHz carrier frequency, eight antennas are configured on the base station side of the present invention, and four antennas are configured on the user side.

如图2所示，本发明实现TD-LTE-Advanced中多流波束赋形的方法，包括以下步骤： As shown in Figure 2, the present invention realizes the method for multi-stream beamforming in TD-LTE-Advanced, comprises the following steps:

(1)从TD-LTE-Advanced基站的上行探测参考信号(soundingreferencesignal，简称SRS)获取4×8的信道矩阵A¹； (1) Obtain a 4×8 channel matrix A ¹ from an uplink sounding reference signal (sounding reference signal, SRS for short) of a TD-LTE-Advanced base station;

(3)对每个子信道矩阵A^(p,1)进行Household变换，以生成上Hessenberg矩阵J⁽¹⁾，本步骤包括以下子步骤： (3) Household transformation is performed on each sub-channel matrix A ^{(p, 1)} to generate the upper Hessenberg matrix J ⁽¹⁾ . This step includes the following sub-steps:

(3-1)设置计数器k＝1； (3-1) setting counter k=1;

(3-2)构造左乘Household矩阵L^(k)，使用该矩阵对A^(p,k)进行左乘，以得到矩阵A^(p,k+1/2)，即：A^(p,k+1/2)＝L^(k)A^(p,k)；其中构造左乘Household矩阵采用以下方式： (3-2) Construct the left-multiplication Household matrix L ^(k) , and use this matrix to left-multiply A ^(p,k) to obtain the matrix A ^(p,k+1/2) , namely: A ^{(p,k +1/2)} ＝L ^(k) A ^(p,k) ; where the left-multiplied Household matrix is constructed in the following way:

(3-2-2)构造列向量{xtemp}^k： (3-2-2) Construct column vector {xtemp} ^k :

L^(k)＝I-2{x}^(k){x}^(k)*；其中I是4*4的单位矩阵； L ^(k) =I-2{x} ^(k) {x} ^(k)* ; Wherein I is the identity matrix of 4*4;

(3-4)构造右乘Household矩阵R^(k)，使用右乘Household矩阵R^(k)对A^(p,k+1/2)进行右乘，以得到矩阵A^(p,k+1)，即：A^(p,k+1)＝A^(p,k+1/2)R^(k)；其中构造右乘Household矩阵采用以下方式： (3-4) Construct the right-multiplied Household matrix R ^(k) , and use the right-multiplied Household matrix R ^(k) to right-multiply A ^(p,k+1/2) to obtain the matrix A ^(p,k+1) , that is: A ^(p,k+1) ＝A ^(p,k+1/2) R ^(k) ; where the right multiplication Household matrix is constructed in the following way:

(3-4-2)构造列向量{ytemp}^k： (3-4-2) Construct column vector {ytemp} ^k :

(3-4-4)根据{y}^(k)构造R^(k)，I是4*4的单位矩阵： (3-4-4) Construct R ^(k ) according to {y} ^(k ), I is a 4*4 identity matrix:

R^(k)＝I-2{y}^(k){y}^(k)* R ^(k) = I-2{y} ^(k) {y} ^(k)*

(4)对上Hessenberg矩阵J⁽¹⁾进行吉文斯(Givens)旋转，以将该矩阵J⁽¹⁾变换成对角矩阵，本步骤包括以下子步骤： (4) Carry out Givens (Givens) rotation to upper Hessenberg matrix J ⁽¹⁾ , to transform this matrix J ⁽¹⁾ into a diagonal matrix, this step includes the following substeps:

(4-1)设置计数器m＝1； (4-1) Counter m=1 is set;

(4-2)构造右旋Givens矩阵Q^(m)，对J^(m)进行右乘，以得到J^(m+1/2)。即：J^(m+1/2)＝J^(m)Q^(m)；其中构造左乘Givens矩阵采用以下方式： (4-2) Construct the right-handed Givens matrix Q ^(m) , and perform right multiplication on J ^(m) to obtain J ^(m+1/2) . That is: J ^(m+1/2) ＝J ^(m) Q ^(m) ; Wherein constructing the left multiplication Givens matrix adopts the following method:

(4-2-2)由[f^(m),g^(m)]计算Givens右旋矩阵Q^(m)，对于Q^(m)中对角线上的元素且l≠m且l≠m+1 (4-2-2) Calculate the Givens right-handed matrix Q ^(m ) from [f ^(m) , g ^(m) ], for the elements on the diagonal in Q ^(m) And l≠m and l≠m+1

(4-2-3)令Q^(m)中矩阵块 (4-2-3) Make the matrix block in Q ^(m)

其中r为初始向量的模，R_f为f^(m)的模。 where r is the modulus of the initial vector and R _f is the modulus of f ^(m) .

(4-2-4)对于其余元素，取0。 (4-2-4) For the remaining elements, take 0.

(4-3)构造左旋Givens矩阵P^(m)，对J^(m+1/2)进行左乘，得到J^(m+1)。即：J^(m+1)＝P^(m)J^(m+1/2)；其中构造左乘Givens矩阵采用以下方式： (4-3) Construct a left-handed Givens matrix P ^(m) , and perform left multiplication on J ^(m+1/2) to obtain J ^(m+1) . That is: J ^(m+1) ＝P ^(m) J ^(m+1/2) ; Wherein constructing the left multiplication Givens matrix adopts the following method:

(4-3-1)设置初始向量 (4-3-1) Set the initial vector

${[f^{(m + 1 / 2)}, g^{(m + 1 / 2)}]}^{T} = {[j_{m, m}^{(m + 1 / 2)}, j_{m + 1, m}^{(m + 1 / 2)}]}^{T};$ 为J^(m+1/2)中的第i行第j列的元素。 ${[f^{(m + 1 / 2)}, g^{(m + 1 / 2)}]}^{T} = {[j_{m, m}^{(m + 1 / 2)}, j_{m + 1, m}^{(m + 1 / 2)}]}^{T};$ is the element in row i and column j in J ^(m+1/2) .

(4-3-2)由[f^(m+1/2),g^(m+1/2)]^T计算Givens左旋矩阵P^(m)，对于对角线上的元素且l≠m且l≠m+1 (4-3-2) Calculate the Givens left-handed matrix P ^(m ) from [f ^(m+1/2) ,g ^(m+1/2) ] ^T , for the elements on the diagonal And l≠m and l≠m+1

(4-3-3)令矩阵块 (4-3-3) Let the matrix block

$[\begin{matrix} p_{m, m}^{(m)} & p_{m, m + 1}^{(m)} \\ p_{m + 1, m}^{(m)} & p_{m + 1, m + 1}^{(m)} \end{matrix}] = [\begin{matrix} f^{(m + 1 / 2) *} / r & g^{(m + 1 / 2) *} / r \\ - g^{(m + 1 / 2)} f^{(m + 1 / 2) *} / (r \cdot R_{f}^{(m)}) & R_{f}^{(m + 1 / 2)} / r \end{matrix}],$ 其中r为初始向量的模，R_f为f^(m+1/2)的模。 $[\begin{matrix} p_{m, m}^{(m)} & p_{m, m + 1}^{(m)} \\ p_{m + 1, m}^{(m)} & p_{m + 1, m + 1}^{(m)} \end{matrix}] = [\begin{matrix} f^{(m + 1 / 2) *} / r & g^{(m + 1 / 2) *} / r \\ - g^{(m + 1 / 2)} f^{(m + 1 / 2) *} / (r \cdot R_{f}^{(m)}) & R_{f}^{(m + 1 / 2)} / r \end{matrix}],$ Where r is the modulus of the initial vector, and R _f is the modulus of f ^(m+1/2) .

(4-3-4)对于其余元素，取0。 (4-3-4) For the remaining elements, take 0.

(4-4)设置计数器m＝m+1； (4-4) Counter m=m+1 is set;

(7)利用最大比传输算法(MaximumRatioTransmission，简称MRT)对步骤(6)生成的矩阵V的每一列v₁,v₂,v₃,v₄进行加权处理，以生成最终的波束赋形权矢量v'₁,v'₂,v'₃,v'₄： (7) Use MaximumRatioTransmission algorithm (MaximumRatioTransmission, referred to as MRT) to weight each column v ₁ , v ₂ , v ₃ , v ₄ of the matrix V generated in step (6) to generate the final beamforming weight vector v' ₁ ,v' ₂ ,v' ₃ ,v' ₄ :

v′₁＝p₁v₁ v' ₁ = p ₁ v ₁

v′₂＝p₂v₂ v′ ₂ =p ₂ v ₂

v′₃＝p₃v₃ v′ ₃ = p ₃ v ₃

v′₄＝p₄v₄ v′ ₄ ＝p ₄ v ₄

其中p为发射功率因子，其通过如下公式求得： Where p is the transmit power factor, which is obtained by the following formula:

总而言之，本发明具有以下的有益效果： In a word, the present invention has the following beneficial effects:

2、由于本发明采用了豪斯霍尔德变换和吉文斯旋转实现了信道矩阵的奇异值分解，因此，本发明在信道矩阵存在相同特征值的情况下，也能得到多流的波束赋形权矢量，这样就降低了误码率。 2. Since the present invention uses Haushold transformation and Givens rotation to realize the singular value decomposition of the channel matrix, the present invention can also obtain multi-stream beamforming when the channel matrix has the same eigenvalues The weight vector reduces the bit error rate.

本领域的技术人员容易理解，以上所述仅为本发明的较佳实施例而已，并不用以限制本发明，凡在本发明的精神和原则之内所作的任何修改、等同替换和改进等，均应包含在本发明的保护范围之内。 Those skilled in the art can easily understand that the above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention. Any modifications, equivalent replacements and improvements made within the spirit and principles of the present invention, All should be included within the protection scope of the present invention.

Claims

1. realize a method for multi-flow beam forming in TD-LTE-Advanced, it is characterized in that, comprise the following steps:

(1) the channel matrix A of 4 × 8 is obtained from the uplink detection reference signal of TD-LTE-Advanced base station ¹;

(2) by channel matrix A ¹decompose, to obtain two 4 × 4 sub-channel matrix A ^{(p, 1)}, it corresponds respectively to two sub-aerial arrays, and wherein p represents the sequence number of sub antenna array;

(3) to each sub-channel matrix A ^{(p, 1)}carry out Household conversion, to generate upper Hessenberg matrix J ⁽¹⁾

(4) to upper Hessenberg matrix J ⁽¹⁾carry out Givens rotation, with by this matrix J ⁽¹⁾be transformed into diagonal matrix;

(5) computing repeating above-mentioned steps (4) reaches at least 5 times, and wherein the last matrix calculated again can as the Hessenberg matrix used in calculating next time;

(6) taken advantage of on the right side obtained in step (3) right side obtained in Household transformation matrix and step (4) to take advantage of Givens matrix to fold to take advantage of, to obtain the matrix V of a 4*4, namely each row of this matrix V are designated as v ₁, v ₂, v ₃, v ₄.

(7) utilize high specific transmission algorithm to each row v of the matrix V that step (6) generates ₁, v ₂, v ₃, v ₄be weighted process, to generate final wave beam forming weight vector v ' ₁, v ' ₂, v ' ₃, v ' ₄:

v′ ₁＝p ₁v ₁

v′ ₂＝p ₂v ₂

v′ ₃＝p ₃v ₃

v′ ₄＝p ₄v ₄

Wherein p is the transmitting power factor.

2. method according to claim 1, is characterized in that, step (3) comprises following sub-step:

(3-1) counter k=1 is set;

(3-2) premultiplication Household matrix L is constructed ^(k), use this matrix to A ^{(p, k)}carry out premultiplication, to obtain matrix A ^{(p, k+1/2)}=L ^(k)a ^{(p, k)};

(3-3) judged whether that k+1=4 sets up, if it is matrix A ^{(p, 1)}become upper Hessenberg matrix J ⁽¹⁾, process terminates, otherwise enters step (3-4);

(3-4) construct the right side and take advantage of Household matrix R ^(k), use the right side to take advantage of Household matrix R ^(k)to A ^{(p, k+1/2)}carry out the right side to take advantage of, to obtain matrix A ^{(p, k+1)}=A ^{(p, k+1/2)}r ^(k);

(3-5) k=k+1 is set, and returns step (3-2).

3. method according to claim 2, is characterized in that, constructs premultiplication Household matrix in the following ways:

(3-2-1) first zoom factor K is calculated _x, order represent and be transformed matrix A ^{(p, k)}in i-th row jth row element:

(3-2-2) column vector { xtemp} is constructed ^k:

(3-2-3) by { xtemp} ^kbe converted into unit vector { x} ^(k):

(3-2-4) according to { x} ^(k)structure premultiplication Household matrix L ^(k):

L ^(k)=I-2{x} ^(k){ x} ^{(k) *}, wherein I is the unit matrix of 4*4.

4. method according to claim 3, is characterized in that, Household matrix is taken advantage of in the following ways in the structure right side:

(3-4-1) first zoom factor K is calculated _y, order represent and be transformed matrix A ^{(p, k+1/2)}in row k i-th arrange element

(3-4-2) column vector { ytemp} is constructed ^k:

(3-4-3) by { ytemp} ^kturn to unit vector { y} ^(k):

(3-4-4) according to { y} ^(k)structure R ^(k)

R ^(k)=I-2{y} ^(k){ y} ^{(k) *}, wherein I is the unit matrix of 4*4.

5. method according to claim 4, is characterized in that, step (4) comprises following sub-step:

(4-1) counter m=1 is set;

(4-2) dextrorotation Givens matrix Q is constructed ^(m), to J ^(m)carry out the right side to take advantage of, to obtain J ^(m+1/2).That is: J ^(m+1/2)=J ^(m)q ^(m);

(4-3) left-handed Givens matrix P is constructed ^(m), to J ^(m+1/2)carry out premultiplication, obtain J ^(m+1).That is: J ^(m+1)=P ^(m)j ^(m+1/2);

(4-4) counter m=m+1 is set;

(4-5) judge whether m=4, if process terminates, otherwise return step (4-2).

6. method according to claim 5, is characterized in that, Givens matrix is taken advantage of in the following ways in the structure right side:

(4-2-1) initial vector is set wherein for J ^(m)in the i-th row jth column element;

(4-2-2) by [f ^(m), g ^(m)] calculate Givens dextrorotation matrix Q ^(m), for Q ^(m)element on middle diagonal and l ≠ m and l ≠ m+1;

(4-2-3) Q is made ^(m)middle matrix-block

Wherein r is the mould of initial vector, R _ffor f ^(m)mould;

(4-2-4) for all the other elements, 0 is got.

7. method according to claim 6, is characterized in that, constructs premultiplication Givens matrix in the following ways:

(4-3-1) initial vector is set

wherein for J ^(m+1/2)in i-th row jth row element;

(4-3-2) by [f ^(m+1/2), g ^(m+1/2)] ^tcalculate the left-handed matrix P of Givens ^(m), for the element on diagonal and l ≠ m and l ≠ m+1;

(4-3-3) order matrix block

wherein r is the mould of initial vector, R _ffor f ^(m+1/2)mould;

(4-3-4) for all the other elements, 0 is got.

8. method according to claim 7, is characterized in that, weighted factor is tried to achieve by following formula:

Wherein σ ₁, σ ₂, σ ₃, σ ₄be respectively sub-channel matrix A ^{(p, 1)}singular value.

9. one kind realizes multi-flow beam forming in TD-LTE-Advanced, it is characterized in that, comprising:

First module, for obtaining the channel matrix A of 4 × 8 from the uplink detection reference signal of TD-LTE-Advanced base station ¹;

Second module, for by channel matrix A ¹decompose, to obtain two 4 × 4 sub-channel matrix A ^{(p, 1)}, it corresponds respectively to two sub-aerial arrays, and wherein p represents the sequence number of sub antenna array;

3rd module, for each sub-channel matrix A ^{(p, 1)}carry out Household conversion, to generate upper Hessenberg matrix J ⁽¹⁾

Four module, for upper Hessenberg matrix J ⁽¹⁾carry out Givens rotation, with by this matrix J ⁽¹⁾be transformed into diagonal matrix;

5th module, reaches at least 5 times for the computing repeating above-mentioned four module, and wherein the last matrix calculated again can as the Hessenberg matrix used in calculating next time;

6th module, the right side that the right side for the 3rd module being obtained takes advantage of Household transformation matrix and four module to obtain is taken advantage of Givens matrix to fold and is taken advantage of, to obtain the matrix V of a 4*4, namely each row of this matrix V are designated as v ₁, v ₂, v ₃, v ₄.

7th module, for utilizing high specific transmission algorithm to each row v of the matrix V of the 6th CMOS macro cell ₁, v ₂, v ₃, v ₄be weighted process, to generate final wave beam forming weight vector v ' ₁, v ' ₂, v ' ₃, v ' ₄:

v′ ₁＝p ₁v ₁

v′ ₂＝p ₂v ₂

v′ ₃＝p ₃v ₃

v′ ₄＝p ₄v ₄

Wherein p is the transmitting power factor.