CN101686495B - Method and device for assigning service grouping resources - Google Patents

Method and device for assigning service grouping resources Download PDF

Info

Publication number
CN101686495B
CN101686495B CN200810223243A CN200810223243A CN101686495B CN 101686495 B CN101686495 B CN 101686495B CN 200810223243 A CN200810223243 A CN 200810223243A CN 200810223243 A CN200810223243 A CN 200810223243A CN 101686495 B CN101686495 B CN 101686495B
Authority
CN
China
Prior art keywords
mcs
time interval
user
users
data packet
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
CN200810223243A
Other languages
Chinese (zh)
Other versions
CN101686495A (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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN200810223243A priority Critical patent/CN101686495B/en
Publication of CN101686495A publication Critical patent/CN101686495A/en
Application granted granted Critical
Publication of CN101686495B publication Critical patent/CN101686495B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a method and a device for assigning service grouping resources, belonging to the communication field. The method for assigning the service grouping resources comprises the following steps: grouping the users according to the type of the service and determining the modulating and coding scheme (MCS) of the users in the groups; calculating subcarrier efficiency (SE) which corresponds to the MCS according to the determined MCS of the users; calculating the number of resource blocks (RB) of needed shared resources which correspond to the MCS according to the size of a service data packet, the size of the RB of the minimum assignment unit and the SE; indicating the number of the RB and the MCS which correspond to the users by using the corresponding bit of a bitmap to assign resources to the users in the groups. The device for assigning the service grouping resources comprises a fist acquiring module, a second acquiring module, a calculating module and an assigning module. The resources are assigned to the users in the groups according to the information on the quality of user channels, the size of the shared information and the number of the RB of needed shared resources which correspond to the MCS, the limitation that the users in the groups must have similar channel conditions is lessened, and the expenditure on the assignment of the service grouping resources is reduced.

Description

Method and device for realizing service grouping resource assignment
Technical Field
The present invention relates to the field of communications, and in particular, to a method and an apparatus for implementing service packet resource assignment.
Background
With the rapid development of wireless communication technology, current wireless communication systems can provide multimedia services such as voice, video, and data. These wireless communication systems provide shared resources by providing different multiple access technologies to multiple users accessing the system, where the shared resources include time, frequency, power, and the like. The conventional Multiple Access technology includes TDMA (Time Division Multiple Access), FDMA (Frequency Division Multiple Access), CDMA (Code Division Multiple Access), OFDMA (Orthogonal Frequency Division Multiple Access), and the like. OFDMA is widely used in its own merits, and OFDMA techniques are adopted in LTE (Long Term Evolution) in The 3rd Generation partnership Project (3 GPP), UMB (Ultra Mobile Broadband) in The 3rd Generation partnership Project 2 (3 GPP 2), IEEE (Institute of electrical and electronic Engineers, usa) 16 (3 rd Generation partnership Project) 16, and The like.
The wireless communication system mainly includes a terminal SS (Subscriber Station, mobile Station, or user terminal), a Base Station BS (Base Station), and a core network, where the terminal generally refers to a device for network communication, such as a mobile phone or a notebook. The radio resources (including time-frequency resources, power and the like) of downlink (communication from the base station to the terminal) and uplink (communication from the terminal to the base station) are scheduled by the base station in a shared manner. Each base station downlink direction can access a plurality of terminals and share the resources scheduled by the base station. Each terminal uplink is typically connected to only one base station in the network.
VoIP (Voice over Internet protocol, network Voice service) is a very important service in the existing wireless communication system, and there are a plurality of different Voice coding formats, such as AMR (Adaptive multi-Rate), EVRC (Enhanced variable Rate Coder), and different Voice coding formats have different bandwidth requirements, and there are two scheduling modes designed for VoIP at present:
prior art 1: 3GPP2(UMB) proposes a concept of VoIP group assignment, which divides a user SS into different groups according to different channel conditions, such as QPSK (quadrature Phase Shift Keying), 16QAM (16 quadrature amplitude Modulation) and 64QAM (64 quadrature amplitude Modulation), and if the user is in the QPSK group, the channel condition is poor. For each user in the same group, the time frequency resource size required by the VoIP packet is the same, and the base station BS can fixedly assign the position of each user in the group when establishing the group, the base station BS can correspond to the users in the group by issuing a bitmap in an assignment message, the user can determine the bit state of the user through the bitmap, and the position of the resource of the user is determined according to the state of the bitmap. Referring to fig. 1, a VoIP group is formed of 5 users SS1, SS2, SS3, SS4, and SS5, wherein the horizontal axis represents time domain resources and the vertical axis represents frequency domain resources in a wireless communication system; the time domain resources are represented in the OFDMA system by the OFDMA symbol, and the frequency domain resources are represented in the OFDMA system by the OFDMA subcarrier ofdm subframe; RB (Resource Block) represents a minimum granularity unit for carrying data. In the existing standard definition of 16m, one RB is defined as 6 OFDMA symbols in the time domain and 18 subcarriers in the frequency domain, i.e., the size of the RB is 18 × 6. In fig. 1, 5 RBs are defined as shared resources of the group (including SS1, SS2, SS3, SS4, SS5), and each user activation needs to occupy 1 RB, and muting needs not to occupy RBs. Assuming that the user states of the current frame are respectively SS1 activated, SS2 silenced, SS3 activated, SS4 silenced and SS5 activated, the bitmap sent by the BS is 10101, all activated users occupy the resources in sequence, and the SS1 corresponding to the first bit of the bitmap indicates 1, namely activated, and occupies the first RB; SS2 corresponds to the second bit of bitmap, and the indication is 0, namely silence, and no RB is occupied; the SS3 corresponds to the third bit of bitmap, the indication is 1, namely activation, the SS3 knows that only one user (SS1) is activated before through bitmap and already occupies one RB, so the SS3 occupies a second RB; similarly, SS4 is also in a silent state, not occupying RBs; SS5 is active occupying the third RB and the remaining two resources can be temporarily scheduled to the remaining users.
The scheme has strong limitation on user grouping, in addition, the configured shared resource size is not determined well, if the setting is too large, a lot of resources are not fully utilized by VoIP users in the group, resource waste is caused, and if the setting is too small, some activated users cannot be scheduled, so that the service quality of the users is influenced.
Prior art 2 improves on this set of assignments: the 1 bitmap in prior art 1 is replaced with 2 bitmaps. Wherein, the first bitmap is used to indicate the state of user silence or activation, and the meaning of the bitmap is the same as that of the bitmap in the prior art 1; the second bitmap is the voice packet size corresponding to the activated user indication in the first bitmap. The following describes the details of the prior art 2 with reference to fig. 2, taking the period 20ms for generating the new VoIP packet as an example.
Referring to fig. 2, a VoIP group formed by 20 users SS1-SS 20 equally divides the period 20ms of VoIP new packet generation into 4 intervals Interlace of 5 ms: interlace0, Interlace1, Interlace2, Interlace 3; the interval set by the Interlace is a period for completing data transmission once and feeding back a correct error state to determine whether retransmission is performed or not, and the SS1-SS5 are in the Interlace0, the SS 6-SS 10 are in the Interlace1, the SS 11-SS 15 are in the Interlace2, and the SS 16-SS 20 are in the Interlace 3. Two bitmaps need to be broadcast at each Interlace interval: the first bitmap indicates the states of silence, activation and retransmission packets of the corresponding users in the group; since SS1, SS2, SS3, SS4, SS5 are contained in Interlace0, the corresponding bit indicates whether it is a new packet transmission, is silent or active (0 indicates silent state, 1 indicates active state); the rest bits indicate whether other corresponding users have the retransmission packet (1 indicates retransmission, and 0 indicates no retransmission packet). The second bitmap indicates the packet size occupied by the corresponding active user or retransmission packet user (0 indicates that the packet occupies 1 RB, and 1 indicates that the packet occupies 2 RBs).
The bitmap in fig. 2 is specifically represented as:
SS1 is an active user, whose new packet occupies 1 RB;
SS2 is an active user, whose new packet occupies 1 RB;
SS3 is a silent user, which does not occupy RBs;
SS4 is a silent user, which does not occupy RBs;
SS5 is an active user, whose new packet occupies 2 RBs;
SS6 is a retransmission user who has not retransmitted packets (i.e., previous packets were transmitted correctly);
SS7 is a retransmission user, who does not retransmit packets;
SS8 is a retransmission user, which has a retransmission packet, and the retransmission packet occupies 1 RB;
SS9 is a retransmission user, who does not retransmit packets;
SS10 is a retransmission user, which has a retransmission packet, and the retransmission packet occupies 1 RB;
SS11 is a retransmission user, who does not retransmit packets;
SS12 is a retransmission user, who does not retransmit packets;
SS13 is a retransmission user, who does not retransmit packets;
SS14 is a retransmission user, who does not retransmit packets;
SS15 is retransmission user, which has retransmission packet, the retransmission packet occupies 2 RB;
SS16 is a retransmission user, who does not retransmit packets;
SS17 is a retransmission user, which has a retransmission packet, and the retransmission packet occupies 1 RB;
SS18 is a retransmission user, who does not retransmit packets;
SS19 is a retransmission user, who does not retransmit packets;
SS20 is a retransmission user that does not retransmit packets.
Assuming that the resource size assigned to each Interlace interval by the shared resource in the group is 10 RBs, the situation that the user occupies the resource in the Interlace0 according to the bitmap is shown in fig. 3.
In summary, the inventors found that the prior art has the problems of packet limitation and excessive resource assignment overhead.
Disclosure of Invention
In order to reduce the limitation that users in a group must have similar channel conditions and reduce the overhead of resource assignment, the embodiment of the invention provides a method and a device for realizing service grouping resource assignment, wherein the method comprises the following steps:
in one aspect, a method for implementing service packet resource assignment is provided, where the method includes:
determining a Modulation Coding Scheme (MCS) of a user according to channel quality condition information of the users in the group with the same service type;
calculating the subcarrier efficiency SE corresponding to the MCS according to the determined MCS of the user;
calculating the number of Resource Blocks (RB) of the required shared resource corresponding to the MCS according to the size of the service data packet, the size of the RB of the minimum allocation unit and the calculated Subcarrier Efficiency (SE) corresponding to the MCS;
and according to the size of the shared resource and the calculated number of the RBs, indicating the number of the required RBs corresponding to the user and the MCS mode by using the corresponding bit of the bitmap in the group to realize the resource allocation for the user in the group.
In another aspect, an embodiment of the present invention provides a device for implementing service packet resource assignment, where the device includes:
the first acquisition module is used for determining a Modulation and Coding Scheme (MCS) of a user according to channel quality condition information of the users in a group with the same service type;
a second obtaining module, configured to calculate, according to the MCS of the user determined by the first obtaining module, a subcarrier efficiency SE corresponding to the MCS;
the calculation module is used for calculating the number of Resource Blocks (RB) of the required shared resources corresponding to the MCS according to the size of the service data packet, the size of the RB of the minimum allocation unit and the calculated Subcarrier Efficiency (SE) corresponding to the MCS;
and the assignment module is used for indicating the number of the required RBs corresponding to the users and the MCS mode by using the corresponding bit of the bitmap in the group according to the size of the shared resource and the number of the Resource Blocks (RB) of the required shared resource corresponding to the MCS calculated by the calculation module, so as to realize the resource assignment for the users in the group.
The technical scheme provided by the embodiment of the invention has the beneficial effects that:
through the channel quality condition information of the users, the size of the shared resources and the number of Resource Blocks (RBs) of the required shared resources corresponding to the MCS, the resources are assigned to the corresponding users in the group by using the bitmap, the limitation on the grouping of the users is reduced, the limitation that the users in the group have similar channel conditions is reduced, and the overhead of resource assignment is reduced.
Drawings
Fig. 1 is a schematic diagram of VoIP group assignment provided by prior art 1;
fig. 2 is a schematic diagram of VoIP group assignment provided by prior art 2;
fig. 3 is a schematic diagram of a user occupying resources according to bitmap provided in prior art 2;
FIG. 4 is a schematic flow chart of a method provided in example 1 of the present invention;
fig. 5 is a schematic diagram of resource occupation under a first implementation mechanism provided in embodiment 1 of the present invention;
fig. 6 is a schematic diagram of resource occupation under a second implementation mechanism provided in embodiment 1 of the present invention;
fig. 7 is a schematic diagram of resource occupation provided in embodiment 2 of the present invention;
fig. 8 is a schematic diagram of HARQ retransmission packet transmission under the condition of sufficient shared resources provided in embodiment 2 of the present invention;
fig. 9 is a schematic diagram of HARQ retransmission packet transmission under the condition of insufficient shared resources according to embodiment 2 of the present invention;
fig. 10 is a schematic diagram of resource occupation after a rotation sequence in the case of insufficient shared resources according to embodiment 3 of the present invention;
fig. 11 is a schematic diagram of an apparatus for implementing service packet resource assignment according to embodiment 4 of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail with reference to the accompanying drawings.
In the process of implementing the present invention, the inventor finds that, aiming at the scheme provided by the prior art 1, there is a strong limitation on user grouping, and not only the users in the group are required to have the same modulation mode (such as QPSK, 16QAM, 64QAM, etc.), but also have the same coding mode, so that it can be ensured that all users occupy the same time-frequency resource; in addition, the size of the configured shared resource is not well determined, if the setting is too large, many resources are not fully utilized by the VoIP users in the group, which causes resource waste, and if the setting is too small, some activated users cannot be scheduled, which affects the service quality of the users. In the process of implementing the present invention, the inventor also finds that prior art 2 needs to indicate information of all users in each Interlace, which increases more redundant bits, and since the position information of the users is relatively fixed, when the shared resource is sufficient, the priorities of all users in the group are equal and all users are scheduled; if the shared resources are insufficient, users indicated by the bit after the bitmap cannot assign the shared resources in the group, and possible scheduling delay of the specific users is caused. Therefore, in order to reduce the grouping limitation, i.e. the limitation that users in a group must have similar channel conditions, and reduce the overhead of resource assignment, embodiments of the present invention provide a method for implementing service grouping resource assignment, which includes the following steps:
determining a Modulation Coding Scheme (MCS) of a user according to channel quality condition information of the users in the group with the same service type;
calculating the subcarrier efficiency SE corresponding to the MCS according to the MCS;
calculating the number of Resource Blocks (RB) of the required shared resource corresponding to the MCS according to the size of the service data packet, the size of the RB of the minimum allocation unit and the SE of the subcarrier efficiency;
and according to the size of the shared resource and the calculated number of RBs, indicating the number of the required RBs and the MCS corresponding to the user by using corresponding bits of a bitmap in the group.
Before the step of determining the modulation and coding scheme MCS of the user according to the channel quality status information of the users in the group of the same service type, the method further includes: the method is used for grouping the services according to the service types, so that users of the same service type are positioned in the same group.
Further, when the same shared resource is not continuously assigned to the service data, the method provided by the embodiment of the present invention further includes:
indicating the initial position of a shared resource on time frequency resources, and dynamically scheduling hybrid automatic repeat HARQ retransmission packets for users in the current time interval interlace if the data packet transmission error of the users occurs in the previous time interval interlace.
Further, when the same shared resource is continuously assigned to the service data, the method further includes:
when the same shared resources which are continuously assigned are sufficient, if the data packet transmission error of the user occurs in the previous time interval interlace, assigning the shared resources with the same position for the user in the current time interval interlace;
when the same shared resources which are continuously assigned are insufficient, if the data packet transmission error of the user occurs in the previous time interval interlace, judging whether the data packet with the error is the data packet which is scheduled to the shared resources in the previous time interval, if so, assigning the shared resources with the same position for the user in the current time interval interlace; otherwise, dynamically scheduling hybrid automatic repeat HARQ retransmission packets for the users in the current time interval interlace. When the resources in the group are insufficient, the transmission of the HARQ retransmission packet can be further realized through a specific mechanism.
Further, when the same shared resources that are continuously assigned are not sufficient, the method provided by the embodiment of the present invention further includes: and rotating the position sequence of the user in the bitmap according to a specific negotiation period, such as a period generated according to each service data packet. Therefore, the position rotation among the users can be carried out on the group so as to achieve the aim of scheduling all the users fairly.
The technical solutions provided by the embodiments of the present invention will be described in detail below with reference to the following embodiments.
Example 1
The embodiment of the present invention provides a method for implementing service packet resource assignment, where the method provided in the embodiment of the present invention reduces the limitation of packet, that is, the limitation that users in a group must have similar channel conditions, and for convenience of description, this embodiment specifically takes a VoIP service as an example for description, and referring to fig. 4, specific contents are as follows:
101: and determining the modulation coding scheme MCS of the user according to the channel quality condition information of the user. See below for details:
it should be noted that, in the embodiment, the VoIP service is taken as an example for explanation, and before executing step 101, the base station BS may group the users according to the service types, so that the users belonging to the same service type are in one group.
In a wireless communication system, when data is downlink, a base station BS determines an MCS (Modulation And Coding Scheme) to be adopted by corresponding user data according to a channel quality condition measured by a user: the better the channel condition of a user, the higher the modulation coding order it employs. In the existing communication system, there are several common modulation methods: QPSK, 16QAM, 64QAM, etc., the coding rate can be flexibly adjusted according to the adopted coding scheme, and the following takes IEEE 16m as an example to describe in detail the relationship between the specific modulation coding scheme MCS and the resource RB and to determine the number of RBs occupied by the user and MCS by using the 2-bit user corresponding information in bitmap, so as to reduce the limitation of grouping.
Resource block RB (resource block) is the smallest granularity unit of resource assignment, and the RB size of IEEE 16m is defined as 18 × 6, i.e., one RB includes 6 OFDMA symbols (symbols) in the time domain and 18 subcarriers (subcarriers) in the frequency domain, so that a total of 18 × 6 ═ 108 subcarriers (subcarriers) are included in 1 RB. Wherein,
if a QPSK modulation mode is adopted, one subcarrier (subcarriers) can carry 2 bits;
if a 16QAM modulation mode is adopted, one subcarrier (subcarriers) can carry 4 bits;
if a 64QAM modulation scheme is used, one subcarrier (subcarriers) can carry 6 bits.
The coding rate refers to (size of information bit before coding)/(size of information bit after coding), wherein the coding rate is set to a value less than 1, for example, if the information bit before coding is: 101, if the coded information bit is 110011, the coding rate is 3/6 ═ 1/2; for another example, if the information bit after encoding is 111000111, the coding rate is 3/9 — 1/3.
In summary, combining the modulation scheme (QPSK, 16QAM, 64QAM) with the coding rate (1/2, 1/3, 1/4, 2/3 …) yields the MCS that we understand in the general sense.
102: and calculating the subcarrier efficiency SE corresponding to the MCS according to the MCS of the user. See below for details:
taking a WiMAX (World Interoperability for Microwave Access) system as an example, several common MCS are given: QPSK1/8, QPSK1/4, QPSK1/2, QPSK3/4, 16QAM1/2, 16QAM3/4, 64QAM2/3, 64QAM3/4, 64QAM 5/6. And defining a unique SE (Subcarrier Efficiency) for each type of MCS, wherein the SE represents the number of true information bits which can be carried by each carrier of the corresponding MCS. Referring to table 1, it can be seen from the SE values corresponding to the above MCS types: the better the channel condition of the user is, the higher the modulation coding order adopted by the user is, the more information bits can be carried on each subcarrier of the user, and the less number of RBs are required. Conversely, when the channel condition of a user is worse, the lower the modulation coding order adopted by the user is, the less information bits can be carried on each subcarrier of the user, and the more RBs are required.
TABLE 1
MCS QPSK1/8 QPSK1/4 QPSK1/2 QPSK3/4 16QAM1/2 16QAM3/4 64QAM2/3 64QAM3/4 64QAM5/6
SE 2×1/ 8 =0.25 2×1/4 =0.5 2×1/2 =1 2×3/4 =1.5 4×1/2 =2 4×3/4 =3 6×2/3 =4 6×3/4 =4.5 6×5/6=5
[0085] 103: and calculating the number of the Resource Blocks (RB) of the required shared resources corresponding to the MCS according to the size of the service data packet, the size of the RB of the minimum allocation unit and the SE of the subcarrier efficiency corresponding to the MCS. See below for details:
in this embodiment, for example, the data packet is specifically a VoIP voice data packet, and according to the size of the VoIP voice packet given by IEEE 16m EMD (evaluation method Document), before a physical layer is not added for CRC (Cyclic Redundancy Check) of HARQ (Hybrid Automatic Repeat Request), the packet size is 288bits, where HARQ means that if one data packet is a transmission error for the first time, retransmission can be performed in an HARQ manner for the second time; the CRC is used for judging whether the current packet is transmitted in error or not and whether HARQ is needed or not, and the size of data borne by the CRC is 16 bits; the data size of the VoIP packet to which the CRC is added is: VoIP size + CRC 304 bits. Because of the implementation of group assignment, a Media access control header (MAC header) for user identification may be omitted, that is, the data size required for the VoIP packet is VoIP size + CRC 304 bits; if the MAC header is not omitted and the data size carried by the MAC header is 24 bits, the data size required by the VoIP packet is: VoIP size + CRC + mac header 304+24 328 bit. For convenience of description, this embodiment exemplifies a case where the MAC header is omitted, that is, the size packet size of the VoIP packet is 304 bits. In this embodiment, the size of the resource block RB sharing the resource is 8 × 6 — 108. The following describes in detail the relationship between the VoIP packet transmission data SE and the required number of RBs and modulation and coding scheme with reference to table 2.
TABLE 2
(VoIP packet size:304bits RB size:18×6=108)
MCS QPSK1/8 QPSK1/4 QPSK1/2 QPSK3/4 16QAM1/2 16QAM3/4 64QAM2/3 64QAM3/4 64QAM5/6
SE 2×1/ 8 =0.25 2×1/4 =0.5 2×1/2 =1 2×3/4 =1.5 4×1/2 =2 4×3/4 =3 6×2/3 =4 6×3/4 =4.5 6×5/6=5
RB num 12 6 3 2 2 1 1 1 1
As shown in table 2, taking QPSK1/8 as an example, the corresponding SE is 0.25, the number of RBs required is an integer value that is larger than VoIP packet size/(SE × RB size) and adjacent to VoIP packet size/(SE × RB size) because VoIP packet size is 304bits and RB size is 18 × 6, and the number of RBs required for transmitting data using QPSK1/8 is:
first, after calculating the product of subcarrier efficiency and resource block size, the quotient of the data packet size value and the product value is obtained, for example,
304/(0.25×108)=11.259,
and then, acquiring the number of RBs required by the user according to the quotient. The method comprises the following specific steps:
when the quotient value is an integer value, the integer value is the number of the RBs required by the user;
and when the quotient value is a non-integer value, rounding the non-integer quotient value and adding 1 to obtain a numerical value, wherein the numerical value is the number of the acquired RBs required by the user. For example:
for the quotient 11.259, since the quotient is a non-integer value, 11 is obtained by rounding 11.259, and the integer 12 is obtained as the number of the selected RBs by adding 1.
Similarly, the number of RBs required for QPSK1/4 is equal to 304/(0.5 × 108) which is 5.63 and is rounded by 1, i.e. 6;
similarly, the number of required RBs corresponding to each MCS can be obtained, as shown in table 2.
It should be particularly noted that the size of the service data packet described in this embodiment is generally a fixed size, and the "fixed" size is not absolutely the same, and those skilled in the art can know that since the VoIP service data packet includes a full rate packet, an 1/2 rate packet, a 1/4 rate packet, and the like, the service data packet can still be considered as a fixed size and equal to the full rate packet, and since the probability of occurrence of the 1/2 or 1/4 rate packet is small, but the occurrence of the different rate packet does not affect the implementation of the method provided by the embodiment of the present invention.
104: and according to the size of the shared resource, the number of the Resource Blocks (RB) of the shared resource corresponding to the MCS, and the corresponding bit of the bitmap to indicate the number of the required RB corresponding to the user and the MCS mode, realizing the resource allocation for the user in the group.
The base station may use a bitmap indicator to indicate the information status (silent, active) of each user in the group and the number of shared resource blocks RB occupied by each user, which can be obtained from table 2: if the order of the MCS is equal to or greater than QPSK1/2, the required RBs have only three cases: 1 RB is required, 2 RB is required, and 3 RB is required; if the order of the user is higher than 16QAM3/4, only 1 RB is needed for any kind of MCS to transmit VoIP (304bits), and on the premise that the number of required RBs is not changed, a lower order MCS can be used to ensure transmission performance, and 16QAM3/4 can be used as its MCS, and at this time, the state of the VoIP user can be distinguished by 2 bits:
00: the user is silent, has no corresponding VoIP data packet, and does not occupy RB;
01: the user activates and the corresponding MCS is selected to be 16QAM3/4, and 1 RB is occupied;
10: the user activates and the corresponding MCS is selected to be QPSK3/4, occupying 2 RBs;
11: the user activates and the corresponding MCS is selected to be QPSK1/2, occupying 3 RBs;
when the invention is implemented, the inventor realizes that the number of RBs occupied by the users and the MCS are determined according to the bitmap by adopting the indicator (00, 01, 10, 11) of 2bits in the bitmap, thereby reducing the limitation on user grouping, namely not necessarily requiring all users in the group to have similar channel conditions, and dividing VoIP users into one group.
It should be particularly noted that, in the case that the channel condition of some users is poor, the MCS scheme with the lower order is adopted for the users, such as the case of QPSK1/8 and the case of QPSK1/4, there may be two following mechanisms for transmitting data packets for the users:
one of the above is to classify QPSK1/8 and QPSK1/4 into QPSK1/2 (the QPSK1/2 can be defined as a reference modulation and coding scheme MCS, which is the modulation and coding scheme MCS with the largest number of RBs required for scheduling user resources), and the transmission performance of QPSK1/8 and QPSK1/4 is realized by an HARQ mechanism;
dividing users according to the channel condition and a reference Modulation and Coding Scheme (MCS), wherein the reference MCS is a reference standard for dividing user groups, and dividing all VoIP users into a cell center group and a cell edge group, wherein the users in the cell center group are higher than QPSK 1/2; users in the cell edge group are lower than QPSK1/2, namely QPSK1/2, QPSK1/4 and QPSK1/8 are grouped into one group; cell center users still follow the above implementation mechanism (00 silence; 01 active and occupying 1 RB; 10 active and occupying 2 RBs; 11 active and occupying 3 RBs), while cell edge user states can follow the following implementation mechanism (still distinguish cell edge user states for VoIP with 2 bits):
00: the user is silent, has no corresponding VoIP data packet, and does not occupy RB;
01: the user activates and the corresponding MCS is selected to be QPSK1/2, occupying 3 RBs;
10: the user activates and the corresponding MCS is selected to be QPSK1/4, occupying 6 RBs;
11: the user activates and the corresponding MCS is selected to be QPSK1/8, occupying 12 RBs;
the above two implementation mechanisms are specifically described below with reference to the drawings.
Suppose that a frame has 20 users SS1-SS 20, the corresponding states are the users in odd frames silent, and the corresponding states of the users in even frames are:
SS2:QPSK 1/8 SS4:QPSK 1/2 SS6:16QAM 3/4 SS8:QPSK 3/4
SS10:QPSK 1/2 SS12:64QAM 5/6 SS14:16QAM 1/2 SS16:64QAM 2/3
SS18:16QAM 3/4 SS20:64QAM 3/4
for the first implementation mechanism described above: placing all VoIP users in the same group; wherein, the grouping can be properly according to the capacity, but the grouping has no limit condition; according to the corresponding state of the users SS1-SS 20 in the group, the broadcasted bitmap is as follows: 0011001100010010001100010010000100010001, there are 20 users in total, each user corresponds to 2bits, then the bitmap is a fixed length of 20 × 2 ═ 40bits, and the resource occupation situation is shown in fig. 5.
For the second implementation mechanism described above: users are divided into cell center groups and cell edge groups according to their MCS. According to the corresponding states of the users SS1-SS 20 in the group, the users SS1-SS 20 are divided into the following two groups, wherein QPSK1/2 can be included in any one group.
Cell center (group 1): SS5, SS6, SS7, SS8, SS11, SS12, SS13, SS14, SS15, SS16, SS17, SS18, SS19, SS20.
Cell edge (group 2): SS1, SS2, SS3, SS4, SS9 and SS10.
The silent users are divided into groups according to the MCS when they are activated, for example, if there are odd users in the above example, the silent users correspond to the users who are silent, and the silent users may have a state of activating.
The bitmap broadcast by group 1 is: 0001001000010010000100010001, the bitmap broadcast by group 2 is: 001100010001, see fig. 6 for resource occupancy.
Through the two implementation mechanisms, the transmission of the data packets of the users with poor channel conditions is realized, and the reasonable allocation of grouping resources of VoIP users is better realized.
The embodiment of the present invention is described by taking VoIP service as an example, and those skilled in the art can know that the method provided in the embodiment of the present invention is also applicable to all services with fixed packet size.
In summary, the method provided in the embodiment of the present invention introduces the relationship between the specific modulation and coding scheme MCS and the resource RB in detail, and determines the number of RBs occupied by the user and the MCS according to the user corresponding information of 2bits in the bitmap, thereby reducing the limitation of grouping. In addition, for the cases of QPSK1/8 and QPSK1/4, two specific implementation mechanisms are proposed, and reasonable allocation of VoIP user packet resource assignment is better achieved.
To sum up, the method provided in embodiment 1 realizes resource assignment for the user according to the size of the shared resource and the number of resource blocks RB of the required shared resource corresponding to the MCS. Among them, when assigning the shared resource, the base station may not continuously assign the same shared resource to the VoIP group, and may continuously assign the same shared resource to the VoIP group, and particularly, in the case of continuously assigning the same shared resource to the VoIP group, there is a problem of whether the assigned same common resource is sufficient, so for the above description, the inventor may solve the above problem by the following method, which is described in embodiment 2 below:
example 2
The embodiment of the invention provides a method for realizing service grouping resource assignment, which solves the problem of transmitting data packets of a VoIP group, in particular, solves the scheduling problem under the condition of insufficient resources through an HARQ (hybrid automatic repeat request) realizing mechanism and a related processing mechanism, and comprises the following specific contents:
first, the same shared resource is not assigned continuously to the VoIP group
When the same shared resource is not continuously assigned to the VoIP group, the resource occupation sequence of the users in the group is realized according to the starting point and the indication of bitmap only by continuously assigning the starting point of one shared resource.
In this case, the retransmission information HARQ needs to be implemented by dynamic scheduling, that is, for the user needing to retransmit the data packet, the transmission of the retransmitted data packet is implemented by using a dynamic scheduling manner. In the following, the embodiment of the present invention is described by taking an example that one VoIP group includes 10 SS1 to SS10, and when the VoIP group is implemented, the VoIP new packet is divided into interlaces at equal intervals of 20ms, and the embodiment takes division into 2 interlaces (Interlace0 and Interlace1) as an example, where the interlaces 0 include SS1 to SS5, and the interlaces 1 include SS6 to SS10, which are described in detail, where a start position of a shared resource is indicated on a time-frequency resource.
Referring to fig. 7, it is assumed that the states corresponding to the 10 users SS1-SS 10 of the VoIP group are: QPSK1/2, SS2 silence, SS3 16QAM3/4, SS4 silence, SS5 QPSK3/4, SS6 64QAM3/4, SS7 silence, SS8 16QAM3/4, SS9 silence, SS10 QPSK1/2,
since, according to the method provided in embodiment 1, wherein,
00: the user is silent, has no corresponding VoIP data packet, and does not occupy RB;
01: the user activates and the corresponding MCS is selected to be 16QAM3/4, and 1 RB is occupied;
10: the user activates and the corresponding MCS is selected to be QPSK3/4, occupying 2 RBs;
11: the user activates and the corresponding MCS is selected to be QPSK1/2, occupying 3 RBs;
therefore, the bitmap broadcasted by the Interlace0 is SS1-SS 5: 1100010010, the bitmap broadcast in the Interlace1 is SS 6-SS 10: 0100010011.
it is assumed that if the SS1 is in error in transmission in the Interlace0, the BS dynamically schedules HARQ retransmission packets for the SS1 at the position of the Interlace1, and at this time, the position of the SS1 for transmitting the retransmission packets has no relation to the StartPoint defining the VoIP group, and the position of the SS1 for transmitting the retransmission packets is dynamic.
Second, the VoIP group is continuously assigned with the same size region as the shared resource
When the same size of area is continuously assigned to the VoIP group as the shared resource, it is difficult to reasonably set the size of the corresponding area due to the change of the user silent activation status and the change of MCS, and there is a problem whether the set shared resource is sufficient:
1. if the set shared resources are sufficient, the users occupy the shared resources sequentially, and at this time, the same shared resources are continuously assigned to the user HARQ retransmission packet (the same shared resources refer to that the retransmission packet and the new packet occupy the same position of the shared resource block), and the shared resources are used for transmitting the remaining resources outside the HARQ retransmission packet and can be dynamically scheduled to other users for use.
2. If the set shared resource is insufficient, the non-scheduled user can dynamically assign the resource, or can occupy the resource after the group in sequence, and at this time, the following two situations exist for the retransmission of the user HARQ retransmission packet:
if the user HARQ retransmission packet is scheduled to the shared resource in the last transmission time period, such as interlace0, continuing to continuously assign the same shared resource to the user in the current transmission time period, such as interlace1, that is, the user HARQ packet still occupies the shared resource;
and if the HARQ retransmission packet of the user is not scheduled to the shared resource in the last transmission time period such as interlace0, performing dynamic scheduling on the resource for the HARQ retransmission packet of the user in the current transmission time period such as interlace 1. Further, a dynamic resource scheduling manner may be adopted for HARQ retransmission packets of all users.
Referring to fig. 8 and fig. 9, a specific implementation manner of HARQ retransmission packet transmission in the above two cases of sufficient shared resources and insufficient shared resources is described below.
1. The shared resources are sufficient: assuming that the assigned shared resource size is 8 time-frequency resources (i.e. 8 RB), the VoIP group includes 10 users SS1-SS 10, and according to the Interlace structure, the SSs 1-SS5 occupy the Interlace0, the SSs 6-SS 10 occupy the Interlace1, and the VoIP packet state and the corresponding MCS are set as follows:
SS1 is QPSK1/2, SS2 is silent, SS3 is 16QAM3/4, SS4 is silent, SS5 is QPSK3/4, SS6 is 64QAM3/4, SS7 is silent, SS8 is 16QAM3/4, SS9 is silent, and SS10 is QPSK1/2, then the bitmap structure broadcast at Interlace0 is: 00000000 (indicating that all resources are available in Interlace0, no retransmitted packets) + 1100010010 (corresponding to packet status and MCS status of users SS1 to SS5, respectively).
Referring to fig. 8, assume that if SS3 transmits an error in Interlace0, then in Interlace1, the bitmap structure broadcast is: 00010000 (indicating that the original corresponding new packet position of SS3 needs to transmit HARQ retransmission packet due to transmission error) + 0100010011 (corresponding to the packet states and MCS states of users SS6 to SS10, respectively), and the condition that the user occupies resources: the first bitmap00010000 of the current Interlace1 indicates whether there is a user (user occupying shared resource) transmission error in the previous Interlace0, and if there is a user transmission error in the Interlace0, the HARQ retransmission packet is transmitted by occupying the same shared resource in the current Interlace 1. The user in the current Interlace1 determines which resources can be occupied and which resources cannot be occupied from the first bitmap, so that the corresponding available resources are occupied according to the second bitmap sequence of the current Interlace 1. If there are resources (e.g., the remaining two blocks in fig. 8) that are not occupied, they can BE dynamically scheduled by the BS to other users (including VoIP users as well as BE users). For example, referring to fig. 8, in this embodiment, taking the transmission error of the SS3 in the Interlace0 as an example, the SS3 occupies the 4 th RB in the Interlace0, and then retransmits the packet at the same position in the Interlace1, i.e., the 4 th RB of the Interlace1 is still used to retransmit the packet for the SS 3.
In summary, it is discussed that when the shared resources are sufficient, the assigned transmission of the users in the group is realized by using the bitmap of the first broadcast (i.e. whether the resource is available, if the corresponding resource is used for continuously assigning the transmission retransmission packet, the corresponding bit is set to 1 to indicate that the resource is not available) and the bitmap of the second broadcast (the state (silence/activation, and corresponding MCS) of the user where the current Interlace is located).
2. Insufficient shared resources: still, the VoIP group includes 10 users SS1 to SS10, and according to the structure of Interlace, where SS1 to SS5 occupy Interlace0, and SSs 6 to SS10 occupy Interlace1, assume that only 4 resource RBs are set as shared resources, and the bitmap broadcast by Interlace0 is: 0000 (all resources available) + 1100010010.
Referring to fig. 9, in Interlace0, the situation of a user occupying a resource: since the set shared resource is 4 RBs, in Interlace0, since user SS1 occupies 3 RBs and SS3 occupies 1 RB, it is obvious that user SS5 cannot share the shared resource, at this time, it may be default that the resource of SS5 is immediately behind the shared resource shared by Interlace0, where, on the premise that the Interlace0 resource is sufficient, the resource may be temporarily scheduled; on the premise that the Interlace0 resource is not sufficient (for example, the resource behind the SS3 is occupied by another user and the Interlace0 has no remaining resource), the data of the SS5 can be buffered in the subsequent frame for scheduling.
Assuming that, in the transmission process from Interlace0 to Interlace1, the transmission of SS3 and SS5 is erroneous, since SS3 occupies the shared resource in Interlace0, the HARQ retransmission packet of SS3 may continuously assign the shared resource occupying the same position as Interlace1, and since SS5 does not occupy the shared resource in Interlace0, the HARQ retransmission packet of SS5 is dynamically scheduled in Interlace 1. Since the SS3 and the SS5 in the Interlace0 have transmission errors, the bitmap broadcasted by the Interlace1 is: 0001+ 0100010011, in Interlace1, see FIG. 9 for the case that the user occupies the resource. Since only 4 blocks of shared resources are set, and the first 2 blocks are already occupied by SS6 and SS8, the SS3 needs to occupy the shared resource at the same position in Interlace1 to transmit the HARQ retransmission packet, and then the 3rd block is occupied by the HARQ retransmission packet of SS3, there are two processing methods for the 3 blocks of resources needed by SS 10: one approach is that the first SS10 occupies the remaining shared resource, and the two remaining SSs 10 follow the SS3 in sequence and need dynamic scheduling, as shown in fig. 9; another approach is that the 3 blocks of resources required by SS10 are all dynamically scheduled, while one block of shared resources is empty and can be scheduled to other users, but not used by SS10.
In summary, the method provided in the embodiments of the present invention defines respective transmission mechanisms for the cases of sufficient and insufficient shared resources under the condition that the packet is not limited, and realizes the transmission of the HARQ retransmission packet through a specific mechanism when the shared resources are insufficient, and also realizes a mechanism for processing the case of resource disconnection required by the user, thereby reducing the overhead of resource assignment, and better realizing the reasonable configuration of the packet resource assignment for the VoIP user.
To sum up, the method provided in embodiment 2 of the present invention discusses that, under the condition that the unlimited packet is guaranteed, respective transmission mechanisms are defined for the conditions that the shared resource is sufficient and insufficient, and the transmission of the HARQ retransmission packet is realized through a specific mechanism when the shared resource is insufficient. The inventor also finds that, when implementing the present invention, due to the fact that the positions of users are relatively fixed, the scheduling priority of some users behind themselves is reduced, and particularly, on the premise of insufficient resources, dynamic delay scheduling needs to be performed each time, and for services with high latency requirements (such as VoIP services, etc.), since each Service user in a group is not prioritized, the QoS (Quality of Service) of users behind the group is poor due to the above-mentioned position fixing. See below for details:
example 3
The embodiment of the invention provides a method for realizing service grouping resource assignment, which ensures scheduling fairness by rotating the position sequence of a user in a bitmap according to a specific negotiation period, and takes VoIP service as an example, and the specific contents are as follows:
the invention discloses a method for scheduling VoIP users in a group, which comprises the steps of determining the positions of users in the group, determining the positions of the users in the group, and determining the positions of the users in the group according to the determined positions of the users in the group.
For convenience of explanation, still, the VoIP group includes 10 users SS1 to SS10, and according to the structure of Interlace, where SS1 to SS5 occupy Interlace0 and SS6 to SS10 occupy Interlace1, it is assumed that, in the current period of 20ms, users in the previous period Interlace0 are sequentially switched from SS1, SS2, SS3, SS4, SS5 to SS2, SS3, SS4, SS5, and SS1, and users in the Interlace1 are sequentially switched from SS6, SS7, SS8, SS9, SS10 to SS7, SS8, SS9, SS10, and SS 6. The bitmap broadcasted by the Interlace0 in the current period is SS2, SS3, SS4, SS5, SS 1: 00000+ 0001001011, and accordingly, the situation that each user in the group occupies the resource: the SS3 occupies the 1 st block shared resource, the SS5 occupies the 2 nd and 3rd block shared resources, and since only 4 block shared resources are set and the SS1 requires 3 block resources, there are two processing methods for the 3 block resources required by the SS 1:
1. one approach is that the first block of resources required by SS1 occupies the remaining shared resource, and the last two blocks follow the first block SS1 in sequence and need to be dynamically scheduled, as shown in fig. 10;
2. another approach is that the 3 blocks of resources required by SS1 are all dynamically scheduled, while one block of shared resources is empty and can be scheduled to other users but not used by SS 1.
For convenience of description, in this embodiment, dynamic scheduling of SS1 is taken as an example, that is, the 1 st RB in Interlace1 is occupied by SS3, the 2 nd and 3rd RBs are occupied by SS5, and since users in Interlace1 also rotate, their bitmaps are SS7, SS8, SS9, SS10, SS 6: 0001001101, respectively; then the 4 th RB in the shared resource is occupied by SS 8.
Referring to fig. 10, assuming that in the transmission process from Interlace0 to Interlace1 in the current period, the transmission errors of SS3 and SS5 are generated, the bitmap broadcasted at Interlace1 is 1110+ 0001001101 (SS7, SS8, SS9, SS10, and SS6), since only 4 shared resources are set, the SS3 retransmission packet occupies the 1 st shared resource, the SS5 retransmission packet occupies the 2 nd and 3rd shared resources, and the SS8 occupies the 4 th shared resource. The 3-block resources required by SS10 and the 1-block resources required by SS6 require dynamic scheduling.
From fig. 10, it can be derived that: the original HARQ packet of SS5 needs to be scheduled, and now the HARQ of SS5 can occupy the shared resource to transmit through the mode of rotation, so that the time delay of the user is ensured, and the time delay is distributed to the SS6 of the user, i.e. the SS6 needs to dynamically schedule the new packet, and the fairness of scheduling of all users is ensured through the rotation of the users.
The rotation provided by the embodiment of the present invention is exemplified by the way of changing SS1, SS2, SS3, SS4, and SS5 to SS2, SS3, SS4, SS5, and SS1, but the specific rotation method and method are not limited, for example, the rotation method of changing SS1, SS2, SS3, SS4, and SS5 to SS5, SS4, SS3, SS2, and SS1 may also be adopted, as long as the users in the group are sequentially changed in position, so that the fairness scheduling purpose is achieved, and the rotation method is within the protection scope of the embodiment of the present invention.
In summary, the method provided in the embodiment of the present invention performs position rotation between users in a VoIP group, and under the condition that shared resources are insufficient, spreads poor communication quality of some users to all users in the group, solves the problem that the communication quality of users behind the group is poor, achieves the purpose of fairly scheduling all users, alleviates the sensitivity of VoIP to delay, and is a fair scheduling for scheduling itself.
Example 4
Referring to fig. 11, an embodiment of the present invention provides a device for implementing service packet resource assignment, where the device includes:
the first acquisition module is used for determining a Modulation and Coding Scheme (MCS) of a user according to channel quality condition information of the users in a group with the same service type;
the second acquisition module is used for calculating the subcarrier efficiency SE corresponding to the MCS according to the MCS of the user determined by the first acquisition module;
the calculation module is used for calculating the number of Resource Blocks (RB) of the shared resources corresponding to the MCS according to the size of the service data packet, the size of the Resource Blocks (RB) of the shared resources and the calculated Subcarrier Efficiency (SE) corresponding to the MCS;
and the assignment module is used for indicating the number of the required RBs corresponding to the users and the MCS mode by using the corresponding bits of the bitmap of the group according to the size of the shared resource and the number of the Resource Blocks (RB) of the required shared resource corresponding to the MCS calculated by the calculation module, so as to realize the resource assignment for the users in the group.
Wherein, the calculation module specifically includes:
the first calculation unit is used for calculating the product of the subcarrier efficiency SE corresponding to the MCS and the size of the minimum allocation unit resource block RB;
the second calculation unit is used for calculating the quotient of the size of the service data packet and the product obtained by the first calculation unit;
a third calculating unit, configured to calculate, according to the quotient value obtained by the second calculating unit, the number of resource blocks RB of the required shared resource corresponding to the MCS, where when the quotient value is an integer value, the integer value is the number of resource blocks RB of the required shared resource corresponding to the MCS; and when the quotient value is a non-integer value, rounding the non-integer value and adding 1 to obtain a value which is the number of the resource blocks RB of the required shared resource corresponding to the MCS.
Further, the apparatus further comprises:
and the selection module is used for modulating and coding the user by adopting a low-order Modulation and Coding Scheme (MCS) when the number of Resource Blocks (RB) of the required shared resource corresponding to the plurality of MCS is the same.
Further, the apparatus further comprises:
the classifying module is used for adopting a low-order modulation coding scheme MCS to users with poor channel conditions; classifying users with poor channel conditions into a reference Modulation Coding Scheme (MCS) according to the low-order MCS, and allocating resources to the users with poor channel conditions according to the number of the shared Resource Blocks (RB) corresponding to the reference MCS;
the grouping module is used for obtaining a Modulation Coding Scheme (MCS) of a user according to the channel condition of the user; grouping the users according to the modulation coding mode of the users and the reference modulation coding mode MCS; and according to the respective bitmap of different groups, indicating the number of the required RBs corresponding to the users in the group after grouping and the MCS mode by using the corresponding bits of the respective bitmap, thereby realizing the resource assignment of the users.
When the same shared resource is not continuously assigned to the service data, the device further comprises:
and the indicating module is used for indicating the initial position of one shared resource on the time frequency resource, and dynamically scheduling the hybrid automatic repeat HARQ retransmission packet for the user in the current time interval interlace if the data packet transmission error of the user occurs in the previous time interval interlace.
(II) when the same shared resource is continuously assigned to the service data, the device further comprises:
the first processing module is used for assigning the shared resources with the same positions for the users in the current time interval interlace if the data packet transmission error of the users occurs in the previous time interval interlace when the same shared resources which are continuously assigned are sufficient;
the second processing module is used for judging whether the data packet with the error is the data packet which is scheduled to the shared resource in the previous time interval or not when the same shared resource which is continuously assigned is insufficient and if the data packet transmission error of the user occurs in the previous time interval interlace, and if so, assigning the shared resource with the same position to the user in the current time interval interlace; otherwise, dynamically scheduling hybrid automatic repeat HARQ retransmission packets for the users in the current time interval interlace.
The first processing module specifically includes:
the first processing unit is used for acquiring a data packet transmission error of a user in an interlace of a previous time interval through a bitmap indication of a first broadcast;
the second processing unit is used for assigning shared resources with the same position for the users with the data packet transmission errors in the current time interval interlace, which are acquired by the first processing unit, according to the bitmap indication of the second broadcast and the same position of the data packet with the transmission errors in the previous time interval interlace;
and the third processing unit is used for dynamically scheduling the residual shared resources in the current time interval interlace to other users for use after the second processing unit assigns the shared resources with the same positions to the users in the current time interval interlace.
Wherein, the second processing module specifically includes:
the judging unit is used for acquiring whether a data packet transmission error of a user occurs in an interlace of a previous time interval or not and whether the data packet with the error is a data packet which is scheduled to a shared resource in the previous time interval or not according to a bitmap indication of a first broadcast;
a fourth processing unit, configured to assign shared resources with the same location to the user in the current time interval interlace when the result determined by the determining unit is that the data packet of the user has an error in transmission in the previous time interval interlace and the erroneous data packet is a data packet scheduled to the shared resource in the previous time interval;
and the fifth processing unit is used for dynamically scheduling the hybrid automatic repeat request HARQ retransmission packet for the user in the current time interval interlace when the judgment result of the judging unit is that the data packet of the user has a transmission error in the previous time interval interlace and the data packet with the transmission error is not the data packet scheduled to the shared resource in the previous time interval.
The fourth processing unit is further configured to, after the shared resources with the same position are assigned in the current time interval interlace, dynamically schedule data of the other users when the shared resources remaining in the current time interval interlace are less than the shared resources occupied by the other users in the current time interval interlace, or the other users occupy the shared resources remaining in the current time interval interlace and dynamically schedule the remaining data after the other users occupy the shared resources.
It is particularly noted that, when the same shared resources that are continuously assigned are not sufficient, the second processing module further comprises:
and the rotation unit is used for rotating the position sequence of the user in the bitmap according to the specific negotiation period, such as the position sequence of the user according to the period generated by each data packet of the service.
Wherein, alternate the unit and specifically include:
the dividing subunit is used for dividing the period generated by each data packet into time intervals interlaces at equal intervals, and each time interval interlace in the same period has respective users;
and the rotation subunit is used for performing independent position rotation on the users in each time interval interlace in each period divided by the dividing subunit according to the period generated by each data packet.
Further, the apparatus provided in the embodiment of the present invention further includes: and the type grouping module is used for grouping the services according to the service types so that users of the same service type are positioned in the same group.
In summary, the apparatus provided in the embodiment of the present invention assigns resources to users according to the size of the shared resource and the number of resource blocks RB of the shared resource required by MCS, so as to ensure that the grouping is not limited, and defines respective transmission mechanisms for the cases where the shared resource is sufficient and insufficient, and realizes the transmission of the HARQ retransmission packet through a specific mechanism when the shared resource is insufficient, and also realizes a mechanism for processing the case where the resource required by the user is disconnected, thereby reducing the overhead of resource assignment, and better realizing the reasonable configuration of the grouping resource assignment for the users. And furthermore, by carrying out position alternation among users in the group, under the condition of insufficient shared resources, the poor communication quality of some users is spread on all users in the group, so that the problem of poor communication quality of the users behind the group is solved, the aim of fairly scheduling all users is fulfilled, the sensitivity of the service to time delay is relieved, and the method is a fair scheduling for scheduling.
Each functional unit in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium. The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims (25)

1. A method for implementing service packet resource assignment, the method comprising:
determining a Modulation Coding Scheme (MCS) of a user according to channel quality condition information of the users in the group with the same service type;
calculating the subcarrier efficiency SE corresponding to the MCS according to the MCS;
calculating the number of Resource Blocks (RB) of the required shared resource corresponding to the MCS according to the size of the service data packet, the size of the RB of the minimum allocation unit and the SE of the subcarrier efficiency;
and according to the size of the shared resource and the calculated number of the RBs, indicating the number of the required RBs and the MCS corresponding to the user by using the corresponding bit of the bitmap in the group.
2. The method of claim 1, wherein the step of calculating the number of resource blocks RB of the required shared resource corresponding to the MCS according to the size of the service data packet, the size of the resource block RB of the minimum allocation unit, and the calculated subcarrier efficiency SE corresponding to the MCS specifically comprises:
calculating the product of the subcarrier efficiency SE corresponding to the MCS and the size of the minimum allocation unit resource block RB;
calculating a quotient of the size of the service data packet and the product;
and calculating the number of Resource Blocks (RBs) of the required shared resource corresponding to the MCS according to the quotient.
3. The method according to claim 2, wherein the step of calculating the number of resource blocks RB of the required shared resource corresponding to the MCS according to the quotient specifically includes:
when the quotient value is an integer value, the integer value is the number of Resource Blocks (RBs) of the required shared resource corresponding to the MCS;
and when the quotient value is a non-integer value, taking the integer of the non-integer value and adding 1 to obtain a value which is the number of the Resource Blocks (RBs) of the required shared resource corresponding to the MCS.
4. The method of claim 1, wherein after calculating the number of resource blocks RB of the required shared resource corresponding to the MCS, the method further comprises:
and when the number of resource blocks RB of the required shared resource corresponding to the plurality of modulation coding schemes MCS is the same, performing modulation coding by adopting a low-order modulation coding scheme MCS.
5. The method of claim 1, wherein the step of determining the Modulation and Coding Scheme (MCS) of the user further comprises:
adopting a low-order modulation coding scheme MCS for users with poor channel conditions; classifying the users with poor channel conditions to a reference Modulation Coding Scheme (MCS) according to the low-order MCS;
correspondingly, the step of indicating the number of the required RBs and the MCS corresponding to the user by using the corresponding bit of the bitmap in the group according to the size of the shared resource and the calculated number of RBs specifically includes:
and according to the size of the shared resource and the number of Resource Blocks (RB) of the required shared resource corresponding to the reference Modulation Coding Scheme (MCS), indicating the number of the required RB corresponding to the user with poor channel conditions and the MCS by using corresponding bits of a bitmap in the group, and realizing the resource allocation to the user with poor channel conditions.
6. The method of claim 1, wherein the step of determining the Modulation and Coding Scheme (MCS) of the user is followed by the step of: :
grouping the users according to the modulation coding mode of the users and a reference modulation coding Mode (MCS);
correspondingly, the step of indicating the number of the required RBs and the MCS corresponding to the user by using the corresponding bit of the bitmap in the group according to the size of the shared resource and the calculated number of RBs specifically includes:
and according to the size of the shared resource and the calculated number of RBs, according to the respective bitmap of the grouped different groups, and by using the corresponding bit of the respective bitmap grouped in the group to indicate the required number of RBs and the MCS mode corresponding to the grouped users, the resources are assigned to the users.
7. The method of claim 1, wherein when the same shared resource is not continuously assigned to the service data, the step of indicating the number of RBs required and the MCS corresponding to the user by using the corresponding bit of the bitmap in the group according to the size of the shared resource and the calculated number of RBs comprises:
indicating the initial position of a shared resource on time frequency resources, and if the data packet transmission error of a user occurs in the previous time interval interlace, dynamically scheduling a hybrid automatic repeat request (HARQ) retransmission packet for the user in the current time interval interlace.
8. The method of claim 1, wherein when the same shared resource is continuously assigned to the service data, the step of indicating the number of RBs required and the MCS corresponding to the user by using the corresponding bit of the bitmap in the group according to the size of the shared resource and the calculated number of RBs comprises:
when the same shared resources which are continuously assigned are sufficient, if the data packet transmission error of the user occurs in the previous time interval interlace, assigning the shared resources with the same position for the user in the current time interval interlace;
when the same shared resources which are continuously assigned are insufficient, if the data packet transmission error of the user occurs in the previous time interval interlace, judging whether the data packet with the error is the data packet which is scheduled to the shared resources in the previous time interval, if so, assigning the shared resources with the same position for the user in the current time interval interlace; otherwise, dynamically scheduling hybrid automatic repeat HARQ retransmission packets for the user in the current time interval interlace.
9. The method according to claim 8, wherein the step of assigning the shared resources with the same location to the user in the current time interval interlace if the data packet transmission error of the user occurs in the previous time interval interlace when the same shared resources assigned continuously are sufficient, specifically comprises:
acquiring a data packet transmission error of a user in an interlace in a previous time interval through a bitmap indication of a first broadcast;
and according to the bitmap indication of a second broadcast, assigning shared resources with the same positions for the users in the current time interval interlace according to the same positions of the data packets with the transmission errors in the previous time interval interlace.
10. The method of claim 8, wherein when the same shared resource assigned continuously is not sufficient, if a data packet transmission error of a user occurs in an interlace of a previous time interval, determining whether the data packet with the error is a data packet scheduled to the shared resource in the previous time interval, if so, assigning the shared resource with the same position for the user in a current time interval interlace; otherwise, the step of dynamically scheduling hybrid automatic repeat HARQ retransmission packets for the user within the current time interval interlace specifically includes:
acquiring whether a data packet transmission error of a user occurs in an interlace of a previous time interval or not and whether the data packet with the transmission error is a data packet scheduled to a shared resource in the previous time interval or not according to a bitmap indication of a first broadcast;
if the data packet transmission error of the user occurs in the previous time interval interlace and the data packet with the error is the data packet which is scheduled to the shared resource in the previous time interval, assigning the shared resource with the same position for the user in the current time interval interlace, and after assigning the shared resource with the same position in the current time interval interlace, when the residual shared resource in the current time interval interlace is less than the residual data occupied by the other users in the current time interval interlace, dynamically scheduling the data of the other users, or when the residual data occupied by the other users in the current time interval interlace is dynamically scheduled;
and if the data packet transmission error of the user occurs in the previous time interval interlace and the data packet with the error is not the data packet which is scheduled to the shared resource in the previous time interval, dynamically scheduling a hybrid automatic repeat request (HARQ) retransmission packet for the user in the current time interval interlace.
11. The method of claim 8, wherein said step of assigning a co-located shared resource for said user within a current time interval interlace when said persistently assigned same shared resource is insufficient, further comprises:
and the position sequence of the user in the bitmap is periodically rotated.
12. The method of claim 11, wherein the step of periodically rotating the position order of the user in the bitmap specifically comprises:
dividing the period generated by each data packet into time intervals interlaces at equal intervals, wherein each time interval interlace in the same period has respective users;
the users in each time interval interlace perform an independent position rotation according to the period in which each packet is generated.
13. The method of claim 1, wherein before the step of determining the Modulation and Coding Scheme (MCS) of the users according to the channel quality status information of the users in the same service type group, the method further comprises:
and grouping the services according to the service types, so that users of the same service type are positioned in the same group.
14. An apparatus for implementing traffic packet resource assignment, the apparatus comprising:
the first acquisition module is used for determining a Modulation and Coding Scheme (MCS) of a user according to channel quality condition information of the users in a group with the same service type;
a second obtaining module, configured to calculate, according to the MCS of the user determined by the first obtaining module, a subcarrier efficiency SE corresponding to the MCS;
the calculation module is used for calculating the number of Resource Blocks (RB) of the required shared resources corresponding to the MCS according to the size of the service data packet, the size of the RB of the minimum allocation unit and the calculated Subcarrier Efficiency (SE) corresponding to the MCS;
and the assignment module is used for indicating the number of the required RBs corresponding to the users and the MCS mode by using the corresponding bit of the bitmap in the group according to the size of the shared resource and the number of the Resource Blocks (RB) of the required shared resource corresponding to the MCS calculated by the calculation module, so as to realize the resource assignment for the users in the group.
15. The apparatus of claim 14, wherein the computing module specifically comprises:
a first calculating unit, configured to calculate a product of subcarrier efficiency SE corresponding to the MCS and a size of the minimum allocation unit resource block RB;
the second calculation unit is used for calculating the quotient of the size of the service data packet and the product obtained by the first calculation unit;
a third calculating unit, configured to calculate, according to the quotient value obtained by the second calculating unit, the number of resource blocks RB of the required shared resource corresponding to the MCS, where when the quotient value is an integer value, the integer value is the number of resource blocks RB of the required shared resource corresponding to the MCS; and when the quotient value is a non-integer value, taking the integer of the non-integer value and adding 1 to obtain a value which is the number of the Resource Blocks (RBs) of the required shared resource corresponding to the MCS.
16. The apparatus of claim 14, wherein the apparatus further comprises:
and the selection module is used for modulating and coding the user by adopting a low-order Modulation and Coding Scheme (MCS) when the number of Resource Blocks (RB) of the required shared resource corresponding to the plurality of MCS is the same.
17. The apparatus of claim 14, wherein the apparatus further comprises:
the classifying module is used for adopting a low-order modulation coding scheme MCS to users with poor channel conditions; classifying the users with poor channel conditions into a reference Modulation Coding Scheme (MCS) according to the low-order MCS, and allocating resources to the users with poor channel conditions according to the number of the shared Resource Blocks (RB) corresponding to the reference MCS;
the grouping module is used for obtaining a Modulation Coding Scheme (MCS) of a user according to the channel condition of the user; grouping the users according to the modulation coding mode of the users and a reference modulation coding Mode (MCS); and according to the respective bitmap of different groups, indicating the number of the required RBs corresponding to the users in the grouped group and the MCS mode by using the corresponding bits of the respective bitmap, and realizing the resource assignment of the users.
18. The apparatus of claim 14, wherein when the same shared resource is not persistently assigned to traffic data, the apparatus further comprises:
and the indicating module is used for indicating the initial position of one shared resource on the time frequency resource, and dynamically scheduling the hybrid automatic repeat request (HARQ) retransmission packet for the user in the current time interval interlace if the data packet transmission error of the user occurs in the previous time interval interlace.
19. The apparatus of claim 14, wherein when the same shared resource is persistently assigned to traffic data, the apparatus further comprises:
a first processing module, configured to assign, when the same shared resources that are continuously assigned are sufficient, shared resources with the same location to a user in a current time interval interlace if a packet transmission error of the user occurs in the previous time interval interlace;
a second processing module, configured to, when the same shared resources that are assigned continuously are not sufficient, if a data packet transmission error of a user occurs in an interlace of a previous time interval, determine whether the data packet in which the error occurs is a data packet that is scheduled to a shared resource in the previous time interval, and if so, assign the shared resources with the same position to the user in a current time interval interlace; otherwise, dynamically scheduling hybrid automatic repeat HARQ retransmission packets for the user in the current time interval interlace.
20. The apparatus of claim 19, wherein the first processing module specifically comprises:
the first processing unit is used for acquiring a data packet transmission error of a user in an interlace of a previous time interval through a bitmap indication of a first broadcast;
the second processing unit is used for assigning shared resources with the same position for the users with data packet transmission errors in the current time interval interlace, which are acquired by the first processing unit, according to the bitmap indication of a second broadcast and the same position of the data packet with transmission errors in the previous time interval interlace;
and the third processing unit is used for dynamically scheduling the residual shared resources in the current time interval interlace to other users for use after the second processing unit assigns the shared resources with the same positions to the users in the current time interval interlace.
21. The apparatus of claim 19, wherein the second processing module specifically comprises:
a judging unit, configured to obtain, according to a bitmap indication of a first broadcast, whether a data packet transmission error of a user occurs in an interlace of a previous time interval, and whether the data packet in which the error occurs is a data packet scheduled to a shared resource in the previous time interval;
a fourth processing unit, configured to assign, when the result determined by the determining unit is that a data packet transmission error of a user occurs in an interlace of a previous time interval and the data packet with the error is a data packet scheduled to a shared resource in the previous time interval, a shared resource with the same location to the user in the interlace of the current time interval;
a fifth processing unit, configured to dynamically schedule a HARQ retransmission packet for a hybrid automatic repeat request HARQ for a user in a current time interval interlace when a result determined by the determining unit is that a data packet transmission error of the user occurs in the previous time interval interlace and the erroneous data packet is not a data packet scheduled to a shared resource in the previous time interval.
22. The apparatus of claim 21, wherein the fourth processing unit is further configured to dynamically schedule data of the other users when the remaining shared resources in the current time interval are less than the remaining users in the current time interval after assigning shared resources with the same location in the current time interval, or the remaining users occupy the remaining shared resources in the current time interval and dynamically schedule the remaining data after the remaining users occupy the remaining shared resources.
23. The apparatus of claim 19, wherein when the same shared resources of the persistent assignment are insufficient, the second processing module further comprises:
and the rotation unit is used for rotating the position sequence of the user in the bitmap according to the specific negotiation period.
24. The apparatus as claimed in claim 23, wherein said rotation unit comprises:
the dividing subunit is used for dividing the period generated by each data packet into time intervals interlaces at equal intervals, and each time interval interlace in the same period has respective users;
and the rotation subunit is used for performing independent position rotation on the users in each time interval interlace in each period divided by the dividing subunit according to the period generated by each data packet.
25. The apparatus of claim 14, wherein the apparatus further comprises:
and the type grouping module is used for grouping the services according to the service types so that users of the same service type are positioned in the same group.
CN200810223243A 2008-09-28 2008-09-28 Method and device for assigning service grouping resources Expired - Fee Related CN101686495B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200810223243A CN101686495B (en) 2008-09-28 2008-09-28 Method and device for assigning service grouping resources

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200810223243A CN101686495B (en) 2008-09-28 2008-09-28 Method and device for assigning service grouping resources

Publications (2)

Publication Number Publication Date
CN101686495A CN101686495A (en) 2010-03-31
CN101686495B true CN101686495B (en) 2012-10-03

Family

ID=42049393

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200810223243A Expired - Fee Related CN101686495B (en) 2008-09-28 2008-09-28 Method and device for assigning service grouping resources

Country Status (1)

Country Link
CN (1) CN101686495B (en)

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102340875B (en) * 2010-07-23 2014-03-26 华为技术有限公司 Method and device for allocating resources
CN102404860B (en) * 2010-09-14 2014-07-16 中兴通讯股份有限公司 Downlink resource allocation method and device in long term evolution (LTE) system
CN102573076B (en) * 2011-12-23 2018-03-23 中兴通讯股份有限公司 Ascending wireless resource distribution method and device in LTE system
WO2014094310A1 (en) * 2012-12-21 2014-06-26 华为技术有限公司 Resource scheduling method and device
CN106465356B (en) * 2014-06-16 2019-11-22 华为技术有限公司 The method and apparatus for distributing running time-frequency resource
CN104363659B (en) 2014-10-24 2018-09-21 上海华为技术有限公司 A kind of resource allocation device, system and method
US10218483B2 (en) * 2015-09-25 2019-02-26 Qualcomm Incorporated Systems and methods for signaling and generating variable length block acknowledgment fields in a wireless network
CN107734661B (en) * 2016-08-11 2021-05-04 中国移动通信有限公司研究院 Method for scheduling terminal resources, method and equipment for determining resource scheduling granularity
CN107733553B (en) * 2016-08-12 2022-01-28 中兴通讯股份有限公司 Transmission method and device and reception method and device for transmission block
CN107769825B (en) * 2016-08-16 2020-04-24 上海朗帛通信技术有限公司 Method and device in wireless transmission
CN107800507B (en) * 2016-08-31 2020-11-13 成都鼎桥通信技术有限公司 MCS selection method and equipment for voice service scheduling in cluster system
JP7130030B2 (en) * 2017-08-10 2022-09-02 中興通訊股▲ふん▼有限公司 Common control block communication
CN109391437B (en) * 2017-08-11 2021-02-12 华为技术有限公司 Communication method and apparatus
CN111614390B (en) * 2019-05-31 2022-07-08 维沃移动通信有限公司 Transmission method, terminal and network equipment for CSI report

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1996947A (en) * 2005-11-10 2007-07-11 捷讯研究有限公司 Apparatus and method for signaling communication resource allocation on a block basis
WO2008021820A1 (en) * 2006-08-11 2008-02-21 Motorola Inc. Apparatus and method for automatic repeat request with reduced resource allocation overhead in a wireless voip communication system
WO2008033860A2 (en) * 2006-09-11 2008-03-20 Qualcomm Incorporated Bitmaps for group resource management

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1996947A (en) * 2005-11-10 2007-07-11 捷讯研究有限公司 Apparatus and method for signaling communication resource allocation on a block basis
WO2008021820A1 (en) * 2006-08-11 2008-02-21 Motorola Inc. Apparatus and method for automatic repeat request with reduced resource allocation overhead in a wireless voip communication system
WO2008033860A2 (en) * 2006-09-11 2008-03-20 Qualcomm Incorporated Bitmaps for group resource management

Also Published As

Publication number Publication date
CN101686495A (en) 2010-03-31

Similar Documents

Publication Publication Date Title
CN101686495B (en) Method and device for assigning service grouping resources
EP1856943B1 (en) Use of supplemental assignments
US20220377813A1 (en) Transmission method and apparatus
US8611284B2 (en) Use of supplemental assignments to decrement resources
US11395291B2 (en) Allocating transmission resources in communication networks that provide low latency services
WO2018076565A1 (en) Resource allocation method and resource allocation device
WO2017045496A1 (en) Downlink control method and apparatus
WO2010133043A1 (en) Method for dispatching multi sub-frames and the system, the terminal and the base station thereof
KR20100048496A (en) Device and method for controlling downlink control information in wireless communication system
EP3823191B1 (en) System and method for processing semi-persistently scheduled or dynamically scheduled channels
CN114144990A (en) Telecommunications apparatus and method
WO2021023081A1 (en) Sidelink feedback resource allocation
CN104012121A (en) System and method for data channel transmission and reception
CN102111892B (en) Method for reporting scheduling information (SI) of User Equipment (UE)
CN113196852A (en) Sidelink retransmission oversubscription
KR20100002789A (en) Method for indicating and detecting resource allocation in wireless mobile communication system and system therefor
AU2003262673B2 (en) Methods and apparatus of transmitting user data using traffic channels
CN107295681A (en) Processing method, the method and device of centralized dispatching of the instruction message of scheduling of resource
CN112005518A (en) Control and data transmission
US20090137253A1 (en) Avoiding collisions between users if map containing persistent scheduling information is lost
WO2022056879A1 (en) Communication method and apparatus
CN111865519B (en) V2X communication method and device
CN117793674A (en) Communication method and device
WO2011106927A1 (en) Base station in wireless communication system based on ofdma and resource allocation method for use thereof
CN117643138A (en) Downlink transmission method, device, equipment and storage medium

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

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