CN102916786B - Multiple input multiple output pre-coding codebook generating method based on lattice basis reduction - Google Patents

Multiple input multiple output pre-coding codebook generating method based on lattice basis reduction Download PDF

Info

Publication number
CN102916786B
CN102916786B CN201210283156.6A CN201210283156A CN102916786B CN 102916786 B CN102916786 B CN 102916786B CN 201210283156 A CN201210283156 A CN 201210283156A CN 102916786 B CN102916786 B CN 102916786B
Authority
CN
China
Prior art keywords
matrix
codebook
receiving terminal
reduction
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN201210283156.6A
Other languages
Chinese (zh)
Other versions
CN102916786A (en
Inventor
赵慧
张晓然
郑斌
周小平
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201210283156.6A priority Critical patent/CN102916786B/en
Publication of CN102916786A publication Critical patent/CN102916786A/en
Application granted granted Critical
Publication of CN102916786B publication Critical patent/CN102916786B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Radio Transmission System (AREA)

Abstract

The invention discloses a multiple input multiple output pre-coding codebook generating method based on lattice basis reduction, and the method comprises the following steps of: estimating a channel through a receiving terminal to obtain a channel matrix, determining the time L of a lattice basis reduction, the characteristic parameter lambda m of a reduction matrix and the discrete domain of n according to the system performance demand or supported feedback bit number; traversing each obtained characteristic parameter value to obtain a plurality of matrixes, and calculating to select the reduction matrix Di in each reduction and obtaining the value index of the characteristic parameter of the selected Di; performing corresponding lattice basis reduction operation on the channel matrix; gradually executing the reduction until the channel matrix cannot be reduced or executing all L times of reduction; and performing continued product on all Di to obtain a codebook matrix, and forming the quantifying information of the codebook matrix through the value indexes of the characteristic parameters of the Di. The multiple input multiple output pre-coding codebook generating method disclosed by the invention is used for solving the problem that the traditional pre-coding scheme cannot enable transmission data stream to obtain full mark set gain and avoiding the complexity of a sending terminal.

Description

A kind of multiple-input, multiple-output precoding codebook generation method subtracted based on Ge Jiyue
Technical field
The present invention relates to wireless communication field, particularly relate to a kind of multiple-input, multiple-output precoding codebook generation method subtracted based on Ge Jiyue.
Background technology
Multiple-input and multiple-output (Multiple Input Multiple Output, MIMO) technology, because it can improve power system capacity exponentially, thus becomes one of key technology in future communication systems.Precoding technique is distinctive a kind of adaptive technique in multiaerial system, can select suitable pre-coding matrix according to the symbolic vector being changed to transmission of channel condition, and the speed in conjunction with each data flow of making a start controls, and effectively improves link throughput.
Consider that mimo system has N troot transmitting antenna and N rroot reception antenna, transmitting terminal transmission l (l≤min (N r, N t)) individual data flow, adopt precoding processing, then system model can be expressed as: y=HPx+n.Wherein, y = y 1 y 2 . . . y N r T It is Received signal strength vector; represent N r× N tchannel matrix; X=[x 1x 2x l] tsend signal phasor; n = n 1 n 2 . . . n N r T Be the zero-mean white Gauss noise vector on reception antenna, variance is σ 2; it is pre-coding matrix.
Based in the precoding mode of code book, pre-coding matrix P obtains at receiving terminal.Receiving terminal chooses the matrix that makes systematic function optimum according to concrete channel conditions from a matrix codebook set determined, then the index of this matrix in codebook set is fed back to transmitting terminal, as just adopted in this way in LTE system.Here for the thinking that the design of codebook set is mostly based on quantizing the unitary space.
And based in the precoding mode of non-code book, pre-coding matrix obtains at transmitting terminal.More common algorithm has based on singular value decomposition (SVD), based on ZF(ZF)/MMSE(Minimum Mean Square Error) criterion etc., this class algorithm is when transmitting terminal obtains channel condition information, suitable decomposition or process are carried out to channel information matrix, and then obtains corresponding transmitting terminal pre-coding matrix P.
Precoding based on ZF and MMSE criterion realizes simple, but can not obtain diversity gain; And the precoding of decomposing based on SVD is when transmitting multithread, often first-class diversity gain is all different, and between each stream, performance difference is large, needs the selection carrying out coded modulation scheme separately.Based on the precoding mode of code book, existing scheme is mostly be decomposed into theoretical foundation based on SVD, so effect is similar with it.
Ge Jiyue subtracts, and (LR, Lattice Reduction) effectively can improve the singularity of matrix, make each row of matrix orthogonal as much as possible and wait mould, thus reduce matrix respectively arrange between correlation.Channel matrix H can be resolved into the matrix H of a nearly orthogonal by mathematical LR implementation algorithm redbe the modular matrix T(of complex integers and determinant with a value be ± 1), as shown in Equation 1:
H=H redT (1)
H redidentical grid space can be formed with H, but H redeach row between angle closer to the mould of orthogonal and each row also close to equal, namely with H redwords channel singular as equivalent channel matrix can be improved, and each at this moment transmitted data flow can obtain identical diversity gain, and performance difference is little, can avoid the selection of the coded modulation scheme of multithread.
Ideally, if transmitting terminal knows the information of ideal communication channel, can using unimodular matrix T corresponding for matrix H as pre-coding matrix to improve the singularity of equivalent channel matrix, now equivalence system model be:
y=βHTx+n=βH redx+n (2)
Wherein, T is precoding codebook, and β is the normalization coefficient of T, to ensure transmitting power normalizing.
And when transmitting terminal does not know channel matrix H, need receiving terminal will to be carried out LR decomposition by the multi-antenna channel matrix after channel estimating, obtain matrix T, then T to be quantized and to transmitting terminal feedback quantization bit; Transmitting terminal carries out such as formula 2 based on the precoding processing of LR sending signal according to feedback quantization bit generating pre-coding matrix T.So LR is used for codebook precoding design must have simple code book generating mode efficiently.
In the algorithm that Ge Jiyue subtracts, famous LLL algorithm is subject to extensive use because it has binomial low complex degree.By successively about subtracting the singularity improving matrix with swap operation.But LLL algorithm, can not ensure that each walks the singularity about subtracting and exchange rear matrix and is all better than initial matrix, when matrix dimensionality is larger, complexity can be very high.
Therefore, the technical scheme that the multiple-input, multiple-output precoding codebook subtracted based on Ge Jiyue of a kind of improvement of current needs generates solves the problems referred to above.
Summary of the invention
Technical problem to be solved by this invention is to provide a kind of multiple-input, multiple-output precoding codebook generation method subtracted based on Ge Jiyue, solve in traditional pre-coding scheme the problem that transmitting data stream can not be made to obtain full diversity gain, the complexity simultaneously also can effectively avoiding transmitting terminal to carry out multi-stream modulation coding mode selection bringing.
In order to solve the problem, the invention provides a kind of multiple-input, multiple-output precoding codebook generation method subtracted based on Ge Jiyue, comprising:
After receiving terminal obtains channel matrix H by channel estimating, determine to carry out that Ge Jiyue subtracts about subtracts the feature parameter"λ" that number of times L peace treaty subtracts matrix according to the performance requirement of system or the number of bits of feedback of system support m, ndiscrete codomain;
After receiving terminal obtains multiple matrix by each characteristic ginseng value that traversal obtains, therefrom select about to subtract matrix D when about subtracting by calculating at every turn iand obtain selected D ithe value index of characteristic parameter; Then corresponding Ge Jiyue reducing is carried out to channel matrix H; Progressively perform and about subtract until channel matrix H can not about subtract or execute and all about be kept to for L time only; To all D icarry out continued product and obtain codebook matrix T, and use D icharacteristic parameter value index composition codebook matrix T quantitative information, complete the generation of precoding codebook.
Further, said method also can comprise:
After described receiving terminal obtains multiple matrix by each characteristic ginseng value that traversal obtains, therefrom select about to subtract matrix D when about subtracting by calculating at every turn iand obtain selected D ithe value index of characteristic parameter; Then corresponding Ge Jiyue reducing is carried out to channel matrix H, progressively perform and about subtract until channel matrix H about can not subtract again or execute whole L time about subtracts; To all D icarry out continued product and obtain codebook matrix T, and use D icharacteristic parameter value index composition codebook matrix T quantitative information, complete the step of the generation of precoding codebook, comprising:
Step a, initialization unimodular matrix T=I, l=1;
Step b, receiving terminal get unit matrix I, for each feature parameter"λ" in the set of characteristic parameter value m,nneutral element position in element traversal I on all off-diagonals about subtracts matrix D to form iafter, calculate each and about subtract Δ corresponding to matrix m, nif, all Δs m, nbe all zero, then make l=l+L; Otherwise select maximum Δ m, nwhat value was corresponding about subtracts matrix D maxas the unimodular matrix about subtracted specifically, and perform T=TD max, l=l+1, wherein Δ m, nbe the decrease of the S (H) after an iteration, S (H) is the parameter of orthogonality being used for weighing matrix in Seysen mode;
If step c, receiving terminal judge l>L, then to all D icarry out continued product and obtain codebook matrix T, and use D icharacteristic parameter value index composition T quantitative information, complete the generation of precoding codebook; Otherwise, perform step b.
Further, said method also can comprise: described receiving terminal determines the feature parameter"λ" about subtracting matrix m,ndiscrete codomain step in, the method for exhaustion, greedy algorithm and tree search method are adopted to the selection of (m, n).
Further, said method also can comprise:
Described receiving terminal, for channel matrix H, determines according to the performance requirement of system or the number of bits of feedback of system support the feature parameter"λ" about subtracting matrix m,nthe step of discrete codomain, comprising:
Described receiving terminal obtains feature parameter"λ" by following formula m,ncodomain,
λ m , n = round [ 0.5 ( a ~ n T a ~ m * | | a ~ m | | 2 - h ~ n H h ~ n | | h ~ n | | 2 ) ] , Wherein be m row, be n-th line, t mthe m row of T.
Further, said method also can comprise:
Described receiving terminal calculates Δ corresponding to each matrix m,nstep, comprising:
Described receiving terminal obtains Δ by following formula m, n,
Δ m , n = 2 | | h ~ m | | 2 | | a ~ n T | | 2 ,
Wherein, described Δ m, nbe the decrease of the S (H) after an iteration, be the parameter of orthogonality being used for weighing matrix in Seysen mode, the less representing matrix of S (H) value is more close to orthogonal; Wherein h nn-th row of representing matrix H, it is matrix n-th line.
Compared with prior art, application the present invention, carries out LR quantization algorithm by the multi-antenna channel matrix estimated receiving terminal, generates the least possible quantization bit, transmitting terminal according to feedback quantization bit to the precoding processing sending signal and carry out based on LR, to improve the performance of mimo system; The present invention utilizes matrix L R to decompose to regard as and multiplely about subtract the feature of matrix product and about subtract the characteristic distributions of matrix element, appropriate design precoding codebook, save the quantization bit of feedback, make system under unusual channel, have better robustness and transmitting terminal complexity can be reduced.
Accompanying drawing explanation
Fig. 1 is the block diagram of codebook precoding of the present invention.
Fig. 2 is the flow chart of the multiple-input, multiple-output precoding codebook generation method subtracted based on Ge Jiyue of the present invention.
Fig. 3 is that example of the present invention is at N t=N rwhen=2, Ge Jiyue subtracts the middle probability density histogram (being wherein 2 antenna configurations) about subtracting number of times.
Fig. 4 is that example of the present invention is at N t=N rwhen=2, LR precoding under different feedback bits with the performance comparison figure (being wherein 2 antenna configurations) of ZF precoding.
Fig. 5 is that example of the present invention is at N t=N rwhen=4, Ge Jiyue subtracts the middle probability density histogram (being wherein 4 antenna configurations) about subtracting number of times.
Fig. 6 is that example of the present invention is at N t=N rwhen=4, LR precoding under different feedback bits with the performance comparison figure (being wherein 4 antenna configurations) of ZF precoding.
Embodiment
Below in conjunction with the drawings and specific embodiments, the invention will be further described.
First the symbol related in the present invention and notation are described, wherein, () hthe complex-conjugate transpose of representing matrix, 1 and 0 represents all 1's matrix and null matrix respectively, || || frepresent the F norm of getting matrix, represent the maximum integer being not more than a, () ii-th row of representing matrix, e irepresentation unit vector, its i-th element is 1, and other element is 0.
The present invention improves mainly for codebook precoding mode, and the operating process of codebook precoding as shown in Figure 1.Core of the present invention is the quantization algorithm of pre-coding matrix (i.e. unimodular matrix T), by analyzing the constitutive characteristic of unimodular matrix and a large amount of emulation, quantization algorithm reasonable in design.Adopt Seysen mode to carry out Ge Jiyue in the present invention to subtract, each step of Seysen mode about subtracts rear matrix singularity and all makes moderate progress, and therefore effectively can be reduced the complexity of LR algorithm by the number of times controlling about to subtract.
Be N for dimension r× N tchannel matrix H, seysen mode passes through parameter weigh the orthogonality of matrix.Wherein h nn-th row of representing matrix H, it is matrix h hn-th line.For any H, there is S (H)>=N t, when and if only if H is unitary matrix, equal sign is set up.The less representing matrix of S (H) value is more close to orthogonal.The principle of Seysen mode is exactly adopt the mode of iteration to obtain base to H continuous renewal based on S (H) parameter until can not little again till.Its idiographic flow is as follows.
In Seysen mode, first initialization: in each iteration, need to find a pair sequence number (m, n) (1≤m, n≤N tand m ≠ n) and a Gaussian integer λ m, n(namely real part and imaginary part are all the plural numbers of integer) upgrades and T:
h ~ m ← h ~ m + λ m , n h ~ n , a ~ n T ← a ~ n T - λ m , n a ~ m T , t m ← t m + λ m , n t n - - - ( 3 )
Wherein be m row, be n-th line, t mthe m row of T.Through type λ m , n = round [ 0.5 ( a ~ n T a ~ m * | | a ~ m | | 2 - h ~ n H h ~ n | | h ~ n | | 2 ) ] (4) λ can be obtained m, n:
λ m , n = round [ 0.5 ( a ~ n T a ~ m * | | a ~ m | | 2 - h ~ n H h ~ n | | h ~ n | | 2 ) ] - - - ( 4 )
S (H) decrease after an iteration is:
Δ m , n = 2 | | h ~ m | | 2 | | a ~ n T | | 2 - - - ( 5 )
Wherein the parameter of orthogonality being used for weighing matrix in Seysen mode, the less representing matrix of S (H) value more close to orthogonal, parameter it is all the parameter before renewal.Seysen mode constantly performs formula (3) and (4) upgrade matrix until matrix Δ m, nin all elements be all zero.Seysen mode can adopt the methods such as the method for exhaustion, greedy algorithm and tree search to the selection of (m, n).
Main feature of the present invention is: by Seysen mode, is quantized by the unimodular matrix T of channel matrix after Ge Jiyue subtracts.Seysen mode is progressively about subtracted by channel matrix, until about subtracted, about reducing can represent T=D with matrix product at every turn 1d 2d l, L represents and about subtracts number of times.Utilize this feature of Seysen mode, can by restriction Ge Jiyue subtract in the number of times L(that about subtracts namely about subtract matrix D inumber) save quantization bit.Again to about subtracting matrix D irationally quantize, quantization bit is fed back to transmitting terminal, carry out pre-encode operation.
Seysen mode is about subtracting in iteration at every turn, needs a Gaussian integer λ m,nupgrade matrix, therefore matrix T comprises λ by a series of m,nthe product about subtracting matrix to form, namely often occur once about to subtract and be just multiplied by one and about subtract matrix, λ m,nvalue uniquely to determine each characteristic parameter about subtracting matrix, and this about subtracts matrix and is:
Feature parameter"λ" m, nbe positioned at matrix D ithe capable and n-th line of m.About subtract matrix and insert feature parameter"λ" by the element position on the off-diagonal of a unit matrix m, nobtain, it is also a unimodular matrix, so T=D 1d 2d l.D i(1≤i≤L) represents by similar and different feature parameter"λ" m,nwhat form about subtracts matrix.Based on the formation feature of above unimodular matrix, can be had an appointment by the institute of transmission formation T and subtract matrix D ireplace transmission matrix T.About subtract the characteristic ginseng value that matrix only needs position on coded quantization off-diagonal, and T matrix needs all elements value on all positions of coded quantization matrix.Such as
T = 1 0 - 1 j 0 1 - 1 0 - 1 0 2 - j 0 0 0 1 = 1 1 - 1 1 1 1 j 1 1 1 1 1 - 1 1 1 1 - 1 1 1 1 - - - ( 7 )
The precoding codebook (see formula 7) of mimo system is received: T=D for one 44 1d 2d 3d 4.As can be seen from formula 7, the element span of matrix T is that { 1 ,-1,2, j ,-j}, codomain is 5, therefore hypothesis matrix T and matrix D ithe codomain of element span be 5.Now carry out quantification to unimodular matrix T and have two kinds of modes, a kind of is 16 elements of direct quantization matrix T, and the quantization bit at this moment needed is: individual bit; Another kind is that quantification 4 about subtracts matrix D iin the characteristic ginseng value of 12 elements except diagonal, the quantization bit at this moment needed is: individual bit.Therefore quantize than quantizing simpler to T direct coding about subtracting matrix coder.The present invention just adopts the coding method quantizing about to subtract matrix to design precoding codebook.
As the above analysis, the bit number required for unimodular matrix T quantification is:
B = L × log 2 ( N t ( N t - 1 ) × C ) - - - ( 8 )
L about subtracts matrix D inumber (namely about subtracting number of times), C is feature parameter"λ" m,nthe codomain size of value, N tit is number of transmit antennas.After receiving terminal quantizes unimodular matrix, quantization bit is fed back to transmitting terminal (namely receiving terminal carries out Ge Jiyue and subtracts, and after obtaining pre-coding matrix, re-quantization feeds back to transmitting terminal), transmitting terminal carries out pre-encode operation.Obviously, the quantization bit of unimodular matrix T is more, and close to real Ge Jiyue subtractive energy, but the number of bits of feedback can supported when system is prescribed a time limit, and just needs rationally to quantize code book.As can be seen from formula 8, about can be subtracted the codomain size C of number of times L and characteristic parameter by restriction, effectively save feedback bits.
In practice, matlab software can be used to carry out subtracting based on the Ge Jiyue of Seysen mode, then to about subtracting the feature parameter"λ" produced in process to a large amount of random channel matrix produced m,nvalue is added up, and statistics is in table 1 and table 2.As can be seen from these two tables, λ m, nbe worth stepped distribution, the λ that modulus value is equal m,nprobability density is close, a formation ladder, and the λ that modulus value is less m,nprobability density is larger.Under 2 antenna configurations, the cumulative frequency of first ladder is the cumulative frequency of 0.6048, first ladder and second ladder is 0.8304.Under 4 antenna configurations, the cumulative frequency of first ladder is the cumulative frequency of 0.9352, first ladder and second ladder is 0.9991.Therefore the characteristic ginseng value integrated distribution produced in iteration each time in Seysen mode is in a very little scope.For this feature, the unimodular matrix that transmission restriction about subtracts matrix number and characteristic parameter span just can obtain good Ge Jiyue subtractive energy.
As shown in Figure 2, the multiple-input, multiple-output precoding codebook generation method subtracted based on Ge Jiyue of the present invention, comprising:
After step 210, receiving terminal obtain channel matrix H by channel estimating, determine to carry out about subtracting number of times L and uniquely can determine each discrete codomain about subtracting the characteristic parameter of matrix required for Ge Jiyue reducing according to the performance requirement of system or the number of bits of feedback of system support
Particularly, determine according to the performance requirement of system or the number of bits of feedback of system support, from adding up the feature parameter"λ" obtained m,nvalue peace treaty subtracts (see table 1, table 2, Fig. 3, Fig. 5) in number of times, determines that size is the feature parameter"λ" of C m,nnamely the number L(that value set E peace treaty subtracts matrix D performs the number of times about subtracted), wherein m, n and L are natural number, 1≤m, n≤N tand m ≠ n; .
Step 220, receiving terminal are undertaken after traversal obtains multiple matrix by each characteristic ginseng value chosen, and therefrom select about to subtract matrix D when about subtracting by calculating at every turn iand obtain selected D ithe value index of characteristic parameter; Then corresponding Ge Jiyue reducing is carried out to channel matrix, progressively perform and about subtract until meet exit criteria;
Wherein exit criteria is: matrix about can not subtract again or execute whole L time and about subtract.
Particularly, comprising: step 2201, first, initialization unimodular matrix T=I, l=1;
Step 2202, get unit matrix I, for each λ in characteristic parameter value set E m,nneutral element position in element traversal I on all off-diagonals about subtracts matrix D to form i, then calculate the Δ that each matrix is corresponding m, nif, all Δs m, nbe all zero, then make l=l+L; Otherwise select maximum Δ m, nwhat value was corresponding about subtracts matrix D maxas the unimodular matrix about subtracted specifically, and perform T=TD max, l=l+1;
If step 2202 l>L, perform step 230; Otherwise perform step 2202.
Step 230, to all D icarry out continued product and obtain codebook matrix T, and use D icharacteristic parameter value index composition T quantitative information, complete the generation of precoding codebook.
Particularly, the quantitative information of codebook matrix T is fed back to transmitting terminal by receiving terminal, and transmitting terminal, according to quantitative information generating pre-coding matrix, carries out pre-encode operation.
Below by l-G simulation test, the present invention will be described.
First for 2 antenna configurations, table 1 about subtracts feature parameter"λ" in matrix m,nvalue distribution situation.In order to contrast the performance under different characteristic parameter codomain, setting two kinds of codomains and emulating: E={i ,-i, 1 ,-1}, E={i ,-i, 1 ,-1 ,-1-i, 1-i, 1+i ,-1+i}, codomain size is respectively C=4 and C=8.As can be seen from the figure, about subtract the maximum probability (0.6) that number of times is 1, about subtract the probability next (0.22) that number of times is 2, therefore set two kinds and about subtract matrix number: L=1 and L=2.In this several situation, the bit number that quantizing unimodular matrix T needs is respectively: C=4, L=1, B 1=log 2 (2 × 4)=3 bits; C=8, L=1, B 2=log 2 (2 × 8)=4 bits; C=4, L=2, B 3=2 × log 2 (2 × 4)=6 bits; C=8, L=2, B 4=2 × log 2 (2 × 8)=8 bits.
Under table 1:2 antenna configuration, Ge Jiyue subtracts the feature parameter"λ" of middle unimodular matrix m, nvalue frequency statistics table
Table 1 is that example of the present invention is at N t=N rwhen=2, Ge Jiyue subtracts the feature parameter"λ" of middle unimodular matrix m,nthe probability density (PDF) of value and the statistical form of accumulated probability density (CDF).
Figure is the performance comparison figure of above-mentioned four kinds of LR precodings and ZF precoding under 2 antenna configurations.As can be seen from the figure, obvious quantization bit is more, and the performance of LR precoding is better.When about subtracting matrix number L and being identical, the performance of C=4 and C=8 is more or less the same, and therefore selects the characteristic parameter codomain E={i of C=4 ,-i, and 1 ,-1} to save feedback bits.C=4 is 10 in the error rate -3time, about subtract the performance boost of the Performance Ratio L=2 of matrix number L=1 about 2dB, feedback bits adds 3 bits simultaneously.2dB performance gain is very considerable, therefore should consider that the feedback bits of increase by 3 bit is to obtain the performance gain of 2dB, namely selects about to subtract matrix number L=2.
At N t=N runder the antenna configuration of=4, feature parameter"λ" m,nvalue reaches 0.9352 in the cumulative probability density of first ladder, and major part is all distributed in (see table 2) in the first ladder.Again because find in the result of 2 antenna configurations, characteristic parameter codomain size is that the performance of C=8 and C=4 is more or less the same, and therefore under 4 antenna configurations, the codomain only setting a kind of characteristic parameter emulates: E={i, i, 1 ,-1}, C=4.As can be seen from the figure, about subtract the maximum probability (0.18) that number of times is 5, about subtract the probability next (0.16) that number of times is 4, therefore setting the number about subtracting matrix is L=4 and L=5.Under both of these case, the quantification of unimodular matrix T needs B respectively 1=4 × log 2 (12 × 4)=23 bits and B 2=5 × log 2 (12 × 4)=28 bits.
Under table 2:4 antenna configuration, Ge Jiyue subtracts the feature parameter"λ" of middle unimodular matrix m,nvalue frequency statistics table
Table 2 is that example of the present invention is at N t=N rwhen=4, Ge Jiyue subtracts the feature parameter"λ" of middle unimodular matrix m, nthe probability density (PDF) of value and the statistical form of accumulated probability density (CDF).
Figure is the performance comparison figure of two kinds of LR precodings and ZF precoding.As seen from the figure, the performance about subtracting the Performance Ratio L=4 of matrix number L=5 slightly well, is 10 in the error rate -3time performance boost be about 1dB, but feedback bits adds 5 bits.Therefore, for saving feedback bits, can select about to subtract matrix number L=4.For different systems, available above-mentioned quantization method designs best L value and C value, quantizes unimodular matrix.
The above; be only the present invention's preferably embodiment, but protection scope of the present invention is not limited thereto, any people being familiar with this technology is in the technical scope disclosed by the present invention; the change that can expect easily or replacement, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.

Claims (3)

1. the multiple-input, multiple-output precoding codebook generation method subtracted based on Ge Jiyue, is characterized in that, comprising:
After receiving terminal obtains channel matrix H by channel estimating, according to the number of bits of feedback that the performance requirement of system or system are supported, determine to carry out that Ge Jiyue subtracts about subtracts the feature parameter"λ" that number of times L peace treaty subtracts matrix m,ndiscrete codomain;
After receiving terminal obtains multiple matrix by each characteristic ginseng value that traversal obtains, therefrom select about to subtract matrix D when about subtracting by calculating at every turn iand obtain selected D ithe value index of characteristic parameter; Then corresponding Ge Jiyue reducing is carried out to channel matrix H; Progressively perform and about subtract until channel matrix H can not about subtract or execute and all about be kept to for L time only; To all D icarry out continued product and obtain codebook matrix T, and use D icharacteristic parameter value index composition codebook matrix T quantitative information, complete the generation of precoding codebook, wherein,
Step a, initialization unimodular matrix T=I, l=1;
Step b, receiving terminal get unit matrix I, for each feature parameter"λ" in the set of characteristic parameter value m,nneutral element position in element traversal I on all off-diagonals about subtracts matrix D to form iafter, calculate each and about subtract △ corresponding to matrix m,nif, all △ m,nbe all zero, then make l=l+L; Otherwise select maximum △ m,nwhat value was corresponding about subtracts matrix D maxas the unimodular matrix about subtracted specifically, and perform T=TD max, H ~ = H ~ D max , L=l+1, wherein Δ m , n = 2 | | h ~ m | | 2 | | a ~ n T | | 2 Be the decrease of the S (H) after an iteration, it is the parameter of orthogonality being used for weighing matrix in Seysen mode; Wherein, the less representing matrix of S (H) value more close to orthogonal, h nn-th row of representing matrix H, it is matrix n-th line, be m row, be n-th line, N tfor total columns of matrix H;
If step c, receiving terminal judge l>L, then to all D icarry out continued product and obtain codebook matrix T, and use D icharacteristic parameter value index composition T quantitative information, complete the generation of precoding codebook; Otherwise, perform step b.
2. the method for claim 1, is characterized in that,
Comprise further: described receiving terminal determines about to subtract the feature parameter"λ" of matrix m,ndiscrete codomain step in, the method for exhaustion, greedy algorithm or tree search method are adopted to the selection of (m, n).
3. the method for claim 1, is characterized in that,
Described receiving terminal, for channel matrix H, determines according to the performance requirement of system or the number of bits of feedback of system support the feature parameter"λ" about subtracting matrix m,nthe step of discrete codomain, comprising:
Described receiving terminal obtains feature parameter"λ" by following formula m,ncodomain,
λ m , n = round [ 0.5 ( a ~ n T a ~ m * | | a ~ m | | 2 - h ~ n H h ~ m | | h ~ n | | 2 ) ] , Wherein be m row, be n-th line.
CN201210283156.6A 2012-08-09 2012-08-09 Multiple input multiple output pre-coding codebook generating method based on lattice basis reduction Expired - Fee Related CN102916786B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210283156.6A CN102916786B (en) 2012-08-09 2012-08-09 Multiple input multiple output pre-coding codebook generating method based on lattice basis reduction

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210283156.6A CN102916786B (en) 2012-08-09 2012-08-09 Multiple input multiple output pre-coding codebook generating method based on lattice basis reduction

Publications (2)

Publication Number Publication Date
CN102916786A CN102916786A (en) 2013-02-06
CN102916786B true CN102916786B (en) 2015-05-27

Family

ID=47615031

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210283156.6A Expired - Fee Related CN102916786B (en) 2012-08-09 2012-08-09 Multiple input multiple output pre-coding codebook generating method based on lattice basis reduction

Country Status (1)

Country Link
CN (1) CN102916786B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109450601B (en) * 2018-12-05 2021-08-17 中国联合网络通信集团有限公司 Signal detection method and device
CN113098603A (en) * 2021-02-26 2021-07-09 桂林电子科技大学 Imaging light MIMO pre-coding and decoding method based on lattice reduction

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101034928A (en) * 2006-03-06 2007-09-12 西门子(中国)有限公司 Signal receiving method and device for the MIMO radio communication system
CN102142947A (en) * 2011-03-23 2011-08-03 北京邮电大学 Lattice reduction based retransmission merging method for MIMO (Multiple Input Multiple Output) system
EP2469730A1 (en) * 2010-12-21 2012-06-27 ST-Ericsson SA Precoding Matrix Index selection process for a MIMO receiver based on a near-ML detection, and apparatus for doing the same
CN102577288A (en) * 2009-11-16 2012-07-11 富士通株式会社 MIMO wireless communication systems

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120183088A1 (en) * 2011-01-14 2012-07-19 Industrial Technology Research Institute Lattice reduction architecture and method and detection system thereof

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101034928A (en) * 2006-03-06 2007-09-12 西门子(中国)有限公司 Signal receiving method and device for the MIMO radio communication system
CN102577288A (en) * 2009-11-16 2012-07-11 富士通株式会社 MIMO wireless communication systems
EP2469730A1 (en) * 2010-12-21 2012-06-27 ST-Ericsson SA Precoding Matrix Index selection process for a MIMO receiver based on a near-ML detection, and apparatus for doing the same
CN102142947A (en) * 2011-03-23 2011-08-03 北京邮电大学 Lattice reduction based retransmission merging method for MIMO (Multiple Input Multiple Output) system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种针对减格矢量预编码的可调量化误差校正方法;耿烜;《上海交通大学学报》;20090731;第43卷(第7期);全文 *
基于格基约减的多天线预编码处理机制;赵慧;《北京邮电大学学报》;20111031;第34卷(第5期);全文 *

Also Published As

Publication number Publication date
CN102916786A (en) 2013-02-06

Similar Documents

Publication Publication Date Title
CN111181619B (en) Millimeter wave hybrid beam forming design method based on deep reinforcement learning
CN109302224B (en) Hybrid beamforming algorithm for massive MIMO
Moustakas et al. MIMO capacity through correlated channels in the presence of correlated interferers and noise: A (not so) large N analysis
CN101635612B (en) Precoding code book constructing method and precoding code book constructing device of multi-input multi-output system
CN101873202B (en) Radio communication apparatus and method
RU2475982C1 (en) Method and system of preliminary coding and method to build code book of preliminary coding
CN108933745A (en) A kind of broad-band channel estimation method estimated based on super-resolution angle and time delay
CN104779985B (en) A kind of iteration beam-forming method based on channel space sparse characteristic
CN107135024A (en) A kind of mixed-beam figuration Iterative Design method of low complex degree
CN109714091B (en) Iterative hybrid precoding method based on hierarchical design in millimeter wave MIMO system
CN107332598A (en) A kind of precoding of mimo system joint and antenna selecting method based on deep learning
CN107332596B (en) Zero forcing-based millimeter wave communication system hybrid precoding method
CN108023620A (en) Extensive mimo system mixing method for precoding applied to millimeter wave frequency band
CN105846879A (en) Iterative beam forming method of millimeter wave precoding system
CN110138427B (en) Large-scale multi-input multi-output hybrid beam forming algorithm based on partial connection
CN108494455A (en) Using the mixing Precoding Design method of single-bit analog-digital converter mimo system
CN110138425B (en) Low-complexity array antenna multi-input multi-output system hybrid precoding algorithm
CN111835406A (en) Robust precoding method suitable for energy efficiency and spectral efficiency balance of multi-beam satellite communication
CN107809275B (en) Finite feedback hybrid precoding method based on millimeter wave MIMO system
CN107566305A (en) A kind of millimeter-wave systems channel estimation methods of low complex degree
CN101207464B (en) Generalized grasman code book feedback method
CN102420646B (en) Linear pre-coding method in descending multi-user mimo system and device
CN113193893A (en) Millimeter wave large-scale MIMO intelligent hybrid beam forming design method
CN101924585B (en) Construction and channel feedback method of two-stage codebook
CN105721029A (en) Multi-user scheduling method based on double-codebook limited feedback in 3D MU-MIMO FDD system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20150527

Termination date: 20210809

CF01 Termination of patent right due to non-payment of annual fee