Adaptive sectorization in cellular systems

Information

  • Patent Grant
  • 9179319
  • Patent Number
    9,179,319
  • Date Filed
    Thursday, October 27, 2005
    19 years ago
  • Date Issued
    Tuesday, November 3, 2015
    9 years ago
Abstract
Apparatuses and methodologies are described that enhance performance in a wireless communication system using beamforming transmissions. According to one aspect, a set of transmit beams are defined that simultaneously provides for space division multiplexing, multiple-input multiple output (MIMO transmission and opportunistic beamforming. The addition of a wide beam guarantees a minimum acceptable performance for all user devices.
Description
BACKGROUND

I. Field


The following description relates generally to wireless communications, and, amongst other things, to flexible communication schemes for wireless communication systems.


II. Background


Wireless networking systems have become a prevalent means by which a majority of people worldwide has come to communicate. Wireless communication devices have become smaller and more powerful in order to meet consumer needs and to improve portability and convenience. Consumers have found many uses for wireless communication devices such as cellular telephones, personal digital assistants (PDAs) and the like, demanding reliable service and expanded areas of coverage.


Performance for a wireless communication system may be enhanced by using beamformed transmissions to communicate from the base station to the mobile devices. Multiple transmit antennas located at a base station can be used to form beamformed transmissions. Beamformed transmissions utilize “beams” that typically cover a narrower area than transmissions using a single transmit antenna. However, the signal to interference and noise ratio (SINR) is enhanced within the area covered by the beams. The portions of a sector not covered by a beam are referred to as a null region. Mobile devices located within the null region will have will have an extremely low SINR, resulting in reduced performance and possible loss of data. The communication system may use beam steering, in which beams are dynamically directed at particular user devices. During beam steering, beams are redirected as user devices change location.


A typical wireless communication network (e.g., employing frequency, time, and code division techniques) includes one or more base stations that provide a coverage area and one or more mobile (e.g., wireless) user devices that can transmit and receive data within the coverage area. A typical base station can simultaneously transmit multiple data streams for broadcast, multicast, and/or unicast services, wherein a data stream is a stream of data that can be of independent reception interest to a user device. A user device within the coverage area of that base station can be interested in receiving one, more than one or all the data streams carried by the composite stream. Likewise, a user device can transmit data to the base station or another user device. Such communication between base station and user device or between user devices can be degraded due to channel variations and/or interference power variations. For example, the aforementioned variations can affect base station scheduling, power control and/or rate prediction for one or more user devices.


Conventional network fixed beamformed transmissions result in null regions, reducing network reliability, robustness and coverage area. Thus, there exists a need in the art for a system and/or methodology for improved beamformed transmission coverage.


SUMMARY

The following presents a simplified summary of one or more embodiments in order to provide a basic understanding of such embodiments. This summary is not an extensive overview of all contemplated embodiments, and is intended to neither identify key or critical elements of all embodiments nor delineate the scope of any or all embodiments. Its sole purpose is to present some concepts of one or more embodiments in a simplified form as a prelude to the more detailed description that is presented later.


In accordance with one or more embodiments and corresponding disclosure thereof, various aspects are described in connection with enhancing performance in a wireless communication system using beamforming transmissions. According to one aspect, a set of transmit beams are defined that simultaneously provides for space division multiplexing, multiple-input multiple output (MIMO) transmission and opportunistic beamforming. The addition of a wide beam guarantees a minimum acceptable performance for all user devices.


To that end, a method for enhancing performance of a wireless communications environment is described herein, wherein the method can comprise determining channel information for a user, and assigning a user device to at least one of a predetermined at least one narrow beam or a wide beam. Additionally, the method can comprise assigning another user device during a same time period to at least some overlapping frequencies and a different one of the at least one predetermined at least one narrow beam and a wide beam as the user device. Moreover, the at least one predetermined narrow beam can comprise a cluster of narrow beams and another cluster of narrow beams, wherein the cluster and the another cluster do not overlap. The method can also comprise modifying the direction of the at least one predetermined at least one narrow beam based upon a pattern of communication of the user device or reassigning the user device from the predetermined at least one narrow beam to the wide beam based upon a channel quality indicator.


According to another aspect, a wireless communication apparatus can comprise a memory that stores information related to at least one predetermined at least one narrow beam and at least one wide beam and a processor, coupled to the memory, that assigns a user device to at least one of the predetermined at least one narrow beam and the wide beam. The processor can schedule communications for the user device based upon a spatial division multiplexing, MIMO or opportunistic beamforming scheduling technique. Additionally, the processor can generate the wide beam using a cyclic delay diversity scheme and transmit broadcast control transmissions over the wide beam. Moreover, the apparatus can comprise a first cluster of antennas, a first cluster of narrow beams employs the first cluster of antennas, and a second cluster of antennas, a second cluster of narrow beams employs the second cluster of antennas, wherein the first and second clusters of narrow beams do not overlap.


According to yet another aspect, an apparatus for enhancing system performance in a wireless communication environment comprises means for generating a predetermined at least one narrow beam, means for generating a wide beam, and means for assigning a user device to at least one of the predetermined at least one narrow beam and the wide beam. Additionally, the apparatus can comprise means for scheduling communications for the user device based upon a spatial division multiplexing, MIMO or opportunistic beamforming scheduling technique.


Yet another aspect relates to a computer-readable medium having stored thereon computer-executable instructions for generating a predetermined at least one narrow beam, generating a wide beam, and assigning a user device to at least one of the predetermined at least one narrow beam and the wide beam. Moreover, the medium can comprise instructions for scheduling communications for the user device based upon a spatial division multiplexing, MIMO or opportunistic beamforming scheduling technique.


Still another aspect relates to a processor that executes instructions for enhancing system performance in a multiple access wireless communication environment, the instructions comprising generating a predetermined at least one narrow beam, generating a wide beam, and assigning a user device to at least one of the predetermined at least one narrow beam and the wide beam. Additionally, the processor can execute instructions comprising scheduling communications for the user device based upon a spatial division multiplexing, MIMO or opportunistic beamforming scheduling technique.


A further aspect sets forth a mobile device that facilitates communicating over a wireless network, comprising a component that generates a predetermined at least one narrow beam, a component that generates a wide beam, and a component that assigns a user device to at least one of the predetermined at least one narrow beam and the wide beam.


To the accomplishment of the foregoing and related ends, the one or more embodiments comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative aspects of the one or more embodiments. These aspects are indicative, however, of but a few of the various ways in which the principles of various embodiments may be employed and the described embodiments are intended to include all such aspects and their equivalents.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a beam pattern for a wireless communication system in accordance with various embodiments presented herein.



FIG. 2 is an illustration of a wireless communication system according to one or more embodiments presented herein.



FIG. 3 is an illustration of a wireless communication system according to one or more embodiments presented herein.



FIG. 4 is an illustration of a beam pattern for a wireless communication system in accordance with various embodiments presented herein.



FIG. 5 is an illustration of a beam pattern for a wireless communication system in accordance with various embodiments presented herein.



FIG. 6 illustrates a methodology for assigning a user device to a transmit beam in accordance with one or more aspects presented herein.



FIG. 7 illustrates a methodology for assigning a user device to a transmit beam in accordance with one or more aspects presented herein.



FIG. 8 is an illustration of a system that utilizes beamforming to increase system capacity in a wireless communication environment in accordance with various aspects.



FIG. 9 is an illustration of a system that utilizes beamforming to increase system capacity in a wireless communication environment in accordance with various aspects.



FIG. 10 is an illustration of a wireless communication environment that can be employed in conjunction with the various systems and methods described herein.





DETAILED DESCRIPTION

Various embodiments are now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more embodiments. It may be evident, however, that such embodiment(s) may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more embodiments.


Furthermore, various embodiments are described herein in connection with a user device. A user device can also be called a system, a subscriber unit, subscriber station, mobile station, mobile device, remote station, access point, base station, remote terminal, access terminal, user terminal, terminal, user agent, or user equipment. A user device can be a cellular telephone, a cordless telephone, a Session Initiation Protocol (SIP) phone, a wireless local loop (WLL) station, a PDA, a handheld communications or computing device having wireless connection capability, a smartphone, a satellite radio, a global position system, a laptop, or other processing device connected to a wireless modem.


Moreover, various aspects or features described herein may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term “article of manufacture” as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. For example, computer readable media can include but are not limited to magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips . . . ), optical disks (e.g., compact disk (CD), digital versatile disk (DVD) . . . ), smart cards, and flash memory devices (e.g., card, stick, key drive . . . ).


A wireless communication system can include one or more base stations in contact with one or more user devices. Each base station provides coverage for a plurality of sectors. In communication with a user device, the transmitting antennas of a base station can utilize beam-forming techniques in order to improve the signal-to-noise ratio of forward links for the different mobile devices. Forward link (or downlink) refers to the communication link from the base stations to mobile devices, and the reverse link (or uplink) refers to the communication link from mobile devices to the base stations. Additionally, a base station using beamforming to transmit to mobile devices scattered randomly through its coverage area causes less interference to mobile devices in neighboring cells/sectors than a base station transmitting through a single antenna to all mobile devices in its coverage area. Generally, beams generated by multiple transmit antennas are narrower than the coverage area of a single antenna. While user devices in the areas covered by beams experience an enhanced SINR, User devices within the null region experience a low SINR, possibly leading to loss of data. In general, user devices in the null region are worse off than if a single transmit antenna had been utilized to transmit performance.


While the disclosure discusses beamforming as a mode of operation, the disclosure and its contents may substantially be applied to precoded or beam-steered transmissions. This may be performed by, for example, utilizing fixed or predetermined matrices or vectors for which a user is scheduled.



FIG. 1 illustrates a beam pattern 100 for use in a wireless communication system in accordance with one or more embodiments presented herein. Base station transmit antennas can generate beams (e.g., a beam pattern) that can be employed to share time-frequency resources. The beam pattern can be adjusted from time to time, either periodically or based upon patterns of communication between the user devices and the base station. Multiple antennas at a base station 102 may assign a user on a first predetermined at least one narrow beam 104 or a second predetermined at least one narrow beam 106 for a sector 108. Narrow beam, as used herein, indicates that there is a dominant vector, or vectors in the case of a preceding or beam steering, for the transmission. The number of beams shown has been limited to two for the sake of simplicity. However, additional fixed beams may be generated. Beams may be generally orthogonal as illustrated in FIG. 1, or the coverage area of the beams may overlap. Users U1 and U2 are located within the coverage area of beams 106 and 104, respectively. Consequently, users U1 and U2 experience an enhanced SINR, and/or other channel conditions similar to the benefits experienced by users in a beam-steering system. In contrast, users U3 and U4 will experience an extremely low SNR and/or other channel conditions since they are located within the null region of the beams 106 and 104. In fact, the performance for users U3 and U4 may be worse than if a single transmit antenna had been utilized.


The problems inherent in the use of narrow beams may be mitigated by generating another beam pattern that is not directed or directed for the largest portion of the sector possible. In one or more embodiments, an additional wide beam 110 is generated. Wide beam 110 provides coverage for a substantial portion of the sector including the null region not covered by narrow beams 104 and 106. Wide beam 110 provides users U3 and U4 with a guaranteed minimum level of performance.


Referring now to FIG. 2, a wireless communication system 200 in accordance with various embodiments presented herein is illustrated. System 200 can comprise one or more base stations 202 in one or more sectors that receive, transmit, repeat, etc., wireless communication signals to each other and/or to one or more mobile devices 204. Each base station 202 can comprise multiple transmitter chains and receiver chains, e.g. one for each transmit and receive antenna, each of which can in turn comprise a plurality of components associated with signal transmission and reception (e.g., processors, modulators, multiplexers, demodulators, demultiplexers, antennas, etc.). Mobile devices 204 can be, for example, cellular phones, smart phones, laptops, handheld communication devices, handheld computing devices, satellite radios, global positioning systems, PDAs, and/or any other suitable device for communicating over wireless system 200.


Referring now to FIG. 3, a multiple access wireless communication system 300 according to one or more embodiments is illustrated. A 3-sector base station 302 includes multiple antenna groups, one including antennas 304 and 306, another including antennas 308 and 310, and a third including antennas 312 and 314. According to the figure, only two antennas are shown for each antenna group, however, more or fewer antennas may be utilized for each antenna group. Typically, beamforming techniques require multiple transmit antennas to transmit beams. Mobile device 316 is in communication with antennas 312 and 314, where antennas 312 and 314 transmit information to mobile device 316 over forward link 320 and receive information from mobile device 316 over reverse link 318. Mobile device 322 is in communication with antennas 304 and 306, where antennas 304 and 306 transmit information to mobile device 322 over forward link 326 and receive information from mobile device 322 over reverse link 324.


Each group of antennas and/or the area in which they are designated to communicate may be referred to as a sector of base station 302. In one or more embodiments, antenna groups each are designed to communicate to mobile devices in a sector of the areas covered by base station 302. A base station may be a fixed station used for communicating with the terminals and may also be referred to as an access point, a Node B, or some other terminology. A mobile device may also be called a mobile station, user equipment (UE), a wireless communication device, terminal, access terminal, user device, or some other terminology.


Beamforming techniques can be used to provide fixed transmit directions in sectors or may be used in lieu of sectors. For example, beam patterns may provide multiple transmit directions in the sectors of a 3-sector base station, resulting in a virtual 6-sector base station. This ability to subdivide sectors results in increased system capacity.


Beamformed transmissions may be used with a number of different scheduling schemes, including space division multiplexing (SDM). SDM is a technique used in a multiple antenna communication system that utilizes the spatial dimensions to support additional user devices for data transmissions. A space division multiple access system (SDMA) system relies on spatial signatures associated with each user device to schedule data transmissions from or to multiple user devices and base stations. The spatial signature may be formed using the direction-of-arrival of the signal at the base station, the number of multipaths of the signal, and the attenuation of signal of each base station-mobile device pair or any other data that reflects the spatial relationship between the user device and base station. In a multiple antenna system, the spatial relationship between the base station and user device is determined based upon the signal received by the antennas at the base station. In this case, user device transmissions may be scheduled at the same time and on the same frequency on the beams and separated based upon a spatial signature. Through use of SDMA, disparate users can share time-frequency resources while not being associated with substantial cross talk.


Fixed beamforming patterns may also be used with MIMO and opportunistic beamforming scheduling techniques. In particular, user devices with well-conditioned matrix channels could be scheduled using MIMO. MIMO systems utilize multiple transmit and receive antennas to improve performance. Multiple data streams corresponding to a single user device are scheduled at the same time and frequency on multiple beams, thereby increasing the data rate. In opportunistic beamforming, also referred to as beam selection, the base station transmits to a single user device over a given set of frequencies and time using a beam. No other beams are used for transmission to any other user over those frequencies and at those times.


SDM, MIMO and opportunistic beamforming can be used with frequency division systems such as an orthogonal frequency division multiple access (OFDMA) system. An OFDMA system partitions the overall system bandwidth into multiple orthogonal subbands. These subbands are also referred to as tones, carriers, subcarriers, bins, and/or frequency channels. Each subband is associated with a subcarrier that can be modulated with data. An OFDMA system may use time and/or frequency division multiplexing to achieve orthogonality among multiple data transmissions for multiple user devices. Groups of user devices can be allocated separate subbands, and the data transmission for each user device may be sent on the subband(s) allocated to this user device. SDMA, MIMO and opportunistic beamforming can be implemented for user device allocated to different frequency regions.


In a beamformed transmission system, beamforming techniques can be used to provide fixed transmit directions in sectors or may be used in lieu of sectors. For example, beam patterns may provide multiple transmit directions in the sectors of a 3-sector base station, resulting in a virtual 6-sector base station. This ability to subdivide sectors results in increased system capacity. User devices served by a base station sector can indicate a preference for a given beam. The base station may schedule transmission with the user device on the given beam using SDM, MIMO, opportunistic beamforming or any other scheduling method. In addition, beamforming with a fixed beam pattern allows a base station to utilize SDM, MIMO and opportunistic beamforming scheduling techniques simultaneously. For example, spatially orthogonal user devices may be scheduled using SDM, user devices with well-conditioned matrix channels could be scheduled using MIMO and additional users could be scheduled using opportunistic beamforming.


Systems utilizing fixed, narrow beams and the techniques discussed above can provide for enhanced throughput in a wireless communications environment. However, such systems lack robustness due to null regions.


Looking once again at FIG. 1, user devices U1 and U2 are spatially orthogonal with disparate spatial signatures. Consequently, user device U1 and U2 would experience enhanced SINR using either SDM or opportunistic beamforming schemes. In contrast, user devices U3 and U4 will likely experience degraded SINR due to their location. Because both U3 and U4 are located within the null region, they will likely experience worse performance than if the system utilized a single transmit antenna.


Limited coverage areas of narrow beams may impact user device reliability and robustness. In general, user devices are designed to be mobile. Consequently, a user device may begin a transmission through utilization of a beam and may thereafter enter into a null region during transmission. Transmission within null regions may cause loss of data and decreased reliability. In addition, user devices may simply select the wrong beam. For example, user device U1 may be desirably associated with a second beam 106. However, if user device U1 incorrectly elects transmissions over first beam 104 or if the user device U1 is incapable of electing a beam and is assigned to first beam 104 by the base station, the user device will experience the same performance as if the user device was located in the null region. Therefore, one or more user devices in a null region or otherwise having poor performance may be assigned to the wide beam. In addition, broadcast and control transmissions may be assigned to the wide beam.


The addition of a wide beam can ensure a minimum level of performance. The wide beam can be created using a transmission scheme that emulates a single antenna. For example, the wide beam may be generated using a cyclic delay diversity scheme. In general, the wide beam will have a low SINR gain compared to the narrow beams, but a significantly wider area of coverage than the narrow beams. User device can elect to be assigned to the wide beam. Consequently, the worst performance for any user device is limited to that of a single antenna transmission. Moreover, many user devices will experience enhanced performance in the narrow beam coverage areas. The base station can schedule user devices located in the narrow beam coverage areas using SDM, MIMO or beam selection methods or any combination thereof. The addition of the wide beam provides a guaranteed minimum level of robustness.


In addition, the system may utilize the wide beam to support broadcast control channels. Because the wide beam can be undirected or directed at a majority of the sector, the wide beam can be used to transmit to most or all of the user devices served by the sector simultaneously. Consequently, the base station does not have to transmit separate control transmissions for each narrow beam. A user device can be assigned to at least one of the narrow beam and the wide beam based upon type of data that is to be transmitted to the user device.


Referring now to FIG. 4, a beam pattern 400 utilizing multiple beams 402, 404 and 406 is illustrated. In one or more alternate embodiments, a base station can generate multiple narrow beams 402, 404 and 406 to effectively communicate with mobile stations in a sector, in addition to or instead of a wide beam. Use of multiple narrow beams, may not adequately mitigate when the user device selects the wrong beam. However, as long as the correct beam is selected, user devices in the sector will experience enhanced performance. Beams 402, 404 and 406 can be either orthogonal or overlapping. As shown in FIG. 4, beams 402, 404 and 406 including their side lobes can be directed to effectively cover a sector.


In one or more embodiment, separate, fixed beams can be content specific. Fixed beams may be associated with specific, predictable directions for geographic areas or locations. Consequently, content specific to a particular location can be transmitted to user devices within the coverage area of a fixed beam associated with that location. For example, a mall can include a wireless communication system. Content specific to a first store at a first location in the mall may be transmitted using a first beam and content specific to a second store at a second location may be transmitted using a second beam. Consequently, user devices located at the first and second stores will receive transmissions specific to the store in which they are located. General mall information can be transmitted using a wide beam with a coverage area including the entire mall. Alternatively, narrow beams may be used to provide improved performance. For example, the wide beam may be used for general mall traffic, while a narrow beam may be directed at a first store having critical communication needs.


In one or more embodiments, beams are formed using a set of weights, that alter the phase, amplitude, or phase and amplitude of a particular transmission symbol or sample. These weights can be stored in a lookup table in memory. Beams can be updated by modifying the weights stored in the lookup table.


Referring now to FIG. 5, a beam pattern 500 for a sector 502 for a wireless communication system in accordance with various embodiments is illustrated. In general, SDMA, pre-coding and beamforming techniques are implemented using correlated antennas. However, uncorrelated antennas are preferable for MIMO transmissions and for receive antennas and in one or more embodiments, the same antennas may be utilized for both transmission and reception. To provide for MIMO, SDM and pre-coding simultaneously, a base station 504 can include two or more clusters of antennas. Antennas within each cluster are closely spaced. However, a larger distance separates the clusters of antennas. For example, separation of antennas within the cluster can be ½λ, while separation between clusters can be 5λ. This antenna configuration provides the diversity necessary for efficient MIMO and at the same time is sufficiently correlated for SDM, pre-coding, etc. The antenna configuration is capable of producing the beam pattern illustrated in FIG. 5. Here, clusters of beams 506 generate envelopes with the same effective beam pattern as the first and second beam shown in FIG. 1. The beam pattern illustrated in FIG. 5 can be used to support MIMO and SDMA simultaneously, thereby increasing the capacity of the system. It should be noted that in the case of preceding or beam steering, the directions show may be one direction or the dominant direction of the beam. The one or more narrow beams can each include a cluster of narrow beams and another cluster of narrow beams, wherein the clusters of narrow beams do not overlap.


Referring to FIGS. 6-7, methodologies relating to increasing capacity in wireless communication systems are illustrated. For example, methodologies can relate to using beamforming in an SDMA environment, in an FDMA environment, an OFDMA environment, a CDMA environment, a WCDMA environment, a TDMA environment or any other suitable wireless environment. While, for purposes of simplicity of explanation, the methodologies are shown and described as a series of acts, it is to be understood and appreciated that the methodologies are not limited by the order of acts, as some acts may, in accordance with one or more embodiments, occur in different orders and/or concurrently with other acts from that shown and described herein. For example, those skilled in the art will understand and appreciate that a methodology could alternatively be represented as a series of interrelated states or events, such as in a state diagram. Moreover, not all illustrated acts may be utilized to implement a methodology in accordance with one or more embodiments.


Referring now to FIG. 6, a methodology 600 for assigning a user device to a beam in a wireless communication environment in accordance with one or more embodiments presented herein is illustrated. This methodology is described with respect to a system using one or more narrow beams in combination with a wide beam, wherein time-frequency resources can be shared between one or more of a set of narrow beams and the wide beam. At 602, the spatial relationship between the user device and the base station is determined. The spatial relationship can be determined based upon the spatial signal of the base station-user device pair. Alternatively, the user device can include a global positioning system (GPS) capable of determining the location of the user device. At 604, it is determined whether the user device is to be associated with at least one narrow beam transmitted by the base station. If yes, the user device is assigned to the at least one narrow beam at 606. This assignment can be based upon information transmitted prior to the assignment, wherein the information is indicative of a predetermined at least one narrow beam and the wide beam. For instance, the information can comprise entries from a codebook. Moreover, the information can be quantized prior to transmitting such information. If no, the user device is assigned to the wide beam at 608. User devices can request specific beams or, alternatively, the base station can determine which user devices to assign to specific beams. In another example, a disparate user device can be to non-overlapping frequencies outside of the narrow beam or wide beam.


Referring now to FIG. 7, a methodology 700 for assigning a user device to a beam in a wireless communication environment in accordance with one or more embodiments presented herein is illustrated. At 702, a user device is assigned to at least one narrow beam. The channel quality indicator (CQI) (or other suitable channel quality information) for the user device is determined at 704. At 706, it is determined whether the CQI for user device is below a predetermined threshold. It should be noted that this threshold is determined by the CQI of the wide beam, or CQIs depending on the number of users assigned to the wide beam. As such, this threshold may vary over time as the CQI(s) of the user(s) assigned to the wide beam vary over time. Alternatively, a fixed threshold may also be utilized.


If no, the user device beam assignment remains unchanged at 708. If yes, the user device is assigned to the wide beam at 710. Alternatively, the quality of service (QoS) may be monitored to determine whether to switch a user device to the wide beam. The QoS, CQI, other channel information, or combinations thereof may be monitored just after the initial assignment or may be monitored periodically.


In general, user devices are capable of relocating or being relocated during voice or data transmission, thereby changing the spatial relationship between user device and base station. Accordingly, a directed narrow beam may not be an optimal mode for sending and receiving communications. Therefore, user devices may be reassigned as they move through the sector. The velocity of the user device can be monitored to determine whether the user device is moving in and out of the narrow beams so quickly that superior performance can be achieved by assigning the user device to the wide beam. In one or more embodiments, the user device can include an accelerometer. When the accelerometer indicates that the user device is moving quickly and therefore likely to move in and out of the narrow beam coverage area rapidly, the user device may be assigned to the wide beam, thereby avoiding repeated reassignment of the user device to multiple narrow beams.


It will be appreciated that, in accordance with one or more embodiments described herein, inferences can be made regarding transmission formats, frequencies, etc. As used herein, the term to “infer” or “inference” refers generally to the process of reasoning about or inferring states of the system, environment, and/or user from a set of observations as captured via events and/or data. Inference can be employed to identify a specific context or action, or can generate a probability distribution over states, for example. The inference can be probabilistic—that is, the computation of a probability distribution over states of interest based on a consideration of data and events. Inference can also refer to techniques employed for composing higher-level events from a set of events and/or data. Such inference results in the construction of new events or actions from a set of observed events and/or stored event data, whether or not the events are correlated in close temporal proximity, and whether the events and data come from one or several event and data sources.


According to an example, one or methods presented above can include making inferences regarding a pattern of beams to allocate to a particular sector based upon the quality of service required in the sector. For example, it can be determined that high quality service is required in an area due to the critical nature of the communications to user devices in that area or simply due to the large number of user devices or customers in an area.


According to another example, inferences can be made relating to a beam pattern to employ during various times of the day, week, etc., such as peak hours and the like. It will be appreciated that the foregoing examples are illustrative in nature and are not intended to limit the number of inferences that can be made or the manner in which such inferences are made in conjunction with the various embodiments and/or methods described herein.



FIG. 8 is an illustration of a system 800 that facilitates beam forming in a wireless communication environment to increase system capacity limits in accordance with one or more embodiments set forth herein. System 800 can reside in a base station and/or in a user device, as will be appreciated by one skilled in the art. System 800 comprises a receiver 802 that receives a signal and from, for instance one or more receive antennas, and performs typical actions thereon (e.g., filters, amplifies, downconverts, etc.) the received signal and digitizes the conditioned signal to obtain samples. A demodulator 804 can demodulate and provide received pilot symbols to a processor 806 for channel estimation.


Processor 806 can be a processor dedicated to analyzing information received by receiver component 802 and/or generating information for transmission by a transmitter 814. Processor 806 can be a processor that controls one or more components of user device 800, and/or a processor that analyzes information received by receiver 802, generates information for transmission by a transmitter 814, and controls one or more components of user device 800. User device 800 can include an optimization component 808 that coordinates beam assignments. Optimization component 808 may be incorporated into the processor 806. It is to be appreciated that optimization component 808 can include optimization code that performs utility based analysis in connection with assigning user devices to beams. The optimization code can utilize artificial intelligence based methods in connection with performing inference and/or probabilistic determinations and/or statistical-based determinations in connection with optimizing user device beam assignments.


User device 800 can additionally comprise memory 810 that is operatively coupled to processor 806 and that stores information related to beam pattern information, lookup tables comprising information related thereto, and any other suitable information related to beamforming as described herein. Memory 810 can additionally store protocols associated with generating lookup tables, etc., such that user device 800 can employ stored protocols and/or algorithms to increase system capacity. It will be appreciated that the data store (e.g., memories) components described herein can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. By way of illustration, and not limitation, nonvolatile memory can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM), which acts as external cache memory. By way of illustration and not limitation, RAM is available in many forms such as synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and direct Rambus RAM (DRRAM). The memory 810 of the subject systems and methods is intended to comprise, without being limited to, these and any other suitable types of memory. The processor 806 is connected to a symbol modulator 812 and transmitter 814 that transmits the modulated signal.



FIG. 9 is an illustration of a system 900 that facilitates increasing system capacity in a communication environment in accordance with various embodiments. System 900 comprises a base station 902 with a receiver 910 that receives signal(s) from one or more user devices 904 via one or more receive antennas 906, and transmits to the one or more user devices 904 through a plurality of transmit antennas 908. In one or more embodiments, receive antennas 906 and transmit antennas 908 can be implemented using a single set of antennas. Receiver 910 can receive information from receive antennas 906 and is operatively associated with a demodulator 912 that demodulates received information. Receiver 910 can be, for example, a Rake receiver (e.g., a technique that individually processes multi-path signal components using a plurality of baseband correlators, . . . ), an MMSE-based receiver, or some other suitable receiver for separating out user devices assigned thereto, as will be appreciated by one skilled in the art. According to various aspects, multiple receivers can be employed (e.g., one per receive antenna), and such receivers can communicate with each other to provide improved estimates of user data. Demodulated symbols are analyzed by a processor 914 that is similar to the processor described above with regard to FIG. 8, and is coupled to a memory 916 that stores information related to user device assignments, lookup tables related thereto and the like. Receiver output for each antenna can be jointly processed by receiver 910 and/or processor 914. A modulator 918 can multiplex the signal for transmission by a transmitter 920 through transmit antennas 908 to user devices 904.


Base station 902 further comprises an assignment component 922, which can be a processor distinct from or integral to processor 914, and which can evaluate a pool of all user devices in a sector served by base station 904 and can assign user devices to beams based at least in part upon the location of the individual user devices.



FIG. 10 shows an exemplary wireless communication system 1000. The wireless communication system 1000 depicts one base station and one user device for sake of brevity. However, it is to be appreciated that the system can include more than one base station and/or more than one user device, wherein additional base stations and/or user devices can be substantially similar or different from the exemplary base station and user device described below. In addition, it is to be appreciated that the base station and/or the user device can employ the systems (FIGS. 8-9) and/or methods (FIGS. 6-7) described herein to facilitate wireless communication there between.


Referring now to FIG. 10, on a downlink, at access point 1005, a transmit (TX) data processor 1010 receives, formats, codes, interleaves, and modulates (or symbol maps) traffic data and provides modulation symbols (“data symbols”). A symbol modulator 1015 receives and processes the data symbols and pilot symbols and provides a stream of symbols. Symbol modulator 1015 multiplexes data and pilot symbols and provides them to a transmitter unit (TMTR) 1020. Each transmit symbol may be a data symbol, a pilot symbol, or a signal value of zero. The pilot symbols may be sent continuously in each symbol period. The pilot symbols can be frequency division multiplexed (FDM), orthogonal frequency division multiplexed (OFDM), time division multiplexed (TDM), frequency division multiplexed (FDM), or code division multiplexed (CDM).


TMTR 1020 receives and converts the stream of symbols into one or more analog signals and further conditions (e.g., amplifies, filters, and frequency upconverts) the analog signals to generate a downlink signal suitable for transmission over the wireless channel. The downlink signal is then transmitted through an antenna 1025 to the user devices. At user device 1030, an antenna 1035 receives the downlink signal and provides a received signal to a receiver unit (RCVR) 1040. Receiver unit 1040 conditions (e.g., filters, amplifies, and frequency downconverts) the received signal and digitizes the conditioned signal to obtain samples. A symbol demodulator 1045 demodulates and provides received pilot symbols to a processor 1050 for channel estimation. Symbol demodulator 1045 further receives a frequency response estimate for the downlink from processor 1050, performs data demodulation on the received data symbols to obtain data symbol estimates (which are estimates of the transmitted data symbols), and provides the data symbol estimates to an RX data processor 1055, which demodulates (i.e., symbol demaps), deinterleaves, and decodes the data symbol estimates to recover the transmitted traffic data. The processing by symbol demodulator 1045 and RX data processor 1055 is complementary to the processing by symbol modulator 1015 and TX data processor 1010, respectively, at access point 1005.


On the uplink, a TX data processor 1060 processes traffic data and provides data symbols. A symbol modulator 1065 receives and multiplexes the data symbols with pilot symbols, performs modulation, and provides a stream of symbols. A transmitter unit 1070 then receives and processes the stream of symbols to generate an uplink signal, which is transmitted by the antenna 1035 to the access point 1005.


At access point 1005, the uplink signal from user device 1030 is received by the antenna 1025 and processed by a receiver unit 1075 to obtain samples. A symbol demodulator 1080 then processes the samples and provides received pilot symbols and data symbol estimates for the uplink. An RX data processor 1085 processes the data symbol estimates to recover the traffic data transmitted by user device 1030. A processor 1090 performs channel estimation for each active user device transmitting on the uplink. Multiple user devices may transmit pilot concurrently on the uplink on their respective assigned sets of pilot subbands, where the pilot subband sets may be interlaced.


Processors 1090 and 1050 direct (e.g., control, coordinate, manage, etc.) operation at access point 1005 and user device 1030, respectively. Respective processors 1090 and 1050 can be associated with memory units (not shown) that store program codes and data. Processors 1090 and 1050 can also perform computations to derive frequency and impulse response estimates for the uplink and downlink, respectively.


For a multiple-access system (e.g., FDMA, OFDMA, CDMA, TDMA, SDMA, etc.), multiple user devices can transmit concurrently on the uplink.


For such a system, the pilot subbands may be shared among different user devices. The channel estimation techniques may be used in cases where the pilot subbands for each user device span the entire operating band (possibly except for the band edges). Such a pilot subband structure would be desirable to obtain frequency diversity for each user device. The techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing units used for channel estimation may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof. With software, implementation can be through modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in memory unit and executed by the processors 1090 and 1050.


For a software implementation, the techniques described herein may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in memory units and executed by processors. The memory unit may be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor via various means as is known in the art.


What has been described above includes examples of one or more embodiments. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the aforementioned embodiments, but one of ordinary skill in the art may recognize that many further combinations and permutations of various embodiments are possible. Accordingly, the described embodiments are intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims. Furthermore, to the extent that the term “includes” is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.

Claims
  • 1. A method for enhancing performance for a wireless communication environment, comprising: determining channel information for user devices;assigning the user devices to at least one beam from a predetermined set of beams, the set of beams comprising at least one narrow beam and a wide beam, wherein assigning the user devices to the at least one narrow beam comprises scheduling a first user device using a spatial division multiplexing (SDM) scheduling technique and scheduling a second user device using a multiple-in multiple-out (MIMO) scheduling technique, and wherein the at least one narrow beam and the wide beam are separate beams,reassigning at least one user device from a narrow beam to the wide beam if channel quality information is lower than a threshold value,wherein the at least one narrow beam comprises a first cluster of narrow beams having a dominant direction and a second cluster of narrow beams having a dominant direction, wherein the dominant direction of the first cluster is different from the dominant direction of the second cluster; andscheduling the first and second user devices simultaneously, using said SDM scheduling technique and said MIMO scheduling technique, by employing the first cluster of narrow beams and the second cluster of narrow beams.
  • 2. The method of claim 1, further comprising assigning another user device during a same time period to at least some overlapping frequencies and a beam that is not part of the predetermined set of beams.
  • 3. The method of claim 1, further comprising generating the wide beam using a cyclic delay diversity scheme.
  • 4. The method of claim 1, further comprising assigning, to the wide beam, broadcast control transmissions for transmission to one or more of the user devices.
  • 5. The method of claim 1, further comprising modifying the direction of the at least one narrow beam based upon a pattern of communication of the user devices.
  • 6. The method of claim 1, wherein the channel quality information comprises a channel quality indicator.
  • 7. The method of claim 1, wherein the channel quality information is a signal to interference and noise ratio.
  • 8. The method of claim 1, further comprising assigning a user device to the wide beam based upon a determined velocity of the user device, wherein the velocity is determined by an accelerometer in the user device.
  • 9. The method of claim 1, wherein assigning the user devices comprises assigning a user device based at least in part upon a request by the user device indicating at least one beam from the predetermined set of beams.
  • 10. The method of claim 1, wherein assigning the user devices comprises assigning a user device based at least in part upon a quality of service indicated for the user device.
  • 11. The method of claim 1, wherein assigning the user devices comprises assigning a user device based at least in part upon a type of data to be transmitted to the user device.
  • 12. The method of claim 1, wherein the at least one narrow beam comprises a first cluster of narrow beams and a second cluster of narrow beams, wherein at least some of the first cluster and the second cluster overlap.
  • 13. The method of claim 1, further comprising assigning another user device during a same time period to non-overlapping frequencies.
  • 14. The method of claim 1, further comprising, prior to assigning, transmitting a transmission containing information indicative of the at least one beam.
  • 15. The method of claim 14, wherein the information comprises entries from a codebook.
  • 16. The method of claim 14, further comprising quantizing the information indicative prior to transmitting.
  • 17. A wireless communication apparatus, comprising: a memory that stores information related to a predetermined set of beams, the set of beams comprising at least one narrow beam and a wide beam, wherein the at least one narrow beam and the wide beam are separate beams;a processor, coupled to the memory, that assigns user devices to at least one beam from the predetermined set of beams, wherein assigning the user devices to the at least one narrow beam comprises scheduling a first user device using a spatial division multiplexing (SDM) scheduling technique and scheduling a second user device using a multiple-in multiple-out (MIMO) scheduling technique,wherein the processor reassigns at least one user device from a narrow beam to the wide beam if channel quality information is lower than a threshold value;a first cluster of antennas, wherein a first cluster of narrow beams employs the first cluster of antennas; anda second cluster of antennas, wherein a second cluster of narrow beams utilizes the second cluster of antennas, wherein a first dominant direction of the first cluster is different from a second dominant direction of the second cluster, and wherein the first and second user devices are scheduled simultaneously, using said SDM scheduling technique and said MIMO scheduling technique, by employing the first cluster of narrow beams and the second cluster of narrow beams.
  • 18. The apparatus of claim 17, wherein the processor schedules communications for the user devices based upon a spatial division multiplexing, multiple input multiple output (MIMO) or opportunistic beamforming scheduling technique.
  • 19. The apparatus of claim 17, wherein the processor generates the wide beam using a cyclic delay diversity scheme.
  • 20. The apparatus of claim 17, wherein the processor transmits broadcast control transmissions over the wide beam.
  • 21. The apparatus of claim 17, wherein the processor modifies the direction of the at least one narrow beam based upon a pattern of communication of the user devices.
  • 22. The apparatus of claim 17, wherein the channel quality information comprises a channel quality indicator.
  • 23. The apparatus of claim 22, the channel quality indicator is a signal to interference and noise ratio.
  • 24. The apparatus of claim 17, wherein the processor assigns a user device to the wide beam based upon a velocity of the user device, wherein the velocity is determined by an accelerometer in the user device.
  • 25. The apparatus of claim 17, wherein a user device indicates a preference for the at least one beam from the predetermined set of beams in a request.
  • 26. An apparatus for enhancing performance for a wireless communication environment, comprising: means for generating at least one narrow beam;means for generating a wide beam, wherein the at least one narrow beam and the wide beam are separate beams;means for assigning user devices to at least one beam from a predetermined set of beams, the set of beams comprising the at least one narrow beam and the wide beam, wherein assigning the user devices to the at least one narrow beam comprises scheduling a first user device using a spatial division multiplexing (SDM) scheduling technique and scheduling a second user device using a multiple-in multiple-out (MIMO) scheduling technique,means for reassigning at least one user device from a narrow beam to the wide beam if channel quality information is lower than a threshold value;a first cluster of antennas, wherein a first cluster of narrow beams employs the first cluster of antennas; anda second cluster of antennas, wherein a second cluster of narrow beams utilizes the second cluster of antennas, wherein a first dominant direction of the first cluster is different from a second dominant direction of the second cluster; and wherein the first and second user devices are scheduled simultaneously, using said SDM scheduling technique and said MIMO scheduling technique, by employing the first cluster of narrow beams and the second cluster of narrow beams.
  • 27. The apparatus of claim 26, further comprising means for scheduling communications for the user devices based upon a spatial division multiplexing, multiple input multiple output (MIMO) or opportunistic beamforming scheduling technique.
  • 28. The apparatus of claim 26, further comprising means for modifying the direction of the at least one narrow beam based upon a pattern of communication of the user devices.
  • 29. The apparatus of claim 26, wherein the channel quality information comprises a channel quality indicator.
  • 30. The apparatus of claim 26, further comprising means for assigning a user device to the wide beam based upon a velocity of the user device, wherein the velocity is determined by an accelerometer in the user device.
  • 31. The apparatus of claim 26, further comprising means for indicating a preference for the at least one beam from the predetermined set of beams for a user device in a request.
  • 32. A non-transitory computer-readable medium having stored thereon computer-executable instructions for: generating at least one narrow beam;generating a wide beam, wherein the at least one narrow beam and the wide beam are separate beams;assigning user devices to at least one beam from a predetermined set of beams, the set of beams comprising the at least one narrow beam and the wide beam, wherein assigning the user devices to the at least one narrow beam comprises scheduling a first user device using a spatial division multiplexing (SDM) scheduling technique and scheduling a second user device using a multiple-in multiple-out (MIMO) scheduling technique;reassigning at least one user device from a narrow beam to the wide beam if channel quality information is lower than a threshold value;wherein the at least one narrow beam comprises a first cluster of narrow beams and a second cluster of narrow beams, wherein a first dominant direction of the first cluster is different from a second dominant direction of the second cluster; andscheduling the first and second user devices simultaneously, using said SDM scheduling technique and said MIMO scheduling technique, by employing the first cluster of narrow beams and the second cluster of narrow beams.
  • 33. The non-transitory computer-readable medium of claim 32, further comprising instructions for scheduling communications for the user devices based upon a spatial division multiplexing, multiple input multiple output (MIMO) or opportunistic beamforming scheduling technique.
  • 34. The non-transitory computer-readable medium of claim 32, further comprising instructions for generating the wide beam using a cyclic delay diversity scheme.
  • 35. The non-transitory computer-readable medium of claim 32, further comprising instructions for transmitting broadcast control transmissions over the wide beam.
  • 36. The non-transitory computer-readable medium of claim 32, further comprising instructions for modifying the direction of the at least one narrow beam based upon a pattern of communication of the user devices.
  • 37. The non-transitory computer-readable medium of claim 32, wherein the channel quality information comprises a channel quality indicator.
  • 38. The non-transitory computer-readable medium of claim 32, further comprising instructions for assigning a user device to the wide beam based upon a velocity of the user device, wherein the velocity is determined by an accelerometer in the user device.
  • 39. A processor that executes instructions for enhancing performance for a wireless communication environment, the instructions comprising: generating at least one narrow beam;generating a wide beam, wherein the at least one narrow beam and the wide beam are separate beams;assigning user devices to at least one beam from a predetermined set of beams, the set of beams comprising the at least one narrow beam and the wide beam, wherein assigning the user devices to the at least one narrow beam comprises scheduling a first user device using a spatial division multiplexing (SDM) scheduling technique and scheduling a second user device using a multiple-in multiple-out (MIMO) scheduling technique,reassigning at least one user device from a narrow beam to the wide beam if channel quality information is lower than a threshold value,wherein the at least one narrow beam comprises a first cluster of narrow beams and a second cluster of narrow beams, wherein a first dominant direction of the first cluster is different from a second dominant direction of the second cluster; andscheduling the first and second user devices simultaneously, using said SDM scheduling technique and said MIMO scheduling technique, by employing the first cluster of narrow beams and the second cluster of narrow beams.
  • 40. The processor of claim 39, further comprising instructions for scheduling communications for the user devices based upon a spatial division multiplexing, multiple input multiple output (MIMO) or opportunistic beamforming scheduling technique.
  • 41. A mobile device that facilitates communicating over a wireless network, comprising: a component configured to request assignment of the user device to at least one beam from a predetermined set of beams, the set of beams comprising at least one narrow beam and a wide beam, wherein the component is also configured to request reassignment of the user device from the at least one narrow beam to the wide beam if channel quality information is lower than a threshold value, and wherein the at least one narrow beam and the wide beam are separate beams;wherein requesting assignment comprises transmitting an indication of the at least one beam;a transmitter that transmits the requests to a base station;a first cluster of antennas, wherein a first cluster of narrow beams employs the first cluster of antennas; anda second cluster of antennas, wherein a second cluster of narrow beams utilizes the second cluster of antennas, wherein a first dominant direction of the first cluster is different from a second dominant direction of the second cluster, and wherein the first and second user devices are scheduled simultaneously, using said SDM scheduling technique and said MIMO scheduling technique, by employing the first cluster of narrow beams and the second cluster of narrow beams.
  • 42. The mobile device of claim 41, wherein the device is at least one of a cellular phone, a smartphone, a handheld communication device, a handheld computing device, a satellite radio, a global positioning system, a laptop, and a PDA.
  • 43. The method of claim 1, further comprising assigning a third user device to the wide beam while at least one of the first and second user devices is assigned to the narrow beam.
  • 44. The processor of claim 39, the instructions further comprising: prior to assigning, transmitting a transmission containing information indicative of the at least one beam.
  • 45. The non-transitory computer-readable medium of claim 32, further comprising instructions for: prior to assigning, transmitting a transmission containing information indicative of the at least one beam.
CROSS-REFERENCE TO RELATED APPLICATION

The present Application for Patent claims priority to Provisional Application No. 60/691,716 filed Jun. 16, 2005, and assigned to the assignee hereof and hereby expressly incorporated by reference herein. The present Application for Patent is related to the following co-pending U.S. Patent Applications: “CHANNEL QUALITY REPORTING FOR ADAPTIVE SECTORIZATION” having U.S. application Ser. No. 11/261,822, filed concurrently herewith, assigned to the assignee hereof, and expressly incorporated by reference herein. “SDMA RESOURCE MANAGEMENT” having U.S. application Ser. No. 11/261,837, filed concurrently herewith, assigned to the assignee hereof, and expressly incorporated by reference herein.

US Referenced Citations (757)
Number Name Date Kind
4393276 Steele Jul 1983 A
4554668 Deman et al. Nov 1985 A
4747137 Matsunaga May 1988 A
4783779 Takahata et al. Nov 1988 A
4783780 Alexis Nov 1988 A
4975952 Mabey et al. Dec 1990 A
5008900 Critchlow et al. Apr 1991 A
5115248 Roederer May 1992 A
5268694 Jan et al. Dec 1993 A
5282222 Fattouche et al. Jan 1994 A
5363408 Paik et al. Nov 1994 A
5371761 Daffara et al. Dec 1994 A
5384810 Amrany Jan 1995 A
5406551 Saito et al. Apr 1995 A
5410538 Roche et al. Apr 1995 A
5455839 Eyubogiu Oct 1995 A
5465253 Rahnema Nov 1995 A
5491727 Petit Feb 1996 A
5513379 Benveniste et al. Apr 1996 A
5539748 Raith Jul 1996 A
5548582 Brajal et al. Aug 1996 A
5553069 Ueno et al. Sep 1996 A
5583869 Grube et al. Dec 1996 A
5594738 Crisler et al. Jan 1997 A
5604744 Andersson et al. Feb 1997 A
5612978 Blanchard et al. Mar 1997 A
5625876 Gilhousen et al. Apr 1997 A
5684491 Newman et al. Nov 1997 A
5726978 Frodigh et al. Mar 1998 A
5732113 Schmidl et al. Mar 1998 A
5745487 Hamaki Apr 1998 A
5768276 Diachina et al. Jun 1998 A
5790537 Yoon et al. Aug 1998 A
5812938 Gilhousen et al. Sep 1998 A
5815488 Williams et al. Sep 1998 A
5822368 Wang Oct 1998 A
5828650 Malkamaki et al. Oct 1998 A
5838268 Frenkel Nov 1998 A
5867478 Baum et al. Feb 1999 A
5870393 Yano et al. Feb 1999 A
5887023 Mabuchi Mar 1999 A
5907585 Suzuki et al. May 1999 A
5920571 Houck et al. Jul 1999 A
5926470 Tiedemann, Jr. Jul 1999 A
5933421 Alamouti et al. Aug 1999 A
5949814 Odenwalder et al. Sep 1999 A
5953325 Willars Sep 1999 A
5955992 Shattil Sep 1999 A
5956642 Larsson et al. Sep 1999 A
5995992 Eckard Nov 1999 A
5999826 Whinnett Dec 1999 A
6002942 Park Dec 1999 A
6016123 Barton et al. Jan 2000 A
6038263 Kotzin et al. Mar 2000 A
6038450 Brink et al. Mar 2000 A
6052364 Chalmers et al. Apr 2000 A
6061337 Light et al. May 2000 A
6067315 Sandin May 2000 A
6075350 Peng et al. Jun 2000 A
6075797 Thomas Jun 2000 A
6076114 Wesley et al. Jun 2000 A
6088345 Sakoda et al. Jul 2000 A
6088592 Doner et al. Jul 2000 A
6108323 Gray et al. Aug 2000 A
6108550 Wiorek et al. Aug 2000 A
6112094 Dent Aug 2000 A
6128776 Kang et al. Oct 2000 A
6138037 Jaamies Oct 2000 A
6141317 Marchok et al. Oct 2000 A
6154484 Lee et al. Nov 2000 A
6169910 Tamil et al. Jan 2001 B1
6172993 Kim et al. Jan 2001 B1
6175550 Van Nee Jan 2001 B1
6175650 Sindhu et al. Jan 2001 B1
6176550 Lamart et al. Jan 2001 B1
6198775 Khayrallah et al. Mar 2001 B1
6215983 Dogan et al. Apr 2001 B1
6226280 Roark et al. May 2001 B1
6232918 Wax et al. May 2001 B1
6240129 Reusens et al. May 2001 B1
6249683 Lundby et al. Jun 2001 B1
6256478 Allen et al. Jul 2001 B1
6271946 Chang et al. Aug 2001 B1
6272122 Wee et al. Aug 2001 B1
6310704 Dogan et al. Oct 2001 B1
6317435 Tiedemann, Jr. et al. Nov 2001 B1
6335922 Tiedemann, Jr. et al. Jan 2002 B1
6337659 Kim et al. Jan 2002 B1
6337983 Bonta et al. Jan 2002 B1
6353637 Mansour et al. Mar 2002 B1
6363060 Sarkar Mar 2002 B1
6374115 Barnes et al. Apr 2002 B1
6377539 Kang et al. Apr 2002 B1
6377809 Rezaiifar et al. Apr 2002 B1
6388998 Kasturia May 2002 B1
6393008 Cheng et al. May 2002 B1
6393012 Pankaj May 2002 B1
6401062 Murashima Jun 2002 B1
6438369 Huang et al. Aug 2002 B1
6449246 Barton et al. Sep 2002 B1
6466800 Sydon et al. Oct 2002 B1
6473467 Wallace et al. Oct 2002 B1
6477317 Itokawa Nov 2002 B1
6478422 Hansen Nov 2002 B1
6483820 Davidson et al. Nov 2002 B1
6487243 Hwang et al. Nov 2002 B1
6496790 Kathavate et al. Dec 2002 B1
6501810 Karim et al. Dec 2002 B1
6507601 Parsa et al. Jan 2003 B2
6519462 Lu et al. Feb 2003 B1
6529525 Pecen et al. Mar 2003 B1
6535666 Dogan et al. Mar 2003 B1
6539008 Ahn et al. Mar 2003 B1
6539213 Richards et al. Mar 2003 B1
6542485 Mujtaba Apr 2003 B1
6542743 Soliman Apr 2003 B1
6563806 Yano et al. May 2003 B1
6563881 Sakoda et al. May 2003 B1
6577739 Hurting et al. Jun 2003 B1
6584140 Lee Jun 2003 B1
6590881 Wallace et al. Jul 2003 B1
6597746 Amrany et al. Jul 2003 B1
6601206 Marvasti Jul 2003 B1
6614857 Buehrer et al. Sep 2003 B1
6625172 Odenwalder et al. Sep 2003 B2
6636568 Kadous Oct 2003 B2
6654339 Bohnke et al. Nov 2003 B1
6654431 Barton et al. Nov 2003 B1
6657949 Jones, IV et al. Dec 2003 B1
6658258 Chen et al. Dec 2003 B1
6674787 Dick et al. Jan 2004 B1
6674810 Cheng Jan 2004 B1
6675012 Gray et al. Jan 2004 B2
6678318 Lai Jan 2004 B1
6690951 Cuffaro et al. Feb 2004 B1
6693952 Chuah et al. Feb 2004 B1
6701165 Ho et al. Mar 2004 B1
6704571 Moon Mar 2004 B1
6711400 Aura Mar 2004 B1
6717908 Vijayan et al. Apr 2004 B2
6721568 Gustavsson et al. Apr 2004 B1
6724719 Tong et al. Apr 2004 B1
6731602 Watanabe et al. May 2004 B1
6735244 Hasegawa et al. May 2004 B1
6744743 Walton et al. Jun 2004 B2
6748220 Chow et al. Jun 2004 B1
6751444 Meiyappan Jun 2004 B1
6751456 Bilgic et al. Jun 2004 B2
6754511 Halford et al. Jun 2004 B1
6763009 Bedekar et al. Jul 2004 B1
6765969 Vook et al. Jul 2004 B1
6776165 Jin et al. Aug 2004 B2
6776765 Soukup et al. Aug 2004 B2
6778513 Kasapi et al. Aug 2004 B2
6785341 Walton et al. Aug 2004 B2
6798736 Black et al. Sep 2004 B1
6799043 Tiedemann, Jr. et al. Sep 2004 B2
6802035 Catreux et al. Oct 2004 B2
6804307 Popovic Oct 2004 B1
6813284 Vayanos et al. Nov 2004 B2
6821535 Nurmi et al. Nov 2004 B2
6828293 Hazenkamp et al. Dec 2004 B1
6829293 Jones et al. Dec 2004 B2
6831943 Dabak et al. Dec 2004 B1
6842487 Larsson Jan 2005 B1
6850481 Wu et al. Feb 2005 B2
6850509 Lee et al. Feb 2005 B2
6862271 Medvedev et al. Mar 2005 B2
6870808 Liu Mar 2005 B1
6870826 Ishizu Mar 2005 B1
6904097 Agami et al. Jun 2005 B2
6904283 Li et al. Jun 2005 B2
6904550 Sibecas et al. Jun 2005 B2
6907020 Periyalwar et al. Jun 2005 B2
6907269 Yamaguchi et al. Jun 2005 B2
6909707 Rotstein et al. Jun 2005 B2
6909797 Romsdahl et al. Jun 2005 B2
6917602 Toskala et al. Jul 2005 B2
6917821 Kadous et al. Jul 2005 B2
6927728 Vook et al. Aug 2005 B2
6928047 Xia Aug 2005 B1
6934266 Dulin et al. Aug 2005 B2
6934275 Love et al. Aug 2005 B1
6934340 Dollard et al. Aug 2005 B1
6940827 Li et al. Sep 2005 B2
6940842 Proctor, Jr. Sep 2005 B2
6940845 Benveniste et al. Sep 2005 B2
6954448 Farley et al. Oct 2005 B2
6954481 Laroia et al. Oct 2005 B1
6954622 Nelson et al. Oct 2005 B2
6961364 Laroia et al. Nov 2005 B1
6963543 Diep et al. Nov 2005 B2
6970682 Crilly, Jr. et al. Nov 2005 B2
6975868 Joshi et al. Dec 2005 B2
6980540 Laroia et al. Dec 2005 B1
6985434 Wu et al. Jan 2006 B2
6985453 Lundby et al. Jan 2006 B2
6985466 Yun et al. Jan 2006 B1
6985498 Laroia et al. Jan 2006 B2
6987746 Song Jan 2006 B1
6993342 Kuchibhotla et al. Jan 2006 B2
7002900 Walton et al. Feb 2006 B2
7006529 Alastalo et al. Feb 2006 B2
7006557 Subrahmanya et al. Feb 2006 B2
7006848 Ling et al. Feb 2006 B2
7009500 Rao et al. Mar 2006 B2
7010048 Shattil Mar 2006 B1
7013143 Love et al. Mar 2006 B2
7016318 Pankaj et al. Mar 2006 B2
7016319 Baum et al. Mar 2006 B2
7016425 Kraiem Mar 2006 B1
7020110 Walton et al. Mar 2006 B2
7039356 Nguyen et al. May 2006 B2
7039370 Laroia et al. May 2006 B2
7042856 Walton et al. May 2006 B2
7042857 Krishnan et al. May 2006 B2
7047006 Classon et al. May 2006 B2
7050402 Schmidl et al. May 2006 B2
7050405 Attar et al. May 2006 B2
7050759 Gaal et al. May 2006 B2
7054301 Sousa et al. May 2006 B1
7061898 Hashmen et al. Jun 2006 B2
7069009 Li et al. Jun 2006 B2
7072315 Liu et al. Jul 2006 B1
7079867 Chun et al. Jul 2006 B2
7085574 Gaal et al. Aug 2006 B2
7095708 Alamouti et al. Aug 2006 B1
7095709 Walton et al. Aug 2006 B2
7099299 Liang et al. Aug 2006 B2
7099630 Brunner et al. Aug 2006 B2
7103384 Chun et al. Sep 2006 B2
7106319 Ishiyama Sep 2006 B2
7113808 Hwang et al. Sep 2006 B2
7120134 Tiedemann, Jr. et al. Oct 2006 B2
7120395 Tong et al. Oct 2006 B2
7126928 Tiedemann, Jr. et al. Oct 2006 B2
7133460 Bae et al. Nov 2006 B2
7139328 Thomas et al. Nov 2006 B2
7142864 Laroia et al. Nov 2006 B2
7145940 Gore et al. Dec 2006 B2
7145959 Harel et al. Dec 2006 B2
7149199 Sung et al. Dec 2006 B2
7149238 Agee et al. Dec 2006 B2
7151761 Palenius et al. Dec 2006 B1
7151936 Wager et al. Dec 2006 B2
7154936 Bjerke et al. Dec 2006 B2
7155236 Chen et al. Dec 2006 B2
7157351 Cheng et al. Jan 2007 B2
7161971 Tiedemann, Jr. et al. Jan 2007 B2
7164649 Walton et al. Jan 2007 B2
7164696 Sano et al. Jan 2007 B2
7167916 Willen et al. Jan 2007 B2
7170937 Zhou Jan 2007 B2
7177297 Agrawal et al. Feb 2007 B2
7177351 Kadous Feb 2007 B2
7180627 Moylan et al. Feb 2007 B2
7181170 Love et al. Feb 2007 B2
7184426 Padovani et al. Feb 2007 B2
7188300 Eriksson et al. Mar 2007 B2
7197282 Dent et al. Mar 2007 B2
7200177 Miyoshi Apr 2007 B2
7209712 Holtzman et al. Apr 2007 B2
7215979 Nakagawa et al. May 2007 B2
7230942 Laroia et al. Jun 2007 B2
7233634 Hassell Sweatman et al. Jun 2007 B1
7236747 Meacham et al. Jun 2007 B1
7242722 Krauss et al. Jul 2007 B2
7243150 Sher et al. Jul 2007 B2
7248559 Ma et al. Jul 2007 B2
7248841 Agee et al. Jul 2007 B2
7254158 Agrawal et al. Aug 2007 B2
7257167 Lau Aug 2007 B2
7257406 Ji et al. Aug 2007 B2
7257423 Iochi Aug 2007 B2
7260153 Nissani Aug 2007 B2
7280467 Smee et al. Oct 2007 B2
7289570 Schmidl et al. Oct 2007 B2
7289585 Sandhu et al. Oct 2007 B2
7290195 Guo et al. Oct 2007 B2
7292651 Li Nov 2007 B2
7292863 Chen et al. Nov 2007 B2
7295509 Laroia et al. Nov 2007 B2
7313086 Aizawa Dec 2007 B2
7313126 Yun et al. Dec 2007 B2
7313174 Alard et al. Dec 2007 B2
7313407 Shapira Dec 2007 B2
7327812 Auer Feb 2008 B2
7330701 Mukkavilli et al. Feb 2008 B2
7336727 Mukkavilli et al. Feb 2008 B2
7349371 Schein Mar 2008 B2
7349667 Magee et al. Mar 2008 B2
7356000 Oprescu-Surcobe et al. Apr 2008 B2
7356005 Derryberry et al. Apr 2008 B2
7356073 Heikkila Apr 2008 B2
7359327 Oshiba Apr 2008 B2
7363055 Castrogiovanni et al. Apr 2008 B2
7366223 Chen et al. Apr 2008 B1
7366253 Kim et al. Apr 2008 B2
7366520 Haustein et al. Apr 2008 B2
7369531 Cho et al. May 2008 B2
7372911 Lindskog et al. May 2008 B1
7372912 Seo et al. May 2008 B2
7379489 Zuniga et al. May 2008 B2
7382764 Uehara et al. Jun 2008 B2
7392014 Baker et al. Jun 2008 B2
7394865 Borran et al. Jul 2008 B2
7403745 Dominique et al. Jul 2008 B2
7403748 Keskitalo et al. Jul 2008 B1
7406119 Yamano et al. Jul 2008 B2
7406336 Astely et al. Jul 2008 B2
7411898 Erlich et al. Aug 2008 B2
7412212 Hottinen Aug 2008 B2
7418043 Shattil Aug 2008 B2
7418246 Kim et al. Aug 2008 B2
7423991 Cho et al. Sep 2008 B2
7426426 Van Baren et al. Sep 2008 B2
7428426 Kiran et al. Sep 2008 B2
7433661 Kogiantis et al. Oct 2008 B2
7437164 Agrawal et al. Oct 2008 B2
7443835 Lakshmi Narayanan et al. Oct 2008 B2
7447270 Hottinen et al. Nov 2008 B1
7450532 Chae et al. Nov 2008 B2
7450548 Haustein et al. Nov 2008 B2
7460466 Lee et al. Dec 2008 B2
7463698 Fujii et al. Dec 2008 B2
7468943 Gu et al. Dec 2008 B2
7469011 Lin et al. Dec 2008 B2
7471963 Kim et al. Dec 2008 B2
7483408 Bevan et al. Jan 2009 B2
7483719 Kim et al. Jan 2009 B2
7486408 Van Der Schaar et al. Feb 2009 B2
7486735 Dubuc et al. Feb 2009 B2
7492788 Zhang et al. Feb 2009 B2
7499393 Ozluturk et al. Mar 2009 B2
7508748 Kadous Mar 2009 B2
7508842 Baum et al. Mar 2009 B2
7512096 Kuzminskiy et al. Mar 2009 B2
7545867 Lou et al. Jun 2009 B1
7548506 Ma et al. Jun 2009 B2
7551546 Ma et al. Jun 2009 B2
7551564 Mattina Jun 2009 B2
7558293 Choi et al. Jul 2009 B2
7573900 Kim et al. Aug 2009 B2
7599327 Zhuang Oct 2009 B2
7616955 Kim et al. Nov 2009 B2
7627051 Shen et al. Dec 2009 B2
7664061 Hottinen Feb 2010 B2
7676007 Choi et al. Mar 2010 B1
7684507 Levy Mar 2010 B2
7724777 Sutivong et al. May 2010 B2
7899497 Kish et al. Mar 2011 B2
7916624 Laroia et al. Mar 2011 B2
7924699 Laroia et al. Apr 2011 B2
7990843 Laroia et al. Aug 2011 B2
7990844 Laroia et al. Aug 2011 B2
8095141 Teague Jan 2012 B2
8098568 Laroia et al. Jan 2012 B2
8098569 Laroia et al. Jan 2012 B2
8462859 Sampath et al. Jun 2013 B2
8477684 Khandekar et al. Jul 2013 B2
20010021180 Lee et al. Sep 2001 A1
20010021650 Bilgic et al. Sep 2001 A1
20010024427 Suzuki Sep 2001 A1
20010030948 Tiedemann, Jr. Oct 2001 A1
20010047424 Alastalo et al. Nov 2001 A1
20010053140 Choi et al. Dec 2001 A1
20010055294 Motoyoshi et al. Dec 2001 A1
20010055297 Benveniste et al. Dec 2001 A1
20020000948 Chun et al. Jan 2002 A1
20020015405 Sepponen et al. Feb 2002 A1
20020018157 Zhang et al. Feb 2002 A1
20020039912 Yamaguchi et al. Apr 2002 A1
20020044524 Laroia et al. Apr 2002 A1
20020058525 Kasapi et al. May 2002 A1
20020061742 Lapaille et al. May 2002 A1
20020077152 Johnson et al. Jun 2002 A1
20020085521 Tripathi et al. Jul 2002 A1
20020090004 Rinchiuso Jul 2002 A1
20020090024 Tan et al. Jul 2002 A1
20020101839 Farley et al. Aug 2002 A1
20020122381 Wu et al. Sep 2002 A1
20020122400 Vayanos et al. Sep 2002 A1
20020122403 Hashem et al. Sep 2002 A1
20020128035 Jokinen et al. Sep 2002 A1
20020147953 Catreux et al. Oct 2002 A1
20020159422 Li et al. Oct 2002 A1
20020160769 Gray et al. Oct 2002 A1
20020160781 Bark et al. Oct 2002 A1
20020168946 Aizawa et al. Nov 2002 A1
20020172293 Kuchi et al. Nov 2002 A1
20020176398 Nidda Nov 2002 A1
20020181571 Yamano et al. Dec 2002 A1
20020193146 Wallace et al. Dec 2002 A1
20030002464 Rezaiifar et al. Jan 2003 A1
20030020651 Crilly, Jr. et al. Jan 2003 A1
20030027579 Sydon Feb 2003 A1
20030036359 Dent et al. Feb 2003 A1
20030040283 Kawai et al. Feb 2003 A1
20030043732 Walton et al. Mar 2003 A1
20030043764 Kim et al. Mar 2003 A1
20030063579 Lee Apr 2003 A1
20030068983 Kim et al. Apr 2003 A1
20030072254 Ma et al. Apr 2003 A1
20030072255 Ma et al. Apr 2003 A1
20030072280 McFarland et al. Apr 2003 A1
20030072395 Jia et al. Apr 2003 A1
20030073409 Nobukiyo et al. Apr 2003 A1
20030073464 Giannakis et al. Apr 2003 A1
20030076890 Hochwald et al. Apr 2003 A1
20030086371 Walton et al. May 2003 A1
20030086393 Vasudevan et al. May 2003 A1
20030096579 Ito et al. May 2003 A1
20030103520 Chen et al. Jun 2003 A1
20030109266 Rafiah et al. Jun 2003 A1
20030112745 Zhuang et al. Jun 2003 A1
20030123414 Tong et al. Jul 2003 A1
20030125040 Walton et al. Jul 2003 A1
20030128658 Walton et al. Jul 2003 A1
20030133426 Schein et al. Jul 2003 A1
20030142648 Semper Jul 2003 A1
20030142729 Subrahmanya et al. Jul 2003 A1
20030147371 Choi et al. Aug 2003 A1
20030161281 Dulin et al. Aug 2003 A1
20030161282 Medvedev et al. Aug 2003 A1
20030165189 Kadous et al. Sep 2003 A1
20030181170 Sim Sep 2003 A1
20030185310 Ketchum et al. Oct 2003 A1
20030190897 Lei et al. Oct 2003 A1
20030193915 Lee et al. Oct 2003 A1
20030202491 Tiedemann, Jr. et al. Oct 2003 A1
20030202560 Tiedemann, Jr. et al. Oct 2003 A1
20030216156 Chun Nov 2003 A1
20030228850 Hwang Dec 2003 A1
20030235255 Ketchum et al. Dec 2003 A1
20030236080 Kadous et al. Dec 2003 A1
20040001429 Ma et al. Jan 2004 A1
20040001460 Bevan et al. Jan 2004 A1
20040002364 Trikkonen et al. Jan 2004 A1
20040009783 Miyoshi et al. Jan 2004 A1
20040010623 Sher et al. Jan 2004 A1
20040015692 Green et al. Jan 2004 A1
20040017785 Zelst Jan 2004 A1
20040032443 Moylan et al. Feb 2004 A1
20040042558 Hwang et al. Mar 2004 A1
20040048609 Kosaka et al. Mar 2004 A1
20040048630 Shapira et al. Mar 2004 A1
20040054999 Willen et al. Mar 2004 A1
20040057394 Holtzman et al. Mar 2004 A1
20040058687 Kim et al. Mar 2004 A1
20040066754 Hottinen et al. Apr 2004 A1
20040066761 Giannakis et al. Apr 2004 A1
20040066772 Moon et al. Apr 2004 A1
20040067756 Wager et al. Apr 2004 A1
20040072565 Nobukiyo et al. Apr 2004 A1
20040076185 Kim et al. Apr 2004 A1
20040077345 Turner et al. Apr 2004 A1
20040077379 Smith et al. Apr 2004 A1
20040081073 Walton et al. Apr 2004 A1
20040081195 El-Maleh et al. Apr 2004 A1
20040087325 Cheng et al. May 2004 A1
20040095907 Agee et al. May 2004 A1
20040097215 Abe et al. May 2004 A1
20040097240 Chen et al. May 2004 A1
20040098505 Clemmensen May 2004 A1
20040105489 Kim et al. Jun 2004 A1
20040114618 Tong et al. Jun 2004 A1
20040120411 Walton et al. Jun 2004 A1
20040125792 Bradbury et al. Jul 2004 A1
20040128605 Sibecas et al. Jul 2004 A1
20040131007 Smee et al. Jul 2004 A1
20040131008 Zuniga et al. Jul 2004 A1
20040131038 Kim et al. Jul 2004 A1
20040131110 Alard et al. Jul 2004 A1
20040136344 Kim et al. Jul 2004 A1
20040136349 Walton et al. Jul 2004 A1
20040156328 Walton et al. Aug 2004 A1
20040160914 Sarkar et al. Aug 2004 A1
20040160933 Odenwalder et al. Aug 2004 A1
20040162083 Chen et al. Aug 2004 A1
20040165564 Kim et al. Aug 2004 A1
20040166887 Laroia et al. Aug 2004 A1
20040170152 Nagao et al. Sep 2004 A1
20040170157 Kim et al. Sep 2004 A1
20040171384 Holma et al. Sep 2004 A1
20040171385 Haustein et al. Sep 2004 A1
20040178954 Vook et al. Sep 2004 A1
20040179480 Attar et al. Sep 2004 A1
20040179494 Attar et al. Sep 2004 A1
20040179506 Padovani et al. Sep 2004 A1
20040179627 Ketchum et al. Sep 2004 A1
20040181569 Attar et al. Sep 2004 A1
20040185792 Alexiou et al. Sep 2004 A1
20040190640 Dubuc et al. Sep 2004 A1
20040202257 Mehta et al. Oct 2004 A1
20040208138 Hayashi et al. Oct 2004 A1
20040218520 Aizawa et al. Nov 2004 A1
20040219819 Di Mascio et al. Nov 2004 A1
20040219919 Whinnett et al. Nov 2004 A1
20040224711 Panchal et al. Nov 2004 A1
20040228267 Agrawal et al. Nov 2004 A1
20040228313 Cheng et al. Nov 2004 A1
20040229615 Agrawal et al. Nov 2004 A1
20040240419 Abrishamkar et al. Dec 2004 A1
20040240572 Brutel et al. Dec 2004 A1
20040248604 Vaidyanathan et al. Dec 2004 A1
20040252529 Huber et al. Dec 2004 A1
20040252629 Hasegawa et al. Dec 2004 A1
20040252655 Lim et al. Dec 2004 A1
20040252662 Cho Dec 2004 A1
20040257979 Ro et al. Dec 2004 A1
20040264507 Cho et al. Dec 2004 A1
20040264585 Borran et al. Dec 2004 A1
20040264593 Shim et al. Dec 2004 A1
20050002412 Sagfors et al. Jan 2005 A1
20050002440 Alamouti et al. Jan 2005 A1
20050002467 Seo et al. Jan 2005 A1
20050002468 Walton et al. Jan 2005 A1
20050003782 Wintzell Jan 2005 A1
20050008091 Boutros et al. Jan 2005 A1
20050009486 Al-Dhahir et al. Jan 2005 A1
20050013263 Kim et al. Jan 2005 A1
20050025093 Yun et al. Feb 2005 A1
20050030886 Wu et al. Feb 2005 A1
20050030964 Tiedemann, Jr. et al. Feb 2005 A1
20050034079 Gunasekar et al. Feb 2005 A1
20050041611 Sandhu Feb 2005 A1
20050041618 Wei et al. Feb 2005 A1
20050041750 Lau et al. Feb 2005 A1
20050041775 Batzinger et al. Feb 2005 A1
20050044206 Johansson et al. Feb 2005 A1
20050047517 Georgios et al. Mar 2005 A1
20050052991 Kadous et al. Mar 2005 A1
20050053081 Andersson et al. Mar 2005 A1
20050053151 Lin et al. Mar 2005 A1
20050063298 Ling et al. Mar 2005 A1
20050068921 Liu Mar 2005 A1
20050073976 Fujii Apr 2005 A1
20050084000 Krauss et al. Apr 2005 A1
20050085195 Tong et al. Apr 2005 A1
20050085236 Gerlach et al. Apr 2005 A1
20050111397 Attar et al. May 2005 A1
20050113100 Oprescu-Surcobe et al. May 2005 A1
20050122898 Jang et al. Jun 2005 A1
20050128683 Watanabe et al. Jun 2005 A1
20050128983 Kim et al. Jun 2005 A1
20050135324 Kim et al. Jun 2005 A1
20050135498 Yee Jun 2005 A1
20050141624 Lakshmipathi et al. Jun 2005 A1
20050147024 Jung et al. Jul 2005 A1
20050147025 Auer et al. Jul 2005 A1
20050152484 Sandhu et al. Jul 2005 A1
20050157807 Shim et al. Jul 2005 A1
20050159162 Park Jul 2005 A1
20050164709 Balasubramanian et al. Jul 2005 A1
20050165949 Teague Jul 2005 A1
20050174981 Heath et al. Aug 2005 A1
20050175070 Grob et al. Aug 2005 A1
20050180311 Wang et al. Aug 2005 A1
20050180313 Kim et al. Aug 2005 A1
20050181799 Laroia et al. Aug 2005 A1
20050192011 Hong et al. Sep 2005 A1
20050195733 Walton et al. Sep 2005 A1
20050195852 Vayanos et al. Sep 2005 A1
20050195886 Lampinen et al. Sep 2005 A1
20050201296 Vannithamby et al. Sep 2005 A1
20050207367 Onggosanusi et al. Sep 2005 A1
20050215196 Krishnan et al. Sep 2005 A1
20050215251 Krishnan et al. Sep 2005 A1
20050226204 Uehara et al. Oct 2005 A1
20050239465 Lee et al. Oct 2005 A1
20050243791 Park et al. Nov 2005 A1
20050246548 Laitinen Nov 2005 A1
20050249266 Brown et al. Nov 2005 A1
20050254416 Laroia et al. Nov 2005 A1
20050254467 Li et al. Nov 2005 A1
20050254477 Lee et al. Nov 2005 A1
20050254556 Fujii et al. Nov 2005 A1
20050259005 Chiang et al. Nov 2005 A1
20050259723 Blanchard et al. Nov 2005 A1
20050259757 Wu et al. Nov 2005 A1
20050265220 Erlich et al. Dec 2005 A1
20050265293 Ro et al. Dec 2005 A1
20050265470 Kishigami et al. Dec 2005 A1
20050271012 Agrawal et al. Dec 2005 A1
20050276347 Mujtaba et al. Dec 2005 A1
20050276348 Vandenameele Dec 2005 A1
20050277423 Sandhu et al. Dec 2005 A1
20050281290 Khandekar et al. Dec 2005 A1
20050282500 Wang et al. Dec 2005 A1
20050286408 Jin et al. Dec 2005 A1
20050289256 Cudak et al. Dec 2005 A1
20060002451 Fukuta et al. Jan 2006 A1
20060013285 Kobayashi et al. Jan 2006 A1
20060018336 Sutivong et al. Jan 2006 A1
20060018347 Agrawal et al. Jan 2006 A1
20060018397 Sampath et al. Jan 2006 A1
20060026344 Sun Hsu et al. Feb 2006 A1
20060029289 Yamaguchi et al. Feb 2006 A1
20060034164 Ozluturk et al. Feb 2006 A1
20060034173 Teague et al. Feb 2006 A1
20060039332 Kotzin Feb 2006 A1
20060039344 Khan Feb 2006 A1
20060039500 Yun et al. Feb 2006 A1
20060040655 Kim et al. Feb 2006 A1
20060045003 Choi et al. Mar 2006 A1
20060050770 Wallace et al. Mar 2006 A1
20060056340 Hottinen et al. Mar 2006 A1
20060057958 Ngo et al. Mar 2006 A1
20060067421 Walton et al. Mar 2006 A1
20060078075 Stamoulis et al. Apr 2006 A1
20060083159 Laroia et al. Apr 2006 A1
20060083183 Teague et al. Apr 2006 A1
20060089104 Kaikkonen et al. Apr 2006 A1
20060092054 Li et al. May 2006 A1
20060093065 Thomas et al. May 2006 A1
20060104333 Rainbolt et al. May 2006 A1
20060104381 Menon et al. May 2006 A1
20060107171 Skraparlis May 2006 A1
20060109814 Kuzminskiy et al. May 2006 A1
20060111054 Pan et al. May 2006 A1
20060114858 Walton et al. Jun 2006 A1
20060120469 Maltsev et al. Jun 2006 A1
20060120471 Learned et al. Jun 2006 A1
20060126491 Ro et al. Jun 2006 A1
20060133269 Prakash et al. Jun 2006 A1
20060133455 Agrawal et al. Jun 2006 A1
20060133521 Sampath et al. Jun 2006 A1
20060140289 Mandyam et al. Jun 2006 A1
20060153239 Julian et al. Jul 2006 A1
20060155534 Lin et al. Jul 2006 A1
20060156199 Palanki et al. Jul 2006 A1
20060172704 Nishio et al. Aug 2006 A1
20060189321 Oh et al. Aug 2006 A1
20060203708 Sampath et al. Sep 2006 A1
20060203794 Sampath et al. Sep 2006 A1
20060203891 Sampath et al. Sep 2006 A1
20060203932 Palanki et al. Sep 2006 A1
20060209670 Gorokhov et al. Sep 2006 A1
20060209732 Gorokhov et al. Sep 2006 A1
20060209754 Ji et al. Sep 2006 A1
20060209764 Kim et al. Sep 2006 A1
20060209973 Gorokhov et al. Sep 2006 A1
20060215777 Krishnamoorthi Sep 2006 A1
20060218459 Hedberg Sep 2006 A1
20060223449 Sampath et al. Oct 2006 A1
20060233124 Palanki Oct 2006 A1
20060233131 Khandekar et al. Oct 2006 A1
20060233222 Reial et al. Oct 2006 A1
20060262754 Andersson et al. Nov 2006 A1
20060270427 Shida et al. Nov 2006 A1
20060274836 Sampath et al. Dec 2006 A1
20060280114 Osseiran et al. Dec 2006 A1
20060285485 Agrawal et al. Dec 2006 A1
20060285515 Julian et al. Dec 2006 A1
20060286974 Gore et al. Dec 2006 A1
20060286982 Prakash et al. Dec 2006 A1
20060286995 Onggosanusi et al. Dec 2006 A1
20060291371 Sutivong et al. Dec 2006 A1
20060292989 Gerlach et al. Dec 2006 A1
20070004430 Hyun et al. Jan 2007 A1
20070005749 Sampath Jan 2007 A1
20070009011 Coulsonn et al. Jan 2007 A1
20070019596 Barriac et al. Jan 2007 A1
20070025345 Bachl et al. Feb 2007 A1
20070041311 Baum et al. Feb 2007 A1
20070041404 Palanki Feb 2007 A1
20070041457 Kadous et al. Feb 2007 A1
20070047485 Gorokhov et al. Mar 2007 A1
20070047495 Ji et al. Mar 2007 A1
20070049218 Gorokhov et al. Mar 2007 A1
20070053282 Tong et al. Mar 2007 A1
20070053383 Choi et al. Mar 2007 A1
20070060178 Gorokhov et al. Mar 2007 A1
20070064669 Classon et al. Mar 2007 A1
20070070952 Yoon et al. Mar 2007 A1
20070071147 Sampath et al. Mar 2007 A1
20070097853 Khandekar et al. May 2007 A1
20070097889 Wang et al. May 2007 A1
20070097897 Teague et al. May 2007 A1
20070097908 Khandekar et al. May 2007 A1
20070097909 Khandekar et al. May 2007 A1
20070097910 Agrawal et al. May 2007 A1
20070097922 Parekh et al. May 2007 A1
20070097927 Gorokhov et al. May 2007 A1
20070097942 Gorokhov et al. May 2007 A1
20070097981 Papasakellariou et al. May 2007 A1
20070098050 Agrawal et al. May 2007 A1
20070098120 Wang et al. May 2007 A1
20070099666 Astely et al. May 2007 A1
20070110172 Faulkner et al. May 2007 A1
20070115795 Gore et al. May 2007 A1
20070149194 Das et al. Jun 2007 A1
20070149228 Das Jun 2007 A1
20070159969 Das et al. Jul 2007 A1
20070160115 Palanki et al. Jul 2007 A1
20070165738 Barriac et al. Jul 2007 A1
20070177631 Popovic et al. Aug 2007 A1
20070177681 Choi et al. Aug 2007 A1
20070183303 Pi et al. Aug 2007 A1
20070183386 Muharemovicc et al. Aug 2007 A1
20070207812 Borran et al. Sep 2007 A1
20070211616 Khandekar et al. Sep 2007 A1
20070211667 Agrawal et al. Sep 2007 A1
20070230324 Li et al. Oct 2007 A1
20070242653 Yang et al. Oct 2007 A1
20070263743 Lee et al. Nov 2007 A1
20070280336 Zhangg et al. Dec 2007 A1
20070281702 Lim et al. Dec 2007 A1
20080039129 Li et al. Feb 2008 A1
20080063099 Laroia et al. Mar 2008 A1
20080095223 Tong et al. Apr 2008 A1
20080095262 Hoo et al. Apr 2008 A1
20080151829 Khandekar et al. Jun 2008 A1
20080181139 Rangarajan et al. Jul 2008 A1
20080214222 Atarashi et al. Sep 2008 A1
20080253279 Ma et al. Oct 2008 A1
20080267157 Lee et al. Oct 2008 A1
20080299983 Kwak et al. Dec 2008 A1
20090003466 Taherzadehboroujeni et al. Jan 2009 A1
20090010351 Laroia et al. Jan 2009 A1
20090022098 Novak et al. Jan 2009 A1
20090041150 Tsai et al. Feb 2009 A1
20090110103 Maltsev et al. Apr 2009 A1
20090129501 Mehta et al. May 2009 A1
20090180459 Orlikk et al. Jul 2009 A1
20090197646 Tamura et al. Aug 2009 A1
20090201826 Gorokhov et al. Aug 2009 A1
20090201872 Gorokhov et al. Aug 2009 A1
20090213750 Gorokhov et al. Aug 2009 A1
20090213950 Gorokhov et al. Aug 2009 A1
20090262641 Laroia et al. Oct 2009 A1
20090262699 Wengerterr et al. Oct 2009 A1
20090285163 Zhang et al. Nov 2009 A1
20090287977 Chang et al. Nov 2009 A1
20100002570 Walton et al. Jan 2010 A9
20100135242 Nam et al. Jun 2010 A1
20100220800 Erell et al. Sep 2010 A1
20100232384 Farajidana et al. Sep 2010 A1
20100238902 Ji et al. Sep 2010 A1
20100254263 Chen et al. Oct 2010 A1
20110064070 Gore et al. Mar 2011 A1
20110235733 Laroia et al. Sep 2011 A1
20110235745 Laroia et al. Sep 2011 A1
20110235746 Laroia et al. Sep 2011 A1
20110235747 Laroia et al. Sep 2011 A1
20110306291 Ma et al. Dec 2011 A1
20120002623 Khandekar et al. Jan 2012 A1
20120063441 Palanki Mar 2012 A1
20120120925 Kadous et al. May 2012 A1
20120140798 Kadous et al. Jun 2012 A1
20120140838 Kadous et al. Jun 2012 A1
20130016678 Laroia et al. Jan 2013 A1
20130208681 Gore et al. Aug 2013 A1
20130287138 Ma et al. Oct 2013 A1
20130315200 Gorokhov et al. Nov 2013 A1
20140247898 Laroia et al. Sep 2014 A1
20140376518 Palanki et al. Dec 2014 A1
Foreign Referenced Citations (436)
Number Date Country
2005319084 Apr 2010 AU
2348137 Nov 2001 CA
2477536 Sep 2003 CA
2540688 May 2005 CA
2577369 Mar 2006 CA
19931400 Dec 1994 CL
1997846 Jan 1998 CL
009531997 Jan 1998 CL
27102004 Aug 2005 CL
22892004 Sep 2005 CL
30862004 Oct 2005 CL
29932005 May 2006 CL
15202006 Dec 2006 CL
22032006 Feb 2007 CL
15212006 Mar 2007 CL
14922006 Apr 2007 CL
14892006 May 2007 CL
14902006 May 2007 CL
29032006 May 2007 CL
29062006 May 2007 CL
29042006 Jun 2007 CL
29022006 Jul 2007 CL
29082006 Oct 2007 CL
46151 Dec 2009 CL
29012006 Jan 2010 CL
29072006 Jan 2010 CL
1252919 May 2000 CN
1267437 Sep 2000 CN
1284795 Feb 2001 CN
1296682 May 2001 CN
1344451 Apr 2002 CN
1346221 Apr 2002 CN
1383631 Dec 2002 CN
1386344 Dec 2002 CN
1402916 Mar 2003 CN
1424835 Jun 2003 CN
1132474 Dec 2003 CN
1467938 Jan 2004 CN
1487755 Apr 2004 CN
1520220 Aug 2004 CN
1525678 Sep 2004 CN
1636346 Jul 2005 CN
1642051 Jul 2005 CN
1642335 Jul 2005 CN
1647436 Jul 2005 CN
19800653 Jul 1999 DE
19800953 Jul 1999 DE
19957288 May 2001 DE
10240138 Aug 2003 DE
10254384 Jun 2004 DE
0488976 Jun 1992 EP
0568291 Nov 1993 EP
0740431 Oct 1996 EP
0786889 Jul 1997 EP
0805576 Nov 1997 EP
0807989 Nov 1997 EP
0844796 May 1998 EP
0981222 Feb 2000 EP
1001570 May 2000 EP
1047209 Oct 2000 EP
1061687 Dec 2000 EP
1091516 Apr 2001 EP
1093241 Apr 2001 EP
1148673 Oct 2001 EP
1172983 Jan 2002 EP
1180907 Feb 2002 EP
1187506 Mar 2002 EP
1204217 May 2002 EP
1255369 Nov 2002 EP
1267513 Dec 2002 EP
1074099 Feb 2003 EP
1286490 Feb 2003 EP
1335504 Aug 2003 EP
1351538 Oct 2003 EP
1376920 Jan 2004 EP
1392073 Feb 2004 EP
1434365 Jun 2004 EP
1441469 Jul 2004 EP
1445873 Aug 2004 EP
1465449 Oct 2004 EP
1478204 Nov 2004 EP
1507421 Feb 2005 EP
1513356 Mar 2005 EP
1531575 May 2005 EP
1533950 May 2005 EP
1538863 Jun 2005 EP
1542488 Jun 2005 EP
1601149 Nov 2005 EP
1643669 Apr 2006 EP
1898542 Mar 2008 EP
1941693 Jul 2011 EP
2584884 Jan 1987 FR
2279540 Jan 1995 GB
2348776 Oct 2000 GB
2412541 Sep 2005 GB
167573 Feb 2011 IL
201872 May 2012 IL
H04111544 Apr 1992 JP
4301931 Oct 1992 JP
H0746248 Feb 1995 JP
7336323 Dec 1995 JP
8116329 May 1996 JP
08288927 Nov 1996 JP
9008725 Jan 1997 JP
H09501548 Feb 1997 JP
9131342 May 1997 JP
9182148 Jul 1997 JP
09214404 Aug 1997 JP
9284200 Oct 1997 JP
10117162 May 1998 JP
H10210000 Aug 1998 JP
10322304 Dec 1998 JP
H11168453 Jun 1999 JP
11191756 Jul 1999 JP
11196109 Jul 1999 JP
11508417 Jul 1999 JP
11239155 Aug 1999 JP
11298954 Oct 1999 JP
11331927 Nov 1999 JP
2000022618 Jan 2000 JP
2000102065 Apr 2000 JP
2000184425 Jun 2000 JP
2000511750 Sep 2000 JP
2000-332724 Nov 2000 JP
2001016644 Jan 2001 JP
2001045573 Feb 2001 JP
2001057545 Feb 2001 JP
2001156732 Jun 2001 JP
2001238269 Aug 2001 JP
2001245355 Sep 2001 JP
2001249802 Sep 2001 JP
2001285927 Oct 2001 JP
2001521698 Nov 2001 JP
2001526012 Dec 2001 JP
2002026790 Jan 2002 JP
2002111556 Apr 2002 JP
2002515203 May 2002 JP
2002290148 Oct 2002 JP
2002534925 Oct 2002 JP
2002534941 Oct 2002 JP
2002538696 Nov 2002 JP
200318054 Jan 2003 JP
2003032218 Jan 2003 JP
2003500909 Jan 2003 JP
200369472 Mar 2003 JP
2003101515 Apr 2003 JP
2003169367 Jun 2003 JP
2003174426 Jun 2003 JP
2003199173 Jul 2003 JP
2003520523 Jul 2003 JP
2003235072 Aug 2003 JP
2003249907 Sep 2003 JP
2003292667 Oct 2003 JP
2003318857 Nov 2003 JP
2003347985 Dec 2003 JP
2003348047 Dec 2003 JP
2003536308 Dec 2003 JP
2004007643 Jan 2004 JP
2004023716 Jan 2004 JP
2004048716 Feb 2004 JP
200472457 Mar 2004 JP
2004072157 Mar 2004 JP
2004096142 Mar 2004 JP
2004507151 Mar 2004 JP
2004507950 Mar 2004 JP
2004153676 May 2004 JP
2004158901 Jun 2004 JP
2004162388 Jun 2004 JP
2004194262 Jul 2004 JP
2004201296 Jul 2004 JP
2004215022 Jul 2004 JP
2004221972 Aug 2004 JP
2004266818 Sep 2004 JP
2004529524 Sep 2004 JP
2004297276 Oct 2004 JP
2004297370 Oct 2004 JP
2004297756 Oct 2004 JP
2004534456 Nov 2004 JP
2004535106 Nov 2004 JP
2005-020530 Jan 2005 JP
2005006337 Jan 2005 JP
2005502218 Jan 2005 JP
2005506757 Mar 2005 JP
2005110130 Apr 2005 JP
2005130491 May 2005 JP
2005167502 Jun 2005 JP
2005197772 Jul 2005 JP
2005203961 Jul 2005 JP
2005521327 Jul 2005 JP
2005521358 Jul 2005 JP
2005236678 Sep 2005 JP
2006505172 Feb 2006 JP
2006505230 Feb 2006 JP
2006506860 Feb 2006 JP
2006211537 Aug 2006 JP
2006518173 Aug 2006 JP
2006524930 Nov 2006 JP
2007500486 Jan 2007 JP
2007503790 Feb 2007 JP
2007519281 Jul 2007 JP
2007525043 Aug 2007 JP
2007527127 Sep 2007 JP
2008505587 Feb 2008 JP
2008535398 Aug 2008 JP
4188372 Nov 2008 JP
2008546314 Dec 2008 JP
04694628 Jun 2011 JP
0150275 Nov 1998 KR
20000060428 Oct 2000 KR
100291476 Mar 2001 KR
20010056333 Apr 2001 KR
20010087715 Sep 2001 KR
20030007965 Jan 2003 KR
20030035969 May 2003 KR
20040063057 Jul 2004 KR
200471652 Aug 2004 KR
20040103441 Dec 2004 KR
20050061559 Jun 2005 KR
20050063826 Jun 2005 KR
100606099 Jul 2006 KR
95121152 Dec 1997 RU
2141168 Nov 1999 RU
2141706 Nov 1999 RU
2159007 Nov 2000 RU
2162275 Jan 2001 RU
2183387 Jun 2002 RU
2192094 Oct 2002 RU
2197778 Jan 2003 RU
2201033 Mar 2003 RU
2207723 Jun 2003 RU
2208913 Jul 2003 RU
2210866 Aug 2003 RU
2216101 Nov 2003 RU
2216103 Nov 2003 RU
2216105 Nov 2003 RU
2225080 Feb 2004 RU
2235429 Aug 2004 RU
2235432 Aug 2004 RU
2237379 Sep 2004 RU
2238611 Oct 2004 RU
2242091 Dec 2004 RU
2003125268 Feb 2005 RU
2285388 Mar 2005 RU
2250564 Apr 2005 RU
2257008 Jul 2005 RU
2267224 Dec 2005 RU
2005129079 Feb 2006 RU
2285338 Oct 2006 RU
2285351 Oct 2006 RU
2292655 Jan 2007 RU
2335864 Oct 2008 RU
2349043 Mar 2009 RU
1320883 Jun 1987 SU
508960 Nov 2002 TW
510132 Nov 2002 TW
200302642 Aug 2003 TW
200401572 Jan 2004 TW
I232040 May 2005 TW
1248266 Jan 2006 TW
200718128 May 2007 TW
WO9408432 Apr 1994 WO
9521494 Aug 1995 WO
WO9613920 May 1996 WO
WO9701256 Jan 1997 WO
WO9737456 Oct 1997 WO
WO-9746033 Dec 1997 WO
9800946 Jan 1998 WO
WO-9814026 Apr 1998 WO
WO9837706 Aug 1998 WO
WO 9848581 Oct 1998 WO
WO9853561 Nov 1998 WO
WO9854919 Dec 1998 WO
9941871 Aug 1999 WO
WO-9944313 Sep 1999 WO
WO-9944383 Sep 1999 WO
9952250 Oct 1999 WO
WO9953713 Oct 1999 WO
9960729 Nov 1999 WO
WO-9959265 Nov 1999 WO
0004728 Jan 2000 WO
WO0002397 Jan 2000 WO
WO0033503 Jun 2000 WO
00041542 Jul 2000 WO
0051389 Aug 2000 WO
WO0070897 Nov 2000 WO
WO0101596 Jan 2001 WO
WO0117125 Mar 2001 WO
WO0126269 Apr 2001 WO
WO-0139523 May 2001 WO
WO0145300 Jun 2001 WO
WO-0148969 Jul 2001 WO
WO-0158054 Aug 2001 WO
WO-0160106 Aug 2001 WO
0165637 Sep 2001 WO
WO 0169814 Sep 2001 WO
0189112 Nov 2001 WO
WO0182543 Nov 2001 WO
WO-0182544 Nov 2001 WO
0195427 Dec 2001 WO
WO0193505 Dec 2001 WO
0204936 Jan 2002 WO
WO0207375 Jan 2002 WO
0215432 Feb 2002 WO
WO0215616 Feb 2002 WO
WO-0219746 Mar 2002 WO
0231991 Apr 2002 WO
0233848 Apr 2002 WO
0245293 Jun 2002 WO
WO 0245456 Jun 2002 WO
WO0249305 Jun 2002 WO
WO-0249306 Jun 2002 WO
WO0249385 Jun 2002 WO
WO02060138 Aug 2002 WO
WO 02065675 Aug 2002 WO
WO 02082689 Oct 2002 WO
WO-02082743 Oct 2002 WO
02089434 Nov 2002 WO
WO02093782 Nov 2002 WO
WO02093819 Nov 2002 WO
WO02100027 Dec 2002 WO
03001981 Jan 2003 WO
WO-03001696 Jan 2003 WO
WO03001696 Jan 2003 WO
WO03001761 Jan 2003 WO
WO-03003617 Jan 2003 WO
WO03019819 Mar 2003 WO
WO03030414 Apr 2003 WO
WO 03034644 Apr 2003 WO
WO03043262 May 2003 WO
WO03043369 May 2003 WO
03049409 Jun 2003 WO
03058871 Jul 2003 WO
03069816 Aug 2003 WO
WO03067783 Aug 2003 WO
WO03069832 Aug 2003 WO
WO03073646 Sep 2003 WO
WO03075479 Sep 2003 WO
03088538 Oct 2003 WO
WO03085876 Oct 2003 WO
WO03094384 Nov 2003 WO
WO03103331 Dec 2003 WO
WO04002047 Dec 2003 WO
2004008681 Jan 2004 WO
WO2004004370 Jan 2004 WO
WO2004008671 Jan 2004 WO
WO2004015912 Feb 2004 WO
WO2004016007 Feb 2004 WO
WO2004021605 Mar 2004 WO
WO2004023834 Mar 2004 WO
2004028037 Apr 2004 WO
2004030238 Apr 2004 WO
2004032443 Apr 2004 WO
2004038972 May 2004 WO
2004038984 May 2004 WO
2004040825 May 2004 WO
WO2004038954 May 2004 WO
WO-2004038988 May 2004 WO
WO-2004040690 May 2004 WO
WO-2004040827 May 2004 WO
2004051872 Jun 2004 WO
WO2004047354 Jun 2004 WO
WO2004049618 Jun 2004 WO
2004056022 Jul 2004 WO
WO2004062255 Jul 2004 WO
WO2004064294 Jul 2004 WO
WO2004064295 Jul 2004 WO
WO2004066520 Aug 2004 WO
WO2004068721 Aug 2004 WO
WO2004075023 Sep 2004 WO
WO2004075442 Sep 2004 WO
WO2004075448 Sep 2004 WO
WO2004075468 Sep 2004 WO
WO2004075596 Sep 2004 WO
WO2004077850 Sep 2004 WO
WO2004084509 Sep 2004 WO
WO-2004086706 Oct 2004 WO
WO-2004086711 Oct 2004 WO
WO2004095730 Nov 2004 WO
WO-2004095851 Nov 2004 WO
WO2004095854 Nov 2004 WO
WO-2004098072 Nov 2004 WO
WO2004098222 Nov 2004 WO
WO2004102815 Nov 2004 WO
WO2004102816 Nov 2004 WO
2004105272 Dec 2004 WO
2004114564 Dec 2004 WO
2004114615 Dec 2004 WO
WO2004114549 Dec 2004 WO
2005002253 Jan 2005 WO
2005011163 Feb 2005 WO
2005015797 Feb 2005 WO
2005018270 Feb 2005 WO
WO-2005015795 Feb 2005 WO
WO2005015810 Feb 2005 WO
WO-2005015941 Feb 2005 WO
WO2005020488 Mar 2005 WO
WO2005020490 Mar 2005 WO
WO2005022811 Mar 2005 WO
WO2005025110 Mar 2005 WO
2005032004 Apr 2005 WO
2005043780 May 2005 WO
WO2005043855 May 2005 WO
WO2005046080 May 2005 WO
2005055465 Jun 2005 WO
WO 2005055484 Jun 2005 WO
WO-2005055527 Jun 2005 WO
WO2005060192 Jun 2005 WO
WO-2005065062 Jul 2005 WO
WO-2005069538 Jul 2005 WO
WO2005074184 Aug 2005 WO
2005086440 Sep 2005 WO
WO-2005096538 Oct 2005 WO
WO2005122628 Dec 2005 WO
2006007292 Jan 2006 WO
WO2006019710 Feb 2006 WO
WO-2006026344 Mar 2006 WO
WO2006044487 Apr 2006 WO
2006062356 Jun 2006 WO
2006069301 Jun 2006 WO
WO2006069300 Jun 2006 WO
WO2006069397 Jun 2006 WO
WO2006077696 Jul 2006 WO
2004073276 Aug 2006 WO
2006099545 Sep 2006 WO
2006099577 Sep 2006 WO
WO-2006096784 Sep 2006 WO
WO-2006099349 Sep 2006 WO
2006127544 Nov 2006 WO
WO-2006134032 Dec 2006 WO
WO-2006138196 Dec 2006 WO
WO-2006138573 Dec 2006 WO
2007022430 Feb 2007 WO
2007024935 Mar 2007 WO
WO-2007024934 Mar 2007 WO
WO2007025160 Mar 2007 WO
WO-2007051159 May 2007 WO
Non-Patent Literature Citations (132)
Entry
International Search Report—PCT/US06/023514, International Search Authority—European Patent Office—Oct. 5, 2007.
Fuchs, M et al.: “A Novel Tree-Based Scheduling Algorithm for the Downlink of Multi-User MIMO Systems with ZF Beamforming” Acoustics, Speech, and Signal Processing, pp. 1121-1124, 2005. Proceedings, (ICASSP '05). IEEE Internation Conference on Philadelphia, Pennsylvania.
NTT DoCoMo, et al.: “Orthogonal Common Pilot Channel and Scrambling Code in Evolved UTRA Downlink,” 3GPP TSG RAN WG1 #42 on LTE, pp. 1-8 (Aug.-Sep. 2005).
Written Opinion—PCT/US06/023514, International Search Authority—European Patent Office—Oct. 5, 2007.
International Preliminary Report on Patentability—PCT/US06/023514, International Bureau of WIPO, Dec. 17, 2007.
Hermann Rohling et al., : “Performance Comparison of Different Multiple Access Schemes for the Downlink of an OFDM Communication System”, Vehicular Technology Conference, 1997, 47th IEEE, vol. 3, May 4-7, 1997, pp. 1365-1369.
J.S. Chow et al., : “A cost-effective maximum likelihood receiver for multicarrier systems,” Proc. iEEE Int. Conf. On Comm., p. 948-952, Jun. 1992.
Karsten Bruninghaus et al., : “Multi-Carrier Spread Spectrum and It's relationship to Single-Carrier Transmission”, Vehicular technology Conference, 1998, VTC 98, 48th IEEE, vol. 3, May 18-21, 1998, p. 2329-2332.
Sorger U. et al., : “Interleave FDMA—a new spread-spectrum multiple-access scheme”, IEEE Int. Conference on Atlanta, GA, USA Jun. 7-11, 1998, XP010284733.
3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical Layer Aspects for Evolved UTRA (Release 7), 3GPP TR 25.814 v0.3.1 (Nov. 2005).
Bahai, Saltzberg, “System Architecture,” Multi-Carrier Digital Communications, Kluwer Academic, New York, NY, XP-002199501, 1999, pp. 17-21.
Bingham, “Other Types of MCM,” ADSL, VDSL, and Multicarrier Modulation, John Wiley & Sons, New York, XP-002199502. 2000, pp. 111-113.
Chennakeshu, et al. “A Comparision of Diversity Schemes for a Mixed-Mode Slow Frequency-Hopped Cellular System,” IEEE, 1993, pp. 1749-1753.
Chennakeshu, et al. “Capacity Analysis of a TDMA-Based Slow-Frequency—Hopped Cellular System,” IEEE Transaction on Vehicular Technology, vol. 45., No. 3 Aug. 1996, pp. 531-542.
Chiani, et al. “Outage Evaluation for Slow Frequency-Hopping Mobile Radio Systems” IEEE Transactions on Communications, vol. 47, No. 12, pp. 1865-1874, Dec. 1999.
Choi, et al., “Design of the Optimum Pilot Pattern for Channel Estimation in OFDM Systems,” Global Telecommunications Conference, IEEE Communications Society, pp. 3661-3665, Globecom, Dallas, Texas (2004).
Czylwik, “Comparison Between Adaptive OFDM and Single Carrier Modulation with Frequency Domain Equalization,” IEEE 47th Vehicular Technology Conference, vol. 2, May 4-7, 1997, pp. 865-869.
Das, et al. “On the Reverse Link Interference Structure for Next Generation Cellular Systems,” European Microwave Conference, Oct. 11, 2004, pp. 3068-3072.
Dinis, et al., “A Multiple Access Scheme for the Uplink of Broadband Wireless Systems,” IEEE Global Telecommunications Conference, 2004, GLOBECOM '04, vol. 6, Nov. 29-Dec. 3, 2004, pp. 3808-3812.
Fuchs, et al., “A Novel Tree-Based Scheduling Algorithm for the Downlink of Multi-User MIMO Systems with ZF Beamforming,” IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005, Proceedings, Philadelphia, PA, pp. 1121-1124.
Hill, et al., “Cyclic Shifting and Time Inversion of Partial Transmit Sequences to Reduce the Peak-to-Average Power Ratio in OFDM,” IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 2, Sep. 18, 2000, Piscataway, NJ, pp. 1256-1259.
Je, et al. “A Novel Multiple Access Scheme for Uplink Cellular Systems,” IEEE Vehicular Technology Conference, Sep. 26, 2004 pp. 984-988.
Kaleh, “Channel Equalization for Block Transmission Systems,” IEEE Journal on Selected Areas in Communications, vol. 13, No. 1, Jan. 1995, pp. 110-121.
Kappes, J.M., and Sayegh, S.I., “Programmable Demultiplexer/Demodulator Processor,” COMSTAT Laboratories, IEEE, 1990, pp. 230-234.
Keller, et al., “Adaptive Multicarrier Modulation: A Convenient Framework for Time-Frequency Processing in Wireless Communications,” Proceedings of the IEEE, vol. 88, No. 5, May 2000, pp. 611-640.
Kim, et al. “Performance of TDMA System With SFH and 2-Bit Differentially Detected GMSK Over Rayleigh Fading Channel,” IEEE Vehicular Technology Conference, Apr. 28, 1996, pp. 789-793.
Kishiyama Y et al: “Investigation of Optimum Pilot Channel Structure for VSF-OFCDM Broadband Wireless Access in Forward Link”, IEEE Vehicular Technology Conference, New York, NY, US, vol. 4, pp. 139-144, Apr. 22, 2003.
Kostic, et al. “Dynamic Frequency Hopping in Wireless Cellular Systems-Simulations of Full-Replacement and Reduced-Overhead Methods,” IEEE Vehicular Technology Conference, May 16, 1999, pp. 914-918.
Kostic, et al. “Fundamentals of Dynamic Frequency Hopping in Cellular Systems,” IEEE Journal on Selected Areas in Communications, vol. 19, No. 11, Nov. 2001 pp. 2254-2266.
Lacroix, et al., “A Study of OFDM Parameters for High Data Rate Radio LAN's,” 2000 IEEE 51st Vehicular Technology Conference Proceedings, vol. 2, May 15-18, 2000, pp. 1075-1079.
Leon, et al., “Cyclic Delay Diversity for Single Carrier-Cyclic Prefix Systems,” Conference Record of the Thirty-Ninth Asilomar Conference on Signals, Systems and Computers, Oct. 28, 2005, Piscataway, NJ, pp. 519-523.
Lott, “Comparison of Frequency and Time Domain Differential Modulation in an OFDM System for Wireless ATM,” 1999 IEEE 49th Vehicular Technology Conference, vol. 2, Jul. 1999, pp. 877-883.
Mignone, et al., “CD3-OFDM: A New Channel Estimation Method to Improve the Spectrum Efficiency in Digital Terrestrial Television Systems,” International Broadcasting Convention, Sep. 14-18, 1995 Conference Publication No. 413, IEE 1995, pp. 122-128.
Naofal Al-Dhahir: “A Bandwidth-Optimized Reduced-Complexity Equalized Multicarrier Transceiver”, IEEE Transactions on Communications, vol. 45, No. 8, Aug. 1997.
Naofal Al-Dhahir: “Optimum Finite-Length Equalization for Multicarrier Transceivers”, IEEE Trans. On Comm., pp. 56-64, Jan. 1996.
Nassar, Carl R., et al., “High-Performance MC-CDMA via Carrier Interferometry Codes”, IEEE Transactions on Vehicular Technology, vol. 50, No. 6, Nov. 2001.
Nassar, Carl R., et al., Introduction of Carrier Interference to Spread Spectrum Multiple Access, Apr. 1999, IEEE, pp. 1-5.
Sari, et al., “Transmission Techniques for Digital Terrestrial TV Broadcasting,” IEEE Communications Magazine, Feb. 1995, pp. 100-109.
Schnell, et al, “Application of IFDMA to Mobile Radio Transmission,” IEEE 1998 International Conference on Universal Personal Communications, vol. 2, Oct. 5-9, 1998, pp. 1267-1272.
Schnell, et al., “A Promising New Wideband Multiple-Access Scheme for Future Mobile Communications Systems,” European Transactions on Telecommunications, Wiley & Sons, Chichester, GB, vol. No. 4, Jul. 1999, pp. 417-427.
Shattil et al., “Array Control Systems for Multicarrier Protocols Using a Frequency-Shifted Feedback Cavity”, IEEE, 1999.
Sklar: “Formatting and Baseband Transmission”, Chapter 2, pp. 54, 104-106.
Sklar: “The process of thus correcting the channel-induced distortion is called equalization”, Digital Communications, PTR Prentice Hall, Upper Saddle River, New Jersey, 1998, Formatting and Baseband Transmission, Chap. 2, Section 2.11.2, pp. 104-105.
Tellambura, “Use of m-sequences for OFDM Peak-to-Average Power Ratio Reduction,” Electronics Letters, vol. 33, No. 15, Jul. 17, 1997, pp. 1300-1301.
Tellado, “Multicarrier Modulation with Low Par,” Kluwer Academic, Dordrecht, NL, XP-002199500, 2000, pp. 6-11 and 55-60.
Torrieri, “Cellular Frequency-Hopping CDMA Systems,” IEEE Vehicular Technology Conference, May 16, 1999, pp. 919-925.
Xiaodong, et al., “M-Sequences for OFDM Peak-to-Average Power Ratio Reduction and Error Correction,” Electronics Letters, vol. 33, Issue 7, Mar. 27, 1997, pp. 554-555.
Zekri, et al., “DMT Signals with Low Peak-to-Average Power Ratio,” Proceedings, IEEE International Symposium on Computers and Communications, 1999, Jul. 6-8, 1999, pp. 362-368.
Das, Arnab, et al. “Adaptive, asynchronous incremental redundancy (A-IR) with fixed transmission time intervals TTI for HSDPA” IEEE, pp. 10-83-1087.
Digital cellular telecommunications system (Phase 2+); Mobile radio interface layer 3 specification (GSM 04.08 version 7.7.1 Release 1998); ETSI EN 300 940 V7.7.1 (Oct. 2000), pp. 1,2,91-93.
Favre et al: “Self-Adaptive Transmission Procedure” IBM Technical Disclosure Bulletin, IBM Corporation, Sep. 1976, vol. 19, No. 4, pp. 1283-1284, New York, New York.
John B. Groe, Lawrence E. Larson, “CDMA Mobile Radio Design” Sep. 26, 2001, Artech House, Norwood, MA02062 580530, XP002397967, pp. 157-159.
Laroia, R. et al: “An integrated approach based on cross-layer optimization—Designing a mobile broadband wireless access network” IEEE Signal Processing Magazine, IEEE Service Center, Piscataway, NJ, US, vol. 21, No. 5, Sep. 2004, pp. 20-28, XP011118149.
Lau, et al., “On the Design of MIMO Block-Fading Channels with Feedback-Link Capacity Constraint,” IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, US, v. 52, No. Jan. 1, 2004, pp. 62-70, XP001189908
Lettieri et al: “Adaptive frame length control for improving wireless link throughput, range, and energy efficiency”, INFOCOM 98, 17th Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 29-Apr. 2, 1998, pp. 564-571, vol. 2, IEEE San Francisco, CA, New York, New York.
Molisch, et al., MIMO systems with antenna selection, IEEE Microwave Magazine, URL: http://ieeexplore.ieee.org/iel5/6668/28677/01284943.pdf, Retrieved on Dec. 8, 2006, pp. 46-56 (2004).
Slimane Djidel; “High Speed, 3-Dimensional, Telecentric Imaging.” 14 Optics Express No. 18 (Sep. 4, 2006).
TIA/EIA/IS-2000 “Standards for CDMA2000 Spread Spectrum Systems” Version 1.0 Jul. 1999.
TIA/EIA/IS-95 “Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System” Jul. 1993.
TIA-1121.001 “Physical Layer for Ultra Mobile Broadband (UMB) Air Interface Specification,” 3GPP2 C.S0084-001-0, Version 2.0 (Aug. 2007).
TIA-1121.002 “Medium Access Control Layer for Ultra Mobile Broadband (UMB) Air Interface Specification,” 3GPP2 C S0084-002-0, Version 2.0 (Aug. 2007).
Tomick, J.: “MBFDD and MBTDD Wideband Mode: Technology Overview,” IEEE 802.20 Working Group Mobile Broadband Wireless Access, Jan. 2006, pp. 1-109, XP002429968.
Tomcik, J.: “QFDD Technology Overview Presentation,” IEEE 802.20 Working Group on Mobile Broadband Wireless Access, Slides/pp. 1-73, Nov. 15, 2005 and Oct. 28, 2005.
Toufik I et al., “Channel allocation algorithms for multi-carrier systems”, Vehicular Technology Conference, 2004. VTC2004—Fall 2004 IEEE 60th Los Angeles, CA, USA Sep. 26-29, 2004, pp. 1129-1133, XP010786798, ISBN: 07-7803-8521-7.
W. Neil Charman et al; “Can we measure wave aberration in patients with diffractive 10Ls?” Journal of Cataract & Refractive Surgery No. 11 p. 1997 (Nov. 2007).
Wang, et al., “Improving performance of multi-user OFDM systems using bit-wise interleaver” Electronics Letters, IEE Stevenage, GB, vol. 37. No. 19, Sep. 13, 2001, pp. 1173-1174, XP006017222.
Yun, et al., “Performance of an LDPC-Coded Frequency-Hopping OFDMA System Based on Resource Allocation in the Uplink” Vehicular Technology Conference, 2004. VTC 2004—Spring. 2004 IEEE 59th Milan, Italy, May 17-19, 2004, Piscataway, NJ, USA, vol. 4. May 17, 2004, pp. 1925-1928, XP010766497.
3GPP TS 33.220 V.1.1.0 XX,XX, “3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Generic Authentication Architecture (GAA); Generic Bootstrapping Architecture (Release 6)” Feb. 9, 2004, pp. 1-17, figure 4, XP002996023.
Blum, R. et al: “On Optimum MIMO with Antenna Selection,” IEEE International Conference on Communications: Conference Proceedings, vol. 1, Apr. 28, 2002, pp. 386-390.
Catreux, S. et al.: “Simulation results for an interference-limited multiple input multiple output cellular system,” Global Telecommunications Conference, 2000. Globecom '00. IEEE. Dec. 1, 2000. vol. 2, pp. 1094-1096, http://ieeexplore.ieee.org/ie15/7153/19260/00891306.pdf?tp=&isnumber=19260&arnumber=8913063&punumber=7153.
Chiani, et al. “Outage Evaluation for Slow Frequency-Hopping Mobile Radio Systems” IEEE Transactions on Communications, vol. 47, No. 12, Dec. 1999, pp. 1865-1874.
Chung, S. et al.: “Low complexity algorithm for rate and power quantization in extended V-BLAST” VTC Fall 2001. IEEE 54th. Vehicular Technology Conference Proceedings. Atlantic City, NJ, Oct. 7-11, 2001, vol. 1 of 4, pp. 910-914, Conf. 54.
Dierks, et al., “The TLS Protocol”, Version 1.0, Network Working Group, Request for Comments 2246, pp. 1-80 (Jan. 1999).
El Gamal, H. et al.: “Universal Space-Time Coding,” IEEE Transactions on Information Theory, vol. 49, Issue 5, pp. 1097-1119, XP011074756, ISSN: 0018-9448, May 2003.
Groe, et al., “CDMA Mobile Radio Design,” Sep. 26, 2001, Artech House, Norwood, MA 02062, pp. 257-259.
Hochwald, B. et al., “Achieving near-capacity on a multiple-antenna channel,” IEEE Transactions on Communications, IEEE Service Center, Piscataway, New Jersey, vol. 51, No. 3, pp. 389-399 (2003).
Kiessling, M. et al., “Short-term and long-term diagonalization of correlated MIMO channels with adaptive modulation” IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 2, Sep. 15, 2002, pp. 593-597.
Kousa, M. et al: “Adaptive Binary Coding for Diversity Communication Systems” IEEE International Conference on Personal Wireless Communications Proceedings, pp. 80-84, XP000992269, (1997).
Maniatis, I. et al., “Pilots for joint channel estimation in multi-user OFDM mobile radio systems,” Spread Spectrum Techniques and Applications, 2002 IEEE Seventh International Symposium, Sep. 2, 2002, pp. 44-48, XP010615562.
Nokia, “Uplink Considerations for UTRA LTE”, 3GPP TSG RAN WG1#40bis, Beijing, CN, R1-050251, 3GPP, Apr. 4, 2005, pp. 1-9.
NTT DoCoMo, “Downlink Multiple Access Scheme for Evolved UTRA”, 3GPP R1-050249. 3GPP, Apr. 4, 2005, pp. 1-8.
Prasad, N. et al.: “Analysis of Decision Feedback Detection for MIMO Rayleigh Fading Channels and Optimum Allocation of Transmitter Powers and QAM Constellations,” pp. 1-10, 39th Annual Conference on Comm. Control and Comput., Monticello, IL Oct. 2001.
Qualcomm Europe: “Description and link simulations for OFDMA based E-Utra uplink” 3GPP Draft; R1-051100, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; Sophia-Antipolis Cedex, France, vol. RAN WG1, no. San Diego, USA; 20051004, Oct. 4, 2005, pp. 1-10. XP050100715.
S. Nishimura et al., “Downlink Nullforming by a Recieving Antenna Selection for a MIMO/SDMA Channel”, Technical Search Report of Electric Information Communication Academic Conference, Feb. 28, 2002, vol. 101, No. 683, pp. 17-22, RCS 2001-286.
Schnell et al., “Application of IFDMA to Mobile Radio Transmission”, IEEE 1998 International Conference on Universal Personal Communications, vol. 2, Oct. 5-9, 1998, pp. 1267-1272.
Taiwanese Search report—095139893—TIPO—Dec. 30, 2010.
Tomcik, Jim: “QFDD Technology Overview Presentation,” IEEE 802.20 Working Group on Mobile Broadband Wireless Access, [Online] Nov. 15, 2005, pp. 1-73, XP002467626.
Translation of Office Action in Japanese Application 2008-529216 corresponding to U.S. Appl. No. 11/261,159, citing GB2348776, WO2004098222, WO2005065062 and WO2004102815.Dated Jan. 11, 2011.
Widdup, B. et al., “A highly-parallel VLSI architecture for a list sphere detector,” IEEE International Conference, Paris, France, vol. 5, pp. 2720-2725 (2004).
Wiesel, A. et al.; “Efficient implementation of sphere demodulation” Signal Processing Advances in Wireless Communications, 2003, SPAWX 200 3. 4th IEEE Workshop on Rome, Italy Jun. 15-18, 2003, Piscataway, NJ, USA, IEEE, US, Jun. 15, 2003, pp. 36-40, XP010713463.
Guo, K. et al.: “Providing end-to-end QoS for multimedia applications in 3G wireless networks,” Proceedings vol. 5242, SPIE ITCom 2003 Conf. Internet Multimedia Management Systems IV, Nov. 26, 2003, pp. 1-14, DOI: 10.1117/12.514061.
Sumii, Kenji, et al., “A Study on Computational Complexity Reduction of Iterative Decoding for Turbo-coded MIMO-SDM Using Sphere Decoding,” Technical Report of IEICE. RCS, Nov. 9, 2010, vol. 104, No. 675, pp. 43-48.
Tomcik, T.: “QTDD Performance Report 2,” IEEE C802.20-05/88, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, <http://ieee802.org/20/>, pp. 1-56, XP002386798 (Nov. 15, 2005).
Translation of Office Action in Chinese Application 2006800295980 corresponding to U.S. Appl. No. 11/260,895, citing CN1346221 and CN1383631 dated Feb. 16, 2011.
Translation of Office Action in Japan application 2008-538193 corresponding to U.S. Appl. No. 11/261,065, citing JP11196109, JP10322304 and JP09008725 dated Mar. 8, 2011.
Translation of Office Action in Korean application 10-2007-7031029 corresponding to U.S. Appl. No. 11/260,931, citing US20030202491 and KR20040063057 dated Jan. 28, 2011.
Translation of Office Action in Canadian application 2625987 corresponding to U.S. Appl. No. 11/261,065, citing CA2557369 dated Apr. 12, 2011.
Translation of Office Action in Chinese application 200680040236.1 corresponding to U.S. Appl. No. 11/261,065, citing US20040048609 and CN1402916 dated Feb. 18, 2011.
Translation of Office Action in Chinese application 200680048265.2 corresponding to U.S. Appl. No. 11/260,931, citing US6904097, WO2004095851, CN1344451 dated Jan. 26, 2011.
Translation of Office Action in Chinese application 200680048832.4 corresponding to U.S. Appl. No. 11/261,158, citing CN1132474 dated Dec. 31, 2010.
Translation of Office Action in Japanese Application 2008-514880 corresponding to U.S. Appl. No. 11/445,377, citing JP2007519281 and JP2006505172 dated Nov. 9, 2010.
Translation of Office Action in Japanese application 2008-528103 corresponding to U.S. Appl. No. 11/260,924, citing JP2005502218, JP2004534456, JP2003348047, JP2003199173, JP2004529524, JP11508417, JP2001238269, JP2005130491 and JP2003500909 dated Feb. 8, 2011.
Translation of Office Action in Japanese application 2008-538181 corresponding to U.S. Appl. No. 11/511,735, citing WO04064295, JP2002515203, JP8288927, JP7336323 and JP200157545 dated Jan. 25, 2011.
Voltz, P. J.,“Characterization of the optimum transmitter correlation matrix for MIMO with antenna subset selection”, IEEE Transactions on Communications, vol. 51, No. 11, pp. 1779-1782, (Nov. 1, 2003).
Yongmei Dai,; Sumei Sun; Zhongding Lei; Yuan Li.: “A List Sphere Decoder based turbo receiver for groupwise space time trellis coded (GSTTC) systems,” 2004 IEEE 59th Vehicular Technology Conference, vol. 2, pp. 804-808, May 17, 2004, doi: 10.1109/VETECS.2004.1388940.
Dammann, A. et al., “Beamforming in Combination with Space-Time Diversity for Broadband OFDM Systems”, ICC 2002. 2002 IEEE International Conference on Communications. Apr. 28-May 2, 2002, pp. 165-171, XP010589479.
Ken Murakami et al., “Status Toward Standardization at IEEE 802.3ah and Challenge to System Architecture,” Technical Report of the Institute of Electronics, Information and Communication Engineers, Jun. 13, 2003, vol. 103, No. 124, pp. 1-6, IN2003-24.
Sklar, B., “The process of thus correcting the channel-induced distortion is called equalization”, Digital Communications, PTR Prentice Hall, Upper Saddle River, New Jersey, 1998, Formatting and Baseband Transmission, Chap. 2, Section 2.11.2, pp. 54,104-106.
Supplementary European Search Report—EP06773361—Search Authority—The Hugue—Nov. 15, 2011.
Viswanath P et al: “Opportunistic beamforming using dumb antennas” IEEE Transactions on Information Theory IEEE USA, vol. 48, No. 6, Jun. 2002, pp. 1277-1294, XP002314708 ISSN: 0018-9448 abstract right-hand column, paragraph 1.
Alcatel-Lucent, et al., “Dedicated Reference Signals for Precoding in E-UTRA Downlink” 3GPP Draft; R1-071718, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, vol. Ran WG1, No. St. Julian; 20070403, Apr. 3, 2007, XP050105640 [retrieved on Apr. 4, 2007].
Bengtsson, M. et at, “A Generalization of Weighted Subspace Fitting to Full-Rank Models”, IEEE Transactions on Signal Processing, IEEE Service Center, New York, NY, US, vol. 49, No. 5, pp. 1002-1012, May 1, 2001.
European Search Report—EP10184156—Search Authority—Munich—Jun. 14, 2012.
Physical Channels and Multiplexing in Evolved UTRA Downlink TSG-RAN Working Group 1 Meeting, XX, XX, vol. RI-050590, Jun. 20, 2005, pp. 1-24, XP003006923 the whole document.
Siemens, “Evolved UTRA uplink scheduling and frequency reuse” [online], 3GPP TSG-RAN WG1 # 41 R1-050476, Internet <URL:http://www.3gpp.org/ftp/tsg—ran/WG1—RL1/TSGR1—41/Docs/R1-050476.zip×, May 9, 2005.
Yatawatta, S. et al., “Energy Efficient Channel Estimation in MIMO Systems”, 2005 IEEE International Conference on Acoustics, Speech and Signal Processing, Mar. 18-23, 2005, Philadelphia, vol. 4, pp. 317-320, Mar. 18, 2005.
Anonymous: “3GPP TS 36.211 V8.0.0; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (Release 8)” 3rd Generation Partnership Project; Technical Specification Group Radio Access Network, [Online] 2007, XP002520076 Retrieved from the Internet: URL:http://www.Sgpp.org/ftp/Specs/html-info/36211.htm> [retrieved on Sep. 27, 2007] Section 5.
Jim Tomcik, QFDD and QTDD: Technology Overview, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, October 28, 2005, pp. 48-50, URL, http://www.IEEE802.org/20/Contribs/C802.20-05-68.Zip.
Miorandi D., et al., “Analysis of master-slave protocols for real-time industrial communications over IEEE 802.11 WLANs” Industrial Informatics, 2004. Indin '04, 2nd IEEE International Conference on Berlin, Germany Jun. 24-26, 2004. Piscataway, NJ, USA IEEE, Jun. 24, 2004, pp. 143-148, XP010782619, ISBN 0789385136, Para 3, point B.
Nokia: “Compact signalling of multi-code allocation for HSDPA”, version 2,3GPP R1-02-0018, Jan. 11, 2002.
Sethi M, et al., “Code Reuse DS-CDMA- A Space Time Approach”, Proceedings of the 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp: 2297-2300, May 13-17, 2002.
Bhushan N., “UHDR Overview”, C30-20060522-037, Denver, CO, May 22, 2006, pp. 1-115.
Samsung: “Uplink Transmission and Multiplexing for EUTRA”, 3GPP Draft; R1-050605 UL Multiplexing, Jun. 16, 2005, XP050111420.
Tachikawa (Editor); “W-CDMA Mobile Communication Systems,” John Wiley & Sons Ltd., Japan, Maruzen: pp. 82-213, Jun. 25, 2001.
Lg Electronics: “PAPR comparison of uplink MA schemes”, 3GPP TSG RAN WG1 Meeting #41, R1-050475, May, 9-13, 2005, pp. 6.
Motorola,“Uplink Numerology and Frame Structure”, 3GPP TAG RAN1 #41 Meeting R1-050397, May 13, 2005.
Samsung Electonics Co. Ltd.; “Uplink Multiple Access and Multiplexing for Evolved UTRA”, R1-050439, May 3, 2005, pp. 1-22, XP55018616, Retrieved from the Internet: URL:http://www.3gpp.org/f-tp/tsg—ranNVG1—R1/TSGR1/DOCS/[retrieved on Feb. 7, 2012].
Tomcik J., “QFDD and QTDD: Proposed Draft Air Interface Specification,” IEEE C802.20-05/69, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, Oct. 28, 2005, P.1-6,1-7,1-16,6-65,7-11,7-33,7-37˜7-55,9-21,9-22,9-24˜9-32.
Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Mobile Station (MS)-Base Station System (BSS)interface; Radio Link Control/Medium Access Control (RLC/MAC) protocol (GSM 04.60 version 8.4.1 Release 1999), 3GPP Standard; ETSI EN 301 349, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, No. V8.4.1, Oct. 1, 2000, pp. 1-243, XP050358534.
Institute for Infocornm Research et al., “Intra-Node B Macro Diversity based on Cyclic Delay Transmissions”, 3GPP TSG RAN WG1 #42 on LTE, R1-050795, Aug. 29-Sep. 2, 2005, pp. 1-5.
Sommer D., et al., “Coherent OFDM transmission at 60 GHz”, Vehicular Technology Conference, 1999, VTC 1999—Fall, IEEE VTS 50th Amsterdam, Netherlands Sep. 19-22, 1999, Piscataway, NJ, USA, IEEE, US, vol. 3, Sep. 19, 1999, pp. 1545-1549, XP010353233, DOI: 10.1109/VETECF.1999.801553, ISBN: 978-0-7803-5435-7.
Zhang H., “A new space-time-frequency Mimo-OFDM scheme with cyclic delay diversity”, Frontiers of Mobile and Wireless Communication, 2004. Proceedings of the IEEE 6th Circuits and Systems Symposium on vol. 2, Jun. 2, 2004, pp. 647-650.
Related Publications (1)
Number Date Country
20060286974 A1 Dec 2006 US
Provisional Applications (1)
Number Date Country
60691716 Jun 2005 US