WO2007124675A1 - Procédé et appareil pour partager des ressources radio dans un système de communications sans fil - Google Patents

Procédé et appareil pour partager des ressources radio dans un système de communications sans fil Download PDF

Info

Publication number
WO2007124675A1
WO2007124675A1 PCT/CN2007/001299 CN2007001299W WO2007124675A1 WO 2007124675 A1 WO2007124675 A1 WO 2007124675A1 CN 2007001299 W CN2007001299 W CN 2007001299W WO 2007124675 A1 WO2007124675 A1 WO 2007124675A1
Authority
WO
WIPO (PCT)
Prior art keywords
packet
user
sub
users
group
Prior art date
Application number
PCT/CN2007/001299
Other languages
English (en)
Inventor
Yunsong Yang
Authony Soong
Jianmin Lu
Quanzhong Gao
Zhigang Rong
Tao Wu
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 CN2007800072347A priority Critical patent/CN101395831B/zh
Publication of WO2007124675A1 publication Critical patent/WO2007124675A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1887—Scheduling and prioritising arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end
    • H04L1/1835—Buffer management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information

Definitions

  • the present invention relates generally to a wireless communication system and, more particularly, to a novel method for sharing radio resources in the wireless communication system.
  • wireless traffic channel resources e.g., bandwidth, time intervals
  • Efficient allocation of traffic channel resources among various wireless users is critical to ensuring high performance for all such users, as it directly impacts overall utilization of traffic channel resources and quality of service perceived by each wireless user.
  • OFDM Orthogonal Frequency Division Multiplexing
  • TDMA Time Division Multiplex Access
  • CDMA Code Division Multiplex Access
  • OFDM frequency division multiplexing
  • OFDM Orthogonal Frequency Division Multiple Access
  • each user can be assigned a predetermined number of tones when they have information to send, or alternatively, a user can be assigned a variable number of tones to communicate information. Assignments of tones are generally dictated by the media access control layer, or MAC layer, which is ordinarily responsible for assignment of resources depending on user demand.
  • Resource allocation from particular base stations may be valid for transmission of a single packet, or for multiple packets.
  • the preferential resource allocation is commonly referred to as a sticky assignment or persistent assignment.
  • allocations terminating after transmission of a single packet are generally referred to as non-sticky or non-persistent assignments. Sticky assignments reduce overhead in allocating resources among various users, resulting in improved performance when particular users need a dedicated allocation of bandwidth.
  • sticky assignments reduce overhead, and increase effective throughput of a system, utilization of system resources in such a manner are not ideal in every circumstance. Frequently, sticky assignments may be set up for to ensure a minimum quality of service for a particular user. Sticky assignments may be used when implementing Voice over Internet Protocol (VoIP) applications. In such cases, a sticky assignment reduces the latency of communications when resources are spread among a large number of users. However, users frequently use less than the full extent of resources allocated to them. For example, in VoIP communications, silence may be transmitted using a far lower data rate than ordinary voice. In these situations, it would be advantageous to maximize utilization of resources allocated by sticky assignment without introducing excessive overhead or substantial complexity.
  • VoIP Voice over Internet Protocol
  • H-ARQ Hybrid Automatic-Repeat-reQuest
  • receivers add data packets (that cannot be decoded) into a detection buffer (located at the receiver) whenever received data packets fail a cyclic redundancy check (CRC).
  • CRC cyclic redundancy check
  • unacknowledged packets are retransmitted, and data stored in detection buffers is used to construct a retransmitted packet.
  • data from detection buffers is combined with received data, more accurate representations of packets can be assured. In such cases, a subsequent cyclic redundancy check performed on the packet, if passed, verifies accurate construction of the data.
  • detection buffers In systems that utilize H-ARQ, it is critical that detection buffers be flushed on a regular basis to maintain good performance. Specifically, corruption of the detection buffer can occur if information intended for one user is mixed with information intended for another user. In systems where each packet is intended for a single user, several implementations allow for flushing of detection buffers when new H-ARQ sequences begins for particular users. It would be advantageous to optimize methods of indicating new H-ARQ sequences in systems utilizing sub-packets where more than one user may try to decode the single packets while only one user is the intended user. In such systems, it would be desirable to indicate new H-ARQ sequences to multiple users so each user can determine if detection buffers should be flushed.
  • OFDMA is a system in which a plurality of users performs multiple accesses using
  • OFDM OFDM.
  • frequency division and time division are carried out when multiple access is performed. Also, it has been considered that diversity is carried out in a frequency direction and a time direction to make it possible to improve an error correction capability.
  • OFDM represents a different system design approach. It can be thought of as a combination of modulation and multiple access schemes that segment a communications channel in such a way that many users can share it. Whereas TDMA segments according to time and CDMA segments according to spreading codes, OFDM segments according to frequency. OFDM is a technique that divides the spectrum into a number of equally spaced tones, and carries a portion of a user's information on each tone. A tone can be thought of as a frequency subcarrier. OFDM can be viewed as a form of frequency division multiplexing (FDM). However, OFDM has an important special property that each tone is orthogonal with every other tone. FDM typically requires frequency guard bands between the frequencies so that they do not interfere with each other. OFDM allows the spectrum of each tone to overlap, and since they are orthogonal, they do not interfere with each other. By allowing the tones to overlap, the overall amount of spectrum required is reduced.
  • FDM frequency division multiplexing
  • OFDM can also be considered a multiple access technique since an individual tone or groups of tones can be assigned to different users. Multiple users share a given bandwidth in this manner, yielding a system called orthogonal frequency division multiple access, or OFDMA.
  • OFDMA orthogonal frequency division multiple access
  • Each user can be assigned a predetermined number of tones when they have information to send, or alternatively, a user can be assigned a variable number of tones based on the amount of information they have to send.
  • the assignments are controlled by the media access control (MAC) layer, which schedules the resource assignments based on user demand.
  • MAC media access control
  • a group resource allocation scheme was proposed where a plurality of mobile station are placed into a scheduling group. Each scheduling group share a common set of time frequency resources. The allocation of the time frequency resources to each member mobile station in the scheduling group was controlled efficiently using bitmap signaling.
  • bitmap control one, two bitmaps are used to control the time frequency resource allocated to each user.
  • the first bitmap called bitmap 1
  • bitmap 1 will be used to indicate which mobile station is being served in each frame.
  • Each bit location of bitmap 1 will correspond to a mobile station in the scheduling group.
  • a mobile station is active, i.e. being sent data, if its corresponding bit is set to 1.
  • a mobile station is inactive, i.e. not being sent data, if its corresponding bit is set to 0.
  • the second bitmap termed bitmap 2 is used to indicate the time frequency resources being allocated to each active mobile station.
  • the first bit of bitmap 2 will correspond to the first active user in bitmap 1 (call active user 1), the second bit of bitmap 2 will correspond to the second active user (call active user 2), the third bit of bitmap 2 will correspond to the third active user (call active user 3) and so on.
  • the time frequency resources will be allocated consecutively from the active user 1 to the last active user.
  • a one in bitmap 2 will indicate that M time frequency resources will be assigned while a zero will indicate N time frequency resources will be assigned.
  • bitmap control 2 the first bitmap, called bitmap 1, will be used to indicate which mobile station in the scheduling group will have a new packet transmission in this time interval.
  • Each bit in bitmap 1 is associated with a mobile station in the scheduling group. A one in the bitmap 1 indicate that this mobile station has a new packet transmission while a zero indicate that this mobile station does not have a new packet transmission.
  • the mobile station associated with the first one in bitmap 1 is called the new packet mobile one
  • the second one in bitmap 1 is called the new packet mobile two and so on.
  • the second bitmap, call bitmap 2 is has a one to one mapping to the time frequency resources shared by the scheduling group. A one in bitmap 2 indicates that this time frequency resource is currently being use while a zero indicate that the time frequency resource is not being used.
  • the new packet mobile one will look at bitmap 2 and will know that the first unused time frequency resource will be assigned to it; the new packet mobile two will look at bitmap 2 and will know that the second unused time frequency resource will be assigned to it; and
  • the size of the time frequency resources are not always completely used by the users in the scheduling group. Consequently, a second group of users, which will be called the sharing group, are also associated with the scheduling group to use the left over resources not used by the scheduling group.
  • the time frequency resource of multiple groups can overlap either partially or completely.
  • This will be called scheduling resource group sharing.
  • two scheduling group, scheduling group A and scheduling group B have a region of their time frequency resource that are common to both group. That is part of the time frequency resource of scheduling group A may be the same as part of the time frequency resource of scheduling group B.
  • the time frequency resources for each group are assigned using a different ordering pattern. That is, for example, scheduling group A will assign the resources in ascending order and scheduling group B will assign the resources in descending order.
  • the current mechanism for signaling to the sharing group the resources that can be shared is by explicitly signaling the resource in a control channel. This method is extremely costly in terms of overhead.
  • the present invention will detail a way of signaling the unused resources in the case of scheduling resource group sharing to the sharing group through the existing bitmap signaling with minimal or no increase in the signaling overhead.
  • the radio resources that are used to carry the voice or data traffic are shared by a plurality of mobile stations, also known as users, in a particular cell using a certain type of multiplexing principle.
  • This multiplexing principle can be Frequency Division Multiplex Access (FDMA) wherein the resource is referred as frequency blocks over a certain time interval, Time Division Multiplex Access (TDMA) wherein the resource is referred as time intervals, Code Division Multiplex Access (CDMA) wherein the resource is referred as orthogonal or pseudo-orthogonal codes over a certain time interval, Orthogonal Frequency Division Multiplex Access (OFDMA) wherein the resource is referred as orthogonal frequency sub-carriers over a certain time interval, or a combination thereof.
  • FDMA Frequency Division Multiplex Access
  • TDMA Time Division Multiplex Access
  • CDMA Code Division Multiplex Access
  • OFDMA Orthogonal Frequency Division Multiplex Access
  • a resource can be allocated by the base station to a particular mobile station for the transmission of one packet or for a limited time interval. This type of resource assignment is referred as non-persistent or non-stick assignment.
  • a resource can also be allocated by the base station to a particular mobile station for the transmission of more than one packet until an action of de-assigning the resource is triggered. The action of de-assigning the resource can be triggered by but not limited to an explicit de-assignment message, the expiration of a pre-set timer, or loss of a packet.
  • This type of resource assignment is referred as persistent or sticky assignment. Those skilled in the art, would also know that significant savings in the overhead is possible with the sticky assignment.
  • the sticky user may be a voice over internet protocol (VoIP) user and the VoIP packet early terminates or the 1/8 rate voice frames are blanked off.
  • VoIP voice over internet protocol
  • the resource that is assigned to this user with the sticky assignment is left unused as the user waits for the arrival of the next VoIP packet.
  • the shared stick assignment is a technique to enable the time-sharing of radio resources that have been assigned to at least one user with stick assignment and at least another user with sticky or non-sticky assignment.
  • each user is assigned a unique identity referred as MAC Index or MACID, which is associated with a scrambling code that is unique to the user.
  • MAC Index More than one user can share a particular resource in time. However, at most one user is served by the base station on that resource at any given time.
  • the transmitter at the base station scrambles the encoded data sub-packet with the scrambling code of the user for which this sub-packet is intended for.
  • the receiver of a user unscrambles the received data sub-packet with the scrambling code that is assigned to the user.
  • the unscrambling process reverses the scrambling process performed at the transmitter and the receiver of this user may be able to decode the sub-packet correctly.
  • the unscrambling process does not reverse the scrambling process and the receiver of this user is not able to decode the data packet correctly.
  • H-ARQ hybrid automatic repeat request
  • more than one transmission of the data packet, in the form of sub-packet may be needed before sufficient energy and coded symbols are accumulated for the packet to be decoded correctly. Consequently, the receiver will add the received symbols of the sub-packet to the detection buffer even if the packet is not decoded correctly so that these received symbols can be soft-combined with the received symbols obtained from the transmission of the next sub-packet.
  • a corruption of the detection buffer that is, a severe impairment to the detection performance, can happen if symbols intended for a user is mixed with symbols that is intended for another user. To avoid this corruption, the beginning of a new H-ARQ sequence is signaled. If the receiver receives notification that a new H-ARQ sequence has started, the receiver flushes the detection buffer at the receiver. The beginning of a new H-ARQ sequence can be indicated by a signal, referred as ARQ Instance Sequence
  • AI_SN which toggles between two states when the transmission for a new
  • H-ARQ sequence starts and remains at the previous state when the transmission is for the subsequent sub-packet of a previously failed sub-packet.
  • This AI_SN indicator can be within the header section of the sub-packet or it can be on a separate signaling channel.
  • FIG. 1 One drawback of the above scheme is that, as illustrated in FIG. 1 as an example, when a VoIP user 130 who is assigned with stick assignment shares the same resource 110 with a best effort (BE) data user 140 who is assigned with stick or non-stick assignment, and currently the BE user 140 occupies the resource 110 with its pending H-ARQ re-transmission, the VoIP user 130 has to wait until the pending H-ARQ re-transmission of the BE user 140 is successfully completed or the maximum re-transmission number has been reached for this BE user 140 before the VoIP user 130 can re-gain the channel resource 110, which can cause excessive delay for the delay-sensitive applications such as VoIP and degrade the quality of service (QoS).
  • BE best effort
  • IxEV-DO Ix EVolution Data Optimized
  • Voice traffic is discontinuous in nature and composes of large inactive periods. It is desired to group a certain number of voice users together and assign them a set of shared time-frequency resource.
  • the statistical multiplexing gain is achieved among the group members.
  • the base station When the base station has determined a DTX state for a particular user in a particular time period, it can assign the said user's time-frequency resources to another user.
  • the statistical multiplexing gain is also achieved through the early terminated HARQ transmissions.
  • a unique identifier, GroupID is assigned when a group is established.
  • AN When AN assigns an AT to the group, it associates the AT's unique identifier, MACIndex, to this GroupID through a Group Setup Message in Table 1.
  • the said message is managed through upper layer signaling carried on Forward Link Data Channel (F-DCH).
  • F-DCH Forward Link Data Channel
  • Table 1 Group Setup Message for Voice Users
  • the fundamental block size (e.g. 1 DRCH by 1 Frame)
  • Ordering_Pattern One of a few choices indicating the order in which the blocks are to be distributed
  • the Group Setup Message also defines the exact locations of the resource blocks and an ordering pattern indicative of the order in which the resources are allocated.
  • the set of shared resources is a group of VoIP frames comprising a VoIP interlace pattern.
  • the shared resource is typically a set of DRCHs (Distributed Resource Channel), although a set of BRCHs (Block Resource Channel) could be used also.
  • DRCHs Distributed Resource Channel
  • BRCHs Block Resource Channel
  • Each AT is assigned a unique ordering index within the group, and a fixed interlace offset within a superframe for its first subpacket transmission. This is to align the time between successive first transmissions to the vocoder frame duration (20msec).
  • bitmap signaling is used to assign resource to individual users in each VoIP frame (Fig. 2).
  • the bitmap signaling is used by the base station to assign resources and by the users to determine their exact resources within the set of shared time-frequency resources. It is used for first subpacket and subsequent retransmissions.
  • a first bitmap (bitmap 1) has a length of number of users in the group. This first bitmap is used to indicate which ATs are being served in each VoIP frame, where each AT corresponds to a fixed location in the bitmap based on its ordering index. A "1" indicates an active user and a "0" indicates a non-active user in the corresponding VoIP frame.
  • a second bitmap may be used to indicate the number of assigned blocks and/or the packet format.
  • Each AT determines its allocation based on the allocations for all ATs with a smaller bitmap position in the first bitmap.
  • the first bitmap is used to indicate active ATs.
  • the bitmap locations correspond to the AT positions. For example, the AT assigned the 0 th group position determines its assignment based on the 0 n position in the first bitmap.
  • Each AT with a ' 1 ' in the first bitmap is active.
  • the AT with the first ' 1' is assigned the first M blocks
  • the AT with the second '1' is assigned the second N blocks, etc, where M and N are the same if there is only the first bitmap, and M and N may be different if there are two bitmaps.
  • the user with the first '1' in the first bitmap corresponds to the first position in the second bitmap
  • the user with the second ' 1 ' in the first bitmap corresponds to the second position in the second bitmap, etc.
  • the ATs are assigned an ACK position based on their position assignment in the first bitmap. For example, the first N/2 ATs in the first bitmap will be assigned to transmit their ACK in the first ACK position, while the second N/2 ATs in the first bitmap will be assigned to transmit their ACK in the second ACK position.
  • an even/odd structure could be used, whereby ATs with an odd position assignment in the first bitmap will be assigned to transmit their ACK in the first ACK position, while ATs with an even position assignment in the first bitmap will be assigned to transmit their ACK in the second ACK position.
  • the beginning of a new H-ARQ sequence is indicated by an ARQ Instance Sequence Number (AI_SN) that toggles between two indicators when the transmission for a new H-ARQ sequence starts and the signal remains the same when the transmission is for the subsequent sub-packet of a previously failed sub-packet.
  • AI_SN ARQ Instance Sequence Number
  • a transmitter transmits the same indicator with each sub-packet of the same H-ARQ sequence. With the beginning of a new H-ARQ sequence, the transmitter switches the indicator to the other indicator.
  • the receiver can still detect the new H-ARQ indicator because the indicator in the subsequent sub-packet transmission is different from the indicator used in the previous packet transmission. Therefore, the said new H-ARQ indicator is efficiently robust to detection error.
  • the assigned size of the set of time-frequency resources and the required VoIP latency and capacity requirement need to be traded off carefully.
  • the present invention addresses one or more of the issues discussed above by providing methods and systems that can be advantageously utilized to allow multiple users to share resources.
  • the present invention finds utility in a wide variety of applications.
  • the preferential treatment can be but not limited to higher priority to access the shared resources and more choices of shared resources to choose from when a new packet (i.e. a new H-ARQ sequence) starts for a delay-sensitive user than when a new packet starts for a delay-insensitive user.
  • the present invention provides a system, comprising various methods and apparatus, for a plurality of users to share radio resources otherwise assigned to particular users as sticky assignments.
  • Packet structure is provided for sharing radio resources (e.g., tones or frequency subcarriers) between a plurality of users - particularly tones or frequency subcarriers that have been sticky assigned to a particular user.
  • radio resources e.g., tones or frequency subcarriers
  • a single packet may be split into a plurality of sub-packets.
  • Methods are also provided for signaling to a plurality of users to share radio resources that have already been assigned, by a sticky assignment, to a particular user.
  • methods of utilizing H-ARQ error control to facilitate improved communication between the base stations and multiple users are disclosed, especially communication methods for utilizing sub-packets.
  • a novel method for allowing multiple users to share the same resources meanwhile reducing the delay for users with delay-sensitive applications comprising: forming one or more than one shared sticky assignment (SSA) group in a sector; allocating more than one shared sticky resources in at least one SSA group; dividing the users into at least the first class of users and the second class of users; giving the first class of users a higher priority to access the shared resources than the second class of users when the shared resources become available for a new packet (i.e. a new H-ARQ sequence); and giving the first class of users more choices of shared resources to choose from than the second class of users when starting the transmission of a new packet.
  • SSA shared sticky assignment
  • a method for minimizing the signaling overhead of setting up the SSA group, adding or removing a user to or from the SSA group, indicating the H-ARQ status on the shared resources, and indicating the identity of the intended user for the current transmission is disclosed.
  • a novel method for grouping the voice and data users and having them efficiently share the time-frequency resource comprising: sending Group Setup Message (different to the one to voice users) to each data user assigned to the group with the user and group specified information, and the said users will start monitoring the bitmaps upon receiving this Group Setup Message; using bitmap signaling (with variants using AI_SN and user index) to inform voice and data users whether they are activated or not, which resource blocks they are assigned, and/or which modulation and coding scheme indices are assigned; controlling the admission of data users over data users based on their QoS requirements; assigning a data user in multiple groups to alleviate the resource constraint for possible retransmissions; broadcasting information (e.g., group management information) to all users within the group using left over resources or other resources signaled by bitmap, F_SCCH, or GroupID based blind detection.
  • group Setup Message different to the one to voice users
  • bitmap signaling with variants using AI_SN and user index
  • the transmissions to multiple (N) voice users are multiplexed with the transmissions to multiple (M) data users to share the same time-frequency resource by using an extended bitmap signaling. While the voice users have higher priority to be served, the remaining resource, if any, may be divided to K data pipes which allows up to K data users transmitting at the same time.
  • data bitmap is added to indicate the packet data transmission.
  • a scheduler at AN decides which data user is being served and which modulation and coding scheme (MCS) is being used based on the channel quality, the QoS requirement and the buffer status, etc.
  • MCS modulation and coding scheme
  • a data bitmap typically includes a data bitmap header and the corresponding MCS and resource size fields.
  • Each active data user will look at the bitmap for the users in front of it (including both voice and data), calculate the occupied blocks, and locate the exact blocks being assigned to the said data user.
  • the encoded packet size depends on the size of left-over resource and the MCS scheme used. Padding may also be needed if the number of information bits is less than the encoded packet size.
  • the scheduler is designed to balance the power and MCS of the data user. The mapping from the MCS bits to actual packet format can be adjusted by upper layer signaling.
  • multiple (N) voice users are grouped with multiple (M) data users to share the same time-frequency resource by using an AI_SN bit for each data pipe in Data Bitmap Header.
  • a new packet indicator, AI_SN as described in [0016] is used to indicate the start of a new packet for the data pipe, by means of setting as '1' or '0' or by toggling.
  • multiple (N) voice users are grouped with multiple (M) data users to share the same time-frequency resource by explicitly indicate user index for each data pipe in Data
  • Bitmap Header One of the MCS values, e.g. '000', is reserved to indicate the retransmission of a packet while all other values indicate new packet transmission.
  • multiple (N) voice users are grouped with multiple (M) data users to share the same time-frequency resource by using bitmap mapping in the Data Bitmap Header.
  • Data Bitmap Header has a length of M, and each bit indicates the corresponding data user is active or not. Similarly, one of the MCS values, e.g. '000', needs to be reserved to indicate the retransmission of a packet while all other values indicate new packet transmission.
  • one novel method for grouping the voice and data users and minimizing the impact of packet data transmission to VoIP performance comprising: assigning a data user to multiple groups so that the said data user shares an even larger resource pool and has less chance to conflict with VoIP traffics especially at retransmissions.
  • FIG. 1 illustrates an example of the existing techniques of sharing the resource among multiple users
  • FIG. 2 illustrates an example of conventional method of grouping voice users using bitmap signaling, where bitmap 1 indicates the VoIP users being served, and optional bitmap2 indicates the size of assigned resource and/or packet format.
  • bitmap 1 indicates the VoIP users being served
  • bitmap2 indicates the size of assigned resource and/or packet format.
  • An example of group resource assignment is shown in this figure.
  • 24 ATs in a group are assigned to a set of shared resources in one VoIP frame consisting of 8 DRCH resources (each DRCH is 16 tones distributed in the frequency domain x 8 symbols) in each of the two adjacent frames;
  • FIG. 3 is a flow diagram depicting a method of enabling radio resource sharing in an OFDMA system according to certain embodiments of the present invention
  • FIG. 4 depicts an example of a resource assignment for a plurality of users
  • FIG. 5 depicts an illustrative transmitted sequence in a header segment according to the present invention
  • FIG. 6 depicts another illustrative transmitted sequence in a header segment according to the present invention.
  • FIG. 7 illustrates an example of the preferred embodiment of the resource sharing method according to the present invention.
  • FIG. 8 illustrates an example of an alternative embodiment of the resource sharing method according to the present invention.
  • FIG. 9 illustrates an exemplary control chamiel structure that carries the shared sticky assignment message or the AI_SN indicators according to the present invention
  • FIG. 1OA illustrates an example of using an extended bitmap signaling for grouping
  • the Data bitmap contains the Data
  • Bitmap Header indicates the active data users
  • MCS field indicates the corresponding MCS index; and the Size tells the number of blocks assigned to the said user. For the last data pipe, only MCS field is needed;
  • FIG. 1OB illustrates the Mode 1 of Data Bitmap Header, which uses one bit AI_SN for each data pipe to indicate new subpacket arrival.
  • the length of Data Bitmap Header is K bits, with the assumption of K data pipes;
  • FIG. 1OC illustrates the Mode 2 of Data Bitmap Header, which uses user Index to explicitly indicate the active data user in each data pipe. Assuming L bits in Index (supporting up to 2 ⁇ L data users), the length of Data Bitmap Header becomes L*K bits; FIG. 1OD illustrates the Mode 3 of Data Bitmap Header, which uses one bit for each data user to indicate whether the corresponding user is assigned a data pipe (T) to transmit or not (O'). The length of Data Bitmap Header is M, given that there are M data users in the group;
  • FIG. 11 illustrates an example of bitmap signaling for bitmap control 1 to indicate the resources for the sharing group
  • Fig. 12 provides an illustrative example of the signaling to indicate the resources for the sharing group in bitmap control 1 where the resources for the scheduling groups are partially overlapped;
  • Fig. 13 provides an illustrative example of the signaling to indicate the resources for the sharing group in bitmap control 2.
  • FIG. 3 a flow diagram depicts one embodiment of enabling radio resource sharing in an OFDMA system.
  • the process of receiving information in the system begins at step 101 for a receiver.
  • step 101 for a receiver.
  • the receiver waits for a new sub-packet to arrive. After receiving a sub-packet during step 103, the receiver determines if a new H-ARQ sequence indicator is received.
  • Hybrid Automatic-Repeat-reQuest (H-ARQ) sequence may be indicated according to the present invention in a number of different ways.
  • a packet structure enables a user to determine if a particular packet, or sub-packet, is intended for that particular user.
  • each user in the system is assigned a unique scrambling code. This unique scrambling code can be assigned in a variety of different ways, including methods that utilize the mobile station identifier, MAC address, and other unique identifiers for the particular user.
  • a subset of the packet, or sub-packet may be individually assigned, or allocated, to particular users, with each sub-packet preferably divided between a header section and a data section.
  • the sub-packets are not split into header and data sections.
  • the transmitter scrambles the data section, and optionally header section, of the sub-packet with the unique scrambling code assigned to the intended user.
  • Receiving users can only decode the packet if they have the particular unique scrambling code used to encode the sub-packet, thereby implicitly signaling to the users whether they are the intended users.
  • a packet header or sub-packet header that is unscrambled can be used to explicitly transmit information about the intended user of a packet in other embodiments of the invention.
  • the user When a particular scrambled packet is received by a user, the user applies its unique scrambling code to descramble the sub-packet based on the method of scrambling applied in the system. If the packet was scrambled with the unique scrambling code assigned to the particular user, then the descrambled packet is an accurate representation of the original packet, or sub-packet. If the user's scrambling code is different from the scrambling code used to encode the packet, i.e. an unintended user, the resulting descrambled packet will be useless for the unintended user.
  • One method of verifying the success of the descrambling process is by performing a cyclic redundancy checks using values transmitted within the packet itself, in the headers of the packets or sub-packets, or transmitted across an alternative signaling channel.
  • the cyclic redundancy check can provide verification on whether a particular packet is intended for the user by determining if the descrambled packet, or sub-packet, matches the original packet, or sub-packet.
  • a receiver adds received information to a detection buffer, located at the receiver, whenever the cyclic redundancy check (CRC) on the sub-packet or packet fails.
  • CRC cyclic redundancy check
  • corruption of the detection buffer can occur if the data packet intended for one user is mixed with another data packet for the same user or the data packet intended for another user.
  • embodiments of the present invention provide a transmission protocol in a particular H-ARQ interlace, designed such that an H-ARQ sequence at the receiver is completed before a new sequence is commenced, as the beginning of the new H-ARQ sequence is signaled to the receiver.
  • Receivers upon receiving notification a new H-ARQ sequence has started, flush the detection buffer at the receiver, as information in the detection buffer will not be useful in reconstructing packets for that particular receiver.
  • the new H-ARQ sequence signal is explicitly sent in the header of a packet or sub-packet.
  • the signal indicating a new H-ARQ sequence is communicated on a separate signaling channel, such as a dedicated frequency sub-channel. Accordingly, a number of different signaling methods or structures may be utilized to indicate a new H-ARQ sequence.
  • certain embodiments minimize the impact of detection error of a new H-ARQ sequence indicator.
  • the beginning of a new H-ARQ sequence is indicated by a signal that toggles between two indicators when the new H-ARQ sequence starts, while the signal remains the unchanged for retransmission of sub-packets in previous H-ARQ sequence. Each sub-packet of the same H-ARQ sequence is thus transmitted with an identical indicator.
  • the indicator is toggled.
  • the receiver can detect the new H-ARQ indicator by determining if the indicator used in a subsequent sub-packet is different from the indicator used in a previous packet transmission.
  • step 105 the receiver determines if a new H-ARQ sequence has been indicated. If an indicator of a new H-ARQ sequence was received, the H-ARQ buffer is flushed at the receiver in step 107. Otherwise, the data sub-packet stored in the buffer is soft-combined with the data sub-packet currently received. Regardless of whether the buffer is flushed, at step 109 data is detected in the sub-packet. Detecting data in the sub-packet may include the step of descrambling the sub-packet, or a portion thereof.
  • step 111 is a cyclic redundancy check (CRC), comparing the CRC value transmitted within the packet itself, in a header of the sub-packet, or in an alternative signaling channel with a value computed from the data detected in the sub-packet. If the CRC fails, the process moves to step 115 adding the failed sub-packet to the detection buffer.
  • the detection buffer allows subsequent retransmitted sub-packets to be combined with failed sub-packets, enhancing the likelihood of constructing an accurate sub-packet.
  • a NACK is performed, which may take the form of an OFF, or non-transmission, to the transmitter.
  • the receiver performs an ACK in step 113, an acknowledgement to a transmitter that the packet was received correctly.
  • An ACK generally entails a signal transmitted from the receiver to the transmitter on a return channel.
  • the transmitter will continue to resend the unacknowledged sub-packet. This process repeats for a finite number of attempted transmissions, the number of attempts based on the particular application.
  • the process restarts, with the receiver again waiting for a new sub-packet at step 103.
  • the indicator used to transmit the new H-ARQ sequence may utilize the second row of a fourth order Walsh matrix, i.e. W* or "0101 ".
  • the other indicator may utilize the fourth row of the Walsh matrix, i.e. W 3 or "0110", used for the other indicator. Only two Walsh codes are used to indicate the new H-ARQ sequence; therefore, the remaining two Walsh codes may be used to multiplex other information, such as transmit ID in a CDM fashion.
  • FIG. 4 an example of a resource assignment is provided according to the present invention.
  • eight distributed sub-carriers (201, 202, 203, 204, 205, 206, 207, and 208) are assigned.
  • Four sub-carriers (202, 204, 206, and 208) are used to transmit the new H-ARQ indicator while the other four sub-carriers (201, 203, 205, and 207) are used to transmit data.
  • This particular example also shows that the header of the sub-packet consists solely of the new H-ARQ indicator.
  • the four bits of this encoded indicator (header) are distributed within the assigned resource, in order to take advantage of frequency diversity.
  • the modulation format of the new H-ARQ indicator is also independent of resource assignments, and may use Binary Phase Shift Keying (BPSK), for example. Other modulations and configurations may also be utilized, and are comprehended hereby.
  • BPSK Binary Phase Shift Keying
  • output power used to transmit the H-ARQ indicator may be significantly increased over that of the data part of the sub-packet.
  • the reliability of the new H-ARQ indicator may be ensured by transmitting at that higher power.
  • some embodiments of the present invention may utilize signaling of the sharing format.
  • the use of the format is implied by a preferential (or "sticky") assignment, therefore all transmissions in response to the sticky assignment use the sharing format described herein.
  • the sharing format may be signaled in the assignment message.
  • the users sharing the resources with the user having the sticky assignment are not necessarily assigned with sticky assignments themselves. Numerous other signaling methods may be utilized to indicate the sharing format used without diverging from the spirit of the present invention.
  • packet processing information - such as multiple encoder packet sizes, or modulation and coding scheme (MCS) for a data segment - may be indicated in associated with a particular resource assignment.
  • modulation for a resource assignment may be fixed, and may be explicitly indicated or signaled in the resource assignment.
  • the MCS may be dynamically changing and may be explicitly signal via a message in a separate channel.
  • the MCS may be implicitly signal with the receiver blindly detecting the MCS.
  • an encoder packet size may be different. Rate matching by either puncturing or repetition may be used to match the rate to resources assigned for different encoder packet sizes.
  • the number of different encoder packet sizes associated with a particular resource assignment is small, and a receiver can blind detect among them. For example, with a VoIP user where the vocoder can send full rate, Vi rate, 1 A rate and 1/8 rate frames, repetition is used with the lower rate frames in order to make all frames full rate. The receiver may blindly detect among the different rates.
  • the encoder packet size may be explicitly indicated or signaled to a receiver in the header section or as an explicit message in a separate channel.
  • the ACK and NACK utilize on-off keying, the NACK being represented by OFF (no transmission) and the ACK being represented by ON.
  • the processing at the receiver is the same for all users. Users will generally always respond with a NACK when the received data is not intended for them. Consequently a plurality of unintended users can respond with a NACK using the same allocated resources without collision as no transmission actually occurs. This permits intended users to utilize shared radio resources, signaling an ACK without collision. This particular method of signaling the ACK and NACK will save resources, but other methods of transmitting the ACK and NACK responses may be utilized with the present invention.
  • a sub-packet index may be explicitly transmitted in a sub-packet header segment.
  • the presence of a first sub-packet index in a header segment of the first sub-packet indicates a first sub-packet transmission. It also indicates to a receiver that a transmission of a new packet has begun. Meanwhile the presence of any other sub-packet index indicates a subsequent sub-packet for a retransmission of a previously failed packet.
  • 4-ary Walsh codes are used as the sequences to indicate the sub-packet indices.
  • the first Walsh code, W 0 4 is used to indicate a first sub-packet transmission.
  • the second Walsh code, W 1 4 indicates a second sub-packet transmission.
  • the third Walsh code, W 2 4 indicates a third sub-packet transmission, and so on.
  • a 4-ary Walsh code can be used to signal a first 8 sub-packet transmission, using both the Walsh code and its complement.
  • a complement of the fourth Walsh code, W 3 4 may be utilized as a continuation indicator.
  • indication of a new packet transmission comprises a toggle between two mutually exclusive subsets of the Walsh codes. As illustrated in the example in FIG. 6, first and second 4-ary Walsh codes, W 0 4 and W 1 4 , form a first subset, and third and fourth 4-ary Walsh codes, W 2 4 and W 3 4 , form a second subset.
  • a first sub-packet transmission is indicated by Walsh code W 1 4 or W 3 4 in a header segment.
  • W 1 4 may be used to indicate a first transmission of the i th packet.
  • W 0 4 may then be used to indicate all subsequent transmissions of the i th packet.
  • W 3 4 may be used to indicate transmission of the first sub-packet.
  • W 3 4 in a header segment of the first sub-packet also indicates that a new packet transmission has started.
  • Subsequent transmission of the (i+l) th packet may be indicated by W 2 4 .
  • W 0 4 may once again be used as an indicator, and so on.
  • one Walsh code in the first subset of Walsh codes may be used to indicate a new, even numbered packet transmission has started. Remaining Walsh codes in the first subset of Walsh codes may be used to indicate subsequent retransmissions of the even numbered packet transmission.
  • one Walsh code in the second subset of Walsh codes may be used to indicate a new, odd numbered packet transmission has started. The remaining Walsh codes in the second subset of Walsh codes may be used to indicate subsequent retransmissions of the odd numbered packet transmission.
  • an explicit sub-packet number may be carried in a header segment.
  • the present invention provides a unique method and system for allowing multiple users to share the same resources while reducing the delay for users with delay-sensitive applications in a wireless communications system. It is understood, however, that the following disclosure provides many different embodiments, or examples, for implementing different features of the invention. Specific examples of components, signals, messages, protocols, and arrangements are described below to simplify the present disclosure. These are, of course, merely examples and are not intended to limit the invention from that described in the claims. Well known elements are presented without detailed description in order not to obscure the present invention in unnecessary detail. For the most part, details unnecessary to obtain a complete understanding of the present invention have been omitted inasmuch as such details are within the skills of persons of ordinary skill in the relevant art. Details regarding control circuitry described herein are omitted, as such control circuits are within the skills of persons of ordinary skill in the relevant art.
  • FIG. 7 illustrates an exemplary resource sharing method according to one aspect of the present invention.
  • the SSA Group N consists of two shared sticky resources 210 and 220.
  • each of these shared resources forms an independent pipe to carry the traffic for different users.
  • the AI_SN indicators 230 and 240 indicate if a new packet has started in the shared sticky resource 210 and 220, respectively.
  • the AI_SN indicator 230 or 240 toggles between "0" and "1" if a new packet starts in the corresponding shared sticky resource. Otherwise, the AI_SN indicator 230 or 240 remains at the previous state.
  • a BE user 250 and two VoIP users 260 and 270 share the sticky resource 210, meanwhile the VoIP users 260 and 270 and another BE user 280 share the sticky resource 220.
  • the transmitter at the base station scrambles the encoded data sub-packet with the scrambling code of the user for which this sub-packet is intended for.
  • the receiver of a user unscrambles the received data sub-packet with the scrambling code that is assigned to the user. If the received sub-packet is for a particular user, the unscrambling process reverses the scrambling process performed at the transmitter and the receiver of this user may be able to decode the sub-packet correctly. On the other hand, if the received sub-packet is not for a particular user, the unscrambling process does not reverse the scrambling process and the receiver of this user is not able to decode the data packet correctly.
  • the base station transmits a packet to any users using the same shared resource or resources until the packet is successfully decoded or the maximal retransmission number is reached. Therefore, the transmissions to a user who is assigned with multiple shared resources can hop among these assigned shared resources only at the packet boundary, not between the retransmissions of sub-packets for the same packet.
  • the objective of putting this restriction is to reduce the number of decoding hypothesis and detection buffers when blind decoding is performed by the receiver. In the case where the complexity of the receiver is not a concern, such restriction can be removed.
  • the BE user 250 performs blind decoding on sticky resource 210 and monitors AI_SN indicator 230 so as to flush the detection buffer in its receiver when a new packet starts on sticky resource 210, as the arrows indicate.
  • the BE user 280 performs blind decoding on sticky resource 220 and monitors AI_SN indicator 240 so as to flush the detection buffer in its receiver when a new packet starts on sticky resource 220.
  • the VoIP users 260 and 270 each performs blind decoding on sticky resource 210 with the first detection buffer in each respective receiver and monitors AI_SN indicator 230 so as to flush the first detection buffer in each respective receiver when a new packet starts on sticky resource 210.
  • the VoIP users 260 and 270 also each performs blind decoding on sticky resource 220 with the second detection buffer in each respective receiver and monitors AI_SN indicator 240 so as to flush the second detection buffer in each respective receiver when a new packet starts on sticky resource 220.
  • the BE user 250 or 280 can flush its sole detection buffer when this user successfully decodes a packet, and the VoIP user 260 or 270 can flush both the first and second detection buffers in its receiver when this user successfully decodes a packet.
  • the VoIP users 260 and 270 can choose the one shared sticky resource with the earliest availability, among multiple assigned shared stick resources such as resource 210 and 220, to start the transmission of a new packet (i.e. a new H-ARQ sequence), while the BE user 250 and 280 each is given one choice of shared resources to start the transmission of a new packet.
  • a new H-ARQ sequence any class of users can be given more or at least no less choices of resources than any other class of users in the present invention, it is preferred that the users with delay-sensitive applications is given more or at least no less choices of shared resources to choose from than the users with delay-insensitive applications when starting the transmission of a new packet (i.e. new H-ARQ sequence).
  • each of the shared sticky resources within an SSA group can forms an independent pipe to carry the traffic for different users, or some or all of the shared sticky resources within a group can form a combined pipe to carry the traffic for at least one user dynamically based on the channel and traffic condition, the user type, the availability of each shared resources, and which shared resources are assigned to the scheduled user if not all the shared resources within the SSA group are assigned to this scheduled user.
  • the users whose traffic can be carried by the combined pipe can be limited to the non-VoIP users as the data rate for a VoIP application is relative constant.
  • those users whose traffic can be carried by the combined pipe needs to perform blind decoding considering the possibility that both the individually assigned shared pipe and the combined assigned shared pipe can carry the traffic for this user.
  • FIG. 8 illustrates an example of this alternative embodiment. Referring to FIG. 8, the BE user 350 is assigned with the shared sticky resources 310 and 320.
  • the receiver of the user 350 uses its first detection buffer to perform blind decoding on individual pipe of resource 310 and uses its second detection buffer to perform blind decoding on the combined pipe of resource 310 and 320. And the user 350 monitors AI_SN indicators 330 and 340. In the case where the complexity of the receiver is not a concern, such restriction can be removed.
  • the users 250, 260, 270, and 280 are assigned to their respective shared sticky resources with a sticky assignment.
  • users with delay-insensitive application can be assigned to any of the shared resources or combination of any of the shared resource within an SSA group on a temporary base, i.e. with a non-sticky assignment, as long as those shared resources are available.
  • Users that are assigned with non-sticky assignment to a shared resource don't need to perform blind decoding nor to monitor the AI_SN indicator. Therefore, from the receiver's viewpoint, the sharing operation is transparent to the non-sticky user.
  • the base station scheduler needs to consider the potential delay that might incur to the delay-sensitive users that are assigned on the shared sticky resource while scheduling the transmission to a non-sticky user using those shared sticky resource. In a lightly loaded shared sticky resource, adding a non-sticky user on that shared sticky resource can help to improve the utilization of that shared sticky resource.
  • a method for minimizing the signaling overhead of setting up the SSA group, adding or removing a user to or from the SSA group, indicating the H-ARQ status on the shared resources (e.g. using the AI-SN indicators), and indicating the identity of the intended user for the current transmission is disclosed.
  • AIE Advanced Interface Evolution
  • FIG. 9 illustrates the exemplary signal channel structure that can carry the messages for sending the shared sticky assignment, for setting up the SSA group set up, or for sending the AI_SN indicator according to the present invention.
  • CRC Cyclic Redundant Check
  • the encoder 415 adds forward error correction (FEC) coding to the output sequence of CRC element 410.
  • FEC forward error correction
  • a rate matching element 420 repeats and/or punctures the encoded bits from encoder 415 in order to match the rate on the F-SSCH to certain fixed rate.
  • a scrambler 425 then scrambles the output sequence from the rate matching element 320 with a scrambling code that is generated from scrambling code generator 430.
  • the scrambling code generator 430 is a PN register that is seeded with the channel identity, which indicates the purposes, of the control channel.
  • the scrambled sequence is interleaved by channel interleaver 435.
  • the interleaved sequence is then modulated by modulator 440.
  • the in-phase (I) and quadrature (Q) outputs of modulator 440 are then gain-controlled by channel gain elements 445 and 450.
  • the output complex signal is then multiplexed with the other channels by channel multiplexer 455 using Frequency Division Multiple Access (FDMA) 5 , Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), OFDMA, or a combination thereof.
  • FDMA Frequency Division Multiple Access
  • CDMA Code Division Multiple Access
  • TDMA Time Division Multiple Access
  • OFDMA OF
  • a layer 3 message is broadcasted to the users to indicate the number of SSA groups that are being set up, the number of shared resources in each SSA group, and the corresponding channel ID of each shared resource in each SSA group.
  • This layer 3 message can explicitly indicate the location of the corresponding AI_SN indicator in a Bitmap for each shared resource in each SSA group.
  • the location of the corresponding AI_SN indicator in a Bitmap for each shared resource in each SSA group can be implicitly indicated by the sequence of that shared resource appears in that layer 3 message that sets up the SSA groups.
  • a bitmap of the AI_SN indicators is sent on the control channel illustrated in FIG. 9 as the information payload, wherein each bit corresponds to the AI_SN indicator of one shared resource in the order that this shared resource appears in the layer 3 message that sets up the SSA groups.
  • a specially scrambling code is assigned by the same layer 3 message that sets up the SSA group for this control channel to indicate the type or purpose of this control channel so that the users can interpret the meaning of the information payload accordingly.
  • the radio parameters such as channel ID for this control channel can be indicated by the same layer 3 message or it can be indicated by the broadcast channel in the Superframe preamble.
  • the sub-packet is scrambled with a scrambling code that is unique to the intended user.
  • Each user uses its unique scrambling code to descramble the received sub-packets on each assigned shared sticky resource.
  • an assignment message is sent on the control channel illustrated in FIG. 9 as information payload.
  • the assignment message includes at least the identity of the intended user, a persistent (or sticky) bit that is set (i.e. to "1"), the Channel ID that belongs to the shared resource that the user is to be assigned to, and a Supplemental bit.
  • a persistent (or sticky) bit that is set (i.e. to "1")
  • the Channel ID that belongs to the shared resource that the user is to be assigned to
  • Supplemental bit When the user correctly receives an assignment message with the persistent (or sticky) bit is set and the Channel ID belongs to one of the shared resource that has been set up in one SSA group by the layer 3 message, this user understands that it has been given a shared sticky assignment. It is expected to share that resource with more users. And it will monitor the corresponding AI_SN bit.
  • the supplemental bit in the assignment message is set (i.e. to "1").
  • the persistent bit in the assignment message is not set (i.e. set to "0").
  • the chamiel ID in the assignment message should be the parent channel ID corresponds to the combined shared resource, and the persistent bit should be set (i.e. to "1"), while the supplement bit depends on whether the combined resource is assigned in addition to at least one different shared resource or not.
  • the methods disclosed in the present invention provide finer granularity for sharing the resources among multiple users by allowing multiple users, such as M users where M is an integer greater than or equals to 1 , to share multiple shared resources (or pipes), such as N pipes where N is an integer greater than or equals to 1, while in the previously disclosed techniques N is always one. Therefore, the methods disclosed in the present invention enables the system to gradually increase the sharing ratio and find the right balance of system efficiency and guaranteed QoS.
  • the methods disclosed in the present invention also provide shorter queuing delay therefore better QoS for the users with delay-sensitive applications due to higher priority to access the shared pipes and earlier availability of one shared pipe from multiple shared pipes that are assigned for the those users.
  • FDMA Frequency Division Multiplex Access
  • TDMA Time Division Multiplex Access
  • CDMA Code Division Multiplex Access
  • OFDMA Orthogonal Frequency Division Multiplex Access
  • the present invention provides a novel method to have the voice and data users share the same time-frequency resource, which results in a more efficient utilization of wireless radio resource and thus improves the performance of a wireless system. It is understood, however, that the following disclosure provides many different embodiments, or examples, for implementing different features of the invention. Specific examples of components, signals, messages, protocols, and arrangements are described below to simplify the present disclosure. These are, of course, merely examples and are not intended to limit the invention from that described in the claims. Well known elements are presented without detailed description in order not to obscure the present invention in unnecessary detail. For the most part, details unnecessary to obtain a complete understanding of the present invention have been omitted inasmuch as such details are within the skills of persons of ordinary skill in the relevant art. Details regarding control circuitry described herein are omitted, as such control circuits are within the skills of persons of ordinary skill in the relevant art.
  • the Group Setup Message is sent by the base station to set up the grouping initially and to add user to the group.
  • a group is defined with a set of group and user specified parameters, such as GroupID, resource location, number of VoIP users, number of data users, bitmap length, etc.
  • the Group Setup Message in Table 1 is sent to each VoIP user and the Group Setup Message in Table 2 is sent to each data user.
  • MCS indices Mod_Coding_l, 2, 3, and 4
  • the mapping from said bits to actual MCS can be adjusted by upper layer signaling, based on long-term channel quality and/or power availability. Table 2.
  • Block_Size The fundamental block size (e.g. 1 DRCH by 1 Frame)
  • Ordering_Pattern One of a few choices indicating the order in which the blocks are to be distributed
  • Mod_Coding_2 Third highest modulation and coding scheme '01 '
  • Mod_Coding_3 Second highest modulation and coding scheme ' 10'
  • Bitmap 1 VoIP Length Length of the VoIP bitmap in the first bitmap
  • Bitmap Header Mode The way to indicate the active users
  • AT_Index The bitmap position assigned to the AT (if bitmap for data users is used), or the index assigned to the AT
  • Interlace_Offset Offset assigned to the AT indicative of its first transmission
  • FIG. 1OA illustrated an example of the novel method for multiplexing multiple (N) voice users and multiple (M) data users using an extended bitmap signaling. While the voice users have higher priority to be served, the remaining resource, if any, may be divided to K (K ⁇ M) data pipes which allow up to K data users transmitting at the same time. Following the VoIP bitmap 1000, data bitmap 1005 is added to indicate the packet data transmission. Bitmap2 1010 is optional and provides extra information for VoIP users to indicate the number of assigned blocks and/or the packet format. A scheduler at AN decides which data user is being served, how much resource is assigned and which MCS is being used based on the channel quality, the QoS requirement and the buffer status, etc.
  • a data bitmap 1005 typically includes a data bitmap header 1015 and the corresponding MCS and resource size fields for the first K-I data pipes 1020 as well as the MCS field for the last pipe 1025.
  • Each active data user will look at the bitmap for the users in front of it (including both voice and data), calculate the occupied blocks, and locate the exact blocks being assigned to the said data user.
  • the last data pipe size can be easily calculated and needs MCS field only 1025.
  • the encoded packet size depends on the size of assigned resource and the MCS scheme used. The padding may be needed if the information bits are less than the encoded packet size.
  • the scheduler at AN balances the power and MCS of the data user.
  • the mapping from the MCS bits to actual packet format can be adjusted by upper layer signaling.
  • the data bitmap will be reduced to 1025 only, and 1015 and 1020 are not needed.
  • one MCS value e.g. OO'
  • the said data user will look at the bitmap for all active voice users, identify the resource blocks assigned to the voice users, and remove the resource blocks that are assigned to the voice users from the entire resource blocks that are designated for this group in order to locate the left-over blocks being assigned to the said data user. If no resource is left from VoIP users according to the bitmap, the MCS index value is ignored.
  • the Mode 1 of Data Bitmap Header is illustrated in FIG. 1OB for multiplexing multiple (N) voice users and multiple (M) data users to share the same time-frequency resource by using an AI_SN bit for each data pipe in Data Bitmap Header as shown in 230.
  • the length of Data Bitmap Header is K bits, with the assumption of K data pipes.
  • a new packet indicator, AI_SN as described in [0016] is used to indicate the start of a new packet for the data pipe, by means of setting as ' 1 ' or '0' or by toggling between "1 " and "0".
  • This mode is preferred when number of data pipes K is small compared to number of data users M in the group.
  • the number of data pipes K equals to one, a single Index field remains in 230, and 1020 is not needed in FIG. 1OA. If no resource is left from the previous users according to the bitmap, the MCS index value is ignored.
  • the Mode 3 of Data Bitmap Header is illustrated in FIG. 1OD for multiplexing multiple (N) voice users and multiple (M) data users to share the same time-frequency resource by using bitmap in Data Bitmap Header as shown in 240. More specifically, one bit is used at a fixed position for each data user to indicate whether the corresponding user is assigned a data pipe (T) to transmit or not ('0').
  • the length of Data Bitmap Header is M, given that there are M data users in the group.
  • all the MCS fields in 1020 and 1025 in FIG. 1OA need to reserve one value, e.g. OOO', to indicate the retransmission of a packet while all other values indicate new packet transmission. This mode is preferred when number of data pipes K is close to number of data users M in the group. If there is no left over resource from VoIP users, the all data bitmap will be set to zero.
  • bitmap2 is optional for VoIP users. Data users will work properly without the present of bitmap2.
  • the Data Bitmap Header can also use a mixture of user index, bitmap indication and AI_SN to indicate the active users.
  • One method is to simply delay the subpacket retransmission until the resource becomes available.
  • Another method is to use adaptive retransmission, i.e., partitioning the subpacket to fit in the size of the left over resource for retransmissions.
  • a more aggressive method is to allow AN to reserve the needed resource in the group for any subpacket retransmission until this subpacket is acknowledged or the maximum number of retransmissions is reached, although this may slightly affect the VoIP user transmissions.
  • One can also use F-SCCH, the forward link shared control channel, to schedule any available resource not reserved by any other groups for the subpacket retransmission.
  • a data user can also be a member of multiple groups.
  • This data user will receive multiple Group Setup Messages and have to monitor multiple bitmaps from the AN.
  • AN will activate the said user in no more than one of the groups for data transmission.
  • a larger pool of resources is available to the said data user which results in a larger trunking efficiency.
  • this leads to less constraint to the subpacket retransmissions, as the AN can assign the active data user any available resource in any of the groups for retransmissions, using left over resource and/or sophisticated scheduling over VoIP users.
  • the user may also be served by multiple groups simultaneously. If there is only one encoded packet across all the group resources, one ACK/NAK is sufficient, otherwise, multiple ACK/NAK are needed.
  • the power control can be used to target an earlier termination than the default so that the number of retransmissions can be reduced.
  • the ACK/NAK channel design is given in an example of a shared resource composing of two frames (FIG. 2).
  • the VoIP users are indexed based on their positions in the first bitmap as 1, 2, ..., N
  • the M data users are sequentially indexed following the VoIP users in the first bitmap as N+l, N+2, ..., N+M.
  • the ATs are assigned an ACK position based on their indices. For example with the first N/2 VoIP ATs and M/2 data ATs will be assigned to transmit their ACK in the first ACK position, while the second N/2 ATs and M/2 data ATs will be assigned to transmit their ACK in the second ACK position.
  • an even/odd structure could be used, whereby ATs with an odd index will be assigned to transmit their ACK in the first ACK position, while ATs with an even index will be assigned to transmit their ACK in the second ACK position.
  • Broadcasting information (e.g., group management information) to all the users within a group is achieved with various methods.
  • one extra bit is added in bitmap to indicate whether the left over resource is used to for broadcast or not.
  • one value e.g., 'I l l ' if 3 bits are used
  • F_SCCH F_SCCH
  • the VoIP and data users in this invention can be further generalized to two user types, while the first type of users are of higher priority with, for example, latency sensitive services, and the second type of users are of lower priority with, for example, latency insensitive services.
  • the methods described above still apply.
  • the present invention contemplates to use these novel methods on the messages sent by anyone communications terminal and received by any other communications terminal.
  • the various illustrative logical blocks, modules, and circuits described in connection with the embodiment disclosed herein may be implemented or performed with, but not limited to, a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a memory device such as RAM, ROM, EPROM 3 or EEPROM, a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, and any combination thereof designed to perform the functions described herein.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA field programmable gate array
  • the present invention provides unique methods to support sharing of radio resources in an OFDMA-based communication system. It is understood, however, that the following disclosure provides many different embodiments, or examples, for implementing different features of the invention.
  • bitmap control 1 is used to control the scheduling group.
  • this control bitmap 2 is then use to not only denote the time frequency resources that are used by the scheduling group mobile station, it is also used to signal the resources that are occupied by other scheduling group that are doing scheduling group resource sharing with the present scheduling group or it is also used to indicate the available leftover resource which can be used by the sharing group mobile stations.
  • This signaling of the resources used by the other scheduling groups are accomplished via the bits that are not associated with the active users in bitmap 1.
  • the signaling in bitmap 2 is by an explicit one to one mapping to the resource used by the other scheduling group. A one in bitmap 2 would indicate that the resource is being used by the other scheduling group. As a way of an illustrative example, consider FIG.
  • time frequency resources for scheduling group A and scheduling group B are overlap completely.
  • the scheduling group shares 10 time frequency resources.
  • a one in bitmap 2 indicates that two time frequency resources are associated with the active user while a one indicates that one time frequency resource is associated with the active user.
  • scheduling group A will assign resources in ascending order while scheduling group B will assign the resources in descending order.
  • Bitmap 1 in scheduling group A indicates that MS3 and MS2 are active.
  • Bitmap 2 in scheduling group A indicates that MS3 is assigned time frequency resource 1 and MS2 is assigned time frequency resources 2 as well as 3. The interpretation of the other bits of bitmap 2 that are not associated with active users are now used to indicate if the time frequency resources are used by the other scheduling groups.
  • bitmap 2 of scheduling group A showed that time frequency resources 9 and 10 are used by the other scheduling groups. Therefore, the mobile station in the sharing group that is sharing the leftover resources of scheduling group A will by looking at bitmap 1 and bitmap 2 of scheduling group A know that time frequency resources 1,2,3,9 and 10 are used and that time frequency resources 4,5,6,7 and 8 are left over resources that they can use.
  • time frequency resources 9 and 10 are denoted as used by scheduling group B
  • bitmap 1 show that MS7 is active and that bitmap 2 shows that MS7 is assigned 2 time frequency resources.
  • scheduling group B assigned resources in descending order it is clear that MS7 is assigned resources 9 and 10.
  • the other bits of bitmap 2 that are not associated with the active users in bitmap 1 of scheduling group B also show that the first three time frequency resources are used by scheduling group A.
  • the mapping of the time frequency resources used in bitmap 2 is now clear.
  • the last bit of bitmap 2 corresponds to the time frequency resources of the first time frequency resource in the other scheduling groups' resource ordering pattern, the second last bit to the second and so forth.
  • FIG. 11 shows an illustrative example where the time frequency resources of the two scheduling group are completely overlapping.
  • the extension to partial overlapping case is straight forward and is illustrated in FIG. 12.
  • the set up of scheduling group A and scheduling group B is the same as in FIG. 11 but that scheduling group A is using time frequency resources 1 to 10 while scheduling group A is using scheduling resources 3 to 11.
  • time frequency resources 1, 2 and 3 are used by scheduling group A mobile stations while time frequency resource 10 is used by scheduling group B.
  • Bitmap 2 of scheduling group B show that MS7 is assigned scheduling resource 10 and 11 and that time frequency resource 3 is used by scheduling group A.
  • the mobile station in the sharing group with scheduling group A will know that time frequency resources 4, 5, 6, 7, 8 and 9 are free for sharing. It is now clear that if the scheduling groups share X time frequency resources and the scheduling group is scheduling time frequency resources from O to P, the mapping of the bits in bitmap 2 of the scheduling group that controls that are not associated with active users in bitmap 1 is as follows: The last bit of bitmap 2 will indicated if the resource P - X is used by the other scheduling group, the second last bit of bitmap 2 will indicated if the resource P - X + 1 is used by the other scheduling group, the third last bit of bitmap 2 will indicated if the resource P - X + 2 is used by the other scheduling group, and so on.
  • the signaling of the free time frequency resources is done by an explicitly denoting the number of free time frequency resource or the size of the time frequency resource the base station intends to assigned to the mobile stations in the sharing group in the bits of bitmap 2 that are not associated with the active users of bitmap 1. Since the one boundary between the occupied time frequency resources and the free time frequency resources can be obtained form the bits associated with the active users in bitmap 1, the entire free time frequency resource is then delineated if a boundary and length is known.
  • bitmap control 2 is used to control the scheduling group. With this control bitmap 2 is then use to not only denote the time frequency resources that are used by the scheduling group mobile station, it is also used to signal the resources that are occupied by other scheduling group that are doing scheduling group resource sharing with the present scheduling group. In this case, there is a one to one explicit mapping between the bits in bitmap 2 and the time frequency resource. In this case the bitmap signals all time frequency resource including those used by the other scheduling group by a one when the time frequency resource cannot be used for the initial transmission of a packet in this interval. As a way of an illustrative example, consider FIG. 13 where it shows that time frequency resources for scheduling group A and scheduling group B.
  • scheduling group A is scheduling time frequency resource 1 to 10 and scheduling group B is scheduling time frequency resource 3 to 11.
  • Bitmap 1 in scheduling group A indicates that MS3 and MS2 have a new packet transmission.
  • Bitmap 2 in scheduling group A indicates that MS3 is assigned time frequency resource 0 and MS2 is assigned time frequency resources 4.
  • the interpretation of the other bits of bitmap 2 that are not associated with active users are now used to indicate if the time frequency resources are used by the other scheduling groups.
  • bitmap 2 of scheduling group A showed that time frequency resource 10 is used by the other scheduling groups.
  • the mobile station in the sharing group that is sharing the leftover resources of scheduling group A will by looking at bitmap 1 and bitmap 2 of scheduling group A know that time frequency resources 1,2,3,4 and 10 are used and that time frequency resources 5,6,7,8 and 9 are left over resources that they can use.
  • bitmap 1 of scheduling group B in FIG. 13 shows that MS7 is scheduled to have a new packet transmission.
  • MS7 will look at bitmap 2 of scheduling group B and see that time frequency resource 10 is assigned to it. Furthermore to indicated the time frequency, resources used by scheduling group A, time frequency resources 3,4 are also shown to be used. Therefore a mobile station that is part of the sharing group that is sharing the left over resources of scheduling group B will know that time frequency resources 3, 4, 10 and 11 are occupied and that time frequency resources 5,6,7,8,9 and 10 are free for sharing.
  • the mobile station in the sharing group of scheduling group A will detect all of the bitmaps from all the scheduling groups that share a part of the their scheduled time frequency resource with this scheduling group. In so doing it can determine the free resource as that not used.

Landscapes

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

Abstract

La présente invention concerne un format de paquet de couche physique et un procédé de signalisation pour minimiser le surdébit de signalisation selon lequel une pluralité d'utilisateurs partagent des ressources d'interface hertzienne pour améliorer l'efficacité dans des systèmes de communications de multiplexage par la répartition orthogonale de la fréquence (OFDM) et l'accès multiple par la répartition orthogonale de la fréquence (OFDMA).
PCT/CN2007/001299 2006-04-20 2007-04-20 Procédé et appareil pour partager des ressources radio dans un système de communications sans fil WO2007124675A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2007800072347A CN101395831B (zh) 2006-04-20 2007-04-20 无线通信系统中共享无线资源的方法和装置

Applications Claiming Priority (8)

Application Number Priority Date Filing Date Title
US79396106P 2006-04-20 2006-04-20
US60/793,961 2006-04-20
US82428306P 2006-08-31 2006-08-31
US82428406P 2006-08-31 2006-08-31
US60/824,283 2006-08-31
US60/824,284 2006-08-31
US82952606P 2006-10-14 2006-10-14
US60/829,526 2006-10-14

Publications (1)

Publication Number Publication Date
WO2007124675A1 true WO2007124675A1 (fr) 2007-11-08

Family

ID=38655066

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/001299 WO2007124675A1 (fr) 2006-04-20 2007-04-20 Procédé et appareil pour partager des ressources radio dans un système de communications sans fil

Country Status (2)

Country Link
CN (1) CN101395831B (fr)
WO (1) WO2007124675A1 (fr)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008033860A3 (fr) * 2006-09-11 2008-06-19 Qualcomm Inc Gestion de ressources de groupe voip
WO2008110125A1 (fr) * 2007-03-15 2008-09-18 Huawei Technologies Co., Ltd. Support de signalisation pour regroupement de données et d'utilisateurs vocaux permettant le partage de ressources radio dans des systèmes sans fil
WO2009002421A2 (fr) * 2007-06-21 2008-12-31 Lucent Technologies Inc. Procédé et appareil pour l'ordonnancement de paquets dans un système à accès multiple par répartition orthogonale de la fréquence (ofdma)
WO2009085852A3 (fr) * 2007-12-19 2009-11-19 Qualcomm Incorporated Procédé et appareil pour améliorer les performances de la détection d'une séquence d'effacement
EP2225910A1 (fr) * 2007-12-29 2010-09-08 Alcatel- Lucent Shanghai Bell Co., Ltd Procédé et appareil de planification permanente sur la base d'un semi-groupage et d'un multiplexage statistique
CN101854670A (zh) * 2009-04-03 2010-10-06 中兴通讯股份有限公司 组管理配置方法
WO2011017621A3 (fr) * 2009-08-07 2011-05-19 Research In Motion Limited Procédé et système pour gérer des opérations harq pendant des changements de mode de transmission
US7974353B2 (en) 2006-08-31 2011-07-05 Futurewei Technologies, Inc. Method and system for resource allocation for OFDM wireless networks
EP2413627A1 (fr) * 2009-03-25 2012-02-01 Fujitsu Limited Système de radiocommunication, dispositif de station mobile, dispositif de station de base et procédé de radiocommunication dans le système de radiocommunication
KR101272772B1 (ko) 2007-12-17 2013-06-10 삼성전자주식회사 광대역 무선통신 시스템에서 동적 자원 할당 장치 및 방법
CN103988527A (zh) * 2011-05-27 2014-08-13 高通股份有限公司 用于多播和广播系统中流复用的组ID和QoS组标识
US8937911B2 (en) 2006-08-31 2015-01-20 Futurewei Technologies, Inc. Method and system for sharing resources in a wireless communication network
EP2327194A4 (fr) * 2008-07-07 2015-07-01 Intel Corp Techniques destinées à un ordonnancement continuel amélioré avec une capacité d adaptation de liaison efficace

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102498745A (zh) * 2009-07-03 2012-06-13 岩星比德科有限公司 用于向无线站的组用信令发送活跃指派的装置和方法
US8583128B2 (en) 2009-07-13 2013-11-12 Intel Mobile Communications GmbH Apparatus and method for mapping physical control channels
CN102045898B (zh) * 2009-10-13 2015-11-25 中兴通讯股份有限公司 组资源分配的组管理方法及装置
EP2606699A4 (fr) * 2010-08-19 2016-08-24 Nokia Technologies Oy Procédé et dispositif permettant une utilisation en multiplexage d'une ressource sur un support de transmission
WO2014205834A1 (fr) * 2013-06-29 2014-12-31 华为技术有限公司 Procédé de sélection de procédé de modulation et de codage, équipement utilisateur et station de base
WO2015103746A1 (fr) 2014-01-08 2015-07-16 Qualcomm Incorporated Amélioration de réseau mbsfn de petite taille
US10314065B2 (en) * 2016-04-12 2019-06-04 Qualcomm Incorporated Traffic multiplexing
CN110710167B (zh) * 2017-06-07 2021-05-18 华为技术有限公司 一种数据传输的方法和装置
CN112398555B (zh) * 2020-10-28 2022-05-24 北京通广龙电子科技有限公司 增量式资源申请和分配方法及系统

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020064167A1 (en) * 2000-11-29 2002-05-30 Khan Farooq Ullah Hybrid ARQ with parallel packet transmission
CN1385008A (zh) * 1999-10-28 2002-12-11 艾利森电话股份有限公司 上行链路的一种调度方法和装置
CN1400805A (zh) * 2001-07-31 2003-03-05 株式会社Ntt都科摩 移动通信系统，基站设备，及控制移动通信系统的方法
CN1416231A (zh) * 2001-10-29 2003-05-07 华为技术有限公司 无线分组数据传输中系统信息的广播方法
CN1537372A (zh) * 2002-04-24 2004-10-13 三星电子株式会社 在高速无线分组数据通信系统中支持自动重复请求的设备和方法
WO2005006639A1 (fr) * 2003-07-15 2005-01-20 Sony Corporation Systeme, dispositif et procede de radiocommunication et programme informatique
CN1600005A (zh) * 2001-10-05 2005-03-23 艾利森电话股份有限公司 通信网中对用户进行调度的系统和方法
WO2005048614A1 (fr) * 2003-11-14 2005-05-26 Zte Corporation Procede de programmation de paquets pour systeme de communication sans fil

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1385008A (zh) * 1999-10-28 2002-12-11 艾利森电话股份有限公司 上行链路的一种调度方法和装置
US20020064167A1 (en) * 2000-11-29 2002-05-30 Khan Farooq Ullah Hybrid ARQ with parallel packet transmission
CN1400805A (zh) * 2001-07-31 2003-03-05 株式会社Ntt都科摩 移动通信系统，基站设备，及控制移动通信系统的方法
CN1600005A (zh) * 2001-10-05 2005-03-23 艾利森电话股份有限公司 通信网中对用户进行调度的系统和方法
CN1416231A (zh) * 2001-10-29 2003-05-07 华为技术有限公司 无线分组数据传输中系统信息的广播方法
CN1537372A (zh) * 2002-04-24 2004-10-13 三星电子株式会社 在高速无线分组数据通信系统中支持自动重复请求的设备和方法
WO2005006639A1 (fr) * 2003-07-15 2005-01-20 Sony Corporation Systeme, dispositif et procede de radiocommunication et programme informatique
WO2005048614A1 (fr) * 2003-11-14 2005-05-26 Zte Corporation Procede de programmation de paquets pour systeme de communication sans fil

Cited By (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7974353B2 (en) 2006-08-31 2011-07-05 Futurewei Technologies, Inc. Method and system for resource allocation for OFDM wireless networks
US8937911B2 (en) 2006-08-31 2015-01-20 Futurewei Technologies, Inc. Method and system for sharing resources in a wireless communication network
US8363607B2 (en) 2006-09-11 2013-01-29 Qualcomm Incorporated VOIP group resource management
WO2008033860A3 (fr) * 2006-09-11 2008-06-19 Qualcomm Inc Gestion de ressources de groupe voip
WO2008110125A1 (fr) * 2007-03-15 2008-09-18 Huawei Technologies Co., Ltd. Support de signalisation pour regroupement de données et d'utilisateurs vocaux permettant le partage de ressources radio dans des systèmes sans fil
WO2009002421A2 (fr) * 2007-06-21 2008-12-31 Lucent Technologies Inc. Procédé et appareil pour l'ordonnancement de paquets dans un système à accès multiple par répartition orthogonale de la fréquence (ofdma)
WO2009002421A3 (fr) * 2007-06-21 2009-05-07 Lucent Technologies Inc Procédé et appareil pour l'ordonnancement de paquets dans un système à accès multiple par répartition orthogonale de la fréquence (ofdma)
US8203955B2 (en) 2007-06-21 2012-06-19 Alcatel Lucent Method and apparatus for scheduling packets in an orthogonal frequency division multiple access (OFDMA) system
KR101272772B1 (ko) 2007-12-17 2013-06-10 삼성전자주식회사 광대역 무선통신 시스템에서 동적 자원 할당 장치 및 방법
US8498261B2 (en) 2007-12-17 2013-07-30 Samsung Electronics Co., Ltd. Apparatus and method for dynamic resource allocation in broadband wireless communication system
WO2009085852A3 (fr) * 2007-12-19 2009-11-19 Qualcomm Incorporated Procédé et appareil pour améliorer les performances de la détection d'une séquence d'effacement
US8804627B2 (en) 2007-12-19 2014-08-12 Qualcomm Incorporated Method and apparatus for improving performance of erasure sequence detection
US9445167B2 (en) 2007-12-29 2016-09-13 Alcatel Lucent Persistent scheduling method and apparatus based on semi-grouping and statistically multiplexing
EP2225910A4 (fr) * 2007-12-29 2012-10-03 Alcatel Lucent Procédé et appareil de planification permanente sur la base d'un semi-groupage et d'un multiplexage statistique
EP2225910A1 (fr) * 2007-12-29 2010-09-08 Alcatel- Lucent Shanghai Bell Co., Ltd Procédé et appareil de planification permanente sur la base d'un semi-groupage et d'un multiplexage statistique
EP2327194A4 (fr) * 2008-07-07 2015-07-01 Intel Corp Techniques destinées à un ordonnancement continuel amélioré avec une capacité d adaptation de liaison efficace
EP2413627A1 (fr) * 2009-03-25 2012-02-01 Fujitsu Limited Système de radiocommunication, dispositif de station mobile, dispositif de station de base et procédé de radiocommunication dans le système de radiocommunication
US9294959B2 (en) 2009-03-25 2016-03-22 Fujitsu Limited Radio communication system, mobile station apparatus, base station apparatus, and radio communication method in radio communication system
EP2413627A4 (fr) * 2009-03-25 2015-01-21 Fujitsu Ltd Système de radiocommunication, dispositif de station mobile, dispositif de station de base et procédé de radiocommunication dans le système de radiocommunication
CN101854670A (zh) * 2009-04-03 2010-10-06 中兴通讯股份有限公司 组管理配置方法
WO2011017621A3 (fr) * 2009-08-07 2011-05-19 Research In Motion Limited Procédé et système pour gérer des opérations harq pendant des changements de mode de transmission
CN102687449B (zh) * 2009-08-07 2015-01-21 黑莓有限公司 用于在发送模式改变期间处理harq操作的方法和系统
US8578233B2 (en) 2009-08-07 2013-11-05 Blackberry Limited Method and system for handling HARQ operations during transmission mode changes
US8386875B2 (en) 2009-08-07 2013-02-26 Research In Motion Limited Method and system for handling HARQ operations during transmission mode changes
CN102687449A (zh) * 2009-08-07 2012-09-19 捷讯研究有限公司 用于在发送模式改变期间处理harq操作的方法和系统
EP3176972A1 (fr) * 2009-08-07 2017-06-07 BlackBerry Limited Procédé et système de gestion d'opérations harq lors des changements de mode de transmission
USRE46821E1 (en) 2009-08-07 2018-05-01 Blackberry Limited Method and system for handling HARQ operations during transmission mode changes
USRE48441E1 (en) 2009-08-07 2021-02-16 Blackberry Limited Method and system for handling HARQ operations during transmission mode changes
CN103988527A (zh) * 2011-05-27 2014-08-13 高通股份有限公司 用于多播和广播系统中流复用的组ID和QoS组标识

Also Published As

Publication number Publication date
CN101395831B (zh) 2013-11-06
CN101395831A (zh) 2009-03-25

Similar Documents

Publication Publication Date Title
WO2007124675A1 (fr) Procédé et appareil pour partager des ressources radio dans un système de communications sans fil
US11888615B2 (en) Multiplexing schemes for OFDMA
US8681729B2 (en) Resource reservation for users in a mobile communication system
US20070242653A1 (en) Method and apparatus for sharing radio resources in an ofdma-based communication system
US10110353B2 (en) Methods and systems for resource allocation
US8923321B2 (en) Apparatus and method for handling control channel reception/decoding failure in a wireless VoIP communication system
KR100969737B1 (ko) 직교 주파수 분할 다중화에서 공유 시그널링 채널들을 위한자원 할당
KR101420879B1 (ko) 스케줄링 정보에 관한 데이터의 전송방법
EP1826939B1 (fr) Technique de sélection de candidat de ressource de bloc utilisant une planification de paquets dans des systèmes de communication sans fil
JP5415524B2 (ja) 移動通信ネットワークにおけるセミパーシステントリソース割当ての有効化
US7864740B2 (en) System for minimizing signaling overhead in OFDMA-based communication systems
US8042018B2 (en) Method and apparatus for transmitting/receiving ACK/NACK in a frequency division multiple access system
EP2104261A1 (fr) Gestion de processus HARQ améliorée
US20080056187A1 (en) System For Grouping Users To Share Time-Frequency Resources In A Wireless Communication System
US8208495B2 (en) Data transmission with supplemental resources
WO2008030856A2 (fr) Appareil et procédé de signalisation de demande à répétition automatique avec indications réduites de retransmission dans un système de communication voip sans fil
WO2008024631A2 (fr) Appareil et procédé pour une attribution de ressources et une transmission de données utilisant des formats de modulation hétérogènes dans un système de communication par paquet sans fil
WO2007036116A1 (fr) Procede et systeme de voie de service de diffusion multiple et de voie de service de diffusion individuelle
WO2007095860A1 (fr) Procédé et appareil pour une attribution de ressources sans fil
CN115039361A (zh) 电信装置和方法
WO2007107089A1 (fr) Système de réduction au minimum de surcharge de signalisation dans des systèmes de communication basés sur ofdma

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

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 200780007234.7

Country of ref document: CN

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 07720872

Country of ref document: EP

Kind code of ref document: A1