Precoding and SDMA support

Information

  • Patent Grant
  • 9136974
  • Patent Number
    9,136,974
  • Date Filed
    Monday, April 10, 2006
    18 years ago
  • Date Issued
    Tuesday, September 15, 2015
    9 years ago
Abstract
Embodiments are described in connection with enhancing performance in a wireless communication system using codebook technology. According to an embodiment is a method for enhancing performance in a wireless communication environment. The method can include receiving a user preference for a transmission mode, associating the user preference with an entry or entries in a codebook, and assigning the user to a transmission mode corresponding to the entry or entries. The transmission mode can be one of a precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO), MIMO precoding, MIMO-SDMA and a diversity. Each entry can correspond to a transmission mode.
Description
BACKGROUND

I. Field


The following description relates generally to wireless communications, and, amongst other things, to precoding and space division multiple access (SDMA) support for wireless communication systems.


II. Background


Wireless networking systems have become a prevalent means by which a large number of people worldwide communicate. Wireless communication devices have become smaller and more powerful to meet consumer needs, which include improved portability and convenience. Users have found many uses for wireless communication devices, such as cellular telephones, personal digital assistants (PDAs) and the like, and demand reliable service and expanded coverage areas.


Performance for a wireless communication system may be enhanced by using beam-formed transmissions within a region to communicate from a base station or access point to the mobile device(s). Such a region can be a service area and can include sub-regions, or sectors. Multiple transmit antennas located at the base station can be used to form beam-formed transmissions, which utilize “beams” that typically cover a narrower area than transmissions using a single transmit antenna. The signal to interference and noise ratio (SINR) is enhanced within the area or sector covered by the beams. The portions of the sector not covered by a beam are referred to as a null region. Mobile devices within this null region generally have an extremely low SINR, resulting in reduced performance and possible data loss. 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 device(s) change location.


A challenge in communication systems is that the mobile device or receiver is located in a specific portion of an area served by the access point or transmitter. In such cases, where a transmitter has multiple transmit antennas, the signals provided from each antenna need not be combined to provide maximum power at the receiver. In these cases, there may be problems with decoding of the signals received at the receiver.


To overcome the aforementioned, there is a need for techniques to improve the signal-to-noise (SNR) ratio of a wireless link with multiple antennas. The improved SNR can also improve decoding of the signals by the receiver.


SUMMARY

The following presents a simplified summary of one or more embodiments in order to provide a basic understanding of some aspects of such embodiments. This summary is not an extensive overview of the one or more embodiments, and is intended to neither identify key or critical elements of the embodiments nor delineate the scope of such embodiments. Its sole purpose is to present some concepts of the described 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 wireless communications and enhancing performance of such communications. According to an embodiment is a method for enhancing performance in a wireless communication environment. The method includes receiving a user preference for a transmission mode. The method further includes associating the user preference with an entry or entries in a codebook and assigning the user to a transmission mode corresponding to the entry or entries. The transmission mode is one of a precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO), MIMO precoding, MIMO-SDMA and a diversity. Each entry can correspond to a transmission mode.


According to some embodiments is a method of determining a user's preference of a transmission mode. The method includes determining channel characteristics of a user, selecting a transmission mode or modes to apply from a codebook, and transmitting an identifier of the mode or modes selected. Determining channel characteristics of a user can include determining by utilizing a CQI, power offsets, signal strengths, and other sector interference information. The mode can be one of a precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO-SDMA), MIMO precoding, and a diversity.


According to some embodiments is a wireless communication device that includes a processor and a memory coupled with the processor. The processor can be configured to select a transmission mode of a plurality of transmission modes from a codebook. The transmission mode can be one of a precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO), MIMO precoding, MIMO-SDMA, and a diversity. Each entry of the codebook can correspond to a mode of transmission. In some embodiments, the processor automatically accesses a different codebook as the device is moved among different base stations or the processor receives a different codebook from which to select a transmission mode as a device is moved among different base stations.


According to some embodiments is a wireless communication device that includes a means for receiving a user preference for a transmission mode. Also included in the device is a means for associating the preference with an entry or entries in a codebook and means for assigning the user to a transmission mode corresponding to the entry or entries. Each entry can correspond to a transmission mode. The transmission mode can be one of a precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO), MIMO precoding, MIMO-SDMA and a diversity.


According to some embodiments is a wireless communication device that includes a means for determining channel characteristics of a user, a means for selecting a transmission mode or modes to apply from a codebook, and a means for transmitting an identifier of the mode or modes selected. The means for determining a channel characteristics of a user comprises determining by utilizing a CQI, power offsets, signal strengths, and other sector interference information. The mode can be one of a precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO), MIMO precoding, MIMO-SDMA, and a diversity.


To the accomplishment of the foregoing and related ends, 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 and are indicative of but a few of the various ways in which the principles of the embodiments may be employed. Other advantages and novel features will become apparent from the following detailed description when considered in conjunction with the drawings and the disclosed embodiments are intended to include all such aspects and their equivalents.





BRIEF DESCRIPTION OF THE DRAWINGS


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



FIG. 2 illustrates a multiple access wireless communication system according to various embodiments.



FIG. 3 illustrates a wireless communication system according to one or more embodiments presented herein.



FIG. 4 illustrates a beam pattern for a sector utilizing the disclosed techniques for improving communication in a wireless environment.



FIG. 5 illustrates functional blocks in accordance with various embodiments.



FIG. 6A illustrates a methodology for enhancing performance in a wireless communication environment.



FIG. 6B illustrates a system for enhancing performance in a wireless communication environment.



FIG. 7A illustrates a methodology for determining and reporting a user's preference of a mode(s) or transmission(s) technique in accordance with the various embodiments presented herein.



FIG. 7B illustrates a system for determining and reporting a user's preference of a mode(s) or transmission(s) technique in accordance with the various embodiments presented herein.



FIG. 8 illustrates a system that utilizes the disclosed techniques to increase system capacity in a wireless communication environment in accordance with the one or more embodiment presented herein.



FIG. 9 illustrates a system that utilizes precoding and SDMA to increase system capacity in a wireless communication environment in accordance with the various embodiments.



FIG. 10 illustrates a transmitter and receiver in a multiple access wireless communication system in accordance with the various embodiments presented herein.





DETAILED DESCRIPTION

Various embodiments are now described with reference to the drawings. 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 these embodiments.


As used in this application, the terms “component,” “system,” and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer-readable media having various data structures stored thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems by way of the signal).


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 device having wireless connection capability, or other processing device(s) 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 . . . ).


Referring now to the drawings, FIG. 1 illustrates a wireless communication system 100 in accordance with various embodiments presented herein. Various modes can be utilized to improve communication in wireless system 100 including pre-coding, SDMA, SDMA pre-coding, multiple input and multiple output (MIMO), MIMO pre-coding, and/or MIMO-SDMA, and a diversity. As illustrated, a mobile device 102 is in wireless communication with a base station 104. It should be appreciated that while one mobile device 102 and one base station 104 are illustrated for simplicity, there can be more than one of each.


Base station 104 includes transmit antennas that can generate beams covering predetermined areas, resulting in a fixed beam pattern. Base station 104 supports techniques such as precoding, SDMA, SDMA precoding, MIMO, MIMO precoding, and/or MIMO-SDMA. Base station 104 performs pre-processing for whichever technique is utilized. For example, for precoding, a particular vector is utilized that can modulate all of a user's transmissions for some time period. For MIMO precoding, a set of vectors can be used to modulate the transmissions from base station 104.


Codebook 106 contains entries of different vectors and/or matrices that may correspond to multiple transmission modes, such information can be pre-defined. Each entry can correspond to a mode of transmission or a form of spatial processing (e.g., precoding, MIMO precoding, SDMA, SDMA with precoding, MIMO-SDMA, etc.). For example, codebook 106 can contain a set of sixty-four entries, however, there can be any number of entries and sixty-four is an arbitrary number. Codebook 106 can be customized for base station(s) 104 or sectors or mobile device(s) 102 in communication with base station(s) 104. For example and not limitation purposes, codebook 106 can support a plurality of users applying the transmission modes described herein. It should be noted that while one codebook is shown 106, there can be more than one codebook in system 100 and more than one codebook 106 can be associated mobile device 102 and/or base station 104.


Mobile device 102 can notify base station 104 of the entries that mobile device 102 would like. Codebook 106 can be known a priori by either or both the mobile device 102 and the base station 104. For example, base station 104 can notify mobile device 102 of its codebook 106. As the mobile device 102 moves among different base stations 104, the codebook 106 would be changed for the particular base station 104. This codebook change can be performed automatically by the mobile device 102 autonomously (e.g., by a processor accessing the different codebook) or by base station 104 notifying mobile device 102 of the change.


In SDMA, multiple users may be scheduled simultaneously on the same time-frequency resource where their spatial signatures may be distinguished. In SDMA, a sector is split into virtual sectors such that user devices in the different regions share the same channel resources, thereby achieving higher spatial reuse. There might be a separate transmission mode that potentially provides robust signaling. This transmission mode may be used to transmit control and/or broadcast data. Every virtual sector could be further subdivided into a set of narrower spatial beams so that a particular beam (or linear combination of beams) within a virtual sector can be applied to a particular user device, thereby increasing antenna gain to the user device and limiting spatial spread of the interference created by the transmission.


SDMA is useful in high SNR scenarios when the capacity is near the non-linear region. In these embodiments, overlapping multiple users increases the number of available channels (dimensionality) at the cost of decreased SNR to each user. Given that at high SNR the users are in the non-linear capacity region, this approach increases system capacity. On the other hand, in low SNR regimes (linear region of the capacity curve), it is usually not beneficial to take power away from a user while increasing the dimensions. In these embodiments, it is beneficial to increase the SNR of the user through techniques, such as precoding where the precoding could be over multiple streams or flows of information (MIMO precoding). These embodiments utilize a pre-defined set of beams to transmit to the user. In a MIMO scheme, there are multiple streams transmitted to the same user, wherein the data can be transmitted along multiple eigen-vector directions.


Utilizing the disclosed techniques, seamless operation of multiple input single output/multiple input multiple output (MISO/MIMO) precoding and SDMA is enabled by applying precoding in the beam-space of SDMA beams. Specifically, if there are a few virtual sectors where SDMA is enabled, each such region further consists of a set of narrow spatial beams. These narrow beams form a basis for the transmissions that occur within that virtual sector.


The decision of which mode to utilize (precoding, SDMA, SDMA and precoding, MIMO, MIMO and precoding, or MIMO and SDMA) can be based on one or more channel conditions. A channel quality indicator (CQI) technique can be used to determine which vector to use, e.g. provides the highest or lowest value. For precoding, a particular entry can be utilized that pre-processes the user's transmissions. For MIMO precoding a set of vectors can be utilized to pre-process the base station's transmissions. Precoding provides a higher SNR, potentially resulting in better performance.



FIG. 2 illustrates a multiple access wireless communication system 200 according to various embodiments. A multiple access wireless communication system 200 includes multiple cells, e.g. cells 202, 204, and 206. In the embodiment of FIG. 2, each cell 202, 204, and 206 may include an access point 250 that includes multiple sectors. The multiple sectors are formed by groups of antennas each responsible for communication with access terminals in a portion of the cell. In cell 202, antenna groups 212, 214, and 216 each correspond to a different sector. In cell 204, antenna groups 218, 220, and 222 each correspond to a different sector. In cell 206, antenna groups 224, 226, and 228 each correspond to a different sector.


Each cell includes several access terminals, which are in communication with one or more sectors of each access point. For example, access terminals 230 and 232 are in communication with base station or access point 242, access terminals 234 and 236 are in communication with access point 244, and access terminals 238 and 240 are in communication with access point 246.


As illustrated in FIG. 2 each access terminal 230, 232, 234, 236, 238, and 240 is located in a different portion of it respective cell than the other access terminal(s) in the same cell. Further, each access terminal may be a different distance from the corresponding antenna groups with which it is communicating. Both of these factors provide situations, also due to environmental and other conditions in the cell that can cause different channel conditions to be present between each access terminal and its corresponding antenna group with which it is communicating.


As used herein, an access point may be a fixed station used for communicating with the terminals and may also be referred to as, and include some or all the functionality of, a base station, a Node B, or some other terminology. An access terminal may also be referred to as, and include some or all the functionality of, a user equipment (UE), a wireless communication device, a terminal, a mobile station or some other terminology.


In some embodiments, a set of known orthogonal or quasi-orthogonal vectors or matrices may be utilized at the base-station in order to provide SDMA (e.g. fixed or adaptive sectors). If the base station is aware of the vectors or beams for every user, it can allocate the same channel for different users if they utilize orthogonal or quasi-orthogonal vectors or matrices. In other embodiments, system 200 may include an omni-directional beam that corresponds to no precoding. The base station would use this beam for broadcast or multicast transmissions. In further embodiments, the system 200 may utilize precoding without SDMA if such channel information is reported to the user.



FIG. 3 illustrates a wireless communication system 300 according to one or more embodiments presented herein. A three-sector base station 302 can include multiple antenna groups. For example, one group can include antennas 304 and 306, another group can include antennas 308 and 310, and a third group can include antennas 312 and 314. Two antennas are illustrated for each antenna group, however, more or fewer antennas may be utilized for each antenna group. Mobile device 316 is in communication with antennas 312 and 314, where antennas 312 and 314 transmit information to mobile device 316 over a forward link 318 and receive information from mobile device 316 over a reverse link 320. 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 324 and receive information from mobile device 322 over reverse link 326.


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 are designed to communicate to mobile devices in a sector of the areas covered by base station 302. Beam-forming techniques can be utilized to provide fixed transmit directions in sectors or may be utilized in lieu of sectors. For example, beam patterns may provide multiple transmit directions in the sectors of a three-sector base station, resulting in a virtual six-sector base station. This ability to subdivide sectors can result in increased system capacity.


SDMA, MIMO and/or opportunistic beam-forming 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 subcarriers. These subcarriers are also referred to as tones, carriers, subcarriers, bins, and/or frequency channels. Each subcarrier 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 subcarriers, and the data transmission for each user device may be sent on the subcarrier(s) allocated to this user device. SDMA, MIMO and/or opportunistic beam-forning can be implemented for user devices allocated to different frequency regions.


In a beam-formed transmission system, sectors are portioned using separate beams. 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 SDMA, MIMO, opportunistic beam-forming or other scheduling methods. In addition, beam-forming with a fixed beam pattern allows a base station to utilize SDMA, MIMO and opportunistic beam-forming scheduling techniques simultaneously. For example, spatially orthogonal user devices may be scheduled using SDMA, user devices with well-conditioned matrix channels could be scheduled using MIMO and additional users could be scheduled using opportunistic beam-forming.


System 300 may utilize beam-forming in conjunction with precoding techniques. Precoding is generally a quantized representation of a space of vectors where different entries of a vector are applied to different transmit antennas. In the case of MIMO with multiple data streams, precoding may consist of a set of vectors where each vector corresponds to a certain MIMO stream. It should be noted that multiple data streams may include a multi-layer MIMO transmission with successive cancellation, a single or multi-codeword transmission with data symbols multiplexed over multiple transmit antennas.


In some embodiments, precoding weights can be selected from precoding matrices where every row corresponds to certain transmit antenna while every column corresponds to a MIMO stream. For such MIMO precoding, either a scalar or a vector quantization may be applied. For scalar quantization, the coefficients of a precoding matrix are quantized independently. For vector quantization, the entire precoding matrix is associated with a particular quantization index. It should be noted that space quantization accuracy is inherently related to the amount of feedback needed to report the desired quantization index to the transmit site (base station) by the receive site (user device) that usually has a better knowledge of channel conditions. Vector quantization can be more efficient whenever the overhead is expensive. As an example, a 6-bit representation of a quantization index (hence 64 precoding matrices) per static channel bin may approach performance of the optimal (continuous) feedback in a 4×4 MIMO system. It should be noted that static channel bin refers to a time-frequency region where channel is nearly constant.



FIG. 4 illustrates a beam pattern 400 for a sector 402 utilizing the disclosed techniques for improving communication in a wireless environment. Sector 402 includes a number of virtual sectors including a number of beams 404 transmitted from an access point 406. The illustrated beams 404 represent two separate combination of beams sets, having five beams each. It should be understood that more or fewer beam combinations and/or subset of beams could be utilized with the disclosed embodiments. For example, any combination of narrower beams in the set can be utilized to improve directionality. Each beam may be associated with a group of precoding weights, which, in some embodiments, may correspond to unitary matrices that may be utilized for precoding. In some embodiments, the combination of beams with precoding weights in a given virtual sector is quasi-orthogonal with respect to every other combination of beams with precoding weights in each other virtual sector. It should be noted, that some beams (e.g. those at the edges of virtual sectors) may be protected from being subject to precoding weights in order to prevent interference or leakage problems. If a precoding mode is utilized, the “beams” are transmitted and do not overlap. In MIMO mode, the multiple combinations of “beams” are utilized.


Unlike standard precoding wherein precoding weights (e.g., rows of precoding matrices) are applied to different transmit antennas directly, according to some embodiments, the precoding coefficients are applied to the beams. This approach can allow an arbitrary linear combination of beams to be constructed within a virtual sector, based on the channel knowledge. Therefore, a high precoding efficiency can be achieved over a virtual sector, provided the region is wide enough to capture most of the channel energy corresponding to a particular user device.


This approach can also ensure that the linear combinations are quasi-orthogonal to the linear combination of beams within other virtual sectors. Therefore, user devices can be assigned the same resources in different virtual sectors while mutual (intra-sector) interference is kept low.


In other embodiments, virtual sectors are defined in terms of average spatial covariance matrices and precoding matrices are generated for every region as (pseudo)-random realizations of matrices with the average covariance matrix defined for the region. By choosing quasi-orthogonal average covariance matrices for different regions, a low level of intra-cell interference can be achieved when user devices are assigned the same resources on different virtual sectors.


The decision to put a particular user device in a mode of utilizing beam and precoding weight combinations may be based upon scheduling the same resources to another user device on a different virtual sector and such determination can be made by the access point. This determination can be based on the channel quality reported by the user device for the desired precoding matrix. The determination can also, among other things, be based on the channel strength with respect to other virtual sectors that can cause intra-sector interference once in SDMA mode.


For user devices that are not scheduled to use the beam and precoding weight combination, the precoding may be performed over a virtual sector that includes the entire sector. In this embodiment, precoding matrices can be defined either with respect to transmit antennas, which is the classic approach, or with respect to the beams.


It should be noted that beam-space precoding could be beneficial to support SDMA because it gives a natural way to limit interference between users scheduled for the same resources on a different virtual sector. Precoding with respect to transmit antennas allows definition of a family of precoding matrices such that, for any precoding matrix, every antenna transmits the same amount of power. This can be beneficial in thermal-limited environments (e.g., large cells, limited link budget), where it may be desirable to transmit at the maximum power level. In some embodiments, precoding in the space of transmit antennas is utilized for non-SDMA user devices. Also, in some embodiments, there may be no precoding and/or SDMA applied for broadcast transmissions.



FIG. 5 illustrates functional blocks of a system 500 in accordance with various embodiments. These functional blocks represent functions implemented by a processor, software or combination thereof (e.g., firmware). Included are a beam generator 502, an assigner 504, a scheduler 506, and a communicator 508 that interface with each other. While four functional blocks are shown, there can be more or fewer functional blocks and some functional blocks can be combined or separated according to the various embodiments presented herein.


Beam generator 502 can be configured to pre-process signals with one or more vectors and/or one or more vector combinations or sets. For example, beam generator 502 can generate a first vector or vector set having a coverage area. Beam generator 502 can further generate a second (third, fourth, etc.) vector or vector set that has a substantially different or slightly different coverage area than the coverage area of the first vector or vector set. In such a manner, the vector or vector sets generated should not overlap and may be orthogonal. In other embodiments, the second vectors (or vector sets) can have the same coverage area as the first vector (or vector set).


Assigner 504 can be configured to assign one or more user devices to the first beam or beam set. Assigner 504 can be associated with a codebook that contains a predefined set of vectors from which an access terminal can choose. Each entry in the codebook can correspond to a type of vectors. Thus, assigner 504 can associate the user preference with an entry or entries in a codebook. For example, one entry can be a vector that corresponds to precoding. Another entry can correspond to two vectors utilized for MIMO precoding, wherein each column in a matrix would be a vector. Yet another entry can be a set of matrices, each set corresponding to one SDMA cluster. The SDMA users should be separated by having sufficiently separate beams at the transmitter, or access point. If two users overlap, they should only overlap if they get beams from different clusters. For example, if two users want transmissions from one cluster, one or both users are sent to different entries in the codebook, and SDMA is not used for these users.


A precoding technique can be utilized to associate a particular beam (or beam set) to a particular user device. Assigner 504 can further be configured to assign a second (third, fourth, etc.) user device to a second (third, fourth, etc.) beam or beam set, which may take into consideration a spatial processing technique. In other embodiments, assigner 504 can assign first user device to the second (and subsequent) beam or beam sets if only precoding will be utilized. According to some embodiments, assigner 504 can determine a channel characteristic of the user.


Scheduler 506 can be configured to schedule communication for the user devices based upon space division multiple access (SDMA), multiple input multiple output (MIMO), and/or opportunistic beam-forming scheduling techniques or to a transmission mode (e.g., precoding, SDMA, SDMA precoding, MIMO, MIMO precoding, MIMO-SDMA, diversity). Such scheduling should be optimized to enhance performance in a wireless communication environment. Scheduler 506 can select one or more transmission modes to apply. The selection can correspond to the entry or entries in the codebook.


Communicator 508 (or transmitter/receiver) can be configured to receive information from each user device regarding a beam or beam set preference. For example, communicator 508 can receive a user preference for a transmission mode. Communicator 508 can also be configured to transmit the identifier of the mode or modes selected. In such a manner, communicator 508 can interface with the other functional blocks in order to locate two or more user devices that can share the resources of a common access point.



FIG. 6A illustrates a methodology for enhancing performance in a wireless communication environment. The method 600 begins, at 602, where a user preference is received based on a plurality of criteria determined by the user mobile device. The user preference may comprise a preference identifying the mode, multiple modes along with related CQIs for some or all of the modes, differentials between the CQIs for one or more modes, CQI, or other information that is capable of being utilized to determine this preference.


At 604, a codebook is read to determine what mode and specific vector, or vectors, or matrix, or matrices, correspond to the user preference, e.g. correspond to a quantized index that was included in the user preference. The reading of the codebook can be performed by associating the received preference with an entry or entries in the codebook. At 606, the user can be assigned to the particular spatial processing mode or transmission mode utilizing the specific vector, or vectors, or matrix, or matrices. The particular transmission mode can correspond to the entry or entries in the codebook that correspond to the user preference.


Associating the entries in the codebook to a particular spatial processing mode can take many forms. It should be understood that the following discussion is for example purposes only and not limitation. For example, a set of entries can correspond to precoding, which can be utilized for a plurality of users that are in line-of-sight operation. To define this plurality of users, beam-steering vectors are defined and can be utilized for the line of sight users.


Another set of entries can be a linear combination of beam-steering vectors. These beam-steering vectors can be pointing in a certain direction in a sector. Thus, not every user will be in line-of-sight and can utilize linear combinations of these beam-steering vectors. Another set of entries in the codebook can correspond to these linear combinations, e.g., a set of combinations that include any number of combinations (2, 3, 4, etc.). It should be noted that a first set of entries can be called “beams” and the next set of entries can be linear combinations of the beams. The access point can use these pre-defined beams.


According to MIMO, a set of entries can be defined where each entry includes two, three, four, five, etc. vectors. Each column of the matrices may be a linear combination of the beams. A means to differentiate the columns can be ascertaining the differences of the linear combination across the columns. For example, column 1 is a linear combination of beams 1, 2, and 3 and column 2 is a linear combination of beams 2, 5, and 6. A third set of entries can be a matrix, wherein each column can be a linear combination of beams.


For an SDMA example, a defined first set of beams can be pointing in a certain direction in a sector. To perform grouping on the beams, all beams can be pointed at a 30 degree angle, for example. One sector may be divided into two or more virtual sectors wherein all beams within a virtual sector are grouped and all beams in another virtual sector are grouped, separate from the first group. These beams are essentially clustered based on which direction they are pointing. Thus, if two users prefer beams in separate clusters, and user 1 prefers beams in cluster 1 and user 2 prefers beams in cluster 2, SDMA can be utilized with user 1 and user 2. These beams are allowed to overlap. Precoding with SDMA can be described as a mode where a user is assigned to a beam that is a linear combination of beams in a cluster.



FIG. 6B illustrates a system for enhancing performance in a wireless communication environment. The means 610 for interpreting a user preference is coupled with means 612 for reading a codebook to determine what mode and specific vector, or vectors, or matrix, or matrices, correspond to the user preference, e.g. correspond to a quantized index that was included in the user preference. The reading of the codebook can be performed by associating the received preference with an entry or entries in the codebook. Means 612 is coupled to means 614 for assigning the user to the particular spatial processing mode or transmission mode from the codebook utilizing the specific vector, or vectors, or matrix, or matrices.



FIG. 7A illustrates a methodology 700 for determining and reporting a user' preference of a mode(s) or transmission(s) technique in accordance with the various embodiments presented herein. According to the methodology, one or more channel characteristics for a user are determined, at block 702. The channel characteristics may be one or more CQIs for each, some, or all of the transmission techniques or modes, and their combinations, available to the user. These modes include SDMA, SDMA precoding, precoding, MIMO-SDMA, MIMO precoding, diversity mode, and/or the like. Further, the channel characteristics may include transmission power offsets, signal strengths, other sector interference information, and/or other channel information criteria.


At block 704, a determination is made as to which mode to apply. The determination can be based upon channel characteristics, for example. After a selection of the mode(s) is made, an identifier including the mode is transmitted, at 706.


As discussed above, the modes include SDMA, SDMA precoding, precoding, MIMO-SDMA, MIMO precoding, and/or the like. In order to select whether to use SDMA, SDMA precoding, precoding, MIMO-SDMA, MIMO precoding, diversity mode, and/or the like, certain information should be provided to the base station or transmitter. This information should communicate not only the selection but also information as to which precoding weights or beams and precoding weights to utilize. The user or user device may include one or all of the following metrics in its reporting of channel information, which then may be used to both decide which approach to use as well as which linear combination to utilize in the approach. Metrics that can be utilized and reported include CQI for precoding, CQI for SDMA, and/or CQI for diversity mode. These metrics may be reported in any sets of combinations or exclusively of each other.


The CQI for precoding metric captures the channel quality (e.g., SINR) if a user were to be scheduled on a certain beam (or matrix if MIMO). Usually, the CQI corresponding to the best beam is reported along with the index of the best beam. There may be benefits in feeding back the precoding CQIs (and indices) for the second best beam, third best beam, etc.


The CQI for SDMA metric captures the channel quality, e.g., SINR, if the user were to be scheduled using SDMA. The signal power is computed assuming the user was scheduled on the best beam. In general, the interference is the sum of two quantities. The first quantity is the sum of thermal and the inter-cell interference. The second quantity corresponds to the interference due to a user scheduled on one of the beams in a different cluster. There can be many ways of computing this and two non-limiting embodiments (averaging over adverse beams and single interfering beam) will be described.


In the averaging over adverse beams mode, the interference due to a co-SDMA user is estimated. This estimation assumes that the user may be scheduled on any one of the beams within a different cluster and that a user is scheduled in a spatial cluster. The amount of interference generated from another cluster is the average of the interference created by the beams belonging to that cluster. The total interference is, therefore, the sum of the interference due to the other clusters.


In the single interfering beam mode, the SDMA user assumes that a specific beam is assigned to a user in an interfering SDMA cluster. The interference is therefore just the interference from this one beam. Through utilization of the described or other computations, the user terminal has the available channel information with the signal and interference computed. This can be fed back along with the index of the best (signaling) beam and the index of the interfering beam, if utilizing the single interfering beam mode.


Another metric is the CQI for diversity mode transmission. This metric captures the channel quality if neither precoding nor SDMA is used to schedule the user. This metric allows the system to provide a minimum level of performance for a given user. The idea here is that precoding/SDMA is used only if the precoding/SDMA CQI is greater than the diversity mode CQI. It should be noted that this CQI reports the quality of channel containing diversity mode information.



FIG. 7B illustrates a system for determining and reporting a user' preference of a mode(s) or transmission(s) technique in accordance with the various embodiments presented herein. Means 710 for determining one or more channel characteristics is coupled to means 712 for determining a mode to apply from a codebook based upon the one or more channel characteristics. The channel characteristics may be one or more CQIs for each, some, or all of the transmission techniques or modes, and their combinations, available to the user. The modes include SDMA, SDMA precoding, precoding, MIMO-SDMA, MIMO precoding, diversity mode, and/or the like. Further, the channel characteristics may include transmission power offsets, signal strengths, other sector interference information, and/or other channel information criteria. Means 712 is coupled to means 714 for generating an identifier of the mode, which may then be transmitted to the access point.



FIG. 8 illustrates a system 800 that utilizes the disclosed techniques to increase system capacity in a wireless communication environment in accordance with the one or more embodiment presented 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 includes a receiver 802 that receives a signal from, for instance one or more receive antennas, and performs typical actions thereon (e.g., filters, amplifies, downconverts, . . . ) 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 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. Processor 806 can be configured to select a transmission mode of a plurality of transmission modes from a codebook. User device 800 can include an optimizer 808 that coordinates beam assignments. Optimizer 808 may be incorporated into the processor 806. It is to be appreciated that optimizer 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 other suitable information related to beam-forming 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 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 illustrates a system that utilizes precoding and SDMA to increase system capacity in a wireless communication environment in accordance with the various embodiments. System 900 comprises a base station 902 with a receiver 910 that receives signal(s) from one or more user devices 904 through 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 assigner 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, a precoding scheme, or a resource sharing scheme.



FIG. 10 illustrates a transmitter and receiver in a multiple access wireless communication system 1000 according to various embodiments presented herein. 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 and/or methods described herein to facilitate wireless communication there between.


At transmitter system 1010, traffic data for a number of data streams is provided from a data source 1012 to a transmit (TX) data processor 1014. In some embodiments, each data stream is transmitted over a respective transmit antenna. TX data processor 1014 formats, codes, and interleaves the traffic data for each data stream based on a particular coding scheme selected for that data stream to provide coded data. In some embodiments, TX data processor 1014 applies beam-forming weights to the symbols of the data streams based upon the user to which the symbols are being transmitted and the antenna from which the symbol is being transmitted. In some embodiments, the beam-forming weights may be generated based upon channel response information that is indicative of the condition of the transmission paths between the access point and the access terminal. The channel response information may be generated utilizing CQI information or channel estimates provided by the user. Further, in those cases of scheduled transmissions, the TX data processor 1014 can select the packet format based upon rank information that is transmitted from the user.


The coded data for each data stream may be multiplexed with pilot data using OFDM techniques. The pilot data is typically a known data pattern that is processed in a known manner and may be used at the receiver system to estimate the channel response. The multiplexed pilot and coded data for each data stream is then modulated (e.g., symbol mapped) based on a particular modulation scheme (e.g., BPSK, QSPK, M-PSK, or M-QAM) selected for that data stream to provide modulation symbols. The data rate, coding, and modulation for each data stream may be determined by instructions performed or provided by processor 1030. In some embodiments, the number of parallel spatial streams may be varied according to the rank information that is transmitted from the user.


The modulation symbols for the data streams are provided to a TX MIMO processor 1020, which may further process the modulation symbols (e.g., for OFDM). TX MIMO processor 1020 provides NT symbol streams to NT transmitters (TMTR) 1022a through 1022t. In some embodiments, TX MIMO processor 1020 applies beam-forming weights to the symbols of the data streams based upon the user to which the symbols are being transmitted and the antenna from which the symbol is being transmitted from that users channel response information.


Each transmitter 1022 receives and processes a respective symbol stream to provide one or more analog signals, and further conditions (e.g., amplifies, filters, and upconverts) the analog signals to provide a modulated signal suitable for transmission over the MIMO channel. NT modulated signals from transmitters 1022a through 1022t are transmitted from NT antennas 1024a through 1024t, respectively.


At receiver system 1050, the transmitted modulated signals are received by NR antennas 1052a through 1052r and the received signal from each antenna 1052 is provided to a respective receiver (RCVR) 1054. Each receiver 1054 conditions (e.g., filters, amplifies, and downconverts) a respective received signal, digitizes the conditioned signal to provide samples, and further processes the samples to provide a corresponding “received” symbol stream.


An RX data processor 1060 then receives and processes the NR received symbol streams from NR receivers 1054 based on a particular receiver processing technique to provide the rank number of “detected” symbol streams. The processing by RX data processor 1060 is described in further detail below. Each detected symbol stream includes symbols that are estimates of the modulation symbols transmitted for the corresponding data stream. RX data processor 1060 then demodulates, deinterleaves, and decodes each detected symbol stream to recover the traffic data for the data stream. The processing by RX data processor 1060 is complementary to that performed by TX MIMO processor 1020 and TX data processor 1014 at transmitter system 1010.


The channel response estimate generated by RX processor 1060 may be used to perform space, space/time processing at the receiver, adjust power levels, change modulation rates or schemes, or other actions. RX processor 1060 may further estimate the signal-to-noise-and-interference ratios (SNRs) of the detected symbol streams, and possibly other channel characteristics, and provides these quantities to a processor 1070. RX data processor 1060 or processor 1070 may further derive an estimate of the “effective” SNR for the system. Processor 1070 then provides estimated channel information (CSI), which may comprise various types of information regarding the communication link and/or the received data stream. For example, the CSI may comprise only the operating SNR. The CSI is then processed by a TX data processor 1038, which also receives traffic data for a number of data streams from a data source 1076, modulated by a modulator 1080, conditioned by transmitters 1054a through 1054r, and transmitted back to transmitter system 1010.


At transmitter system 1010, the modulated signals from receiver system 1050 are received by antennas 1024, conditioned by receivers 1022, demodulated by a demodulator 1040, and processed by a RX data processor 1042 to recover the CSI reported by the receiver system. The reported CSI is then provided to processor 1030 and used to (1) determine the data rates and coding and modulation schemes to be used for the data streams and (2) generate various controls for TX data processor 1014 and TX MIMO processor 1020.


At the receiver, various processing techniques may be used to process the NR received signals to detect the NT transmitted symbol streams. These receiver processing techniques may be grouped into two primary categories (i) spatial and space-time receiver processing techniques (which are also referred to as equalization techniques); and (ii) “successive nulling/equalization and interference cancellation” receiver processing technique (which is also referred to as “successive interference cancellation” or “successive cancellation” receiver processing technique).


A MIMO channel formed by the NT transmit and NR receive antennas may be decomposed into Ns independent channels, with NS≦min {NT, NR}. Each of the NS independent channels may also be referred to as a spatial subchannel (or a transmission channel) of the MIMO channel and corresponds to a dimension.


It is to be understood that the embodiments described herein may be implemented by hardware, software, firmware, middleware, microcode, or any combination thereof. For a hardware implementation, the processing units within an access point or an access terminal 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.


When the embodiments are implemented in software, firmware, middleware or microcode, program code or code segments, they may be stored in a machine-readable medium, such as a storage component. A code segment may represent a procedure, a function, a subprogram, a program, a routine, a subroutine, a module, a software package, a class, or any combination of instructions, data structures, or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted using any suitable means including memory sharing, message passing, token passing, network transmission, etc.


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 through various means as is known in the art.


What has been described above includes examples of one or more embodiments to enable a person skilled in the art to make or use the features, functions, operations, and embodiments disclosed herein. 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 in a wireless communication environment, comprising: receiving one or more signals indicative of a user preference associated with a user device for a transmission mode;associating the user preference with at least one entry in a first codebook comprising one or more entries corresponding to a plurality of transmission modes for a first base station, wherein the first codebook is changed for a second codebook comprising one or more entries corresponding to a plurality of transmission modes for a second base station at least in part in response to the user device transitioning from communicating with the first base station to communicating with the second base station, wherein the first codebook comprises one or more entries that differ from one or more corresponding entries of the second codebook; andassigning the user device to the transmission mode corresponding to the at least one entry in the first codebook.
  • 2. The method of claim 1, wherein said associating the user preference with the at least one entry in the first codebook comprises reading the first codebook to determine the transmission mode and at least one vector or at least one matrix that corresponds to the user preference.
  • 3. The method of claim 1, wherein the at least one entry of the first codebook includes one or more of precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO), MIMO precoding, MIMO-SDMA or a diversity.
  • 4. The method of claim 3, wherein individual entries of the first codebook correspond to one or more transmission modes of the plurality of transmission modes.
  • 5. The method of claim 1, wherein the received user preference comprises at least one of a preference identifying the transmission mode, a channel quality indicator (CQI), multiple transmission modes and related CQIs for at least one of the multiple transmission modes, or differentials between the CQIs for the at least one of the multiple transmission modes.
  • 6. The method of claim 1, wherein said user preference is based at least in part on one or more criteria determined by the user, and wherein the at least one entry in the first codebook comprises one or more of a plurality of vectors or matrices corresponding to the plurality of transmission modes.
  • 7. A method of determining a user's preference of a transmission mode at a wireless communication device in communication with a user, comprising: receiving the user preference of the transmission mode and associating the user preference with at least one entry in a first codebook comprising one or more entries corresponding to a plurality of transmission modes for a first base station;determining one or more channel characteristics of the user wireless communication device;selecting the transmission mode from the first codebook, wherein the first codebook is changed for a second codebook comprising one or more entries corresponding to a plurality of transmission modes for a second base station at least in part in response to the wireless communication device transitioning from communicating with the first base station to communicating with the second base station, wherein the first codebook comprises one or more entries that differ from one or more corresponding entries of the second codebook; andtransmitting an identifier of the selected transmission mode from the wireless communication device to the first base station.
  • 8. The method of claim 7, wherein said determining the channel characteristics of the user wireless communication device comprises utilizing one or more of a CQI, power offsets, signal strengths, and other sector interference information.
  • 9. The method of claim 7, wherein the at least one entry of the first codebook includes one or more of precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO-SDMA), MIMO precoding, or a diversity.
  • 10. The method of claim 7, wherein the channel characteristics comprise at least one metric that is utilized to select the transmission mode.
  • 11. The method of claim 10, wherein the at least one metric comprises at least one of a CQI for precoding, a CQI for SMDA, and a CQI for diversity mode.
  • 12. The method of claim 7, wherein said user preference is based at least in part on one or more criteria determined by the user, and wherein the at least one entry in the first codebook comprises one or more of a plurality of vectors or matrices corresponding to the plurality of transmission modes.
  • 13. A wireless communication device, comprising: a processor toselect a transmission mode from a first codebook comprising one or more entries corresponding to a plurality of transmission modes for a first base station based at least in part on criteria relating to one or more channels between the wireless communication device and the first base station, wherein the first codebook is changed for a second codebook comprising one or more entries corresponding to a plurality of transmission modes for a second base station at least in part in response to the wireless communication device transitioning from communicating with the first base station to communicating with the second base station, wherein the first codebook comprises one or more entries that differ from one or more corresponding entries of the second codebook,generate a user preference based at least in part on said selected transmission mode, andprepare the user preference for transmission to the first base station; anda memory coupled with the processor.
  • 14. The wireless communication device of claim 13, wherein the at least one entry of the first codebook includes one or more of precoding, space division, multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO), MIMO precoding, MIMO-SDMA, or a diversity.
  • 15. The wireless communication device of claim 13, wherein individual entries of the first codebook correspond to one or more transmission modes from the plurality of transmission modes.
  • 16. The wireless communication device of claim 13, wherein the processor automatically accesses additional different codebooks as the wireless communication device is moved among additional different base stations.
  • 17. The wireless communication device of claim 13, wherein the wireless communication device receives additional different codebooks from which to select additional transmission modes as the wireless communication device is moved among additional different base stations.
  • 18. The method of claim 13, wherein the at least one entry in the first codebook comprises one or more of a plurality of vectors or matrices corresponding to the plurality of transmission modes.
  • 19. A wireless communication device comprising: means for receiving a user preference associated with a user device for a transmission mode;means for associating the user preference with at least one entry in a first codebook comprising one or more entries corresponding to a plurality of transmission modes for a first base station, wherein the first codebook is changed for a second codebook comprising one or more entries corresponding to a plurality of transmission modes for a second base station at least in part in response to the user device transitioning from communicating with the first base station to communicating with the second base station, wherein the first codebook comprises one or more entries that differ from one or more corresponding entries of the second codebook; andmeans for assigning the user device to a transmission mode corresponding to the at least one entry in the first codebook.
  • 20. The wireless communication device of claim 19, wherein the at least one entry of the first codebook includes one or more of precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO), MIMO precoding, MIMO-SDMA or a diversity.
  • 21. The wireless communication device of claim 19, wherein individual entries of the first codebook correspond to one or more transmission modes from the plurality of transmission modes.
  • 22. The wireless communication device of claim 19, wherein said user preference is based at least in part on one or more criteria determined by the user, and wherein the at least one entry in the first codebook comprises one or more of a plurality of vectors or matrices corresponding to the plurality of transmission modes.
  • 23. A wireless communication device comprising: means for receiving a user preference of a transmission mode and associating the user preference with at least one entry in a first codebook comprising one or more entries corresponding to a plurality of transmission modes for a first base station;means for determining one or more channel characteristics of the wireless communication device;means for selecting from the first codebook the transmission mode from the plurality of transmission modes based at least in part on the user preference, wherein the first codebook is changed for a second codebook comprising one or more entries corresponding to a plurality of transmission modes for a second base station at least in part in response to the wireless communication device transitioning from communicating with the first base station to communicating with the second base station, wherein the first codebook comprises one or more entries that differ from one or more corresponding entries of the second codebook; andmeans for transmitting an identifier of the selected transmission mode from the wireless communication device to the first base station.
  • 24. The wireless communication device of claim 23, wherein the means for determining the one or more channel characteristics of the wireless communication device comprises means for utilizing one or more of a CQI, power offsets, signal strengths, and other sector interference information.
  • 25. The wireless communication device of claim 23, wherein the at least one entry of the first codebook includes one or more of precoding, space division multiple access (SDMA), SDMA precoding, multiple input multiple output (MIMO), MIMO precoding, MIMO-SDMA, or a diversity.
  • 26. The wireless communication device of claim 23, wherein said user preference is based at least in part on one or more criteria determined by the user, and wherein the at least one entry in the first codebook comprises one or more of a plurality of vectors or matrices corresponding to the plurality of transmission modes.
  • 27. An article, comprising: a non-transitory computer-readable medium having stored thereon instructions executable by a processor to: process a user preference associated with a user device for a transmission mode;associating the user preference with at least one entry in a first codebook comprising one or more entries corresponding to a plurality of transmission modes for a first base station, wherein the first codebook is changed for a second codebook comprising one or more entries corresponding to a plurality of transmission modes for a second base station at least in part in response to the user device transitioning from communicating with the first base station to communicating with the second base station, wherein the first codebook comprises one or more entries that differ from one or more corresponding entries of the second codebook; andassigning the user device to the transmission mode corresponding to the at least one entry in the first codebook.
  • 28. The article of claim 27, wherein the at least one entry in the first codebook comprises one or more of a plurality of vectors or matrices corresponding to the plurality of transmission modes.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application Ser. No. 60/731,014, filed Oct. 27, 2005, entitled “Precoding And SDMA Support,” and U.S. Provisional Application Ser. No. 60/713,029, filed Aug. 30, 2005, entitled “Beam-Space Precoding For SDMA Wireless Communication Systems,” the entireties of both of which are incorporated herein by reference.

US Referenced Citations (768)
Number Name Date Kind
4393276 Steele et al. 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 et al. 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 et al. Jan 1995 A
5406551 Saito et al. Apr 1995 A
5410538 Roche et al. Apr 1995 A
5455839 Eyuboglu et al. Oct 1995 A
5465253 Rahnema Nov 1995 A
5491727 Petit et al. Feb 1996 A
5513379 Benveniste et al. Apr 1996 A
5539748 Raith et al. 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 et al. Oct 1998 A
5828650 Malkamaki et al. Oct 1998 A
5838268 Frenkel et al. Nov 1998 A
5867478 Baum et al. Feb 1999 A
5870393 Yano et al. Feb 1999 A
5887023 Mabuchi et al. Mar 1999 A
5907585 Suzuki et al. May 1999 A
5920571 Houck et al. Jul 1999 A
5926470 Tiedemann, Jr. et al. Jul 1999 A
5933421 Alamouti et al. Aug 1999 A
5949814 Odenwalder et al. Sep 1999 A
5953325 Willars Sep 1999 A
5955992 Shattil et al. Sep 1999 A
5956642 Larsson et al. Sep 1999 A
5995992 Eckard et al. Nov 1999 A
5999826 Whinnett Dec 1999 A
6002942 Park et al. Dec 1999 A
6016123 Barton et al. Jan 2000 A
6038150 Yee et al. Mar 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 et al. 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 et al. 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 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 et al. 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 er al. Apr 2003 B1
6542743 Soliman Apr 2003 B1
6563806 Yano et al. May 2003 B1
6563881 Sakoda et al. May 2003 B1
6577739 Hurtig et al. Jun 2003 B1
6584140 Lee et al. 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 et al. 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 et al. Jan 2004 B1
6675012 Gray et al. Jan 2004 B2
6678318 Lai et al. 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 et al. 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 et al. Mar 2005 B1
6870826 Ishizu et al. 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 et al. Aug 2005 B1
6934266 Dulin et al. Aug 2005 B2
6934275 Love et al. Aug 2005 B1
6934340 Dollard et al. Aug 2005 B1
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 et al. 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 et al. Mar 2006 B1
7020110 Walton et al. Mar 2006 B2
7023880 El-Maleh et al. Apr 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 Hashem 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
7131086 Yamasaki 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
7184713 Kadous et al. Feb 2007 B2
7188300 Eriksson et al. Mar 2007 B2
7197282 Dent et al. Mar 2007 B2
7200177 Miyoshi et al. 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 et al. 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 et al. Dec 2007 B2
7313126 Yun et al. Dec 2007 B2
7313174 Alard et al. Dec 2007 B2
7313407 Shapira et al. Dec 2007 B2
7327812 Auer et al. Feb 2008 B2
7330701 Mukkavilli et al. Feb 2008 B2
7336727 Mukkavilli et al. Feb 2008 B2
7349371 Schein et al. 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 et al. Aug 2008 B2
7418043 Shattil et al. 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
8031583 Classon et al. Oct 2011 B2
8095141 Teague Jan 2012 B2
8098568 Laroia et al. Jan 2012 B2
8098569 Laroia et al. Jan 2012 B2
8199634 Laroia et al. Jun 2012 B2
8218425 Laroia et al. Jul 2012 B2
8223627 Laroia et al. Jul 2012 B2
8446892 Ji et al. May 2013 B2
8462859 Sampath et al. Jun 2013 B2
8477684 Khandekar et al. Jul 2013 B2
8582509 Khandekar et al. Nov 2013 B2
8582548 Gore et al. Nov 2013 B2
8599945 Sampath Dec 2013 B2
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
20020122403 Hashem et al. Sep 2002 A1
20020128035 Jokinen et al. Sep 2002 A1
20020147953 Catreux Oct 2002 A1
20020159422 Li 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 et al. Nov 2003 A1
20030228850 Hwang Dec 2003 A1
20030235255 Ketchum 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 et al. 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 et al. 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
20040166867 Hawe 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 et al. Apr 2005 A1
20050084000 Krauss et al. Apr 2005 A1
20050085195 Tong et al. Apr 2005 A1
20050085197 Laroia 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, Jr. 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
20050281029 Inamoto 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
20060146867 Lee et al. Jul 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 et al. Oct 2006 A1
20060233131 Gore 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 Coulson 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 et al. Feb 2007 A1
20070041457 Kadous et al. Feb 2007 A1
20070047485 Gorokhov et al. Mar 2007 A1
20070047495 Ji 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 Ji 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 Khandekar 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 Muharemovic 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 Zhang 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 Ho 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 Orlik 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 Wengerter 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
20110255518 Agrawal et al. Oct 2011 A9
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 (432)
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
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
11298954 Oct 1999 JP
2000022618 Jan 2000 JP
2000102065 Apr 2000 JP
2000184425 Jun 2000 JP
2000511750 Sep 2000 JP
2000332724 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
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
200416238 Jun 2004 JP
2004158901 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
2005006337 Jan 2005 JP
2005020530 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
2007520309 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
248266 Jan 2006 TW
200718128 May 2007 TW
WO9408432 Apr 1994 WO
WO-9521494 Aug 1995 WO
WO9613920 May 1996 WO
WO9701256 Jan 1997 WO
WO9737456 Oct 1997 WO
WO-9746033 Dec 1997 WO
WO-9800946 Jan 1998 WO
WO-9814026 Apr 1998 WO
WO9837706 Aug 1998 WO
WO9848581 Oct 1998 WO
WO9853561 Nov 1998 WO
WO9854919 Dec 1998 WO
WO-9941871 Aug 1999 WO
WO-9944313 Sep 1999 WO
WO-9944383 Sep 1999 WO
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
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
WO0169814 Sep 2001 WO
WO0182543 Nov 2001 WO
WO-0182544 Nov 2001 WO
WO-0189112 Nov 2001 WO
0195427 Dec 2001 WO
WO0193505 Dec 2001 WO
WO-0204936 Jan 2002 WO
WO0207375 Jan 2002 WO
0215432 Feb 2002 WO
WO0215616 Feb 2002 WO
WO-0219746 Mar 2002 WO
WO-0231991 Apr 2002 WO
WO-0233848 Apr 2002 WO
0245293 Jun 2002 WO
WO0245456 Jun 2002 WO
WO0249305 Jun 2002 WO
WO-0249306 Jun 2002 WO
WO0249385 Jun 2002 WO
WO02060138 Aug 2002 WO
WO02065675 Aug 2002 WO
WO02082689 Oct 2002 WO
WO-02082743 Oct 2002 WO
WO02089434 Nov 2002 WO
WO02093782 Nov 2002 WO
WO02093819 Nov 2002 WO
WO02100027 Dec 2002 WO
WO-03001696 Jan 2003 WO
WO03001761 Jan 2003 WO
WO-03001981 Jan 2003 WO
WO-03003617 Jan 2003 WO
WO03019819 Mar 2003 WO
WO03030414 Apr 2003 WO
WO03034644 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
WO03085876 Oct 2003 WO
WO03088538 Oct 2003 WO
WO03094384 Nov 2003 WO
2004002011 Dec 2003 WO
WO03103331 Dec 2003 WO
WO04002047 Dec 2003 WO
WO2004004370 Jan 2004 WO
WO2004008671 Jan 2004 WO
WO-2004008681 Jan 2004 WO
WO2004015912 Feb 2004 WO
WO2004016007 Feb 2004 WO
WO2004021605 Mar 2004 WO
WO2004023834 Mar 2004 WO
2004028037 Apr 2004 WO
WO-2004030238 Apr 2004 WO
WO-2004032443 Apr 2004 WO
2004038984 May 2004 WO
WO2004038954 May 2004 WO
WO-2004038972 May 2004 WO
WO-2004038988 May 2004 WO
WO-2004040690 May 2004 WO
WO-2004040827 May 2004 WO
WO2004047354 Jun 2004 WO
WO2004049618 Jun 2004 WO
WO-2004051872 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
WO-2004073276 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
2004114564 Dec 2004 WO
WO2004105272 Dec 2004 WO
WO2004114549 Dec 2004 WO
WO-2004114615 Dec 2004 WO
2005002253 Jan 2005 WO
2005011163 Feb 2005 WO
2005018270 Feb 2005 WO
WO-2005015795 Feb 2005 WO
WO-2005015797 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
WO2005032004 Apr 2005 WO
WO-2005043780 May 2005 WO
WO2005043855 May 2005 WO
WO2005046080 May 2005 WO
WO-2005055465 Jun 2005 WO
WO2005055484 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
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
WO-2006096784 Sep 2006 WO
WO-2006099349 Sep 2006 WO
WO-2006099545 Sep 2006 WO
WO-2006099577 Sep 2006 WO
WO-2006127544 Nov 2006 WO
WO-2006134032 Dec 2006 WO
WO-2006138196 Dec 2006 WO
WO-2006138573 Dec 2006 WO
WO2006138581 Dec 2006 WO
2007022430 Feb 2007 WO
WO-2007024934 Mar 2007 WO
WO-2007024935 Mar 2007 WO
WO2007025160 Mar 2007 WO
WO-2007051159 May 2007 WO
Non-Patent Literature Citations (133)
Entry
International Search Report—PCT/US06/033937, International Search Authority—European Patent Office, Apr. 12, 2007.
Written Opinion—PCT/US06/033937, International Search Authority—European Patent Office, Apr. 12, 2007.
International Preliminary Report on Patentability—PCT/US06/033937, The International Bureau of WIPO—Geneva, Switzerland, Mar. 4, 2008.
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.
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).
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.
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.
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.
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.
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.
Groe, et al., “CDMA Mobile Radio Design,” Sep. 26, 2001, Artech House, Norwood, MA 02062, pp. 257-259.
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.
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.
J.S. Chow and J.M. Cioffi: “A cost-effective maximum likelihood reciever for multicarrier systems”, Proc. IEEE Int. Conf. On Comm., pp. 948-952, Jun. 1992.
Je, et al. “A Novel Multiple Access Scheme for Uplink Cellular Systems,” IEEE Vehicular Technology Conference, Sep. 26, 2004 pp. 984-988.
John B. Groe, Lawrence E. Larson, “CDMA Mobile Radio Design” Sep. 26, 2001, Artech House, Norwood, MA02062 580530, XP002397967, pp. 157-159.
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.1., “Programmable Demultiplexer/Demodulator Processor,” COMSAT Laboratories, IEEE, 1990, pp. 230-234.
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, pp. 2329-2332.
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, Apr. 22, 2003, p. 139-144.
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.
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. 1, Jan. 2004, pp. 62-70, XP001189908.
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.
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.
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.
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).
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.
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).
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. 10, 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.
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.
International Symposium on Computers and Communications, 1999, Jul. 6-8, 1999, pp. 362-368.
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.
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.
“European Search Report—EP10011743, Search Authority—Munich Patent Office, Dec. 20, 2010 (060527EPD1D1)”.
European Search Report—EP10012081, Search Authority—Munich Patent Office, Dec. 17, 2010 (060527EPD2).
European Search Report—EP10012082, Search Authority—Munich Patent Office, Dec. 20, 2010 (060527EPD3).
European Search Report—EP10012083, Search Authority—Munich Patent Office, Dec. 30, 2010 (060527EPD4).
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.
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,” 2002 IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications, Prague, Czech Republic, 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 Receiving 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.
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.
Taiwanese Search Report—095139893—TIPO—Dec. 30, 2010 (060058U2).
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 (050917CN).
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 (060053JP).
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 (060054U2KR).
Translation of Office Action in Canadian application 2625987 corresponding to U.S. Appl. No. 11/261,065, citing CA2557369 dated Apr. 12, 2011 (060053CA).
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 (060053CN).
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 (060054CN).
Translation of Office Action in Chinese application 200680048832.4 corresponding to U.S. Appl. No. 11/261,158, citing CN1132474 dated Dec. 31, 2010 (060058U2CN).
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 (050396JP).
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 (050944JP).
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 (051188JP).
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 (051219JP).
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).
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. SPAWC 200 3. 4th IEEE Workshop on Rome. Italy Jun. 15-18, 2003, Piscataway, NJ, USA, IEEE, US, Jun. 15, 2003, pp. 36-40, XP010713463.
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.
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.
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 items on the construction of GE-PON system,” Technical Report of the Institute of Electronics, Information and Communication Engineers, Jun. 13, 2003, vol. 103, No. 124, pp. 1-6, IN2003-24.
Siemens, Evolved UTRA uplink scheduling and frequency reuse[online], 3GPP TSG-WG1 # 41 R1-050476, Internet <URL:http://www.3gpp.org/ftp/tsg—ran/WG1—RL1/TSGR1—41/Docs/R1-050476.zip>, May 9, 2005.
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.
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.
B. 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.
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.
Carl R. Nassar, Balasubramaniam Natarajan and Steve Shattil: Introduction of Carrier Interference to Spread Spectrum Multiple Access, Apr. 1999, IEEE, pp. 1-5.
Chennakeshu, et al. “A Comparison 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, Globecom, Dallas, Texas (2004), p. 3661-3665.
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.
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.
Tellado, “Multicarrier Modulation with Low Par,” Kluwer Academic, Dordrecht, NL, XP-002199500, 2000, pp. 6-11 and 55-60.
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.
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).
Tomcik, 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.
Torrieri, “Cellular Frequency-Hopping CDMA Systems,” IEEE Vehicular Technology Conference, May 16, 1999, pp. 919-925.
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.
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.
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. 3, 2007].
Das, Arnab, et al. “Adaptive, asynchronous incremental redundancy (A-IR) with fixed transmission time intervals TTI for HSDPA.” IEEE, Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on, pp. 1083-1087.
European Search Report—EP10184156—Search Authority—Munich—Jun. 14, 2012.
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.
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.
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.
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-i nfo/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, Oct. 28, 2005, pp. 48-50, URL, http://www.ieee802.org/20/contribs/c802.20-05-68.zip.
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.
Samsung: “Uplink Transmission and Multiplexing for EUTRA”, 3GPP DRAFT; R1-050605 UL Multiplexing, Jun. 16, 2005, XP050111420.
Bhushan N., “UHDR Overview”, C30-20060522-037, Denver, CO, May 22, 2006, pp. 1-115.
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/ftp/tsg—ran/WG1—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 Infocomm 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 to 650.
Related Publications (1)
Number Date Country
20070049218 A1 Mar 2007 US
Provisional Applications (2)
Number Date Country
60731014 Oct 2005 US
60713029 Aug 2005 US