CN102315913B - Method for processing multiple-user multiple input multiple output (MU-MIMO) system and base station - Google Patents

Method for processing multiple-user multiple input multiple output (MU-MIMO) system and base station Download PDF

Info

Publication number
CN102315913B
CN102315913B CN201010220730.4A CN201010220730A CN102315913B CN 102315913 B CN102315913 B CN 102315913B CN 201010220730 A CN201010220730 A CN 201010220730A CN 102315913 B CN102315913 B CN 102315913B
Authority
CN
China
Prior art keywords
user
groups
correlation
users
treat
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
CN201010220730.4A
Other languages
Chinese (zh)
Other versions
CN102315913A (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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN201010220730.4A priority Critical patent/CN102315913B/en
Priority to PCT/CN2010/079725 priority patent/WO2012000289A1/en
Publication of CN102315913A publication Critical patent/CN102315913A/en
Application granted granted Critical
Publication of CN102315913B publication Critical patent/CN102315913B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0417—Feedback systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/121—Wireless traffic scheduling for groups of terminals or users
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0619—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal using feedback from receiving side
    • H04B7/0636—Feedback format
    • H04B7/0639—Using selective indices, e.g. of a codebook, e.g. pre-distortion matrix index [PMI] or for beam selection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03891—Spatial equalizers
    • H04L25/03898—Spatial equalizers codebook-based design
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H04L5/001—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT the frequencies being arranged in component carriers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0014—Three-dimensional division
    • H04L5/0023—Time-frequency-space
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H04L5/0064—Rate requirement of the data, e.g. scalable bandwidth, data priority

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Radio Transmission System (AREA)

Abstract

The invention discloses a method for processing a multiple-user multiple input multiple output (MU-MIMO) system and a base station. The method comprises the following steps that: 202, the base station calculates the correlation of all code words with the same rank in a codebook which is locally stored; 204, determining a main scheduling user from a set of users to be grouped, and adding the main scheduling user into a grouped user set; 206, according a code word index which is fed back by the main scheduling user and the pre-calculated correlation, determining a first set from the set of users to be grouped, and updating the set of users to be grouped by using the first set, wherein the correlation of the first set and the main scheduling users meets a size relation of a predetermined threshold value; and repeatedly performing the steps 204 and 206 until the quantity of users in the grouped user set is equal to a grouped user quantity threshold value, or the set of users to be grouped is a null set. By the invention, the users can be quickly and efficiently grouped.

Description

The processing method of MU-MIMO system and base station
Technical field
The present invention relates to the communications field, in particular to processing method and the base station of a kind of MU-MIMO (Multiple-User Multiple Input Multiple Output, multi-user's multiple-input and multiple-output) system.
Background technology
MIMO (Multiple Input Multiple Output, multiple-input and multiple-output) technology is the important breakthrough of intelligent antenna technology in wireless mobile communications field.This technology can improve exponentially capacity and the availability of frequency spectrum of communication system in the situation that not increasing bandwidth, can utilize multipath to alleviate multipath fading, and can effectively eliminate common road and disturb, improve the reliability of channel, reducing the error rate, is a kind of key technology that the third generation mobile communication system adopts.
At present ripe or connect in maturescent 3G/B3G wireless communication system, base station side and end side are by the many groups of configuration transmit/receive antenna, and in conjunction with MIMO signal processing scheme, this method is called as Single User MIMO (SU-MIMO), and its essence is still point-to-point transmission data between base station (BS) and terminal (MS).And the wireless communication protocol standards of a new generation is all supported multiuser MIMO (MU-MIMO).Fig. 1 shows according to the structural representation of the MU-MIMO system of correlation technique.As shown in Figure 1, compare with descending SU-MIMO, descending MU-MIMO is a BS (Base Station, base station) with a MS (Mobile Station, travelling carriage, also claim user terminal) between point-to-point channel expansion be the channel of the point-to-multipoint between a BS and a plurality of MS, the difference of space characteristics in the base station side aerial array causing by the user by disperseing on space, base station can be in identical frequency channels communicate with a plurality of user terminals simultaneously.
For MU-MIMO, owing to carrying out preliminary treatment to eliminate the interference between user at transmitting terminal, so base station needs its corresponding channel coefficients of each terminal feedback.The next generation with OFDM (Orthogonal Frequency Division Multiplexing, OFDM)/OFDMA (Orthogonal Frequency Division MultipleAccess, OFDM) technology is that basic wireless communication system is (such as IEEE802.16m, LTE (Long Term Evolution, long evolving system), LTE-A (Long Term Evolution Advance, advanced long-term evolution system) etc.), the channel coefficient matrix H of user terminal adopts the form of code book C quantize and feed back, be that base station and each user terminal are all preserved identical a set of code book C, each user terminal is first by the channel coefficient matrix of down-run survey (centre) pilot measurement oneself, then according to specific criterion in codebook set C, select can optimum quantization channel coefficients code word V, index I (the Precoding Matrix Indicator of this code word V in code book C the most at last, pre-coding matrix index) feed back to base station.Code word V that index I corresponding, after receiving the codewords indexes I of user terminal feedback, found in the codebook set C preserving at oneself in base station.Like this, by above process, base station can obtain the channel coefficient matrix information of each user terminal.
In MU-MIMO, how utilizing the channel information of user terminal to carry out user fast and is reasonably one of MU-MIMO performance key technology that can be not fully exerted in groups.At present, conventionally adopt the method for traversal to determine user in groups, successively by each in groups user add in user's set in groups.But, when system allows more than 3 user in groups, if now adopt the method for traversal, due to each, determine that one in groups with needing per family to travel through every other user, judge its whether can with user's set in groups in each user's pairing, so just need a large amount of computational process, thereby increased the complexity of system.
In addition, another key technology in MU-MIMO is the calculating of user's pre-coding matrix in groups.At present, for linear predictive coding, general ZF (ZF) or the piece diagonal angle algorithm (BD) of adopting, such algorithm all relates to direct inversion operation or SVD (the Singular Value Decomposition of large matrix, singular value) decompose, and these two kinds of operation methods are all very complicated, so the practical degree in system is poor.
In correlation technique owing to adopting the method for traversal, when system allows more than three user in groups, computational process that just need to be a large amount of, thereby increased the complexity of system.The present embodiment is due to the correlation precomputing between all code words that in code book, order is identical, when carrying out in groups, can directly utilize the parameter of these correlations to find fast the user's set satisfying condition, and from this user set, determine the user of pairing, thereby when system allows more than three user in groups, can realize fast and efficiently user in groups.
In the down link of wireless communication system, dispose N tthe base station of individual descending transmitting antenna adopts following step to complete MU-MIMO user in groups:
Step 1, for n=1,2 ... r h, coefficient correlation or the distance between all code words that rank in code book C (order) is n calculated respectively in base station, and result is kept to form T nin, form T wherein nline index be codewords indexes i=1,2 ... N n, column index is codewords indexes j=1,2 ... N n, form T nin the element representation of the capable and j row intersection of i: in all code words that are n at rank, the coefficient correlation between the code word that the code word that index is i and index are j or distance
Wherein, r hby system, preset; Code book C is the vector sum set of matrices that system is preserved in advance, for quantized channel coefficient; Rank is the number that n represents the column vector that the code word in code book C comprises.
Step 2, base station is by the r calculating in step 1 hindividual form T n, n=1,2 ... r h, be kept in local memory;
The step S202 that above-mentioned steps 1 and step 2 are corresponding above-mentioned.With the form of form, preserve the coefficient correlation between all code words that the order that calculates is identical, like this, easily search and search fast.
Step 3, determines user's set in groups, as shown in Figure 3, comprises the steps:
Step S302, user's set omega={ U is in groups treated in base station initialization 1, U 2..., U mcarry out MU-MIMO user in groups, and initialization MU-MIMO user's set in groups
Step S304, determines that according to dispatching priority master scheduling user in Ω (for example, selecting to have the user of the highest dispatching priority as master scheduling user) is for example U 1, the rank of the code word of its feedback is n, codewords indexes is I 1by Ω mUbe updated to Ω mU={ Ω mU, U 1;
Step S306, judgement set omega mUwhether middle number of users equals the predefined MU-MIMO of system number of users threshold value N in groups mUif, equate, proceed to step S316, if not, proceed to step S308;
Step S308, when the correlation of calculating in step 1 is coefficient correlation, at form T nin I 1row or I 1in row, search numerical value and be less than the predefined correlation coefficient threshold TH of system relement, all these elements are at form T nthe column index of middle correspondence or line index form set (being called the second set); Or, the correlation of calculating in step 1 be apart from time, at form T nin I 1row or I 1in row, search numerical value and be greater than the predefined distance threshold TH of system delement, all these elements are at form T nthe column index of middle correspondence or line index form set (being called the second set);
Step S310, judgement set whether be empty set, empty if, enter step S316, otherwise at set omega={ U 1, U 2..., U min find the user meet following condition and form set omega 1(being called the first set): user's correspondence code word indexing belongs to set
I 1 = { I 1 1 , I 2 1 , . . . , I N 1 1 } ;
Step S312, is updated to Ω by set omega 1: Ω ← Ω 1;
Step S314, judges whether set omega is empty set, empty if, enters step S316, otherwise returns to step S304;
Step S316, MU-MIMO user is EO in groups.
Step S204 corresponding to above-mentioned steps 3 is to step S208.User in groups time, only need directly from corresponding form, to find with master scheduling user's coefficient correlation and be less than the codewords indexes of predetermined correlation coefficient threshold or directly from corresponding form, find the codewords indexes that is greater than predetermined distance threshold with master scheduling user's code word distance, thereby the codewords indexes that can find feedback in treating the set of user is in groups user's set (being the first above-mentioned set) of the codewords indexes that finds, with this user, gather to upgrade and treat user's set in groups, again in treating in groups user's set, determine that master scheduling user add is in user's set in groups, pass through step S304 to the process of step S314, (be for example finally met condition, number of users reaches predetermined threshold value in groups) user's group.Like this, only need the once calculating of step S202, follow-up need are simply searched and relatively get final product completing user in groups, can reduce significantly amount of calculation, thereby reduce the complexity of system.
The embodiment 1 to embodiment 3 of take is below example, specifically describes above-mentioned MU-MIMO user flow process in groups.
In correlation technique due to when calculating the MU-MIMO pre-coding matrix of user's group, that code word corresponding to the codewords indexes of all user feedbacks in user's group is placed in a matrix and carries out computing, because the dimension of computational complexity and matrix is exponent function relation, therefore during the number of users more (having more than three users) in user's group, computation complexity is very high, and the practicality in system is poor.Pre-coding matrix P=[W in the present embodiment 1w 2w n] the computational process of P can be divided into and calculate W 1, W 2..., W nn step carry out (substep computing), while calculating, the dimension of matrix can be very not large at every turn, computation complexity is lower; And, calculate W ithe result W once calculating before need to using i-1, like this, at hardware, realize time ratio and be easier to realize.
As shown in Figure 4, the process of the pre-coding matrix of calculating MU-MIMO user group comprises the following steps:
Step S402 is to step S408, the set omega of user in groups of determining by above-mentioned steps mUin have N user, and the code word corresponding to codewords indexes of the last feedback of this N user is respectively V 1, V 2..., V n, user U i=, i=1 ..., the pre-coding matrix that N is corresponding, base station is used following computational methods to obtain pre-coding matrix corresponding to user:
W i=orth ((I-W (W hw) -1w h) V i), wherein i represents N t* N tthe unit matrix of dimension, orth (.) represents the variable of input to carry out orthonormalization operation, even if each column vector mould value that input variable comprises is 1, and quadrature each other.
Step S410, the corresponding pre-coding matrix of each user that utilizes step S402 to calculate to step S408 forms final pre-coding matrix and is: P=[W 1w 2w n], then PS is mapped to respectively to N ton transmitting antenna, wherein s i, i=1 ..., N represents to belong to user U idata flow.
Summary of the invention
Main purpose of the present invention is to provide a kind of processing method and base station of MU-MIMO system, above-mentioned when system allows more than 3 user in groups at least to solve, and adopts a large amount of computational process of method needs of traversal, has increased the problem of the complexity of system.
According to an aspect of the present invention, provide a kind of processing method of multi-user's multiple-input and multiple-output MU-MIMO system, having comprised: step S202, the correlation between all code words that in the local code book of preserving, order is identical is calculated in base station; Step S204, from treating to determine master scheduling user user's set in groups, and arrives user's set in groups by master scheduling user add; Step S206, according to the codewords indexes of master scheduling user feedback and precalculated correlation, from treat the set of user in groups, determine with master scheduling user between correlation meet the first set with the magnitude relationship of predetermined threshold, and upgrade and treat that user gathers in groups with the first set; Repeating step S204 and step S206, until the number of users in user set reaches in groups number of users threshold value or treats that user's set is empty set in groups in groups.
According to a further aspect in the invention, provide a kind of base station, having comprised: correlation calculations module, for calculating the correlation between all code words that local code book order of preserving is identical; Determine and add module, for determining master scheduling user from treating that user gathers in groups, and master scheduling user add is arrived to user's set in groups; Update module, be used for according to the codewords indexes of master scheduling user feedback and precalculated correlation, from treat the set of user in groups, determine with master scheduling user between correlation meet the first set with the magnitude relationship of predetermined threshold, and upgrade and treat that user gathers in groups with the first set; Control module, determine to add module and update module repeats operation separately for controlling, until the number of users in user's set reaches in groups number of users threshold value or treats that user's set is empty set in groups in groups.
By the present invention, due to the correlation precomputing between all code words that in code book, order is identical, when carrying out in groups, can directly utilize the parameter of these correlations to find fast the user's set satisfying condition, and from this user set, determine the user of pairing, thereby when system allows more than three user in groups, can realize fast and efficiently user in groups.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, forms the application's a part, and schematic description and description of the present invention is used for explaining the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings:
Fig. 1 is according to the structural representation of the MU-MIMO system of correlation technique;
Fig. 2 is according to the flow chart of the processing method of the MU-MIMO system of the embodiment of the present invention;
Fig. 3 is MU-MIMO user's operational flowchart in groups according to the preferred embodiment of the invention;
Fig. 4 is the calculation flow chart of the pre-coding matrix that MU-MIMO user organizes according to the preferred embodiment of the invention;
Fig. 5 is according to the schematic diagram of the base station of the embodiment of the present invention.
Embodiment
Hereinafter with reference to accompanying drawing, also describe the present invention in detail in conjunction with the embodiments.It should be noted that, in the situation that not conflicting, embodiment and the feature in embodiment in the application can combine mutually.
In MU-MIMO system, comprise base station and user terminal.Base station need to be matched to a plurality of users (also claiming in groups), using afterwards in groups pre-coding matrix corresponding to user in groups to carry out precoding to the data that user will send in groups, to realize the MU-MIMO transfer of data of point-to-multipoint.Following examples of the present invention realize in this system.
Fig. 2 is according to the flow chart of the processing method of the MU-MIMO system of the embodiment of the present invention, comprises the following steps:
Step S202, the correlation between all code words that in the local code book of preserving, order is identical is calculated in base station;
For example, correlation can be coefficient correlation, can be also distance.
Step S204, from treating to determine master scheduling user user's set in groups, and arrives user's set in groups by master scheduling user add;
Step S206, according to the correlation between the codewords indexes of master scheduling user feedback all code words identical with the order calculated in step S202 in advance, from treat the set of user in groups, determine with master scheduling user between correlation meet the first set with the magnitude relationship of predetermined threshold, and upgrade and treat that user gathers in groups with the first set;
For example, when the correlation between all code words that in the code book calculating in step S202, order is identical is coefficient correlation, in step S206, from treat the set of user in groups, determine with master scheduling user between correlation meet the first set with the magnitude relationship of predetermined threshold and be specially coefficient correlation between definite from treat user's set in groups and master scheduling user and be less than first of correlation coefficient threshold and gather.
Correlation between all code words that in the code book calculating in step S202, order is identical for apart from time, in step S206, from treat the set of user in groups, determine with master scheduling user between correlation meet with the first set of the magnitude relationship of predetermined threshold and be specially: from treat user's set in groups, determine and master scheduling user between code word apart from first gathering of being greater than distance threshold.
Step S208, repeats above-mentioned steps S204 and step S206, until the number of users in user's set reaches in groups number of users threshold value or treats that user's set is empty set in groups in groups.
Above-mentioned steps S202 can be called MU-MIMO user's method in groups to step S208.
Embodiment 1
How the present embodiment explanation base station side utilizes known code book structure code word coefficient correlation form or code word apart from form, certainly the coefficient correlation wherein used or the computational methods of code word distance are just wherein a kind of, can also adopt other mode to calculate coefficient correlation or distance: to establish known codebook C for configuring the base station of 4 transmitting antennas in reality.Wherein C comprises the code word of 16 rank=1, the code word of 16 rank=2, and the code word of the code word of 8 rank=3 and 4 rank=4, the present embodiment mainly illustrates and builds the coefficient correlation of rank=1 and 2 or apart from form T 1and T 2.
(1) calculating the situation that in code book C, rank (order) is the coefficient correlation between all code words of n is:
For the situation of rank=1, establish 16 code word column vectors and be respectively the coefficient correlation of calculating between any two code words is: i, j=1 ..., 16, obtain like this form T for rank=1 1, as shown in Table 1:
Form 1T 1
For rank=2, establish 16 code word column vectors and be respectively the coefficient correlation of calculating between any two code words is: i, j=1 ..., 16, wherein representing matrix minimal eigenvalue, obtain like this form T for rank=2 2, as shown in Table 2:
Form 2T 2
Similarly, can calculate the coefficient correlation form of rank=3 and rank=4.
(2), in above-mentioned example, if select to calculate the distance between all code words that in code book C, rank (order) is n, corresponding method is:
For the situation of rank=1, D ij 1 = 1 - | ( V i 1 ) H V j 1 | 2 , i , j = 1 , . . . , 16 ;
For the situation of rank=2, D ij 2 = 1 - λ min ( ( ( V i 2 ) H V i 2 ) H ( ( V i 2 ) H V i 2 ) ) , i , j = 1 , . . . , 16 .
Corresponding form T 1, T 2similar with above table 1 and form 2.
Similarly, can calculate the distance form of rank=3 and rank=4.
Embodiment 2
The present embodiment is used for illustrating that base station side treating that in groups user's set selects N mU=4 users match and use MU-MIMO.If current, by 20, treat that in groups it is Ω={ U that user forms set 1, U 2... U 20, current MU-MIMO user's set in groups base station arranges MU-MIMO user's correlation coefficient threshold TH r=0.2.
Step 1, base station is selected master scheduling user first therein, is made as U 3, and the rank=1 codewords indexes of feedback is 3 recently, base station is by set omega mUbe updated to Ω mU={ U 3, then at form T 1all numerical value of the 3rd row in select to be less than TH r=0.2 numerical value, establishes them and is respectively its corresponding column index forms set I 1={ 2,8,12,14,16}, then at Ω={ U 1, U 2... U 20in find user feedback codewords indexes belong to I 1={ user's set of 2,8,12,14,16}, is made as Ω 1={ U 1, U 4, U 5, U 7, U 10, U 12, U 16, Ω is updated to Ω 1, i.e. Ω={ U 1, U 4, U 5, U 7, U 10, U 12, U 16.
Step 2, base station determines that in Ω master scheduling user is U 7, upgrade Ω mUfor Ω mU={ U 3, U 7, establish U 7corresponding codewords indexes is 8, at form T 1in eighth row to find column index be I 1={ numerical value of 2,8,12,14,16} is established and in the numerical value finding, is met numerical value and be less than TH rthe column index of=0.2 numerical value is 2,12,14, upgrades I 1for I 1={ 2,12,14} continues at Ω={ U 1, U 4, U 5, U 7, U 10, U 12, U 16in find user feedback codewords indexes belong to I 1={ user's set of 2,12,14}, is made as Ω 1={ U 5, U 10, U 12, U 16, Ω is updated to Ω 1, i.e. Ω={ U 5, U 10, U 12, U 16.
Step 3, base station determines that in Ω master scheduling user is U 10, upgrade Ω mUfor Ω mU={ U 3, U 7, U 10, establish U 10corresponding codewords indexes is 12, at form T 1in the 12nd row to find index be I 1={ numerical value of 2,12,14} is established and is wherein met numerical value and be less than TH r=0.2 index is 2, upgrades I 1for I 1={ 2} continues at Ω={ U 5, U 10, U 12, U 16in find user feedback codewords indexes belong to I 1={ user's set of 2}, is made as Ω 1={ U 5, U 12, Ω is updated to Ω 1, i.e. Ω={ U 5, U 12.
Step 4, base station determines that in Ω master scheduling user is U 12, upgrade Ω mUfor Ω mU={ U 3, U 7, U 10, U 12, Ω now mUelement number be 4, with N mUequate, so base station has completed MU-MIMO user's operation in groups.The final set omega of user in groups mU={ U 3, U 7, U 10, U 12form MU-MIMO user's group, at same time/frequency source block transmitting data.
Embodiment 3
The present embodiment is used for illustrating that base station treating that in groups user's set selects N mU=4 users match and use MU-MIMO.If current, by 20, treat that in groups it is Ω={ U that user forms set 1, U 2... U 20, current MU-MIMO user's set in groups base station arranges MU-MIMO End-user relevance threshold T H r=0.2.
Step 1, base station is first at Ω={ U 1, U 2... U 20middle selection master scheduling user, be made as U 3, and the rank=1 codewords indexes of feedback is 3 recently, base station is by set omega mUbe updated to Ω mU={ U 3, then at form T 1all numerical value of the 3rd row in select to be less than TH r=0.2 numerical value, establishes them and is its corresponding column index forms set I 1={ 2,8,12,14,16}, then at Ω={ U 1, U 2... U 20in find user codewords indexes belong to I 1={ user's set of 2,8,12,14,16}, is made as Ω 1={ U 1, U 4, U 5, U 7, U 10, U 12, U 16, Ω is updated to Ω 1, i.e. Ω={ U 1, U 4, U 5, U 7, U 10, U 12, U 16.
Step 2, base station determines that in Ω master scheduling user is U 7, upgrade Ω mUfor Ω mU={ U 3, U 7, establishing the codewords indexes that U7 is corresponding is 8, at form T 1eighth row to find index be I 1={ numerical value of 2,8,12,14,16} is established and is wherein met numerical value and be less than TH r=0.2 index is 2,12,14, upgrades I 1for I 1={ 2,12,14} continues at Ω={ U 1, U 4, U 5, U 7, U 10, U 12, U 16in find user feedback codewords indexes belong to I 1={ user's set of 2,12,14}, is made as Ω 1={ U 5, U 10, U 12, U 16, Ω is updated to Ω 1, i.e. Ω={ U 5, U 10, U 12, U 16.
Step 3, base station determines that in Ω master scheduling user is U 10, upgrade Ω mUfor Ω mU={ U 3, U 7, U 10, establish U 10corresponding codewords indexes is 12, at form T 1the 12nd row in to find column index be I 1={ numerical value of 2,12,14} is established and is wherein met numerical value and be less than TH r=0.2 index is empty set, so the user of MU-MIMO EO in groups now, the final set omega of user in groups mU={ U 3, U 7, U 10form MU-MIMO user's group, at same time/frequency source block transmitting data.
Preferably, above-mentioned processing method (be completing user in groups after) after step S208, also comprises: calculate user in groups and gather corresponding pre-coding matrix; The pre-coding matrix that use calculates carries out precoding to the transmission data of all users in the set of user in groups; Wherein, this pre-coding matrix is: P=[W 1w 2w n], wherein, N is the number of users in user's set in groups, W i=orth ((I-W (W hw) -1w h) V i), wherein i is N t* N tunit matrix, N tfor constant, orth (.) represents the variable of input to carry out orthonormalization operation, V ifor the user U in the set of user in groups ithe code word corresponding to codewords indexes of feedback, i=1 ..., N.
Embodiment 4
The present embodiment is for illustrating how base station utilizes code word corresponding to MU-MIMO user to calculate final this user and organize corresponding pre-coding matrix and data transmission method for uplink.
If base station disposes 4 descending transmitting antennas, in current MU-MIMO user's group, there are 4 users 1,2,3,4 (has 4 users in user's set in groups), the code word corresponding to codewords indexes of their the last feedbacks is respectively
V 2 = 0.3082 0.0104 + 0.3151 i 0.4077 + 0.4887 i - 0.4783 + 0.4145 i , V 3 = 0.5587 0.2735 - 0.3361 i 0.1135 + 0.5471 i 0.2735 - 0.3361 i , V 4 = 0.5587 - 0.1492 - 0.2737 i - 0.2735 - 0.3361 i - 0.6245 + 0.1132 i .
Step 1, makes W 1=V 1, W 1 = - 0.5000 - 0.5000 0.5000 0.5000 ;
Step 2, makes W=W 1, calculate W 2=orth ((I 4-W (W hw) -1w h) V 2), obtain
W 2 = 0.2254 + 0.1571 i - 0.0929 + 0.4938 i 0.5397 + 0.3651 i - 0.4071 + 0.2858 i ;
Step 3, makes W=[W 1w 2], calculate W 3=orth ((I 4-W (W hw) -1w h) V 3), obtain W 3 = 0.5056 + 0.1201 i 0.2380 - 0.1964 i 0.2968 + 0.3767 i 0.4468 - 0.4530 i ;
Step 4, makes W=[W 1w 2w 3], calculate W 4=orth ((I 4-W (W hw) -1w h) V 4), obtain so finally MU-MIMO pre-coding matrix corresponding to these 4 users can be write as:
P = W 1 W 2 W 3 W 4 = - 0.5000 0.2254 + 0.1571 i 0.5056 + 0.1201 i 0.5176 + 0 . 3696 i - 0.5000 - 0.0929 + 0.4938 i 0.2380 - 0.1964 i - 0.5180 - 0.3660 i 0.5000 0.5397 + 03651 i 0.2968 + 0.3767 i - 0.0198 - 0.3084 i 0.5000 - 0.4071 + 0.2858 i 0.4468 - 0.4530 i 0.0194 + 0.3120 i .
Obviously, the precoding vector in said process is asked for sequentially and can be changed according to actual conditions.Meanwhile, when code word corresponding to user is matrix, utilize similar step can obtain final pre-coding matrix.
Fig. 5 is according to the schematic diagram of the base station of the embodiment of the present invention, comprising: correlation calculations module 10, for calculating the correlation between all code words that local code book order of preserving is identical; Determine and add module 20, for determining master scheduling user from treating that user gathers in groups, and master scheduling user add is arrived to user's set in groups; Update module 30, be used for according to the correlation between the codewords indexes of master scheduling user feedback all code words identical with precalculated order, from treat the set of user in groups, determine with master scheduling user between correlation meet the first set with the magnitude relationship of predetermined threshold, and upgrade and treat that user gathers in groups with the first set; Control module 40, determine to add module 20 and update module 30 repeats operation separately for controlling, until the number of users in user's set reaches in groups number of users threshold value or treats that user's set is empty set in groups in groups.
Preferably, computing module 10 comprises: computing module, in the situation that above-mentioned correlation is coefficient correlation, calculates the coefficient correlation between all code words that in code book, order is n; Or in the situation that above-mentioned correlation is distance, calculate the distance between all code words that in code book, order is n; Wherein, order is the quantity of the column vector that comprises of the code word in code book, n=1, and 2 ..., r h, r hfor constant; Memory, for form T norder that preserve to calculate of form all code words that are n between coefficient correlation or distance, wherein, form T nin i element capable and j row place be: in all code words that are n in order, the coefficient R between the code word that the code word that index is i and index are j n ijor distance
Preferably, above-mentioned base station also comprises: initialization module 50, for initialization, treat all users to be scheduled of user's set-inclusion in groups, and initialization in groups user set be empty set
Preferably, determine to add module 20 and comprise: determination module, for from treating that user's set omega in groups determines that a user with the highest dispatching priority is as master scheduling user; Add module, for by the user add with the highest dispatching priority of determining to user's set omega in groups mU.
Preferably, when computing module described above calculate be the coefficient correlation between all code words that in code book, order is n time, above-mentioned predetermined threshold is correlation coefficient threshold, determines and adds the definite master scheduling user U of module 20 kthe codewords indexes of feedback is I k, described codewords indexes ikthe order of corresponding code word is m, m ∈ [1, r h]; Update module 30 comprises: judge module, and for judging user's set omega in groups mUin number of users whether surpass number of users threshold value in groups; Search module, in the situation that judgment result is that of above-mentioned judge module do not surpass number of users threshold value in groups, at form T mi krow/column is searched the numerical value that is less than correlation coefficient threshold, and the column/row at the numerical value place finding forms the second set; Composition module, for be not empty in the second set in the situation that, treating in user's set omega, to determine that the codewords indexes of feedback belongs to the user of the second set and forms the first set in groups, and is upgrading and treat user's set omega in groups with the first set.
Or, preferably, when computing module described above calculate be the distance between all code words that in code book, order is n time, above-mentioned predetermined threshold is distance threshold, determines and adds the definite master scheduling user U of module 20 kthe codewords indexes of feedback is I k, described codewords indexes I kthe order of corresponding code word is m, m ∈ [1, r h]; Update module 30 comprises: judge module, and for judging user's set omega in groups mUin number of users whether surpass number of users threshold value in groups; Search module, in the situation that judgment result is that of above-mentioned judge module do not surpass number of users threshold value in groups, at form T mi krow/column is searched the numerical value that is greater than distance threshold, and the column/row at the numerical value place finding forms the second set; Composition module, for be not empty in the second set in the situation that, treating in user's set omega, to determine that the codewords indexes of feedback belongs to the user of the second set and forms the first set in groups, and is upgrading and treat user's set omega in groups with the first set.
Preferably, control module 40 comprises: return to module, for in the situation that treating that user's set omega is not empty in groups, control to determine add module 20 and carry out from treating to determine master scheduling user user's set in groups, and by master scheduling user add to user gathers in groups step (being the step S202 in said method embodiment).
Preferably, this base station also comprises: pre-coding matrix computing module, for calculating user in groups, gather corresponding pre-coding matrix; Precoding module, for being used the pre-coding matrix that above-mentioned pre-coding matrix computing module calculates to carry out precoding to all users' that user gathers in groups transmission data; Wherein, this pre-coding matrix is: P=[W 1w 2w n], wherein, N is the number of users in user's set in groups, W i=orth ((I-W (W hw) -1w h) V i),
Wherein i is N t* N tunit matrix, N tfor constant, orth (.) represents the variable of input to carry out orthonormalization operation, V ifor the user U in the set of user in groups ithe code word corresponding to codewords indexes of feedback, i=1 ..., N.
As can be seen from the above description, the present invention has realized following technique effect:
(1) can realize fast and efficiently user in groups, reduce the complexity of system;
(2) owing to user being organized to the computational process of corresponding pre-coding matrix P, be divided into calculating W 1, W 2..., W nn step carry out (substep computing), while calculating, the dimension of matrix can be very not large at every turn, computation complexity is lower; And, calculate W ithe result W once calculating before need to using i-1, like this, at hardware, realize time ratio and be easier to realize.
Obviously, those skilled in the art should be understood that, above-mentioned each module of the present invention or each step can realize with general calculation element, they can concentrate on single calculation element, or be distributed on the network that a plurality of calculation elements form, alternatively, they can be realized with the executable program code of calculation element, thereby, they can be stored in storage device and be carried out by calculation element, and in some cases, can carry out shown or described step with the order being different from herein, or they are made into respectively to each integrated circuit modules, or a plurality of modules in them or step are made into single integrated circuit module to be realized.Like this, the present invention is not restricted to any specific hardware and software combination.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.

Claims (12)

1. a processing method for multi-user's multiple-input and multiple-output MU-MIMO system, is characterized in that, comprising:
Step S202, the correlation between all code words that in the local code book of preserving, order is identical is calculated in base station;
Step S204, from treating to determine master scheduling user user's set in groups, and arrives user's set in groups by described master scheduling user add;
Step S206, according to the codewords indexes of described master scheduling user feedback and precalculated described correlation, from described, treat that the correlation between definite user's set in groups and described master scheduling user meets and the first set of the magnitude relationship of predetermined threshold, and treat user's set in groups described in described the first set renewal;
Repeating said steps S204 and described step S206, until the number of users in described user in groups set reach in groups number of users threshold value or described in treat that user's set is empty set in groups.
2. method according to claim 1, is characterized in that, definite master scheduling user from treat user's set in groups, and before described master scheduling user add is arrived to user's set in groups, also comprises:
Described in the initialization of described base station, treat all users to be scheduled of user's set-inclusion in groups, and described in initialization in groups user set be empty set
3. method according to claim 1, is characterized in that, from treat in groups user's set, determines master scheduling user, and described master scheduling user add is gathered and comprised to user in groups:
A user with the highest dispatching priority is treated to determine the set of user in groups as described master scheduling user and user's set in groups described in adding to from described in described base station.
4. method according to claim 1, is characterized in that, described correlation is coefficient correlation, and the correlation that calculate between all code words that in the local code book of preserving, order is identical base station comprises:
The coefficient correlation between all code words that in described code book, order is n is calculated in described base station, and with form T nform preserve;
Wherein, described order is the quantity of the column vector that comprises of the code word in described code book, n=1, and 2 ..., r h, r hfor constant, described form T nin i element capable and j row place be: in all code words that are n in order, the coefficient correlation between the code word that the code word that index is i and index are j
5. method according to claim 4, is characterized in that, described predetermined threshold is correlation coefficient threshold, described master scheduling user U kthe codewords indexes of feedback is I k, described codewords indexes I kthe order of corresponding code word is m, m ∈ [1, r h]; According to the codewords indexes of described master scheduling user feedback and precalculated described correlation, from described, treat that the correlation between definite user's set in groups and described master scheduling user meets and the first set of the magnitude relationship of predetermined threshold, and treat that user's set comprises in groups described in described the first set renewal:
User's set omega in groups described in the judgement of described base station mUin number of users whether surpass the described threshold value of number of users in groups;
If do not surpass the described threshold value of number of users in groups, at described form T ni krow/column is searched the numerical value that is less than described correlation coefficient threshold, and the index of the column/row at the numerical value place finding forms the second set;
In described the second set, be empty in the situation that, described treating, in user's set omega, determine that the codewords indexes of feedback belongs to the user of described the second set and forms described the first set in groups, and treat user's set omega in groups described in described the first set renewal.
6. method according to claim 1, is characterized in that, described correlation is distance, and the correlation that calculate between all code words that in the local code book of preserving, order is identical base station comprises:
The distance between all code words that in described code book, order is n is calculated in described base station, and with form T nform preserve;
Wherein, described order is the quantity of the column vector that comprises of the code word in described code book, n=1, and 2 ..., r h, r hfor constant, described form T nin i element capable and j row place be: in all code words that are n in order, the distance between the code word that the code word that index is i and index are j
7. method according to claim 6, is characterized in that, described predetermined threshold is distance threshold, described master scheduling user U kthe codewords indexes of feedback is I k, described codewords indexes I kthe order of corresponding code word is m, m ∈ [1, r h]; According to the codewords indexes of described master scheduling user feedback and precalculated described correlation, from described, treat that the correlation between definite user's set in groups and described master scheduling user meets and the first set of the magnitude relationship of predetermined threshold, and treat that user's set comprises in groups described in described the first set renewal:
User's set omega in groups described in the judgement of described base station mUin number of users whether surpass the described threshold value of number of users in groups;
If do not surpass the described threshold value of number of users in groups, at described form T ni krow/column is searched the numerical value that is greater than described distance threshold, and the index of the column/row at the numerical value place finding forms the second set;
In described the second set, be empty in the situation that, described treating, in user's set omega, determine that the codewords indexes of feedback belongs to the user of described the second set and forms described the first set in groups, and treat user's set omega in groups described in described the first set renewal.
8. according to the method described in claim 5 or 7, it is characterized in that, repeating said steps S204 and described step S206, until the number of users in described user in groups set reach in groups number of users threshold value or described in treat that user's set in groups comprises for empty set:
Described, treat that in groups user's set omega, for empty in the situation that, returns to described step S202.
9. method according to claim 1, it is characterized in that, at repeating said steps S204 and described step S206, until the number of users in described user in groups set reach in groups number of users threshold value or described in treat that user's set, for after empty set, also comprises in groups:
Described in calculating, user gathers corresponding pre-coding matrix in groups;
Use described pre-coding matrix to carry out precoding to the transmission data of all users in the described set of user in groups;
Wherein, described pre-coding matrix is: P=[W 1w 2w n], wherein, N is the number of users in the described set of user in groups, W i=orth ((I-W (W hw) -1w h) V i), wherein i is N t* N tunit matrix, N tfor constant, orth (.) represents the variable of input to carry out orthonormalization operation, V ifor the user U in the described set of user in groups ithe code word corresponding to codewords indexes of feedback, i=1 ..., N.
10. a base station, is characterized in that, comprising:
Correlation calculations module, for calculating the correlation between all code words that local code book order of preserving is identical;
Determine and add module, for determining master scheduling user from treating that user gathers in groups, and described master scheduling user add is arrived to user's set in groups;
Update module, be used for according to the codewords indexes of described master scheduling user feedback and precalculated described correlation, from described, treat that the correlation between definite user's set in groups and described master scheduling user meets and the first set of the magnitude relationship of predetermined threshold, and treat user's set in groups described in described the first set renewal;
Control module, repeats operation separately for controlling described definite interpolation module and described update module, until the number of users in described user in groups set reach in groups number of users threshold value or described in treat that user's set is empty set in groups.
11. base stations according to claim 10, is characterized in that, described correlation calculations module comprises:
Computing module, in the situation that described correlation is coefficient correlation, calculates the coefficient correlation between all code words that in described code book, order is n; Or in the situation that described correlation is distance, calculate the distance between all code words that in described code book, order is n; Wherein, described order is the quantity of the column vector that comprises of the code word in described code book, n=1, and 2 ..., r h, r hfor constant;
Memory, for form T ndescribed order that preserve to calculate of form all code words that are n between coefficient correlation or distance, wherein, described form T nin i element capable and j row place be: in all code words that are n in order, the coefficient correlation between the code word that the code word that index is i and index are j or distance
12. base stations according to claim 11, is characterized in that, described definite interpolation module comprises:
Determination module, for treating that from described user's set omega in groups determines that a user with the highest dispatching priority is as described master scheduling user;
Add module, for by the user add described in determining with the highest dispatching priority to the described set omega of user in groups mU, wherein, described in there is the user U of high dispatching priority kthe codewords indexes of feedback is I k, described codewords indexes I kthe order of corresponding code word is m, m ∈ [1, r h].
CN201010220730.4A 2010-07-01 2010-07-01 Method for processing multiple-user multiple input multiple output (MU-MIMO) system and base station Expired - Fee Related CN102315913B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201010220730.4A CN102315913B (en) 2010-07-01 2010-07-01 Method for processing multiple-user multiple input multiple output (MU-MIMO) system and base station
PCT/CN2010/079725 WO2012000289A1 (en) 2010-07-01 2010-12-13 Processing method and base station for multi-user multiple-input and multiple-output (mu-mimo) system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010220730.4A CN102315913B (en) 2010-07-01 2010-07-01 Method for processing multiple-user multiple input multiple output (MU-MIMO) system and base station

Publications (2)

Publication Number Publication Date
CN102315913A CN102315913A (en) 2012-01-11
CN102315913B true CN102315913B (en) 2014-10-22

Family

ID=45401357

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010220730.4A Expired - Fee Related CN102315913B (en) 2010-07-01 2010-07-01 Method for processing multiple-user multiple input multiple output (MU-MIMO) system and base station

Country Status (2)

Country Link
CN (1) CN102315913B (en)
WO (1) WO2012000289A1 (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070066229A1 (en) * 2005-09-21 2007-03-22 Chengjin Zhang Method and system for finding a threshold for semi-orthogonal user group selection in multiuser MIMO downlink transmission
CN101222267A (en) * 2007-01-08 2008-07-16 中兴通讯股份有限公司 User matching method in MIMO transmission and method for confirming match factor
CN101667896A (en) * 2009-09-18 2010-03-10 上海第二工业大学 User selecting method of multi-user MIMO communication system based on codebook

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070066229A1 (en) * 2005-09-21 2007-03-22 Chengjin Zhang Method and system for finding a threshold for semi-orthogonal user group selection in multiuser MIMO downlink transmission
CN101222267A (en) * 2007-01-08 2008-07-16 中兴通讯股份有限公司 User matching method in MIMO transmission and method for confirming match factor
CN101667896A (en) * 2009-09-18 2010-03-10 上海第二工业大学 User selecting method of multi-user MIMO communication system based on codebook

Also Published As

Publication number Publication date
CN102315913A (en) 2012-01-11
WO2012000289A1 (en) 2012-01-05

Similar Documents

Publication Publication Date Title
JP5438829B2 (en) Precoding method, channel information feedback method, transmitter, receiver, and precoding codebook structure method
Yoo et al. On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
Fernandes et al. Inter-cell interference in noncooperative TDD large scale antenna systems
KR100997573B1 (en) Feedback apparatus, feedback method, scheduling apparatus, and scheduling method
CN102316597B (en) Resource scheduling method and device for multiple input multiple output (MIMO) system
CN101873202B (en) Radio communication apparatus and method
JP5127394B2 (en) MIMO system precoding method and apparatus using the method
CN102195698B (en) Method and device in multiple-user multiple-input multiple-output MU-MIMO wireless communication system
CN102301666B (en) Precoding codebook and feedback representation
Zhang et al. Low complexity MIMO scheduling with channel decomposition using capacity upperbound
US20130170445A1 (en) Multi-user downlink linear MIMO precoding system
CN102823177B (en) For the method operating slave station
CN101834646B (en) User selection method, user selection device and base station
JP2013502111A5 (en)
CN102025463B (en) Feedback method of MIMO wireless communication system for down link
CN103379652A (en) Method, device and system for achieving user pairing of user scheduling
CN101232478A (en) Equipment and method for selecting matched data stream and corresponding precoding vectors
EP2557723A1 (en) Channel state information feedback method and system thereof
CN102438322B (en) Resource scheduling method and relevant equipment
CN102696180B (en) Space channel State Feedback Approach and device
EP3419190A1 (en) Transmission diversity method, device and system
CN102291834A (en) Multi-input/multi-output resource scheduling method and base station
CN101860386A (en) Multi-user random beam forming method and system
CN101572581A (en) Method and device for confirming signal-interference-noise radio
CN102315913B (en) Method for processing multiple-user multiple input multiple output (MU-MIMO) system and base station

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: 20141022

Termination date: 20190701

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