US 8,036,199 B2Grant
OFDMA with adaptive subcarrier-cluster configuration and selective loading
Issue Date:2011-10-11
•20 Claims
•8 Drawing Sheets
Abstract
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.
Metadata
Assignee
- Adaptix, Inc.
Inventors
- Xiaodong Li
- Hui Liu
- Wenzhong Zhang
- Kemin Li
Application Information
Application Number:US 12/748,781
Filing Date:2010-03-29
Priority Date:2000-12-15
Art Unit:2617
Classifications
IPC:
H04W4/00H04J1/00H04B7/208
Patent Drawings (8 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] 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.
FIELD OF THE INVENTION
[0002] 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).
BACKGROUND OF THE INVENTION
[0003] 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.
[0004] 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.
[0005] 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.
[0006] 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.
[0007] 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.
SUMMARY OF THE INVENTION
[0008] 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.
BRIEF DESCRIPTION OF THE DRAWINGS
[0009] 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.
[0010] FIG. 1A illustrates subcarriers and clusters.
[0011] FIG. 1B is a flow diagram of one embodiment of a process for allocating subcarriers.
[0012] FIG. 2 illustrates time and frequency grid of OFDM symbols, pilots and clusters.
[0013] FIG. 3 illustrates subscriber processing.
[0014] FIG. 4 illustrates one example of FIG. 3 .
[0015] FIG. 5 illustrates one embodiment of a format for arbitrary cluster feedback.
[0016] FIG. 6 illustrates one embodiment of a partition the clusters into groups.
[0017] FIG. 7 illustrates one embodiment of a feedback format for group-based cluster allocation.
[0018] FIG. 8 illustrates frequency reuse and interference in a multi-cell, multi-sector network.
[0019] FIG. 9 illustrates different cluster formats for coherence clusters and diversity clusters.
[0020] FIG. 10 illustrates diversity clusters with subcarrier hopping.
[0021] FIG. 11 illustrates intelligent switching between diversity clusters and coherence clusters depending on subscribers mobility.
[0022] FIG. 12 illustrates one embodiment of a reconfiguration of cluster classification.
[0023] FIG. 13 illustrates one embodiment of a base station.
DETAILED DESCRIPTION OF THE PRESENT INVENTION
[0024] 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.
[0025] 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.
[0026] 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.
[0027] 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.
[0028] 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.
[0029] 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.
[0030] For either direction, the base station makes the final decision of subcarrier allocation for each subscriber.
[0031] 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.
[0032] 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.
[0033] 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.
[0034] 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.
[0035] 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.
[0036] 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.
[0037] 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
[0038] 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.
[0039] FIG. 1A illustrates multiple subcarriers, such as subcarrier 101, and cluster 102. A cluster, such as cluster 102, is defined as a logical unit that contains at least one physical subcarrier, as shown in FIG. 1A . A cluster can contain consecutive or disjoint subcarriers. The mapping between a cluster and its subcarriers can be fixed or reconfigurable. In the latter case, the base station informs the subscribers when the clusters are redefined. In one embodiment, the frequency spectrum includes 512 subcarriers and each cluster includes four consecutive subcarriers, thereby resulting in 128 clusters.
An Exemplary Subcarrier/Cluster Allocation Procedure
[0040] FIG. 1B is a flow diagram of one embodiment of a process for allocation clusters to subscribers. The process is performed by processing logic that may comprise hardware (e.g., dedicated logic, circuitry, etc.), software (such as that which runs on, for example, a general purpose computer system or dedicated machine), or a combination of both.
[0041] Referring to FIG. 1B , each base station periodically broadcasts pilot OFDM symbols to every subscriber within its cell (or sector) (processing block 101). The pilot symbols, often referred to as a sounding sequence or signal, are known to both the base station and the subscribers. In one embodiment, each pilot symbol covers the entire OFDM frequency bandwidth. The pilot symbols may be different for different cells (or sectors). The pilot symbols can serve multiple purposes: time and frequency synchronization, channel estimation and signal-to-interference/noise (SINR) ratio measurement for cluster allocation.
[0042] 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.
[0043] 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.
[0044] 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.
[0045] 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.
[0046] 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.
[0047] 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).
[0048] 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.
[0049] 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
[0050] 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.
[0051] An example coding/modulation table is given below in Table 1.
[0052]
| TABLE 1 | ||
|---|---|---|
| Scheme | Modulation | Code Rate |
| 0 | QPSK, ⅛ Spreading | ½ |
| 1 | QPSK, ¼ Spreading | ½ |
| 2 | QPSK, ½ Spreading | ½ |
| 3 | QPSK | ½ |
| 4 | 8PSK | ⅔ |
| 5 | 16QAM | ¾ |
| 6 | 64QAM | ⅚ |
[0053] 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.
[0054] 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
[0055] In one embodiment, each base station transmits pilot symbols simultaneously, and each pilot symbol occupies the entire OFDM frequency bandwidth, as shown in FIGS. 2A-C . Referring to FIGS. 2A-C , pilot symbols 201 are shown traversing the entire OFDM frequency bandwidth for cells A, B and C, respectively. In one embodiment, each of the pilot symbols have a length or duration of 128 microseconds with a guard time, the combination of which is approximately 152 microseconds. After each pilot period, there are a predetermined number of data periods followed by another set of pilot symbols. In one embodiment, there are four data periods used to transmit data after each pilot, and each of the data periods is 152 microseconds.
[0056] 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.
[0057] 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.
[0058] 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.
[0059] 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.
[0060] 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.
[0061] 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.
[0062] 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.
[0063] 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.
[0064] FIG. 3 illustrates one embodiment of subscriber processing. The processing is performed by processing logic that may comprise hardware (e.g., dedicated logic, circuitry, etc.), software (such as that which runs on, for example, a general purpose computer system or dedicated machine), or a combination of both.
[0065] Referring to FIG. 3 , channel/interference estimation processing block 301 performs channel and interference estimation in pilot periods in response to pilot symbols. Traffic/interference analysis processing block 302 performs traffic and interference analysis in data periods in response to signal information and information from channel/interference estimation block 301.
[0066] 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.
[0067] 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.
[0068] 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.
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.
[0069] 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.
[0070] FIG. 4 is one embodiment of an apparatus for the selection of clusters based on power difference. The approach uses information available during both pilot symbol periods and data traffic periods to perform energy detection. The processing of FIG. 4 may be implemented in hardware, (e.g., dedicated logic, circuitry, etc.), software (such as is run on, for example, a general purpose computer system or dedicated machine), or a combination of both.
[0071] Referring to FIG. 4 , a subscriber includes SINR estimation processing block 401 to perform SINR estimation for each cluster in pilot periods, power calculation processing block 402 to perform power calculations for each cluster in pilot periods, and power calculation processing block 403 to perform power calculations in data periods for each cluster. Subtractor 404 subtracts the power calculations for data periods from processing block 403 from those in pilot periods from processing block 402. The output of subtractor 404 is input to power difference ordering (and group selection) processing block 405 that performs cluster ordering and selection based on SINR and the power difference between pilot periods and data periods. Once the clusters have been selected, the subscriber requests the selected clusters and the coding/modulation rates with processing block 406.
[0072] 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:
[0073]
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.
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.
[0074] 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.
[0075] 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.
Δi=|yiP|−|yiD|
Thus, the subscriber sums the differences for all subcarriers.
[0076] 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).
β=ƒ(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).
[0077] 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
[0078] 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 FIG. 5 . Referring to FIG. 5 , the subscriber provides a cluster index (ID) to indicate the cluster and its associated SINR value. For example, in the feedback, the subscriber provides cluster ID1 (501) and the SINR for the cluster, SINR1 (502), cluster ID2 (503) and the SINR for the cluster, SINR2 (504), and cluster ID3 (505), and the SINR for the cluster, SINR3 (506), etc. The SINR for the cluster may be created using an average of the SINRs of the subcarriers. Thus, multiple arbitrary clusters can be selected as the candidates. As discussed above, the selected clusters can also be ordered in the feedback to indicate priority. In one embodiment, the subscriber may form a priority list of clusters and sends back the SINR information in a descending order of priority.
[0079] 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.
An Exemplary Base Station
[0080] 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.
[0081] FIG. 13 is a block diagram of one embodiment of a base station. Referring to FIG. 13 , cluster allocation and load scheduling controller 1301 (cluster allocator) collects all the necessary information, including the downlink/uplink SINR of clusters specified for each subscriber (e.g., via SINR/rate indices signals 1313 received from OFDM transceiver 1305) and user data, queue fullness/traffic load (e.g., via user data buffer information 1311 from multi-user data buffer 1302). Using this information, controller 1301 makes the decision on cluster allocation and load scheduling for each user, and stores the decision information in a memory (not shown). Controller 1301 informs the subscribers about the decisions through control signal channels (e.g., control signal/cluster allocation 1312 via OFDM transceiver 1305). Controller 1301 updates the decisions during retraining.
[0082] 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.
[0083] 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
[0084] In another embodiment, for the downlink, the clusters are partitioned into groups. Each group can include multiple clusters. FIG. 6 illustrates an exemplary partitioning. Referring to FIG. 6 , groups 1-4 are shown with arrows pointing to clusters that are in each group as a result of the partitioning. In one embodiment, the clusters within each group are spaced far apart over the entire bandwidth. In one embodiment, the clusters within each group are spaced apart farther than the channel coherence bandwidth, i.e. the bandwidth within which the channel response remains roughly the same. A typical value of coherence bandwidth is 100 kHz for many cellular systems. This improves frequency diversity within each group and increases the probability that at least some of the clusters within a group can provide high SINR. The clusters may be allocated in groups.
[0085] 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.
[0086] 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.
[0087] 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. FIG. 7 illustrates an exemplary format for indicating a group-based cluster allocation. Referring to FIG. 7 , a group ID, ID1, is followed by the SINR values for each of the clusters in the group. This can significantly reduce the feedback overhead.
[0088] 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.
[0089] 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.
[0090] 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.
[0091] 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.
[0092] 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.
[0093] 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.
[0094] FIG. 8 shows one embodiment of a frequency reuse pattern for an exemplary cellular set up. Each cell has hexagonal structure with six sectors using directional antennas at the base stations. Between the cells, the frequency reuse factor is one. Within each cell, the frequency reuse factor is 2 where the sectors use two frequencies alternatively. As shown in FIG. 8 , each shaded sector uses half of the available OFDMA clusters and each unshaded sector uses the other half of the clusters. Without loss of generality, the clusters used by the shaded sectors are referred to herein as odd clusters and those used by the unshaded sectors are referred to herein as even clusters.
[0095] Consider the downlink signaling with omni-directional antennas at the subscribers. From FIG. 8 , it is clear that for the downlink in the shaded sectors, Cell A interferes with Cell B, which in turn interferes with Cell C, which in turn interferes with Cell A, namely, A->B->C->A. For the unshaded sectors, Cell A interferes with Cell C, which in turn interferes with Cell B, which in turn interferes with Cell A, namely, A->C->B->A.
[0096] 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.
[0097] 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.
[0098] 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.
[0099]
| TABLE 2 | ||||
|---|---|---|---|---|
| Priority ordering for the downlink of the shaded sectors. Table | ||||
| Priority | ||||
| Ordering | Cell A | Cell B | Cell C | |
| 1 | Group 1 | Group 3 | Group 2 | |
| 2 | Group 2 | Group 1 | Group 3 | |
| 3 | Group 3 | Group 2 | Group 1 | |
[0100] 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.
[0101]
| TABLE 3 | ||||
|---|---|---|---|---|
| Cluster usage for the downlink of the shaded sectors with less than | ||||
| ⅔ of the full load. | ||||
| Cluster Usage | Cell A | Cell B | Cell C | |
| 1 | Group 1 | Group 3 | Group 2 | |
| 2 | Group 2 | Group 1 | Group 3 | |
| 3 | ||||
[0102] 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.
[0103]
Intelligent Switching Between Coherence and Diversity Clusters
| TABLE 4 | ||||
|---|---|---|---|---|
| Priority ordering for the downlink of the unshaded sectors. | ||||
| Priority Ordering | Cell A | Cell B | Cell C | |
| 1 | Group 1 | Group 2 | Group 3 | |
| 2 | Group 2 | Group 3 | Group 1 | |
| 3 | Group 3 | Group 1 | Group 2 | |
Intelligent Switching Between Coherence and Diversity Clusters
[0104] 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.
[0105] FIG. 9 illustrates exemplary cluster formats for coherence clusters and diversity clusters for Cells A-C. Referring to FIG. 9 , for cells A-C, the labeling of frequencies (subcarriers) indicates whether the frequencies are part of coherence or diversity clusters. For example, those frequencies labeled 1-8 are diversity clusters and those labeled 9-16 are coherence clusters. For example, all frequencies labeled 1 in a cell are part of one diversity cluster, all frequencies labeled 2 in a cell are part of another diversity cluster, etc., while the group of frequencies labeled 9 are one coherence cluster, the group of frequencies labeled 10 are another coherence cluster, etc. The diversity clusters can be configured differently for different cells to reduce the effect of inter-cell interference through interference averaging.
[0106] FIG. 9 shows example cluster configurations for three neighboring cells. The interference from a particular cluster in one cell are distributed to many clusters in other cells, e.g., the interference from Cluster 1 in Cell A are distributed to Cluster 1, 8, 7, 6 in Cell B. This significantly reduces the interference power to any particular cluster in Cell B. Likewise, the interference to any particular cluster in one cell comes from many different clusters in other cells. Since not all clusters are strong interferers, diversity clusters, with channel coding across its subcarriers, provide interference diversity gain. Therefore, it is advantageous to assign diversity clusters to subscribers that are close (e.g., within the coherent bandwidth) to the cell boundaries and are more subject to inter-cell interference.
[0107] 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.
[0108] 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.
[0109] FIG. 10 illustrates diversity cluster with subcarrier hopping. Referring to FIG. 10 , there are four diversity clusters in each of cells A and B shown, with each subcarrier in individual diversity clusters having the same label (1, 2, 3, or 4). There are four separate time slots shown and during each of the time slots, the subcarriers for each of the diversity clusters change. For example, in cell A, subcarrier 1 is part of diversity cluster 1 during time slot 1, is part of diversity cluster 2 during time slot 2, is part of diversity cluster 3 during time slot 3, and is part of diversity cluster 4 during time slot 4. Thus, more interference diversity can be obtained through subcarrier hopping over time, with further interference diversity achieved by using different hopping patterns for different cells, as shown in FIG. 10 .
[0110] 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.
[0111] 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.
[0112] 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.
[0113] FIG. 11 is a flow diagram of one embodiment of a process for intelligent selection between diversity clusters and coherence clusters depending on subscribers mobility. The process is performed by processing logic that may comprise hardware (e.g., circuitry, dedicated logic, etc.), software (such as that which runs on, for example, a general purpose computer system or dedicated machine), or a combination of both.
[0114] Referring to FIG. 11 , processing logic in the base station performs channel/interference variation detection (processing block 1101). Processing logic then tests whether the results of the channel/interference variation detection indicate that the user is mobile or in a fixed position close to the edge of the cell (processing block 1102). If the user is not mobile or is not in a fixed position close to the edge of the cell, processing transitions to processing block 1103 where processing logic in the base station selects coherence clusters; otherwise, processing transitions to processing block 1104 in which processing logic in the base station selects diversity clusters.
[0115] 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
[0116]
where Hi represents the channel and i is the index to represent the individual channels.
where Hi represents the channel and i is the index to represent the individual channels.
[0117] 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.
[0118] The selection can be updated and intelligently switched during retraining.
[0119] 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. FIG. 12 illustrates a reconfiguration of cluster classification which can support more mobile subscribers than that in FIG. 9 .
[0120] 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.
Claims
The invention claimed is:
1. A method for estimating interference using received pilot symbols, said method comprising:
receiving, at a subscriber station, pilot symbols from at least two base stations;
estimating, at said subscriber station, a channel response based, at least on, said received pilot symbols; and
estimating, at said subscriber station, a first interference level in a data period using said estimated channel response.
2. The method of claim 1 further comprising:
calculating a second interference level in a pilot period based, at least on, said received pilot symbols;
determining an order for two or more clusters of subcarriers using at least said first interference level and said second interference level; and
selecting at least one cluster based, at least, on said determined order and one or more predetermined performance criteria.
3. The method of claim 2 further comprising:
predicting an available data rate for said ordered clusters.
4. The method of claim 3 wherein said predicting comprises:
obtaining said data rate information from a table, wherein said table stores a desired transmission rate associated with an interference level.
5. A method for determining subcarrier energy levels based on received pilot symbols, said method comprising:
receiving pilot symbols from at least two base stations;
determining a first energy level of one or more clusters of subcarriers by performing energy detection for said one or more clusters based, at least, on said received pilot symbols;
determining a second energy level of said one or more clusters of subcarriers by performing energy detection for said one or more clusters during a data period; and calculating an energy difference between the first energy level and the second energy level.
6. The method of claim 5 further comprising:
determining an order for two or more clusters using at least said calculated energy difference between the first and second energy levels; and
selecting at least one cluster based, at least, on said determined order and one or more predetermined performance criteria.
7. The method of claim 5 wherein calculating said energy difference between the first and second energy levels comprises:
comparing the signal power of a cluster based on said received pilot symbols with the signal power of the cluster during the data period.
8. The method of claim 5 wherein calculating said difference in the first and second energy levels comprises:
comparing the energy of one or more observed samples based on said received pilot symbols with the energy of said one or more observed samples during the data period, wherein said comparing is performed for subcarriers in said one or more clusters; and
summing the comparison results for each subcarrier.
9. A subscriber station comprising:
a processor for determining a first energy level of one or more clusters of subcarriers by performing energy detection for the one or more clusters based on received pilot symbols from at least two base stations;
determining a second energy level of said one or more clusters by performing energy detection for said one or more clusters during a data period; and
calculating a difference in the first energy level and the second energy level.
10. The subscriber station of claim 9 wherein said processor:
further determines an order for two or more clusters using at least said calculated energy difference between the first and second energy levels; and
wherein said processor selects at least one cluster based, at least, on said determined order and one or more predetermined performance criteria.
11. The subscriber station of claim 9 wherein said processor compares the signal power of a cluster based on said received pilot symbols with the signal power of the cluster during the data period.
12. The subscriber station of claim 9 wherein said processor compares the energy of one or more observed samples based on said received pilot symbols with the energy of said one or more observed samples during the data period, wherein said comparing is performed for subcarriers in said one or more clusters; and
sums the comparison results for each subcarrier.
13. A subscriber station comprising:
a processor estimating a channel response based, at least on, received pilot symbols from at least two base stations; and
estimating a first interference level in a data period using said estimated channel response.
14. The subscriber station of claim 13 wherein said processor:
calculates a second interference level in a pilot period based, at least on, said received pilot symbols;
determines an order for two or more clusters using at least said first interference level and said second interference level; and
selects at least one cluster based, at least, on said determined order and one or more predetermined performance criteria.
15. The subscriber station of claim 14 wherein said processor:
predicts an available data rate for said ordered clusters.
16. The subscriber station of claim 15 wherein said processor obtains said data rate information from a table, wherein said table stores a desired transmission rate associated with an interference level.
17. A subscriber station comprising:
a processor determining a first energy level of one or more clusters of subcarriers by performing energy detection for the one or more clusters based on received pilot symbols from at least two base stations; determining a second energy level of said one or more clusters by performing energy detection for said one or more clusters during a data period; and
calculating a difference in the first energy level and the second energy level.
18. The subscriber station of claim 17 further comprising wherein said processor further:
determines an order for two or more clusters using at least said calculated energy difference between the first and second energy levels; and wherein said processor selects at least one cluster based, at least, on said determined order and one or more predetermined performance criteria.
19. The subscriber station of claim 17 wherein said processor compares the signal power of a cluster based on said received pilot symbols with the signal power of the cluster during the data period.
20. The subscriber station of claim 17 wherein said processor compares the energy of one or more observed samples based on said received pilot symbols with the energy of said one or more observed samples during the data period, wherein said comparing is performed for subcarriers in said one or more clusters; and
sums the comparison results for each subcarrier.
Patent Citations (167)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4355411(A) | 1982-10-01 | Reudink et al. | Applicant |
| US4670889(A) | 1987-06-01 | Hewitt et al. | Applicant |
| US5038399(A) | 1991-08-01 | Bruckert | Applicant |
| US5239676(A) | 1993-08-01 | Strawczynski et al. | Applicant |
| US5280630(A) | 1994-01-01 | Wang | Applicant |
| US5282222(A) | 1994-01-01 | Fattouche et al. | Applicant |
| US5437054(A) | 1995-07-01 | Rappaport et al. | Applicant |
| US5471647(A) | 1995-11-01 | Gerlach et al. | Applicant |
| US5479447(A) | 1995-12-01 | Chow et al. | Applicant |
| US5491837(A) | 1996-02-01 | Haartsen | Applicant |
| US5504775(A) | 1996-04-01 | Chouly et al. | Applicant |
| US5507034(A) | 1996-04-01 | Bodin et al. | Applicant |
| US5515378(A) | 1996-05-01 | Roy, III et al. | Applicant |
| US5555268(A) | 1996-09-01 | Fattouche et al. | Applicant |
| US5588020(A) | 1996-12-01 | Schilling | Applicant |
| US5634199(A) | 1997-05-01 | Gerlach et al. | Applicant |
| US5708973(A) | 1998-01-01 | Ritter | Applicant |
| US5726978(A) | 1998-03-01 | Frodigh et al. | Applicant |
| US5732353(A) | 1998-03-01 | Haartsen | Applicant |
| US5734967(A) | 1998-03-01 | Kotzin et al. | Applicant |
| US5764699(A) | 1998-06-01 | Needham et al. | Applicant |
| US5774808(A) | 1998-06-01 | Sarkioja et al. | Applicant |
| US5822372(A) | 1998-10-01 | Emami | Applicant |
| US5839074(A) | 1998-11-01 | Plehn et al. | Applicant |
| US5867478(A) | 1999-02-01 | Baum et al. | Applicant |
| US5884145(A) | 1999-03-01 | Haartsen | Applicant |
| US5886988(A) | 1999-03-01 | Yun et al. | Applicant |
| US5887245(A) | 1999-03-01 | Lindroth et al. | Applicant |
| US5909436(A) | 1999-06-01 | Engstrom et al. | Applicant |
| US5914933(A) | 1999-06-01 | Cimini et al. | Applicant |
| US5933421(A) | 1999-08-01 | Alamouti et al. | Applicant |
| US5956642(A) | 1999-09-01 | Larsson et al. | Applicant |
| US5973642(A) | 1999-10-01 | Li et al. | Applicant |
| US5991273(A) | 1999-11-01 | Abu-Dayya et al. | Applicant |
| US6005876(A) | 1999-12-01 | Cimini, Jr. et al. | Applicant |
| US6009332(A) | 1999-12-01 | Haartsen | Applicant |
| US6009553(A) | 1999-12-01 | Martinez et al. | Applicant |
| US6023622(A) | 2000-02-01 | Plaschke et al. | Applicant |
| US6026123(A) | 2000-02-01 | Williams | Applicant |
| US6038450(A) | 2000-03-01 | Brink et al. | Applicant |
| US6041237(A) | 2000-03-01 | Farsakh et al. | Applicant |
| US6052594(A) | 2000-04-01 | Chuang et al. | Applicant |
| US6061568(A) | 2000-05-01 | Dent | Applicant |
| US6064692(A) | 2000-05-01 | Chow | Applicant |
| US6064694(A) | 2000-05-01 | Clark et al. | Applicant |
| US6067290(A) | 2000-05-01 | Paulraj et al. | Applicant |
| US6091717(A) | 2000-07-01 | Honkasalo et al. | Applicant |
| US6108374(A) | 2000-08-01 | Balachandran et al. | Applicant |
| US6111919(A) | 2000-08-01 | Yonge, III | Applicant |
| US6131016(A) | 2000-10-01 | Greenstein et al. | Applicant |
| US6141565(A) | 2000-10-01 | Feuerstein et al. | Applicant |
| US6144696(A) | 2000-11-01 | Shively et al. | Applicant |
| US6192026(B1) | 2001-02-01 | Pollack et al. | Applicant |
| US6208663(B1) | 2001-03-01 | Schramm et al. | Applicant |
| US6212388(B1) | 2001-04-01 | Seo | Applicant |
| US6226320(B1) | 2001-05-01 | Hakkinen et al. | Applicant |
| US6253063(B1) | 2001-06-01 | Cudak et al. | Examiner |
| US6276297(B1) | 2001-08-01 | van den Berg et al. | Applicant |
| US6282185(B1) | 2001-08-01 | Hakkinen et al. | Applicant |
| US6298092(B1) | 2001-10-01 | Heath, Jr. et al. | Applicant |
| US6304593(B1) | 2001-10-01 | Alouini et al. | Applicant |
| US6307851(B1) | 2001-10-01 | Jung et al. | Applicant |
| US6327472(B1) | 2001-12-01 | Westroos et al. | Applicant |
| US6330460(B1) | 2001-12-01 | Wong et al. | Applicant |
| US6351499(B1) | 2002-02-01 | Paulraj et al. | Applicant |
| US6351643(B1) | 2002-02-01 | Haartsen | Applicant |
| US6366195(B1) | 2002-04-01 | Harel et al. | Applicant |
| US6377632(B1) | 2002-04-01 | Paulraj et al. | Applicant |
| US6377636(B1) | 2002-04-01 | Paulraj et al. | Applicant |
| US6400699(B1) | 2002-06-01 | Airy et al. | Applicant |
| US6404783(B1) | 2002-06-01 | Cimini, Jr. et al. | Applicant |
| US6405044(B1) | 2002-06-01 | Smith et al. | Applicant |
| US6405048(B1) | 2002-06-01 | Haartsen | Applicant |
| US6411186(B1) | 2002-06-01 | Lilleberg et al. | Applicant |
| US6415153(B1) | 2002-07-01 | Liew | Applicant |
| US6424836(B1) | 2002-07-01 | Gil et al. | Applicant |
| US6449246(B1) | 2002-09-01 | Barton et al. | Applicant |
| US6463096(B1) | 2002-10-01 | Raleigh et al. | Applicant |
| US6463296(B1) | 2002-10-01 | Esmailzadeh et al. | Examiner |
| US6470044(B1) | 2002-10-01 | Kowalski | Examiner |
| US6473467(B1) | 2002-10-01 | Wallace et al. | Examiner |
| US6477158(B1) | 2002-11-01 | Take et al. | Applicant |
| US6487253(B1) | 2002-11-01 | Jones, IV et al. | Applicant |
| US6493331(B1) | 2002-12-01 | Walton et al. | Applicant |
| US6496490(B1) | 2002-12-01 | Andrews et al. | Applicant |
| US6501785(B1) | 2002-12-01 | Chang et al. | Applicant |
| US6526281(B1) | 2003-02-01 | Gorsuch et al. | Applicant |
| US6539233(B1) | 2003-03-01 | Taketsugu et al. | Applicant |
| US6545997(B1) | 2003-04-01 | Bohnke et al. | Applicant |
| US6553001(B1) | 2003-04-01 | Indira | Applicant |
| US6553234(B1) | 2003-04-01 | Florea | Applicant |
| US6567383(B1) | 2003-05-01 | Bohnke et al. | Applicant |
| US6567387(B1) | 2003-05-01 | Dulin et al. | Applicant |
| US6574476(B1) | 2003-06-01 | Williams | Applicant |
| US6600776(B1) | 2003-07-01 | Alamouti et al. | Applicant |
| US6654612(B1) | 2003-11-01 | Avidor et al. | Applicant |
| US6657949(B1) | 2003-12-01 | Jones, IV et al. | Applicant |
| US6693884(B1) | 2004-02-01 | Gutowski | Applicant |
| US6694147(B1) | 2004-02-01 | Viswanath et al. | Applicant |
| US6699784(B2) | 2004-03-01 | Xia et al. | Applicant |
| US6701129(B1) | 2004-03-01 | Hashem et al. | Applicant |
| US6721159(B2) | 2004-04-01 | Takashige et al. | Examiner |
| US6726297(B1) | 2004-04-01 | Uesugi et al. | Applicant |
| US6760882(B1) | 2004-07-01 | Gesbert et al. | Applicant |
| US6782037(B1) | 2004-08-01 | Krishnamoorthy et al. | Applicant |
| US6788349(B2) | 2004-09-01 | Wu et al. | Applicant |
| US6795424(B1) | 2004-09-01 | Kapoor et al. | Applicant |
| US6826240(B1) | 2004-11-01 | Thomas et al. | Examiner |
| US6834045(B1) | 2004-12-01 | Lappetelainen et al. | Applicant |
| US6862272(B2) | 2005-03-01 | Dulin et al. | Applicant |
| US6870808(B1) | 2005-03-01 | Liu et al. | Examiner |
| US6892059(B1) | 2005-05-01 | Kim et al. | Examiner |
| US6904030(B2) | 2005-06-01 | Lee et al. | Examiner |
| US6904283(B2) | 2005-06-01 | Li et al. | Applicant |
| US6907244(B2) | 2005-06-01 | Santhoff et al. | Applicant |
| US6920122(B1) | 2005-07-01 | Hanaoka et al. | Applicant |
| US6922445(B1) | 2005-07-01 | Sampath et al. | Applicant |
| US6928120(B1) | 2005-08-01 | Zhang | Applicant |
| US6944120(B2) | 2005-09-01 | Wu et al. | Applicant |
| US6947748(B2) | 2005-09-01 | Li et al. | Applicant |
| US6961364(B1) | 2005-11-01 | Laroia et al. | Examiner |
| US6985432(B1) | 2006-01-01 | Hadad et al. | Applicant |
| US6996075(B2) | 2006-02-01 | Santhoff et al. | Applicant |
| US6996100(B1) | 2006-02-01 | Haartsen | Applicant |
| US7047011(B1) | 2006-05-01 | Wikman et al. | Applicant |
| US7068628(B2) | 2006-06-01 | Li et al. | Examiner |
| US7072315(B1) | 2006-07-01 | Liu et al. | Applicant |
| US7095719(B1) | 2006-08-01 | Wilhelmsson et al. | Applicant |
| US7133352(B1) | 2006-11-01 | Hadad | Applicant |
| US7133380(B1) | 2006-11-01 | Winters et al. | Applicant |
| US7146172(B2) | 2006-12-01 | Li et al. | Applicant |
| US7203191(B2) | 2007-04-01 | Garcia-Luna-Aceves et al. | Applicant |
| US7224741(B1) | 2007-05-01 | Hadad | Applicant |
| US7230908(B2) | 2007-06-01 | Vanderaar et al. | Applicant |
| US7373151(B1) | 2008-05-01 | Ahmed | Applicant |
| US7379742(B2) | 2008-05-01 | Li et al. | Applicant |
| US7715358(B2) | 2010-05-01 | Li et al. | Examiner |
| US2002/0114269(A1) | 2002-08-01 | Onggosanusi et al. | Applicant |
| US2003/0067890(A1) | 2003-04-01 | Goel et al. | Applicant |
| US2003/0169681(A1) | 2003-09-01 | Li et al. | Applicant |
| US2003/0169824(A1) | 2003-09-01 | Chayat | Applicant |
| US2003/0211831(A1) | 2003-11-01 | Xu et al. | Applicant |
| US2005/0025099(A1) | 2005-02-01 | Heath et al. | Applicant |
| CN1245623 | 2000-02-01 | Applicant | |
| DE19800953 | 1999-07-01 | Applicant | |
| DE19800953(C1) | 1999-07-01 | Applicant | |
| EP869647 | 1998-10-01 | Applicant | |
| EP869647(A2) | 1998-10-01 | Applicant | |
| EP926912(A2) | 1999-06-01 | Applicant | |
| EP929202(A1) | 1999-07-01 | Applicant | |
| EP999658 | 2000-05-01 | Applicant | |
| FR2777407(A1) | 1999-10-01 | Applicant | |
| GB2209858(A) | 1989-05-01 | Applicant | |
| JP1-317035 | 1989-12-01 | Applicant | |
| JP6029922 | 1994-02-01 | Applicant | |
| JP7-322219 | 1995-12-01 | Applicant | |
| JP10-303849 | 1998-11-01 | Applicant | |
| JP11-088244 | 1999-03-01 | Applicant | |
| JP11-508417(T) | 1999-07-01 | Applicant | |
| JP11-308153 | 1999-11-01 | Applicant | |
| KR1999-28244 | 1999-04-01 | Applicant | |
| WO-96/19055 | 1996-06-01 | Applicant | |
| WO-/97/01256 | 1997-01-01 | Applicant | |
| WO-98/16077(A2) | 1998-04-01 | Applicant | |
| WO-98/30047(A1) | 1998-07-01 | Applicant | |
| WOPCT/JP00/004121 | 2000-06-01 | Applicant | |
| WO-0249305(A2) | 2002-06-01 | Applicant |
Non-Patent Literature (90)
- English translation of Japanese Office Action for Application No. 2002-550683, dispatched May 7, 2007, 2 ppgs.Applicant
- English translation of Japanese Office Action for Application No. 2002-550747, dispatched May 21, 2007, 4 ppgs.Applicant
- Office Action issued for Korean Patent Application 2003-7007961 dated Sep. 27, 2006.Applicant
- Bender et al., CDMA/HDR: A Bandwidth-Efficient High-Speed Wireless Data Service for Nomadic Users, IEEE Communications Magazine, Jul. 2000, pp. 70-87.Applicant
- Frullone et al., PRMA Performance in Cellular Environments with Self-Adaptive Channel Allocation Strategies, IEEE Transactions on Vehicular Technology, Nov. 1996, pp. 657-665, vol. 45, No. 4.Applicant
- Xu, Guanghan and Li, San-Qi, Throughput Multiplication of Wireless Lans for Multimedia Services: SDMA Protocol Design, 1994 IEEE, pp. 1326-1332.Applicant
- Ward, James and Compton, R. Ted, Jr., High Throughput Slotted ALOHA Packet Radio Networks with Adaptive Arrays, IEEE Transactions on Communications, Mar. 1993, pp. 460-470, vol. 41, No. 3.Applicant
- Tsoulos, G.V., Smart Antennas for Mobile Communication Systems: Benefits and Challenges, Electronics & Communication Engineering Journal, Apr. 1999, pp. 84-94.Applicant
- Shad et al., Indoor SDMA Capacity Using a Smart Antenna Basestation, 1997 IEEE, pp. 868-872.Applicant
- Farsakh, C. et al., “Maximizing the SDMA Mobile Radio Capacity Increase by DOA Sensitive Channel Allocation,” Wireless Personal Communications, Kluwer Academic Publishers, NL, vol. 11, No. 1. Oct. 1999, pp. 63-76, XP000835062, ISSN: 0929-6212.Applicant
- Wong, C. Y., et al., Multiuser OFDM With Adaptive Subcarrier, Bit, and Power Allocation, IEEE Journal on Selected Areas in Communications, Oct. 1999, IEEE Inc., New York, USA, vol. 17, Nr. 10, pp. 1747-1758, XP000855475, ISSN: 0733-8716 Sections I and II abstract.Applicant
- Gruenheid, R. et al: “Adaptive Modulcation and Multiple Access for the OFDM Transmission Technique,” Wireless Personal Communications, Kluwer Academic Publishers, NL, vol. 13, NR. 1/2, Year 2000, pp. 5-13 XP000894156, ISSN: 0929-6212.Applicant
- Motegi, M. et al.: Optimum Band Allocation According to Subband Condition for BST-OFDM 11th IEEE International Symposium on Personal Indoor and Modile Radio Communications, vol. 2, Sep. 18-21, 2000, pp. 1236-1240, XP002213669, Piscataway, NJ, USA, ISBN: 0-7803-6463-5.Applicant
- Kapoor, S. et al.: “Adaptive Interference Suppression in Multiuser Wireless, OFDM Systems Using Antenna Arrays,” IEEE Transactions on Signal Processing, vol. 47, No. 12, Dec. 1999, pp. 3381-3391, XP000935422, IEEE, NY, USA, ISSN: 1053-587X.Applicant
- Ye Li, et al.: “Clustered OFDM with channel estimation for high rate wireless data,” Mobile Multimedia Communications, 1999. (MOMUC '99). 1999 IEEE International Workshop on San Diego, CA, USA, IEEE, US, Nov. 15, 1999, p. 43-50, XP010370695, ISBN: 0-7803-5904-6.Applicant
- Nogueroles, R. et al.: Improved Performance of a Random OFDMA Mobile Communication System: Vehicular Technology Conference, 1998. VTC 98. 48th IEEE Ottawa, Ontario, Canada, May 18-21, 1998, pp. 2502-2506, XP010288120, ISBN: 0-7803-4320-4.Applicant
- Kinugawa, Y.et al.: “Frequency and Time Division Multiple Access with Demand-Assignment Using Multicarrier Modulation for Indoor Wireless Communications Systems,” IEICE Transactions on Communications, Institute of Electronics Information and Comm. Eng. Tokyo, Japan, vol. E77-B, NR. 3, Mar. 1994, pp. 396-402, XP000451014, ISSN: 0916-8516.Applicant
- Vittoria Mignone et al. “CD3-OFDM: A Novel Demodulation Scheme for Fixed and Mobile Receivers,” IEEE Transactions on Communications, Sep. 1996, vol. 44, No. 9.Applicant
- European Office Action from Applicaiton No. 01 986 165.7, dated Mar. 29, 2007, 5 ppgs.Applicant
- Farsakh, Cristof and Nossek, Josef A., On the Mobile Radio Capacity Increase through SDMA, no date (after 1997).Applicant
- 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, Jul. 2000.Applicant
- Sari and Karam, “Orthogonal Frequency-Division Multiple Access and its Application to CATV Networks,” European Transactions on Telecommunications, vol. 9 (6), pp. 507-516, Nov./Dec. 1998.Applicant
- Cimini, Jr., “Analysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division Multiplexing,” IEEE Trans. Commun., vol. COM-33, No. 7, Jul. 1985, pp. 665-675.Applicant
- Office Action issued for Korean Patent Application No. 2003-7007961, dated Sep. 27, 2006.Applicant
- Office Action issued for Chinese Patent Application No. 200610081062.5, dated Apr. 3, 2009; English Translation; 3 pages.Applicant
- English Translation of the Office Action issued for Chinese Patent Application No. 200610081062.5, dated Apr. 3, 2009; 3 pages.Applicant
- Goldsmith et al., “Adaptive Coded Modulation for Fading Channels”, IEEE Transactions on Communications, vol. 46, No. 5, May 1998, 8 pgs.Applicant
- Goldsmith et al., “Variable-Rate Variable-Power MQAM for Fading Channels”, IEEE Transcations on Communications, vol. 45, No. 10, Oct. 1997, 13 pgs.Applicant
- Czylwik, Adreas, “Adaptive OFDM for Wideband Radio Channels”, IEEE 0-7803-3336-5/96, copyright 1996, 6 pgs.Applicant
- Doufexi et al., “A Comparison of HIPERLAN/2 and IEEE802.11a Physical and MAC Layers”, IEEE 0-7803-6684-0/00, copyright 2000, 7 pgs.Applicant
- Arogyaswami et al., “A Taxonomy of Space-Time Processing for Wireless Networks”, IEEE vol. 143, No. 1, Feb. 1998, 21 pgs.Applicant
- Wang et al., “Dynamic Channel Resource Allocation in Frequency Hopped Wireless Communication Systems”, IEEE 0-7803-2015—8/94, copyright 1994, 1 pg.Applicant
- Wong et al., “A Real-Time Sub-Carrier Allocation Scheme for Multiple Access Downlink OFDM Transmission”, IEEE 0-7803-5435-4/99, copyright 1999, 5 pgs.Applicant
- Wong et al., “Multiuser OFDM wit Adaptive Subcarrier, Bit and Power Allocation”, IEEE vol. 17, No. 10, Oct. 1999, 12 pgs.Applicant
- Wong et al., “Multiuser Subcarrier Allocationj for OFDM Transmission Using Adaptive Modulation”, IEEE 0-7803-5565-2/99, copyright 1999, 5 pgs.Applicant
- Sung et al., “User Speed Estimation and Dynamic Channel Allocation in Hierarchical Cellular System”, IEEE 0-7803-1927-3/94, copyright 1994, 5 pgs.Applicant
- Kivanc et al., “Subcarrier Allocation and Power control for OFDMA”, IEEE 0-7803-6514-3/00, copyright 2000, 5 pgs.Applicant
- Grunheld et al., “Adaptive Modulation and Multiple Access for the OFDM Transmission Technique”, Wireless Personal Communcations 13: 5-13, dated 2000, 9 pgs.Applicant
- Viswananthan et al., “Adaptive Coded Modulation Over Slow Frequency-Selective Fading Channels”, IEEE 0-7803-5585-2/99, copyright 1999, 5 pgs.Applicant
- Rohling et al., “Adapti e Coding and Modulation in an OFDM-TDMA Communication System”, 4 pgs.Applicant
- Sari, Hikmet, “Trends and Challenges in Broadband Wireless Access”, IEEE 0-7803-6684-0/00, copyright 2000, 5 pgs.Applicant
- Sari et al., “An Analysis of Orthogonal Frequency-Division Multiple Access”, IEEE 0-7803-4198-8/97, copyright 1997, 5 pgs.Applicant
- Toba et al., “A Demand-Assign Optical Frequency-Division-Multiple-Access Star Network”, Journal of Lightwave Technology, vol. 11, No. 56, May/Jun. 1993, 7 pgs.Applicant
- Katzela et al., “Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Surevey”, IEEE 1070-9916/96, copyright 1996, 22 pgs.Applicant
- Jafar et al., “Optimal Rate and Power Adaptation for Multirate CDMA”, Stanford University, Wireless Systems Laboratory, 7 pgs.Applicant
- van de Beek et al., “A Time and Frequency Synchronization Scheme for Multiuser OFDM”, IEEE vol. 17, No. 11, Nov. 1999, 16 pgs.Applicant
- van de Beek et al., “On Channel Estimation in OFDM Systems”, Preceedings of Vehicular Technology Conference (VTC 95) vol. 2, Sep. 1995, 6 pgs.Applicant
- Chuang et al., “Wideband Wireless Data Access Based on OFDM adn Dynamic Packet Assignment”, IEEE 0-7803-5668-3/99, copyright 1999, 5 pgs.Applicant
- Sathananthan et al., “Analysis of OFDM in the Presence of Frequency Offset and a Method to Reduce Performance Degradation”, 0-7803-6451-1/00, copyright 2000, 5 pgs.Applicant
- Keller et al., “Adaptive Modulation Techniques for Duplex OFDM Transmission”, IEEE vol. 49, No. 5, Sep. 2000, 14 pgs.Applicant
- Li et al., “A New Blind Receiver for Downlink DS-CDMA Communications”, IEEE vol. 3, No. 7, Jul. 1999, 3 pgs.Applicant
- Li et al., “Clustered OFDM with Channel Estimation for High Rate Wireless Data”, 1999 IEEE International Workshop, Nov. 15-17, 1999, 9 pgs.Applicant
- Liu et al., “Efficient Network Utilization for Multimedia Wirelesss Networks”, C.G Omidyar (Ed.), MWCN 2000, copyright 2000, 15 pgs.Applicant
- Luise et al., “Carrier Frequency Acquistion and Tracking for OFDM Systems”, IEEE 0090-6778/96, copyright 1996, 9 pgs.Applicant
- Ericson et al., “Evaluation of the Mixed Service Ability for Competitive Third Generation Multiple Access Technologies”, IEEE 0-7803-3659-3/97, copyright 1997, 4 pgs.Applicant
- Wahlqvist et al., “Capacity Comparison of an OFDM Based Multiple Access System Using Different Dynamic Resource Allocation”, IEEE 0-7803-3659-3/97, copyright 1997, 5 pgs.Applicant
- Vanderaar, Mark et al., “Provisional Application”, dated Jul. 24, 2000, 11 pgs.Applicant
- Johnsson, Martin, “HiperLAN/2—The Broadband Radio Transmission Technology Operating in the 5 GHz Frequency Band”, Global Forum, 1999, 22 pgs.Applicant
- Olfat et al., “Adaptive Beamforing and Power Allocation for OFDM Over Wireless Networks”, IEEE 0-7803-5148-7/98, copyright 1998, 5 pgs.Applicant
- Wahlqvist et al., “A Conceptual Study of OFDM-Based Multiple Access Schemes, Part 1: Air Interface Requirements”, Telia Research AB, Jun. 5, 1996, 6 pgs.Applicant
- Wahlqvist et al., Decription of Telias OFDM Based Proposal (Working document in the OFDM concept group) Telia, ETSI STC SMG2#22, May 12-16, 1997, 22 pgs.Applicant
- Mehta et al., “Performance Analysis of Link Adaptation in Wireless Data Networks”, Department of Electrical Engineering, Stanford University, Mar. 6, 2000, 15 pgs.Applicant
- Author Unknown, “Part 11: Wireless LAN Medum Access Control (MAC) and Physical Layer (PHY) specifications: High-Speed Physical Layer in the 5 GHZ Band”, IEEE Supplement, Sep. 16, 1999, 90 pgs.Applicant
- Robertson et al., “The Effects of Doppler Spreads in OFDM(A) Mobile Radio Systems”, IEEE 0-7803-5435-4, copyright 1999, Institute for Communications Technology, German Aerospace Center (DLR), 5 pgs.Applicant
- Knopp et al., “Information Capacity and Power Control in Single-Cell Multiuser Communications”, IEEE 0-7803-2486-2/95, copyright 1995, 5 pgs.Applicant
- Rohling et al., “Adaptive Coding and Modulation in an OFDM-TDMA Communication System”, IEEE 0-7803-4320-4/98, copyright 1998, 4 pgs.Applicant
- Nogueroles et al., “Improved Performance of a Random OFDMA Mobile Communication System”, IEEE 0-7803-4320-4/98, copyright 1998, 5 pgs.Applicant
- Nogueroles et al., “Performance of a Random OFDMA System for Mobile Communications”, IEEE 0-7803-3893-6/98, copyright 1998, 7 pgs.Applicant
- van Nee et al., “OFDM for Wireless Multimedia Communications”, Artech House Universal Personal Communications, copyright 2000, 14 pgs.Applicant
- Heath et al., “Coordianted Training and Transmission for Improved Inteference Cancellation in a Cellular Network”, IEEE 0-803-6514-3/00, copyright 2000, 7 pgs.Applicant
- Rohling et al., “Performance Comparsion of Differenct Multiple Access Schemes for the Downlink of an OFDM Communication System”, IEEE 0-7803-3659-3/97, copyright 1997, 5 pgs.Applicant
- Sartenaer et al., “Resource Allocation for Frequency-Selective Multiple Access Channels with Adaptive QAM Modulation”, IEEE 0-7803-6684-00, copyright 2000, 8 pgs.Applicant
- Seong-Jun Oh et al., “Adaptive Resoource Allocation in Power Constrained CDMA Mobile Networks”, IEEE 0-7803-5668-3/99, copyright 1999, 5 pgs.Applicant
- Slawomir et al., “Multiuser Subcarrier Allocation for QoS Provision in the OFDMA Systems”, IEEE 0-7803-7467-3/02, copyright 2002, 5 pgs.Applicant
- Sollenberger et al., “Receiver Structure for Multiple Access OFDM”, IEEE 0-7803-5565-2/99, copyright 1999, 5 ps.Applicant
- Papavassiliou et al., “Joint Optimal Channel Base Station and Power Assignment for Wireless Access”, Polytechnic University, Published Jun. 17, 1996, 35 pgs.Applicant
- Maehata et al., “DSRC Using OFDM for Roadside-Vehicle Communication System”, IEEE 0-7803-5718-3/00, copyright 2000, 5 pgs.Applicant
- Keller et al., “Adaptive Modulation Techniques for Duplex OFDM Transmission”, Department of Electronics and Computer Science, University of Southhampton, Jun. 7, 1999, 14 pages.Applicant
- Tufvesson et al., “Pilot Assisted Channel Estimation for OFDM in Mobile Cellular Systems”, Department of Applied Electronics, Lund University, VTC 11997, 5 pgs.Applicant
- Rhee et al., “Increase in Capacity of Multiuser OFDM System Using Dynamic Subchannel Allocation”, IEEE 0-7803-5718-3/00, copyright 2000, 5 pgs.Applicant
- Li et al., “Maximum-Likelihood Estimation of OFDM Carrier Frequency Offset for Fading Channels”, IEEE 1058-6393/98, copyright 1998, 5 pgs.Applicant
- Li et al., “M-Sequences for OFDM Peak-to-Average Power Ration Reduction and Error correction”, Electronics Letters, vol. 33, No. 7, Mar. 27, 1997, 2 pgs.Applicant
- Li et al., “Effects of Clipping and Filtering on the Performance of OFDM”, IEEE Conference on Vehicular Technology, 1997, 3 pgs.Applicant
- Li et al., “Effects of Clipping and Filtering on the Performance of OFDM”, IEEE 0-7803-3659-3/97, copyright 1997, 5 pgs.Applicant
- Tang et al., “An Adaptive Modulation Scheme for Simultaneous Voice and Data Transmission Over Fading Channels”, IEEE Vehicular Technology Conference (VTC'98), draft dated Dec. 1, 1997, 32 pgs.Applicant
- Matsui et al.., “OFDMA/TDD Packet Transmission System with an Adaptive Subcarrier Selection Scheme for Asymmetric Wireless Communication Services”, IEEE 0-803-6622-0/01, copyright 2001, 2 pgs.Applicant
- Li et al., “Channel Estimation for OFDM Systems with Transmitter Diversity in Mobile Wireless Channels”, IEEE 0733-8716/99, copyright 1999, 11 pgs.Applicant
- Partial European Search Report issued for EP10175770.6, dated May 12, 2011, 7 pages.Applicant
- Office Action issued for Japanese Patent Application No.: 2008-193243, dated Apr. 21, 2011, 4 pages (with English translation).Applicant
- Office Action issued for Japanese Patent Application No.: 2008-182746, dated Apr. 21, 2011, 6 pages (with English translation).Applicant