CN108462518A - Data transmission method and device based on user's scheduling - Google Patents

Data transmission method and device based on user's scheduling Download PDF

Info

Publication number
CN108462518A
CN108462518A CN201710087367.5A CN201710087367A CN108462518A CN 108462518 A CN108462518 A CN 108462518A CN 201710087367 A CN201710087367 A CN 201710087367A CN 108462518 A CN108462518 A CN 108462518A
Authority
CN
China
Prior art keywords
data layer
calculated
result
product
channel vector
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.)
Pending
Application number
CN201710087367.5A
Other languages
Chinese (zh)
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 Samsung Telecom R&D Center
Beijing Samsung Telecommunications Technology Research Co Ltd
Samsung Electronics Co Ltd
Original Assignee
Beijing Samsung Telecommunications Technology Research Co Ltd
Samsung Electronics Co Ltd
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 Samsung Telecommunications Technology Research Co Ltd, Samsung Electronics Co Ltd filed Critical Beijing Samsung Telecommunications Technology Research Co Ltd
Priority to CN201710087367.5A priority Critical patent/CN108462518A/en
Publication of CN108462518A publication Critical patent/CN108462518A/en
Pending legal-status Critical Current

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/0452—Multi-user MIMO systems
    • 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/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting

Landscapes

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

Abstract

An embodiment of the present invention provides the data transmission method and device dispatched based on user, the method includes：The information of subscriber terminal equipment based on acquisition matches the combination that corresponding data Layer is determined in set from alternative multi-user；Iteration determines the pre-coding matrix of the combination of the data Layer；User's scheduling result is determined according to the pre-coding matrix, and is carried out data transmission to corresponding subscriber terminal equipment according to user's scheduling result.In the embodiment of the present invention, the inversion operation of matrix is saved, greatly reduces the complexity of calculating, promotes the efficiency and speed for determining pre-coding matrix；And sufficiently fast can determine the pre-coding matrix of multiple data Layers combination of multi-user's pairing, power system capacity need not be reduced.Therefore, the present invention can promote the efficiency of multi-subscriber dispatching in the case where not influencing power system capacity, accelerate the response to subscriber terminal equipment on the whole, can promote the experience of user.

Description

Data transmission method and device based on user's scheduling
Technical field
The present invention relates to wireless communication technology fields, specifically, the present invention relates to a kind of data based on user's scheduling Transmission method and device.
Background technology
In the movement of MIMO (Multiple Input Multiple Output, multiple-input, multiple-output) technology using multiple antennas In communication system, the channel between different user has certain space isolation.Utilize space channel between different user Isolation, can utilize it is identical when/frequency/code resource simultaneously be multiuser transmission signal.In mimo systems, these are utilized identical When/frequency/code resource is known as MU (Multi-User, multi-user) MIMO technology for the mode of multiuser transmission signal simultaneously.
It is theoretical according to MIMO, capacity and antenna for base station number and the total reception antenna of multi-user of the mimo system under MU-MIMO Number is directly proportional, and power system capacity can be obviously improved using the space channel isolation between different user by MU-MIMO.So And in systems in practice, it is not completely isolated using the space channel between the multi-user of same asset, exist between each other dry It disturbs, is reduced so as to cause MU-MIMO system capacity.It, can be right by multi-user's MU-MIMO precoding techniques in downlink system Interference between multi-user suppresses or eliminates, to promote MU-MIMO system capacity.
Existing MU-MIMO wireless communication systems, such as LTE (Long Term Evolution, long term evolution)/LTE-A System is typical multi-aerial radio communication system, and traditional LTE/LTE-A system descendings antenna port number is generally 2,4 or 8. In existing MU-MIMO wireless communication systems, the MU-MIMO scheduling for combining MU-MIMO precoding techniques is key therein One of technology.MU-MIMO scheduling determines the user for matching transmission in MU-MIMO in each time, frequency, code resource, and true for each user Determine the precoding of MCS (Modulation and Coding Scheme, Modulation and Coding Scheme) and each user's MU-MIMO transmission Matrix.The data transmission method based on user's scheduling of classical MU-MIMO system, usually searches out MU- using searching algorithm All possible alternative multi-user matches set in MIMO, possible alternative multi-purpose generally for each searched MU-MIMO Family pairing set, is required for utilizing MU-MIMO precoding techniques, calculates corresponding pre-coding matrix；It is prelisted according to calculated Code matrix carries out user's scheduling.
During existing MU-MIMO pre-coding matrixes calculate, it is related to the high complexity operation such as matrix inversion and matrix multiplication.And And with the increase of antenna number and the pairing number of plies, the computation complexity of MU-MIMO pre-coding matrixes will dramatically increase.
However, having occurred the wireless communication system of the base station model machine comprising 32 antennas, 64 antennas and 128 antennas at present System, such as introduce the FD (Full- based on AAS (Active Antenna System active antenna systems) system Dimensional, omnidirectional)-mimo system, after Massive (extensive) MIMO technology, the transmission antenna number of wireless communication system It is likely to be breached 16,32,64 or 128 etc., it is even more.In the mimo system of AAS, the antenna number of base station is much larger than single terminal Antenna number.It needs to equip the demand of a large amount of antennas in addition, operator also proposed base station.Therefore, antenna for base station in real system Number will be continuously increased.If still using existing multi-user dispatching method, the calculating of the MU-MIMO pre-coding matrixes in this method Complexity will be continuously increased, and will inevitably substantially reduce the efficiency for determining pre-coding matrix, cause to reduce multi-user's tune The efficiency of degree, it is easy to greatly increase the operating lag to subscriber terminal equipment, be easily reduced the experience of user.
Invention content
The present invention is directed to the shortcomings that existing way, proposes a kind of data transmission method and device based on user's scheduling, uses That there are the computation complexities of pre-coding matrix to solve the prior art is higher, determines that the less efficient of pre-coding matrix is asked Topic promotes the efficiency for determining pre-coding matrix to reduce the computation complexity of pre-coding matrix.
The embodiment of the present invention provides a kind of data transmission method dispatched based on user according to the first aspect, packet It includes：
The information of subscriber terminal equipment based on acquisition matches in set from alternative multi-user and determines corresponding data Layer Combination；
Iteration determines the pre-coding matrix of the combination of the data Layer；
User's scheduling result is determined according to the pre-coding matrix, and according to user's scheduling result to corresponding user Terminal device carries out data transmission.
The embodiment of the present invention additionally provides a kind of data transmission device dispatched based on user according to the second aspect, Including：
Data Layer combines determining module, is used for the information of the subscriber terminal equipment based on acquisition, is matched from alternative multi-user The combination of corresponding data Layer is determined in set；
Pre-coding matrix determining module determines the pre-coding matrix of the combination of the data Layer for iteration；
Scheduled transmission module, for determining user's scheduling result according to the pre-coding matrix, and according to user's tune Degree result carries out data transmission to corresponding subscriber terminal equipment.
In the embodiment of the present invention, corresponding pre-coding matrix is combined according to the data Layer of negligible amounts, iteration is determined to count It measures more data Layer and combines corresponding pre-coding matrix.During iteration, the inversion operation of matrix is saved, and is subtracted significantly The multiplying for having lacked vectorial (or matrix) greatly reduces the complexity of calculating, promotes the efficiency for determining pre-coding matrix And speed；Even if can be sufficiently fast if the data Layer of the system of wireless telecommunication system and all more quantity of antenna The pre-coding matrix for determining multiple data Layers combination of multi-user's pairing, need not reduce power system capacity.Therefore, the present invention can In the case where not influencing power system capacity, to promote the efficiency of multi-subscriber dispatching, accelerate on the whole to subscriber terminal equipment Response, can promote the experience of user.
The additional aspect of the present invention and advantage will be set forth in part in the description, these will become from the following description Obviously, or practice through the invention is recognized.
Description of the drawings
Above-mentioned and/or additional aspect and advantage of the invention will become from the following description of the accompanying drawings of embodiments Obviously and it is readily appreciated that, wherein：
Fig. 1 is the flow diagram of the data transmission method based on user's scheduling of the embodiment of the present invention；
Fig. 2 a are that the iteration of the embodiment of the present invention is determined to match the data Layer combination in set selected from alternative multi-user The schematic diagram of one example of pre-coding matrix；
Fig. 2 b be the embodiment of the present invention Fig. 2 a in second step decomposition step an example schematic diagram；
Fig. 2 c be the embodiment of the present invention Fig. 2 a in four steps decomposition step an example schematic diagram；
Fig. 3 is the block schematic illustration of the internal structure of the data transmission device based on user's scheduling of the embodiment of the present invention；
Fig. 4 is that existing pre-coding matrix determines that method determines that method carries out comparison in fact with the pre-coding matrix in the present invention The schematic diagram for the example tested.
Specific implementation mode
The embodiment of the present invention is described below in detail, examples of the embodiments are shown in the accompanying drawings, wherein from beginning to end Same or similar label indicates same or similar element or element with the same or similar functions.Below with reference to attached The embodiment of figure description is exemplary, and is only used for explaining the present invention, and is not construed as limiting the claims.
Those skilled in the art of the present technique are appreciated that unless expressly stated, singulative " one " used herein, " one It is a ", " described " and "the" may also comprise plural form.It is to be further understood that is used in the specification of the present invention arranges It refers to there are the feature, integer, step, operation, element and/or component, but it is not excluded that presence or addition to take leave " comprising " Other one or more features, integer, step, operation, element, component and/or their group.It should be understood that when we claim member Part is " connected " or when " coupled " to another element, it can be directly connected or coupled to other elements, or there may also be Intermediary element.In addition, " connection " used herein or " coupling " may include being wirelessly connected or wirelessly coupling.It is used herein to arrange Diction "and/or" includes that the whole of one or more associated list items or any cell are combined with whole.
Those skilled in the art of the present technique are appreciated that unless otherwise defined, all terms used herein (including technology art Language and scientific terminology), there is meaning identical with the general understanding of the those of ordinary skill in fields of the present invention.Should also Understand, those terms such as defined in the general dictionary, it should be understood that have in the context of the prior art The consistent meaning of meaning, and unless by specific definitions as here, the meaning of idealization or too formal otherwise will not be used To explain.
It includes wireless communication that those skilled in the art of the present technique, which are appreciated that " terminal " used herein above, " terminal device " both, The equipment of number receiver, only has the equipment of the wireless signal receiver of non-emissive ability, and includes receiving and transmitting hardware Equipment, have on bidirectional communication link, can carry out two-way communication reception and emit hardware equipment.This equipment May include：Honeycomb or other communication equipments are shown with single line display or multi-line display or without multi-line The honeycomb of device or other communication equipments；PCS (Personal Communications Service, PCS Personal Communications System), can With combine voice, data processing, fax and/or communication ability；PDA (Personal Digital Assistant, it is personal Digital assistants), may include radio frequency receiver, pager, the Internet/intranet access, web browser, notepad, day It goes through and/or GPS (Global Positioning System, global positioning system) receiver；Conventional laptop and/or palm Type computer or other equipment, have and/or the conventional laptop including radio frequency receiver and/or palmtop computer or its His equipment." terminal " used herein above, " terminal device " they can be portable, can transport, be mounted on the vehicles (aviation, Sea-freight and/or land) in, or be suitable for and/or be configured in local runtime, and/or with distribution form, operate in the earth And/or any other position operation in space." terminal " used herein above, " terminal device " can also be communication terminal, on Network termination, music/video playback terminal, such as can be PDA, MID (Mobile Internet Device, mobile Internet Equipment) and/or mobile phone with music/video playing function, can also be the equipment such as smart television, set-top box.
It was found by the inventors of the present invention that in order to reduce in existing multi-user dispatching method, pre-coding matrix determined The complexity of journey (such as matrix inversion), existing low-complexity method include lumped matrix method (matrixs in block form Method), Gaussian elimination method (Gaussian elimination method) or Cholesky decomposition methods (square root factorization method) etc.. Inverting for General High Order matrix at present, Cholesky decomposition methods are the minimum algorithms of known complexity, and extensive Using.
It is assumed that antenna for base station number is NT, when calculate that alternative multi-user matches the i-th layer data layer in set matches clock synchronization, make With the precoding algorithms of most common Cholesky decomposition methods, general 2i (i are needed2-1)/3+(6i2+2i)NTSecondary real multiplications. As can be seen that with the increase of antenna number and the pairing number of plies, the computation complexity of existing MU-MIMO pre-coding matrixes will be notable Increase, can still substantially reduce the efficiency for determining pre-coding matrix, leads to the efficiency for reducing multi-subscriber dispatching, it is easy to increase greatly Add the operating lag to subscriber terminal equipment, is easily reduced the experience of user.
It was found by the inventors of the present invention that at present, although there are the precodings of some low complex degrees based on sacrificial system capacity The methods of the algorithm of matrix, such as reduce pairing number, reduce actual antennas number.But these algorithms are not only from basic It is upper to reduce the complexity of precoding algorithms, and reduce the practical of antenna and utilize number, with using more antennas with it is more The development trend that subscriber terminal equipment is communicated is disagreed, and causes a large amount of antennas more than existing system to become ornaments, quite In the power system capacity for reducing practical multiaerial system.
Data transmission set provided by the invention based on user's scheduling, including：Multiple transmission antennas.
Preferably, the data transmission set based on user's scheduling of the present invention includes the data transmission dress dispatched based on user It sets.
Data transmission set based on user's scheduling can be set in base station.
The flow diagram of data transmission method provided by the invention based on user's scheduling is as shown in Figure 1, include：S101 The information of subscriber terminal equipment based on acquisition matches the combination that corresponding data Layer is determined in set from alternative multi-user； S102 iteration determines the pre-coding matrix of the combination of data Layer；S103：User's scheduling result is determined according to pre-coding matrix, and Carried out data transmission to corresponding subscriber terminal equipment according to user's scheduling result.
Wherein, the information of subscriber terminal equipment includes at least one of following：Channel state information, repeat feedback information, industry Business relevant information.
Alternative multi-user matches the combination that set includes all data Layers that can participate at least one user's transmission.
It can easily be seen that in the present invention, corresponding pre-coding matrix is combined according to the data Layer of negligible amounts, iteration is determined A fairly large number of data Layer combines corresponding pre-coding matrix.During iteration, the inversion operation of matrix is saved, and significantly The multiplying for reducing vectorial (or matrix) greatly reduces the complexity of calculating, promotes the effect for determining pre-coding matrix Rate and speed；Even if can enough quickly if the data Layer of the system of wireless telecommunication system and all more quantity of antenna Determine multi-user pairing multiple data Layers combination pre-coding matrix, power system capacity need not be reduced.Therefore, of the invention The efficiency of multi-subscriber dispatching can be promoted in the case where not influencing power system capacity, accelerated on the whole to subscriber terminal equipment Response, the experience of user can be promoted.
The data transmission method dispatched based on user for introducing the embodiment of the present invention developed below.
Obtain the information that at least one subscriber terminal equipment is sent.
Preferably, under some cases, a subscriber terminal equipment needs to occupy a channel, and transmission relates to the use of a letter Cease the information carried out data transmission.In the case of other, a subscriber terminal equipment needs to occupy more than two channels, and transmission relates to And the information carried out data transmission using more than two channels.
Information includes at least one of following：Channel state information, repeat feedback information, service related information.
Wherein, channel state information, including it is at least one of following：Channel quality information, spatial channel state information, order letter Breath.
Channel quality information includes：CQI (Channel Quality Indicator, channel quality instruction).
Rank information includes：RI (rank indicator, order instruction).
Spatial channel state information includes：PMI (Pre-coding Matrix Index, pre-coding matrix index) information Corresponding pre-coding matrix is determined using pre-coding matrix corresponding to channel reciprocity and/or pre-coding matrix index information Spatial channel state information.
Specifically, meeting uplink and downlink channel reciprocity condition, and can be in the system by uplink channel status information, such as TD-LTE system etc., spatial channel state information can utilize spatial channel state information determined by channel reciprocity.
Meet uplink and downlink channel reciprocity condition at the same time, and includes one or more pre-coding matrix index PMI feedbacks System in, spatial channel state information can be the pre-coding matrix corresponding to pre-coding matrix index information, can be profit The spatial channel state information determined by channel reciprocity can also be to be believed using channel reciprocity and pre-coding matrix index The corresponding pre-coding matrix of breath combines obtained spatial channel state information.
Preferably, spatial channel state information, can be the spatial channel state information after power normalization.So-called power Normalization, i.e., be set as 1 by the total power value of space channel.
Preferably, spatial channel state information, can be characterized in the form of aggregated channel matrix and/or channel vector.
Further, in order to make it easy to understand, the dimension that can define aggregated channel matrix, which is the data number of plies, is multiplied by transmission antenna Number.The characteristic manner of the aggregated channel matrix of other forms has no effect on the method using this patent, it is only necessary to aggregated channel The dimension of matrix does corresponding conversion.
Repeat feedback information includes：ACK (ACKnowledgement confirms and answers) and/or NACK (Negative ACKnowledgment, negative acknowledge) information.
Service related information includes at least one of following：The type of service of subscriber terminal equipment has passed data volume, buffer (gain) state.
According to the information of at least one subscriber terminal equipment of acquisition, determine that corresponding alternative multi-user matches set.
Specifically, based on acquired channel state information, repeat feedback information and/or service related information, under utilization At least one searching method is stated, the combination for determining corresponding data Layer in set is matched from alternative multi-user：Exhaustive search side Method, greedy search method press layer searching method, press user search method.
Alternative multi-user matches set, including：All data Layer combinations that can participate at least one user's transmission.From standby It selects multi-user to match the combination for the data Layer determined in set, matches with the distributed channel of at least one subscriber terminal equipment It is right；Wherein, a data Layer is corresponding with a distributed channel of subscriber terminal equipment.
In the embodiment of the present invention, one of following linear predictive coding algorithms may be used, to determine to be selected from alternative multi-user The pre-coding matrix of the data Layer combination of pairing set：SLNR (Signal to Leakage and noise ratio, letter leakage Make an uproar ratio) algorithm, MMSE (Minimum Mean Square Error, least mean-square error) algorithm, (Zero Forcing compel ZF Zero) algorithm.
Assuming that pre-coding matrix when at least one user's transmission is to meet W=f { (X+HHH)-1HHPre-coding matrix； Wherein X is diagonal matrix, and dimension is equal to the data number of plies in the data Layer combination matched from alternative multi-user and determined in set, H The aggregated channel matrix that spatial channel state information to combine corresponding subscriber terminal equipment by data Layer forms, line number are number The data number of plies in being combined according to layer, columns are equal to the transmission antenna number of base station；F () representing matrix operation, HHIn upper right mark H The conjugate transposition of representing matrix, pre-coding matrix when W indicates to assume at least one user's transmission, line number are equal to the hair of base station Antennas number, columns are the data number of plies in the data Layer combination determined.
Specifically, pre- when W is at least one user transmission based on zero forcing algorithm when f (A)=A when X is null matrix Encoder matrix.
When X is non-zero diagonal matrix, when f (A)=A, when W is at least one user transmission based on least-mean-square error algorithm Pre-coding matrix.
When X is diagonal matrix, f (A)=max eigenvector { AiWhen, W is based on minimum letter leakage than at least the one of algorithm Pre-coding matrix when a user's transmission.
Preferably, indicating the pre-coding matrix that different linear predictive coding algorithms are determined with formula.
It is assumed that (distribution) channel of user (terminal device) i is Hi, (polymerization) channel matrix of all users is H, Then the formula difference of these Linear precoding matrixes is as follows：
WZF=HH(HHH)-1... ... ... ... ... ... ... ... (formula 1)
WMMSE=HH(HHH+σ2I)-1=(σ2I+HHH)-1HH... ... ... (formula 2)
W in above-mentioned formula (1)-(3)ZFIndicate the pre-coding matrix based on ZF algorithms, WMMSEIt indicates based on MMSE algorithms Pre-coding matrix, WSLNR,iIndicate the pre-coding matrix based on SLNR algorithms of i-th of user；HHThe conjugate transposition of representing matrix H (hermit), A-1Inverse (inversion) of representing matrix A, the feature vector of eigenvector (A) representing matrixes A (eigenvector), it is unit matrix (unit matrix) that maximum element, I are asked in max () expressions, and σ is the MMSE factors.
In order to make it easy to understand, specifically introducing iteration so that the pre-coding matrix based on MMSE algorithms determines method as an example below The method for determining the pre-coding matrix of data Layer combination.
Based on above-mentioned formula (2), it is assumed that antenna for base station number is N in systemT.It matches in set and determines from alternative multi-user In the data Layer combination gone out, the spatial channel state information of r-th of data Layer is 1*NTThe channel vector of dimension, is denoted as hr, it is searched (polymerization) channel matrix for the total r data Layer (i.e. data Layer combines) chosen is Nr, dimension r*NT, define and need to invert Matrix be
A in above-mentioned formula (4)rIndicate total r data Layer by finding the inverse matrix, A0 is the initialization matrix set.Then count When calculating pre-coding matrix when being transmitted comprising r layers of at least one user, at least one user transmission of all r data Layers When pre-coding matrix be Wr, obtained by following formula (5)：
P-th of data Layer corresponding precoding vector when at least one user is transmitted is W in above-mentioned formula (5)r,p, p is small In or equal to r, obtained by following formula (6)：
Iteration determines the method that the pre-coding matrix of the data Layer combination of set is matched selected from alternative multi-user, including： (based on) outer circulation iteration (determination of the pre-coding matrix of data Layer combination) method.
In each outer circulation iterative process, including：Interior cycle one and interior cycle two.
Wherein, the number of outer circulation iteration is equal to the sum of selected data Layer；In outer circulation iterative process The iterations of interior cycle one, equal to the sum for having calculated data Layer；Outer circulation iterative process includes cycle in primary Two.
In each outer circulation iterative process, the channel vector based on current data layer and each combination for having calculated data Layer Corresponding pre-coding matrix determines current data layer pre-coding matrix corresponding with the combination of data Layer has respectively been calculated；Until The number of outer circulation is equal to the number that the corresponding data layer determined in set is matched from alternative multi-user.
Wherein, it is the data Layer for having participated in pre-coding matrix determination to have calculated data Layer.
Preferably, in each outer circulation iterative process, one processing procedure of interior cycle includes：According to it is specified invert result with The product of the conjugate transposition of the channel vector of current data layer, iteration determine that the last one has calculated that data Layer is corresponding to invert As a result with the product of the conjugate transposition of the channel vector of current data layer；And then determine current data layer channel vector, with The last one has calculated the product of data Layer corresponding invert result and the conjugate transposition of the channel vector of current data layer, is multiplied Afterwards plus one inverse.
Wherein, the last one has calculated data Layer and has been adjacent with current data layer and leans on previous data Layer；Specified Result of inverting includes specified initial result and the corresponding result of inverting of computation layer of inverting.
Specifically, inverting corresponding to data Layer has been calculated as a result, its particular content assumes at least one user with calculating Pre-coding matrix algorithm when transmission is related.Used algorithm, determines to have calculated data when according to determining pre-coding matrix The type of result of inverting corresponding to layer.Preferably, when determining pre-coding matrix using least mean-square error MMSE algorithms, really It makes each conjugate transposition for having calculated the aggregated channel matrix corresponding to data Layer and has respectively calculated polymerizeing corresponding to data Layer The product matrix of channel matrix, with interference noise power value do diagonal entry diagonal square matrix and inverse of a matrix matrix, As the result of inverting calculated corresponding to data Layer.Further, in the case where it is 0 to have calculated the data number of plies, number has been calculated According to the inverse matrix that result is diagonal matrix of inverting corresponding to layer.
The processing procedure of cycle two includes inside：(being determined using interior cycle one) being related to according to current data layer Above-mentioned sum of products it is reciprocal and the last one calculated the corresponding result of inverting of data Layer, respectively with respectively calculated data Layer The product of the conjugate transposition of channel vector, determine the corresponding result of inverting of current data layer, respectively with respectively calculated data Layer With the product of the conjugate transposition of the channel vector of current data layer, as current data layer and each combination pair for having calculated data Layer The pre-coding matrix answered.
Preferably, lower mask body introduces the iterative process of interior cycle one.
Inside in cycle one in first time iterative process, according to the channel of specified initial invert result and current data layer The product of the conjugate transposition of vector, determines first channel for having calculated data Layer corresponding invert result and current data layer The product of the conjugate transposition of vector.
Inside the corresponding result of inverting of data Layer has been calculated according to previous in cycle one in subsequent each iterative process With the product of the conjugate transposition of the channel vector of current data layer, determine this calculated data Layer it is corresponding invert result with work as The product of the conjugate transposition of the channel vector of preceding data Layer；Until determining that the last one has calculated the corresponding knot of inverting of data Layer The product of fruit and the conjugate transposition of the channel vector of current data layer terminates interior cycle one.
Further, calculated data Layer for each, according to it is previous calculated data Layer it is corresponding invert result with work as The product of the conjugate transposition of the channel vector of preceding data Layer, and each calculated to prestore are tied among the respective first kind of data Layer Fruit determines that this has calculated the product of data Layer corresponding invert result and the conjugate transposition of the channel vector of current data layer.
Wherein, the first kind intermediate result of data Layer has each been calculated, including：It is previous to have calculated that data Layer is corresponding to be asked Inverse result with this calculated data Layer channel vector conjugate transposition product and previous calculated that data Layer is corresponding to be asked Inverse result, the channel vector that data Layer has been calculated with this and its conjugate transposition add one inverse after being multiplied.
Preferably, calculated data Layer for each, it is previous to have calculated the corresponding result of inverting of data Layer, counted with this The channel vector and its conjugate transposition of calculation data Layer add one inverse after being multiplied, can be specially：This has calculated the letter of data Layer Road vector, it is previous calculated data Layer it is corresponding invert result and this calculated data Layer channel vector conjugate transposition Add one inverse after (this three) multiplications.
More preferably, the above-mentioned sum of products current data layer determined by interior cycle one being related to is reciprocal, as current The first kind intermediate result of data Layer is stored, for determine follow-up data layer the first kind intermediate result when use.
More preferably, by by it is interior cycle two determine the corresponding result of inverting of current data layer, respectively with respectively calculated The product of the conjugate transposition of the channel vector of data Layer and current data layer, as current data layer the second class intermediate result into Row storage, for determine follow-up data layer the second class intermediate result when use.
Further, the first kind intermediate result for each having calculated data Layer is stored when determining following pre-coding matrixes 's：This has calculated data Layer pre-coding matrix corresponding with the combination for having calculated data Layer before this has calculated data Layer.
The last one calculated the corresponding result of inverting of data Layer, respectively with the channel vector for having calculated data Layer each before Conjugate transposition product, calculated the corresponding second class intermediate result of data Layer as the last one, be to determine last A calculated stores when data Layer and the corresponding pre-coding matrix of combination for having calculated data Layer before it.
Fig. 2 a are that iteration is determined to match one of the pre-coding matrix of the data Layer combination of set selected from alternative multi-user The schematic diagram of example.
In Fig. 2 a, in (i+1) outer circulation iterative process, i-th, (i+1) data Layer be respectively that the last one has been calculated Data Layer (having determined that corresponding pre-coding matrix), current data layer (having not determined out corresponding pre-coding matrix) utilize Interior cycle one, iteration determines the corresponding result A that inverts of the i-th data Layeri -1With the conjugation of the channel vector of (i+1) data Layer Transposition hi+1 HProduct Ai -1hi+1 H.(i+1) it is the positive integer more than or equal to 1 and less than or equal to r.
And then determine the conjugate transposition of the i-th data Layer corresponding invert result and the channel vector of (i+1) data Layer Product, with the channel vector h of (i+1) data Layeri+1Add one inverse after multiplication
Specifically, the step of Fig. 2 a one obtain A0 -1hi+1 HIn, it is calculated according to following formula (6)：
A0 -1hi+1 H=Sigma*hi+1 H... ... ... ... ... ... ... (formula 6)
A in above-mentioned formula (6)0 -1Indicate specified initial result of inverting；hi+1 HIt is corresponded to for (i+1) data Layer of input (user's) channel vector；Sigma=1/ σ2, σ2For MMSE weight factors.
Step two and three in interior cycle one, including Fig. 2 a.The step of Fig. 2 a two, calculates Ak+1 -1hi+1 HIn, k+1 be more than Positive integer equal to 1 and less than or equal to i；Interior cycle one needs iteration i times, equal with the sum of data Layer has been calculated.
Each first kind intermediate result for having calculated data Layer is prestored in the first buffer (buffer 1) of Fig. 2 a.It is right The first kind intermediate result of data Layer (has been calculated) in kth, including：The corresponding result of inverting of (k-1) (previous) data Layer Ak-1 -1With the conjugate transposition h of the channel vector of kth data Layerk HProduct Ak-1 -1hk HAnd the channel vector of kth data Layer is total to Yoke transposition hk H, the corresponding result A that inverts of (k-1) data Layerk-1 -1With the channel vector h of kth data LayerkAfter multiplication plus one fall Number
The first kind intermediate result of data Layer (has been calculated) for kth+1, including：Kth (previous) data Layer is corresponding Result of inverting Ak -1With the conjugate transposition h of the channel vector of+1 data Layer of kthk+1 HProduct Ak -1hk+1 HAnd+1 data Layer of kth The conjugate transposition h of channel vectork+1 H, the corresponding result A that inverts of kth data Layerk -1With the channel vector h of+1 data Layer of kthk+1Phase Add one inverse after multiplying
Preferably, according to it is previous calculated the corresponding result of inverting of data Layer (or in Fig. 2 a above-mentioned steps one output As a result it) and in the product of the conjugate transposition of the channel vector of current data layer and the first buffer (buffer 1) prestores each The respective first kind intermediate result of data Layer has been calculated, has determined that this has calculated the corresponding letter of data Layer using following formula (7) The product of the conjugate transposition of road vector：
In the formula (7)It is predetermined；The positive integer that the value range of k+1 is 1 to i.According to Above-mentioned formula (7), can release following result：
It note that current data layer is (i+1) layer, and k+1 is less than or equal to i.
It is first time iteration in interior cycle one, according to the designated noise of the output result as step 1 as k+1=1 Corresponding A0 -1With the conjugate transposition h of the channel vector of current data layeri+1 HProduct A0 -1hi+1 H(in formula 7 first on the right of equal sign ), the first kind intermediate result of the 1st data Layer to prestoreWithAnd can push awayDetermine the corresponding result A that inverts of the 1st data Layer1 -1With the conjugate transposition of the channel vector of current data layerProductFurther, the first kind intermediate result of the 1st data Layer is to determine the 1st data Layer (i.e. the 1st data When layer is current data layer) corresponding pre-coding matrix when, generate and store.
It is second of iteration in interior cycle one, according to the corresponding result of inverting of the 1st (calculating) data Layer as k+1=2 A1 -1hi+1 HWith the conjugate transposition h of the channel vector of current data layeri+1 HProduct A1 -1hi+1 H, the first of the 2nd data Layer to prestore Class intermediate resultWithAnd can push awayIt determines that the 2nd data Layer is corresponding to ask Inverse result A2 -1With the conjugate transposition of the channel vector of current data layerProductFurther, the of the 2nd data Layer A kind of intermediate result is prelisted combination when current data layer (i.e. the 2nd data Layer be) for determining the 1st and 2 data Layers is corresponding When code matrix, generates and store.
As k+1=k, for kth time iteration in interior cycle one, (calculate) that data Layer is corresponding to invert according to (k-1) As a result Ak-1 -1hi+1 HWith the conjugate transposition h of the channel vector of current data layeri+1 HProduct Ak-1 -1hi+1 H, the kth data that prestore The first kind intermediate result of layerWithAnd can push awayDetermine kth number According to the corresponding result A that inverts of layerk -1With the conjugate transposition of the channel vector of current data layerProductFurther, The first kind intermediate result of kth data Layer, be determine the 1st to k data Layers combination (i.e. kth data Layer be current data layer When) corresponding pre-coding matrix when, generate and store.
As k+1=k+1, for+1 iteration of kth in interior cycle one, (calculate) that data Layer is corresponding to invert according to kth As a result Ak -1hi+1 HWith the conjugate transposition h of the channel vector of current data layeri+1 HProduct Ak -1hi+1 H, (k+1) data for prestoring The first kind intermediate result of layerWithAnd can push awayDetermine kth+ The corresponding result A that inverts of 1 data Layerk+1 -1With the conjugate transposition of the channel vector of current data layerProductInto One step, the first kind intermediate result of+1 data Layer of kth, be determine the 1st to (k+1) data Layer combination (i.e.+1 data Layer of kth For current data layer when) corresponding pre-coding matrix when, generate and store.
It is ith (last time) iteration in interior cycle one, according to (i-1)-th (calculating) data Layer when k+1=i The corresponding result A that invertsi-1 -1hi+1 HWith the conjugate transposition h of the channel vector of current data layeri+1 HProduct Ai-1 -1hi+1 H, prestore The i-th data Layer first kind intermediate resultWithAnd can push awayReally Make the corresponding result A that inverts of the i-th data Layeri -1With the conjugate transposition of the channel vector of current data layerProductFurther, the first kind intermediate result of the i-th data Layer, be determine the 1st to i data Layers combination (i.e. the i-th data When layer is current data layer) corresponding pre-coding matrix when, generate and store.
More preferably, Fig. 2 b are the schematic diagram of an example of the decomposition step of the second step in Fig. 2 a, show above-mentioned public affairs Polynomial calculating step on the right of formula (7) equal sign can be divided into 1-4 steps.In step 1Calculating knot Fruit is a numerical value；In step 2Result of calculation be a numerical value；In step 3Result be a vector；Step 4 be a vector subtract another to Amount is equivalent to the add operation of vector.
As can be seen that in the step of Fig. 2 a twoWithAll it is to participate in loop iteration as a whole to calculate , whereinFor vector,For numerical value rather than vector or matrix.Therefore, the interior of the embodiment of the present invention follows The inversion operation of matrix (or vector) it is not related in ring one, the multiplying of matrix (or vector) greatly reduces, computation complexity Relatively low, calculation amount is smaller, and calculating speed is very fast, and efficiency is higher.
Step three in Fig. 2 a includes：According to the output of step 2, the last one has calculated that (i-th) data Layer is corresponding to be asked Inverse result Ai -1With the conjugate transposition of the channel vector of current (i+1) data LayerProductUtilize following formula (8) the channel vector h of current (i+1) data Layer is determinedi+1With the product, be multiplied after result：
In turn, the result after the multiplication acquired according to above-mentioned formula (8)Determine the result after the multiplicationAdd one inverse
More preferably, by the inverseAnd the above-mentioned product of result is exported as step 2Make It is stored in the first buffer (buffer 1) for the first kind intermediate result of current data layer, for determining the number for including follow-up data layer It is used when combining corresponding pre-coding matrix according to layer, specifically for the first kind of determining follow-up data layer (follow-up all data Layers) It is used when intermediate result.
Knot among the second class that the last one has calculated data Layer is prestored in the second buffer (buffer 2) of Fig. 2 a Fruit.For the second class intermediate result of i-th (the last one has been calculated) data Layer, including：The corresponding result of inverting of i-th data Layer Ai -1Conjugate transposition (h with the 1st to the channel vector of i data Layers respectively1 H、…、hk H、hk+1 H、…、hi H) product Ai - 1h1 H、…、Ai -1hk H、Ai -1hk+1 H、…、Ai -1hi H.Further, the last one calculated the corresponding result of inverting of (i-th) data Layer, Respectively with the product of the conjugate transposition of the channel vector for having calculated data Layer each before, as corresponding second class of the i-th data Layer Intermediate result is generated and is stored when determining the corresponding pre-coding matrix of the combination of 1-i data Layers.
Interior cycle two includes the step four in Fig. 2 a.The step of Fig. 2 a four, calculates Ai+1 -1h1 H、…、Ai+1 -1hk H、Ai+1 - 1hk+1 H、…、Ai+1 -1hi+1 HIn, it is reciprocal according to the sum of products in step 2 and the first kind intermediate result of three current data layer, That is the last one product for having calculated data Layer corresponding invert result and the conjugate transposition of the channel vector of current data layerAnd the product be multiplied with the channel vector of current data layer after plus one inverseAnd conduct The last one has calculated the corresponding result A that inverts of the i-th data Layer of data Layeri -1Respectively with respectively calculated data Layer and current number According to the conjugate transposition of the channel vector of any data layer in layerProductUsing following formula (9), determine current The corresponding result A that inverts of data Layeri+1 -1, respectively with the channel that has respectively calculated arbitrary data layer in data Layer and current data layer The conjugate transposition of vectorProduct
In formula (9)It is predetermined；The positive integer that the value range of j is 1 to i.
Preferably, when any value in j=1 to i, according to the last one calculated data Layer it is corresponding invert result with The product of the conjugate transposition of the channel vector of current data layerAnd the channel vector phase of the product and current data layer Add one inverse after multiplyingAnd second A that prestores in bufferi -1h1 H、…、Ai -1hk H、Ai -1hk+1 H、…、Ai -1hi H, using formula (9), determine the corresponding result of inverting of current data layer, respectively with respectively calculated the channel of data Layer to The product A of the conjugate transposition of amounti+1 -1h1 H、…、Ai+1 -1hk H、Ai+1 -1hk+1 H、…、Ai+1 -1hi H。
When making j=i+1, the letter of data Layer corresponding invert result and current data layer has been calculated according to the last one The product of the conjugate transposition of road vectorAnd the product be multiplied with the channel vector of current data layer after plus one inverseAnd predefine outUsing formula (9), determines that current data layer is corresponding and ask Inverse result, the product A with the conjugate transposition of the channel vector of current data layeri+1 -1hi+1 H。
By the corresponding result of inverting of the current data layer determined, respectively with respectively calculated data Layer and current data layer The conjugate transposition h of channel vector1 H、…、hk H、hk+1 H、…、hi+1 HProduct Ai+1 -1h1 H、…、Ai+1 -1hk H、Ai+1 -1hk+1 H、…、 Ai+1 -1hi+1 H, as current data layer pre-coding matrix corresponding with the combination of data Layer has respectively been calculated.
More preferably, Fig. 2 c are the schematic diagram of an example of the decomposition step of four steps in Fig. 2 a, and Fig. 2 c show above-mentioned Polynomial calculating step on the right of formula (9) equal sign can be divided into 1-4 steps.In step 1Calculating knot Fruit is a numerical value；In step 2Result of calculation be a numerical value；In step 3Result be a vector；Step 4 is that a vector subtracts another vector, phase When in the add operation of vector.Further, Ai+1 -1hi+1 HThe A neededi -1hi+1 HObtained in step 3.
As can be seen that in the step of Fig. 2 a fourWithAll it is to participate in loop iteration meter as a whole It calculates,For vector,For numerical value rather than vector or matrix.Therefore, the interior of the embodiment of the present invention follows The inversion operation of matrix (or vector) it is not related in ring one, the multiplying of matrix (or vector) greatly reduces, computation complexity Relatively low, calculation amount is smaller, and calculating speed is very fast, and efficiency is higher.
To obtain current (i+1) data Layer precoding square corresponding with (the 1st to the i) combination of data Layer has respectively been calculated Battle array, i.e., the the 1st to current (i+1) data Layer corresponding pre-coding matrix of combination.
When from the user determined match the data Layer that selects in set be exactly 1 to i+1 data Layer when, obtain (i+1) The precoding vector of all users of data Layer forms the corresponding pre-coding matrix of combination of i+1 data Layer；I+1 data Layer The corresponding pre-coding matrix of combination in corresponding (user's) precoding vector of j-th of data Layer be
More preferably, by current data layer in pre-coding matrix corresponding with the combination of data Layer has respectively been calculated, current data Layer corresponding result of inverting, the respectively product with the conjugate transposition for the channel vector for respectively having calculated data Layer and current data layer, Such as current data layer be i+1 data Layer when, as Ai+1 -1h1 H、…、Ai+1 -1hk H、Ai+1 -1hk+1 H、…、Ai+1 -1hi+1 H, as The corresponding second class intermediate result of current data layer, in storage to the second class buffer (buffer 2), for determining comprising follow-up number It is used when combining corresponding pre-coding matrix according to the data Layer of layer, specifically for the second class intermediate result of determining follow-up data layer When use, further for determine the latter data Layer the second class intermediate result when use.
Preferably, may be used memory for store the first and second class intermediate result.
Preferably, memory can be buffer or other kinds of memory.
Preferably, due to being realized in disparate modules that can be in the base station system of the invention, memory is according to institute of the present invention The difference of realization module in the base station system can be different types of memory.Specifically, the present invention can be in DSP cores The modules such as piece module, MIPS core modules or FPGA are realized.
It is appreciated that directly utilizing pre-stored above-mentioned first kind intermediate result and the second class intermediate result, Ke Yijie The step of saving instant computing first kind intermediate result and the second class intermediate result is conducive to save operand, promotes calculating speed And efficiency.
Later, the pre-coding matrix of the combination for the data Layer determined according to iteration determines user's scheduling result；According to User's scheduling result carries out data transmission to corresponding subscriber terminal equipment.The combination of data Layer is matched selected from alternative multi-user Set.
Specifically, can be that the pre-coding matrix of the combination for using the data Layer determined according to iteration is used as at least Used user dispatches knot when the data transmission of one subscriber channel (channel for distributing at least one subscriber terminal equipment) Pre-coding matrix in fruit.
Can be calculated corresponding based on the pre-coding matrix using the combination for the data Layer determined according to iteration The Modulation and Coding Scheme that Signal to Interference plus Noise Ratio determines, used user's tune when as data transmission at least one subscriber channel Spend the Modulation and Coding Scheme in result.
It can be calculated MU tune based on the pre-coding matrix using the combination for the data Layer determined according to iteration The degrees of data number of plies is as the MU-MIMO transmission data number of plies in user's scheduling result.
Can be calculated MU- based on the pre-coding matrix using the combination for the data Layer determined according to iteration The pairing subscriber channel of MIMO, the pairing subscriber channel as the MU-MIMO transmission in user's scheduling result.
Can be based on the pre-coding matrix using the combination for the data Layer determined according to iteration it is calculated other With the relevant transmission mode of MU-MIMO transmission, as other transmission modes in user's scheduling result.
According to pre-coding matrix, Modulation and Coding Scheme, the MU-MIMO transmission data number of plies, the MU- in user's scheduling result The pairing subscriber channel, and/or other transmission modes of MIMO transmission, to corresponding subscriber terminal equipment (subscriber channel) into line number According to transmission.
Below by taking the pre-coding matrix based on ZF algorithms determines method as an example, for being matched in set selected from alternative multi-user Data Layer combination, specifically introduce iteration determine the data Layer combination pre-coding matrix method.
Specifically, main introduction determines method and based on the precoding square of MMSE algorithms based on the pre-coding matrix of ZF algorithms Battle array determines the difference of method.
When determining pre-coding matrix using broken zero algorithm, determine respectively to have calculated the aggregated channel square corresponding to data Layer The conjugate transposition of battle array is with each product matrix for having calculated the aggregated channel matrix corresponding to data Layer and to do diagonal line element in a small amount Element diagonal square matrix and inverse of a matrix matrix, as the result of inverting calculated corresponding to data Layer.
The pre-coding matrix formula such as above-mentioned formula (1) that ZF algorithms calculate when at least one user is transmitted is described, repeats such as Under：
WZF=HH(HHH)-1... ... ... ... ... ... ... ... (formula 1)
In above-mentioned formula (1), HHThe conjugate transposition (hermit) of representing matrix H, A-1Representing matrix A's is inverse (inversion)。
By the way that a σ is added in the matrix inverted2I so that
WZF≈(σ2I+HHH)-1HH=WMMSE... ... ... ... ... (formula 10)
σ in above-mentioned formula (2)2For a number of very little, I is unit matrix so that the matrix H invertedHH full ranks.This When, seek WZFIt is converted into and seeks WMMSE。
Next concrete operation step determines that method is consistent with the above-mentioned pre-coding matrix based on MMSE algorithms, herein It repeats no more.
Below by taking the pre-coding matrix based on SLNR algorithms determines method as an example, set is matched for being selected from alternative multi-user In data Layer combination, specifically introduce iteration determine the data Layer combination pre-coding matrix method.
Specifically, main introduction determines method and the precoding based on MMSE algorithms based on the pre-coding matrix of SLNR algorithms Matrix determines the difference of method.
When leaking noise ratio SLNR algorithms using minimum letter and determining pre-coding matrix, it is right to determine respectively to have calculated data Layer institute The conjugate transposition for the aggregated channel matrix answered with each product matrix for having calculated the aggregated channel matrix corresponding to data Layer, with Interference noise power value does the diagonal square matrix of diagonal entry and inverse of a matrix matrix, as having calculated corresponding to data Layer It inverts result.
The pre-coding matrix formula such as above-mentioned formula (3) that SLNR algorithms calculate when assuming at least one user's transmission is described, It repeats as follows：
H in formula (3)HThe conjugate transposition (hermit) of representing matrix H, A-1Inverse (inversion) of representing matrix A, The feature vector of eigenvector (A) representing matrixes A, it is unit matrix, σ MMSE that maximum element, I are asked in max () expressions The factor.
At this point for k-th of user, may exist
Wherein norm () indicates vector normalization.The definition of SLNR is utilized in equation (a), and Matrix Calculating is utilized in equation (b) Inverse lemma.For Eigenvalues Decomposition formula USVH=A, when the order of matrix A is 1, the first row of A just obtains after being normalized This point is utilized in the first row of matrix U, equation (c).
As can be seen that SLNR and MMSE is fully equivalent
Following concrete operation step determines that method is consistent with the above-mentioned pre-coding matrix based on MMSE algorithms, herein not It repeats again.
Based on the above-mentioned data transmission method based on user's scheduling, an embodiment of the present invention provides one kind to be dispatched based on user Data transmission device, the block schematic illustration of the internal structure of the device is as shown in figure 3, include：Data Layer combines determining module 301, pre-coding matrix determining module 302 and scheduled transmission module 303.
Wherein, data Layer combination determining module 301 is used for the information of the subscriber terminal equipment based on acquisition, is mostly used from alternative The combination of corresponding data Layer is determined in family pairing set.
Pre-coding matrix determining module 302 determines the pre-coding matrix of the combination of data Layer for iteration.
Scheduled transmission module 303 is used to according to pre-coding matrix determine user's scheduling result, and according to user's scheduling result Carry out data transmission to corresponding subscriber terminal equipment.
Preferably, the information of subscriber terminal equipment, including it is at least one of following：Channel state information, repeat feedback information, Service related information.
Preferably, pre-coding matrix determining module 302 is specifically used in each outer circulation iterative process, it is based on current data The channel vector of layer pre-coding matrix corresponding with the combination of data Layer has respectively been calculated, determines respectively to have calculated data Layer and worked as The corresponding pre-coding matrix of combination of preceding data Layer；It is determined until the number of outer circulation is more than to match in set from alternative multi-user The number of the corresponding data layer gone out terminates outer circulation；Wherein, it is the number for having participated in pre-coding matrix determination to have calculated data Layer According to layer.
Preferably, pre-coding matrix determining module 302 is specifically used for using interior cycle one, according to it is specified invert result with The product of the conjugate transposition of the channel vector of current data layer, iteration determine that the last one has calculated that data Layer is corresponding to invert As a result with the product of the conjugate transposition of the channel vector of current data layer；And then determine the channel of product and current data layer to Amount adds one inverse after being multiplied；The last one has calculated data Layer and has been adjacent with current data layer and leans on previous data Layer； Using interior cycle two, the sum of products that is related to according to current data layer is reciprocal and the last one has calculated that data Layer is corresponding to be asked Inverse result, the respectively product with the conjugate transposition for the channel vector for respectively having calculated data Layer, determine that current data layer is corresponding It inverts result, the respectively product with the conjugate transposition for the channel vector for respectively having calculated data Layer and current data layer, as current Data Layer pre-coding matrix corresponding with the combination of data Layer has respectively been calculated.
Preferably, pre-coding matrix determining module 302 is specifically used in cycle one inside in first time iterative process, according to The product of the conjugate transposition of the channel vector of specified initial invert result and current data layer, determines that first has calculated number According to the product of layer corresponding invert result and the conjugate transposition of the channel vector of current data layer；It is subsequent every in cycle one inside In a iterative process, data Layer has been calculated for each, according to it is previous calculated data Layer it is corresponding invert result with it is current The product of the conjugate transposition of the channel vector of data Layer determines that this has calculated corresponding result and the current data of inverting of data Layer The product of the conjugate transposition of the channel vector of layer；Until determine the last one calculated data Layer it is corresponding invert result with work as The product of the conjugate transposition of the channel vector of preceding data Layer terminates interior cycle one.
Preferably, pre-coding matrix determining module 302 is specifically used for having calculated that data Layer is corresponding to invert according to previous As a result with the product of the conjugate transposition of the channel vector of current data layer, and what is prestored each calculated data Layer respective first Class intermediate result determines that this has calculated the conjugate transposition of data Layer corresponding invert result and the channel vector of current data layer Product；Wherein, the first kind intermediate result of data Layer has each been calculated, including：It is previous to have calculated that data Layer is corresponding to be asked Inverse result with this calculated data Layer channel vector conjugate transposition product and previous calculated that data Layer is corresponding to be asked Inverse result, the channel vector that data Layer has been calculated with this and its conjugate transposition add one inverse after being multiplied.
Preferably, pre-coding matrix determining module 302 is specifically used for having calculated data Layer for kth+1, according to as preceding The corresponding result A that inverts of one kth data Layer for having calculated data Layerk -1And the i+1 data Layer as current data layer The conjugate transposition of channel vectorProductAnd previous the corresponding result A that inverts of data Layer is calculatedk -1With this The conjugate transposition of the channel vector of data Layer is calculatedProductCalculate that data Layer is corresponding to be asked with previous Inverse result Ak -1And this has calculated the channel vector h of data Layerk+1And its conjugate transpositionAdd one inverse after multiplicationDetermine that this has calculated the corresponding result A that inverts of data Layer using above-mentioned formula (7)k+1 -1With current data The conjugate transposition of the channel vector of layerProductIn formula (7)It is predetermined；K+1's Value range is 1 to i.
Preferably, pre-coding matrix determining module 302 is specifically used for according to the i+1 data Layer as current data layer ProductAnd inverseAnd the i-th data Layer of data Layer has been calculated as the last one and corresponding has been asked Inverse result Ai -1Respectively with the conjugate transposition that has respectively calculated the channel vector of any data layer in data Layer and current data layer ProductUsing above-mentioned formula (9), the corresponding result A that inverts of current data layer is determinedi+1 -1, respectively with respectively counted Calculate the conjugate transposition of the channel vector of arbitrary data layer in data Layer and current data layerProductIn formula (9)It is predetermined；The value range of j is 1 to i+1.
Preferably, pre-coding matrix determining module 302 is additionally operable to relate on the current data layer determined by interior cycle one And sum of products it is reciprocal, the first kind intermediate result as current data layer is stored, for determining the first of follow-up data layer It is used when class intermediate result；By by it is interior cycle two determine the corresponding result of inverting of current data layer, respectively with respectively counted Calculate the product of the conjugate transposition of the channel vector of data Layer and current data layer, the second class intermediate result as current data layer Stored, for determine follow-up data layer the second class intermediate result when use.
Preferably, pre-coding matrix determining module 302 is additionally operable to according to used algorithm when determining pre-coding matrix, really Make the type for having calculated the result of inverting corresponding to data Layer.
Preferably, pre-coding matrix determining module 302 is specifically used for when determining pre-coding matrix using broken zero algorithm, really It makes each conjugate transposition for having calculated the aggregated channel matrix corresponding to data Layer and has respectively calculated polymerizeing corresponding to data Layer The product matrix of channel matrix, with the diagonal square matrix to do diagonal entry in a small amount and inverse of a matrix matrix, as having calculated Result of inverting corresponding to data Layer；When leaking noise using least-mean-square error algorithm or minimum letter precoding is determined than algorithm When matrix, determine respectively to have calculated the conjugate transposition of aggregated channel matrix corresponding to data Layer with it is each calculated data Layer it is right The product matrix for the aggregated channel matrix answered, with diagonal square matrix that diagonal entry is done with interference noise power value and matrix Inverse matrix, as the result of inverting calculated corresponding to data Layer.
Above-mentioned data Layer combination determining module 301,303 function of pre-coding matrix determining module 302 and scheduled transmission module Implementation method, can with parameter it is above-mentioned based on user scheduling data transmission method particular content, details are not described herein again.
Fig. 4 is that existing pre-coding matrix determines that method determines that method carries out comparison in fact with the pre-coding matrix in the present invention The schematic diagram for the example tested.
It is assumed that antenna for base station number is NT, i-th layer in calculating the data Layer for matching set selected from alternative multi-user and combining Data Layer needs general 2i (i with clock synchronization using the precoding algorithms of most common Cholesky decomposition methods2-1)/3+(6i2+ 2i)NTSecondary real multiplications.The number of the corresponding real multiplications of Cholesky decomposition methods, there are 2-3 powers between the data number of plies Relationship.
And the corresponding complexity of the present invention is about (16i-8) NTSecondary real multiplications, the number and data Layer of real multiplications It is linear relationship between number.It can be seen that the present invention determines pre-coding matrix compared to the technical solution based on Cholesky decomposition methods Complexity substantially reduce.
The base station that Fig. 4 show 64 transmission antennas and 16 data Layers uses the side of Cholesky decomposition methods and this programme Multiplication number comparison between the matrix (vector) of method.In the process for determining the corresponding pre-coding matrix of first layer data Layer In, this programme can reduce by 11.3% complexity, and when calculating to totally 16 layer data layer, this programme can reduce by 78.3% complexity Degree, effect is clearly.
Those skilled in the art of the present technique are appreciated that the present invention includes being related to for executing in operation described herein One or more equipment.These equipment can specially be designed and be manufactured for required purpose, or can also include general Known device in computer.These equipment have the computer program being stored in it, these computer programs are selectively Activation or reconstruct.Such computer program can be stored in equipment (for example, computer) readable medium or be stored in It e-command and is coupled to respectively in any kind of medium of bus suitable for storage, the computer-readable medium includes but not Be limited to any kind of disk (including floppy disk, hard disk, CD, CD-ROM and magneto-optic disk), ROM (Read-Only Memory, only Read memory), RAM (Random Access Memory, immediately memory), EPROM (Erasable Programmable Read-Only Memory, Erarable Programmable Read only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory, Electrically Erasable Programmable Read-Only Memory), flash memory, magnetic card or light card Piece.It is, readable medium includes by any Jie of equipment (for example, computer) storage or transmission information in the form of it can read Matter.
Those skilled in the art of the present technique be appreciated that can with computer program instructions come realize these structure charts and/or The combination of each frame and these structure charts and/or the frame in block diagram and/or flow graph in block diagram and/or flow graph.This technology is led Field technique personnel be appreciated that these computer program instructions can be supplied to all-purpose computer, special purpose computer or other The processor of programmable data processing method is realized, to pass through the processing of computer or other programmable data processing methods Device come execute structure chart and/or block diagram and/or flow graph disclosed by the invention frame or multiple frames in specify scheme.
Those skilled in the art of the present technique are appreciated that in the various operations crossed by discussion in the present invention, method, flow Steps, measures, and schemes can be replaced, changed, combined or be deleted.Further, each with having been crossed by discussion in the present invention Other steps, measures, and schemes in kind operation, method, flow may also be alternated, changed, rearranged, decomposed, combined or deleted. Further, in the prior art to have and step, measure, the scheme in various operations, method, flow disclosed in the present invention It may also be alternated, changed, rearranged, decomposed, combined or deleted.
The above is only some embodiments of the present invention, it is noted that for the ordinary skill people of the art For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered It is considered as protection scope of the present invention.

Claims (13)

1. a kind of data transmission method based on user's scheduling, which is characterized in that including：
The information of subscriber terminal equipment based on acquisition matches the group that corresponding data Layer is determined in set from alternative multi-user It closes；
Iteration determines the pre-coding matrix of the combination of the data Layer；
User's scheduling result is determined according to the pre-coding matrix, and according to user's scheduling result to corresponding user terminal Equipment carries out data transmission.
2. according to the method described in claim 1, it is characterized in that, the iteration determines prelisting for the combination of the data Layer Code matrix, including：
In each outer circulation iterative process, channel vector and each combination for having calculated data Layer based on current data layer correspond to Pre-coding matrix, determine respectively to have calculated the corresponding pre-coding matrix of combination of data Layer and current data layer；Until following outside The number of ring is equal to the number that the corresponding data layer determined in set is matched from the alternative multi-user, terminates to follow outside described Ring；
Wherein, the data Layer that calculated is the data Layer for having participated in pre-coding matrix determination.
3. according to the method described in claim 2, it is characterized in that, in each outer circulation iterative process, it is based on current number Calculated the corresponding pre-coding matrix of the combination of data Layer with each according to the channel vector of layer, determine current data layer and it is each The corresponding pre-coding matrix of combination of data Layer is calculated, including：
Each outer circulation iterative process, including interior cycle one and interior cycle two；
It is described it is interior cycle one processing procedure include：According to the conjugation of specified invert result and the channel vector of current data layer The product of transposition, iteration determine that the last one has calculated the channel vector of data Layer corresponding invert result and current data layer Conjugate transposition product；And then determine to add after the channel vector of current data layer is multiplied with the product one inverse；Institute It is adjacent with current data layer and by previous data Layer to state the last one and calculated data Layer；
It is described it is interior cycle two processing procedure include：The sum of products being related to according to current data layer it is reciprocal and last It is a to have calculated the corresponding result of inverting of data Layer, the respectively product with the conjugate transposition for the channel vector for respectively having calculated data Layer, It determines the corresponding result of inverting of current data layer, be total to respectively with the channel vector that has respectively calculated data Layer and current data layer The product of yoke transposition, as current data layer pre-coding matrix corresponding with the combination of data Layer has respectively been calculated.
4. according to the method described in claim 3, it is characterized in that, invert result and current data layer that the basis is specified The product of the conjugate transposition of channel vector, iteration determine that the last one has calculated corresponding result and the current number of inverting of data Layer According to the product of the conjugate transposition of the channel vector of layer, including：
Inside in cycle one in first time iterative process, according to the channel vector of specified initial invert result and current data layer Conjugate transposition product, determine first channel vector for having calculated data Layer corresponding invert result and current data layer Conjugate transposition product；
Data Layer has been calculated for each, number has been calculated according to previous in subsequent each iterative process in cycle one inside According to the product of layer corresponding invert result and the conjugate transposition of the channel vector of current data layer, determine that this has calculated data Layer The product of corresponding invert result and the conjugate transposition of the channel vector of current data layer；Until determining that the last one has been calculated The product of data Layer corresponding invert result and the conjugate transposition of the channel vector of current data layer, terminates the interior cycle one.
5. according to the method described in claim 4, it is characterized in that, described calculated that data Layer is corresponding to invert according to previous As a result with the product of the conjugate transposition of the channel vector of current data layer, determine that this has calculated the corresponding result of inverting of data Layer With the product of the conjugate transposition of the channel vector of current data layer, including：
Multiplying for data Layer corresponding invert result and the conjugate transposition of the channel vector of current data layer has been calculated according to previous Product, and prestore it is each calculated the respective first kind intermediate result of data Layer, determine that this has calculated that data Layer is corresponding to be asked The product of inverse result and the conjugate transposition of the channel vector of current data layer；
Wherein, the first kind intermediate result of data Layer has each been calculated, including：It is previous to have calculated the corresponding knot of inverting of data Layer Fruit with this calculated data Layer channel vector conjugate transposition product and previous calculated the corresponding knot of inverting of data Layer Fruit, the channel vector that data Layer has been calculated with this and its conjugate transposition add one inverse after being multiplied.
6. according to the method described in claim 3, it is characterized in that, further including：
The sum of products that the current data layer determined by interior cycle one is related to is reciprocal, and first as current data layer Class intermediate result is stored, for determine follow-up data layer the first kind intermediate result when use；
By by the interior two current data layer determined of cycle it is corresponding invert result respectively with respectively calculated data Layer and currently The product of the conjugate transposition of the channel vector of data Layer, the second class intermediate result as current data layer is stored, for true It is used when the second class intermediate result for determining follow-up data layer.
7. according to the method described in claim 5, it is characterized in that, described calculated that data Layer is corresponding to invert according to previous As a result with the product of the conjugate transposition of the channel vector of current data layer, and what is prestored each calculated data Layer respective first Class intermediate result determines that this has calculated the conjugate transposition of data Layer corresponding invert result and the channel vector of current data layer Product, including：
Data Layer is calculated for kth+1, according to as the corresponding result of inverting of the previous kth data Layer for having calculated data Layer Ak -1And the conjugate transposition of the channel vector of the i+1 data Layer as current data layerProductAnd it is previous It is a to have calculated the corresponding result A that inverts of data Layerk -1With the conjugate transposition of the channel vector for having calculated data LayerProductThe corresponding result A that inverts of data Layer has been calculated with previousk -1And this has calculated the channel vector h of data Layerk+1And Its conjugate transpositionAdd one inverse after multiplicationDetermine that this has calculated data using following formula (7) The corresponding result A that inverts of layerk+1 -1With the conjugate transposition of the channel vector of current data layerProduct
In the formula (7)It is predetermined；The positive integer that the value range of k+1 is 1 to i；
And channel vector that is described and then determining current data layer be multiplied with the product after plus one inverse, including：
Using following formula (8), the channel vector h of current data layer is determinedi+1, calculated that data Layer is corresponding to be asked with kth+1 The product of inverse result and the conjugate transposition of the channel vector of current data layerResult after multiplication
Determine the inverse that the result after the multiplication adds one
8. the method according to the description of claim 7 is characterized in that described fall according to the sum of products that current data layer is related to Number and the last one calculated the corresponding result of inverting of data Layer, be total to respectively with the channel vector that has respectively calculated data Layer The product of yoke transposition, determine the corresponding result of inverting of current data layer, respectively with respectively calculated data Layer and current data layer Channel vector conjugate transposition product, including：
According to the product of the i+1 data Layer as current data layerAnd inverseAnd conduct The last one has calculated the corresponding result A that inverts of the i-th data Layer of data Layeri -1Respectively with respectively calculated data Layer and current number According to the conjugate transposition of the channel vector of any data layer in layerProductUsing following formula (9), determine current The corresponding result A that inverts of data Layeri+1 -1, respectively with respectively calculated the channel of arbitrary data layer in data Layer and current data layer to The conjugate transposition of amountProduct
In formula (9)It is predetermined；The positive integer that the value range of j is 1 to i+1.
9. according to the method described in claim 8, it is characterized in that, further including：
The last one determined by formula (7) as k+1=i the corresponding result A that inverts of data Layer has been calculated intoi -1With work as The conjugate transposition of the channel vector of preceding data LayerProductAnd after the multiplication determined based on formula (8) ResultThrough the inverse for adding oneFirst kind intermediate result as current data layer is deposited Storage, for determine follow-up data layer the first kind intermediate result when use；
By the corresponding result A that inverts of the current data layer determined by formula (9)i+1 -1Respectively with respectively calculated data Layer and worked as The conjugate transposition of the channel vector of preceding data LayerProductWherein j=1 ..., i+1, as current data layer Second class intermediate result is stored, for determine follow-up data layer the second class intermediate result when use.
10. according to claim 1-9 any one of them methods, which is characterized in that further include：
Used algorithm when the pre-coding matrix according to determination determines the knot of inverting calculated corresponding to data Layer The type of fruit.
11. according to the method described in claim 10, it is characterized in that, when pre-coding matrix according to determination used Algorithm, determine the type for having calculated the result of inverting corresponding to data Layer, including：
When determining the pre-coding matrix using broken zero algorithm, determine respectively to have calculated the aggregated channel square corresponding to data Layer The conjugate transposition of battle array is with each product matrix for having calculated the aggregated channel matrix corresponding to data Layer and to do diagonal line element in a small amount Element diagonal square matrix and inverse of a matrix matrix, as the result of inverting calculated corresponding to data Layer；
When determining the pre-coding matrix than algorithm using least-mean-square error algorithm or minimum letter leakage noise, determine each The conjugate transposition of the aggregated channel matrix corresponding to data Layer and each aggregated channel square calculated corresponding to data Layer are calculated Battle array product matrix, with interference noise power value do diagonal entry diagonal square matrix and inverse of a matrix matrix, as institute State the result of inverting calculated corresponding to data Layer.
12. according to claim 1-11 any one of them methods, which is characterized in that the information of the subscriber terminal equipment, packet It includes at least one of following：
Channel state information, repeat feedback information, service related information.
13. a kind of data transmission device based on user's scheduling, which is characterized in that including：
Data Layer combines determining module, is used for the information of the subscriber terminal equipment based on acquisition, matches and gathers from alternative multi-user In determine the combination of corresponding data Layer；
Pre-coding matrix determining module determines the pre-coding matrix of the combination of the data Layer for iteration；
Scheduled transmission module for determining user's scheduling result according to the pre-coding matrix, and is dispatched according to the user and is tied Fruit carries out data transmission to corresponding subscriber terminal equipment.
CN201710087367.5A 2017-02-17 2017-02-17 Data transmission method and device based on user's scheduling Pending CN108462518A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710087367.5A CN108462518A (en) 2017-02-17 2017-02-17 Data transmission method and device based on user's scheduling

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710087367.5A CN108462518A (en) 2017-02-17 2017-02-17 Data transmission method and device based on user's scheduling

Publications (1)

Publication Number Publication Date
CN108462518A true CN108462518A (en) 2018-08-28

Family

ID=63228919

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710087367.5A Pending CN108462518A (en) 2017-02-17 2017-02-17 Data transmission method and device based on user's scheduling

Country Status (1)

Country Link
CN (1) CN108462518A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111954306A (en) * 2020-07-08 2020-11-17 北京瀚诺半导体科技有限公司 Hybrid transmission method and system based on time slot and packet scheduling
CN112311430A (en) * 2019-07-23 2021-02-02 三星电子株式会社 Method for generating precoder in multi-user multiple-input and multiple-output communication system

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112311430A (en) * 2019-07-23 2021-02-02 三星电子株式会社 Method for generating precoder in multi-user multiple-input and multiple-output communication system
CN112311430B (en) * 2019-07-23 2024-09-03 三星电子株式会社 Method for generating precoder in multi-user multiple input and multiple output communication system
CN111954306A (en) * 2020-07-08 2020-11-17 北京瀚诺半导体科技有限公司 Hybrid transmission method and system based on time slot and packet scheduling
CN111954306B (en) * 2020-07-08 2024-02-27 北京瀚诺半导体科技有限公司 Hybrid transmission method and system based on time slot and packet scheduling

Similar Documents

Publication Publication Date Title
KR101005876B1 (en) A method and system for beamforming in a multiple user multiple input multiple output mimo communication system using a codebook
US20160105226A1 (en) Methods for Opportunistic Multi-User Beamforming in Collaborative MIMO-SDMA
JP5620521B2 (en) Channel state information feedback method and system
CN111800172B (en) Communication method and device
US20230412430A1 (en) Inforamtion reporting method and apparatus, first device, and second device
JP2012533952A (en) Precoding method for transmitter of MU-MIMO communication system
CN107222244A (en) A kind of reporting channel information method, apparatus and system
EP4092919A1 (en) Method and apparatus for transmitting information
CN107078772A (en) The network processes that the CSI degrees of accuracy are perceived
Zhao et al. Communication-efficient decentralized linear precoding for massive MU-MIMO systems
JP5507001B2 (en) Conversion device and method
CN102725991A (en) F eedback method and system of correlation matrix for antenna array
JP2013214967A (en) Transmission filter calculator, communication device, and method
CN108462518A (en) Data transmission method and device based on user's scheduling
CN101729460A (en) Multi-user precoding method and device
CN101621306A (en) Mapping method and device for multiple-input multiple-output system precoding matrix
CN101572581A (en) Method and device for confirming signal-interference-noise radio
Liu et al. Deep learning driven non-orthogonal precoding for millimeter wave communications
CN102468932B (en) The channel quality estimation method of multiuser mimo system and subscriber equipment
CN111130606B (en) Pre-coding method and device based on power distribution
CN116939649A (en) Channel characteristic information transmission method and device, terminal and network side equipment
CN106817720B (en) A kind of method and device obtaining channel information
US20240313832A1 (en) Port selection with low complexity
Maciel‐Barboza et al. User Selection Algorithms for MU‐MIMO Systems with Coordinated Beamforming
CN110268768A (en) Method and network node for scheduling

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20180828