CN101790237B - Space division multiplexing method of shared channel in multichannel HSUPA system - Google Patents

Space division multiplexing method of shared channel in multichannel HSUPA system Download PDF

Info

Publication number
CN101790237B
CN101790237B CN2009100778801A CN200910077880A CN101790237B CN 101790237 B CN101790237 B CN 101790237B CN 2009100778801 A CN2009100778801 A CN 2009100778801A CN 200910077880 A CN200910077880 A CN 200910077880A CN 101790237 B CN101790237 B CN 101790237B
Authority
CN
China
Prior art keywords
scheduling
puch
passage
hich
current
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN2009100778801A
Other languages
Chinese (zh)
Other versions
CN101790237A (en
Inventor
魏立梅
佟学俭
邢立军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
TD Tech Ltd
Original Assignee
TD Tech 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 TD Tech Ltd filed Critical TD Tech Ltd
Priority to CN2009100778801A priority Critical patent/CN101790237B/en
Publication of CN101790237A publication Critical patent/CN101790237A/en
Application granted granted Critical
Publication of CN101790237B publication Critical patent/CN101790237B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a space division multiplexing method of a shared channel in a multichannel HSUPA system, comprising the following steps: presetting the timing relationship among the dispatched E-AGCH, E-PUCH and E-HICH; determining the channel on which each UE is located and the dispatching priority of each UE according to the receiving signals of each UE uplink channel; according to the priority from high to low, allocating the dispatched E-AGCH resources, E-PUCH resources and E-HICH resources for each UE, wherein any one of the E-AGCH resources, E-PUCH resources or E-HICH resources is allowed to be allocated to N numbered different channels, and each channel only can be allocated once; and performing corresponding channel data transmission on own channels of each UE according to the allocated channel resources in terms of the timing relationship. By using the invention, frequency spectrum resource utilization rate can be improved.

Description

The space division multiplexing method of shared channel in a kind of multichannel HSUPA system
Technical field
The present invention relates to the channel multiplexing technology, the space division multiplexing method of shared channel in particularly a kind of multichannel HSUPA system.
Background technology
In HSUPA, there is uplink transport channel E-DCH (EnhancedDCH) and five Physical Shared Channel that HSUPA is proprietary: E-RUCCH (E-DCH RandomAccess Uplink Control Channnel), E-PUCH (E-DCH Physical Uplink Channel), E-UCCH (E-DCH Uplink Control Channel), E-AGCH (E-DCH Absolute GrantChannnel) and an E-HICH (E-DCH Hybrid Indication Channel) that HSUPA is proprietary.Wherein, E-RUCCH, E-PUCH and E-UCCH are uplink physical channels.E-AGCH and E-HICH are down physical channels.E-PUCH is divided into the E-PUCH of scheduling and the E-PUCH of non-scheduling.E-HICH is divided into the E-HICH of scheduling and the E-HICH of non-scheduling.
The E-PUCH channel has characteristics that are different from any other uplink physical channel: when distributing the E-PUCH channel to UE, not only need confirm the channel code resource of this channel occupancy, also need confirm the power mandate of this channel.In the HSUPA system, the E-PUCH channel that the purpose of the power mandate of E-PUCH channel is to be limited in each all UE of ascending time slot of each subframe that this channel occurs is no more than a threshold value that is provided with in advance in the interference that the transmitting power of this ascending time slot of this subframe causes adjacent sub-district.This threshold value is called as this adjacent cells of cells HSUPA interference margins.
Shared channel described in the application does not relate to the E-PUCH of non-scheduling and the E-HICH of non-scheduling.
For a UE, the E-PUCH channel of the scheduling of this UE is disposed by NodeB.This UE has the E-DCH of a unique scheduling type.This E-DCH goes up the HSUPA data of the scheduling type that carries this UE.The last data of E-DCH through chnnel coding, interweave, rate-matched and physical channel mapping and E-UCCH go up through the later bit of chnnel coding and be multiplexed into together on the E-PUCH of this UE, becomes the bit stream on the E-PUCH.The last bit stream of E-PUCH is sent to NodeB through ovennodulation, spread spectrum and scrambling through the E-PUCH channel.E-UCCH is a control channel, and the data on this channel are decided by UE, and NodeB uses the data on this channel to confirm that E-DCH deciphers needed whole parameter.When UE had the E-DCH data of scheduling type to give NodeB through the E-PUCH Channel Transmission of scheduling, UE gave NodeB with the SYNC-UL sequence of the E-PUCH resource bid that transmission is used to dispatch.NodeB receives after this SYNC-UL sequence, can power control information and the synchronically controlling information of this UE be sent to UE through the FPACH channel.UE can send E-RUCCH and give NodeB after receiving FPACH.Through E-RUCCH, UE sends to NodeB with data volume, power headroom and Serving cell to be sent on the ID that oneself needs total amount, highest priority logical channel through the data of the E-PUCH Channel Transmission of dispatching, the highest priority logical channel and path loss ratio (SNPL) information of adjacent sub-district.NodeB confirms to dispatch when this UE according to the above-mentioned information of UE, and in this UE of scheduling, confirms to distribute to the E-PUCH channel of the scheduling of this UE: the channel code resource of E-PUCH channel, the power mandate of E-PUCH and E-PUCH go up the number of E-UCCH.
RNC can be each E-PUCH resource pool of supporting this sub-district of cell configuration of HSUPA, and this resource pool comprises: the E-PUCH resource of scheduling and the E-PUCH resource of non-scheduling.RNC can be the E-HICH of some E-AGCH of each HSUPA cell configuration and some scheduling.Each HSUPA UE has the E-HICH set of an E-AGCH set and a scheduling.Comprise four E-AGCH at most in the E-AGCH set of this UE.For each HSUPA UE, NodeB will dispose to the E-AGCH that selects to belong to this UE its E-AGCH for this UE from RNC, and selecteed E-AGCH constitutes the E-AGCH set of this UE.The E-HICH that comprises four scheduling in the E-HICH set of the scheduling of this UE at most.For each HSUPA UE, NodeB will dispose to the E-HICH that selects to belong to the scheduling of this UE its E-HICH of scheduling for this UE from RNC, and the E-HICH of selecteed scheduling constitutes the E-HICH set of the scheduling of this UE.NodeB reports RNC with the E-AGCH set of each HSUPA UE and the E-HICH set of scheduling, and RNC then gives UE with the E-AGCH set of UE and the E-HICH set of scheduling through Uu message order configuration.
The scheduler of NodeB is once dispatched in each subframe, and all have been applied for the E-PUCH resource of scheduling before and had E-PUCH data UE waiting for transmission all will be included in the ranks of the UE that needs scheduling in this scheduling beginning through SYNC-UL and E-RUCCH when each scheduling.At each subframe " n ", the scheduler of NodeB is dispatched based on following sub-district HSUPA resource, and in a single day the part in these HSUPA resources is assigned to a UE, just can not reallocate to other UE.
1) the K1 bar E-AGCH of this cell configuration
2) E-HICH of the K2 bar of this cell configuration scheduling
3) the E-PUCH resource pool of the scheduling of this sub-district: the channel resource that E-PUCH that will non-scheduling in current subframe " n " from the E-PUCH resource pool of RNC configuration occupies forecloses, and just obtains the E-PUCH resource pool in current subframe " n " scheduling;
4) adjacent sub-district HSUPA interference margins: when current subframe " n " begins to dispatch; This neighbour sub-district HSUPA interference margins is initialized to the threshold value that is provided with in advance; The E-PUCH channel of any UE allocation schedule is not also given in expression at present, and the interference that this E-PUCH channel causes adjacent sub-district is " 0 ";
At each subframe " n ", when the scheduler of NodeB begins each UE dispatched, need know the following information of each UE:
1) the scheduling E-HICH set of the E-AGCH of each UE set and each UE
2) information that reports through E-RUCCH of each UE: the data volume on data total amount, highest priority logical channel ID, the highest priority logical channel, the power headroom of UE and SNPL value; When the E-PUCH data block transmitted of the scheduling of UE through distributing to this UE is correctly received by NodeB, NodeB will upgrade the data total amount of this UE: from the data total amount that this UE reports with this UE the data volume of correct transmission cut; NodeB also will upgrade the data volume on the highest priority logical channel of this UE: will be cut by the data volume on correct this logic channel that receives of NodeB the data volume of the highest priority logical channel that reports from this UE;
3) the HSUPA ability grade of this UE: other HSUPA UE of each grade is difference to some extent on the size of the maximum number of time slot of the E-PUCH that can support and data block;
4) the reference table β table of each UE under the QPSK modulation: this form provides between effective code check and the power gain and concerns;
5) each can support the reference table β table of UE under the 16QAM modulation of 16QAM modulation: this form provides the relation between effective code check and the power gain;
6) scheduling parameter of other these UE: distribution competition priority (ARP) parameter of this UE and dispatching priority indication (SPI) parameter, these parameters can be used to confirm the dispatching priority of this UE;
At each subframe " n ", the scheduler of NodeB calculates the dispatching priority of each UE, and according to dispatching priority order from high to low UE is lined up; Begin to dispatch UE from the highest UE of priority then.After a UE is scheduled, just from priority list, this UE is deleted, begin to dispatch next UE.When not having available E-AGCH channel or do not have available E-HICH channel or do not have the HSUPA interference margins of available E-PUCH resource or adjacent sub-district to equal " 0 ", just finish the scheduling process of current subframe.
Here, if an E-AGCH of sub-district has been assigned to a UE, then this E-AGCH is exactly disabled E-AGCH; If an E-HICH of sub-district has been assigned to a UE, then this E-HICH is exactly disabled E-HICH; If the E-PUCH resource pool of the scheduling of sub-district has not comprised any channel resource, then this sub-district does not just have available E-PUCH resource.
At current subframe " n ", the scheduler of NodeB need be confirmed following parameter for this UE that is scheduled when any UE of scheduling:
1) the HSUPA UE ID of this UE
2) from the available E-AGCH of sub-district, select an E-AGCH, this selecteed E-AGCH must be in the E-AGCH of this UE set, and this selecteed E-AGCH is exactly the E-AGCH as the scheduling of this UE; Select an E-HICH the E-HICH of the scheduling that can use from the sub-district; This selecteed E-HICH must be in the E-HICH of the scheduling of this UE set; This selecteed E-HICH is exactly the E-HICH of the scheduling of this UE, and the number of this E-HICH E-AGCH through the scheduling of this UE is sent to UE.Here, when first UE was scheduled, all K1 bar E-AGCH were available E-AGCH in the sub-district; When first UE was scheduled, all K2 bar E-HICH were available E-HICH in the sub-district.
3) from the E-PUCH resource pool of scheduling, select the E-PUCH of a part of channel resource as the scheduling of this UE; Confirm the power mandate of E-PUCH of the scheduling of this UE according to adjacent sub-district HSUPA interference margins, and confirm that based on the target SNR of E-UCCH this E-PUCH goes up the number of the E-UCCH that carries.The power mandate of this E-PUCH is confirmed according to following three criterions:
● need to guarantee that UE can not be surpassed the maximum transmission power of UE by the transmitting power of the definite E-PUCH of this power mandate
● need to guarantee that the interference by the E-PUCH transmitting power that this power mandate is confirmed causes adjacent sub-district can not surpass adjacent sub-district HSUPA interference margins
● under the prerequisite that satisfies above-mentioned two conditions, make the power mandate of this UE big as far as possible to send the data of this UE as much as possible.
The parameters such as received power of the HSUPA interference margins of power headroom that the E-PUCH power mandate of satisfying above-mentioned three criterions is reported through E-RUCCH by this UE and SNPL value, this sub-district and the E-PUCH of UE confirm that concrete grammar can be consulted existing document.
The number of time slot that the node that the channel resource that the E-PUCH channel of this UE adopts is adopted by this E-PUCH and this E-PUCH take and the number of each time slot are confirmed.According to the standard of 3GPP, node number from 0 to 31, the channel code of the spreading factor that each node is corresponding unique and unique this spreading factor of employing.The number of time slot that the E-PUCH of UE takies can not surpass the number of time slot of maximum of the HSUPA ability grade regulation of this UE.Particularly, the channel resource of the E-PUCH channel of this UE employing is confirmed by following parameter:
● the data volume of this UE, the data volume of highest priority logical channel
● the HSUPA ability grade of this UE: distribute to the shared time slot of the E-PUCH of this UE can not surpass this UE the maximum number of time slot that can support, the maximum data piece that the data block of transmission can not can be sent greater than this UE
● the reference ginseng β table under the QPSK modulation of this UE: spreading factor that the power mandate that under employing QPSK modulation system, utilizes this table can calculate this UE can be supported and corresponding effectively code check
● for the UE that supports the 16QAM modulation, the reference ginseng β table under the 16QAM of this UE modulation: adopting under the 16QAM modulation system spreading factor that the power mandate that utilizes this table can calculate this UE can be supported and corresponding effectively code check
The method of confirming number of time slot that E-PUCH is shared and node according to above-mentioned parameter is a lot, can consult existing document.Owing to confirm that based on E-PUCH resource pool and adjacent area interference surplus channel resource and the method for power mandate of E-PUCH of the scheduling of UE is not content of the present invention, repeat no more here.
4) confirm the data on the E-AGCH of the scheduling of this UE, transmitted: E-DCH control information, this information are used for confirming the E-PUCH of its scheduling by UE; And be used for confirming the timing relationship between the E-HICH of E-PUCH and scheduling of scheduling of this UE; Be used for confirming the E-HICH of scheduling.
5) timing relationship between the E-PUCH of the E-AGCH of scheduling and scheduling is confirmed, if the E-AGCH of scheduling sends in the n+d1 subframe, then the E-PUCH of scheduling sends in the n+d1+d2 subframe; Here, d1 representes the processing delay of NodeB; D2 representes the timing difference between E-AGCH and the E-PUCH, according to 3GPP standard, d2=2;
6) confirm timing relationship between the E-HICH of scheduling of E-PUCH and this UE of scheduling of this UE: if the E-PUCH of scheduling sends in the n+d1+d2 subframe, then the E-HICH of scheduling sends in the n+d1+d2+d3 subframe; Here, d3 representes the timing difference between E-PUCH and the E-HICH.According to the 3GPP standard, N at least at interval between the E-PUCH of scheduling and the E-HICH of scheduling E-HICHIndividual time slot, N E-HICHThe disposal ability that is decided by NodeB, this value report RNC after being confirmed by NodeB, and RNC should value send to UE through the order of Uu message, and therefore, NodeB and UE can be according to subframe number and the N of E-PUCH E-HICHConfirm the E-HICH subframe number " n+d1+d2+d3 " of scheduling.
7) after this UE is successfully dispatched, the HSUPA resource of sub-district will be updated.Will be when next UE is scheduled based on the HSUPA resource of cell update; That is: the HSUPA resource of sub-district can be distributed between the UE of scheduling; But in case the part in the HSUPA resource of sub-district is distributed to a UE, this resource just belongs to this UE, can not reallocate to other UE.
● the E-AGCH that this sub-district can be used: delete in the middle of the E-AGCH that the E-AGCH that the UE that is scheduled is adopted can use from the sub-district;
● the E-HICH that this sub-district can be used: delete in the middle of the E-HICH that the E-HICH that the UE that is scheduled is adopted can use from the sub-district;
● the E-PUCH resource pool of the scheduling of this sub-district: the channel resource that the UE that from the E-PUCH resource pool of the scheduling of sub-district, will be scheduled takies removes;
● adjacent sub-district HSUPA interference margins: the interference that the transmitting power of the E-PUCH of the UE that estimates according to the power mandate of the E-PUCH channel of the UE that is scheduled to be scheduled causes adjacent sub-district; From the HSUPA interference margins of adjacent sub-district, this interference value is cut the HSUPA interference margins of this sub-district that just obtains upgrading then;
In above-mentioned scheduling, confirm that the method for each UE priority is a lot of to UE.Such as: the method that C/I is maximum.In the method, calculate the C/I of each UE, UE is lined up, begin to carry out the scheduling of UE from the maximum UE of C/I then according to C/I order from big to small.For another example, adopt the method scheduling UE of poll.In the method, establish total total N UE, according to UE1, UE2 ..., the sequential scheduling UE of UE N, after N UE is scheduled, again accent begin according to UE1, UE2 ..., the sequential scheduling UE of UE N.Also have a lot of additive methods,, repeat no more here owing to confirm that the method for each UE dispatching priority is not a content of the present invention.
The scheduler of NodeB sends to the physical layer of NodeB with above-mentioned definite parameter, and the physical layer of NodeB will send to UE at the E-AGCH of subframe " n+d1 " through scheduling with HSUPA UE ID and the E-DCH control information of this UE according to timing relationship.Then, the NodeB physical layer receives the E-PUCH of the scheduling of this UE transmission according to the timing difference of the E-PUCH of E-AGCH that dispatches and scheduling in subframe " n+d1+d2 ".Then, the physical layer of NodeB will send to UE with E-HICH at subframe " n+d1+d2+d3 ".
According to the 3GPP standard, UE monitors each the bar E-AGCH in the E-AGCH set that belongs to it in each subframe.When UE receives NodeB sends to its E-AGCH of scheduling in " n+d1 " subframe after, UE can confirm that through the UE ID on the E-AGCH this E-AGCH is the E-AGCH that sends to it.UE can confirm following information according to the E-DCH control information on the E-AGCH:
● distribute to the power mandate of E-PUCH channel and this channel of its scheduling
● distribute to its E-HICH channel
● the timing relationship between E-AGCH, E-PUCH and the E-HICH: UE can be confirmed the subframe number of E-PUCH by the subframe number of E-AGCH, and is further confirmed the subframe number of E-HICH by the timeslot number of first time slot of the timeslot number of E-HICH place time slot and E-PUCH
UE will confirm that E-DCH goes up the size and the modulation system of data block, and the data on the E-DCH are formed data block according to the channel resource and the power mandate of E-PUCH channel.Then to E-DCH go up that the data carried by data piece carries out chnnel coding, interweaves, rate-matched, physical channel mapping and modulation, generate the symbols streams on the E-DCH.UE also need confirm the data on the E-UCCH, and this E-UCCH is gone up data carried by data carry out chnnel coding and QPSK modulation, generates the symbols streams on the E-UCCH.Symbols streams and the symbols streams on the E-UCCH of E-DCH will be multiplexed on the E-PUCH, become the symbols streams on the E-PUCH.The last symbols streams of E-PUCH is sent to NodeB through the E-PUCH channel in " n+d1+d2 " subframe through spread spectrum and scrambling.NodeB confirms the symbols streams that E-PUCH upward carries through joint-detection, then E-PUCH is gone up the symbols streams of carrying and carries out demultiplexing, and upward the symbol and the E-DCH of carrying go up the symbol that carries to obtain E-UCCH.
NodeB carries out high specific to the symbol on all E-UCCH and merges and demodulation, then the demodulation result of E-UCCH is deciphered, and obtains E-UCCH and goes up data carried by data.NodeB goes up data carried by data according to E-UCCH and obtains E-DCH and decipher needed whole parameter, then E-DCH is gone up the symbol that carries and separates and be in harmonious proportion decoding.If NodeB is correct to the decoding of the data block on the E-DCH of UE, NodeB will generate ACK bit; If NodeB is to the data block decoding error on the E-DCH, NodeB will generate the NACK bit.The ACK/NACK bit of the E-DCH data block of the UE that NodeB generates will be through distributing to this UE the E-HICH of scheduling send to UE in " n+d1+d2+d3 " subframe.
Begin to dispatch UE to all sending time of needs (1+d1+d2+d3) sub-frame that finishes from the scheduler of NodeB with the relevant channel (E-AGCH of this UE, E-PUCH and E-HICH) of this scheduling of this UE.
For solving problems such as indoor covering and high-speed railway covering, introduced multi-channel system at present.In this system, a multichannel sub-district covers whole zone, and each passage covers the subregion in the whole sub-district; The isolation of the area of coverage of each passage is better, can think generally speaking, and the signal leakage that UE sends in a passage is very low to the power of other passages, can ignore the interference of other passages UE.
In existing multi-channel system, the scheduling mode of HSUPA UE is identical with existing other system, and identical channel resource can only be distributed to a UE, and this makes frequency spectrum resource utilization rate lower.The public adjacent sub-district of all passages HSUPA interference margins; That is: at an E-PUCH time slot of a sub-frame, the interference that all UE of this sub-district cause adjacent sub-district in the E-PUCH of this this time slot of subframe channel transmitting power sum is not more than the adjacent sub-district HSUPA interference margins that this sub-district is provided with in advance.
Summary of the invention
In view of this, the present invention provides the space division multiplexing method of shared channel in a kind of multichannel HSUPA system, can improve the frequency spectrum resource utilization rate in the multi-channel system.The concrete characteristics according to this multi-channel system can be each the independently adjacent sub-district of passage setting HSUPA interference margins in the space division multiplexing method of shared channel in this multichannel HSUPA system; Can let the same adjacent sub-district of all channels share HSUPA interference margins, also can let the same adjacent sub-district of several channels share HSUPA interference margins.
For realizing above-mentioned purpose, the present invention adopts following technical scheme:
The space division multiplexing method of shared channel in a kind of multichannel HSUPA system comprises:
The timing relationship of E-HICH of E-PUCH and scheduling of E-AGCH, the scheduling of scheduling is set in advance, and said timing relationship is all identical to each scheduling of all UE;
Confirm the passage at each UE place according to the reception signal of each UE up channel, and confirm the dispatching priority of each UE;
According to dispatching priority order from high to low; Be followed successively by the E-AGCH of each UE allocation schedule, the E-PUCH resource of scheduling and the E-HICH of scheduling; And arbitrary E-AGCH, arbitrary E-HICH or arbitrary E-PUCH resource allow to be assigned on N the different passages; Said N is the natural number smaller or equal to total number of channels in the sub-district, and on same passage, only allows to distribute once;
Timing relationship according to preset E-AGCH, E-PUCH and E-HICH; The passage that utilizes each UE place issues control data through the E-AGCH for the said scheduling of this UE distribution; Utilize the passage at each UE place to receive the uplink information data that corresponding UE sends through the E-PUCH resource, and the passage that utilizes each UE place through for the E-HICH of the said scheduling of this UE distribution to these UE feedback states data.
Preferably, this method further comprises: in NodeB, preserve the available situation of each E-AGCH of this NodeB at this passage of distributing to for each passage, for said each E-AGCH preserves the current multiplexing number of this E-AGCH on each passage;
For the mode of the E-AGCH of current scheduling UE allocation schedule comprises:
On all passages at said current scheduling UE place among the current all available E-AGCH; Select current multiplexing number minimum and belong to an E-AGCH in the E-AGCH set of said current scheduling UE, with the E-AGCH of this E-AGCH as the scheduling of current scheduling UE;
After the E-AGCH, E-HICH and the E-PUCH resource that are said current scheduling UE allocation schedule; This method further comprises: the E-AGCH that selects is set to unavailable on all passages at current scheduling UE place, and upgrades the current multiplexing number of the E-AGCH that selects.
Preferably, if current multiplexing number is minimum and E-AGCH that belong in the E-AGCH set of said current scheduling UE is many, then select an E-AGCH arbitrarily;
As if current all available E-AGCH on all passages that do not exist in said current scheduling UE place; Then, directly carry out the distribution of E-AGCH, E-PUCH and E-HICH for the next UE in the priority query not for current scheduling UE distributes E-AGCH, E-PUCH and E-HICH.
Preferably, this method further comprises: in NodeB, preserve the available situation of each E-HICH of this NodeB at this passage of distributing to for each passage, for said each E-HICH preserves the current multiplexing number of this E-HICH on each passage;
For the mode of the E-HICH of current scheduling UE allocation schedule comprises:
On all passages at said current scheduling UE place among the current all available E-HICH; Select current multiplexing number minimum and belong to an E-HICH in the E-HICH set of said current scheduling UE, with the E-HICH of this E-HICH as the scheduling of current scheduling UE;
After the E-AGCH, E-HICH and the E-PUCH resource that are said current scheduling UE allocation schedule; This method further comprises: the E-HICH that selects is set to unavailable on all passages at current scheduling UE place, and upgrades the current multiplexing number of the E-HICH that selects.
Preferably, if current multiplexing number is minimum and E-HICH that belong in the E-HICH set of said current scheduling UE is many, then select an E-HICH arbitrarily;
As if current all available E-HICH on all passages that do not exist in said current scheduling UE place; Then, directly carry out the distribution of E-AGCH, E-PUCH and E-HICH for the next UE in the priority query not for current scheduling UE distributes E-AGCH, E-PUCH and E-HICH.
Preferably; This method further comprises: the E-PUCH resource pool of confirming the scheduling of current subframe; In NodeB, preserve the available situation of each node on each time slot of the E-PUCH resource pool of the scheduling of current subframe described in this passage, and in NodeB, preserve the interference margins of each passage for each passage;
For the mode of the E-PUCH resource of current scheduling UE allocation schedule comprises:
Confirm the minimum data piece of said current scheduling UE according to the data volume of said current scheduling UE;
Confirm current all available E-PUCH resource and the available interference surplus of all passages of said current scheduling UE place on all passages at said current scheduling UE place; And according to said available interference surplus; The E-PUCH channel resource of the minimum data piece of said current scheduling UE is carried in selection at least in the E-PUCH channel resource of confirming, as the E-PUCH resource of the scheduling of distributing to said current scheduling UE;
After the E-AGCH, E-HICH and the E-PUCH resource that are said current scheduling UE allocation schedule; This method further comprises: on all passages at said current scheduling UE place; The node that the E-PUCH resource of selecting is adopted and all father nodes thereof, all child nodes are set to unavailable on corresponding time slot; Upgrade the interference margins of said current scheduling UE place passage; And confirm that preset and current scheduling UE belong to the passage of any channels share same disturbance surplus, upgrade the interference margins of this passage of confirming.
Preferably; The E-PUCH resource pool of the scheduling of said definite current subframe comprises: the E-PUCH resource of confirming the non-scheduling that current subframe is used; Dispose the E-PUCH resource of the non-scheduling that will confirm the E-PUCH resource pool to said NodeB from RNC and remove, the resource pool that remaining E-PUCH resource is formed is as the E-PUCH resource pool of the scheduling of current subframe.
Preferably; The available interference surplus of all passages of said definite current scheduling UE place comprises: confirm the current interference margins of each passage in all passages of current scheduling UE place, minimum value is wherein belonged to the available interference surplus of all passages as current scheduling UE.
Preferably, the said E-PUCH channel resource of in the E-PUCH channel resource of confirming, selecting comprises:
The E-PUCH node and the time slot of the minimum data piece of said current scheduling UE carried in selection at least in the E-PUCH channel resource of confirming; And judge whether selected time slot and the E-HICH that distributes for current scheduling UE satisfy preset timing relationship; If, the E-PUCH channel resource that then the E-PUCH channel resource of selecting is distributed as current scheduling UE; Otherwise, judge the E-PUCH node and the time slot that there are not the minimum data piece that carries said current scheduling UE at least.
Preferably, the said E-PUCH channel resource of in the E-PUCH channel resource of confirming, selecting comprises:
According to the E-HICH that distributes for current scheduling UE; In said current all available E-PUCH channel resource, confirm; Satisfy the E-PUCH channel resource of preset timing relationship with the E-HICH that distributes for current scheduling UE, in the E-PUCH channel resource that satisfies preset timing relationship, select to carry at least the E-PUCH node and the time slot of the minimum data piece of said current scheduling UE.
Preferably,, there be not the E-PUCH node and the time slot of the minimum data piece that carries said current scheduling UE at least if in said current all available E-PUCH resource, and/or,
If confirm that the available interference surplus of all passages of current scheduling UE place is 0,
Then, directly carry out the distribution of E-AGCH, E-PUCH and E-HICH for the next UE in the priority query not for current scheduling UE distributes E-AGCH, E-PUCH and E-HICH.
Preferably, upgrading interference margins comprises:
Calculate the interference value that said current scheduling UE causes adjacent sub-district, and the current interference margins on all passages at current scheduling UE place is deducted the interference value that calculates, as the interference margins after upgrading; To with the passage of any channels share interference margins at current scheduling UE place, the current interference margins of this passage is deducted the interference value that calculates, as the interference margins after upgrading.
Preferably, when the network planning, this method further comprises: the initial interference surplus that interference margins sharing mode and each passage are set for all passages in the sub-district.
Preferably, the same interference margins of all channels share, perhaps, and the same interference margins of part channels share in all passages, perhaps, different passages are assigned with different interference margins.
Preferably, the same interference margins of channels share that identical adjacent sub-district is caused interference is set in the sub-district.
Preferably, said reception signal according to up channel confirms that the passage at each UE place comprises:
If there is a up channel in UE at the current ascending time slot of current subframe, then utilize the reception signal of this up channel to confirm the passage that this UE belongs to;
If there are a plurality of up channels in UE at the current ascending time slot of current subframe; Then utilize the reception signal of all up channels to confirm the passage that this UE belongs to; Perhaps, utilize the reception signal of preset in all a up channels up channel to confirm the passage that this UE belongs to;
If there is up channel in UE at a plurality of ascending time slots of current subframe; Then utilize all up channels of all time slots in said a plurality of ascending time slot to confirm the passage that UE belongs to; Perhaps; Preset ascending time slot utilizes all up channels of this ascending time slot or a up channel that is provided with in advance of this time slot to confirm the passage that UE belongs to, perhaps; Utilize one of them preset up channel, the passage that utilizes this up channel to confirm the UE place at the reception signal of a time slot that is provided with in advance at reception signal or this up channel of all ascending time slots.
Preferably, said up channel is: the special uplink channel of UE, or, be assigned to this UE and not by the shared up channel of space division multiplexing in current subframe.
Preferably; This method further comprises: when detecting uplink synchronous sequence; If a plurality of UE adopt identical uplink synchronous sequence to insert simultaneously, then confirm the passage at each UE place among said a plurality of UE, if the passage at any two UE place does not exist overlapping among said a plurality of UE; Then utilize the passage at each UE place among said a plurality of UE to send FPACH, and utilize the passage at each UE place among said a plurality of UE to detect E-RUCCH.
Preferably; This method further comprises: when detecting uplink synchronous sequence, if a plurality of UE adopt identical uplink synchronous sequence to insert simultaneously, then confirm the passage at each UE place among said a plurality of UE; If any two UE are in different passages among said a plurality of UE; Then from said a plurality of UE, confirm wherein a part of UE, the passage that any two UE belong among said a part of UE does not exist overlapping, and the passage at the passage at this a part of UE place and other UE place does not exist overlapping; Utilize the passage at each UE place among said a part of UE to send FPACH, and utilize the passage at each UE place among said a part of UE to detect E-RUCCH.
Visible by technique scheme, the present invention is provided with the timing relationship of E-AGCH, E-PUCH and E-HICH in advance in the multi-channel system of HSUPA, and said timing relationship is all identical to each scheduling of all UE; Confirm the passage at UE place and the dispatching priority of UE according to the reception signal of each UE up channel; According to dispatching priority order from high to low; Be followed successively by the E-AGCH of each UE allocation schedule, the E-PUCH resource of scheduling and the E-HICH of scheduling; And arbitrary E-AGCH, arbitrary E-HICH or arbitrary E-PUCH resource allow to be assigned on N the different passages, and said N is the natural number smaller or equal to total number of channels in the sub-district; According to the timing relationship of preset E-AGCH, E-PUCH and E-HICH, the channel resource according to distributing carries out the transmission of respective channel data on each UE passage separately.Through identical shared channel resources is assigned on the different passages, thereby realize the space division multiplexing of shared channel, and then improve frequency spectrum resource utilization rate; Because in the multi-channel system, different interchannel interference are very little, therefore on each UE place passage, carry out transfer of data and can not cause obscuring between signal simultaneously according to the channel resource that distributes.In the multi-channel system of this HSUPA; When carrying out the space division multiplexing of shared channel; Can be each the independently adjacent sub-district of passage setting HSUPA interference margins according to the concrete characteristics of this multi-channel system; Can let the same adjacent sub-district of all channels share HSUPA interference margins, also can let the same adjacent sub-district of several channels share HSUPA interference margins.
Description of drawings
Fig. 1 is the overview flow chart of shared channel space division multiplexing method in the multichannel HSUPA system provided by the invention.
Fig. 2 is a high-speed railway networking sketch map.
Embodiment
For making the object of the invention, technological means and advantage clearer, the present invention is explained further details below in conjunction with accompanying drawing.
In multi-channel system, different interchannel interference are very little, and when the base station utilized the passage at each UE place to carry out signal transmission and reception, the interference that the UE on other passages receives was very little.Therefore, can be at different interchannels, multiplexing identical shared channel resources, and utilize the passage at each UE place to carry out signal transmission and reception.Based on this, basic thought of the present invention is: through the space division multiplexing of shared channel in the multi-channel system, improve frequency spectrum resource utilization rate.
Fig. 1 is the overview flow chart of shared channel space division multiplexing method in the multichannel HSUPA system provided by the invention.As shown in Figure 1, this method comprises:
Step 101 timing relationship of E-HICH of E-PUCH and scheduling of E-AGCH, the scheduling of scheduling is set in advance, and this timing relationship is all identical in the scheduling of each subframe to all UE.
In the UE of existing HSUPA system scheduling, between the different UEs or between the scheduling of different subframes, the timing relationship between the E-HICH of the E-AGCH of scheduling, the E-PUCH of scheduling and scheduling can be different.And in the present invention, if the timing relationship between the different UEs is different, scrappy HSUPA resource may appear, for example:
In the scheduling of current subframe " n ", suppose that 8 UE are scheduled.Timing relationship between three physical channels of preceding 7 UE is just the same, and the timing relationship of three physical channels of the 8th UE and other 7 UE are different.The E-AGCH subframe of the scheduling of UE1～UE7 is all sent in subframe " n+d1 ", and the E-PUCH of the scheduling of UE1～UE7 sends in subframe " n+d1+d2 ", and the E-HICH of the scheduling of UE1～UE7 sends in subframe " n+d1+d2+d3 ".But the E-AGCH subframe of the scheduling of UE8 is sent in subframe " n+d1+1 ", and the E-PUCH of the scheduling of UE8 sends in subframe " n+d1+d2+1 ", and the E-HICH of the scheduling of UE8 sends in subframe " n+d1+d2+d3+1 ".For UE8, the E-AGCH of the scheduling of this UE is not scheduled in the resource of subframe " n+d1 ", forms scrappy E-AGCH resource; The E-PUCH of the scheduling of UE8 is not scheduled in the resource of subframe " n+d1+d2 ", forms scrappy E-PUCH resource; The E-HICH of the scheduling of UE8 is not scheduled in the resource of subframe " n+d1+d2+d3 ", forms scrappy E-HICH resource.When dispatching, the E-AGCH resource that the scheduler of NodeB can be dispatched is because the existence of processing delay can only be " n+d1+1 " subframe and the later E-AGCH resource of this subframe to NodeB in next subframe " n+1 "; The E-PUCH resource that can dispatch can only be " n+d1+d2+1 " subframe and the later E-PUCH resource of this subframe; The E-HICH resource that can dispatch can only be " n+d1+d2+d3+1 " subframe and the later E-HICH resource of this subframe.Therefore, the scrappy HSUPA resource that causes of UE8 has been wasted.
In the present invention, if timing relationship is different between the scheduling of different subframes, then may cause the conflict between the scheduling resource of different subframes.For will making scheduling, the collision detection of avoiding this conflict to carry out becomes very complicated.For example:
Suppose at " n " only to have dispatched UE1 when subframe is dispatched.And confirm: the E-AGCH of the scheduling of this UE1 is that E-AGCH1 and E-AGCH1 are positioned at time slot 4; The E-HICH of scheduling is a unique E-HICH-E-HICH1 during the E-HICH of this UE gathers; Be positioned at time slot 6; The E-PUCH of the scheduling of this UE occupies whole time slot 2 and time slot 3, and the timing parameters between E-HICH and the E-PUCH is N E-HICH=4.The E-AGCH1 of this UE will send in subframe " n+d1 "; , the E-PUCH of scheduling sends in subframe " n+d1+d2 ", here, and d2=2; E-HICH1 sends in subframe " n+d1+d2+1 ".When subframe is dispatched, also only dispatched UE1 at " n+1 ".And confirm: the E-AGCH of the scheduling of this UE is E-AGCH1, and the E-HICH of scheduling still is E-HICH1, and the E-PUCH of scheduling occupies whole time slot 2.In " n+1 " subframe, variation has taken place the timing relationship of E-AGCH1, E-PUCH and E-HICH1: E-AGCH sends in subframe " n+d1+1 ", and the E-PUCH of scheduling sends in subframe " n+d1+d2+1 ", and E-HICH sends in subframe " n+d1+d2+1 ".Like this, resource contention takes place the E-HICH that confirms during at " n+1 " subframe scheduling with this UE of the E-HICH1 of the scheduling when " n " subframe scheduling, confirmed of this UE: the E-HICH resource of same subframe is repeated to dispatch in different subframes.
Consider above-mentioned situation; Be the collision detection between the scheduling resource of avoiding occurring scrappy HSUPA resource and different subframes; Among the present invention; When NodeB is provided with the timing relationship of E-HICH of E-PUCH and scheduling of E-AGCH, scheduling of scheduling, all identical in the scheduling of each subframe to all UE in this sub-district.
Step 102 is confirmed the passage that each UE belongs to according to the reception signal of each UE up channel, and confirms priority query according to the dispatching priority of each UE.
Step 103; According to the priority query that confirms in the step 102; Be followed successively by the E-AGCH of each UE allocation schedule, the E-PUCH resource of scheduling and the E-HICH of scheduling; And arbitrary E-AGCH, arbitrary E-HICH or arbitrary E-PUCH resource allow to be assigned on N the different passages, and on same passage, only allow to distribute once.
Wherein, N is the natural number smaller or equal to total number of channels in the sub-district.In the multichannel HSUPA scheduling, can on different passages, carry out different distribution to the HSUPA interference margins according to the concrete characteristics of this multi-channel system:
● the same HSUPA interference margins of all channels share
● the HSUPA interference margins that different channel allocations are different
● the same HSUPA interference margins of several channels share
Here; When the power mandate of the E-PUCH that confirms a UE; Need estimate the interference that this UE causes adjacent sub-district according to the power mandate of the E-PUCH of this UE; This interference can be regarded as the HSUPA interference margins of distributing to this UE, and the HSUPA interference margins of distributing to this UE can not be greater than the HSUPA interference margins of this UE place passage.
Under the situation of the same HSUPA interference margins of all channels share of sub-district, in case a part of HSUPA interference margins is distributed to a UE, this part interference margins just can not be reallocated to other UE in the sub-district.
Under the different interference margins situation of different channel allocations; In any passage; All UE in this passage share the HSUPA interference margins of this passage: in case a part of HSUPA interference margins of this passage is distributed to a UE, this part interference margins just can not be reallocated to other UE in this passage.
Under the same HSUPA interference margins of several channels share situation; UE in these passages will share this HSUPA interference margins: in case a part of HSUPA interference margins is distributed to a UE who is arranged in these passages, this part interference margins just can not be reallocated to other UE that are positioned at these passages.
When a UE is carried out the mandate of E-PUCH power, need at first to confirm the HSUPA interference margins of this UE place passage, confirm the E-PUCH power mandate of this UE then based on this HSUPA interference margins.The method of confirming the power mandate of this UE based on known HSUPA interference margins is not a content of the present invention, repeats no more here.
Illustrate above-mentioned three kinds of HSUPA interference margins distribution condition below.
Situation 1: in the sub-district that covers a high building, each floor is covered by several RRU.Isolation between the floor is higher, and each floor can be regarded as a passage.The outside in this building is covered by the sub-district of another one around this building.The E-PUCH channel transmitting power of each UE all will produce interference to the sub-district outside the building on this floor.Therefore, in this case, can think the same HSUPA interference margins of all channels share: the E-PUCH channel that this interference margins is used for limiting UE in the sub-district that covers high building is no more than this interference margins to the interference of sub-district outside the building.In case a part of interference margins is distributed to UE in this building, and this part interference margins just can not be reallocated to other UE in the sub-district.
Situation 2:, suppose that each floor is covered by several RRU in each high building in the sub-district that covers two disjunctor high buildings.Isolation between the floor of every high building is higher, and isolation is also very high between the same floor of different high buildings, and each floor of each high building constitutes a passage like this.The outside in this building is made up of two sub-districts, and a sub-district is around a high building in the disjunctor high building.How many E-PUCH channel transmitting power of each UE all will produce interference to the sub-district, outside 1 around this building in the building 1.The UE in this building can ignore the interference of the sub-district, outside 2 in building 2.In this case, can think the same HSUPA interference margins of all channels share in building 1: the E-PUCH channel that this interference margins is used for limiting UE in all passages in the high building 1 is no more than this interference margins to the interference of the sub-district outside this building 1.In case a part of interference margins is distributed to UE in this building, and this part interference margins just can not be reallocated to other UE in this building.How many E-PUCH channel transmitting power of each UE all will produce interference to the sub-district, outside 2 around this building in the building 2.The UE in this building can ignore the interference of the sub-district, outside 1 in building 1.In this case, can think the same HSUPA interference margins of all channels share in building 2: the E-PUCH channel that this interference margins is used for limiting UE in all passages of high building 2 is no more than this interference margins to the interference of the sub-district outside this building 1.
Situation 3: in the sub-district of a covering high-speed railway, this sub-district is as shown in Figure 2.In the high-speed railway scene, a sub-district is made up of the RRU PATH on a plurality of poles, two RRUPATH of suspension on each pole.As shown in the figure, sub-district B is made up of the RRU PATH on 4 poles, the pole 1 that distributes successively of the rightmost from the Far Left of sub-district to the sub-district, pole 2, pole 3 and pole 4.The B Far Left drives into sub-district B if a row train 1 is from the sub-district, and the upward signal of the UE on this locomotive engine is received by the RRU PATH on the pole 1 of sub-district B and the pole 2 simultaneously, and the upward signal of the UE of this train afterbody is only received by the pole 1 of sub-district B.Also have the rightmost of row train 2 B from the sub-district to drive into sub-district B, the upward signal of the UE on this locomotive engine is received by the RRU PATH on the pole 3 of sub-district B and the pole 4, and the upward signal of the UE of this train afterbody is only received by the RRU PATH on the pole 4.In this case, the HSUPA resource that the UE on the train 1 can be identical with the UE space division multiplexing on the train 2 comprises: identical E-AGCH resource, identical E-HICH resource and identical E-PUCH channel resource.Because the upward signal of the UE on these two trains is received by different RRU PATH: the RRU PATH that receives UE signal on the train 1 be pole 1 with pole 2 on RRUPATH, and the RRU PATH that receives UE signal on the train 2 be pole 3 with pole 4 on RRUPATH.UE on this two row train can considered to be in different passages, and therefore, they can multiplexing identical HSUPA resource.
Now, consider the power licensing issue of the E-PUCH of UE on this two row train.Obviously, the UE on the train 1 is near apart from sub-district A, sub-district A is formed disturb; UE on the train 1 is far away apart from sub-district C, and is very little to the interference of sub-district C, can ignore.In like manner, the UE on the train 2 is far away apart from sub-district A, can ignore the interference that sub-district A forms; UE on the train 2 is near apart from sub-district C, sub-district C is formed disturb.
We are divided into 4 passages with this high-speed railway sub-district B: passage 1, passage 2, passage 3 and passage 4, and passage i is made up of the area of coverage of two RRU on i the pole of sub-district B here, here, i=1,2,3,4.Like this, be positioned at UE on 1 in the train with being positioned at passage 1 and passage 2 simultaneously, the UE that is positioned at train 1 afterbody is positioned at passage 1; Be positioned at UE on 2 in the train with being positioned at passage 3 and passage 4 simultaneously, the UE that is positioned at train 2 afterbodys is positioned at passage 4.
When the E-PUCH to the UE in the B of sub-district carries out the power mandate, can not only stipulate a HSUPA interference margins as situation 1, the UE of all passages shares this interference margins.This is that the UE in the B of sub-district in the different passages causes interference to different adjacent sub-districts because the adjacent sub-district of this sub-district B has a plurality ofly, and the UE of not all passage only causes interference to an identical adjacent sub-district.
To this high-speed railway scene, can let passage 1 and passage 2 share HSUPA interference margins, the UE that this interference margins is used to be limited in passage 1 and the passage 2 of sub-district B disturbs the HSUPA of sub-district A and is no more than the HSUPA interference margins that is provided with in advance; Can let passage 3 and passage 4 share HSUPA interference margins, the UE that this interference margins is used to be limited in passage 3 and the passage 4 of sub-district B disturbs the HSUPA of sub-district C and is no more than the HSUPA interference margins that is provided with in advance.These two interference margins can be arranged to different numerical, can when carrying out sub-district A, sub-district B and sub-district C planning, confirm this two HSUPA interference margins.
Under the HSUPA interference margins situation that passage 1 and passage 2 are shared sub-district A; Be positioned at passage 1 or be positioned at passage 2 or be positioned at passage 1 simultaneously and the UE of passage 2 when being assigned with the mandate of E-PUCH power when one, can not be to the interference that the power mandate of this UE causes greater than the HSUPA interference margins of sub-district A to sub-district A.In case this UE is successfully authorized the mandate of E-PUCH power; Just needs are estimated the interference that the power mandate of this UE causes sub-district A; This interference can be regarded the HSUPA interference margins of distributing to this UE as, upgrades the HSUPA interference margins of sub-district A then: from the HSUPA interference margins of sub-district A, cut the HSUPA interference margins of distributing to this UE.Later on to being positioned at passage 1 or being positioned at passage 2 or being positioned at passage 1 simultaneously and the UE of passage 2 when carrying out the mandate of E-PUCH power, will be based on the HSUPA interference margins of the sub-district A that upgrades.That is: the UE that is positioned at passage 1 and passage 2 among the B of sub-district will share the HSUPA interference margins of sub-district A, in case a part of interference margins is assigned to a UE, other UE can not re-use this part interference margins.
HSUPA interference margins for sub-district C also can obtain same conclusion:
● under the HSUPA interference margins situation that passage 3 and passage 4 are shared sub-district C; Be positioned at passage 3 or passage 4 or be positioned at passage 3 simultaneously and the UE of passage 4 when being assigned with the mandate of E-PUCH power when one, the interference to sub-district C that the power mandate of this UE causes can not be greater than the HSUPA interference margins of sub-district C.
● the UE that is positioned at passage 3 and passage 4 among the B of sub-district will share the HSUPA interference margins of sub-district C, in case a part of interference margins is assigned to a UE, other UE can not use this part interference margins.
In this step,, be followed successively by each UE allocation of channel resources may according to priority query.When carrying out channel resource allocation; Can carry out space division multiplexing, arbitrary E-AGCH, arbitrary E-HICH or arbitrary E-PUCH resource allow to be assigned on N the different passages, and on same passage, only allow to distribute once; That is to say; Two UE that only belong to different passages just can be assigned with same channel resource, when the passage of two UE exists when overlapping, can not be assigned with same channel resource.When carrying out the space division multiplexing of E-AGCH and E-HICH, should select the E-AGCH and the E-HICH of the current least number of times that is re-used.
In the multichannel HSUPA scheduling, can on different passages, carry out different distribution to the HSUPA interference margins according to the concrete characteristics of this multi-channel system.When the network planning, can confirm whether a sub-district is the multichannel sub-district.For a multichannel sub-district, confirm each passage of this sub-district and all adjacent sub-districts of this sub-district.And can confirm the method for salary distribution and numerical value at each passage HSUPA interference margins according to each passage in this multi-channel system and adjacent subdistrict position relation.
● when the UE of all passages of sub-district causes when disturbing the same HSUPA interference margins of all channels share to identical adjacent sub-district;
● when the UE that is positioned at the different passages in sub-district causes interference to different adjacent sub-districts; The different passages in sub-district should distribute different HSUPA interference margins, and the HSUPA interference margins of distributing to each passage is used to limit the interference of the interior UE of this passage to the adjacent sub-district of this passage;
● when the UE that is arranged in some passages of sub-district caused interference to identical adjacent sub-district, the UE in these passages shared same HSUPA interference margins, and this HSUPA interference margins is used to limit the interference of the UE of these passages to this identical adjacent area
When distributing the mandate of E-PUCH power for a UE, need at first confirm the HSUPA interference margins in the passage at this UE place, distributing to the interference that the E-PUCH power mandate of this UE causes adjacent sub-district can not be greater than the HSUPA interference margins of this UE place passage.Based on known HSUPA interference margins, confirm that the method for the E-PUCH power mandate of this UE can be consulted existing document.
Step 104; Timing relationship according to step 101 setting; The passage that utilizes each UE place issues control data through the E-AGCH for the scheduling of this UE distribution; Utilize the passage at each UE place to receive the uplink information data that corresponding UE sends through the E-PUCH resource, and the passage that utilizes each UE place through for the E-HICH of the scheduling of this UE distribution to these UE feedback states data.
Through step 103, realized waiting to dispatch the process of UE allocation of channel resources may, and the resource of distributing can be multiplexing at different interchannels for each.This step promptly utilizes the channel resource of this distribution to carry out the transmission of respective channel data.
In channel data transmission process, one side need be transmitted according to the timing relationship of setting in the step 101, and on the other hand, the passage that NodeB need utilize UE to belong to separately carries out the data of respective channel and sends and receive.Particularly, NodeB utilizes the passage at UE place, through be the E-AGCH transmitting control data of the scheduling of its distribution, and through the E-PUCH resource reception information data for the scheduling of its distribution; Utilize the passage at UE place again, through being that the E-HICH of scheduling of its distribution is to status datas such as UE feeding back ACK/NACK and CQI.
For example: in the sub-district that covers a high building, each floor is made up of one or more RRU261.Isolation between each floor is very high, and each floor constitutes a passage of this sub-district.There is a sub-district around this building the outside in this building, the same HSUPA interference margins of all channels share in this building.Two UE are arranged in this sub-district, and UE is in the lowermost layer in this building, and UE is top this building, and the isolation between two floors is very high.In same subframe, these two UE can identical E-AGCH, E-PUCH and the E-HICH of space division multiplexing.When being the power mandate of these two UE distribution E-PUCH, these two UE can share same HSUPA interference margins.In case a part of HSUPA interference margins is distributed to one of them UE, this part interference margins just can not be distributed to another one UE.Another one UE is merely able to be assigned with remaining HSUPA interference margins.
Specifically; Through abovementioned steps, the scheduler of NodeB is found UE1 and UE2 at different passages, and scheduler can be confirmed to dispatch UE1 and UE2 simultaneously in " n " subframe; And distribute to the E-AGCH resource of this two UE, E-PUCH resource and E-HICH resource can be identical.Such as, NodeB scheduler be that the E-AGCH of the scheduling selected of UE1 is E-AGCH1, the E-PUCH of the scheduling selected for UE1 is E-PUCH1, for the E-HICH of the scheduling of UE1 selection be E-HICH1.Power headroom that NodeB reports through E-RUCCH according to UE1 and the HSUPA interference margins of this passage are confirmed the E-PUCH power mandate of this UE1.The NodeB scheduler is that UE2 selects to make identical selection: the E-PUCH of the scheduling that the E-AGCH of the scheduling of selecting for UE2 is E-AGCH1, select for UE2 be E-PUCH1, for the E-HICH of the scheduling of UE2 selection be E-HICH1.Power headroom that NodeB reports through E-RUCCH according to UE2 and the residue HSUPA interference margins (the HSUPA interference margins that will distribute to UE1 removes from the HSUPA interference margins of this sub-district) of this passage are confirmed the E-PUCH power mandate of this UE2.The power mandate of the power mandate of the E-PUCH of UE1 and the E-PUCH of UE2 can be different.Timing relationship between E-AGCH1, E-PUCH1 and the E-HICH1 is: E-AGCH1 sends in the n+d1 subframe, and E-PUCH1 will send in (n+d1+d2) subframe, and E-HICH1 will send in (n+d1+d2+d3) subframe.Carrying out transfer of data at corresponding channel in this step comprises:
At subframe " n+d1 ", NodeB can send the ID of UE1 through E-AGCH1 through the RRU that is positioned at this building lowermost layer and UE1 is given in the E-DCH control information of UE1.Simultaneously, at subframe " n+d1 ", NodeB can the top RRU in this building sends the ID of UE2 through E-AGCH1 and UE2 is given in the E-DCH control information of UE2 through being positioned at.
Then, at subframe " n+d1+d2 ", NodeB will receive the data of UE1 through the UE1 of E-PUCH1 transmission through the RRU that is positioned at this building lowermost layer.UE1 adopts the power mandate of UE1 when sending E-PUCH1.Simultaneously, at subframe " n+d1+d2 ", NodeB can receive UE2 sends UE2 through E-PUCH1 data through being positioned at the top RRU in this building.UE2 adopts the power mandate of UE2 when sending E-PUCH1.
At last, at subframe " n+d1+d2+d3 ", NodeB will give UE1 through the ACK/NACKI data that E-HICH1 sends UE1 through the RRU that is positioned at this building lowermost layer.Simultaneously, at subframe " n+d1+d2+d3 ", NodeB will give UE2 through the ACK/NACK data that E-HICH1 sends UE2 through being positioned at the top RRU in this building.
Because the isolation between these two UE place passages is very high, therefore, receives only NodeB through the ID of the UE1 of E-AGCH1 transmission and the E-DCH control information of UE1 at the UE1 of this building lowermost layer.Top UE2 receives only NodeB through the ID of the UE2 of E-AGCH1 transmission and the E-DCH control information of UE2 in this building.
Suppose the information of UE1 on can correct decoding E-AGCH1, UE1 confirms that through the ID of the UE1 that carries on the E-AGCH1 this E-AGCH1 sends to it so.UE1 can be confirmed the subframe number " n+d1+d2 " of the E-PUCH1 of scheduling by the subframe number " n+d1 " of the E-AGCH1 that dispatches.And can go up code channel, time slot and the power resource information that data carried by data is confirmed E-PUCH1 according to the E-AGCH1 of scheduling; And can confirm the number of E-UCCH; And the number of the E-HICH that can go up carry according to E-AGCH confirms that the E-HICH of scheduling is which the bar E-HICH in the E-HICH set of scheduling of this UE, and then can confirm the subframe number " n+d1+d2+d3 " of E-HICH1.Then, UE1 will send to NodeB according to the power that licenses to it (the power resource relevant information of the E-PUCH that this power mandate go up to be carried by E-AGCH1 is unique to be confirmed) with the E-DCH data of UE1 through E-PUCH1.At last, UE1 will receive the ACK/NACK information that the RRU that is positioned at this building lowermost layer passes through the UE1 of E-HICH1 transmission in subframe " n+d1+d2+d3 ".
Suppose the information of UE2 on can correct decoding E-AGCH1, UE2 confirms that through the ID of the UE2 that carries on the E-AGCH1 this E-AGCH1 sends to it so.UE2 can be confirmed the subframe number " n+d1+d2 " of the E-PUCH1 of scheduling by the subframe number " n+d1 " of the E-AGCH1 that dispatches.And can go up code channel, time slot and the power resource information that data carried by data is confirmed E-PUCH1 according to the E-AGCH1 of scheduling; And can confirm the number of E-UCCH; And the number of the E-HICH that can go up carry according to E-AGCH confirms that the E-HICH of scheduling is which the bar E-HICH in the E-HICH set of scheduling of this UE, and then the subframe number " n+d1+d2+d3 " of the E-HICH1 that can confirm to dispatch.Then, UE2 will send to NodeB according to the power that licenses to it (the power resource relevant information of the E-PUCH that this power mandate go up to be carried by E-AGCH1 is unique to be confirmed) with the E-DCH data of UE2 through E-PUCH1.At last, UE2 will receive the top RRU in this building sends UE2 through E-HICH1 the ACK/NACK information that is positioned in subframe " n+d1+d2+d3 ".
So far, the space division multiplexing method overall procedure in the multichannel HSUPA system of the present invention finishes.
Can be seen by above-mentioned space division multiplexing method: E-AGCH, E-HICH and E-PUCH can be by space division multiplexings.Because identical E-AGCH, E-HICH and E-PUCH all can be assigned on N the different passage; And each E-AGCH takies the code channel of two SF16, and each E-HICH takies the code channel of 1 SF16, therefore; Can save the channel resource of sub-district, improve the utilance of cell channel.Simultaneously; The HSUPA interference margins of sub-district also can distribute according to the concrete characteristics of this multichannel sub-district accordingly in the multichannel HSUPA system: can let the same HSUPA interference margins of all channels share, not have the space division multiplexing of HSUPA interference margins in this case; Can let each passage have independently HSUPA interference margins, this situation can be regarded as a kind of special space division multiplexing mode of HSUPA interference margins, and the HSUPA interference margins of each channel multiplexing is different; Can let the same HSUPA interference margins of several channels share; This situation also is a kind of particular form of HSUPA interference margins space division multiplexing; In these passages, there is not the space division multiplexing of HSUPA interference margins; But other passages of these passages and this sub-district have carried out the space division multiplexing that a kind of special HSUPA disturbs owing to have separately independently HSUPA interference margins between other passages of these passages and sub-district.The method of salary distribution of this HSUPA interference margins can make different passages carry out the space division multiplexing of HSUPA interference margins under given conditions, can further improve the utilance of HSUPA resource.
Such as: a sub-district, two UE are positioned at different passages, but share same HSUPA interference margins.When UE1 is scheduled, use E-AGCH1, E-PUCH1 and E-HICH1, and used whole HSUPA interference margins.Even UE2 can with the multiplexing identical E-AGCH1 of UE1, E-PUCH1 and E-HICH1, but owing to there is not the HSUPA interference margins can distribute to this UE, this UE will not be scheduled.E-AGCH1, E-PUCH1 and E-HICH1 have been wasted.But because the passage at UE1 and UE2 place has independently HSUPA interference margins, then these two UE can have been avoided because the situation that does not have remaining HSUPA interference margins UE2 not to be scheduled by scheduling simultaneously.
Below through the embodiment of embodiment one explanation the present invention in the HSUPA system.
Embodiment one:
Can confirm the number of active lanes of each sub-district and each sub-district through the network planning.A multichannel sub-district, establishing this sub-district has M passage.Isolation is very high between each passage, between different passages, can carry out space division multiplexing to the shared channel of HSUPA.Shared channel by the greatest coefficient of space division multiplexing is: M.That is: E-AGCH/E-HICH/E-PUCH can be used by M passage simultaneously.According to the network planning, can confirm the adjacent sub-district that each passage faces, and confirm the method for salary distribution of each passage HSUPA interference margins and the numerical value of distribution.
With indoor overlay environment is example, and the space division multiplexing method of concrete present embodiment comprises following processing:
Step 1 at current subframe " n ", according to the reception signal of the up channel of each UE, is confirmed the passage at each UE place.A UE possibly have upward signal in a plurality of passages, therefore, a UE possibly occupy a plurality of passages.
Particularly, if a UE has only a up channel at the current ascending time slot " ts " of current subframe, directly confirm the passage at this UE place through the reception signal of this up channel.
If a UE has a plurality of up channels at the current ascending time slot " ts " of current subframe, can confirm the passage at this UE place by the reception signal of all these up channels; Can be benchmark also with one of them preset up channel; Investigate the reception signal of this up channel; Confirm the passage that this UE belongs to by the reception signal of this up channel, such as: the UL DPCH with this UE is a benchmark, confirms the passage at UE place through the reception signal of this channel.
If there is up channel in current subframe in a UE at a plurality of ascending time slots, can confirm this UE place passage based on the reception signal of all up channels of all these time slots; Also can select one of them ascending time slot is benchmark, the reception signal of all up channels through this UE in this time slot or confirm this UE place passage through the reception signal of a up channel that is provided with in advance of this time slot; Also can select a up channel in advance, confirm the passage at this UE place through this up channel at the reception signal of all ascending time slots or through this up channel at the reception signal of an ascending time slot that is provided with in advance.Such as: select first ascending time slot of this UE, the reception signal of all up channels through this UE of this time slot is confirmed the passage at this UE place.For another example: with UL DPCH is benchmark, confirms the passage at this UE place according to the reception signal of first ascending time slot of UL DPCH.
In the process of above-mentioned definite UE place passage; Be used for confirming that the up channel of UE place passage must be the special uplink channel of this UE; Give the shared up channel of this UE for one in current sub-frame allocation, if the up channel that this up channel also not can be used as this UE by space division multiplexing in current subframe is used to confirm the passage at this UE place.
Step 2 in " n+d0 " subframe, reports each UE place channel information the scheduler of NodeB.D0 representes processing delay.For a UE who occupies a plurality of passages, each passage that it occupies all reports scheduler.
Step 3 is dispatched according to each UE place channel information that " n+d0 " subframe reports at the scheduler of " n+d0 " subframe NodeB.The scheduler of NodeB is dispatched based on the HSUPA information of following sub-district:
1) the K1 bar E-AGCH of this cell configuration
2) E-HICH of the K2 bar of this cell configuration scheduling
3) the E-PUCH resource pool of the scheduling of this sub-district: the channel resource that E-PUCH that will non-scheduling in current subframe " n " from the E-PUCH resource pool of RNC configuration occupies forecloses, and just obtains the E-PUCH resource pool in current subframe " n " scheduling;
4) HSUPA interference margins: can confirm that through the network planning which passage has independently HSUPA interference margins, the same HSUPA interference margins of which channels share.Interference margins according to each passage of initializes sub-district of the network planning.
5) the number of active lanes M of current area, the composition of each passage: form the RRUPATH number of each passage and the number of RRU PATH
Based on the HSUPA resource of above sub-district, scheduler is preserved following information:
A) preserve the available situation of K1 bar E-AGCH for each passage, and be the current multiplexing number of each this E-AGCH of bar preservation among the K1 bar E-AGCH at this passage, promptly current by what channel multiplexings; In " n+d0 " subframe, when the scheduler of NodeB begins to dispatch, need carry out initialization to the available situation of the K1 bar E-AGCH of each passage and the space division multiplexing number of times of every E-AGCH.
Particularly, scheduler can be deposited the E-AGCH space division multiplexing situation form of a K1 * M dimension.Capable m the element of the k of this form represented the available situation of k E-AGCH of sub-district at passage m: when this element is " 0 ", and expression " available "; When this element is " 1 ", expression " unavailable ".In " n+d0 " subframe, when the scheduler of NodeB began to dispatch, this E-AGCH space division multiplexing situation form was initialized to " 0 " entirely, represented that any E-AGCH is available on each passage of current subframe.
Scheduler also need be deposited the E-AGCH space division multiplexing coefficient table of a K1 * 1 dimension, the space division multiplexing coefficient of k the E-AGCH of k element representation in E-AGCH space division multiplexing coefficient form, promptly current multiplexing number.When the space division multiplexing coefficient of an E-AGCH equaled the number of active lanes of this sub-district, this E-AGCH can not be re-used again.In " n+d0 " subframe, when the scheduler of NodeB began to dispatch, the space division multiplexing coefficient form of E-AGCH was initialized to " 0 " entirely, was illustrated in each E-AGCH of current subframe and all also was not used.
Certainly, specifically E-AGCH also can preserve with other forms at the current available situation and the current multiplexing number of each passage.
B) scheduler is preserved the available situation of K2 bar E-HICH at this passage for each passage, and is the current multiplexing number of each this E-HICH of bar preservation among the K2 bar E-HICH; In " n+d0 " subframe, when the scheduler of NodeB begins to dispatch, need carry out initialization to the available situation of the K2 bar E-HICH of each passage and the space division multiplexing number of times of every E-HICH.
Particularly, scheduler can be deposited the E-HICH space division multiplexing situation form of a K2 * M dimension, and capable m the element of the k of this form represented the available situation of k E-HICH of sub-district at passage m: when this element is " 0 ", and expression " available "; When this element is " 1 ", expression " unavailable ".In " n+d0 " subframe, when the scheduler of NodeB began to dispatch, this E-HICH space division multiplexing situation form was initialized to " 0 " entirely, represented that any E-HICH is available on each passage of current subframe.
Scheduler also need be preserved the E-HICH space division multiplexing coefficient table of a K2 * 1 dimension, the space division multiplexing coefficient of k the E-HICH of k element representation in E-HICH space division multiplexing coefficient form, promptly current multiplexing number.When the space division multiplexing coefficient of an E-HICH equaled the number of active lanes of this sub-district, this E-HICH can not be re-used again.In " n+d0 " subframe, when the scheduler of NodeB began to dispatch, the space division multiplexing coefficient form of E-HICH was initialized to " 0 " entirely, was illustrated in each E-HICH of current subframe and all also was not used.
Certainly, specifically E-HICH also can preserve with other forms at the current available situation and the current multiplexing number of each passage.
C) scheduler is preserved in this passage the HSUPA resource in the available situation of each node of each time slot for each passage; In " n+d0 " subframe, when the scheduler of NodeB begins to dispatch, need carry out initialization in the available situation of each node of each time slot to the HSUPA resource of each passage.
Particularly, scheduler can be deposited the form of the E-PUCH resource of a T * 31 dimensions for each passage, and the t of this form is listed as the k row element and is illustrated in k node of t E-PUCH time slot in the available situation when prepass.Here, according to defined node and node number in the 3GPP standard.The value of node number k is from 0～31.The row of form number from 0 to 31.T representes the time slot sum that the E-PUCH resource pool of RNC configuration takies.Because the E-PUCH resource pool comprises 5 time slots at most, minimumly comprise a time slot, therefore, the maximum of T is 5, minimum value is 1.In the E-PUCH resource form of T * 31 dimensions, i is listed as i E-PUCH time slot of corresponding E-PUCH resource pool.The timeslot number of all time slots is according to timeslot number rank order from small to large in the E-PUCH resource form of T * 31 dimensions and in the E-PUCH resource pool; The minimum time slot of timeslot number is that first time slot of E-UCH resource form also is first time slot of E-PUCH resource pool; The timeslot number second little time slot is that second time slot of E-PUCH resource form also is second time slot of E-PUCH resource pool, and the maximum time slot of timeslot number is that last time slot of E-PUCH resource form also is last time slot of E-PUCH resource pool.
In current subframe, the scheduler of NodeB at first need be confirmed the E-PUCH resource pool of the scheduling of current subframe from the E-PUCH resource pool of RNC configuration.Illustrate E-PUCH resource pool how from the E-PUCH resource pool of RNC configuration, to confirm scheduling at current subframe scheduling device below.
Because the E-PUCH resource of RNC configuration comprises the E-PUCH resource of non-scheduling and the E-PUCH resource of scheduling; In current subframe; For confirming the E-PUCH resource pool of scheduling; The E-PUCH resource of the non-scheduling that need at first confirm to be used in current subframe is removed the E-PUCH resource of non-scheduling from the whole E-PUCH resource pool of RNC configuration then, and remaining E-PUCH resource just all belongs to the E-PUCH resource pool of scheduling.Because the E-PUCH of the non-scheduling of each HSUPA UE possibly adopt frame to divide multiplexing mode to dispose, therefore, all possibly change at the E-PUCH resource pool of the non-scheduling of each subframe.So, when scheduler begins to dispatch in each subframe, all need confirm E-PUCH resource pool in the non-scheduling of this subframe, confirm resource pool then at the E-PUCH of this subframe scheduling.
Such as, the E-PUCH resource pool of RNC configuration comprises 5 time slots: at first time slot, this resource pool comprises all 31 nodes; This resource pool of each time slot in second to the 4th time slot only comprises node 1; At the 5th time slot, this resource pool only comprises node 2.
If adopt the form of form to represent the E-PUCH resource pool of RNC configuration, this form is T * 31 dimension forms, and here, T=5: the first row all elements at this form is " 0 " all, representes that each node is all available; Each row in secondary series to the four row of this form, all child nodes of node 1 and node 1 are identified " 0 ", and other nodes are " 1 "; At the 5th row of this form, all child nodes of node 2 and node 2 are identified " 0 ", and other nodes are " 1 ".
When the node of E-PUCH time slot a RNC configuration belonged to the E-PUCH resource pool of RNC configuration, all child nodes of this node also all belonged to the E-PUCH resource pool of this RNC configuration.When a node of a node did not belong to the E-PUCH resource pool of RNC configuration, the father node of this node and this node belonged to RNC resources configured pond scarcely.
Suppose that at current subframe " n " E-PUCH of the non-scheduling of UE1 is positioned at first time slot and second time slot of E-PUCH resource pool, constitute by node 1 at the E-PUCH of the non-scheduling of each this UE of time slot.In current subframe, also have a UE2 to have the E-PUCH of non-scheduling.The E-PUCH of the non-scheduling of this UE is positioned at first time slot and the 5th time slot, is made up of node 2 at each time slot.
At current subframe " n "; The E-PUCH resource pool form of scheduling generates according to following method: in the E-PUCH resource pool form of RNC configuration; The node that will take in the non-scheduling E-PUCH of current subframe and all child nodes of these nodes all identify " 1 " with father node, just obtained the E-PUCH resource pool form of current subframe scheduling.In the E-PUCH resource pool, when arbitrary child node of certain node was unavailable, this node was also just unavailable.Concrete mode is following:
All provisional capitals of first row are identified " 1 "; Because the node of this time slot 1 is taken by the non-scheduling E-PUCH of UE1; Node 2 is taken by the non-scheduling E-PUCH of UE2; Therefore, all child nodes of node 1 and node 2 and these two nodes all need be identified " 1 " with father node, and consequently all node is all identified " 1 "; All provisional capitals in the secondary series are identified " 1 ", because the node of this time slot 1 is taken by the non-scheduling E-PUCH of UE1, therefore, all child nodes of node " 1 " and node 1 all need be identified " 1 "; In the 3rd row and the 4th row, the node 1 of each row all identifies " 0 " with all child nodes of node 1, and other node identifications become " 1 ", and the child node of node 1 comprises: node 3, node 4, node 7～node 10, node 15～node 22; All nodes of the 5th row are all identified " 1 ", because all child nodes of node 2 and node 2 are taken by the non-scheduling E-PUCH of UE2, therefore, all child nodes of node 2 and node 2 all need be identified " 1 ".
In current subframe, after the E-PUCH resource pool form of the scheduling of each passage is initialised, with identical according to the E-PUCH resource pool form of the scheduling of aforesaid way generation in current subframe.
Confirm according to said method after the E-PUCH resource pool of current subframe scheduling; E-PUCH resource pool form according to the scheduling of m the passage of E-PUCH resource pool initialization of current subframe scheduling: for node k at t the time slot of E-PUCH resource pool of scheduling; T in the E-PUCH resource form of scheduling is listed as k component identification becomes " 0 ", identifying this node can use; And all child nodes of this node are identified " 0 ", represent that all child nodes of this node can be used, such as, node u is the node of node k, with u the component identification one-tenth " 0 " of t row in the E-PUCH resource pool form of scheduling.In current subframe; When scheduler begins to dispatch; The structure of the E-PUCH resource form of later T * 31 that are initialised of each passage all is identical with content, and the E-PUCH resource form of the initialization scheduling of each passage and the E-PUCH resource pool of the scheduling that current subframe is confirmed are consistent.
D) scheduler is preserved HSUPA interference margins in this passage for each passage; In " n+d0 " subframe, when the scheduler of NodeB begins to dispatch, need carry out initialization to the HSUPA interference margins of each passage.
Particularly; Scheduler can be deposited the HSUPA interference margins form of 1 * M dimension; M element of this form represented the interference margins of HSUPA in m the passage of sub-district: when this element during for " 0 "; Represent that this passage has not had the HSUPA interference margins, can't be at any one UE of this channel scheduling.In " n+d0 " subframe, when the scheduler of NodeB began to dispatch, the HSUPA interference margins form of this 1 * M dimension was initialised.Each element of this form can be initialized to the HSUPA interference margins that this passage is assigned with when the network planning.
As previously mentioned, when the network planning, the HSUPA interference margins that each passage is assigned with has multiple possibility:
If when the network planning, confirm some passage m1 of certain sub-district, m2 ..., mn has independently HSUPA interference margins; And the interference margins of these passages is respectively: p1, and p2 ..., pn; Then in " n+d0 " subframe, when the scheduler of NodeB began to dispatch, the numerical value of confirming when the HSUPA interference margins of these passages just is initialized to the network planning: the HSUPA interference margins of mk passage was pk, here; K=1 among the mk, 2 ..., n.That is: mk element is pk in the HSUPA interference margins form of 1 * M dimension.These channels have independently, and this relation of HSUPA interference margins need go on record.If a UE is arranged later by successfully scheduling in passage mk, distributes to the HSUPA interference margins of this UE and can not reallocate to other UE among this passage mk.Therefore, a UE is arranged by successfully scheduling in the mk passage, the HSUPA interference margins of this passage will be updated once, and the HSUPA interference margins that upgrades this later passage equals this interference margins that upgrades this preceding passage and cuts the interference margins of distributing to this UE.Such as, first UE is by successfully scheduling in passage mk, and the interference margins of distributing to this UE is: b, the interference margins of this passage is updated to after this UE is scheduled: pk-b.Second interference margins by the UE of success scheduling is in this passage if distribute to: c, then after second UE was scheduled, the interference margins of this passage was updated (pk-b-c) by (pk-b).
If when the network planning, confirm some passage m1 of certain sub-district, m2 ..., mn shares same HSUPA interference margins p; Then in " n+d0 " subframe, when the scheduler of NodeB begins to dispatch, the interference margins of passage mk all is initialized as p, wherein; K=1 among the mk, 2 ..., n.That is: in 1 * M dimension HSUPA interference margins form, mk element is initialized as p.Need this relation record of this HSUPA interference margins of these channels share p be got off simultaneously.If a UE is arranged later by successfully scheduling in these passages, distributes to the HSUPA interference margins of this UE and can not reallocate to other UE in these passages.Therefore; A UE is arranged by successfully scheduling in the passage of these shared same disturbance surpluses; In all passages of sharing this same disturbance surplus; The HSUPA interference margins of each passage all will be updated once, and the HSUPA interference margins that upgrades each later passage equals this interference margins that upgrades this preceding passage and cuts the interference margins of distributing to this UE.Such as, first UE is by successfully scheduling in these passages, and this UE belongs to passage m1, and the interference margins of distributing to this UE is: b, the interference margins of any passage mk is updated in these passages after this UE is scheduled: p-b.Second interference margins by the UE of success scheduling is in these passages if distribute to: c, and second UE is positioned at passage m2, and then after second UE was scheduled, the interference margins of any passage mk was updated (p-b-c) by (p-b) in these passages.
The scheduler of NodeB also need be known the relevant information of UE, and that describes in the relevant information of these UE and the background technology is identical.Here just rearrange as follows simply:
1) the scheduling E-HICH set of the E-AGCH of each UE set and each UE;
2) each UE is through the breath of notifying on the E-RUCCH: the data volume on data total amount, highest priority logical channel ID, the highest priority logical channel, the power headroom of UE and SNPL value;
3) the HSUPA ability grade of this UE;
4) the reference table β table of each UE under the QPSK modulation;
5) each can support the reference table β table of UE under the 16QAM modulation of 16QAM modulation;
6) scheduling parameter of other these UE: the ARP parameter of this UE and SPI parameter.
Step 4, scheduler are calculated the dispatching priority of each HSUPA UE in " n+d0 " subframe.
In existing document, the method for the dispatching priority of calculating UE is a lot.Because this method is not a content of the present invention, repeats no more here.
Step 5, scheduler is lined up UE according to priority order from high to low.Scheduler begins scheduling from the highest UE of priority then.
When beginning to dispatch, all UE are in the tabulation of the UE that can be scheduled.In this tabulation, all UE rank according to priority order from high to low.Scheduler selects to make number one the UE of (priority is maximum) as first UE that is scheduled from this tabulation.UE of every scheduling just deletes this UE from this UE tabulation.To the UE that is scheduled, execution in step 6.If had no a UE in the UE tabulation, then directly finish the scheduling of current subframe, jump to step 7.If do not have available E-AGCH or E-HICH, also jump to step 7.If do not have the E-PUCH resource of available scheduling, jump to step 7 yet.If do not have available HSUPA interference margins, jump to step 7 yet.Here, if the current multiplexing number of E-AGCH or E-HICH equals the number of active lanes M of this sub-district, then this E-AGCH or E-HICH are unavailable.If at any passage, all elements in the E-PUCH resource form all is " 1 ", and then current subframe does not have available E-PUCH resource.If the interference margins of the HSUPA of any passage all is " 0 ", then expression does not have available HSUPA interference margins.
Scheduling process to each UE is all identical, is that example is explained concrete scheduling process with scheduling UE A below:
Step 61 is the E-AGCH of the UE A selection scheduling that is scheduled and the E-HICH of scheduling.
If there are a plurality of E-AGCH can make the E-AGCH of the scheduling of this UE A; Then from these E-AGCH, select the minimum E-AGCH of space division multiplexing coefficient; If the E-AGCH of space division multiplexing coefficient minimum is not unique, just select the E-AGCH of an E-AGCH at random as the scheduling of this UE.If do not exist an E-AGCH to can be used as the E-AGCH of this UE A, this UE A will not be scheduled.Directly return step 5, carry out the scheduling of next UE.
If there are a plurality of E-HICH can make the E-HICH of the scheduling of this UE; Then from these E-HICH, select the minimum E-HICH of space division multiplexing coefficient; If the E-HICH of space division multiplexing coefficient minimum is not unique, just select the E-HICH of an E-HICH at random for the scheduling of this UE.If do not exist an E-HICH to can be used as the E-HICH of this UE, this UE A will not be scheduled.Directly return step 5, carry out the scheduling of next UE.
The concrete mode of the E-AGCH of allocation schedule comprises:
On all passages at UE A place among the current all available E-AGCH, select current multiplexing number minimum and belong to an E-AGCH in the E-AGCH set of UE A, with the E-AGCH of this E-AGCH as the scheduling of UE A;
If current multiplexing number is minimum and E-AGCH that belong in the E-AGCH set of UE A is many, then select an E-AGCH arbitrarily; As if current all available E-AGCH on all passages that do not exist in UE A place, then be not that current scheduling UE distributes E-AGCH, E-PUCH and E-HICH, directly carry out the distribution of E-AGCH, E-PUCH and E-HICH for the next UE in the priority query.
Particularly, when the E-AGCH space division multiplexing coefficient table that ties up the E-AGCH space division multiplexing situation form and K1 * 1 of in scheduler, preserving the K1 described in the step 3 * M dimension, then the mode of the E-AGCH of this step allocation schedule can for:
If UE A occupies a passage m, then the number " m " with UE place passage is an index, consults " m " row of the E-AGCH space division multiplexing situation form of sub-district.In these row,, all select E-AGCH from being designated the E-AGCH of " 0 ", and each selecteed E-AGCH one fixes in the E-AGCH set of this UE A.If selecteed E-AGCH has only one, this E-AGCH is exactly the E-AGCH of the scheduling of this UE A.If more than one of selecteed E-AGCH selects the E-AGCH of the minimum E-AGCH of space division multiplexing coefficient as the scheduling of this UE A.If more than one of the E-AGCH of space division multiplexing coefficient minimum just selects an E-AGCH as scheduling at random.
If this UE A occupies a plurality of passages a: m1, m2 ..., mm just selects the E-AGCH that in these passages, all is not used.Concrete selection mode can for: in E-AGCH space division multiplexing situation form; Satisfy if k is capable: this row is at the m1 row, and m2 is listed as ...; The element of mm row all is " 0 ", and then k E-AGCH is exactly the E-AGCH that in the passage at UE place, all is not used.Selection is arranged in the E-AGCH of the E-AGCH set of UE in the E-AGCH that these are selected.If selecteed E-AGCH has only one, this E-AGCH is exactly the E-AGCH of the scheduling of UE A.If more than one of selecteed E-AGCH selects the E-AGCH of the minimum E-AGCH of reuse as this UE A.If more than one of the E-AGCH of reuse minimum selects the E-AGCH of an E-AGCH as scheduling at random.
If at E-AGCH that this UE A place passage is not used not in the E-AGCH of this UE A set, or at UE A place all E-AGCH of passage have been used, then this UE A will not be scheduled, and directly return step 5.
The space division multiplexing coefficient of k E-AGCH equals K1 * 1 and ties up the capable element of k in the space division multiplexing coefficient form of E-AGCH.
More than be the concrete mode of the E-AGCH of allocation schedule.The mode of the E-HICH of allocation schedule is identical with the mode of E-AGCH, comprising:
On all passages at UE A place among the current all available E-HICH, select current multiplexing number minimum and belong to an E-HICH in the E-HICH set of UE A, with the E-HICH of this E-HICH as the scheduling of UE A.
If current multiplexing number is minimum and E-HICH that belong in the E-HICH set of UE A is many, then select an E-HICH arbitrarily; As if current all available E-HICH on all passages that do not exist in UE A place, then be not that UE A distributes E-AGCH, E-PUCH and E-HICH, directly carry out the distribution of E-AGCH, E-PUCH and E-HICH for the next UE in the priority query.
Particularly, when the E-HICH space division multiplexing coefficient table that ties up the E-HICH space division multiplexing situation form and K2 * 1 of in scheduler, preserving the K2 described in the step 3 * M dimension, then the mode of the E-AGCH of this step allocation schedule can for:
If UE A occupies a passage m, then the number " m " with UE place passage is an index, consults " m " row of the E-HICH space division multiplexing situation form of sub-district.In these row,, all select E-HICH from being designated the E-HICH of " 0 ", and each selecteed E-HICH one fixes in the E-HICH set of this UE A.If selecteed E-HICH has only one, this E-HICH is exactly the E-AGCH of the scheduling of this UEA.If more than one of selecteed E-HICH selects the E-HICH of the minimum E-HICH of space division multiplexing coefficient as the scheduling of this UE A.If more than one of the E-HICH of space division multiplexing coefficient minimum just selects an E-HICH as scheduling at random.
If this UE A occupies a plurality of passages a: m1, m2 ..., mm just selects the E-HICH that in these passages, all is not used.Concrete selection mode can for: in E-HICH space division multiplexing situation form; Satisfy if k is capable: this row is at the m1 row, and m2 is listed as ...; The element of mm row all is " 0 ", and then k E-HICH is exactly the E-HICH that in the passage at UE A place, all is not used.Selection is arranged in the E-HICH of the E-HICH set of UE in the E-HICH that these are selected.If selecteed E-HICH has only one, this E-HICH is exactly the E-HICH of the scheduling of UE A.If more than one of selecteed E-HICH selects the E-HICH of the minimum E-HICH of reuse as this UE A.If more than one of the E-HICH of reuse minimum selects the E-HICH of an E-HICH as scheduling at random.
If at E-HICH that this UE A place passage is not used not in the E-HICH of this UE A set, or at UE A place all E-HICH of passage have been used, then this UE A will not be scheduled, and directly return step 5.
The space division multiplexing coefficient of k E-HICH equals K2 * 1 and ties up the capable element of k in the space division multiplexing coefficient form of E-HICH.
Step 62 is the E-PUCH resource of the UE A allocation schedule that is scheduled.
For the mode of the E-PUCH resource of each UE A allocation schedule that is scheduled following:
At first, need confirm the E-PUCH channel resource that on all passages at this UE place, all is not used.Next need confirm the interference margins at the passage HSUPA at this UE place.
HSUPA interference margins based on the E-PUCH channel resource that is not used in this UE place passage and this UE place passage; The method of number of power mandate and the E-UCCH that E-PUCH goes up carrying of E-PUCH of channel resource and scheduling of confirming the E-PUCH of scheduling for the UE that is scheduled is not a content of the present invention; Can consult pertinent literature and adopt the existing method that provides in the pertinent literature, repeat no more here.
Here; Need clear and definite: based on the HSUPA interference margins of the E-PUCH channel resource that is not used in this UE place passage and this UE place passage; When adopting existing method to be the E-PUCH of UE allocation schedule, distribution result possibly be: can't distribute E-PUCH for the UE that is scheduled.This UE will not be scheduled under this allocation result, directly return step 5, begin the scheduling to next UE.Here, can't distribute E-PUCH to comprise following situation for the UE that is scheduled:
(1) on this place passage, there is not available E-PUCH channel resource;
(2) the E-PUCH channel resource of distributing to this UE can't carry the minimum data piece of this UE;
(3) this UE place passage HSUPA interference margins is " 0 ";
(4) the E-PUCH power mandate of distributing to this UE can't be satisfied the SNR requirement of E-UCCH;
(5) other situation.
Illustrate channel resource and HSUPA interference margins how to confirm E-PUCH available on the passage at this UE place below.
When in scheduler, preserving the E-PUCH resource form of the T described in step 3 * 31 dimensions, confirm that then the mode of E-PUCH resource of scheduling available on the passage at this UE place is following for each passage:
If UE A only occupies a passage m, then the number " m " with this UE A place passage is an index, consults the E-PUCH resource form of T * 31 dimensions of " m " individual passage of sub-district.All nodes that are designated " 0 " all are the available E-PUCH channel resources of this UE in this form.If all elements all is " 1 " in this form, then being illustrated in this UE place passage does not have available E-PUCH channel resource, finishes the scheduling to this UE.Return step 5, begin scheduling next UE.
Simultaneously, consult " m " individual element of the HSUPA interference margins form of 1 * M dimension, the value of this element is exactly the interference margins of HSUPA on this UE A place passage.If this element equals " 0 ", just being illustrated in this UE place passage has not had available HSUPA interference margins, finishes the scheduling to this UE.Return step 5, begin scheduling next UE.
If this UE A occupies a plurality of passages: m1; M2 ..., mm; Just in the E-PUCH of these passages resource form, select the E-PUCH node that is not used, then the channel resource of the E-PUCH of the scheduling of definite this UE from these nodes by any passage.
Occupy under the situation of a plurality of passages the method for the E-PUCH node that selection is not used at UE:
If UE occupies a plurality of passages a: m1, m2 ...; Mm, the available E-PUCH resource form of this UE still are the forms of T * 31 dimension: if t is listed as the capable element of k and is " 0 " in the E-PUCH form of T * 31 dimensions of passage " mk ", here; K=1,2 ...; M, then t is listed as the capable element of k for " 0 " in the available E-PUCH resource form of this UE.If there be one " mk " at least, t is listed as the capable element of k for " 1 " in the E-PUCH resource form of " mk " individual passage, and then t is listed as the k row element and is " 1 " in the available E-PUCH resource form of this UE.In the available E-PUCH resource form of this UE the element of promising " 0 " all be the E-PUCH resource that this UE can use.If all elements all is " 1 " in this form, then being illustrated in this UE place passage does not have available E-PUCH channel resource, finishes the scheduling to this UE.Return step 5, begin scheduling next UE.
Simultaneously; Consult the HSUPA interference margins form of 1 * M dimension " m1 " individual element, " m2 " individual element ..., " mm " individual element; Ask the minimum value of these elements, this minimum value is exactly an available HSUPA interference margins on these all passages of UE place.If this minimum value equals " 0 ", just being illustrated in this UE place passage has not had available HSUPA interference margins, finishes the scheduling to this UE.Return step 5, begin scheduling next UE.
In each scheduling to each UE; Timing relationship between E-AGCH, E-PUCH and the E-HICH is provided with in advance; For the timing relationship between the E-AGCH, E-PUCH and the E-HICH that make the UE that distributes to each scheduling satisfies the timing relationship that is provided with in advance really, the E-PUCH of scheduling need satisfy following condition in the scheduling of current subframe:
(1) because the timing difference between E-AGCH and the E-PUCH is the d2=2 that fixes; Therefore the key that satisfies the timing relationship that is provided with in advance is to let and satisfies the timing relationship that is provided with in advance between E-PUCH and the E-HICH of UE A, that is: the subframe number of E-PUCH and E-HICH differs " d3 " sub-frame in this scheduling.
(2) value of d3 can only be 0,1,2 and 3.The value of d3 is decided by interval and the N between last time slot of time slot and E-PUCH at E-HICH place E-HICHRelation.For given d3 and N E-HICH, the constraints that can satisfy according to the timeslot number needs of last time slot of the anti-E-PUCH that releases scheduling of 3GPP standard.Definite method of this constraints can be consulted existing document, repeats no more here.
For making E-PUCH and E-HICH satisfy the timing relationship that is provided with in advance; First method is: when confirming E-PUCH; Just consider the constraint of above-mentioned d3, in the time slot that satisfies constraints, confirm the E-PUCH of this UE the timeslot number of last time slot of E-PUCH.Second method is: confirm E-PUCH earlier; According to the timeslot number of last time slot of E-PUCH, judge between E-PUCH and the E-HICH whether satisfy the timing relationship " d3 " that is provided with in advance then, if do not satisfy; Just do not dispatch this UE, directly dispatch next UE.
According to first method; Need from the passage at this UE A place, confirm current available E-PUCH node according to the method in the above-mentioned steps 62; Thereby form the corresponding available E-PUCH channel resource form of this UE A; On all passages of UE A place, timeslot number in the E-PUCH channel resource form of UE A correspondence is not satisfied node available on the constraints time slot of d3 all be arranged to unavailable then.At last, in the corresponding E-PUCH channel resource form of the UE of this renewal A, select E-PUCH in all enabled nodes.Illustrate said process below.
If the E-PUCH resource pool of RNC configuration is made up of time slot 2 and time slot 3; All nodes in these two time slots all are enabled nodes; And do not have the E-PUCH of non-scheduling in current subframe, therefore, all elements all is " 0 " in 2 * 31 dimension E-PUCH resource forms of current each passage of subframe.Carry out the scheduling of first UE now, this UE occupies a plurality of passages: m1, m2 ..., mm.Because this UE is first UE that is scheduled; Can confirm that according to the method in the above-mentioned steps 62 all elements all is " 0 " in 2 * 31 dimension E-PUCH resource forms of each passage mk that this UE belongs to; Therefore, all elements all is " 0 " in 2 * 31 dimension E-PUCH resource forms that this UE is corresponding.Be assumed to be the requirement that the timing relationship that makes between E-PUCH and the E-HICH satisfies d3, the timeslot number of last time slot of E-PUCH can not be a time slot 3.Therefore; According to this constraints the corresponding E-PUCH channel resource form of this UE is upgraded; The all elements that upgrades secondary series (timeslot number 3) in the corresponding E-PUCH channel resource form of this later UE is " 1 " all, representes that all nodes on this time slot are all unavailable.Scheduling to this UE will be based on the E-PUCH resource form of this renewal.
So far, accomplished distribution to E-AGCH, E-HICH and the E-PUCH of UE A.
After successfully for UE scheduling E-AGCH, E-HICH and E-PUCH resource, execution in step 63 is carried out the renewal of respective resources form; If successfully do not dispatch above-mentioned arbitrary resource, then return the scheduling that step 5 is carried out next UE for UE.
Step 63 is set to the E-AGCH that distributes to UE A and E-HICH unavailablely on the passage at UE A place, and upgrade the E-AGCH of this distribution and the current multiplexing number of E-HICH; On the passage at UE A place, be set to the E-PUCH resource of distributing to UE A unavailable.
Particularly; When the E-AGCH space division multiplexing coefficient table of the E-AGCH space division multiplexing situation form of in scheduler, preserving the K1 described in the step 3 * M dimension, K1 * 1 dimension, the E-HICH space division multiplexing situation form of K2 * M dimension, the E-HICH space division multiplexing coefficient table of K2 * 1 dimension; Preserve the E-PUCH resource form of the T described in the step 3 * 31 dimensions for each passage; And when preserving the HSUPA interference margins form of the 1 * M dimension described in the step 3 for all passages, then this step is upgraded following four types of forms exactly:
(1) E-AGCH space division multiplexing situation form, E-AGCH space division multiplexing coefficient form
(2) E-HICH space division multiplexing situation form, E-HICH space division multiplexing coefficient form
(3) the E-PUCH resource form of each passage
(4) the HSUPA interference margins form of all passages
If the scheduling E-AGCH of UE is the k1 bar E-AGCH of sub-district, can upgrade the E-AGCH space division multiplexing form and the E-AGCH space division multiplexing coefficient table of sub-district according to following mode.
(1) numerical value with k1 element in the space division multiplexing coefficient form of E-AGCH adds " N ", and here, N representes the number of active lanes that this UE occupies;
(2) this UE occupies a plurality of passages: m1, m2 ..., mm is with k1 the component identification one-tenth " 1 " of " mk " row in the E-AGCH space division multiplexing situation form.Here, the k=1 in " mk ", 2 ..., m.
If the scheduling E-HICH of UE is the k2 bar E-HICH of sub-district, can upgrade the E-HICH space division multiplexing situation form and the E-HICH space division multiplexing coefficient table of sub-district according to following mode.
(1) numerical value with k2 element in the space division multiplexing coefficient form of E-HICH adds " N ", and here, N representes the number of active lanes that this UE occupies;
(2) this UE occupies a plurality of passages: m1, m2 ..., mm is with k2 the component identification one-tenth " 1 " of " mk " row in the E-HICH space division multiplexing situation form.Here, the k=1 in " mk ", 2 ..., m.
E-PUCH resource form upgrades according to following mode:
If UE occupies a plurality of passages a: m1, m2 ..., mm, the E-PUCH of the scheduling of UE adopts node u, occupies a plurality of time slots: t1 in the available E-PUCH resource form, t2 ..., tn.In the E-PUCH resource form that tie up T * 31 of passage " mk ", ti is listed as u capable (ti row node u) component identification and becomes " 1 ", and all child nodes of node u in the ti row are all identified " 1 " with father node.Here, k=1 in " mk ", 2 ..., m, the i=1 in " ti ", 2 ..., n.
The update mode of the HSUPA interference margins form of 1 * M dimension is: calculating the interference that this UE causes adjacent sub-district according to the power mandate of the E-PUCH of the scheduling of UE is p; Current interference margins with this UE place passage deducts p then; And confirm to belong to the passage of any same interference margins of channels share with this UE, the current interference margins of definite passage is deducted p.Concrete can upgrade according to following method:
If UE occupies a plurality of passages a: m1, m2 ...; Mm, calculating the interference that this UE causes adjacent sub-district according to the power mandate of the E-PUCH of the scheduling of UE is p, the numerical value with mk element in the HSUPA interference margins form of 1 * M dimension deducts p then; Here, k=1 in " mk ", 2; ..., m.And establish this UE place passage mk and same HSUPA interference margins of sub-district other d channels share, and this d passage is: d1 (k), and d2 (k) ..., dd (k).Then also need the HSUPA interference margins of this d passage be upgraded, the HSUPA interference margins of passage di (k) is cut p.
Step 7 sends to the schedule information of all UE that are scheduled the physical layer of NodeB.The schedule information of each UE mainly comprises:
1) the HSUPA UE ID of this UE
2) the E-AGCH ID of scheduling and E-AGCH go up data carried by data: the E-DCH control information
3) the E-HICH ID of scheduling
4) the E-PUCH information of scheduling: the power mandate of timeslot number that E-PUCH takies and node number, E-PUCH
5) timing relationship between the E-HICH of the E-PUCH of the E-AGCH of scheduling, scheduling and scheduling: this timing relationship is provided with in advance, and the E-AGCH of scheduling sends in the n+d0+d1 subframe, and the E-PUCH of scheduling sends in the n+d0+d1+d2 subframe; The E-HICH of scheduling sends in the n+d0+d1+d2+d3 subframe
Step 8; Physical layer is according to the timing relationship between E-AGCH.E-PUCH and the E-HICH; The E-AGCH of each UE that is scheduled is sent to this UE through the RRU PATH that this UE belongs to passage in subframe " n+d0+d1 "; To receive the E-PUCH that this UE sends at the RRU PATH of the UE place passage of subframe " n+d0+d1+d2 " through this scheduling, the E-HICH that sends this UE at the RRU PATH of subframe " n+d0+d1+d2+d3 " through this UE place passage then gives this UE.
So far, space division multiplexing method flow process of the present invention finishes.Above-mentioned just a kind of implementation method of HSUPA space division multiplexing.
When a Uplink Shared Channel in current subframe by N UE space division multiplexing, when NodeB detects the information that each UE sends through this channel in current subframe, need respectively to carry out the detection of this channel based on the passage at each UE place.Such as: UE1, UE2 and UE3 are at current subframe space division multiplexing E-PUCH.UE1 and UE2 are respectively in passage " 1 " and " 2 ", and UE3 is in passage " 3 " and " 4 ".The signal that then sends through E-PUCH according to the reception input UE1 of all RRU PATH of passage 1; The signal that sends through E-PUCH according to the reception input UE2 of all RRU PATH of passage 2; The signal that sends through E-PUCH according to the reception input UE3 of all RRU PATH of passage 3 and passage 4.
The time that each space division multiplexing occupies is: the 1+d0+d1+d2+d3 sub-frame, therefore, requiring during this period of time, the passage of UE does not change.Otherwise possibly cause the space division multiplexing failure.
In addition in existing HSUPA system; When detection is used for the SYNC-UL of HSUPA scheduling resource application; If in detection, find collision phenomenon, just refuse the access of all UE, thereby greatly reduce the access probability of SYNC-UL through this sequence to m SYNC-UL.
Consider the problems referred to above, to FPACH and E-RUCCH, preferably also can realize space division multiplexing among the present invention through the repeated use on different passages.
Particularly; When detection is used for the SYNC-UL of HSUPA scheduling resource application; If NodeB finds in the detection of m SYNC-UL sequence, to bump; That is: find that K UE possibly adopt m SYNC-UL sequence to insert simultaneously, then at first confirm the position that each collision occurs in m the SYNC-UL detection.If such position has K,, confirm the passage at the UE place of this SYNC-UL of emission in the position that each SYNC-UL occurs.If there is not the overlapping part in the passage between any two UE, then can adopt the space division multiplexing of FPACH.
In the concrete implementation procedure; If through detection to m SYNC-UL sequence; Discovery has K UE to initiate to insert request in current subframe through m SYNC-UL sequence simultaneously; And this K UE is in different passages, does not have common passage between any two UE, and then this K UE can be through multiplexing FPACH of space division multiplexing mode and E-RUCCH.That is: the RRU PATH of the passage through k UE place sends FPACH, and this FPACH goes up the power that carries k UE and controls and synchronically controlling information, k=1 wherein, and 2 ..., K.
Since the space division multiplexing of FPACH, the subframe that the E-RUCCH corresponding with this FPACH occurs, and K UE will send E-RUCCH information separately through E-RUCCH in this subframe.Sky that be to realize E-RUCCH divides and receives, and when receiving the E-RUCCH that k UE send, can realize the sky branch reception of E-RUCCH like this according to the E-RUCCH of k the UE transmission of reception input of the RRU PATH of k UE place passage.
If through finding to have K UE to initiate to insert request in current subframe through m SYNC-UL sequence simultaneously to the detection of m SYNC-UL sequence; And through the detection of m SYNC-UL being confirmed the passage at these UE places; Be not that any two UE have different passages in this K UE; But can from this K UE, select several UE (being made as the individual UE of K '); Have different passages between any two UE among the individual UE of this K ', and the passage at the individual UE of this K ' and (K-K ') in addition individual UE place do not overlap, then the individual UE of this K ' can multiplexing FPACH of space division multiplexing mode and E-RUCCH.That is: the RRU PATH of the passage through k UE place sends FPACH, and this FPACH goes up the power that carries k UE and controls and synchronically controlling information, wherein, k=1,2 ..., K '.The E-RUCCH of this UE transmission of reception input of the RRU PATH through k UE place passage then.Like this, the individual UE of this K ' just can realize space division multiplexing FPACH and E-RUCCH.
By the way, can improve the utilance of FPACH and E-RUCCH resource, and then save channel code, improve spectrum efficiency.And under the fixing situation of FPACH and E-RUCCH resource, can improve the access probability of UE.Promptly the place of the UE through further collision detection passage can respond those UE that occupies different passages, thereby has improved the access probability of SYNC-UL.
The above-mentioned concrete realization that is realization space division multiplexing in the multichannel HSUPA system, the space division multiplexing of this shared channel is decided by NodeB in real time, through this space division multiplexing method, can improve the utilance and the spectrum efficiency of shared channel.In the multi-channel system of this HSUPA; When carrying out the space division multiplexing of shared channel; Can be each the independently adjacent sub-district of passage setting HSUPA interference margins according to the concrete characteristics of this multi-channel system; Can let the same adjacent sub-district of all channels share HSUPA interference margins, also can let the same adjacent sub-district of several channels share HSUPA interference margins.That is: in the multi-channel system of HSUPA, can realize the space division multiplexing of HSUPA interference margins as the case may be.
More than being merely preferred embodiment of the present invention, is not to be used to limit protection scope of the present invention.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (19)

1. the space division multiplexing method of shared channel in the multichannel HSUPA system is characterized in that this method comprises:
The timing relationship of E-HICH of E-PUCH and scheduling of E-AGCH, the scheduling of scheduling is set in advance, and said timing relationship is all identical to each scheduling of all UE;
Confirm the passage at each UE place according to the reception signal of each UE up channel, and confirm the dispatching priority of each UE;
According to dispatching priority order from high to low; Be followed successively by the E-AGCH of each UE allocation schedule, the E-PUCH resource of scheduling and the E-HICH of scheduling; And arbitrary E-AGCH, arbitrary E-HICH or arbitrary E-PUCH resource allow to be assigned on N the different passages; Said N is the natural number smaller or equal to total number of channels in the sub-district, and on same passage, only allows to distribute once;
Timing relationship according to preset E-AGCH, E-PUCH and E-HICH; The passage that utilizes each UE place issues control data through the E-AGCH for the said scheduling of this UE distribution; Utilize the passage at each UE place to receive the uplink information data that corresponding UE sends through the E-PUCH resource, and the passage that utilizes each UE place through for the E-HICH of the said scheduling of this UE distribution to these UE feedback states data.
2. method according to claim 1; It is characterized in that; This method further comprises: in NodeB, preserve the available situation of each E-AGCH of this NodeB at this passage of distributing to for each passage, for said each E-AGCH preserves the current multiplexing number of this E-AGCH on each passage;
For the mode of the E-AGCH of current scheduling UE allocation schedule comprises:
On all passages at said current scheduling UE place among the current all available E-AGCH; Select current multiplexing number minimum and belong to an E-AGCH in the E-AGCH set of said current scheduling UE, with the E-AGCH of this E-AGCH as the scheduling of current scheduling UE;
After the E-AGCH, E-HICH and the E-PUCH resource that are said current scheduling UE allocation schedule; This method further comprises: the E-AGCH that selects is set to unavailable on all passages at current scheduling UE place, and upgrades the current multiplexing number of the E-AGCH that selects.
3. method according to claim 2 is characterized in that, if current multiplexing number is minimum and E-AGCH that belong in the E-AGCH set of said current scheduling UE is many, then selects an E-AGCH arbitrarily;
As if current all available E-AGCH on all passages that do not exist in said current scheduling UE place; Then, directly carry out the distribution of E-AGCH, E-PUCH and E-HICH for the next UE in the priority query not for current scheduling UE distributes E-AGCH, E-PUCH and E-HICH.
4. method according to claim 1; It is characterized in that; This method further comprises: in NodeB, preserve the available situation of each E-HICH of this NodeB at this passage of distributing to for each passage, for said each E-HICH preserves the current multiplexing number of this E-HICH on each passage;
For the mode of the E-HICH of current scheduling UE allocation schedule comprises:
On all passages at said current scheduling UE place among the current all available E-HICH; Select current multiplexing number minimum and belong to an E-HICH in the E-HICH set of said current scheduling UE, with the E-HICH of this E-HICH as the scheduling of current scheduling UE;
After the E-AGCH, E-HICH and the E-PUCH resource that are said current scheduling UE allocation schedule; This method further comprises: the E-HICH that selects is set to unavailable on all passages at current scheduling UE place, and upgrades the current multiplexing number of the E-HICH that selects.
5. method according to claim 4 is characterized in that, if current multiplexing number is minimum and E-HICH that belong in the E-HICH set of said current scheduling UE is many, then selects an E-HICH arbitrarily;
As if current all available E-HICH on all passages that do not exist in said current scheduling UE place; Then, directly carry out the distribution of E-AGCH, E-PUCH and E-HICH for the next UE in the priority query not for current scheduling UE distributes E-AGCH, E-PUCH and E-HICH.
6. method according to claim 1; It is characterized in that; This method further comprises: the E-PUCH resource pool of confirming the scheduling of current subframe; In NodeB, preserve the available situation of each node on each time slot of the E-PUCH resource pool of the scheduling of current subframe described in this passage, and in NodeB, preserve the interference margins of each passage for each passage;
For the mode of the E-PUCH resource of current scheduling UE allocation schedule comprises:
Confirm the minimum data piece of said current scheduling UE according to the data volume of said current scheduling UE;
Confirm current all available E-PUCH resource and the available interference surplus of all passages of said current scheduling UE place on all passages at said current scheduling UE place; And according to said available interference surplus; The E-PUCH channel resource of the minimum data piece of said current scheduling UE is carried in selection at least in the E-PUCH channel resource of confirming, as the E-PUCH resource of the scheduling of distributing to said current scheduling UE;
After the E-AGCH, E-HICH and the E-PUCH resource that are said current scheduling UE allocation schedule; This method further comprises: on all passages at said current scheduling UE place; The node that the E-PUCH resource of selecting is adopted and all father nodes thereof, all child nodes are set to unavailable on corresponding time slot; Upgrade the interference margins of said current scheduling UE place passage; And confirm that preset and current scheduling UE belong to the passage of any channels share same disturbance surplus, upgrade the interference margins of this passage of confirming.
7. method according to claim 6; It is characterized in that; The E-PUCH resource pool of the scheduling of said definite current subframe comprises: the E-PUCH resource of confirming the non-scheduling that current subframe is used; Dispose the E-PUCH resource of the non-scheduling that will confirm the E-PUCH resource pool to said NodeB from RNC and remove, the resource pool that remaining E-PUCH resource is formed is as the E-PUCH resource pool of the scheduling of current subframe.
8. method according to claim 6; It is characterized in that; The available interference surplus of all passages of said definite current scheduling UE place comprises: confirm the current interference margins of each passage in all passages of current scheduling UE place, minimum value is wherein belonged to the available interference surplus of all passages as current scheduling UE.
9. method according to claim 6 is characterized in that, the said E-PUCH channel resource of in the E-PUCH channel resource of confirming, selecting comprises:
The E-PUCH node and the time slot of the minimum data piece of said current scheduling UE carried in selection at least in the E-PUCH channel resource of confirming; And judge whether selected time slot and the E-HICH that distributes for current scheduling UE satisfy preset timing relationship; If, the E-PUCH channel resource that then the E-PUCH channel resource of selecting is distributed as current scheduling UE; Otherwise, judge the E-PUCH node and the time slot that there are not the minimum data piece that carries said current scheduling UE at least.
10. method according to claim 6 is characterized in that, the said E-PUCH channel resource of in the E-PUCH channel resource of confirming, selecting comprises:
According to the E-HICH that distributes for current scheduling UE; In said current all available E-PUCH channel resource, confirm; Satisfy the E-PUCH channel resource of preset timing relationship with the E-HICH that distributes for current scheduling UE, in the E-PUCH channel resource that satisfies preset timing relationship, select to carry at least the E-PUCH node and the time slot of the minimum data piece of said current scheduling UE.
11. method according to claim 6 is characterized in that, if in said current all available E-PUCH resource, does not have the E-PUCH node and the time slot of the minimum data piece that carries said current scheduling UE at least, and/or,
If confirm that the available interference surplus of all passages of current scheduling UE place is 0,
Then, directly carry out the distribution of E-AGCH, E-PUCH and E-HICH for the next UE in the priority query not for current scheduling UE distributes E-AGCH, E-PUCH and E-HICH.
12. method according to claim 6 is characterized in that, the interference margins of the said current scheduling UE of said renewal place passage comprises:
Calculate the interference value that said current scheduling UE causes adjacent sub-district, and the current interference margins on all passages at current scheduling UE place is deducted the interference value that calculates, as the interference margins after upgrading;
To with the passage of any channels share interference margins at current scheduling UE place, the interference margins that upgrades this passage comprises: the current interference margins of this passage is deducted the said interference value that calculates, as the interference margins after upgrading.
13., it is characterized in that when the network planning, this method further comprises according to claim 6 or 12 described methods: the initial interference surplus that interference margins sharing mode and each passage are set for all passages in the sub-district.
14. method according to claim 13 is characterized in that, the same interference margins of all channels share, perhaps, and the same interference margins of part channels share in all passages, perhaps, different passages are assigned with different interference margins.
15. method according to claim 13 is characterized in that, the same interference margins of channels share that identical adjacent sub-district is caused interference is set in the sub-district.
16. method according to claim 1 is characterized in that, said reception signal according to up channel confirms that the passage at each UE place comprises:
If there is a up channel in UE at the current ascending time slot of current subframe, then utilize the reception signal of this up channel to confirm the passage that this UE belongs to;
If there are a plurality of up channels in UE at the current ascending time slot of current subframe; Then utilize the reception signal of all up channels to confirm the passage that this UE belongs to; Perhaps, utilize the reception signal of preset in all a up channels up channel to confirm the passage that this UE belongs to;
If there is up channel in UE at a plurality of ascending time slots of current subframe; Then utilize all up channels of all time slots in said a plurality of ascending time slot to confirm the passage that UE belongs to; Perhaps; Preset ascending time slot utilizes all up channels of this ascending time slot or a up channel that is provided with in advance of this time slot to confirm the passage that UE belongs to, perhaps; Utilize one of them preset up channel, the passage that utilizes this up channel to confirm the UE place at the reception signal of a time slot that is provided with in advance at reception signal or this up channel of all ascending time slots.
17. method according to claim 16 is characterized in that, said up channel is: the special uplink channel of UE, or, be assigned to this UE and not by the shared up channel of space division multiplexing in current subframe.
18. method according to claim 1; It is characterized in that this method further comprises: when detecting uplink synchronous sequence, if a plurality of UE adopt identical uplink synchronous sequence to insert simultaneously; Then confirm the passage at each UE place among said a plurality of UE; If it is overlapping that the passage that any two UE belong among said a plurality of UE does not exist, then utilize the passage at each UE place among said a plurality of UE to send FPACH, and utilize the passage at each UE place among said a plurality of UE to detect E-RUCCH.
19. method according to claim 1; It is characterized in that; This method further comprises: when detecting uplink synchronous sequence, if a plurality of UE adopt identical uplink synchronous sequence to insert simultaneously, then confirm the passage at each UE place among said a plurality of UE; If among said a plurality of UE is not that any two UE are in different passages; Then from said a plurality of UE, confirm wherein a part of UE, the passage that any two UE belong among said a part of UE does not exist overlapping, and the passage at the passage at this a part of UE place and other UE place does not exist overlapping; Utilize the passage at each UE place among said a part of UE to send FPACH, and utilize the passage at each UE place among said a part of UE to detect E-RUCCH.
CN2009100778801A 2009-01-24 2009-01-24 Space division multiplexing method of shared channel in multichannel HSUPA system Expired - Fee Related CN101790237B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2009100778801A CN101790237B (en) 2009-01-24 2009-01-24 Space division multiplexing method of shared channel in multichannel HSUPA system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2009100778801A CN101790237B (en) 2009-01-24 2009-01-24 Space division multiplexing method of shared channel in multichannel HSUPA system

Publications (2)

Publication Number Publication Date
CN101790237A CN101790237A (en) 2010-07-28
CN101790237B true CN101790237B (en) 2012-06-27

Family

ID=42533215

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2009100778801A Expired - Fee Related CN101790237B (en) 2009-01-24 2009-01-24 Space division multiplexing method of shared channel in multichannel HSUPA system

Country Status (1)

Country Link
CN (1) CN101790237B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102469567B (en) * 2010-11-05 2015-02-25 鼎桥通信技术有限公司 Correction method of power authorization of E-DCH physical uplink channel (E-PUCH)
CN103491597B (en) * 2013-09-06 2016-05-11 京信通信系统（中国）有限公司 A kind of connection control method of micro-base station and device
CN110875749A (en) * 2018-09-03 2020-03-10 中兴通讯股份有限公司 Power determination method, device, terminal and computer readable storage medium
CN112367705A (en) * 2020-10-26 2021-02-12 Tcl通讯（宁波）有限公司 Frequency domain resource allocation method, device and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101035085A (en) * 2007-04-28 2007-09-12 华为技术有限公司 Scheduling method and device for the high-speed uplink packet access technology
CN101141779A (en) * 2007-10-12 2008-03-12 中兴通讯股份有限公司 Scheduling authorization method and device of multi-carrier HSUPA

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101035085A (en) * 2007-04-28 2007-09-12 华为技术有限公司 Scheduling method and device for the high-speed uplink packet access technology
CN101141779A (en) * 2007-10-12 2008-03-12 中兴通讯股份有限公司 Scheduling authorization method and device of multi-carrier HSUPA

Also Published As

Publication number Publication date
CN101790237A (en) 2010-07-28

Similar Documents

Publication Publication Date Title
CN101156334B (en) Method of managing radio resources and node b apparatus implementing the same
CN101800939B (en) The method used in radio communication and base station and user equipment
CN102387593B (en) Communication method adopting space-division multiple access (SDMA) and base station
CN101854643B (en) Wireless resource multiplexing method and equipment and system thereof
CN107079437A (en) User's set, feedback and retransmission control method
CN102761968A (en) Method for allocating uplink resource of SRS (Sounding Reference Signal) of multi-user equipment and base station
CN102474749B (en) Resources scheduling method for spectrum sharing system and base station
CN104937867A (en) Intercell interference coordination accounting for machine type communication
SE514781C2 (en) Method and apparatus in a radio communication system
CN101790237B (en) Space division multiplexing method of shared channel in multichannel HSUPA system
CN103312462B (en) Solve TDD ascending resource configuration information and the method for HARQ response message collision
CN103313402A (en) Uplink resource distribution method, device and system
CN102238649B (en) Method and device for avoiding uplink channel interferences in heterogeneous system
CN102264123B (en) Method and device for distributing PDSCH (physical downlink shared channel) power
CN101790236B (en) Space division multiplexing method of shared channel in multichannel HSDPA system
CN102017754B (en) Resource allocation in two domains
CN101998634B (en) Method, system and equipment for transmitting periodical feedback information
CN101783692B (en) Implementation method of uplink reference marks in time division-synchronization code division multiple access (TD-SCDMA) system
CN103580792A (en) Resource allocation method and device
KR101004050B1 (en) Transmission rate control method, radio communication system, and base station
CN102215588B (en) HSUPA (High Speed Uplink Packet Access) scheduler and scheduling method by adopting MU MIMO (Multiple User Multiple Input Multiple Output) technology
CN101959234B (en) Method for realizing multi-carrier HSUPA
CN102387497A (en) Base station and allocation method of radio network temporary identities
CN101998655B (en) Multicarrier high-speed uplink packet access scheduling method
CN103220790B (en) The distribution method and device of control channel resource

Legal Events

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

Granted publication date: 20120627

Termination date: 20160124

EXPY Termination of patent right or utility model