WO2011050729A1 - 通信网络中的资源分配方法和装置 - Google Patents

通信网络中的资源分配方法和装置 Download PDF

Info

Publication number
WO2011050729A1
WO2011050729A1 PCT/CN2010/078191 CN2010078191W WO2011050729A1 WO 2011050729 A1 WO2011050729 A1 WO 2011050729A1 CN 2010078191 W CN2010078191 W CN 2010078191W WO 2011050729 A1 WO2011050729 A1 WO 2011050729A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
users
communication network
carrier
resource
Prior art date
Application number
PCT/CN2010/078191
Other languages
English (en)
French (fr)
Inventor
魏宇欣
Original Assignee
索尼公司
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 索尼公司 filed Critical 索尼公司
Priority to US13/500,079 priority Critical patent/US9258091B2/en
Priority to CA2776537A priority patent/CA2776537A1/en
Priority to EP10826092.8A priority patent/EP2472978B1/en
Priority to KR1020127011006A priority patent/KR101675179B1/ko
Priority to BR112012009650A priority patent/BR112012009650A2/pt
Priority to MX2012004658A priority patent/MX2012004658A/es
Priority to JP2012535615A priority patent/JP5573957B2/ja
Priority to RU2012122170/07A priority patent/RU2520602C2/ru
Priority to AU2010312097A priority patent/AU2010312097A1/en
Publication of WO2011050729A1 publication Critical patent/WO2011050729A1/zh
Priority to ZA2012/03081A priority patent/ZA201203081B/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044Arrangements for allocating sub-channels of the transmission path allocation of payload
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058Allocation criteria
    • H04L5/006Quality of the received signal, e.g. BER, SNR, water filling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/0001Arrangements for dividing the transmission path
    • H04L5/0003Two-dimensional division
    • H04L5/0005Time-frequency
    • H04L5/0007Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H04L5/001Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT the frequencies being arranged in component carriers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0037Inter-user or inter-terminal allocation
    • H04L5/0039Frequency-contiguous, i.e. with no allocation of frequencies for one user or terminal between the frequencies allocated to another
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0037Inter-user or inter-terminal allocation
    • H04L5/0041Frequency-non-contiguous

Definitions

  • the present invention relates to the field of communications, and in particular, to a resource allocation method and apparatus in a communication network.
  • the goal of the resource scheduling algorithm is to flexibly allocate the available resources in the communication network according to user requirements and channel characteristics under conditions of limited resources, thereby maximizing the wireless transmission utilization. Due to the introduction of carrier aggregation technology, traditional resource scheduling algorithms are no longer sufficient. The scheduling algorithm under carrier aggregation faces many challenges and is also the key to improving the overall performance of the system.
  • a resource allocation method in a communication network may include: determining a carrier aggregation mode of the communication network; and selecting a resource allocation manner of the communication network according to a carrier aggregation manner of the communication network.
  • a resource allocation device in a communication network may include: a convergence mode determining module, configured to determine a carrier aggregation mode of the communication network; and an allocation mode selection module, configured to select resources of the communication network according to a carrier aggregation mode of the communication network Allocation.
  • embodiments of the present invention also provide a calculation sequence for implementing the above resource allocation method.
  • embodiments of the present invention also provide a computing program product in the form of at least a computer readable medium having recorded thereon computer program code for implementing the resource allocation method described above.
  • FIG. 1 is a schematic diagram showing a communication network supporting carrier aggregation
  • FIG. 2 is a schematic flow chart showing a resource allocation method according to an embodiment of the present invention.
  • FIG. 3 is a schematic flow chart showing a resource allocation method according to another embodiment of the present invention.
  • FIG. 4 is a schematic flow chart showing a centralized resource allocation manner according to another embodiment of the present invention.
  • FIG. 5 is a schematic flow chart showing a distributed resource allocation manner according to an embodiment of the present invention.
  • FIG. 6 is a schematic flow chart showing a resource allocation method according to another embodiment of the present invention.
  • FIG. 7 is a diagram showing an exemplary flow chart for selecting a set of users to be scheduled according to an embodiment of the present invention.
  • FIG. 8 is a diagram showing an exemplary flow chart for selecting a user set to be scheduled and sorting users therein according to an embodiment of the present invention
  • FIG. 9 is a schematic diagram showing a resource allocation device according to an embodiment of the present invention.
  • FIG. 10 is a schematic block diagram showing a resource allocation device according to another embodiment of the present invention.
  • FIG. 11 is a schematic block diagram showing a resource allocation device according to another embodiment of the present invention.
  • FIG. 12 is a schematic block diagram showing a resource allocation device according to another embodiment of the present invention.
  • Figure 13 is an exemplary block diagram showing the structure of a computer for implementing the present invention.
  • LTE-A Long Term Evolution-Advanced
  • LTE-A Long Term Evolution-Advanced
  • LTE-A Long Term Evolution-Advanced
  • LTE-A supports both aggregation methods.
  • 3GPP also considers backward compatibility when introducing carrier aggregation technology, which means that terminals supporting carrier aggregation and carrier aggregation will coexist for a long time in a long period of time, and terminals supporting carrier aggregation can simultaneously access.
  • a plurality of carrier units, which do not support carrier aggregation, can only access one carrier unit.
  • a scheduling algorithm in accordance with some embodiments of the present invention takes this into account and makes good use of it. Improve system performance.
  • the scheduling algorithm according to some embodiments of the present invention also considers the diversity of terminals (supporting or not supporting carrier aggregation and user performance differences for different carrier units) and the resulting scheduling fairness problem, while improving system performance. Full consideration of user fairness.
  • how to utilize the frequency selective gain brought by the carrier aggregation technique and improve the multi-user diversity gain, thereby improving the overall performance of the system is also a problem considered by the resource allocation algorithm according to some embodiments of the present invention.
  • FIG. 1 illustrates an exemplary communication network that supports carrier aggregation.
  • a plurality of users 102, 103, and 104 are served by a base station (e.g., e-NodeB) 101 within a cell.
  • These users may be carrier-aggregated (CA-NS), such as user 102; or may be carrier-aggregated (CA-S), such as users 103 and 104.
  • CA-NS carrier-aggregated
  • CA-S carrier-aggregated
  • the carrier aggregation mode supported by the communication network is determined by the base station.
  • the carrier units supported by the communication network include CC 1, CC2, and CC3.
  • the carrier unit CC 1 and the carrier unit CC2 are continuous, and the carrier unit CC3 is discontinuous with the carrier units CC 1 and CC2.
  • a “user terminal” such as a mobile device used by an individual user to access a communication network, such as a mobile phone (such as 102 and 103 of FIG. 1). ), personal digital assistant or laptop, etc.
  • the resource allocation (scheduling) method is to allocate resources (such as the resource block RB shown in FIG. 1) for each user that requests the service. Specifically, for a user who does not support carrier aggregation, it is determined that the user can support it. Resources that can be occupied in the carrier unit. For users supporting carrier aggregation, determine the carrier units that the user can occupy and the resources in the corresponding carrier unit. For example, in the example of FIG. 1, terminal 102 can only use resources on carrier unit CC1, while terminal 103 can support carrier units CC1 and CC3, and terminal 104 can support carrier units CC1, CC2, and CC3.
  • FIG. 2 is a schematic flow chart showing a resource allocation method according to an embodiment of the present invention.
  • the resource allocation method includes the following steps S201 and S203.
  • step S201 the carrier aggregation mode of the communication network is first determined.
  • the communication network described herein is a communication system that supports carrier aggregation, such as the communication network shown in FIG.
  • the communication network may include nodes that support carrier aggregation (such as terminal 102 shown in FIG. 1), and may also include nodes that do not support carrier aggregation (terminals 103 and 104 as shown in FIG. 1).
  • a carrier aggregation mode supported by the communication network may be determined by a primary node (eg, a base station) of the communication network, for example, may be from a primary node.
  • the information about the carrier aggregation mode is obtained in the corresponding configuration file of the (base station), thereby determining the carrier aggregation mode supported by the communication network.
  • step S203 the resource allocation mode of the trusted network is selected according to the determined carrier aggregation mode.
  • This embodiment selects different resource allocation methods according to different scenarios of carrier aggregation, which can effectively improve the frequency diversity gain of the system.
  • FIG. 3 shows an application example of the resource allocation method shown in FIG. 2.
  • the carrier aggregation mode of the communication network generally includes continuous carrier aggregation (CC 1 and CC 2 as shown in FIG. 1 ) and discontinuous carrier aggregation (CC 1 and CC 3 as shown in FIG. 1 ). the way.
  • different resource allocation methods are selected for the two different aggregation modes.
  • a carrier aggregation mode of the communication network is determined.
  • step S301-1 it is judged whether the determined carrier aggregation mode is continuous or discontinuous. If it is continuous, in step S303-1, a distributed resource allocation mode is selected for resource allocation. If it is discontinuous, in step S303-2, a centralized resource allocation mode is selected for allocating resources of the communication network.
  • FIG. 4 shows an example of the centralized resource allocation method shown in Figure 3. As shown in FIG. 4, the centralized resource allocation may include the following steps S409 and S411.
  • step S409 for each user in the set of users to be scheduled of the communication network, calculate performance indicators of the user on each of the assignable resource unit sets in the set of carrier units (for the purpose of description Convenient, referred to here as the first performance indicator).
  • the so-called “Resource Block (abbreviated as RB)” can refer to the smallest transmission unit (time-frequency resource).
  • the first performance indicator may be user traffic, channel gain, signal to noise ratio, frequency transmission efficiency or bit error rate, etc., as can be understood by those skilled in the art, and may be selected according to needs in a specific application. Not listed here.
  • Calculating a first performance indicator of a user on a certain resource block of a carrier unit that is, calculating or estimating a performance index of the user on the resource block, such as traffic, channel gain, bit error rate, frequency transmission efficiency, or bit error rate. . It should be understood that these performance metrics can be calculated or estimated according to the actual application and any appropriate method, which is not detailed here.
  • the user's set of schedulable carrier units includes one or more selected among all carrier units available to the user for allocation to the user during resource scheduling.
  • Candidate carrier unit In one example, a user's set of schedulable carrier units can include all of the carrier units available to the user. If the user does not support carrier aggregation, the set of schedulable carrier units in the user is a certain carrier unit used by the user. In another example, the user's set of schedulable carrier units can include one or more of all of the carrier units available to the user.
  • a resource block corresponding to a plurality of first performance indicators having a larger value is selected among all the resource blocks in the user's schedulable carrier unit set to be allocated to the user.
  • the resource blocks corresponding to the plurality of first performance indicators having the largest value may be allocated to the user according to the value of the first performance indicator of the user on each resource block.
  • a plurality of resource blocks of the plurality of resource blocks in the schedulable set of carrier units that are better than the first performance indicator of the user (not necessarily the first performance indicator value being the largest) may be allocated to the user.
  • the methods for selecting resource blocks herein are merely exemplary, and those of ordinary skill in the art will appreciate that the present invention is not limited to the examples and embodiments enumerated.
  • the number of resource blocks allocated to the user may be determined according to actual needs (such as the resource requirements of the user), and will not be described in detail herein. It should also be understood that when the user is a user supporting carrier aggregation, the above allocation step may allocate resource blocks in multiple (continuous or discontinuous) carrier units to the user; and when the user is a user that does not support carrier aggregation, At this time, only the resource blocks in the carrier unit supported by the user can be allocated to the user.
  • the method may further include the following steps: determining whether the user satisfies a condition for occupying the resource block (referred to as a first condition for convenience of description).
  • the first condition may include: the user-schedulable carrier unit and the resource block in the resource block cannot be occupied by other users, and the number of times the resource block is multiplexed cannot exceed the number of transmitting antennas, and the number of resource blocks occupied by each user cannot be Exceeding the number of receiving antennas, etc., here is not - enumerated.
  • the conditions set forth herein are exemplary and not exhaustive. One of ordinary skill in the art can select other ⁇ to determine whether the user can occupy a certain resource block. The invention is not limited to the examples and embodiments shown.
  • the set of schedulable carrier units of the user "( u Sch u ) in the user set be CC UC (CG CC UC , c denotes an element in the set CCm (ie, each carrier unit)),
  • a first performance indicator 7_ is calculated on a set of all available resource blocks in a contigable set of carrier units CC approximate by a user u ( ue Sch u ) in the user set / ⁇ .
  • the first performance indicator ⁇ may be user traffic, channel gain, signal to noise ratio, frequency transmission efficiency, or bit error rate, and may be selected according to actual needs.
  • the user is calculated ⁇ (u Sch u) in which the set of schedulable component carriers CC "performance on a certain carrier resource block r in a cell C ⁇ £ i.e. calculate or estimate the user on the resource block Performance indicators such as traffic, channel gain, signal-to-noise ratio, frequency usage efficiency, or bit error rate. It should be understood that these performance indicators may be calculated or estimated according to practical applications and using any suitable method, which are not detailed herein.
  • the calculated first performance index values 7 ⁇ - are arranged in descending order of the value, and the carrier units corresponding to the previous K (K ⁇ l) values and the resource blocks therein are allocated to the user.
  • K (K ⁇ l) values and the resource blocks therein are allocated to the user.
  • the first condition may be The carrier unit c and the resource blocks therein cannot be occupied by other users. The number of times the resource blocks are multiplexed cannot exceed the number of transmitting antennas, and the number of resource blocks occupied by each user cannot exceed the number of receiving antennas. If the condition is met, the carrier unit c and the resource block therein are allocated to the user.
  • FIG. 5 shows an example of the distributed resource allocation method shown in FIG. As shown in FIG. 5, the distributed resource allocation may include the following steps S509 and S511. [50] In step 509, respectively calculating performance indicators of each user in the set of users to be scheduled of the communication network on each assignable resource block in its schedulable set of carrier units (for convenience of description, Second performance indicator).
  • the second performance indicator may be user traffic, channel gain, signal to noise ratio, frequency transmission efficiency or bit error rate, etc., as can be understood by those skilled in the art, and may be selected according to needs in a specific application. Not listed here. Calculating or estimating a second performance indicator of a user on an assignable resource block of a schedulable carrier unit, calculating or estimating the user's traffic, channel gain, bit error rate, and frequency transmission on the resource block Performance metrics such as efficiency or bit error rate. It should be understood that these performance metrics may be calculated or estimated according to the actual application, using any suitable method, and are not detailed here.
  • a resource block corresponding to the second performance indicator with a larger value is selected in the resource block of the carrier unit and allocated to the user.
  • multiple resource blocks of each carrier unit in the set of user schedulable carrier units may be respectively sorted according to the value of the second performance indicator, and the resource block allocation corresponding to the performance index with the largest value is selected.
  • a resource block corresponding to a larger (rather than the largest) performance indicator may be allocated to the user in a plurality of resource blocks of each carrier unit according to actual needs.
  • the foregoing allocation step 511 may select a resource block to be allocated to the user in each of the carrier units supported by the user; and when the user does not support the carrier When a user is aggregated, a resource block can only be selected for the user in the carrier unit supported by the user.
  • Step 511 can be continued to allocate the remaining resources to these users.
  • the method may further include the following steps: determining whether the user satisfies a condition for occupying the resource block (referred to as a second condition for convenience of description).
  • the second condition may include: the user-schedulable carrier unit and the resource block in the resource block cannot be occupied by other users, and the number of times the resource block is multiplexed cannot exceed the number of transmitting antennas, and the number of resource blocks occupied by each user cannot be More than the number of receiving antennas, etc. Wait, here is not - enumeration. It should be understood that the conditions set forth herein are illustrative and not exhaustive. One of ordinary skill in the art can select other ⁇ to determine whether the user can occupy a certain resource block. The invention is not limited to the examples and embodiments shown.
  • the set of users to be scheduled is Sch u u Sch u .
  • the set of users to be scheduled is Sch u u Sch u .
  • "represents the elements in the user collection / ⁇ (ie each user), u l, ..., N.
  • N is a positive integer, indicating the number of users in the collection.
  • Set the user in the user collection ( )
  • the set of schedulable carrier units is cc uc .
  • the user performance indicator 7_ may be user traffic, channel gain, signal to noise ratio, frequency usage efficiency, or bit error rate.
  • the user performance indicator r of the user M on the resource block r of the carrier unit c is calculated, that is, the performance index of the user's traffic, channel gain, frequency transmission efficiency or bit error rate on the resource block is calculated or estimated. It should be understood that these performance indicators may be calculated or estimated according to the actual application, using any suitable method.
  • the resource block before the resource block is allocated to the user, it is also possible to check whether the user "satisfies the condition of occupying the carrier unit c and the resource block r therein.
  • the condition may include: the carrier unit c and therein
  • the resource block r cannot be occupied by other users.
  • the number of times the resource block r is multiplexed cannot exceed the number of transmitting antennas.
  • the number of resource blocks occupied by each user cannot be More than the number of receiving antennas. If the condition is met, the carrier unit c and the resource blocks therein are allocated to the user.
  • FIG. 6 is a schematic flow chart showing a resource allocation method according to another embodiment of the present invention.
  • the method shown in Fig. 6 is similar to the previous embodiment, except that the method shown in Fig. 6 further includes the step of judging whether the amount of available resources of the communication network satisfies the resource requirements of all users requesting the service.
  • steps S601 and S603 may be similar to the corresponding steps in the foregoing embodiment (eg, S201, S203 in FIG. 2 or S301, S301-1, S303-1, S303 in FIG. 3). -2 ) Similar, no more details here.
  • step S605 before the resource allocation is performed, it is judged whether the amount of available resources in the communication network satisfies the resource requirements of all users requesting the service. If so, in step S606, all users requesting the service are regarded as a set of users to be scheduled. If not, in step S607, one or more users are selected among all users requesting the service as a set of users to be scheduled. Users can be selected based on the total amount of available resources and the user's priority level, performance metrics, resource requirements, and so on.
  • Fig. 7 shows an example of step S607.
  • the method of selecting a user shown in Fig. 7 includes steps S707-1 and S707-2.
  • a performance indicator of a user of each request service on its schedulable set of carrier units (referred to as a third performance indicator for convenience of description) is calculated.
  • step S707-2 one or more users corresponding to one or more third performance indicators having the largest value are selected as the set of users to be scheduled.
  • the number of users selected can be determined according to the amount of available resources and the resource requirements of these users, which are not described in detail herein.
  • the performance indicator may be a signal to noise ratio, a channel gain, a user flow rate, a frequency usage efficiency, or a bit error rate.
  • calculating the performance indicator c of the user W ( ⁇ rad) on the carrier unit C in the set of carrier units that it can support ie calculating or estimating the signal-to-noise ratio, traffic, channel gain, frequency of the user on the carrier unit Use efficiency or bit error rate And other performance indicators. It should be understood that these performance indicators may be calculated or estimated according to practical applications, using any suitable method, and are not detailed here. Then, computing users "it can support the set of component carriers c" on the average performance indicators S -.
  • AVG which is also called a third average performance index for the user does not support the performance of carrier aggregation, because it supports the carrier There is only one unit, so 5 ⁇ ⁇ ' ⁇ c ⁇
  • the average performance indicator s_ AVG "equal to the performance index of all users on all carriers C in the set of supported carrier units c" Average, ie
  • the average performance indicator of the set of users Sch u to be scheduled is equal to the average of the third performance indicator ⁇ - AVG of all users in the user set.
  • KchJ represents the number of elements (ie, users) in the user collection ⁇ .
  • the schedulable carrier unit set CC formula, £ for each user u ( ue Sch u ) is determined according to the average performance indicator of the user set Sch u to be scheduled. If the user “does not support carrier aggregation, its schedulable carrier
  • its schedulable carrier unit set CC ⁇ may include a carrier unit: the performance index s u , c of the user u ( ue Sch u ) on the carrier unit c is higher than the to-be-scheduled
  • the schedulable carrier unit set ccGHz, £ of each user u ( ue Sch u ) in the user set Sch u to be scheduled can be determined.
  • the performance index is calculated as described above, and is no longer here. Repeat.
  • the resource allocation method may further include the step of ordering users in the set of users to be scheduled, such that each user in the set of users to be scheduled may be allocated resources in order.
  • Figure 8 is a diagram showing an example of selecting a set of users to be scheduled and sorting the users by the user's performance metrics. As shown in Fig. 8, steps S807-1 and S807-2 are similar to S707-1 and S707-2 in Fig. 7, and will not be described again here. In step S808, each user may be sorted according to the size of the third performance indicator.
  • the user can be sorted by the following method.
  • the average performance indicator H AVG " of each user to be scheduled in the set of users to be scheduled" can be separately calculated:
  • Len(CC uc ) is the average of the user's "average performance indicator SSch - AVG " equal to the sum of the performance indicators e of the user on all carrier units C in its schedulable set of carrier units CC ⁇ .
  • l (CC uc ) represents the number of elements (ie, carrier elements) of the set CC U c .
  • the value of the average performance index H AVG " is sorted in descending order. According to the order of magnitude of H AVG ", resources are allocated to users in turn, until all resources to be scheduled are allocated enough resources or all available resources have been allocated The assignment is complete.
  • each user in the set of users to be scheduled may also be sorted according to the priority level of the user.
  • the throughput and frequency utilization efficiency of the system can be effectively improved. It can also improve the fairness of users, especially for the case of user terminals supporting both carrier aggregation and carrier aggregation, which can effectively solve the fair scheduling problem of these two types of users. In addition, with the method in the above embodiment, the multi-user diversity gain can be effectively improved.
  • the resource allocation apparatus includes a convergence mode determining module 901 and points.
  • the mode selection module 903 is configured to determine a carrier aggregation mode of the communication network.
  • the allocation mode selection module is configured to select a resource allocation mode of the communication network according to a carrier aggregation mode of the communication network.
  • the communication network described herein is a communication system supporting carrier aggregation, such as the communication network shown in FIG.
  • the communication network may include nodes that support carrier aggregation (such as terminal 102 shown in Figure 1), and may also include nodes that do not support carrier aggregation (terminals 103 and 104 as shown in Figure 1).
  • the allocation mode selection module can determine the carrier aggregation mode supported by the communication network through the primary node (e.g., base station) of the communication network.
  • the carrier aggregation mode of the communication network generally includes continuous carrier aggregation (CC 1 and CC 2 as shown in FIG. 1 ) and discontinuous carrier aggregation (CC 1 and CC 3 as shown in FIG. 1 ).
  • the allocation mode selection module 903 may be configured to: when the aggregation mode determining module 901 determines that the carrier aggregation mode of the communication network is continuous, select a centralized resource allocation manner to allocate the communication. The resource of the network; when the aggregation mode determining module 901 determines that the carrier aggregation mode of the communication network is non-continuous, the distributed resource allocation mode is selected to allocate resources of the communication network.
  • FIG. 10 is a schematic block diagram showing a resource allocation device according to another embodiment of the present invention.
  • the resource allocation apparatus shown in FIG. 10 includes a convergence mode determination module 1001, an allocation mode selection module 1003, and a resource allocation module 1005.
  • the convergence mode determination module 1001 and the distribution mode selection module 1003 are similar to the modules 901 and 903 in the foregoing embodiment or example, and are not described herein again.
  • the resource allocation module 1005 is configured to perform resource allocation according to the selected resource allocation manner.
  • the resource allocation module 1005 is configured to: calculate, for each user in the set of users to be scheduled of the communication network, the user in its schedulable set of carrier units a first performance indicator on each of the allocateable resource blocks; and selecting, among all the resource blocks in the set of user-schedulable carrier units, a resource block corresponding to the plurality of first performance indicators having a larger value to be allocated to the resource block user.
  • the first performance indicator may be user traffic, channel gain, signal to noise ratio, frequency transmission efficiency or bit error rate, etc., as can be understood by those skilled in the art. In the specific application, you can choose according to your needs, not listed here.
  • the resource allocation module may use the method embodiments and/or the methods in the example to calculate the first performance indicator, which is not repeated here.
  • a user's set of schedulable carrier units can include all of the carrier units available to the user. If the user does not support carrier aggregation, the set of adjustable carrier units in the user is a certain carrier unit used by the user. In another example, the user's set of schedulable carrier units can include one or more of all of the carrier units available to the user.
  • the resource blocks corresponding to the plurality of first performance indicators having the largest value may be allocated to the user according to the value of the first performance indicator of the user on each resource block.
  • a plurality of resource blocks in the schedulable plurality of resource blocks in which the first performance indicator of the user is better may be allocated to the user.
  • the number of resource blocks allocated to the user may be determined according to actual needs (such as the resource requirements of the user), and will not be described in detail herein. It should also be understood that when the user is a user supporting carrier aggregation, the above allocation step may allocate resource blocks in multiple (continuous or discontinuous) carrier units to the user; and when the user is a user that does not support carrier aggregation, At this time, only the resource blocks in the carrier unit supported by the user can be allocated to the user.
  • the resource allocation module 1005 may further perform the following steps: determining whether the user satisfies the condition for occupying the resource block (refer to the first condition for convenience of description) ).
  • the first condition may include: the user-schedulable carrier unit and the resource block in the resource block cannot be occupied by other users, and the number of times the resource block is multiplexed cannot exceed the number of transmitting antennas, and the number of resource blocks occupied by each user cannot be Exceeding the number of receiving antennas, etc., not listed here. It should be understood that the conditions set forth herein are illustrative and not exhaustive. One of ordinary skill in the art can select other ⁇ to determine whether the user can occupy a certain resource block. The invention is not limited to the illustrated examples and embodiments.
  • the resource allocation module 1005 is configured to: calculate, in the traversable, each user of the set of users to be scheduled in the communication network a second performance indicator on each of the assignable resource blocks in the set of carrier units; and corresponding to each carrier unit schedulable by the user, selecting a second performance indicator having a larger value in the resource block of the carrier unit The resource block is assigned to the user.
  • the second performance indicator may be user traffic, channel gain, signal to noise ratio, frequency transmission efficiency or bit error rate, etc., as will be understood by those skilled in the art. In the specific application, you can choose according to your needs, not listed here.
  • the resource allocation module may use the method embodiments and/or the methods in the examples to calculate the second performance indicator, which is not repeated here.
  • multiple resource blocks of each carrier unit in the set of user schedulable carrier units may be respectively sorted according to the value of the second performance indicator, where the performance index corresponding to the largest value is selected. Resource blocks are assigned to users. As another example, according to actual needs, among the multiple resource blocks of each carrier unit in the set of carrier units that can be scheduled by the user, one of the performance indicators corresponding to the larger (rather than the largest) value is selected. Resource blocks are assigned to users.
  • the methods for selecting resource blocks herein are merely exemplary, and those of ordinary skill in the art will appreciate that the present invention is not limited to the illustrated examples and embodiments.
  • the resource allocation module 1005 may select a resource block to be allocated to the user in each carrier unit of the user's schedulable carrier unit set; and when the user does not support When a carrier is aggregated, only the resource block can be selected for the user in the carrier unit supported by the user.
  • the resource allocation Module 1005 can continue to perform the distributed resource allocation described above to allocate the remaining resources to these users.
  • the resource allocation module 1005 may further perform the following steps: determining whether the user satisfies the condition for occupying the resource block (for convenience of description, referred to as a second condition) ).
  • the second condition may include: the user-schedulable carrier unit and the resource block in the resource block cannot be occupied by other users, and the number of times the resource block is multiplexed cannot exceed the number of transmitting antennas, and the number of resource blocks occupied by each user cannot be Exceeding the number of receiving antennas, etc., not listed here.
  • the conditions set forth herein are illustrative and not exhaustive. One of ordinary skill in the art can select other ⁇ to determine whether the user can occupy a certain resource block. The invention is not limited to the examples and examples shown Example.
  • FIG. 11 is a schematic block diagram showing a resource allocation device according to another embodiment of the present invention.
  • the resource allocation apparatus shown in FIG. 11 is similar to the foregoing embodiment, except that the resource allocation apparatus shown in FIG. 11 includes a user in addition to the aggregation mode determining module 1101, the allocation mode selection module 1103, and the resource allocation module 1105. Module 1107 is selected.
  • the aggregation mode determining module 1101, the allocation mode selection module 1103, and the resource allocation module 1105 are similar to the corresponding modules in the foregoing embodiment, and details are not described herein again.
  • the user selection module 1107 is configured to: determine whether the amount of available resources in the communication network meets the resource requirements of all users requesting the service, and if so, use all users requesting the service as the set of users to be scheduled, and if not, Then, one or more users are selected among all the users requesting the service as a set of users to be scheduled. As an example, the user selection module 1107 is further configured to calculate a second performance indicator for each user of the requesting service on its schedulable set of carrier units; and to select one or more second performance indicators that have the largest value The corresponding user is used as the set of users to be scheduled. The user selection module 1107 can determine the set of users to be scheduled by using the method adopted in the foregoing method embodiment (for example, the embodiment shown in FIG. 7), and is not repeated here.
  • FIG. 12 is a schematic block diagram showing a resource allocation device according to another embodiment of the present invention.
  • the resource allocation apparatus shown in FIG. 12 is similar to the embodiment shown in FIG. 11, except that, except for the aggregation mode determination module 1201, the distribution mode selection module 1203, the resource allocation module 1205, and the user selection module 1207, FIG.
  • the illustrated resource allocation device also includes a user ranking module 1209.
  • the aggregation mode determining module 1201, the allocation mode selection module 1203, the resource allocation module 1205, and the user selection module 12075 are similar to the corresponding modules in the foregoing embodiments, and are not described herein again.
  • the user ranking module 1209 is configured to sort the users in the set of users to be scheduled, so that the resource allocation module 1205 can allocate resources for each user in the set of users to be scheduled in order.
  • the user ranking module 1209 can sort the users by the method in the foregoing embodiment, and details are not described herein again.
  • each step of the foregoing resource allocation method and each component module and/or unit of the resource allocation apparatus may be implemented as software, firmware, hardware, or a combination thereof in a master node (eg, a base station) of the communication network. And as part of the resource scheduling (allocation) device in the MAC (Medium Access Control) layer of the base station.
  • a master node eg, a base station
  • the resource scheduling (allocation) device in the MAC (Medium Access Control) layer of the base station.
  • the specific means or manner in which the various components and units in the above-mentioned devices are configured by software, firmware, hardware or a combination thereof are well known to those skilled in the art and will not be described herein.
  • a resource allocation method and/or apparatus may be implemented in a resource scheduling (allocation) device of an existing base station, where each component of the resource scheduling device of the existing base station is configured Be sure to modify it.
  • a program constituting the software may be installed from a storage medium or a network to a computer having a dedicated hardware structure (for example, the general-purpose computer 1300 shown in FIG. 13).
  • a computer having a dedicated hardware structure for example, the general-purpose computer 1300 shown in FIG. 13.
  • a central processing unit (CPU) 1301 performs various processes in accordance with a program stored in a read only memory (ROM) 1302 or a program loaded from the storage portion 1308 to a "storage (RAM) 1303.
  • ROM read only memory
  • RAM storage
  • data required when the CPU 1301 executes various processes and the like are also stored as needed.
  • the CPU 1301, the ROM 1302, and the RAM 1303 are linked to each other via the bus 1304.
  • the input/output interface 1305 is also linked to the bus 1304.
  • an input/output interface 1305 an input portion 1306 (including a keyboard, a mouse, etc.), an output portion 1307 (including a display such as a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and A speaker, etc.), a storage portion 1308 (including a hard disk or the like), a communication portion 1309 (including a network interface card such as a LAN card, a modem, etc.).
  • the communication section 1309 performs communication processing via a network such as the Internet.
  • the 1310 can also be linked to the input/output interface 1305.
  • a removable medium 1311 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory or the like is mounted on the drive 1310 as needed, so that the calculations read therefrom are installed into the storage portion 1308 as needed.
  • a program constituting the software is installed from a network such as the Internet or a storage medium such as the removable medium 1311.
  • such a storage medium is not limited to the removable medium 1311 shown in FIG. 13 in which a program is stored and distributed separately from the device to provide a program to the user.
  • the detachable medium 1311 include a magnetic disk (including a floppy disk (registered trademark):), an optical disk (including a compact disk read only memory (CD-ROM) and a digital versatile disk (DVD)), and a magneto-optical disk (including a mini disk (MD) (registered) Trademark)) and semiconductor memory.
  • the storage medium shield may be a ROM 902, a hard disk included in the storage portion 1308, or the like, in which programs are stored, and distributed to the user together with the device containing them.
  • the present invention also provides a program product for storing a machine readable instruction code.
  • the above-described method according to an embodiment of the present invention can be performed when the instruction code is read and executed by a machine.
  • a storage medium for carrying a program product storing the above-described storage machine readable instruction code is also included in the disclosure of the present invention.
  • the storage medium includes, but is not limited to, a floppy disk, an optical disk, a magneto-optical disk, a memory card, a memory stick, and the like.
  • the method of the present invention is not limited to being executed in the chronological order described in the specification, and may be performed in other chronological order, in parallel, or independently. Therefore, the order of execution of the methods described in the specification does not limit the technical scope of the present invention.

Landscapes

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

Description

通信网络中的资源分配方法和装置
技术领域
[01] 本发明涉及通信领域, 具体地, 涉及一种通信网络中的资源分配 方法和装置。
背景技术
[02] 资源调度算法的目标是在资源有限的条件下,根据用户需求和信 道特性, 灵活分配通信网络中的可用资源, 从而最大程度地提高无线 频傳利用率。 由于载波汇聚技术的引入, 传统的资源调度算法已经不 能满足要求。 载波汇聚下的调度算法面临很多挑战, 同时也是提升系 统整体性能的关键。
[03] 程顺川等人在 "LTE-Advanced系统中载波聚合技术的性能研究" 一文(《现代电信科技》, 2009年 4月第 4期)中提出了一种应用于载 波汇聚场景下的联合队列调度方法。 在该方法, 假设在基站端有一个 联合队列调度器, 也就是多个载波上的数据共用相同的队列。 所有载 波共享一个资源调度器,该资源调度器直接把进入系统的用户分配到 多个独立载波的资源块上。
发明内容
[04] 在下文中给出关于本发明的简要概述,以便提供关于本发明的某 些方面的基本理解。应当理解, 这个概述并不是关于本发明的穷举性 概述。 它并不是意图确定本发明的关键或重要部分, 也不是意图限定 本发明的范围。 其目的仅仅是以简化的形式给出某些概念, 以此作为 稍后论述的更详细描述的前序。
[05] 根据本发明的一个方面, 提供了一种通信网络中的资源分配方 法。 所述资源分配方法可包括: 确定所述通信网络的载波汇聚方式; 以及根据所述通信网络的载波汇聚方式来选择所述通信网络的资源 分配方式。
[06] 根据本发明的另一方面, 提供了一种通信网络中的资源分配装 置。 所述资源分配装置可包括: 汇聚方式确定模块, 用于确定所述通 信网络的载波汇聚方式; 以及分配方式选择模块, 用于根据所述通信 网络的载波汇聚方式来选择所述通信网络的资源分配方式。
[07] 另外,本发明的实施例还提供了用于实现上述资源分配方法的计 算 序。
[08] 此外,本发明的实施例还提供了至少计算机可读介质形式的计算 序产品,其上记录有用于实现上述资源分配方法的计算机程序代 码。
附图说明
[09] 参照下面结合附图对本发明实施例的说明,会更加容易地理解本 发明的以上和其它目的、 特点和优点。 附图中的部件只是为了示出本 发明的原理。 在附图中, 相同的或类似的技术特征或部件将采用相同 或类似的附图标记来表示。
[10] 图 1是示出了支持载波汇聚的通信网络的示意图;
[11] 图 2是示出了根据本发明一个实施例的资源分配方法的示意性 流程图;
[12] 图 3 是示出了根据本发明另一实施例的资源分配方法的示意性 流程图;
[13] 图 4是示出了根据本发明另一实施例的集中式资源分配方式的 示意性流程图;
[14] 图 5 是示出了根据本发明一个实施例的分布式资源分配方式的 示意性流程图;
[15] 图 6是示出了根据本发明另一实施例的资源分配方法的示意性 流程图;
[16] 图 7是示出了根据本发明一个实施例选择待调度的用户集合的 示例性流程图;
[17] 图 8是示出了根据本发明一个实施例选择待调度的用户集合并 对其中的用户进行排序的示例性流程图;
[18] 图 9是示出了根据本发明一个实施例的资源分配装置的示意性 框图;
[19] 图 10是示出了根据本发明另一实施例的资源分配装置的示意性 框图;
[20] 图 11是示出了根据本发明另一实施例的资源分配装置的示意性 框图;
[21] 图 12是示出了根据本发明另一实施例的资源分配装置的示意性 框图; 及
[22] 图 13是示出用于实现本发明的计算机的结构的示例性框图。
具体实施方式
[23] 下面参照附图来说明本发明的实施例。在本发明的一个附图或一 种实施方式中描述的元素和特征可以与一个或更多个其它附图或实 施方式中示出的元素和特征相结合。 应当注意, 为了清楚的目的, 附 图和说明中省略了与本发明无关的、本领域普通技术人员已知的部件 和处理的表示和描述。
[24] 未来的 LTE-A ( Long Term Evolution -Advanced )系统将支持高 达 100MHz的传输带宽, 而在 LTE标准中可支持的最大传输带宽为 20MHz, 因此需要将多个载波单元进行汇聚以实现更高的传输带宽。 载波汇聚( Carrier Aggregation )是 3GPP为了支持未来的移动通信 系统更高的传输带宽需求而提出的将多个载波单元聚合进行联合传 输的技术。根据所汇聚的载波单元在频谱上的位置, 载波汇聚的方式 可以分为连续性的载波汇聚和非连续性的载波汇聚两种方式。 LTE-A 同时支持这两种汇聚方式。 3GPP在引入载波汇聚技术的同时也考虑 到了后向兼容性, 这意味在未来很长的一段时间内, 支持载波汇聚和 不支持载波汇聚的终端将长期共存,支持载波汇聚的终端能够同时接 入多个载波单元, 而不支持载波汇聚的终端仅能接入某一个载波单 元。本发明的一些实施例提供了用于载波汇聚场景下的资源调度方法 和装置。
[25] 在载波汇聚尤其是非连续性的载波汇聚场景下, 当汇聚的多个载 波单元位于不同的频段时, 每个载波单元的电磁传播特性是不同的。 根据本发明的一些实施例的调度算法考虑了这种情况并善加利用,以 提高系统性能。根据本发明的一些实施例的调度算法还考虑到了终端 的多样性(支持或不支持载波汇聚以及用户对不同载波单元的性能差 异)以及由此引起的调度公平性问题, 在提高系统性能的同时充分考 虑到用户公平性。另外如何利用载波汇聚技术带来的频率选择性增益 和提高多用户分集增益, 进而提高系统整体性能, 也是根据本发明的 一些实施例的资源分配算法所考虑的问题。
[26] 图 1示出了支持载波汇聚的示例性通信网络。 如图 1所示, 小区 内由基站(如 e-NodeB ) 101为多个用户 102、 103和 104提供服务。 这些用户可以是不支持载波汇聚的 (CA-NS ), 如用户 102; 也可以 是支持载波汇聚的 (CA-S ), 如用户 103和 104。 通信网络所支持的 载波汇聚方式由基站决定。 例如, 在图 1所示的示例中, 通信网络所 支持的载波单元包括 CC 1、 CC2和 CC3。 其中, 载波单元 CC 1与载 波单元 CC2是连续的, 而载波单元 CC3则与载波单元 CC 1和 CC2 不连续。 应理解, 本说明书和权利要求书中所谓的 "用户"是指 "用 户终端", 如某个个人用户所使用的用于接入通信网络的移动设备, 如手机(如图 1的 102和 103 )、 个人数字助理或便携式计算机等等。
[27] 资源分配(调度)方法是为每个请求服务的用户分配资源(如图 1所示的资源块 RB ), 具体来说, 对于不支持载波汇聚的用户, 确定 该用户在其可支持的载波单元中可以占用的资源。对于支持载波汇聚 的用户, 确定该用户可以占用的载波单元以及相应载波单元中的资 源。 例如, 在图 1的示例中, 终端 102仅可使用载波单元 CC 1上的 资源, 而终端 103可以支持载波单元 CC 1和 CC3, 终端 104可以支 持载波单元 CC 1、 CC2和 CC3。
[28] 图 2是示出了根据本发明一个实施例的资源分配方法的示意性 流程图。
[29] 如图 2所示, 该资源分配方法包括如下步骤 S201和 S203。
[30] 在步骤 S201中, 首先要确定通信网络的载波汇聚方式。
[31] 这里所述的通信网络为支持载波汇聚的通信系统,例如图 1所示 的通信网络。 通信网络可以包括支持载波汇聚的节点(如图 1所示的 终端 102 ), 还可以包括不支持载波汇聚的节点 (如图 1所示的终端 103和 104 )。 作为一个示例, 可以通过该通信网络的主节点(例如基 站)来确定该通信网络所支持的载波汇聚方式, 例如, 可以从主节点 (基站)的相应的配置文件中获取有关载波汇聚方式的信息, 从而确 定该通信网络所支持的载波汇聚方式。
[32] 在步骤 S203中, 根据所确定的载波汇聚方式来选择所 信网 络的资源分配方式。
[33] 该实施例根据载波汇聚的不同场景来选择不同的资源分配方法, 能够有效提高系统的频率分集增益。
[34] 图 3示出了图 2所示的资源分配方法的应用示例。 如上所述, 通 信网络的载波汇聚方式通常包括连续性的载波汇聚(如图 1 所示的 CC 1和 CC2 )和非连续性的载波汇聚(如图 1所示的 CC 1与 CC3 ) 两种方式。 图 3所示的示例中, 针对这两种不同的汇聚方式分别选择 不同的资源分配方式。 具体地, 在步骤 S301 中, 确定通信网络的载 波汇聚方式。 在步骤 S301-1 中, 判断所确定的载波汇聚方式是连续 性的还是非连续性的。 如果是连续性的, 则在步驟 S303-1 中, 选择 分布式的资源分配方式用于进行资源分配。 如果是非连续性的, 则在 步骤 S303-2 中, 选择集中式的资源分配方式用于分配所述通信网络 的资源。
[35] 图 4所示了图 3所示的集中式资源分配方式的一个示例。 如图 4 所示, 集中式的资源分配可以包括如下步骤 S409和 S411。
[36] 在步骤 S409中, 针对通信网络的待调度的用户集合中的每个用 户,计算该用户在其可调度的载波单元集合中的每个可分配的资源块 上的性能指标(为了叙述方便, 这里称为第一性能指标)。 这里所谓 的 "资源块(Resource Block, 缩写为 RB )" 可以指最小的传输单位 (时频资源)。
[37] 第一性能指标可以是用户流量、 信道增益、 信噪比、 频傳使用效 率或误码率等, 如本领域的普通技术人员可以理解的, 在具体应用时 可以根据需要来选择, 这里不一一列举。 计算用户在某个载波单元的 某个资源块上的第一性能指标即计算或估计该用户在该资源块上的 流量、 信道增益、 误码率、 频傳使用效率或误码率等性能指标。 应理 解, 可以根据实际应用、 采用任何适当的方法来计算或估计这些性能 指标, 这里不 详述。
[38] 用户的可调度的载波单元集合包括:在用户可使用的所有载波单 元中选择的、用于在资源调度过程中分配给该用户使用的一个或多个 候选载波单元。 在一个示例中, 用户的可调度的载波单元集合可以包 括该用户可使用的所有载波单元。 如果用户不支持载波汇聚, 则该用 户中的可调度的载波单元集合为该用户使用的某个载波单元。在另一 示例中,用户的可调度的载波单元集合可以包括该用户可使用的所有 载波单元中的一个或多个。
[39] 在步骤 S411 中, 在用户的可调度的载波单元集合中的所有资源 块中选择取值较大的多个第一性能指标所对应的资源块来分配给该 用户。作为一个示例, 可以根据用户在各个资源块上的第一性能指标 的取值, 将值最大的多个第一性能指标所对应的资源块分配给用户。 作为另一示例,还可以将可调度的载波单元集合中的多个资源块中用 户的第一性能指标较好 (不一定是第一性能指标值最大的)的多个资 源块分配给用户。当然,这里用于选择资源块的方法仅仅是示例性的, 本领域的普通技术人员应理解, 本发明不限于所列举的示例和实施 例。
[40] 应理解, 分配给用户的资源块的个数可以根据实际需要(如用户 的资源需求)来确定, 这里不再详述。 还应理解, 当用户是支持载波 汇聚的用户时, 上述分配步骤可以将多个(连续的或者不连续的)载 波单元中的资源块分配给该用户; 而当用户是不支持载波汇聚的用户 时, 只能将该用户所支持的载波单元中的资源块分配给该用户。
[41] 在一个示例中, 在将某个资源块分配给用户之前, 还可以包括如 下步骤: 判断该用户是否满足占用该资源块的条件(为了叙述方便, 称作第一条件)。 第一条件可以包括: 用户可调度的载波单元及其中 的资源块不能已被其他用户占用,该资源块被复用的次数不能超过发 送天线的个数,每个用户占用的资源块个数不能超过接收天线个数等 等, 这里不——列举。 应该理解, 这里列举的条件是示例性, 而非穷 举性的。本领域的普通技术人员可以选择其他^ 来判断用户是否可 以占用某个资源块。 本发明不限于所示的示例和实施例。
[42] 为了进一步说明集中式资源分配方式, 下面给出一个具体示例。
[43] 设待调度的用户集合为 Schu 9 u G Schu, 其中"表示用户集合 Schu中 的元素(即各个用户), " = 1, ..., 。 N为正整数, 表示集合中的用户 的数量。 设该用户集合中的用户" ( u Schu ) 的可调度的载波单元集 合为 CCU C ( C G CCU C , c表示集合 CCm 中的元素 (即各个载波单元)), 并设该载波单元集合 CC„,中的载波单元 C ( C E CCh c ) 中的所有可用的 资源块的集合为 R ^, r e RBc r 其中, r表示集合 R 中的元素(即各 个资源块), r = l,...,R£。 为整数, 表示载波单元 c中所有可用的资源 块的数量。
[44] 首先, 计算用户集合 /^中的用户 u ( u e Schu )在其可调度的载波 单元集合 CC„ 中的所有可用资源块集合 上的第一性能指标 7_。 该第一性能指标可以表示为:
Tu c r , 3u e Schu , Vc e CCa c , Vr e RBc r
[45] 在上式中, 符号 " "表示 "属于", 比如, c e CC ^表示元素 c 属于集合 CC„,£ ; 符号 " 3 "表示 "存在", 比如, ^ 表示至少存在 一个元素 M, 该元素 u属于集合 Schu ; 符号 " V" 表示 "任意", 比如, Vc e CC ^表示集合 CC ^中的任意一个元素 C。 为了简洁, 下文中不再重复 这些符号的含义。
[46] 如上所述, 第一性能指标 Γ 可以是用户流量、 信道增益、 信噪 比、 频傳使用效率或误码率等, 可以根据实际需要来选择。 换言之, 计算用户 Μ ( u Schu )在其可调度的载波单元集合 CC„£中的某个载波 单元 C的某个资源块 r上的性能指标 ^ 即计算或估计该用户在该资 源块上的流量、 信道增益、 信噪比、 频语使用效率或误码率等性能指 标。 应理解, 可以根据实际应用、 采用任何适当的方法来计算或估计 这些性能指标, 这里不一一详述。
[47] 将计算所得的各个第一性能指标值7^ -按照取值大小降序排列, 将前面的 K ( K≥l )个值所对应的载波单元及其中的资源块分配给用 户"。 本领域的普通技术人员应立即, Κ的值可以根据实际需求(例 如用户的资源需求)来确定, 这里不详细描述。
[48] 在一个示例中, 将资源块分配给用户之前, 还可以检查用户"是 否满足占用该载波单元 c及其中的资源块的条件 (即第一条件)。如上 所述, 第一条件可以包括: 载波单元 c及其中的资源块不能已被其他 用户占用, 该资源块被复用的次数不能超过发送天线的个数, 每个用 户占用的资源块个数不能超过接收天线个数等。 若满足条件, 则将该 载波单元 c及其中的该资源块分配给用户"。
[49] 图 5所示了图 3所示的分布式资源分配方式的一个示例。 如图 5 所示, 分布式的资源分配可以包括如下步骤 S509和 S511。 [50] 在步骤 509中,分别计算通信网络的待调度的用户集合中的每个 用户在其可调度的载波单元集合中的各个可分配的资源块上的性能 指标(为了叙述方便, 称为第二性能指标)。
[51] 第二性能指标可以是用户流量、 信道增益、 信噪比、 频傳使用效 率或误码率等, 如本领域的普通技术人员可以理解的, 在具体应用时 可以根据需要来选择, 这里不一一列举。 计算某个用户在某个可调度 的载波单元的某个可分配的资源块上的第二性能指标即计算或估计 该用户在该资源块上的流量、 信道增益、 误码率、 频傳使用效率或误 码率等性能指标。 应理解, 可以根据实际应用、 采用任何适当的方法 来计算或估计这些性能指标, 这里不一一详述。
[52] 在步骤 511中, 针对用户可调度的每个载波单元, 在该载波单元 的资源块中选择取值较大的第二性能指标所对应的资源块分配给该 用户。作为一个示例, 可以将用户可调度的载波单元集合中的每个载 波单元的多个资源块按照第二性能指标的值分别进行排序,在其中选 择取值最大的性能指标所对应的资源块分配给用户。 作为另一示例, 还可以根据实际需要, 在每个载波单元的多个资源块中, 选择取值比 较大(而不是最大)的性能指标所对应的某个资源块分配给用户。 当 然, 这里用于选择资源块的方法仅仅是示例性的, 本领域的普通技术 人员应理解, 本发明不限于所列举的示例和实施例。
[53] 应理解, 当用户是支持载波汇聚的用户时, 上述分配步骤 511可 以在用户支持的载波单元集合中的每个载波单元中选择资源块分配 给该用户; 而当用户是不支持载波汇聚的用户时, 只能在该用户所支 持的载波单元中选择资源块分配给该用户。
[54] 作为一个示例,在针对待调度的用户集合中的所有用户执行了上 述分配步骤 511之后,如果通信网络中还有剩余的可调度资源且某些 用户的资源需求还未得到满足, 则可以继续执行步骤 511为这些用户 分配剩余的资源。
[55] 在一个示例中, 在将某个资源块分配给用户之前, 还可以包括如 下步骤: 判断该用户是否满足占用该资源块的条件(为了叙述方便, 称作第二条件)。 第二条件可以包括: 用户可调度的载波单元及其中 的资源块不能已被其他用户占用,该资源块被复用的次数不能超过发 送天线的个数,每个用户占用的资源块个数不能超过接收天线个数等 等, 这里不——列举。 应该理解, 这里列举的条件是示例性, 而非穷 举性的。本领域的普通技术人员可以选择其他^ 来判断用户是否可 以占用某个资源块。 本发明不限于所示的示例和实施例。
[56] 为了进一步说明分布式资源分配方式, 下面给出一个具体示例。
[57] 设待调度的用户集合为 Schu u Schu。其中, "表示用户集合 / ^中 的元素(即各个用户), u =l, ...,N。 N为正整数, 表示集合中的用户 的数量。 设该用户集合中的用户" ( )可调度的载波单元集合 为 ccu c
[58] 另外, 设对于可调度的载波单元集合 CC„ 中的某个载波单元 c ( C G CC^ ),该载波单元 c中的所有可用的资源块集合为 ? ^, r G RBc r 0 其中, 表示集合 R ^中的元素 (即各个资源块), r = l,..., 。 为整 数,表示载波单元 c中的所有可用的资源块的数量。分别计算用户 "在 其所有可调度的载波单元 c ( c E CCUFI:)中的所有可用资源块集合 R 上 的用户性能指标7 , 该用户性能指标可表示为:
Tu c r , 3u e Schu , Vc e CCa c , Vr e RBc r
[59] 如上所述, 上述用户性能指标7_可以是用户流量、 信道增益、 信噪比、 频语使用效率或误码率等。 换言之, 计算用户 M在载波单元 c的资源块 r上的用户性能指标 r 即计算或估计该用户在该资源块 上的流量、 信道增益、 频傳使用效率或误码率等性能指标。 应理解, 可以根据实际应用、 采用任何适当的方法来计算或估计这些性能指 标》 这里不 详述
[60] 将每个载波单元 c的所有可调用资源块所对应的用户性能指标 7_按照取值大小降序排列, 取最大的 7_值对应的资源块 即: r = arg ma (rH c r)? u e Schu, c G CCU c, Vr e RBC R
将该资源块分配给用户。然后针对该用户的可调度的载波单元集合中 的下一载波单元重复上述过程,直到在该用户的可调度的载波单元集 合中的所有载波单元中都选择了资源块。
[61] 在该示例中,在将该资源块分配给用户之前,还可以检查用户"是 否满足占用该载波单元 c及其中的资源块 r的条件。 该条件可以包括: 载波单元 c及其中的资源块 r不能已被其他用户占用, 该资源块 r被复 用的次数不能超过发送天线的个数,每个用户占用的资源块个数不能 超过接收天线个数等。 若满足条件, 则将该载波单元 c及其中的资源 块 分配给用户"。
[62] 图 6是示出了根据本发明另一实施例的资源分配方法的示意性 流程图。 图 6所示的方法与前述实施例相似, 不同之处在于, 图 6所 示的方法还包括判断通信网络的可用资源量是否满足所有请求服务 的用户的资源需求的步骤。
[63] 如图 6所示,步骤 S601和 S603可以与前述实施例中的相应步骤 (如:图 2中的 S201、S203相似或者与图 3中的 S301、S301-1、S303-1、 S303-2 )相似, 这里不再赘述。
[64] 在步骤 S605中, 在进行分配资源之前, 判断通信网络中的可用 资源量是否满足所有请求服务的用户的资源需求。 若是, 则在步驟 S606 中, 将所有请求服务的用户作为待调度的用户集合。 若否, 则 在步骤 S607中, 在所有请求服务的用户中选择一个或多个用户, 作 为待调度的用户集合。 可以根据可用资源的总量以及用户的优先等 级、 性能指标、 资源需求等来选择用户。
[65] 图 7示出了步骤 S607的一个示例。 图 7所示的选择用户的方法 包括步骤 S707-1和 S707-2。 具体地, 在步骤 S707-1中, 计算每个请 求服务的用户在其可调度的载波单元集合上的性能指标(为了叙述方 便, 称为第三性能指标)。 在步骤 S707-2中, 选择取值最大的一个或 多个第三性能指标所对应的一个或多个用户,作为所述待调度的用户 集合。所选择的用户数量可以根据可用资源量及这些用户的资源需求 来确定, 这里不详细描述。
[66] 下面给出图 7所示方法的一个具体示例。在该示例中,设发出业 务请求的用户集合为 ^„, U G USU , M = 1,..., N。 W为整数, 表示该集合 中的用户总数。假设用户 "( M e ^ )所支持的汇聚载波单元集合为 C"。 计算每个请求服务的用户 ;)在其可支持的载波单元集合 中 的每个载波单元 C上的性能指标 ^, 3U USU , VC e C„。 在该示例中, 用户可支持的载波单元集合 可以包括用户能够使用的所有载波单 元。 该性能指标 可以是信噪比、 信道增益、 用户流量、 频语使用 效率、 或误码率等。 换言之, 计算用户 W ( ^„)在其可支持的载 波单元集合 中的载波单元 C上的性能指标 c即计算或估计该用户 在该载波单元上的信噪比、 流量、 信道增益、 频语使用效率或误码率 等性能指标。 应理解, 可以根据实际应用、 采用任何适当的方法来计 算或估计这些性能指标, 这里不一一详述。 然后, 计算用户"在其可 支持的载波单元集合 c"上的平均性能指标 S -AVG" , 该平均性能指标 也称为第三性能指标。对于不支持载波汇聚的用户, 由于其支持的载 波单元只有一个, 因此5 ^^ ^'^ c^ 对于支持载波汇聚的用户, 该平均性能指标 s_AVG "等于用户"在其可支持的载波单元集合 c"中 的所有载波 C上的性能指标 的平均值, 即
S _ AVGU = ^ ^
len(Cu ) 其中, fe^cj为整数, 表示集合 的元素(即载波单元) 的个数。 将 平均性能指标 ^-AVG "按照取值大小进行降序排列, 取前面的 M ( M>1 )个 S - AVG "值所对应的用户"组成待调度的用户集合 。 如 上所述, M的取值可以根据实际需求来确定, 这里不详细描述。
[67] 下面给出在这种情况下,在用户能够使用的所有载波单元中选择 一个或多个作为可调度的载波单元集合的一个示例。 首先, 计算待调 度的用户集合 Schu的平均性能指标 :
Figure imgf000013_0001
换言之, 待调度的用户集合 Schu的平均性能指标 等于该用户集合 中所有用户"的第三性能指标 ^-AVG "的平均值。 上式中, KchJ 表示用户集合 ^中的元素(即用户) 的个数。 下面根据待调度的用 户集合 Schu的平均性能指标来确定每个用户 u ( u e Schu )的可调度的载 波单元集合 CC„,£。 如果用户"不支持载波汇聚, 则其可调度的载波单 元集合包括该用户可支持(使用) 的载波单元, 即 cc„,£ = c„。 如果用 户 "支持载波汇聚, 则其可调度的载波单元集合 CC ^可以包括这样的 载波单元: 该用户 u ( u e Schu )在该载波单元 c上的性能指标 su,c高于 待调度的用户集合的平均性能指标 ^ 即:
CCU C = {c}, c = arg(Su c > Savg ),u e Schu , c e Cu ,
由此可确定待调度的用户集合 Schu中的每个用户 u ( u e Schu )的可调度 的载波单元集合 cc„,£。 性能指标 的计算方法如上所述, 这里不再 重复。
[68] 作为一个示例,资源分配方法还可以包括对待调度的用户集合中 的用户进行排序的步骤,从而可以按照顺序为待调度的用户集合中的 每个用户分配资源。图 8是示出了选择待调度的用户集合并通过用户 的性能指标对用户进行排序的一个示例。 如图 8所示, 步骤 S807-1 和 S807-2与图 7中的 S707-1和 S707-2相似,这里不再赘述。在步骤 S808中, 可以根据上述第三性能指标的大小对各个用户进行排序。
[69] 作为另一示例, 可以通过如下方法对用户进行排序。 例如, 可以 分别计算待调度的用户集合 中的每个待调度的用户" " e SchJ的 平均性能指标 HAVG ":
SSch_AVG = ^^ ^ ,
len(CCu c) 即用户"的平均性能指标 SSch-AVG"等于该用户在其可调度的载波单 元集合 CC ^中的所有载波单元 C上的性能指标 e的和的平均值。 其 中, l (CCu c)表示集合 CCU c的元素 (即载波单元) 的个数。 将该平均 性能指标 HAVG"的取值按照降序排列。 根据 HAVG"的取值大小 顺序, 依次为用户分配资源, 直到为所有的待调度用户都分配了足够 的资源或者所有可用资源已经被分配完毕。
[70] 作为另一示例,还可以根据用户的优先等级对待调度的用户集合 中的各个用户进行排序。
[71] 当然, 还可以采用其他适当的方法进行排序, 本发明不限于上述 的各个示例。
[72] 利用上述实施例中的资源分配方法,能够有效提高系统的吞吐量 及频 i^f吏用效率。还能够改善用户的公平性问题, 特别是针对同时存 在支持载波汇聚和不支持载波汇聚的用户终端的情况,能够有效解决 这两类用户的公平调度问题。 另外, 利用上述实施例中的方法, 还能 够有效提高多用户分集增益。
[73] 图 9是示出了根据本发明一个实施例的资源分配装置的示意性 框图。 如图 9所示, 该资源分配装置包括汇聚方式确定模块 901和分 配方式选择模块 903„ 汇聚方式确定模块 901用于确定通信网络的载 波汇聚方式。分配方式选择模块用于根据所述通信网络的载波汇聚方 式来选择所述通信网络的资源分配方式。
[74] 与前述方法实施例相同,这里所述的通信网络为支持载波汇聚的 通信系统, 例如图 1所示的通信网络。 通信网络可以包括支持载波汇 聚的节点(如图 1所示的终端 102 ),还可以包括不支持载波汇聚的节 点(如图 1所示的终端 103和 104 )。在一个示例中, 分配方式选择模 块可以通过该通信网络的主节点(例如基站)来确定该通信网络所支 持的载波汇聚方式。
[75] 利用该资源分配装置,可以根据载波汇聚的不同场景来选择不同 的资源分配方法, 能够有效提高系统的频率分集增益。
[76] 如上所述,通信网络的载波汇聚方式通常包括连续性的载波汇聚 (如图 1所示的 CC 1和 CC2 )和非连续性的载波汇聚(如图 1所示 的 CC 1与 CC3 ) 两种方式。 作为一个示例, 可以针对这两种不同的 汇聚方式分别选择不同的资源分配方式。 具体地, 分配方式选择模块 903可以被配置用于: 在所述汇聚方式确定模块 901确定所述通信网 络的载波汇聚方式为连续性的情况下,选择集中式的资源分配方式来 分配所述通信网络的资源;在所述汇聚方式确定模块 901确定所述通 信网络的载波汇聚方式为非续性的情况下,选择分布式的资源分配方 式来分配所述通信网络的资源。
[77] 图 10是示出了根据本发明另一实施例的资源分配装置的示意性 框图。 图 10所示的资源分配装置包括汇聚方式确定模块 1001、 分配 方式选择模块 1003和资源分配模块 1005。
[78] 汇聚方式确定模块 1001和分配方式选择模块 1003与前述实施例 或示例中的模块 901和 903相似, 这里不再赘述。
[79] 资源分配模块 1005用于按照所选择的资源分配方式进行资源分 配。
[80] 在选择了集中式资源分配方式的情况下, 资源分配模块 1005用 于: 针对通信网络的待调度的用户集合中的每个用户, 计算该用户在 其可调度的载波单元集合中的每个可分配的资源块上的第一性能指 标;并在用户可调度的载波单元集合中的所有资源块中选择取值较大 的多个第一性能指标所对应的资源块来分配给该用户。 [81] 与上述方法实施例和 /或示例类似, 第一性能指标可以是用户流 量、 信道增益、 信噪比、 频傳使用效率或误码率等, 如本领域的普通 技术人员可以理解的, 在具体应用时可以根据需要来选择, 这里不一 一列举。 资源分配模块可以采用所述方法实施例和 /或示例中的方法 来计算第一性能指标, 这里不再重复。
[82] 在一个示例中,用户的可调度的载波单元集合可以包括该用户可 使用的所有载波单元。 如果用户不支持载波汇聚, 则该用户中的可调 度的载波单元集合为该用户使用的某个载波单元。 在另一示例中, 用 户的可调度的载波单元集合可以包括该用户可使用的所有载波单元 中的一个或多个。
[83] 作为一个示例,可以^ L据用户在各个资源块上的第一性能指标的 取值, 将值最大的多个第一性能指标所对应的资源块分配给用户。作 为另一示例,还可以将可调度的多个资源块中用户的第一性能指标较 好(不一定是第一性能指标值最大的)的多个资源块分配给用户。 当 然, 这里用于选择资源块的方法仅仅是示例性的, 本领域的普通技术 人员应理解, 本发明不限于所列举的示例和实施例。
[84] 应理解, 分配给用户的资源块的个数可以根据实际需要(如用户 的资源需求)来确定, 这里不再详述。 还应理解, 当用户是支持载波 汇聚的用户时, 上述分配步骤可以将多个(连续的或者不连续的)载 波单元中的资源块分配给该用户; 而当用户是不支持载波汇聚的用户 时, 只能将该用户所支持的载波单元中的资源块分配给该用户。
[85] 在一个示例中, 在将某个资源块分配给用户之前, 资源分配模块 1005还可以执行如下步骤:判断该用户是否满足占用该资源块的条件 (为了叙述方便, 称作第一条件)。 第一条件可以包括: 用户可调度 的载波单元及其中的资源块不能已被其他用户占用,该资源块被复用 的次数不能超过发送天线的个数,每个用户占用的资源块个数不能超 过接收天线个数等等, 这里不一一列举。 应该理解, 这里列举的条件 是示例性, 而非穷举性的。 本领域的普通技术人员可以选择其他 ^ 来判断用户是否可以占用某个资源块。本发明不限于所示的示例和实 施例。
[86] 在选择了分布式资源分配方式的情况下, 资源分配模块 1005用 于:计算所述通信网络的待调度的用户集合中的每个用户在其可调度 的载波单元集合中的各个可分配的资源块上的第二性能指标; 以及针 对用户可调度的每个载波单元,在该载波单元的资源块中选择取值较 大的第二性能指标所对应的资源块分配给该用户。
[87] 与上述方法实施例和 /或示例类似, 第二性能指标可以是用户流 量、 信道增益、 信噪比、 频傳使用效率或误码率等, 如本领域的普通 技术人员可以理解的, 在具体应用时可以根据需要来选择, 这里不一 一列举。 资源分配模块可以采用所述方法实施例和 /或示例中的方法 来计算第二性能指标, 这里不再重复。
[88] 作为一个示例,可以将用户可调度的载波单元集合中的每个载波 单元的多个资源块按照第二性能指标的值分别进行排序,在其中选择 取值最大的性能指标所对应的资源块分配给用户。作为另一示例, 还 可以根据实际需要,在用户可调度的载波单元集合中的每个载波单元 的多个资源块中, 选择取值比较大(而不是最大)的性能指标所对应 的某个资源块分配给用户。 当然, 这里用于选择资源块的方法仅仅是 示例性的, 本领域的普通技术人员应理解, 本发明不限于所列举的示 例和实施例。
[89] 应理解, 当用户是支持载波汇聚的用户时, 资源分配模块 1005 可以在用户的可调度的载波单元集合的每个载波单元中选择资源块 分配给该用户; 而当用户是不支持载波汇聚的用户时, 只能在该用户 所支持的载波单元中选择资源块分配给该用户。
[90] 作为一个示例,在针对待调度的用户集合中的所有用户进行了上 述分配之后,如果通信网络中还有剩余的可调度资源且某些用户的资 源需求还未得到满足, 则资源分配模块 1005可以继续执行上述分布 式资源分配方式为这些用户分配剩余的资源。
[91] 在一个示例中, 在将某个资源块分配给用户之前, 资源分配模块 1005还可以执行如下步骤:判断该用户是否满足占用该资源块的条件 (为了叙述方便, 称作第二条件)。 第二条件可以包括: 用户可调度 的载波单元及其中的资源块不能已被其他用户占用,该资源块被复用 的次数不能超过发送天线的个数,每个用户占用的资源块个数不能超 过接收天线个数等等, 这里不一一列举。 应该理解, 这里列举的条件 是示例性, 而非穷举性的。 本领域的普通技术人员可以选择其他 ^ 来判断用户是否可以占用某个资源块。本发明不限于所示的示例和实 施例。
[92] 图 11是示出了根据本发明另一实施例的资源分配装置的示意性 框图。 图 11所示的资源分配装置与前述实施例相似, 不同之处在于, 除了汇聚方式确定模块 1101、 分配方式选择模块 1103和资源分配模 块 1105之外, 图 11所示的资源分配装置还包括用户选择模块 1107。
[93] 汇聚方式确定模块 1101、 分配方式选择模块 1103和资源分配模 块 1105与前述实施例中的相应模块相似, 这里不再赘述。
[94] 用户选择模块 1107用于: 判断所述通信网络中的可用资源量是 否满足所有请求服务的用户的资源需求, 若是, 则将所有请求服务的 用户作为待调度的用户集合, 若否, 则在所有请求服务的用户中选择 一个或多个用户, 作为待调度的用户集合。 作为一个示例, 用户选择 模块 1107还被配置用于计算每个请求服务的用户在其可调度的载波 单元集合上的第二性能指标;并选择取值最大的一个或多个第二性能 指标所对应的用户作为所述待调度的用户集合。 用户选择模块 1107 可以采用前述方法实施例(例如图 7所示的实施例)中采用的方法来 确定待调度的用户集合, 这里不再重复。
[95] 图 12是示出了根据本发明另一实施例的资源分配装置的示意性 框图。 图 12所示的资源分配装置与图 11所示的实施例相似, 不同之 处在于, 除了汇聚方式确定模块 1201、 分配方式选择模块 1203、 资 源分配模块 1205和用户选择模块 1207之外, 图 12所示的资源分配 装置还包括用户排序模块 1209。
[96] 汇聚方式确定模块 1201、 分配方式选择模块 1203、 资源分配模 块 1205和用户选择模块 12075与前述实施例中的相应模块相似, 这 里不再赘述。
[97] 用户排序模块 1209用于对所述待调度的用户集合中的用户进行 排序, 使得资源分配模块 1205能够按照顺序为所述待调度的用户集 合中的每个用户分配资源。 用户排序模块 1209可以采用前述实施例 中的方法对用户进行排序, 这里不再赘述。
[98] 利用上述实施例中的资源分配装置,能够有效提高系统的吞吐量 及频 i^f吏用效率。还能够改善用户的公平性问题, 特别是针对同时存 在支持载波汇聚和不支持载波汇聚的用户终端的情况,能够有效解决 这两类用户的公平调度问题。 另外, 利用上述实施例中的装置, 还能 够有效提高多用户分集增益。
[99] 应理解, 上述实施例和示例是示例性的, 而不是穷举性的, 本发 明不应被视为局限于任何具体的实施例或示例。
[100] 在上述实施例和示例中, 采用了 "第一"、 "第二"、 "第三" 等表 述(例如第一性能指标、 第二性能指标和第一条件、 第二条件等)。 本领域的普通技术人员应理解,上 述只是为了对术语作文字上的 区分, 而并非表示其顺序或任何其他限定。
[101] 作为一个示例,上述资源分配方法的各个步骤以及上述资源分配 装置的各个组成模块和 /或单元可以实施为通信网络的主节点 (例如 基站) 中的软件、 固件、 硬件或其组合, 并作为该基站的 MAC (媒 体接入控制)层中的资源调度(分配)设备中的一部分。 上述装置中 各个组成模块、 单元通过软件、 固件、 硬件或其组合的方式进行配置 时可使用的具体手段或方式为本领域技术人员所熟知, 在此不再赘 述。
[102] 作为一个示例, 可以在已有基站的资源调度(分配)设备中实施 根据本发明上述实施例的资源分配方法和 /或装置, 其中对已有基站 的资源调度设备的各组成部分作一定修改即可。
[103] 作为一个示例, 在通过软件或固件实现的情况下, 可以从存储介 质或网络向具有专用硬件结构的计算机(例如图 13所示的通用计算 机 1300 )安装构成该软件的程序, 该计算机在安装有各种程序时, 能 够执行各种功能等。
[104] 在图 13中,中央处理单元 (CPU)1301根据只读存储器 (ROM)1302 中存储的程序或从存储部分 1308加载到随; "储器 (RAM)1303 的程序执行各种处理。在 RAM 1303中,也根据需要存储当 CPU 1301 执行各种处理等等时所需的数据。 CPU 1301、 ROM 1302和 RAM 1303 经由总线 1304彼此链路。 输入 /输出接口 1305 也链路到总线 1304„
[105] 下述部件链路到输入 /输出接口 1305:输入部分 1306 (包括键盘、 鼠标等等) 、 输出部分 1307 (包括显示器, 比如阴极射线管 (CRT)、 液晶显示器 (LCD)等, 和扬声器等)、存储部分 1308 (包括硬盘等)、 通信部分 1309 (包括网络接口卡比如 LAN卡、 调制解调器等)。 通 信部分 1309经由网络比如因特网执行通信处理。 根据需要, 驱动器 1310也可链路到输入 /输出接口 1305。可拆卸介质 1311比如磁盘、光 盘、 磁光盘、 半导体存储器等等根据需要被安装在驱动器 1310上, 使得从中读出的计算才 1呈序根据需要被安装到存储部分 1308中。
[106] 在通过软件实现上述系列处理的情况下,从网络比如因特网或存 储介质比如可拆卸介质 1311安装构成软件的程序。
[107] 本领域的技术人员应当理解, 这种存储介盾不局限于图 13所示 的其中存储有程序、与设备相分离地分发以向用户提供程序的可拆卸 介质 1311。 可拆卸介质 1311的例子包含磁盘 (包含软盘 (注册商标):)、 光盘 (包含光盘只读存储器 (CD-ROM)和数字通用盘 (DVD))、 磁光盘 (包含迷你盘 (MD)(注册商标))和半导体存储器。 或者, 存储介盾可 以是 ROM 902、 存储部分 1308中包含的硬盘等等, 其中存有程序, 并且与包含它们的设备一起被分发给用户。
[108] 本发明还提出一种存储有机器可读取的指令代码的程序产品。所 述指令代码由机器读取并执行时,可执行上述根据本发明实施例的方 法。
[109] 相应地,用于承载上述存储有机器可读取的指令代码的程序产品 的存储介质也包括在本发明的公开中。所述存储介质包括但不限于软 盘、 光盘、 磁光盘、 存储卡、 存储棒等等。
[110] 在上面对本发明具体实施例的描述中,针对一种实施方式描述和
/或示出的特征可以以相同或类似的方式在一个或更多个其它实施方 式中使用, 与其它实施方式中的特征相组合, 或替代其它实施方式中 的特征。
[111] 应该强调, 术语 "包括 /包含" 在本文使用时指特征、 要素、 步 骤或组件的存在, 但并不排除一个或更多个其它特征、要素、 步骤或 组件的存在或附加。
[112] 此外, 本发明的方法不限于按照说明书中描述的时间顺序来执 行, 也可以按照其他的时间顺序地、 并行地或独立地执行。 因此, 本 说明书中描述的方法的执行顺序不对本发明的技术范围构成限制。
[113] 尽管上面已经通过对本发明的具体实施例的描述对本发明进行 了披露, 但是, 应该理解, 上述的所有实施例和示例均是示例性的, 而非限制性的。本领域的技术人员可在所附权利要求的精神和范围内 设计对本发明的各种修改、 改进或者等同物。 这些修改、 改进或者等 同物也应当被认为包括在本发明的保护范围内。

Claims

权利 要求 书
1. 一种通信网络中的资源分配方法, 包括:
确定所述通信网络的载波汇聚方式;
根据所述通信网络的载波汇聚方式来选择所述通信网络的资源 分配方式。
2. 如权利要求 1所述的方法,其中,根据所述通信网络的载波汇 聚方式来选择所述通信网络的资源分配方式的步骤包括: 如果确定所述通信网络的载波汇聚方式为连续性的,则选择集中 式的资源分配方式来分配所述通信网络的资源; 如果确定所述通信网络的载波汇聚方式为非续性的,则选择分布 式的资源分配方式来分配所述通信网络的资源。
3. 如权利要求 2所述的方法,其中,选择集中式的资源分配方式 来分配所述通信网络的资源的步骤包括:
针对所 信网络的待调度的用户集合中的每个用户,计算该用 户在其可调度的载波单元集合中的每个可分配的资源块上的第一性 能指标;
在用户可调度的载波单元集合中的所有资源块中选择取值较大 的多个第一性能指标所对应的资源块来分配给该用户。
4. 如权利要求 2所述的方法,其中,选择分布式的资源分配方式 来分配所述通信网络的资源的步骤包括:
计算所述通信网络的待调度的用户集合中的每个用户在其可调 度的载波单元集合中的各个可分配的资源块上的第二性能指标; 以及 针对用户可调度的载波单元集合中的每个载波单元,在该载波单 元的资源块中选择取值较大的第二性能指标所对应的资源块分配给 该用户。
5. 如权利要求 2所述的方法,其中,在确定所述通信网络的载波 汇聚方式的步骤之后, 所述方法还包括: 判断所述通信网络中的可用资源量是否满足所有请求服务的用 户的资源需求, 若是, 则将所有请求服务的用户作为待调度的用户集 合, 若否, 则在所有请求服务的用户中选择一个或多个用户, 作为待 调度的用户集合。
6. 如权利要求 5所述的方法,其中,在所有请求服务的用户中选 择一个或多个用户作为待调度的用户集合的步骤包括:
计算每个请求服务的用户在其可调度的载波单元集合上的第三 性能指标;
选择取值最大的一个或多个第三性能指标所对应的用户作为所 述待调度的用户集合。
7. 如权利要求 5所述的方法, 还包括:
对所述待调度的用户集合中的用户进行排序,
并且其中,按照顺序为所述待调度的用户集合中的每个用户分配 资源。
8. 如权利要求 3所述的方法,其中,用户的可调度的载波单元集 合包括该用户可使用的所有载波单元或者该用户可使用的所有载波 单元中的一个或多个载波单元。
9. 如权利要求 4所述的方法,其中,用户的可调度的载波单元集 合包括该用户可使用的所有载波单元或者该用户可使用的所有载波 单元中的一个或多个载波单元。
10. 如权利要求 3所述的方法, 其中, 在将资源块分配给该用户 的步骤之前, 所述方法还包括:
判断该用户是否满足占用资源块的第一条件。
11. 如权利要求 4所述的方法, 其中, 在将资源块分配给该用户 的步骤之前, 所述方法还包括:
判断该用户是否满足占用资源块的第二条件。
12. 一种通信网络中的资源分配装置, 包括:
汇聚方式确定模块, 用于确定所述通信网络的载波汇聚方式; 分配方式选择模块,用于根据所述通信网络的载波汇聚方式来选 择所述通信网络的资源分配方式。
13. 如权利要求 12所述的装置,其中,所述分配方式选择模块还 被配置用于: 在所述汇聚方式确定模块确定所述通信网络的载波汇聚方式为 连续性的情况下,选择集中式的资源分配方式来分配所述通信网络的 资源;
在所述汇聚方式确定模块确定所述通信网络的载波汇聚方式为 非续性的情况下,选择分布式的资源分配方式来分配所述通信网络的 资源。
14. 如权利要求 13所述的装置,还包括资源分配模块, 其中, 该 资源分配模块用于:
针对所 信网络的待调度的用户集合中的每个用户,计算该用 户在其可调度的载波单元集合中的每个可分配的资源块上的第一性 能指标;
在用户可调度的载波单元集合中的所有资源块中选择取值较大 的多个第一性能指标所对应的资源块来分配给该用户。
15. 如权利要求 13所述的装置,还包括资源分配模块,该资源分 配模块用于
计算所述通信网络的待调度的用户集合中的每个用户在其可调 度的载波单元集合中的各个可分配的资源块上的第二性能指标; 以及 针对用户可调度的载波单元集合中的每个载波单元,在该载波单 元的资源块中选择取值较大的第二性能指标所对应的资源块分配给 该用户。
16. 如权利要求 13所述的装置,还包括用户选择模块, 其中, 该 用户选择模块用于:
判断所述通信网络中的可用资源量是否满足所有请求服务的用 户的资源需求, 若是, 则将所有请求服务的用户作为待调度的用户集 合, 若否, 则在所有请求服务的用户中选择一个或多个用户, 作为待 调度的用户集合。
17. 如权利要求 16所述的装置,其中,所述用户选择模块还被配 置用于:
计算每个请求服务的用户在其可调度的载波单元集合上的第二 性能指标;
选择取值最大的一个或多个第二性能指标所对应的用户作为所 述待调度的用户集合。
18. 如权利要求 16所述的装置,还包括用户排序模块, 其中, 该 用户排序模块用于:
对所述待调度的用户集合中的用户进行排序,
并且其中,所述资源分配模块还被配置用于按照顺序为所述待调 度的用户集合中的每个用户分配资源块。
19. 如权利要求 14所述的装置,其中,用户的可调度的载波单元 集合包括该用户可使用的所有载波单元或者该用户可使用的所有载 波单元中的一个或多个载波单元。
20. 如权利要求 15所述的装置,其中,用户的可调度的载波单元 集合包括该用户可使用的所有载波单元或者该用户可使用的所有载 波单元中的一个或多个载波单元。
21. 如权利要求 14所述的装置,其中,所述资源分配模块还被配 置用于:
在将资源块分配给用户之前,判断该用户是否满足占用该资源块 的第一条件。
22. 如权利要求 15所述的装置,其中,所述资源分配模块还被配 置用于:
在将资源块分配给用户之前,判断该用户是否满足占用该资源块 的第二条件。
PCT/CN2010/078191 2009-10-30 2010-10-28 通信网络中的资源分配方法和装置 WO2011050729A1 (zh)

Priority Applications (10)

Application Number Priority Date Filing Date Title
US13/500,079 US9258091B2 (en) 2009-10-30 2010-10-28 Resource allocation method and device in communication network
CA2776537A CA2776537A1 (en) 2009-10-30 2010-10-28 Resource allocation method and device in communication network
EP10826092.8A EP2472978B1 (en) 2009-10-30 2010-10-28 Resource allocation method and device in communication network
KR1020127011006A KR101675179B1 (ko) 2009-10-30 2010-10-28 통신 네트워크에서의 리소스 할당 방법 및 장치
BR112012009650A BR112012009650A2 (pt) 2009-10-30 2010-10-28 método e aparelho para alocar recursos em uma rede de comunicação
MX2012004658A MX2012004658A (es) 2009-10-30 2010-10-28 Metodo de asignacion de recursos y dispositivo en red de comuncacion.
JP2012535615A JP5573957B2 (ja) 2009-10-30 2010-10-28 通信ネットワークにおけるリソース配分方法及び装置
RU2012122170/07A RU2520602C2 (ru) 2009-10-30 2010-10-28 Устройство и способ выделения ресурсов в сети связи
AU2010312097A AU2010312097A1 (en) 2009-10-30 2010-10-28 Resource allocation method and device in communication network
ZA2012/03081A ZA201203081B (en) 2009-10-30 2012-04-26 Resource allocation method and device in communication network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910207777.4 2009-10-30
CN200910207777.4A CN102056296B (zh) 2009-10-30 2009-10-30 通信网络中的资源分配方法和装置

Publications (1)

Publication Number Publication Date
WO2011050729A1 true WO2011050729A1 (zh) 2011-05-05

Family

ID=43921344

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/078191 WO2011050729A1 (zh) 2009-10-30 2010-10-28 通信网络中的资源分配方法和装置

Country Status (12)

Country Link
US (1) US9258091B2 (zh)
EP (1) EP2472978B1 (zh)
JP (1) JP5573957B2 (zh)
KR (1) KR101675179B1 (zh)
CN (1) CN102056296B (zh)
AU (1) AU2010312097A1 (zh)
BR (1) BR112012009650A2 (zh)
CA (1) CA2776537A1 (zh)
MX (1) MX2012004658A (zh)
RU (1) RU2520602C2 (zh)
WO (1) WO2011050729A1 (zh)
ZA (1) ZA201203081B (zh)

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8774334B2 (en) 2011-11-09 2014-07-08 Qualcomm Incorporated Dynamic receiver switching
JP2015505659A (ja) * 2012-01-31 2015-02-23 アップル インコーポレイテッド 拡張可能なキャリヤ配置における効率的なスペクトル使用法のための方法及び装置
US8995591B2 (en) 2013-03-14 2015-03-31 Qualcomm, Incorporated Reusing a single-chip carrier aggregation receiver to support non-cellular diversity
US9026070B2 (en) 2003-12-18 2015-05-05 Qualcomm Incorporated Low-power wireless diversity receiver with multiple receive paths
US9118439B2 (en) 2012-04-06 2015-08-25 Qualcomm Incorporated Receiver for imbalanced carriers
US9154356B2 (en) 2012-05-25 2015-10-06 Qualcomm Incorporated Low noise amplifiers for carrier aggregation
US9154179B2 (en) 2011-06-29 2015-10-06 Qualcomm Incorporated Receiver with bypass mode for improved sensitivity
US9172402B2 (en) 2012-03-02 2015-10-27 Qualcomm Incorporated Multiple-input and multiple-output carrier aggregation receiver reuse architecture
US9178669B2 (en) 2011-05-17 2015-11-03 Qualcomm Incorporated Non-adjacent carrier aggregation architecture
US9252827B2 (en) 2011-06-27 2016-02-02 Qualcomm Incorporated Signal splitting carrier aggregation receiver architecture
US9300420B2 (en) 2012-09-11 2016-03-29 Qualcomm Incorporated Carrier aggregation receiver architecture
US9362958B2 (en) 2012-03-02 2016-06-07 Qualcomm Incorporated Single chip signal splitting carrier aggregation receiver architecture
US9450665B2 (en) 2005-10-19 2016-09-20 Qualcomm Incorporated Diversity receiver for wireless communication
US9543903B2 (en) 2012-10-22 2017-01-10 Qualcomm Incorporated Amplifiers with noise splitting
US9867194B2 (en) 2012-06-12 2018-01-09 Qualcomm Incorporated Dynamic UE scheduling with shared antenna and carrier aggregation
US10177722B2 (en) 2016-01-12 2019-01-08 Qualcomm Incorporated Carrier aggregation low-noise amplifier with tunable integrated power splitter

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2801233A1 (en) * 2012-01-02 2014-11-12 Nokia Solutions and Networks Oy Rate capping with multiple carrier aggregation schedulers
US9025446B2 (en) * 2012-10-10 2015-05-05 Empire Technology Development Llc Carrier selection policy for joint scheduling for carrier aggregation in an LTE-advanced system
CN103781177B (zh) * 2012-10-19 2018-10-30 株式会社Ntt都科摩 一种信息传输方法、装置及基站
WO2014198023A1 (zh) * 2013-06-09 2014-12-18 华为技术有限公司 一种调度方法及基站
KR102126802B1 (ko) * 2013-08-27 2020-06-25 에스케이텔레콤 주식회사 기지국장치 및 기지국장치의 동작 방법
US20160050663A1 (en) * 2014-08-15 2016-02-18 Aviacomm Inc. System and method for increasing data rate of commercial cellular communication systems with scattered spectrum
US9363845B1 (en) 2014-12-31 2016-06-07 Motorola Solutions, Inc. Apparatus and method for carrier aggregation and fast network switching with a single-baseband-modem, carrier-aggregation-capable wireless-communication device
KR102301836B1 (ko) 2015-02-27 2021-09-14 삼성전자 주식회사 이동 통신 시스템에서 SCell의 동적 제어 방법 및 장치
WO2017043916A1 (ko) * 2015-09-09 2017-03-16 엘지전자 주식회사 무선 통신 시스템에서 신호의 전송 방법 및 장치
KR102142363B1 (ko) 2016-09-28 2020-08-07 후지쯔 가부시끼가이샤 기지국 장치, 단말 장치, 무선 통신 시스템 및 무선 통신 시스템 제어 방법
KR101866479B1 (ko) * 2017-01-12 2018-06-11 주식회사 지씨티리써치 캐리어 어그리게이션과 다이버시티 이득의 전환을 이용한 대역폭 관리 방법 및 그 장치
CN108834217B (zh) * 2018-06-06 2023-05-16 京信网络系统股份有限公司 确定跨载波调度载波的方法、装置、计算机设备与介质

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1829131A (zh) * 2005-03-04 2006-09-06 松下电器产业株式会社 正交频分复用无线多媒体系统中的资源分配方法

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7099623B2 (en) * 2002-12-20 2006-08-29 Qualcomm Incorporated Managing searcher and tracker resources in a wireless communication device
KR100876757B1 (ko) * 2003-10-31 2009-01-07 삼성전자주식회사 통신 시스템에서 서브 채널 구성 시스템 및 방법
EP1692624B1 (en) * 2003-11-07 2016-05-04 Sharp Kabushiki Kaisha Method for network coordination with limited explicit message exchange
US7436801B1 (en) * 2004-09-08 2008-10-14 Golden Bridge Technology, Inc. Deferred access method for uplink packet channel
US8041362B2 (en) * 2006-03-20 2011-10-18 Intel Corporation Downlink resource allocation and mapping
US20070217362A1 (en) * 2006-03-20 2007-09-20 Nokia Corporation Amended control for resource allocation in a radio access network
CN101064638B (zh) * 2006-04-30 2011-04-20 华为技术有限公司 通信系统的资源分配指示方法及装置
EP1965536A1 (en) * 2007-02-06 2008-09-03 Mitsubishi Electric Information Technology Centre Europe B.V. Method of data transmission in a multi-carrier based transmission system and device implementing the method
US9344259B2 (en) * 2007-06-20 2016-05-17 Google Technology Holdings LLC Control channel provisioning and signaling
GB2457242A (en) * 2008-02-05 2009-08-12 Nec Corp Resource allocation in a communication system
KR101595022B1 (ko) 2008-02-05 2016-03-02 엘지전자 주식회사 효율적인 무선채널 전송방법
JP5059673B2 (ja) * 2008-03-31 2012-10-24 株式会社エヌ・ティ・ティ・ドコモ 移動通信システム及び無線リソース割り当て方法
KR101100227B1 (ko) * 2008-04-02 2011-12-28 엘지전자 주식회사 주파수 분할 다중 액세스 방식에서 로컬화 및 분산된 멀티플렉싱 다운링크
EP3223569A1 (en) * 2009-06-19 2017-09-27 Interdigital Patent Holdings, Inc. Signaling uplink control information in lte-a

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1829131A (zh) * 2005-03-04 2006-09-06 松下电器产业株式会社 正交频分复用无线多媒体系统中的资源分配方法

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"3GPP TSG RAN WG1 Meeting #56, Rl-090984, section 2, 09-13 February 2009", article ZTE: "Initial uplink access procedure in LTE-Advanced", XP050318814 *
CHENG ET AL.: "Study of performance of carrier aggregation technology in LTE-Advanced system", MODERN COMMUNICATIONS SCIENCE AND TECHNOLOGY, vol. 4, April 2009 (2009-04-01), XP008148187
LG ELECTRONICS: "UL control channel design to support carrier aggregation", 3GPP TSG RAN WG1 #56BIS, RL-091204, 23 March 2009 (2009-03-23), XP050338819 *
ZTE: "Uplink control channel design for LTE-Advanced", TSG-RAN WG1 #56BIS, R1-091427, 27 March 2009 (2009-03-27), XP050339006 *

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9026070B2 (en) 2003-12-18 2015-05-05 Qualcomm Incorporated Low-power wireless diversity receiver with multiple receive paths
US9450665B2 (en) 2005-10-19 2016-09-20 Qualcomm Incorporated Diversity receiver for wireless communication
US9178669B2 (en) 2011-05-17 2015-11-03 Qualcomm Incorporated Non-adjacent carrier aggregation architecture
US9252827B2 (en) 2011-06-27 2016-02-02 Qualcomm Incorporated Signal splitting carrier aggregation receiver architecture
US9154179B2 (en) 2011-06-29 2015-10-06 Qualcomm Incorporated Receiver with bypass mode for improved sensitivity
US8774334B2 (en) 2011-11-09 2014-07-08 Qualcomm Incorporated Dynamic receiver switching
JP2015505659A (ja) * 2012-01-31 2015-02-23 アップル インコーポレイテッド 拡張可能なキャリヤ配置における効率的なスペクトル使用法のための方法及び装置
US9549344B2 (en) 2012-01-31 2017-01-17 Apple Inc. Methods and apparatus for efficient spectral usage in extensible carrier deployments
US9247542B2 (en) 2012-01-31 2016-01-26 Apple Inc. Methods and apparatus for efficient spectral usage in extensible carrier deployments
US9362958B2 (en) 2012-03-02 2016-06-07 Qualcomm Incorporated Single chip signal splitting carrier aggregation receiver architecture
US9172402B2 (en) 2012-03-02 2015-10-27 Qualcomm Incorporated Multiple-input and multiple-output carrier aggregation receiver reuse architecture
US9118439B2 (en) 2012-04-06 2015-08-25 Qualcomm Incorporated Receiver for imbalanced carriers
US9166852B2 (en) 2012-05-25 2015-10-20 Qualcomm Incorporated Low noise amplifiers with transformer-based signal splitting for carrier aggregation
US9160598B2 (en) 2012-05-25 2015-10-13 Qualcomm Incorporated Low noise amplifiers with cascode divert switch for carrier aggregation
US9154357B2 (en) 2012-05-25 2015-10-06 Qualcomm Incorporated Multiple-input multiple-output (MIMO) low noise amplifiers for carrier aggregation
US9154356B2 (en) 2012-05-25 2015-10-06 Qualcomm Incorporated Low noise amplifiers for carrier aggregation
US9867194B2 (en) 2012-06-12 2018-01-09 Qualcomm Incorporated Dynamic UE scheduling with shared antenna and carrier aggregation
US9300420B2 (en) 2012-09-11 2016-03-29 Qualcomm Incorporated Carrier aggregation receiver architecture
US9543903B2 (en) 2012-10-22 2017-01-10 Qualcomm Incorporated Amplifiers with noise splitting
US9837968B2 (en) 2012-10-22 2017-12-05 Qualcomm Incorporated Amplifier circuits
US8995591B2 (en) 2013-03-14 2015-03-31 Qualcomm, Incorporated Reusing a single-chip carrier aggregation receiver to support non-cellular diversity
US10177722B2 (en) 2016-01-12 2019-01-08 Qualcomm Incorporated Carrier aggregation low-noise amplifier with tunable integrated power splitter

Also Published As

Publication number Publication date
CA2776537A1 (en) 2011-05-05
JP5573957B2 (ja) 2014-08-20
MX2012004658A (es) 2012-05-08
EP2472978A1 (en) 2012-07-04
EP2472978A4 (en) 2017-03-22
US20120198077A1 (en) 2012-08-02
KR20120101370A (ko) 2012-09-13
JP2013509120A (ja) 2013-03-07
BR112012009650A2 (pt) 2016-05-17
RU2012122170A (ru) 2013-12-10
CN102056296A (zh) 2011-05-11
EP2472978B1 (en) 2018-12-05
KR101675179B1 (ko) 2016-11-22
CN102056296B (zh) 2016-03-30
US9258091B2 (en) 2016-02-09
RU2520602C2 (ru) 2014-06-27
ZA201203081B (en) 2012-09-26
AU2010312097A1 (en) 2012-05-17

Similar Documents

Publication Publication Date Title
WO2011050729A1 (zh) 通信网络中的资源分配方法和装置
Liao et al. An efficient downlink radio resource allocation with carrier aggregation in LTE-advanced networks
KR101425959B1 (ko) 컴포넌트 캐리어들의 할당
JP5313365B2 (ja) 複数のキャリアでのデータ伝送をスケジューリングするための方法および装置
WO2010133059A1 (zh) 一种控制信道资源的分配方法及装置
KR20160035023A (ko) 서브캐리어 그룹 및 프레임 포맷에 대한 wlan ofdma 설계 시스템 및 방법
WO2014117347A1 (zh) 一种数据调度方法和设备
WO2020029698A1 (zh) 上行信道资源的指示及确定方法、基站、终端、介质
WO2010118582A1 (zh) 一种下行小区间干扰协调方法和基站
CN107113857B (zh) 第四代无线电移动网络的调度方法和系统
WO2012079529A1 (zh) 基于sdma的共享信道资源分配方法及系统
WO2013034110A1 (zh) 联合调度方法及装置
JP2009503973A (ja) 端末の送信電力を減少させるための無線資源の割り当て
CN109511120A (zh) 用于无线通信网络的通信方法和装置以及无线通信网络
WO2013026403A1 (zh) 一种资源分配方法及装置
JP5780903B2 (ja) 比例公平無線リソース管理
RU2606968C2 (ru) Разбиение очереди для параллельного планирования агрегирования несущих
JP6468196B2 (ja) 割り当て方法、無線通信システム、割り当て装置及びそのプログラム
WO2012174912A1 (zh) 一种干扰协调请求的发送方法和设备
WO2016077950A1 (zh) 一种控制信息处理的方法、装置和系统
WO2008000117A1 (fr) Procédé d'allocation de sous-porteuse à auto-adaptation dans un système d'accès multiple par la répartition orthogonale de la fréquence
KR101210115B1 (ko) 상향링크 sc-fdma 시스템에서의 주파수 부 채널 할당 방법 및 장치
JP2013106076A (ja) 無線リソース割当装置、基地局、および無線リソース割当方法
WO2011147295A1 (zh) 一种承载业务的方法、装置及系统
CN109982329A (zh) 一种数据传输方法和基站

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10826092

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2010826092

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2776537

Country of ref document: CA

WWE Wipo information: entry into national phase

Ref document number: 13500079

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2010312097

Country of ref document: AU

WWE Wipo information: entry into national phase

Ref document number: MX/A/2012/004658

Country of ref document: MX

WWE Wipo information: entry into national phase

Ref document number: 3626/CHENP/2012

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2012535615

Country of ref document: JP

ENP Entry into the national phase

Ref document number: 20127011006

Country of ref document: KR

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2010312097

Country of ref document: AU

Date of ref document: 20101028

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 2012122170

Country of ref document: RU

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112012009650

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 112012009650

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20120424