The invention relates to the field of wireless communications; more particularly, the invention relates to multi-cell, multi-subscriber wireless systems using orthogonal frequency division multiplexing (OFDM).
Orthogonal frequency division multiplexing (OFDM) is an efficient modulation scheme for signal transmission over frequency-selective channels. In OFDM, a wide bandwidth is divided into multiple narrowband subcarriers, which are arranged to be orthogonal with each other. The signals modulated on the subcarriers are transmitted in parallel. For more information, see Cimini, Jr., “Analysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division Multiplexing,” IEEE Trans. Commun., vol. COM-33, no. 7, July 1985, pp. 665-75; Chuang and Sollenberger, “Beyond 3G: Wideband Wireless Data Access Based on OFDM and Dynamic Packet Assignment,” IEEE Communications Magazine, Vol. 38, No. 7, pp. 78-87, July 2000.
One way to use OFDM to support multiple access for multiple subscribers is through time division multiple access (TDMA), in which each subscriber uses all the subcarriers within its assigned time slots. Orthogonal frequency division multiple access (OFDMA) is another method for multiple access, using the basic format of OFDM. In OFDMA, multiple subscribers simultaneously use different subcarriers, in a fashion similar to frequency division multiple access (FDMA). For more information, see Sari and Karam, “Orthogonal Frequency-Division Multiple Access and its Application to CATV Networks,” European Transactions on Telecommunications, Vol. 9 (6), pp. 507-516, November/December 1998 and Nogueroles, Bossert, Donder, and Zyablov, “Improved Performance of a Random OFDMA Mobile Communication System,” Proceedings of IEEE VTC'98, pp. 2502-2506.
Multipath causes frequency-selective fading. The channel gains are different for different subcarriers. Furthermore, the channels are typically uncorrelated for different subscribers. The subcarriers that are in deep fade for one subscriber may provide high channel gains for another subscriber. Therefore, it is advantageous in an OFDMA system to adaptively allocate the subcarriers to subscribers so that each subscriber enjoys a high channel gain. For more information, see Wong et al., “Multiuser OFDM with Adaptive Subcarrier, Bit and Power Allocation,” IEEE J. Select. Areas Commun., Vol. 17(10), pp. 1747-1758, October 1999.
Within one cell, the subscribers can be coordinated to have different subcarriers in OFDMA. The signals for different subscribers can be made orthogonal and there is little intracell interference. However, with aggressive frequency reuse plan, e.g., the same spectrum is used for multiple neighboring cells, the problem of intercell interference arises. It is clear that the intercell interference in an OFDMA system is also frequency selective and it is advantageous to adaptively allocate the subcarriers so as to mitigate the effect of intercell interference.
One approach to subcarrier allocation for OFDMA is a joint optimization operation, not only requiring the activity and channel knowledge of all the subscribers in all the cells, but also requiring frequent rescheduling every time an existing subscriber is dropped off the network or a new subscriber is added onto the network. This is often impractical in real wireless system, mainly due to the bandwidth cost for updating the subscriber information and the computation cost for the joint optimization.
A method and apparatus for allocating subcarriers in an orthogonal frequency division multiple access (OFDMA) system is described. In one embodiment, the method comprises allocating at least one diversity cluster of subcarriers to a first subscriber and allocating at least one coherence cluster to a second subscriber.
The present invention will be understood more fully from the detailed description given below and from the accompanying drawings of various embodiments of the invention, which, however, should not be taken to limit the invention to the specific embodiments, but are for explanation and understanding only.
A method and apparatus for allocating subcarriers in an orthogonal frequency division multiple access (OFDMA) system is described. In one embodiment, the method comprises allocating at least one diversity cluster of subcarriers to a first subscriber and allocating at least one coherence cluster to a second subscriber.
The techniques disclosed herein are described using OFDMA (clusters) as an example. However, they are not limited to OFDMA-based systems. The techniques apply to multi-carrier systems in general, where, for example, a carrier can be a cluster in OFDMA, a spreading code in CDMA, an antenna beam in SDMA (space-division multiple access), etc. In one embodiment, subcarrier allocation is performed in each cell separately. Within each cell, the allocation for individual subscribers (e.g., mobiles) is also made progressively as each new subscriber is added to the system as opposed to joint allocation for subscribers within each cell in which allocation decisions are made taking into account all subscribers in a cell for each allocation.
For downlink channels, each subscriber first measures the channel and interference information for all the subcarriers and then selects multiple subcarriers with good performance (e.g., a high signal-to-interference plus noise ratio (SINR)) and feeds back the information on these candidate subcarriers to the base station. The feedback may comprise channel and interference information (e.g., signal-to-interference-plus-noise-ratio information) on all subcarriers or just a portion of subcarriers. In case of providing information on only a portion of the subcarriers, a subscriber may provide a list of subcarriers ordered starting with those subcarriers which the subscriber desires to use, usually because their performance is good or better than that of other subcarriers.
Upon receiving the information from the subscriber, the base station further selects the subcarriers among the candidates, utilizing additional information available at the base station, e.g., the traffic load information on each subcarrier, amount of traffic requests queued at the base station for each frequency band, whether frequency bands are overused, and/or how long a subscriber has been waiting to send information. In one embodiment, the subcarrier loading information of neighboring cells can also be exchanged between base stations. The base stations can use this information in subcarrier allocation to reduce inter-cell interference.
In one embodiment, the selection by the base station of the channels to allocate, based on the feedback, results in the selection of coding/modulation rates. Such coding/modulation rates may be specified by the subscriber when specifying subcarriers that it finds favorable to use. For example, if the SINR is less than a certain threshold (e.g., 12 dB), quadrature phase shift keying (QPSK) modulation is used; otherwise, 16 quadrature amplitude modulation (QAM) is used. Then the base station informs the subscribers about the subcarrier allocation and the coding/modulation rates to use.
In one embodiment, the feedback information for downlink subcarrier allocation is transmitted to the base station through the uplink access channel, which occurs in a short period every transmission time slot, e.g., 400 microseconds in every 10-millisecond time slot. In one embodiment, the access channel occupies the entire frequency bandwidth. Then the base station can collect the uplink SINR of each subcarrier directly from the access channel. The SINR as well as the traffic load information on the uplink subcarriers are used for uplink subcarrier allocation.
For either direction, the base station makes the final decision of subcarrier allocation for each subscriber.
In the following description, a procedure of selective subcarrier allocation is also disclosed, including methods of channel and interference sensing, methods of information feedback from the subscribers to the base station, and algorithms used by the base station for subcarrier selections.
In the following description, numerous details are set forth to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring the present invention.
Some portions of the detailed descriptions which follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
The present invention also relates to apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein.
A machine-readable medium includes any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes read only memory (“ROM”); random access memory (“RAM”); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.); etc.
Subcarrier Clustering
The techniques described herein are directed to subcarrier allocation for data traffic channels. In a cellular system, there are typically other channels, pre-allocated for the exchange of control information and other purposes. These channels often include down link and up link control channels, uplink access channels, and time and frequency synchronization channels.
An Exemplary Subcarrier/Cluster Allocation Procedure
Referring to
Next, each subscriber continuously monitors the reception of the pilot symbols and measures the SINR and/or other parameters, including inter-cell interference and intra-cell traffic, of each cluster (processing block 102). Based on this information, each subscriber selects one or more clusters with good performance (e.g., high SINR and low traffic loading) relative to each other and feeds back the information on these candidate clusters to the base station through predefined uplink access channels (processing block 103). For example, SINR values higher than 10 dB may indicate good performance. Likewise, a cluster utilization factor less than 50% may be indicative of good performance. Each subscriber selects the clusters with relatively better performance than others. The selection results in each subscriber selecting clusters they would prefer to use based on the measured parameters.
In one embodiment, each subscriber measures the SINR of each subcarrier cluster and reports these SINR measurements to their base station through an access channel. The SINR value may comprise the average of the SINR values of each of the subcarriers in the cluster. Alternatively, the SINR value for the cluster may be the worst SINR among the SINR values of the subcarriers in the cluster. In still another embodiment, a weighted averaging of SINR values of the subcarriers in the cluster is used to generate an SINR value for the cluster. This may be particularly useful in diversity clusters where the weighting applied to the subcarriers may be different.
The feedback of information from each subscriber to the base station contains a SINR value for each cluster and also indicates the coding/modulation rate that the subscriber desires to use. No cluster index is needed to indicate which SINR value in the feedback corresponds to which cluster as long as the order of information in the feedback is known to the base station. In an alternative embodiment, the information in the feedback is ordered according to which clusters have the best performance relative to each other for the subscriber. In such a case, an index is needed to indicate to which cluster the accompanying SINR value corresponds.
Upon receiving the feedback from a subscriber, the base station further selects one or more clusters for the subscriber among the candidates (processing block 104). The base station may utilize additional information available at the base station, e.g., the traffic load information on each subcarrier, amount of traffic requests queued at the base station for each frequency band, whether frequency bands are overused, and how long a subscriber has been waiting to send information. The subcarrier loading information of neighboring cells can also be exchanged between base stations. The base stations can use this information in subcarrier allocation to reduce inter-cell interference.
After cluster selection, the base station notifies the subscriber about the cluster allocation through a downlink common control channel or through a dedicated downlink traffic channel if the connection to the subscriber has already been established (processing block 105). In one embodiment, the base station also informs the subscriber about the appropriate modulation/coding rates.
Once the basic communication link is established, each subscriber can continue to send the feedback to the base station using a dedicated traffic channel (e.g., one or more predefined uplink access channels).
In one embodiment, the base station allocates all the clusters to be used by a subscriber at once. In an alternative embodiment, the base station first allocates multiple clusters, referred to herein as the basic clusters, to establish a data link between the base station and the subscriber. The base station then subsequently allocates more clusters, referred to herein as the auxiliary clusters, to the subscriber to increase the communication bandwidth. Higher priorities can be given to the assignment of basic clusters and lower priorities may be given to that of auxiliary clusters. For example, the base station first ensures the assignment of the basic clusters to the subscribers and then tries to satisfy further requests on the auxiliary clusters from the subscribers. Alternatively, the base station may assign auxiliary clusters to one or more subscribers before allocating basic clusters to other subscribers. For example, a base station may allocate basic and auxiliary clusters to one subscriber before allocating any clusters to other subscribers. In one embodiment, the base station allocates basic clusters to a new subscriber and then determines if there are any other subscribers requesting clusters. If not, then the base station allocates the auxiliary clusters to that new subscriber.
From time to time, processing logic performs retraining by repeating the process described above (processing block 106). The retraining may be performed periodically. This retraining compensates for subscriber movement and any changes in interference. In one embodiment, each subscriber reports to the base station its updated selection of clusters and their associated SINRs. Then the base station further performs the reselection and informs the subscriber about the new cluster allocation. Retraining can be initiated by the base station, and in which case, the base station requests a specific subscriber to report its updated cluster selection. Retraining can also be initiated by the subscriber when it observes channel deterioration.
Adaptive Modulation and Coding
In one embodiment, different modulation and coding rates are used to support reliable transmission over channels with different SINR. Signal spreading over multiple subcarriers may also be used to improve the reliability at very low SINR.
An example coding/modulation table is given below in Table 1.
In the example above, ⅛ spreading indicates that one QPSK modulation symbol is repeated over eight subcarriers. The repetition/spreading may also be extended to the time domain. For example, one QPSK symbol can be repeated over four subcarriers of two OFDM symbols, resulting also ⅛ spreading.
The coding/modulation rate can be adaptively changed according to the channel conditions observed at the receiver after the initial cluster allocation and rate selection.
Pilot Symbols and SINR Measurement
In one embodiment, each base station transmits pilot symbols simultaneously, and each pilot symbol occupies the entire OFDM frequency bandwidth, as shown in
A subscriber estimates the SINR for each cluster from the pilot symbols. In one embodiment, the subscriber first estimates the channel response, including the amplitude and phase, as if there is no interference or noise. Once the channel is estimated, the subscriber calculates the interference/noise from the received signal.
The estimated SINR values may be ordered from largest to smallest SINRs and the clusters with large SINR values are selected. In one embodiment, the selected clusters have SINR values that are larger than the minimum SINR which still allows a reliable (albeit low-rate) transmission supported by the system. The number of clusters selected may depend on the feedback bandwidth and the request transmission rate. In one embodiment, the subscriber always tries to send the information about as many clusters as possible from which the base station chooses.
The estimated SINR values are also used to choose the appropriate coding/modulation rate for each cluster as discussed above. By using an appropriate SINR indexing scheme, an SINR index may also indicate a particular coding and modulation rate that a subscriber desires to use. Note that even for the same subscribers, different clusters can have different modulation/coding rates.
Pilot symbols serve an additional purpose in determining interference among the cells. Since the pilots of multiple cells are broadcast at the same time, they will interfere with each other (because they occupy the entire frequency band). This collision of pilot symbols may be used to determine the amount of interference as a worst case scenario. Therefore, in one embodiment, the above SINR estimation using this method is conservative in that the measured interference level is the worst-case scenario, assuming that all the interference sources are on. Thus, the structure of pilot symbols is such that it occupies the entire frequency band and causes collisions among different cells for use in detecting the worst case SINR in packet transmission systems.
During data traffic periods, the subscribers can determine the level of interference again. The data traffic periods are used to estimate the intra-cell traffic as well as the inter-cell interference level. Specifically, the power difference during the pilot and traffic periods may be used to sense the (intra-cell) traffic loading and inter-cell interference to select the desirable clusters.
The interference level on certain clusters may be lower, because these clusters may be unused in the neighboring cells. For example, in cell A, with respect to cluster A there is less interference because cluster A is unused in cell B (while it is used in cell C). Similarly, in cell A, cluster B will experience lower interference from cell B because cluster B is used in cell B but not in cell C.
The modulation/coding rate based on this estimation is robust to frequent interference changes resulted from bursty packet transmission. This is because the rate prediction is based on the worst case situation in which all interference sources are transmitting.
In one embodiment, a subscriber utilizes the information available from both the pilot symbol periods and the data traffic periods to analyze the presence of both the intra-cell traffic load and inter-cell interference. The goal of the subscriber is to provide an indication to the base station as to those clusters that the subscriber desires to use. Ideally, the result of the selection by the subscriber is clusters with high channel gain, low interference from other cells, and high availability. The subscriber provides feedback information that includes the results, listing desired clusters in order or not as described herein.
Referring to
Cluster ordering and rate prediction processing block 303 is coupled to outputs of channel/interference estimation processing block 301 and traffic/interference analysis processing block 302 to perform cluster ordering and selection along with rate prediction.
The output of cluster ordering processing block 303 is input to cluster request processing block 304, which requests clusters and modulation/coding rates. Indications of these selections are sent to the base station. In one embodiment, the SINR on each cluster is reported to the base station through an access channel. The information is used for cluster selection to avoid clusters with heavy intra-cell traffic loading and/or strong interference from other cells. That is, a new subscriber may not be allocated use of a particular cluster if heavy intra-cell traffic loading already exists with respect to that cluster. Also, clusters may not be allocated if the interference is so strong that the SINR only allows for low-rate transmission or no reliable transmission at all.
The channel/interference estimation by processing block 301 is well-known in the art by monitoring the interference that is generated due to full-bandwidth pilot symbols being simultaneously broadcast in multiple cells. The interface information is forwarded to processing block 302 which uses the information to solve the following equation:
HiSi+Ii+ni=yi
where Si represents the signal for subcarrier (freq. band) i, Ii is the interference for subcarrier i, ni is the noise associated with subcarrier i, and yi is the observation for subcarrier i. In the case of 512 subcarriers, i may range from 0 to 511. The Ii and ni are not separated and may be considered one quantity. The interference/noise and channel gain Hi are not known. During pilot periods, the signal Si representing the pilot symbols, and the observation yi are knowns, thereby allowing determination of the channel gain Ht for the case where there is no interference or noise. Once this is known, it may be plugged back into the equation to determine the interference/noise during data periods since Hi, Si and yi are all known.
The interference information from processing blocks 301 and 302 are used by the subscriber to select desirable clusters. In one embodiment, using processing block 303, the subscriber orders clusters and also predicts the data rate that would be available using such clusters. The predicted data rate information may be obtained from a look up table with precalculated data rate values. Such a look up table may store the pairs of each SINR and its associated desirable transmission rate. Based on this information, the subscriber selects clusters that it desires to use based on predetermined performance criteria. Using the ordered list of clusters, the subscriber requests the desired clusters along with coding and modulation rates known to the subscriber to achieve desired data rates.
Referring to
More specifically, in one embodiment, the signal power of each cluster during the pilot periods is compared with that during the traffic periods, according to the following:
where PP is the measured power corresponding to each cluster during pilot periods, PD is the measured power during the traffic periods, PS is the signal power, PI is the interference power, and PN is the noise power.
In one embodiment, the subscriber selects clusters with relatively large PP/(PP−PD) (e.g., larger than a threshold such as 10 dB) and avoids clusters with low PP/(PP−PD) (e.g., lower than a threshold such as 10 dB) when possible.
Alternatively, the difference may be based on the energy difference between observed samples during the pilot period and during the data traffic period for each of the subcarriers in a cluster such as the following:
Δi=|yiP|−|yiD|
Thus, the subscriber sums the differences for all subcarriers.
Depending on the actual implementation, a subscriber may use the following metric, a combined function of both SINR and PP−PD, to select the clusters:
β=ƒ(SINR, PP/(PP−PD)
where ƒ is a function of the two inputs. One example of ƒ is weighted averaging (e.g., equal weights). Alternatively, a subscriber selects a cluster based on its SINR and only uses the power difference PP−PD to distinguish clusters with similar SINR. The difference may be smaller than a threshold (e.g., 1 dB).
Both the measurement of SINR and PP−PD can be averaged over time to reduce variance and improve accuracy. In one embodiment, a moving-average time window is used that is long enough to average out the statistical abnormity yet short enough to capture the time-varying nature of channel and interference, e.g., 1 millisecond.
Feedback Format for Downlink Cluster Allocation
In one embodiment, for the downlink, the feedback contains both the indices of selected clusters and their SINR. An exemplary format for arbitrary cluster feedback is shown in
Typically, an index to the SINR level, instead of the SINR itself is sufficient to indicate the appropriate coding/modulation for the cluster. For example, a 3-bit field can be used for SINR indexing to indicate 8 different rates of adaptive coding/modulation.
The base station assigns desirable clusters to the subscriber making the request. In one embodiment, the availability of the cluster for allocation to a subscriber depends on the total traffic load on the cluster. Therefore, the base station selects the clusters not only with high SINR, but also with low traffic load.
In one embodiment, controller 1301 also performs admission control to user access since it knows the traffic load of the system. This may be performed by controlling user data buffers 1302 using admission control signals 1310.
The packet data of User 1˜N are stored in the user data buffers 1302. For downlink, with the control of controller 1301, multiplexer 1303 loads the user data to cluster data buffers (for Cluster 1˜M) waiting to be transmitted. For the uplink, multiplexer 1303 sends the data in the cluster buffers to the corresponding user buffers. Cluster buffer 1304 stores the signal to be transmitted through OFDM transceiver 1305 (for downlink) and the signal received from transceiver 1305. In one embodiment, each user might occupy multiple clusters and each cluster might be shared by multiple users (in a time-division-multiplexing fashion).
Group-Based Cluster Allocation
In another embodiment, for the downlink, the clusters are partitioned into groups. Each group can include multiple clusters.
Goals of group-based cluster allocation include reducing the data bits for cluster indexing, thereby reducing the bandwidth requirements of the feedback channel (information) and control channel (information) for cluster allocation. Group-based cluster allocation may also be used to reduce inter-cell interference.
After receiving the pilot signal from the base station, a subscriber sends back the channel information on one or more cluster groups, simultaneously or sequentially. In one embodiment, only the information on some of the groups is sent back to the base station. Many criteria can be used to choose and order the groups, based on the channel information, the inter-cell interference levels, and the intra-cell traffic load on each cluster.
In one embodiment, a subscriber first selects the group with the best overall performance and then feedbacks the SINR information for the clusters in that group. The subscriber may order the groups based on their number of clusters for which the SINR is higher than a predefined threshold. By transmitting the SINR of all the clusters in the group sequentially, only the group index, instead of all the cluster indices, needs to be transmitted. Thus, the feedback for each group generally contains two types of information: the group index and the SINR value of each cluster within the group.
Upon receiving the feedback information from the subscriber, the cluster allocator at the base station selects multiple clusters from one or more groups, if available, and then assigns the clusters to the subscriber. This selection may be performed by an allocation in a media access control portion of the base station.
Furthermore, in a multi-cell environment, groups can have different priorities associated with different cells. In one embodiment, the subscriber's selection of a group is biased by the group priority, which means that certain subscribers have higher priorities on the usage of some groups than the other subscribers.
In one embodiment, there is no fixed association between one subscriber and one cluster group; however, in an alternative embodiment there may be such a fixed association. In an implementation having a fixed association between a subscriber and one or more cluster groups, the group index in the feedback information can be omitted, because this information is known to both subscriber and base station by default.
In another embodiment, the pilot signal sent from the base station to the subscriber also indicates the availability of each cluster, e.g., the pilot signal shows which clusters have already been allocated for other subscribers and which clusters are available for new allocations. For example, the base station can transmit a pilot sequence 1111 1111 on the subcarriers of a cluster to indicate that the cluster is available, and 1111 −1−1−1−1 to indicate the cluster is not available. At the receiver, the subscriber first distinguishes the two sequences using the signal processing methods which are well known in the art, e.g., the correlation methods, and then estimates the channel and interference level.
With the combination of this information and the channel characteristics obtained by the subscriber, the subscriber can prioritize the groups to achieve both high SINR and good load balancing.
In one embodiment, the subscriber protects the feedback information by using error correcting codes. In one embodiment, the SINR information in the feedback is first compressed using source coding techniques, e.g., differential encoding, and then encoded by the channel codes.
Consider the downlink signaling with omni-directional antennas at the subscribers. From
Sector A1 receives interference from Sector C1, but its transmission interferes with Sector B1. Namely, its interference source and the victims with which it interferes are not the same. This might cause a stability problem in a distributed cluster-allocation system using interference avoidance: if a frequency cluster is assigned in Sector B1 but not in Sector C1, the cluster may be assigned in A1 because it may be seen as clean in A1. However, the assignment of this cluster A1 can cause interference problem to the existing assignment in B1.
In one embodiment, different cluster groups are assigned different priorities for use in different cells to alleviate the aforementioned problem when the traffic load is progressively added to a sector. The priority orders are jointly designed such that a cluster can be selectively assigned to avoid interference from its interference source, while reducing, and potentially minimizing, the probability of causing interference problem to existing assignments in other cells.
Using the aforementioned example, the odd clusters (used by the shaded sectors) are partitioned into 3 groups: Group 1,2,3. The priority orders are listed in Table 2.
Consider Sector A1. First, the clusters in Group 1 are selectively assigned. If there are still more subscribers demanding clusters, the clusters in Group 2 are selectively assigned to subscribers, depending on the measured SINR (avoiding the clusters receiving strong interference from Sector C1). Note that the newly assigned clusters from Group 2 to Sector A1 shall not cause interference problem in Sector B1, unless the load in Sector B1 is so heavy that the clusters in both Group 3 and 1 are used up and the clusters in Group 2 are also used. Table 3 shows the cluster usage when less than ⅔ of all the available clusters are used in Sector A1, B1, and C1.
Table 4 shows the priority orders for the unshaded sectors, which are different from those for the shaded sectors, since the interfering relationship is reversed.
Intelligent Switching Between Coherence and Diversity Clusters
In one embodiment, there are two categories of clusters: coherence clusters, containing multiple subcarriers close to each other and diversity clusters, containing multiple subcarriers with at least some of the subcarriers spread far apart over the spectrum. The closeness of the multiple subcarriers in coherence clusters is preferably within the channel coherence bandwidth, i.e. the bandwidth within which the channel response remains roughly the same, which is typically within 100 kHz for many cellular systems. On the other hand, the spread of subcarriers in diversity clusters is preferably larger than the channel coherence bandwidth, typically within 100 kHz for many cellular systems. Of course, the larger the spread, the better the diversity. Therefore, a general goal in such cases is to maximize the spread.
Since the subcarriers in a coherence cluster are consecutive or close (e.g., within the coherent bandwidth) to each other, they are likely within the coherent bandwidth of the channel fading. Therefore, the channel gain of a coherence cluster can vary significantly and cluster selection can greatly improve the performance. On the other hand, the average channel gain of a diversity cluster has less of a degree of variation due to the inherent frequency diversity among the multiple subcarriers spread over the spectrum. With channel coding across the subcarriers within the cluster, diversity clusters are more robust to cluster mis-selection (by the nature of diversification itself), while yielding possibly less gain from cluster selection. Channel coding across the subcarriers means that each codeword contains bits transmitted from multiple subcarriers, and more specifically, the difference bits between codewords (error vector) are distributed among multiple subcarriers.
More frequency diversity can be obtained through subcarrier hopping over time in which a subscriber occupies a set of subcarriers at one time slot and another different set of subcarriers at a different time slot. One coding unit (frame) contains multiple such time slots and the transmitted bits are encoded across the entire frame.
The manner in which the subscriber changes the subcarriers (hopping sequences) can be different for different cells in order to achieve better interference averaging through coding.
For static subscribers, such as in fixed wireless access, the channels change very little over time. Selective cluster allocation using the coherence clusters achieves good performance. On the other hand, for mobile subscribers, the channel time variance (the variance due to changes in the channel over time) can be very large. A high-gain cluster at one time can be in deep fade at another. Therefore, cluster allocation needs to be updated at a rapid rate, causing significant control overhead. In this case, diversity clusters can be used to provide extra robustness and to alleviate the overhead of frequent cluster reallocation. In one embodiment, cluster allocation is performed faster than the channel changing rate, which is often measured by the channel Doppler rate (in Hz), i.e. how many cycles the channel changes per second where the channel is completely different after one cycle. Note that selective cluster allocation can be performed on both coherence and diversity clusters.
In one embodiment, for cells containing mixed mobile and fixed subscribers, a channel/interference variation detector can be implemented at either the subscriber or the base station, or both. Using the detection results, the subscriber and the base station intelligently selects diversity clusters to mobile subscribers or fixed subscribers at cell boundaries, and coherence clusters to fixed subscribers close to the base station. The channel/interference variation detector measures the channel (SINR) variation from time to time for each cluster. For example, in one embodiment, the channel/interference detector measures the power difference between pilot symbols for each cluster and averages the difference over a moving window (e.g., 4 time slots). A large difference indicates that channel/interference changes frequently and subcarrier allocation may be not reliable. In such a case, diversity clusters are more desirable for the subscriber.
Referring to
In one embodiment, the base station determines whether a subscriber is mobile or fixed by detecting a rate of change of pilot signals, or the normalized channel variation, and determining that the rate of change is greater than a predetermined threshold. The normalized instantaneous difference between channels may be represented as
where Hi represents the channel and i is the index to represent the individual channels.
The threshold is system dependent. For example, the rate of change is greater than 10% (although any percentage (e.g., 20%) could be used), then the base station concludes that the subscriber is mobile. In one embodiment, if the constant period in signaling is not greater than a multiple of the round trip delay (e.g., 5 times the round trip delay), then the base station determines that the subscriber is mobile and allocates diversity clusters; otherwise, the base station allocates coherence clusters.
The selection can be updated and intelligently switched during retraining.
The ratio/allocation of the numbers of coherence and diversity clusters in a cell depends on the ratio of the population of mobile and fixed subscribers. When the population changes as the system evolves, the allocation of coherence and diversity clusters can be reconfigured to accommodate the new system needs.
Whereas many alterations and modifications of the present invention will no doubt become apparent to a person of ordinary skill in the art after having read the foregoing description, it is to be understood that any particular embodiment shown and described by way of illustration is in no way intended to be considered limiting. Therefore, references to details of various embodiments are not intended to limit the scope of the claims which in themselves recite only those features regarded as essential to the invention.
This is a Continuation of U.S. patent application Ser. No. 11/931,926, filed Oct. 31, 2007, entitled OFDMA WITH ADAPTIVE SUBCARRIER-CLUSTER CONFIGURATION AND SELECTIVE LOADING, which is a Continuation of U.S. patent Ser. No. 11/199,586 filed Aug. 8, 2005, entitled OFDMA WITH ADAPTIVE SUBCARRIER-CLUSTER CONFIGURATION AND SELECTIVE LOADING, which is a Continuation of U.S. Pat. No. 6,947,748 issued Sep. 20, 2005, entitled OFDMA WITH ADAPTIVE SUBCARRIER-CLUSTER CONFIGURATION AND SELECTIVE LOADING, the disclosures of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4355411 | Reudink et al. | Oct 1982 | A |
4670889 | Hewitt et al. | Jun 1987 | A |
5038399 | Bruckert | Aug 1991 | A |
5239676 | Strawczynski et al. | Aug 1993 | A |
5280630 | Wang | Jan 1994 | A |
5282222 | Fattouche et al. | Jan 1994 | A |
5437054 | Rappaport et al. | Jul 1995 | A |
5471647 | Gerlach et al. | Nov 1995 | A |
5479447 | Chow et al. | Dec 1995 | A |
5491837 | Haartsen | Feb 1996 | A |
5504775 | Chouly et al. | Apr 1996 | A |
5507034 | Bodin et al. | Apr 1996 | A |
5515378 | Roy, III et al. | May 1996 | A |
5555268 | Fattouche et al. | Sep 1996 | A |
5588020 | Schilling | Dec 1996 | A |
5634199 | Gerlach et al. | May 1997 | A |
5708973 | Ritter | Jan 1998 | A |
5726978 | Frodigh et al. | Mar 1998 | A |
5732353 | Haartsen | Mar 1998 | A |
5734967 | Kotzin et al. | Mar 1998 | A |
5764699 | Needham et al. | Jun 1998 | A |
5774808 | Sarkioja et al. | Jun 1998 | A |
5822372 | Emami | Oct 1998 | A |
5839074 | Plehn et al. | Nov 1998 | A |
5867478 | Baum et al. | Feb 1999 | A |
5884145 | Haartsen | Mar 1999 | A |
5886988 | Yun et al. | Mar 1999 | A |
5887245 | Lindroth et al. | Mar 1999 | A |
5909436 | Engstrom et al. | Jun 1999 | A |
5914933 | Cimini et al. | Jun 1999 | A |
5933421 | Alamouti et al. | Aug 1999 | A |
5956642 | Larsson et al. | Sep 1999 | A |
5973642 | Li et al. | Oct 1999 | A |
5991273 | Abu-Dayya et al. | Nov 1999 | A |
6005876 | Cimini, Jr. et al. | Dec 1999 | A |
6009332 | Haartsen | Dec 1999 | A |
6009553 | Martinez et al. | Dec 1999 | A |
6023622 | Plaschke et al. | Feb 2000 | A |
6026123 | Williams | Feb 2000 | A |
6038450 | Brink et al. | Mar 2000 | A |
6041237 | Farsakh et al. | Mar 2000 | A |
6052594 | Chuang et al. | Apr 2000 | A |
6061568 | Dent | May 2000 | A |
6064692 | Chow | May 2000 | A |
6064694 | Clark et al. | May 2000 | A |
6067290 | Paulraj et al. | May 2000 | A |
6091717 | Honkasalo et al. | Jul 2000 | A |
6108374 | Balachandran et al. | Aug 2000 | A |
6111919 | Yonge, III | Aug 2000 | A |
6131016 | Greenstein et al. | Oct 2000 | A |
6141565 | Feuerstein et al. | Oct 2000 | A |
6144696 | Shively et al. | Nov 2000 | A |
6192026 | Pollack et al. | Feb 2001 | B1 |
6208663 | Schramm et al. | Mar 2001 | B1 |
6212388 | Seo | Apr 2001 | B1 |
6226320 | Hakkinen et al. | May 2001 | B1 |
6253063 | Cudak et al. | Jun 2001 | B1 |
6276297 | van den Berg et al. | Aug 2001 | B1 |
6282185 | Hakkinen et al. | Aug 2001 | B1 |
6298092 | Heath, Jr. et al. | Oct 2001 | B1 |
6304593 | Alouini et al. | Oct 2001 | B1 |
6307851 | Jung et al. | Oct 2001 | B1 |
6327472 | Westroos et al. | Dec 2001 | B1 |
6330460 | Wong et al. | Dec 2001 | B1 |
6351499 | Paulraj et al. | Feb 2002 | B1 |
6351643 | Haartsen | Feb 2002 | B1 |
6366195 | Harel et al. | Apr 2002 | B1 |
6377632 | Paulraj et al. | Apr 2002 | B1 |
6377636 | Paulraj et al. | Apr 2002 | B1 |
6400699 | Airy et al. | Jun 2002 | B1 |
6404783 | Cimini, Jr. et al. | Jun 2002 | B1 |
6405044 | Smith et al. | Jun 2002 | B1 |
6405048 | Haartsen | Jun 2002 | B1 |
6411186 | Lilleberg et al. | Jun 2002 | B1 |
6415153 | Liew | Jul 2002 | B1 |
6424836 | Gil et al. | Jul 2002 | B1 |
6449246 | Barton et al. | Sep 2002 | B1 |
6463096 | Raleigh et al. | Oct 2002 | B1 |
6463296 | Esmailzadeh et al. | Oct 2002 | B1 |
6470044 | Kowalski | Oct 2002 | B1 |
6473467 | Wallace et al. | Oct 2002 | B1 |
6477158 | Take et al. | Nov 2002 | B1 |
6487253 | Jones, IV et al. | Nov 2002 | B1 |
6493331 | Walton et al. | Dec 2002 | B1 |
6496490 | Andrews et al. | Dec 2002 | B1 |
6501785 | Chang et al. | Dec 2002 | B1 |
6526281 | Gorsuch et al. | Feb 2003 | B1 |
6539233 | Taketsugu et al. | Mar 2003 | B1 |
6545997 | Bohnke et al. | Apr 2003 | B1 |
6553001 | Indira | Apr 2003 | B1 |
6553234 | Florea | Apr 2003 | B1 |
6567383 | Bohnke et al. | May 2003 | B1 |
6567387 | Dulin et al. | May 2003 | B1 |
6574476 | Williams | Jun 2003 | B1 |
6600776 | Alamouti et al. | Jul 2003 | B1 |
6654612 | Avidor et al. | Nov 2003 | B1 |
6657949 | Jones, IV et al. | Dec 2003 | B1 |
6693884 | Gutowski | Feb 2004 | B1 |
6694147 | Viswanath et al. | Feb 2004 | B1 |
6699784 | Xia et al. | Mar 2004 | B2 |
6701129 | Hashem et al. | Mar 2004 | B1 |
6721159 | Takashige et al. | Apr 2004 | B2 |
6726297 | Uesugi et al. | Apr 2004 | B1 |
6760882 | Gesbert et al. | Jul 2004 | B1 |
6782037 | Krishnamoorthy et al. | Aug 2004 | B1 |
6788349 | Wu et al. | Sep 2004 | B2 |
6795424 | Kapoor et al. | Sep 2004 | B1 |
6826240 | Thomas et al. | Nov 2004 | B1 |
6834045 | Lappetelainen et al. | Dec 2004 | B1 |
6862272 | Dulin et al. | Mar 2005 | B2 |
6870808 | Liu et al. | Mar 2005 | B1 |
6892059 | Kim et al. | May 2005 | B1 |
6904030 | Lee et al. | Jun 2005 | B2 |
6904283 | Li et al. | Jun 2005 | B2 |
6907244 | Santhoff et al. | Jun 2005 | B2 |
6920122 | Hanaoka et al. | Jul 2005 | B1 |
6922445 | Sampath et al. | Jul 2005 | B1 |
6928120 | Zhang | Aug 2005 | B1 |
6944120 | Wu et al. | Sep 2005 | B2 |
6947748 | Li et al. | Sep 2005 | B2 |
6961364 | Laroia et al. | Nov 2005 | B1 |
6985432 | Hadad et al. | Jan 2006 | B1 |
6996075 | Santhoff et al. | Feb 2006 | B2 |
6996100 | Haartsen | Feb 2006 | B1 |
7047011 | Wikman et al. | May 2006 | B1 |
7068628 | Li et al. | Jun 2006 | B2 |
7072315 | Liu et al. | Jul 2006 | B1 |
7095719 | Wilhelmsson et al. | Aug 2006 | B1 |
7133352 | Hadad | Nov 2006 | B1 |
7133380 | Winters et al. | Nov 2006 | B1 |
7146172 | Li et al. | Dec 2006 | B2 |
7203191 | Garcia-Luna-Aceves et al. | Apr 2007 | B2 |
7224741 | Hadad | May 2007 | B1 |
7230908 | Vanderaar et al. | Jun 2007 | B2 |
7373151 | Ahmed | May 2008 | B1 |
7379742 | Li et al. | May 2008 | B2 |
7715358 | Li et al. | May 2010 | B2 |
20020114269 | Onggosanusi et al. | Aug 2002 | A1 |
20030067890 | Goel et al. | Apr 2003 | A1 |
20030169681 | Li et al. | Sep 2003 | A1 |
20030169824 | Chayat | Sep 2003 | A1 |
20030211831 | Xu et al. | Nov 2003 | A1 |
20050025099 | Heath et al. | Feb 2005 | A1 |
Number | Date | Country |
---|---|---|
1245623 | Feb 2000 | CN |
198 00 953 | Jul 1999 | DE |
198 00 953 | Jul 1999 | DE |
0 869 647 | Oct 1998 | EP |
0 869 647 | Oct 1998 | EP |
0 926 912 | Jun 1999 | EP |
0 929 202 | Jul 1999 | EP |
0999658 | May 2000 | EP |
2 777 407 | Oct 1999 | FR |
2 209 858 | May 1989 | GB |
1-317035 | Dec 1989 | JP |
06029922 | Feb 1994 | JP |
7-322219 | Dec 1995 | JP |
10-303849 | Nov 1998 | JP |
11-088244 | Mar 1999 | JP |
11-508417 | Jul 1999 | JP |
11-308153 | Nov 1999 | JP |
1999-28244 | Apr 1999 | KR |
WO-9619055 | Jun 1996 | WO |
WO-9701256 | Jan 1997 | WO |
WO-9816077 | Apr 1998 | WO |
WO-9830047 | Jul 1998 | WO |
PCTJP00004121 | Jun 2000 | WO |
WO-02 49305 | Jun 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20100238833 A1 | Sep 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11931926 | Oct 2007 | US |
Child | 12748781 | US | |
Parent | 11199586 | Aug 2005 | US |
Child | 11931926 | US | |
Parent | 09738086 | Dec 2000 | US |
Child | 11199586 | US |