Hybrid contention-based and schedule-based access to a communication link
15 claims: 5 independent, 10 dependent
- 1A method of managing multiple user access to a communication link (16) comprising:receiving user data transmissions on a contention-based channel (40) of the communication link (16) that supports a maximum number of simultaneous user data transmissions, wherein each user data transmission is assigned a unique signature sequence generated by introducing a delay-Doppler shift to a base sequence;detecting contention overloads where more than the maximum number of users (18) simultaneously transmit on the contention-based channel (40);identifying the users involved in a contention overload based on the unique signature sequences received from those users even if the data in the user data transmission is not demodulated;and scheduling retransmissions of user data for one or more of the identified users on a scheduled channel (42) of the communication link (16).
- 5The method of any of claims 1-4, further characterized by defining the contention-based channel (40) and the scheduled channel (42) based on allocating channel resources from the communication link (16), said channel resources comprising at least one of frequency, time, and code channelization resources.
- 10The method of any of claims 7-8, further characterized by sending individualized acknowledgment information to the users that transmitted in a given transmission slot (46), if a contention overload did not occur in the given transmission slot (46), and otherwise sending individualized scheduling information to those users, at least to the extent that unique signature sequences were successfully received from the users that transmitted in the given transmission slot (46).
- 11A base station (12) for use in a wireless communication network (10) and configured to manage multiple user access to a communication link (16) supported by the base station (12), said base station (12) comprising;receiver circuits (28) to receive user data transmissions on a contention-based channel (40) of the communication link (16) that supports a maximum number of simultaneous user data transmissions, wherein each user data transmission is assigned a unique signature sequence, which has been generated by introducing a delay-Doppler shift to a base sequence;and one or more processing circuits (30) operatively associated with the receiver circuits (28) and configured to detect contention overloads where more than the maximum number of users (18) simultaneously transmit on the contention-based channel (40), identify the users involved in a contention overload based on the unique signature sequences received from those users even if the data part of the user data transmission is not demodulated, and schedule retransmissions of user data for one or more of the identified users on a scheduled channel (42) of the communication link (16).
- 13The base station (12) of any of claims 11-12, further characterized in that the one or more processing circuits (30) include a channel allocation processor configured to dynamically allocate channel resources from the communication link (16) for scheduled channel use responsive to the detection of contention overloads.
- 14The base station (12) of any of claims 11-13, further characterized in that the one or more processing circuits (30) include a channel allocation processor that is configured to define the contention-based channel (40) and the scheduled channel (42) by allocating channel resources from the communication link (16), said channel resources comprising at least one of frequency, time, and code channelization resources.
- 15The base station (12) of any of claims 11-14, further characterized in that the one or more processing circuits (30) include a retransmission processor configured to control whether scheduled retransmissions are to be full retransmissions or partial retransmissions that exploit incremental or redundant decoding at the base station.
Independent claims11
55 paragraphs in 4 sections, as filed
TECHNICAL FIELD
0001The present invention generally relates to multiple access control to a communication link, such as the uplink in a wireless communication network, and particularly relates to using a hybrid of contention-based access and schedule-based access.
<u>BACKGROUND</u>
0002As current and future wireless communication networks transition away from circuit-switched communications and toward packet-switched communications, resource allocation becomes more flexible and more challenging. For example, in packet-switched environments, resource allocations tend to be made on a demand basis. Further, resource allocations to individual users tend to be of short duration, reflecting the bursty, intermittent nature of many packet-switched communication applications, such as web browsing, etc.
0003<patcit id="pcit0001" dnum="US20050053029A"><text>US 2005/0053029</text></patcit> discloses a method for performing uplink access in a broadband mobile communication system.
0004As one example, packet-based communication applications and services complicate the allocation of common uplink resources in cellular and other wireless communication networks, such as where a potentially large group of users in a given cell share a common communication uplink. One sharing approach depends on resource reservation techniques, wherein individual users access the common uplink on a reserved basis. Scheduling access to the communication link in this manner has the advantage of controlling the group of users in a manner that avoids conflicting transmissions (i.e., simultaneous transmission on the same physical resource by more than one user) but the scheduling request/grant signaling adds potentially significant overhead to the communication link, and adds complexity to the managing base station.
0005As an alternative, contention-based access offers potentially greater communication link efficiency by eliminating the signaling overhead of scheduled access. With contention-based access, each user vying for access to the communication link transmits autonomously, meaning that collisions between user transmissions occur from time to time. Commonly, the base station or other receiving entity can demodulate more than one user's transmission at the same time, so collisions do not necessarily mean loss of user data. However, interference or practical constraints on demodulation resources generally limits the number of simultaneous user transmissions that can be successfully received. The term "contention overload" denotes the occurrence of more than the maximum allowed number of simultaneous user transmissions, where that number may be fixed, or may change depending upon prevailing reception conditions and loading at the base station.
0006As a common point, conventional contention-based access schemes assume that no user transmissions can be received (demodulated) correctly in the presence of a contention overload, meaning that all user transmissions are "lost" in such events and the channel resources used for those transmissions were completely wasted. Worse, without provisions to stagger or otherwise disperse retransmissions on the contention-based channel, the users involved in a contention overload all may attempt retransmissions at or about the same time, thereby risking a further contention overload. As a general proposition, therefore, contention overloads may be understood as potentially reducing or eliminating the efficiency gains that come with the elimination of scheduling overhead from the communication link.
SUMMARY
0007One or more embodiments taught herein provide a hybrid access arrangement using a contention-based channel and a scheduled channel on a communication link, e.g., a wireless communication network uplink. As a point of significant efficiency, given users transmit autonomously on the contention-based channel, without need for scheduling overhead. However, if a contention overload occurs on the contention-based channel, where too many users simultaneously transmit on the contention-based channel, the involved users are identified from unique signature sequences included in their user transmissions.
0008Heretofore, the particular users involved in a contention overload could not be identified, and therefore no basis was available for managing them in specific response to their involvement in a contention overload. As taught herein, user transmissions include unique signature sequences, which, for example, may be defined from a base sequence of length <i>N</i> using circular delay-Doppler shifts. These sequences allow a base station or other receiver to identify the users involved in a contention overload, even if the data portions of the user transmissions cannot be demodulated. The identified users are temporarily managed as scheduled users on the scheduled channel, which supplements the contention-based channel and therefore may use limited communication link resources in comparison to the contention-based channel. Users not involved in the contention overload generally continue operating on the contention-based channel.
0009The reader is referred to the appended independent claims. Some preferred features are laid out in the dependent claims.
0010Of course, the present invention is not limited to the above features and advantages. Indeed, those skilled in the art will recognize additional features and advantages upon reading the following detailed description, and upon viewing the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
0011<ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">Fig. 1</figref> is a partial block diagram of a wireless communication network, including a base station configured to implement one embodiment of a hybrid access scheme that combines contention-based and scheduled-based access to communication uplink resources.</li><li><figref idref="f0002">Fig. 2</figref> is a block diagram of one embodiment of contention-based and schedule-based uplink channels for hybrid multiple access, and a corresponding downlink control channel for controlling such access.</li><li><figref idref="f0002">Fig. 3</figref> is a logic flow diagram illustrating one embodiment of processing logic for implementing a method of hybrid multiple access.</li><li><figref idref="f0003">Fig. 4</figref> is a block diagram of user categorizations, where subgroups of users (mobile stations) are managed on a contention basis and, as needed, on a scheduled basis.</li><li><figref idref="f0003">Fig. 5</figref> is a graph comparing the performance of an example base station that uses an embodiment of hybrid multiple access as taught herein with a base station that does not, where performance is plotted in terms of average packet delay versus packet arrival rate (from a transmitting user's perspective).</li></ul>
DETAILED DESCRIPTION
0012By way of non-limiting example, <figref idref="f0001">Fig. 1</figref> partially illustrates a wireless communication network 10, which includes a base station 12 and one or more other entities 14. The base station 12 provides an uplink communications channel 16 for receiving user transmissions from individual mobile stations 18 in a group 20 of mobile stations based on a hybrid multiple access arrangement, wherein it manages both contention-based and scheduled-based access to the uplink communications channel 16. The base station 12 further provides a downlink communications channel 22 for sending transmissions to mobile stations 18 in the group 20, including control signaling associated with its management of the hybrid multiple access. Supporting those communication links, the illustrated base station 12 includes one or more transmit/receive antennas 24, along with associated transmitter and receive circuits 26 and 28, respectively, and further includes one or more processing circuits 30 that are operatively associated with the transmitter and receiver circuits 26 and 28.
0013As illustrated by way of non-limiting example in <figref idref="f0002">Fig. 2</figref>, the base station 12 supports hybrid multiple access by defining a contention-based channel 40 and a schedule-based channel 42 on the communications uplink 16, along with a corresponding control channel 44 on the downlink for managing such access. Broadly, the individual mobile stations 18 (which are conveniently referred to as "users") transmit autonomously on the contention-based channel 40, on an as-needed basis. If a contention overload occurs on the contention-based channel 40, the base station 12 identifies the individual mobile stations 18 that were involved in the contention overload, and temporarily manages the involved mobile stations 18 as scheduled users on the scheduled channel 42, by sending individualized retransmission scheduling information to the involved users on the downlink control channel 44. Users not involved in the contention overload generally continue operation on the contention-based channel 40.
0014Operation of the scheduled channel 42 in a sense "supplements" the contention-based channel 40, in that scheduled transmissions are used as needed to manage the retransmission of user data from users involved in contention overloads. This limited usage allows the contention-based channel 40 to be managed aggressively without suffering the deleterious effects conventionally caused by contention overloads. Further, the use of the scheduled channel 42 as a supplemental or secondary channel-e.g., to handle contention overflows from the primary, contention-based channel 40-means that the scheduled channel 42 may be allocated relatively few resources from the communication link 16, in comparison to the contention-based channel 40. As such, the existence of the scheduled channel 42 does not represent a significant reservation of resources. Moreover, in at least one embodiment the scheduled channel is dynamically allocated as needed, responsive to the occurrence of contention overloads.
0015In any case, the downlink control signal 44, which is propagated from the base station 12 through the transmission medium to the group 20 of mobile stations 18, serves the dual purpose of conveying acknowledgement information for users that transmitted on the contention-based channel 40 in the absence of a contention overload, conveying retransmission scheduling information for users that transmitted on the contention-based channel 40 in the presence of a contention overload. In other words, for the illustrated signal configurations, for any given transmission slot 46, the base station 12 receives a given number of simultaneous user transmissions. If too many users are transmitting in that slot 46, a contention overload occurs and the base station decodes or otherwise determines, e.g., using correlation processing, the unique signature sequences of the users that transmitted in that slot 46. At least for the users it successfully identifies, the base station 12 determines retransmission schedules, and subsequently transmits individualized retransmission scheduling information on the downlink control channel signal 44. Note that the downlink control channel 44 may use slots 46 which are synchronized with a fixed offset interval from that start of the slot in which the contention-based signal was transmitted.
0016Conversely, for any given slot 46 of the contention-based channel 40 where no contention overload occurs, the base station 12 uses the downlink control channel 44 to send individualized acknowledgement information to the users that transmitted in that slot 46. Thus, in response to contention overloads on the (uplink) contention-based channel 40, the downlink control channel signal 44 carries retransmission scheduling information. For a given contention overload, that information identifies the schedules to be used by the involved users for retransmitting the lost information on the scheduled channel 42, which also may be slotted according to transmission slots 48. The timing of slots 48 may or may not match the timing of slots 46. Further, in response to user transmissions received in the absence of contention overloads, the downlink control channel 44 carries ack/nack or other acknowledgement signaling, indicating to the individual transmitting users whether their transmissions were or were not successfully received.
0017Accordingly, if an individual user not involved in a contention overload is acked on the downlink control channel 44, that user stays in the "contention pool," and retransmits as needed on the contention-based channel 40. Conversely, one or more of the individual users that are involved in a contention overload are temporarily removed from the contention pool and placed in a "scheduled pool," where the user information lost because of the contention overload is transmitted by them on a scheduled basis on the scheduled channel 42. Those scheduled transmissions are controlled by the retransmission scheduling information sent by the base station 12 on the downlink control channel 44. Thus, the base station 12 may be configured to send individualized acknowledgment information to the users that transmitted in a given transmission slot 46 (of the contention-based channel 40), if a contention overload did not occur in the given transmission slot, and otherwise to send individualized scheduling information to those users. In this case, retransmission schedule information can be sent at least to the extent that unique signature sequences were successfully received from the users that transmitted in the given transmission slot.
0018In at least one embodiment, the base station 12 individually acknowledges mobile station transmissions it receives on the contention-based channel 40, and the mobile stations 12 are programmed to listen for such acknowledgements. However, rather than nacking incorrectly received transmissions, which would leave nacked mobile stations in the contention pool 50, the base station 12 sends individualized retransmission scheduling information to mobile stations 18 whose contention-based channel transmissions were incorrectly received. In this case, the base station 12 effectively temporarily removes a mobile station 18 from the contention pool 50 if this mobile station's transmission was incorrectly received at the base station 12, regardless of whether a contention overload occurred. Of course, if a contention overload did occur, the base station 12 may move all the mobile stations 18 identified as being involved in that contention overload temporarily into the scheduled pool 52.
0019In more detail, the base station 12 receives user transmissions on the contention-based channel 40 on a transmission slot basis, and correspondingly sends synchronized control information to the transmitting mobile stations 18. Let t_{<i>j</i>} denote the start time of the <i>j</i>-th slot. Assuming that the delay between the base station 12 receiving transmissions in the j-th slot of the contention-based channel 40 and transmitting corresponding individualized control information on the downlink control channel 44 is D slot durations, each mobile station 18 can be configured to listen for control information on the downlink control channel 44 at time <i>t</i><sub><i>j</i>+</sub><i><sub>D</sub>,</i> for feedback regarding its packet transmission on the contention-based channel 40 at time <i>t<sub>j</sub></i>.
0020Accordingly, the base station 12 is configured to receive user transmissions in slot <i>j</i> of the contention-based channel 40, determine the unique signature sequences for the transmitting mobile stations 18 by time <i>t</i><sub><i>j</i>+<i>k</i></sub> (where <i>k</i> may be more or less than one slot's time, but is less than D), and send the appropriate, individualized control information in slot <i>j</i> + D of the downlink control channel 44. In one embodiment, the base station 12 acks correctly-received transmissions but sends retransmission scheduling information to any mobile station 18 whose contention-based transmission was incorrectly received; in other embodiments, the base station 12 sends ack/nack signaling as appropriate, unless a contention overload occurs, in which case it sends retransmission scheduling information to one or more of the involved mobile stations 18. Preferably, the base station 12 sends retransmission scheduling information to all of the mobile stations 18 involved in a contention overload, at least to the extent that it can successfully identify them from the received signature sequences.
0021Of course, these signaling protocols and the corresponding illustrated channel arrangements may be advantageous in at least some applications, but they are not intended to be limiting. For example, the downlink signaling (ack/nack, retransmission scheduling) need not be consolidated onto one channel, nor does ack/nack versus retransmission signaling necessarily need to be done using the same channel, although that approach is convenient. More broadly, the base station 12 is configured to implement a method of managing multiple user access to a communication link which represents a hybrid of contention-based and schedule-based access to the communication uplink 16.
0022To this end, the processing circuit(s) 30 of the base station 12 may be correspondingly configured. For example, the processing circuit(s) 30 may comprise one or more general- or special-purpose microprocessor circuits configured according to computer program instructions stored in a computer readable medium included within the base station 12. However, regardless of whether the method is implemented in hardware, software, or any combination thereof, <figref idref="f0002">Fig. 3</figref> illustrates a broad embodiment of hybrid contention-based and schedule-based multiple access, such as may be performed by or for the base station 12.
0023The processing "begins" with the base station 12 receiving user transmissions on a contention-based channel 40 of the communication link 16, where that link supports a maximum number of simultaneous user transmissions, and wherein each user transmission includes a unique signature sequence (Block 100). Processing continues with detecting contention overloads where more than the maximum number of allowed users simultaneously transmit on the contention-based channel 40 (Block 102), and continues with identifying the users involved in a contention overload based on the unique signature sequences received from those users (Block 104). Processing further continues with scheduling retransmissions for one or more of the identified users on a scheduled channel 42 of the communication link 16 (Block 106).
0024Referring back to <figref idref="f0002">Fig. 2</figref>, one sees that the processing of <figref idref="f0002">Fig. 3</figref> may be performed or otherwise looped through on a transmission-slot basis. For example, receiving user transmissions on the contention-based channel 40 may comprise receiving user transmissions within synchronized transmission slots 46 of the contention-based channel 40. Thus, detecting contention overloads comprises detecting contention overloads on a transmission slot basis, and identifying the users involved in a contention overload comprises identifying users on a transmission slot basis. With that, scheduling retransmissions comprises, for a given transmission slot 46 in which a contention overload occurred, sending scheduling information to the users identified from the unique signature sequences that were received in the given transmission slot 46.
0025However, whether or not transmission on the contention-based channel 40 is performed on a transmission slot basis, <figref idref="f0003">Fig. 4</figref> illustrates that the hybrid multiple access teachings presented herein manage the group 20 of mobile stations 18 as a contention pool 50 and a scheduled pool 52. By default, individual users operate in the contention pool 50, where each one autonomously transmits on the contention-based channel 40 on an as-needed basis. To the extent that those autonomous user transmissions result in contention overloads, one or more of the involved users is moved from the contention pool 50 to the scheduled pool 52, where the retransmission of information lost from those users because of the contention overload is retransmitted on a scheduled basis via the scheduled channel 42. In that sense, the base station advantageously identifies the specific users involved in a given contention overload, and temporarily moves one or more of the identified users from the contention pool 50 to the scheduled pool 52. Users remaining in the contention pool 50 continue contention-based transmissions.
0026Scheduling retransmissions for one or more of the identified users on a scheduled channel 42 of the communication link 16 comprises, for example, determining retransmission schedule information for each of the one or more identified users, and sending the retransmission schedule information to the one or more identified users. In this manner, those users operate at least temporarily as scheduled users on the scheduled channel 42. As noted, such retransmission schedule information may be transmitted on the downlink control channel 44, on an individualized basis.
0027As further noted, the resources from the communication link 16 needed to support the scheduled channel 42 are, in one or more embodiments, dynamically allocated from the communication link 16 for scheduled channel use, in response to detecting contention overloads. Of course, embodiments are also contemplated where resources for the scheduled channel 42 are allocated statically from the communication link for scheduled channel use. Of course, even static allocations may be updated from time to time, but at any given time some resources may be reserved for the scheduled channel 42 even if scheduled retransmissions are not ongoing.
0028In both static and dynamic allocation embodiments, the base station 12 may be configured to define the contention-based channel 40 and the scheduled channel 42 based on allocating channel resources from the communication link 16. For example, those channel resources comprise at least one of frequency, time, and code channelization resources. Depending upon the particulars of the air interface adopted by the base station 12 and the mobile stations 18, the channel allocations may comprise allocating or otherwise reserving blocks of Orthogonal Frequency Division Multiplex (OFDM) subcarriers within a larger OFDM carrier spectrum. More generally, the allocations represent some allocation of channelization resources (code, time, and/or frequency) on the communication uplink 16, that allows the contention-based channel 40 and the scheduled channel 42 to coexist, and allows individual users to be assigned to one or the other channels.
0029As another advantageous variation, the processing circuit(s) 30 may be configured to indicate whether scheduled retransmissions are to be full retransmissions or partial retransmissions that exploit incremental or redundant decoding. In other words, as a basic embodiment, the base station 12 and mobile stations 18 can be configured such that retransmission of user data lost in a contention overload is done as a simple, full retransmission of the data that was lost. However, the base station 12 and mobile stations 18 may be configured to use, for example, a form of Hybrid Automatic Repeat Requests (HARQ) for the retransmissions. In such embodiments, the mobile stations 18 take advantage of the fact that user transmissions may not have been entirely lost or corrupted during a contention overload, meaning that incrementally redundant retransmissions may be sent on the scheduled channel 42, thereby making more efficient use of that channel's resources. The base station 12 therefore can indicate to the retransmitting users the extra redundancy that should be sent on the scheduled channel 42.
0030Turning from retransmission scheduling details, it should be noted that shifting users involved in contention overloads from the contention pool 50 to the scheduled pool 52 depends on the ability to identify the users involved in contention overloads, even if the user data sent by them is lost because of the overload. The unique signature sequences described herein represent an advantageous mechanism for the base station 12 reliably identifying users during a contention overload.
0031A United States provisional patent application entitled, "Novel Signature Sequence Design for Time-Frequency Selective Channel," was filed on 12 January 2007 and has been assigned Application Serial No. <patcit id="pcit0002" dnum="US60884703B"><text>60/884,703</text></patcit>. This '703 sets forth exemplary details regarding the generation and use of unique signature sequences. For example, the processing circuit(s) 16 at the base station 12 may be preconfigured with a set of unique signature sequences that it dynamically assigns to mobile stations 18 being supported by it, or it may be configured with a generation algorithm allowing it to dynamically generate the sequences.
0032According to the teachings presented in the '703 application, the time-frequency selectivity in a wireless communication channel essentially arises from the results of the delay-Doppler shifts imparted to the signal by scattering within the propagation environment. Because of these effects, the propagated signal taken at the propagation channel output exhibits an expansion in the delay-Doppler domain. One may therefore create a number of uniquely distinguishable signals by artificially introducing different delay-Doppler shifts to a well designed base signal. Sequence sets constructed this way are quite useful for, but not limited to, identifying a large number of mobile stations 18 vying for contention-based access on the contention-based channel 40.
0033Use of signature sequences in the above context depends on the ability of a pair of signature sequences to be distinguished from each other at the receiving base station. That ability often is measured by the cross correlation function between sequences, which is defined as, <maths id="math0001" num="Eq. (1)"><math display="block"><mrow><mstyle displaystyle="true"><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>−</mo><mn>1</mn></mrow></munderover></mrow></mstyle><mrow><msub><mi>s</mi><mn>0</mn></msub><mfenced open="[" close="]"><mi>n</mi></mfenced><msubsup><mi>s</mi><mn>1</mn><mrow><mo>*</mo></mrow></msubsup><mfenced open="[" close="]"><mi>n</mi></mfenced><mo>,</mo></mrow></mrow></math><img file="EP2201813B1_D0001.tif" /></maths> where <i>N</i> is the sequence length. In a time-dispersive (frequency selective) channel, a good signature sequence also needs to be distinguishable from its multipath echoes. That requirement dictates good autocorrelation performance, where the autocorrelation function is defined as, <maths id="math0002" num="Eq. (2)"><math display="block"><mrow><mstyle displaystyle="true"><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>−</mo><mn>1</mn></mrow></munderover></mrow></mstyle><mrow><msub><mi>s</mi><mn>0</mn></msub><mfenced open="[" close="]"><mi>n</mi></mfenced><msubsup><mi>s</mi><mn>0</mn><mrow><mo>*</mo></mrow></msubsup><mfenced open="[" close="]" separators=""><mi>n</mi><mo>−</mo><mi>τ</mi></mfenced><mo>,</mo></mrow></mrow></math><img file="EP2201813B1_D0002.tif" /></maths> for <i>τ</i>=0,...<i>N</i>-1. (Unless otherwise specified, indexing in this context is modulo <i>N</i>.)
0034The above functions and considerations suggest circular operations that can be achieved in practice by introducing cyclic prefixes of appropriate length, such as known in OFDM communication systems. Consequently, the most commonly used metrics for signature sequence design in a time-dispersive channel is simply the cross correlation function defined as, <maths id="math0003" num="Eq. (3)"><math display="block"><mrow><msub><mi>φ</mi><mrow><msub><mi>s</mi><mn>0</mn></msub><mo>,</mo><msub><mi>s</mi><mn>1</mn></msub></mrow></msub><mfenced open="[" close="]"><mi>τ</mi></mfenced><mo>≡</mo><mrow><mstyle displaystyle="true"><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>−</mo><mn>1</mn></mrow></munderover></mrow></mstyle><mrow><msub><mi>s</mi><mn>0</mn></msub><mfenced open="[" close="]"><mi>n</mi></mfenced><msubsup><mi>s</mi><mn>1</mn><mrow><mo>*</mo></mrow></msubsup><mfenced open="[" close="]" separators=""><mi>n</mi><mo>−</mo><mi>τ</mi></mfenced><mn>.</mn></mrow></mrow></mrow></math><img file="EP2201813B1_D0003.tif" /></maths>
0035In the case where <i>s</i><sub>0</sub>[<i>n</i>] = <i>s</i><sub>1</sub>[<i>n</i>], the cross-correlation function becomes an autocorrelation function. A good sequence set should then have small cross correlation between any pair of sequences at all lags and small autocorrelation at non-zero lag for all individual sequences. In cases where the system of interest is synchronized up to the sequence length, the same sequence can be circularly shifted and assigned to more than one device as long as the relative circular shifts are more than the channel's maximum delay spread. The common pilot code for CDMA2000 is such an example where different circular shifts are used to differentiate the pilot signals of different base stations, even though the same pilot sequence is used across the base stations.
0036Accordingly, one embodiment for signature sequence generation begins with an arbitrary base sequence <i>s</i>[<i>n</i>] of length-N . From this base sequence, a set of sequences can be derived by introducing a circular delay-Doppler shift to the base sequence as follows: <maths id="math0004" num="Eq. (4)"><math display="block"><mrow><msub><mi>s</mi><mrow><mi>l</mi><mo>,</mo><mi>m</mi></mrow></msub><mfenced open="[" close="]"><mi>n</mi></mfenced><mo>=</mo><mi>s</mi><mfenced open="[" close="]" separators=""><mi>n</mi><mo>−</mo><msub><mi mathvariant="italic">lτ</mi><mi>d</mi></msub></mfenced><msup><mi>e</mi><mrow><mi>j</mi><mfrac><mrow><mn>2</mn><msub><mi mathvariant="italic">πmυ</mi><mi>d</mi></msub><mi>n</mi></mrow><mi>N</mi></mfrac></mrow></msup><mo>,</mo></mrow></math><img file="EP2201813B1_D0004.tif" /></maths> where (<i>τ<sub>d</sub></i>,<i>υ<sub>d</sub></i>) is the minimum delay-Doppler separation between any pair of derived sequences and (<i>l,m</i>) is the unique identification index associated with the derived sequence.
0037If the base sequence is properly selected, each derived sequence in the set can be uniquely identified even after passing through a time-frequency selective propagation channel, provided that the minimum delay-Doppler separation (<i>τ<sub>d</sub></i>, <i>υ<sub>d</sub></i>) is greater than the propagation channel's maximum delay-Doppler spread (<i>τ</i><sub>max</sub>, <i>υ</i><sub>max</sub>). The number of available ambiguity-free sequences is therefore limited by <i>N<sup>2</sup></i> /(<i>τ</i><sub>max</sub> × υ<sub>max</sub>).
0038As a specific advantageous example of an ideal base sequence for generation of the unique signature sequences used herein, consider that a BPSK (±1) modulated m-sequence <i>s[n]</i> has the special property that the product <i>s</i>[<i>n</i>]<i>s</i>[<i>n</i>-<i>τ</i>] is another m-sequence for any nonzero integer <i>τ</i>. Furthermore, the DFT of an m-sequence is given by, <maths id="math0005" num="Eq. (5)"><math display="block"><mrow><mfenced open="|" close="|"><mrow><mstyle displaystyle="true"><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>−</mo><mn>1</mn></mrow></munderover></mrow></mstyle><mrow><mi>s</mi><mfenced open="[" close="]"><mi>n</mi></mfenced><msup><mi>e</mi><mrow><mo>−</mo><mi>j</mi><mfrac><mrow><mn>2</mn><mi mathvariant="italic">πnk</mi></mrow><mi>N</mi></mfrac></mrow></msup></mrow></mrow></mfenced><mo>=</mo><mrow><mo>{</mo></mrow><mtable><mtr><mtd><mn>1</mn><mo>,</mo><mspace width="1em" /><mi mathvariant="italic">k</mi><mo>=</mo><mn>0</mn></mtd></mtr><mtr><mtd><msqrt><mrow><mi>N</mi><mo>+</mo><mn>1</mn></mrow></msqrt><mo>,</mo><mspace width="1em" /><mi mathvariant="italic">k</mi><mo>≠</mo><mn>0</mn></mtd></mtr></mtable><mn>.</mn></mrow></math><img file="EP2201813B1_D0005.tif" /></maths> In other words, the cross-correlation between any pair of sequences in the set of <i>N<sup>2</sup></i> distinct sequences derived from a length- <i>N m</i>-sequence is at most <maths id="math0006" num=""><math display="inline"><mrow><msqrt><mrow><mi>N</mi><mo>+</mo><mn>1</mn></mrow></msqrt><mn>.</mn></mrow></math><img file="EP2201813B1_D0006.tif" /></maths>
0039In practice, it may sometimes be desirable to choose a sequence length long enough to cover several times the maximum number of devices in the system such that subsets of the sequences can be reused by multiple adjacent systems. In the context of this disclosure, that means that the individual mobile stations 18 in the group 20 may be assigned a unique signature sequence taken from a subset of signature sequences, while other signature sequences in the larger set are allocated for similar use by neighboring base stations. (The same idea can be used for sectorized cells, where different subsets of signature sequences are used for different sectors of the same cell.)
0040At the base station 12, the receiver circuits 28 (and/or the processing circuits 30) can be configured to robustly detect the signature sequences included in user transmissions, even in the presence of contention overloads that can prevent the base station 12 from successfully receiving the user data in the simultaneous transmissions causing the contention overload. To understand sequence detection, it may be helpful to explore an optimal detector of a single sequence in the generalized maximum likelihood sense. Assuming that the only channel information available is the maximum delay-Doppler spread (<i>τ</i><sub>max</sub>, υ<sub>max</sub>), the optimal detection of a single sequence is to evaluate the generalized likelihood function, <maths id="math0007" num="Eq. (6)"><math display="block"><mrow><mi>γ</mi><mfenced open="[" close="]" separators=","><mi>l</mi><mi>m</mi></mfenced><mo>=</mo><mrow><mstyle displaystyle="true"><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>τ</mi><mo>=</mo><msub><mi mathvariant="italic">lτ</mi><mi>d</mi></msub></mrow><mrow><msub><mi mathvariant="italic">lτ</mi><mi>d</mi></msub><mo>+</mo><msub><mi>τ</mi><mi>max</mi></msub></mrow></munderover></mrow></mstyle><mrow><mstyle displaystyle="true"><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>υ</mi><mo>=</mo><msub><mi mathvariant="italic">mυ</mi><mi>d</mi></msub></mrow><mrow><mo>−</mo><mn>1</mn><msub><mrow><mspace width="1em" /><mi mathvariant="italic">mυ</mi></mrow><mi>d</mi></msub><mo>+</mo><msub><mi>υ</mi><mi>max</mi></msub><mo>−</mo><mn>1</mn></mrow></munderover></mrow></mstyle><mrow><msup><mfenced open="|" close="|" separators=""><mi mathvariant="normal">I</mi><mfenced open="[" close="]" separators=","><mi>τ</mi><mi>υ</mi></mfenced></mfenced><mn>2</mn></msup><mo>,</mo></mrow></mrow></mrow></mrow></math><img file="EP2201813B1_D0007.tif" /></maths> for all hypotheses of [<i>l, m</i>], where <maths id="math0008" num="Eq. (7)"><math display="block"><mrow><mi>I</mi><mfenced open="[" close="]" separators=","><mi>τ</mi><mi>υ</mi></mfenced><mo>=</mo><mrow><mstyle displaystyle="true"><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>−</mo><mn>1</mn></mrow></munderover></mrow></mstyle><mrow><mi>r</mi><mfenced open="[" close="]"><mi>n</mi></mfenced><mi>s</mi></mrow></mrow><mo>*</mo><mfenced open="[" close="]" separators=""><mi>n</mi><mo>−</mo><mi>τ</mi></mfenced><msup><mi>e</mi><mrow><mo>−</mo><mfrac><mrow><mi>j</mi><mn>2</mn><mi mathvariant="italic">πυn</mi></mrow><mi>N</mi></mfrac></mrow></msup></mrow></math><img file="EP2201813B1_D0008.tif" /></maths> is the delay-Doppler image defined over 0≤τ<<i>N</i>,0≤υ<<i>N</i>, and <i>r</i>[<i>n</i>] is the received signal. The hypothesis with the largest log-likelihood is determined as the transmitted sequence.
0041Even though the metric given in Eq. (6) is optimal only when there is exactly one sequence in the system, it can also be used to detect multiple sequences if proper normalization and thresholding are employed. Thus, the base station 12-e.g., by appropriate configuration of the receiver circuits 28 and/or the associated processing circuits 30-can be configured to implement a sequence detector that enables it to identify a large number of unique signature sequences in robust fashion.
0042More particularly, the base station's detection and identification of unique signature sequences is more robust than its ability to reliably demodulate user data received in user transmissions from the mobile stations 18, and it can resolve a large number of individual signature sequences in comparison to the largest number of mobile stations 18 that may be expected to simultaneously transmit on the contention-based channel 40 at any given time. For example, if <i>M</i> represents the maximum number of simultaneous user transmissions that the base station 12 can demodulate, then the number of unique signature sequences that the base station 12 can detect is » <i>M</i>.
0043That ability depends on proper sequence generation. Accordingly, an m-sequence of length-N is selected as a base sequence. Circular delay-Doppler shifts applied to this base sequence produce a set of <i>N<sup>2</sup></i> signature sequences that can be uniquely identified by the base station 12. Particularly, the minimum delay-Doppler spacing <i>(τ<sub>d</sub></i>,<i>υ<sub>d</sub></i>) used for the circular shifting is chosen so that it is greater than the propagation channel's maximum delay-Doppler spread (<i>τ</i><sub>max</sub>, υ<sub>max</sub>). Each device (e.g., mobile station 18) to be separately distinguished is assigned a sequence with unique index pair(<i>l</i>,<i>m</i>), so that each one can be identified and detected using a two-dimensional delay-Doppler correlator given in Eq. (6).
0044Note that network simulations/empirical information may be used to set the spacing used for deriving unique signature sequences from the base sequence, and this derivation of unique signature sequences may be done as a design process. The generated sequences can be loaded into non-volatile memory or other storage at the base station 12, for its use during live operation. Alternatively, the base station 12 can be configured with generation logic, such as may be implemented in the processing circuits 30, such that it can generate signature sequences dynamically.
0045Regardless, it should be understood that for mobile stations 18 sharing the communication link 16 on a contention basis, the base station 12 can be configured to assign a different signature sequence to each one. In at least one embodiment, the assigned signature sequences are transmitted by the base station 12 to the targeted mobile stations 18, for example, as part of control signaling at call set up, or at other times.
0046<figref idref="f0003">Fig. 5</figref> illustrates example performance in terms of average packet delay versus new packet arrival rate, for a base station 12 that adopts the hybrid access teachings presented herein. The corresponding performance line is shown without markers, where the plotted performance assumes that the base station 12 can simultaneously receive/demodulate no more than four packets on either the contention-based channel 40 or on the scheduled channel 42. For comparison, the performance is plotted for an otherwise-comparable base station but using "slotted-4-Aloha" without detection of contention overloads and without use of a supplemental scheduled channel for managing retransmissions from contention overloads. That performance line is shown with "X" markers for ready distinction.
0047Of course, real-world performance depends on a number of implementation details, but it is generally believed that the teachings herein offer performance advantages in many cases. Advantageously, then, these teachings are applicable to a wide range of system types, communication channelization schemes, etc. Along these lines, it also should be understood that the base station 12 may be configured as needed for a particular application and network type. For example, the wireless communication network 10 may comprise a Long Term Evolution (LTE) cellular network in accordance with the relevant Third Generation Partnership Project (3GPP) standards, or, as another example, may comprise an "IMT Advanced" cellular network in accordance with the relevant International Telecommunications Union (ITU) standards.
0048Of course, these should be understood as non-limiting examples. However, the network/base station type and the particulars of the related air interface protocol may influence the channelization approach taken for the allocation of communication link resources for schedule-based use and contention-based use. This point was noted earlier herein, where it was explained that the communication uplink 16 of <figref idref="f0001">Fig. 1</figref> could be separated into logical channels for contention-based use and for schedule-based use by the allocation of OFDM subcarrier blocks, for example. (Of course, the communication uplink 16 may have multiple channels defined within it, including a contention-based channel and a schedule-based channel.)
0049Broadly, the hybrid multiple access teachings presented herein manage a group of users on a contention basis, by setting aside contention-based channel resources for their usage and tracking the users involved in contention overloads based on receiving identifying signature sequences as part of the contention transmissions. In response to detecting a contention overload, where more than a maximum allowed number of users simultaneously transmit on the contention-based channel, the involved users are identified and retransmission scheduling information is sent to them, causing those users to temporarily operate as scheduled users. The channel resources for scheduled transmissions may be reserved for such usage, or may be dynamically allocated as needed.
0050In some embodiments, the base station 12 may be configured to receive the user data transmissions on the contention-based channel 40 within synchronized transmission slots 46.
0051In some embodiments, the base station 12 may be configured to detect contention overloads on a transmission slot basis, and to identify the users involved in a contention overload on a transmission slot basis.
0052In some embodiments, the base station 12 may be configured to schedule retransmissions in response to a contention overload occurring within a given transmission slot by sending scheduling information to the users identified from the unique signature sequences that were successfully received at the base station 12 on the contention-based channel 40 for that given transmission slot.
0053In some embodiments, the base station 12 may be configured to send individualized acknowledgment information to the users that transmitted in a given transmission slot, if a contention overload did not occur in the given transmission slot, and otherwise send individualized scheduling information to those users for whom unique signature sequences were successfully received at the base station in the given transmission slot.
0054With these and other advantages in mind, those skilled in the art will appreciate that the foregoing description and the accompanying drawings represent non-limiting examples of the methods and apparatuses taught herein. As such, the present invention is not limited by the foregoing description and accompanying drawings. Instead, the present invention is limited only by the following claims and their legal equivalents.
Contents4
11 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11
Every citation, both ways
| Document | Relation | Office |
|---|---|---|
| US2005053029A1 | Cites | United States of America |
| CHITRE D M ET AL: "RANDOM ACCESS WITH NOTIFICATION - A NEW MULTIPLE-ACCESS SCHEME FOR VSAT NETWORKS" COMSAT TECHNICAL REVIEW, COMMUNICATIONS SATELLITE CORPORATION. WASHINGTON, US, vol. 19, no. 1, 21 March 1989 (1989-03-21), pages 99-121, XP000084954 ISSN: 0095-9669 | Non-patent | – |
7 members in 4 offices
Priority claims7
| Document | Office | Kind | Date |
|---|---|---|---|
| 87557607 | United States of America | A | |
| 875576 | United States of America | – | |
| 2008051006 | Sweden | W | |
| WO2008SE51006 | – | – | – |
| US20070875576 | – | – | – |
| 875576 | – | – | – |
| 2008051006 | – | – | – |
Members7
| Document | Office | Kind | |
|---|---|---|---|
| US2009103558A1 | United States of America | A1 | |
| WO2009051549A1 | World Intellectual Property Organization (WIPO) | A1 | |
| EP2201813A1 | European Patent Office (EPO) | A1 | |
| CN101828422A | China | A | |
| US7978646B2 | United States of America | B2 | |
| CN101828422B | China | B | |
| EP2201813B1This record | European Patent Office (EPO) | B1 |
66 legal events, as 9 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Application deemed withdrawn, or ip right lapsed, due to non-payment of renewal feeWithdrawnR119 | R119 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filedOpposition26N | 26N | EP | |
| Notification of lapseLapsedST | ST | FR | |
| Gb: european patent ceased through non-payment of renewal feeCeasedGBPC | GBPC | EP | |
| Patent lapsedLapsedMM4A | MM4A | IE | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Deletion acc. to par. 5 (withdrawal of the translation of the ep patent)MK05 | MK05 | AT | |
| Patent invalid in the netherlands as no translation has been filedMP | MP | NL | |
| Invalidated european patentMG4D | MG4D | LT | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| Reference to at number (ep patent validated in austria)REF | REF | AT | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Intention to grant announcedINTG | INTG | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Request for extension of the european patent (deleted)DAX | DAX | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 2201813
- Publication, DOCDB
- 2201813
- Publication, EPODOC
- EP2201813
- Application
- 8794183
- Application, DOCDB
- 08794183
- Application, EPODOC
- EP20080794183
Titles3
- German
- KONFLIKT- UND PLANBASIERTER HYBRIDER ZUGRIFF AUF EINE KOMMUNIKATIONSVERBINDUNG
- English
- HYBRID CONTENTION-BASED AND SCHEDULE-BASED ACCESS TO A COMMUNICATION LINK
- French
- ACCÈS HYBRIDE À UNE LIAISON DE COMMUNICATION, À BASE DE CONTENTION ET D'ORDONNANCEMENT
Classification
- CPC, 2
- H04W74/0841
- H04W74/02
- IPC, 2
- H04W74 08
- H04W74 02
Designated states1
- Contracting states, 1
- Türkiye
