Pilot signal transmission for an orthogonal frequency division wireless communication system

Information

  • Patent Grant
  • 9461859
  • Patent Number
    9,461,859
  • Date Filed
    Thursday, October 27, 2005
    18 years ago
  • Date Issued
    Tuesday, October 4, 2016
    8 years ago
Abstract
Transmission patterns for pilot symbols transmitted from a mobile station or base station are provided. The pattern allows for improved receipt of the pilot symbols transmitted for frequency selective channels and users. In addition, schemes for improving the ability to multiplex pilot symbols without interference and/or biasing from different mobile stations over the same frequencies and in the same time slots.
Description
BACKGROUND

I. Field


The present document relates generally to wireless communication and amongst other things pilot information transmission in an orthogonal frequency division wireless communication system.


II. Background


An orthogonal frequency division multiple access (OFDMA) system utilizes orthogonal frequency division multiplexing (OFDM). OFDM is a multi-carrier modulation technique that partitions the overall system bandwidth into multiple (N) orthogonal frequency subcarriers. These subcarriers may also be called tones, bins, and frequency channels. Each subcarrier is may be modulated with data. Up to N modulation symbols may be sent on the N total subcarriers in each OFDM symbol period. These modulation symbols are converted to the time-domain with an N-point inverse fast Fourier transform (IFFT) to generate a transformed symbol that contains N time-domain chips or samples.


In a frequency hopping communication system, data is transmitted on different frequency subcarriers in different time intervals, which may be referred to as “hop periods.” These frequency subcarriers may be provided by orthogonal frequency division multiplexing, other multi-carrier modulation techniques, or some other constructs. With frequency hopping, the data transmission hops from subcarrier to subcarrier in a pseudo-random manner. This hopping provides frequency diversity and allows the data transmission to better withstand deleterious path effects such as narrow-band interference, jamming, fading, and so on.


An OFDMA system can support multiple mobile stations simultaneously. For a frequency hopping OFDMA system, a data transmission for a given mobile station may be sent on a “traffic” channel that is associated with a specific frequency hopping (FH) sequence. This FH sequence indicates the specific subcarrier to use for the data transmission in each hop period. Multiple data transmissions for multiple mobile stations may be sent simultaneously on multiple traffic channels that are associated with different FH sequences. These FH sequences may be defined to be orthogonal to one another so that only one traffic channel, and thus only one data transmission, uses each subcarrier in each hop period. By using orthogonal FH sequences, the multiple data transmissions generally do not interfere with one another while enjoying the benefits of frequency diversity.


An accurate estimate of a wireless channel between a transmitter and a receiver is normally needed in order to recover data sent via the wireless channel. Channel estimation is typically performed by sending a pilot from the transmitter and measuring the pilot at the receiver. The pilot signal is made up of pilot symbols that are known a priori by both the transmitter and receiver. The receiver can thus estimate the channel response based on the received symbols and the known symbols.


Part of each transmission from any particular mobile station to the base station, often referred to as a “reverse link” transmission, during a hop period is allocated to transmitting pilot symbols. Generally, the number of pilot symbols determines the quality of channel estimation, and hence the packet error rate performance. However, the use of pilot symbols causes a reduction in the effective transmission data rate that can be achieved. That is, as more bandwidth is assigned to pilot information, less bandwidth becomes available to data transmission.


One type of FH-OFDMA system is a blocked hop system where multiple mobile stations are assigned to a contiguous group of frequencies and symbol periods. In such a system, it is important that pilot information be reliably received from the mobile station, while at the same time reducing the bandwidth that is allocated to pilot information, since the block has a limited amount of symbols and tones available to be used for both pilot and data transmission.


SUMMARY

In an embodiment, pilot symbol patterns are provided for pilot symbols transmitted from a mobile station or a base station. The pattern allows for improved receipt and demodulation of the pilot symbols transmitted. The selection of the pilot patterns may be based upon a frequency selectivity of the user and a frequency selective threshold.


In additional embodiments, schemes for improving the ability to multiplex pilot symbols without interference and/or biasing from different mobile stations in a same sector of a base station over the same frequencies and in the same time slots in an OFDM system are provided.


In further embodiments, schemes for reducing the bias or interference for pilot symbols transmitted from different mobile stations in neighboring cells over the same frequencies and in the same time slots in an OFDM system are provided.


In other embodiments, methods for altering pilot symbol patterns are provided. Also, in other further embodiments methods for generating pilot symbols are provided.





BRIEF DESCRIPTION OF THE DRAWINGS

The features, nature, and advantages of the present embodiments may become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout and wherein:



FIG. 1 illustrates a multiple access wireless communication system according to an embodiment;



FIG. 2 illustrates a spectrum allocation scheme for a multiple access wireless communication system according to an embodiment;



FIG. 3A illustrates a block diagram of a pilot assignment scheme according to an embodiment;



FIG. 3B illustrates a block diagram of a pilot assignment scheme according to another embodiment;



FIGS. 3C-3E illustrate block diagrams of pilot assignment schemes according to further embodiments;



FIG. 4A illustrates a pilot symbol scrambling scheme according to an embodiment;



FIG. 4B illustrates a pilot symbol scrambling scheme according to another embodiment;



FIG. 5 illustrates a base station with multiple sectors in a multiple access wireless communication system according to an embodiment;



FIG. 6 illustrates a multiple access wireless communication system according to another embodiment;



FIG. 7 illustrates a block diagram of an embodiment of a transmitter system and a receiver system in a multi-input multi-output multiple access wireless communication system;



FIG. 8 illustrates a flow chart of a method of pilot symbol generation according to an embodiment;



FIG. 9 illustrates a flow chart of a method of altering pilot symbol patterns according to an embodiment; and



FIG. 10 illustrates a flow chart of a method of pilot pattern selection.





DETAILED DESCRIPTION

Referring to FIG. 1, a multiple access wireless communication system according to an embodiment is illustrated. A base station 100 includes multiple antenna groups 102, 104, and 106 each including one or more antennas. In FIG. 1, only antenna is shown for each antenna group 102, 104, and 106, however, multiple antennas may be utilized for each antenna group that corresponds to a sector of base station 100. Mobile station 108 is in communication with antenna 104, where antenna 104 transmits information to mobile station 108 over forward link 114 and receives information from mobile station 108 over reverse link 112. Mobile station 110 is in communication with antenna 106, where antenna 106 transmits information to mobile station 110 over forward link 118 and receives information from mobile station 110 over reverse link 116.


Each group of antennas 102, 104, and 106 and/or the area in which they are designed to communicate is often referred to as a sector of the base station. In the embodiment, antenna groups 102, 104, and 106 each are designed to communicate to mobile stations in a sector, sectors 120, 122, and 124, respectively, of the areas covered by base station 100.


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


Referring to FIG. 2, a spectrum allocation scheme for a multiple access wireless communication system is illustrated. A plurality of OFDM symbols 200 is allocated over T symbol periods and S frequency subcarriers. Each OFDM symbol 200 comprises one symbol period of the T symbol periods and a tone or frequency subcarrier of the S subcarriers.


In an OFDM frequency hopping system, one or more symbols 200 may be assigned to a given mobile station. In an embodiment of an allocation scheme as shown in FIG. 2, one or more hop regions, e.g. hop region 202, of symbols to a group of mobile stations for communication over a reverse link. Within each hop region, assignment of symbols may be randomized to reduce potential interference and provide frequency diversity against deleterious path effects.


Each hop region 202 includes symbols 204 that are assigned to the one or more mobile stations that are in communication with the sector of the base station and assigned to the hop region. In other embodiments, each hop region is assigned to one or more mobile stations. During each hop period, or frame, the location of hop region 202 within the T symbol periods and S subcarriers varies according to a hopping sequence. In addition, the assignment of symbols 204 for the individual mobile stations within hop region 202 may vary for each hop period.


The hop sequence may pseudo-randomly, randomly, or according to a predetermined sequence, select the location of the hop region 202 for each hop period. The hop sequences for different sectors of the same base station are designed to be orthogonal to one another to avoid “intra-cell” interference among the mobile station communicating with the same base station. Further, hop sequences for each base station may be pseudo-random with respect to the hop sequences for nearby base stations. This may help randomize “inter-cell” interference among the mobile stations in communication with different base stations.


In the case of a reverse link communication, some of the symbols 204 of a hop region 202 are assigned to pilot symbols that are transmitted from the mobile stations to the base station. The assignment of pilot symbols to the symbols 204 should preferably support space division multiple access (SDMA), where signals of different mobile stations overlapping on the same hop region can be separated due to multiple receive antennas at a sector or base station, provided enough difference of spatial signatures corresponding to different mobile stations. To more accurately extract and demodulate signals of different mobile stations, the respective reverse link channels should be accurately estimated. Therefore, it may be desired that pilot symbols on the reverse link enable separating pilot signatures of different mobile stations at each receive antenna within the sector in order to subsequently apply multi-antenna processing to the pilot symbols received from different mobile stations.


Block hopping may be utilized for both the forward link and the reverse link, or just for the reverse link depending on the system. It should be noted that while FIG. 2 depicts hop region 200 having a length of seven symbol periods, the length of hop region 200 can be any desired amount, may vary in size between hop periods, or between different hopping regions in a given hop period.


It should be noted that while the embodiment of FIG. 2 is described with respect to utilizing block hopping, the location of the block need not be altered between consecutive hop periods or at all.


Referring to FIGS. 3A and 3B, block diagrams of pilot assignment schemes according to several embodiments are illustrated. Hop regions 300 and 320 are defined by T symbol periods by S subcarriers or tones. Hop region 300 includes pilot symbols 302 and hop region 320 includes pilot symbols 322, with the remaining symbols periods and tone combinations available for data symbols and other symbols. In an embodiment, pilot symbol locations for each hop regions, i.e. a group of NS contiguous tones over NT consecutive OFDM symbols, should have pilot tones located close to the edges of the hop region. This is generally because typical channels in wireless applications are relatively slow functions of time and frequency so that a first order approximation of the channel, e.g. a first order Taylor expansion, across the hop region in time and frequency provides information regarding channel conditions that is sufficient to estimate the channel for a given mobile station. As such, it is preferred to estimate a pair of channel parameters for proper receipt and demodulation of symbols from the mobile stations, namely the constant component of the channel, a zero order term of a Taylor expansion, and the linear component, a first order term Taylor expansion, of the channel across the time and frequency span of the channel. Generally estimation accuracy of the constant component is independent of pilot placement. The estimation accuracy of the linear component is generally preferably achieved with pilot tones located at the edges of the hop region.


Pilot symbols 302 and 322 are arranged in contiguous pilot symbol clusters 304, 306, 308, and 310 (FIG. 3A) and 324, 326, 328, and 330 (FIG. 3B). In an embodiment, each cluster 304, 306, 308, and 310 (FIG. 3A) and 324, 326, 328, and 330 (FIG. 3B) within a hop region, has a fixed number, and often the same number, of pilot symbols within a given hop region. The utilization of clusters 304, 306, 308, and 310 (FIG. 3A) and 324, 326, 328, and 330 (FIG. 3B) of contiguous pilot symbols may, in an embodiment take into account the effect of a multi-user interference caused by inter-carrier interference which results from high Doppler and/or symbol delay spreads. Further, if pilot symbols from mobile stations scheduled on a same hop region are received at substantially different power levels, signals of a stronger mobile station may create a significant amount of interference for a weaker mobile station. The amount of interference is higher at the edges, e.g. subcarrier 1 and subcarrier S, of the hop region and also at the edge OFDM symbols, e.g. symbol periods 1 and T, when the leakage is caused by excess delay spread, i.e. when the portion of channel energy concentrated in the taps that exceed cyclic prefix of the OFDM symbols becomes significant. Therefore, if pilot symbols are located exclusively at the edges of a hop region there may be degradation in channel estimation accuracy and a bias in interference estimation. Hence, as depicted in FIGS. 3A and 3B pilot symbols are placed close to the edges of the hop region, however, avoiding the situation where all the pilot symbols are at the edges of the hop region.


Referring to FIG. 3A, a hop region 300 is comprised of pilot symbols 302. In the case of channels with a pronounced frequency selectivity rather than time selectivity, pilot symbols 302 are located in contiguous pilot symbol clusters 304, 306, 308, and 310 with each pilot symbol cluster 304, 306, 308, and 310 spanning a multiple symbol periods and one frequency tone. The frequency tone is preferably chosen to be close to the edges of the frequency range of the hop region 300, however, not exactly at the edge. In the embodiment of FIG. 3A, none of the pilot symbols 302 in a given cluster are at the edge frequency tones and in each cluster only pilot symbol may be at an edge symbol period.


One rationale behind a “horizontal” shape of the contiguous pilot symbol clusters of pilot symbols 302 is that, for channels with higher frequency selectivity, the first order (linear) component may be stronger in the frequency domain than in the time domain.


It should be noted that one or more pilot symbols in each cluster, in the embodiment of FIG. 3A, may be at a different tone than one or more pilot symbols in a different cluster. For example, cluster 304 may be at tone S and cluster 306 may be at tone S-1.


Referring to FIG. 3B, in the case of channels with a pronounced time selectivity rather than frequency selectivity, pilot symbols 322 are arranged in clusters 324, 326, 328, and 330 of contiguous pilot symbols that each span multiple frequency tones but have a same symbol period of hop region 320. OFDM symbols at the edges of hop region 320, those that have a maximum tone, e.g. tone S, or minimum tone, e.g. tone 1, of the frequency range that defines the S subcarriers, may be included as part of the pilot symbols, since there may be pilot symbols 322 that are at the edges of the hop region 320. However, in the embodiment shown in FIG. 3B, only one pilot symbol in each cluster may be assigned to the maximum or minimum frequency subcarrier.


In the embodiment depicted in FIG. 3B, a channel with higher time selectivity may have a typical pattern that may be obtained by a 90° rotation of the pattern chosen for channels with higher frequency selectivity (FIG. 3A).


It should be noted that one or more pilot symbols in each cluster, in the embodiment of FIG. 3B, may be assigned to a different symbol period than one or more pilot symbols in a different cluster. For example, cluster 324 may be at different symbol period T than cluster 326.


Additionally, as depicted in the embodiments of FIGS. 3A and 3B, pilot patterns are provided so that the clusters, 304, 306, 308, and 310 (FIG. 3A) and 324, 326, 328, and 330 (FIG. 3B), are preferably symmetric with respect to the center of the hop region. The symmetry of the clusters with respect to the center of the hop region may provide improved simultaneous estimation of the channel with respect to time and frequency responses of the channel.


It should be noted that while FIGS. 3A and 3B depict four clusters of pilot symbols per hop region, a fewer or greater amount of clusters may be utilized in each hop region. Further, the number of pilot symbols per pilot symbol cluster may also vary. The total number of pilot symbols and pilot symbol clusters are a function of the number of pilot symbols required by the base station to successfully demodulate data symbols received on the reverse link and to estimate the channel between the base station and the mobile station. Also, each cluster need not have the same number of pilot symbols. The number of mobile stations that can be multiplexed over a single hop region can, in an embodiment, be equal to the number of pilot symbols in a hop region.


In addition, while FIGS. 3A and 3B depict pilot symbol clusters designed either for channels having frequency selectivity or time selectivity the pilot pattern may be such that there are clusters for frequency selective channels as well as clusters for time selective channels in the same pilot pattern, e.g. some clusters arranged in the pattern of clusters 304, 306, 308, or 310 and some clusters arranged in the pattern of clusters 324, 326, 328, or 330.


In some embodiments, the pilot pattern chosen to be utilized may be based upon the conditions for which the channel is being optimized. For example, for channels that may have high-speed movement, e.g. vehicular, of mobile stations a time-selective pilot pattern may be preferred, whereas for slow-speed movement of mobile station, e.g. pedestrians, a frequency selective pilot pattern may be utilized. In other embodiment, the pilot pattern can be chosen based upon channel conditions, a determination made after a pre-determined number of hop periods.


Referring to FIGS. 3C-3E, additional pilot patterns are depicted. In FIG. 3C, a block is depicted as having a pilot pattern similar to that of 3B, except that there are a greater number of clusters, e.g. 9, and the size of block has changed. The additional pilots may be utilized to improve channel estimation properties. It should be noted that number of clusters and pilots per cluster may vary depending on a measured velocity of a user, e.g. a user of greater velocity may have more clusters, an/or pilots per cluster, than a user with a lesser velocity.


In FIG. 3D, a pilot program with additional pilots for frequency selective conditions is included. This may be useful for user with highly frequency selective channels, which may, in certain aspects, be detected based upon delay spread estimates of the users. Also, channel statistics over time for the sector or cell or user session can provide information to calculate a cell frequency selectivity threshold, sector frequency selectivity threshold, or a user specific frequency selectivity threshold to switch to these patterns with additional and/or varied pilots. The additional and/or varied pilots may be quite useful due to frequency variations and multi-path transmissions that will vary due to the different channel conditions at different frequencies, e.g., for mobile users or others having a greater frequency selectivity.


In FIG. 3E, pilot clusters for multi-input multi-output (MIMO) mobile stations that are transmitting multiple layers is depicted. Each transmit antenna, here being four, includes pilot symbols in the cluster. Therefore, if less than all antennas are being utilized then less pilots can be included in each cluster.


Referring to FIGS. 4A and 4B, pilot allocation schemes according to further embodiments are illustrated. In FIG. 4A, hop regions 400 includes pilot symbols C1,q, C2,q, and C3,q, arranged in cluster 402; C4,q, C5,q, and C6,q, arranged in cluster 404; C7,q, C8,q, and C9,q, arranged in cluster 406; and C10,q, C11,q, and C12,q arranged in cluster 408. In an embodiment, in order to improve spatial diversity in hop regions where multiple mobile stations provide overlapping pilot symbols, the pilot symbols of different mobile stations should be multiplexed in such a way over the same OFDM symbol period and tone so that the pilot symbols are substantially orthogonal when received at the antennas of the cluster of the base station.


In FIG. 4A, each of the pilot symbols C1,q, C2,q, C3,q, C4,q, C5,q, C6,q, C7,q, C8,q, C9,q, C10,q, C11,q, and C12,q are assigned to multiple mobile stations of hop region 400, that is each symbol period includes multiple pilot symbols, from a number of different mobile station stations. Each of the pilot symbols in a pilot symbol cluster, e.g. cluster 402, 404, 406, and 408, are generated and transmitted in such a way that a receiver of the pilots symbols in the cluster, e.g. base station, can receive them so that they are orthogonal with respect to the pilot symbols from each other mobile station in the same cluster. This can be done by applying a predetermined phase shift, e.g. a scalar function to multiply, each of the samples constituting the pilot symbols transmitted by each of the mobile stations. To provide orthogonality, the inner products of vectors representing the sequence of the scalar functions in each cluster for each mobile station may be zero.


Further, in some embodiments, it is preferred that the pilot symbols of each cluster are orthogonal to the pilot symbols of each other cluster of the hop region. This can be provided in the same manner as orthogonality is provided for the pilot symbols within each cluster from a different mobile station, by utilizing a different sequence of scalar functions for the pilot symbols of each mobile station in each cluster of pilot symbols. Mathematical determination of orthogonality can be made by selecting a sequence of scalar multiples for each of the pilot symbols for a particular cluster for the particular mobile station the vector of which is orthogonal, e.g. the inner product is zero, with respect to a vector representing the sequence of scalar multiples used for the pilot symbols of the other mobile stations in all the clusters and the same mobile station in the other clusters.


In an embodiment the number of mobile stations that may be supported, where orthogonality of the pilot symbols across each of the clusters is provided, is equal to the number of pilot symbols that are provided per pilot symbol cluster.


In the embodiments of FIGS. 4A and 4B, the q-th user of Q overlapping users, 1≦q≦Q, uses the sequence S of size Np, where Np is the total number of pilot tones (In FIGS. 4A and 4B, Np=12):

Sq=[S1,q . . . SNp,q]T, 1≦q≦Q,  (1)

here (T) denotes transpose of the matrix containing the sequences. As discussed above, the sequences of scalar functions, in each cluster of pilot symbols, should be different for different mobile stations in order to obtain consistent estimates of the respective channels through the reduction of interference between pilot symbols. Moreover, the sequences should be linearly independent, as such it is preferred that no sequence or vector be a linear combination of the remaining sequences. Mathematically, this may defined in that the Np×Q matrix

S=[S1 . . . SQ]  (2)

is of full column rank. It should be noted in the expression (2) above matrix Q≦Np. That is, the number of overlapping mobile stations should not exceed the number of total pilot symbols in the hop region.


Based upon the above, any set of sequences Q with a full-rank S enables consistent channel estimation. However, in other embodiment, the actual estimation accuracy may depend on the correlation properties of S. In an embodiment, as can be determined utilizing equation (1), performance may be improved when any two sequences are mutually (quasi-) orthogonal in the presence of the channel. Mathematically, this condition may be defined by














k
=
1


N
p





H
k



S

k
,
p

*



S

k
,
q






0





for





all





1


p

,

q

Q

,




(
3
)








where Hk is a complex channel gain corresponding to the k-th pilot symbol, 1≦k≦Np. In a time and frequency invariant channel H1=H2= . . . =HNp) condition (3) reduces to the requirement of mutually orthogonal sequences:















k
=
1



N
p





S

k
,
p

*



S

k
,
q






0





for





all





1


p

,

q

Q

,




(
4
)








enforcing this condition for any possible channel realization from a typical set of channels may be impractical. In fact, expression (3) may be satisfied when a channel exhibits limited time and frequency selectivity, which is the case of pedestrian channels with a relatively small delay spread. However, the conditions may be substantially different on vehicular channels and/or channels with a significant delay spread, thereby resulting in performance degradation.


As discussed with respect to FIGS. 3A and 3B, pilot allocation patterns consist of a few clusters of pilot symbols placed close to the edges of the hop region, where each cluster is contiguous in time (FIG. 3A) and/or frequency (FIG. 3B). Since channel variations inside every cluster are generally limited, due to contiguous nature of the pilot symbols in time and frequency and continuity of the channel in time and frequency. Hence making different sequences orthogonal over each cluster allows condition (3) to be met. A potential drawback of this solution is that the number of overlapping mobile stations that can be orthogonal over every cluster is limited to the size of the cluster, denoted here Nc. In the example shown in FIGS. 4A and 4B, NC=3, and hence up to Q=3 mobile stations can be separated orthogonally in such an embodiment. In fact, a fairly small number of Q is sufficient in many practical scenario. When Q>NC, it may be difficult to keep all mobile stations orthogonal over every cluster, since there may be some inter-symbol interference. Hence, approximate orthogonality may be sufficient, with some performance loss of time and/or frequency varying channels if Q>NC.


In an embodiment, a set of design parameters for the sequences of scalar functions S=[S1 . . . SQ] may be defined by:

    • Any two sequences are orthogonal over the entire set of pilot symbols, thereby satisfying















k
=
1



N
p





S

k
,
p

*



S

k
,
q




=


0





for





all





1


p


,

q

Q

,




(
5
)









    • Subsequent groups of NC sequences are such that any two sequences within a group are mutually orthogonal over any cluster of pilots:

















k
=
1


N
c





S


k
+

IN
C


,
p

*



S


k
+

IN
C


,
q




=
0

,



n






N
C


+
1


p

,

q


min






{



(

n
+
1

)



N
C


,
Q

}



,

0

n
<

Q

N
C



,

0

l
<


M
C

.






(
6
)









    • All the elements Sk,q of all the sequences have substantially equal absolute values, e.g. approximately the same power.


      where MC denotes the total number of clusters of size NC, so that the number of pilots Np=MCNC.





In an embodiment, the sequences S=[S1 . . . SQ] are created using exponential functions so that so that the same energy per symbol provided by each sequence. Further, in this embodiment, the groups of NC sequences may be made mutually orthogonal within each cluster, regardless of cluster size since exponents are not limited to particular multiples, and with the sequences used in every other cluster across all of the pilot symbols, by (i) defining exponential sequences within each cluster; and (ii) populating the intra-cluster portions across clusters. This can be seen equation (7) where a N×N Discrete Fourier Transform (DFT) basis is defined.













F


(
N
)


=

[










F






1
,




1





(
N
)












F






1
,




2





(
N
)















F






1
,




N





(
N
)














F






2
,




1





(
N
)












F






2
,




1





(
N
)















F






2
,




N





(
N
)




























F






N
,




1





(
N
)












F






N
,




2





(
N
)















F






N
,




N





(
N
)






]







=

[



1


1





1







t





2

π


1
N








t





2

π


2
N











t





2

π




(

N
-
1

)


2

N
























t





2

π



N
-
1

N








t





2

π



2


(

N
-
1

)


N











t





2

π




(

N
-
1

)



(

N
-
1

)


N






]








(
7
)







The above expression (7) may be written in a compact block form as follows:

S=[S1, . . . , SQ]=<F(MC){circle around (x)}F(NC)>:,1:Q  (8)

where <·>:,1:Q denotes matrix block spanned by columns 1 through Q of the original matrix. A more general form of S may be given by

S=[S1, . . . SQ]=<V{circle around (x)}U>:,1:Q  (9)

where U is an arbitrary NC×NC unitary matrix (U*U=INp) and V is an arbitrary MC×MC unitary matrix (U*U=IMC).


In an embodiment the number of mobile stations that may be supported, where orthogonality of the pilot symbols across each of the clusters is provided, is equal to the number of pilot symbols that are provided per pilot symbol cluster.


In an embodiment, the exponential functions utilized to multiply the samples of the pilot symbols are generated utilizing a discrete Fourier transform function, which is well known. In embodiments where the discrete Fourier transform function is used to generate the symbols for transmission, an extra phase shift is applied during formation of the symbols using the discrete Fourier transform function in generating the symbols for transmission.


In the embodiments of FIGS. 4A and 4B, the inner products of vectors representing the sequence of the scalar functions in each cluster for each mobile station may be zero. However, in other embodiments this is not the case. It may be arranged so that only quasi-orthogonality between the sequences of the scalar functions in each cluster for each mobile station is provided.


Further in those situations, where the number of mobile stations assigned to the hop region is less than the number of pilot symbols assigned to the hop region, the scalar shifts may still be decoded at the base station in order to be utilized to perform interference estimation. Therefore, these pilot symbols may be utilized for interference estimation since they are orthogonal or quasi-orthogonal with respect to pilot symbols by the other mobile stations assigned to the hop region.


The approaches described with respect to FIGS. 4A and 4B may be applied to the cluster and structures depicted in FIGS. 3C-3E. In these cases, the length and number of the sequences may need to vary to support the number of clusters and the number of pilot symbols per cluster.


Referring to FIG. 5, a base station with multiple sectors in a multiple access wireless communication system according to an embodiment is illustrated. A base station 500 includes multiple antenna groups of antennas 502, 504, and 506. In FIG. 5, only one antenna is shown for each antenna group 502, 504, and 506, however, multiple antennas may be utilized. The multiple antennas of each antenna group 502, 504, and 506 may be utilized to provide spatial diversity at the base station to signals transmitted from mobile stations in a corresponding sector, in addition to the spatial diversity provided to the different physical locations of the different mobile stations.


Each antenna group 502, 504, and 506 of base station 500 is configured to communicate with mobile stations in a sector to be covered by base station 500. In the embodiment of FIG. 5, antenna group 502 covers sector 514, antenna group 504 covers sector 516, and antenna group 506 covers sector 518. Within each sector, as described with respect to FIG. 4, the pilot symbols transmitted from the mobile stations may be accurately demodulated and used for channel estimation, and other functionally, at the base station due the orthogonality or the approximately orthogonality between all of the inter-sector pilot symbol clusters.


However, intra-sector interference may exist for mobile stations near the boundary of a sector, e.g. mobile station 510 which is near a boundary of sectors 514 and 516. In such a case, pilot symbols from mobile station 510 may be at lower powers than pilot symbols from other mobile stations in both sectors 514 and 516. In such a situation, mobile station 510 could eventually benefit from reception at both sectors antennas, especially when its channel to the serving sector, i.e. sector 516 signals may fade if power is increased from antenna 504. In order to fully benefit from the reception from antenna 502 of sector 514, accurate estimate of the channel of mobile station 510 between antenna 502 of sector 514 should be provided. However, if the same or substantially the same sequences are used for the scalar multiples of the pilot symbols in different sectors with the present pilot design, pilot symbols transmitted by mobile station 510 may collide with pilot symbols transmitted by mobile station 508 which is scheduled in sector 514 on the same hop region as mobile station 510 is scheduled in sector 516. Further, in some cases depending on the power control strategy utilized by the base station to control the mobile stations, the power level of symbols from mobile station 508 may substantially exceed the signal level of mobile station 510 at antenna group 502 of the sector 514, especially when mobile station 508 is close to the base station 500.


In order to combat the intra-sector interference that may arise, scrambling codes may be used for the mobile stations. The scrambling code may unique to individual mobile stations or may be the same for each of the mobile stations communicating with an individual sector. In an embodiment, these specific scrambling codes allow antenna group 502 to see a composite channel of mobile stations 508 and 510.


In the case where a single mobile station is assigned to an entire hop region, user specific scrambling sequences may be provided so that every mobile station in a given sector makes use of the same pilot sequence; the construction of these sequences is described with respect to FIGS. 4A and 4B. In the example of FIG. 5, mobile stations 508, 510, and 512 may have different user specific scrambling sequences and therefore sufficient channel estimation may be achieved.


Where multiple mobile stations are, or may be, assigned to a same hop region, two approaches may be utilized to reduce intra-cluster interference. Firstly, user specific scrambling sequences may be utilized if the cluster size NC is greater or equal than the number of overlapping mobile stations in each sector Q times the number of sectors in the cell. If this is the case, distinct sets of Q different user-specific scrambling codes may be assigned to different sectors.


However, if the cluster size NC is less than the number of overlapping mobile stations in each sector Q times the number of sectors in the cell, this may be important if a goal of system design is to keep NC to maintain a limited pilot overhead, user specific scrambling codes may not be effective to reduce inter-cell interference. In such cases, a sector specific scrambling sequence may be utilized along with the user specific scrambling sequence.


A sector specific scrambling sequence is a sequence Xs=[X1,s, . . . , XNp,s]T of Np complex functions that multiply the respective elements of the sequences S=[S1 . . . SQ], for all mobile stations in a same sector. In a cell consisting of S sectors, a set of S sector specific scrambling sequences X1, . . . , XS may be utilized to multiply the sequences S=[S1 . . . SQ] of the mobile stations. In such a case, mobile stations within different sectors, for example sector 514 and 516 that may have mobile stations that utilize the same user specific scrambling sequences S=[S1 . . . SQ] may differ due to different sector specific scrambling sequences Xs1 and Xs2 utilized to multiply the user specific scrambling sequence.


Similarly to user-specific scrambling, it is preferred that all of the entries of X1, . . . , XS have approximately equal absolute values to maintain approximately equal power between the pilot symbols. In other embodiments, it is preferred that entries of X1, . . . , XS be such that any pair of pilot symbols in a pilot symbol cluster, corresponding to any two combinations of user specific and sector specific scrambling sequences satisfies, should satisfy condition (3). One way to approach to the choice of contents of each sector specific sequence X1, . . . , XS consists of an exhaustive search of sequences such as the elements of every sequence are taken from some constant modulus (PSK) constellation such as QPSK, 8-PSK. The selection criterion may be based upon the “worst case” channel estimation error variance corresponding to the “worst” combination of mobile stations from different sectors and different user specific scrambling that are based upon the potential channel environment. Channel estimation error may be computed analytically based on statistical properties of the channel. Specifically, a trace of the covariance matrix of a channel estimate that assume channel correlation structure based on an anticipated fading model and parameters such as mobile station velocity, which defines time selectivity, and propagation delay spread which defines frequency selectivity. The analytical expressions for the minimum achievable channel estimation error subject to a given correlation structure of the true channel are known in the art. Other similar criteria may be used to optimize the choice of X1, . . . , XS as well.


In an embodiment where Quadrature Amplitude Modulation is utilized as the modulation scheme, a set of sector specific scrambling sequences X1, . . . , XS that may be utilized is shown in Table 1 below. Each entry of the table specifies I and Q components of every Xk,s, 1≦s≦S and 1≦k≦Np with S=3 and Np=12.





















TABLE 1





k
1
2
3
4
5
6
7
8
9
10
11
12







s = 1
{+1,+0}
{+1,+0}
{+1,+0}
{+1,+0}
{+1,+0}
{+1,+0}
{+1,+0}
{+1,+0}
{+1,+0}
{+1,+0}
{+1,+0}
{+1,+0}


s = 2
{+1,+0}
{+1,+0}
{−1,+0}
{+1,+0}
{+0,−1}
{+1,+0}
{+1,+0}
{+0,−1}
{+0,+1}
{+0,+1}
{+0,+1}
{+0,+1}


s = 3
{+0,+1}
{−1,+0}
{+1,+0}
{+1,+0}
{+0,+1}
{+0,−1}
{+0,−1}
{+0,+1}
{+1,+0}
{+0,−1}
{+1,+0}
{−1,+0}









In an embodiment where Quadrature Amplitude Modulation is utilized as the modulation scheme, a set of sector specific scrambling sequences X1, . . . , XS that may be utilized is shown in Table 1 below. Each entry of the table specifies I and Q components of every Xk,s, 1≦s≦S and 1≦k≦Np with S=3 and Np=12.


In some embodiments, each cell in a communication network may utilize the same sequences for sector specific scrambling sequences.


Referring to FIG. 6, a multiple access wireless communication system 600 according to another embodiment is illustrated. In the event when the same sets of user specific and sector specific scrambling sequences are utilized in multiple cells, e.g. cells 602, 604, and 606, interference coming from the adjacent cells may lead to channel estimation accuracy degradation due to pilot symbol collision. For example, a channel estimate within the sector of interest may be biased by the channel of a mobile station from the adjacent cell which mobile station has the same user specific and sector specific scrambling. To avoid such a bias, a cell specific scrambling may be utilized, in addition to the user specific scrambling and sector specific scrambling. A cell specific scrambling schema may be defined by Yc=[Y1,c, . . . YNp,s]T which is a vector of scalar functions that multiply the respective sequence of pilot symbols for every mobile station in the cell. The overall sequences of pilot symbols Z(q,s,c)=[Z1,(q,s,c), . . . , ZNp,(q,s,c)]T which corresponds to a mobile station with q-th user specific scrambling in the s-th sector of the c-th cell may defined as follows. If sector specific scrambling is utilized:

Zk,(q,s,c)=Sk,q·Xk,s·Yk,c, 1≦k≦Np, 1≦s≦S, c=1,2,  (10)

If sector specific scrambling is not utilized:

Zk,(q,s,c)=Sk,q·Yk,c, 1≦k≦Np, 1≦s≦S, c=1,2,  (11)


As already mentioned, the use of sector specific scrambling is recommended when Q>1 and is not recommended when Q=1.


Unlike user specific and sector specific scrambling, no particular optimization of cell specific scrambling sequences need be utilized. The two design parameters that may be utilized are that:

    • All the elements of cell specific scrambling sequences have equal modulus.
    • Cell specific scrambling sequences differ substantially for different cells.


In the absence of pre-determined assignment of cell specific scrambling sequences over a network of base stations, a (pseudo)-random cell specific scrambling sequences from some constant modulus (PSK) constellation such as QPSK, 8-PSK may be utilized in forming the Y cell specific sequences. To further enhance randomization of cell specific scrambling and avoid bad steady combinations of scrambling sequences, cell specific scrambling may be changed periodically in a (pseudo-)random fashion. In some embodiments, the periodic change may be every frame, superframe, or multiple frames or superframes.



FIG. 7 is a block diagram of an embodiment of a transmitter system 710 and a receiver system 750 in a MIMO system 700. At transmitter system 710, traffic data for a number of data streams is provided from a data source 712 to a transmit (TX) data processor 714. In an embodiment, each data stream is transmitted over a respective transmit antenna. TX data processor 714 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.


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 (i.e., 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 on provided by controller 130.


The modulation symbols for all data streams are then provided to a TX processor 720, which may further process the modulation symbols (e.g., for OFDM). TX processor 720 then provides NT modulation symbol streams to NT transmitters (TMTR) 722a through 722t. Each transmitter 722 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 722a through 722t are then transmitted from NT antennas 124a through 124t, respectively.


At receiver system 750, the transmitted modulated signals are received by NR antennas 752a through 752r and the received signal from each antenna 752 is provided to a respective receiver (RCVR) 754. Each receiver 754 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 760 then receives and processes the NR received symbol streams from NR receivers 754 based on a particular receiver processing technique to provide NT “detected” symbol streams. The processing by RX data processor 760 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 760 then demodulates, deinterleaves, and decodes each detected symbol stream to recover the traffic data for the data stream. The processing by RX data processor 760 is complementary to that performed by TX processor 720 and TX data processor 714 at transmitter system 710.


RX processor 760 may derive an estimate of the channel response between the NT transmit and NR receive antennas, e.g., based on the pilot information multiplexed with the traffic data. RX processor 760 may identify the pilot symbols according to pilot patterns stored in memory, e.g. memory 772 that identify the frequency subcarrier and symbol period assigned to each pilot symbol. In addition, the user specific, sector specific, and cell specific scrambling sequences may be stored in memory so that they may be utilized by RX processor 760 to multiple the received symbols so that the proper decoding can occur.


The channel response estimate generated by RX processor 760 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 760 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 controller 770. RX data processor 760 or controller 770 may further derive an estimate of the “operating” SNR for the system. Controller 770 then provides channel state 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 778, which also receives traffic data for a number of data streams from a data source 776, modulated by a modulator 780, conditioned by transmitters 754a through 754r, and transmitted back to transmitter system 710.


At transmitter system 710, the modulated signals from receiver system 750 are received by antennas 724, conditioned by receivers 722, demodulated by a demodulator 740, and processed by a RX data processor 742 to recover the CSI reported by the receiver system. The reported CSI is then provided to controller 730 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 714 and TX processor 720.


Controllers 730 and 770 direct the operation at the transmitter and receiver systems, respectively. Memories 732 and 772 provide storage for program codes and data used by controllers 730 and 770, respectively. The memories 732 and 772 store the pilot patterns in terms of cluster locations, user specific scrambling sequences, sector specific scrambling sequences, if utilized, and cell specific scrambling sequences, if utilized. In some embodiments, multiple pilot patterns are stored in each memory so that the transmitter may transmit and the receiver may receive both frequency selective pilot patterns and time selective pilot patterns. Also, combination pilot patterns having clusters geared for time selective channels and frequency selective channels may be utilized. This allows a transmitter to transmit a specific pattern based upon a parameter, such a random sequence, or in response to an instruction from the base station.


Processors 730 and 770 then can select which of the pilot patterns, user specific scrambling sequences, sector specific scrambling sequences, and cell specific scrambling sequences are to be utilized in transmission of the pilot symbols.


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).


While FIG. 7 illustrates a MIMO system, the same system may be applied to a multi-input single-output system where multiple transmit antennas, e.g. those on a base station, transmit one or more symbol streams to a single antenna device, e.g. a mobile station. Also, a single output to single input antenna system may be utilized in the same manner as described with respect to FIG. 7.


Referring to FIG. 8, a flow chart of a method of pilot symbol generation according to an embodiment is illustrated. A plurality of pilot symbol clusters is selected to be transmitted during a hop region from a particular mobile station, block 800. These pilot symbol clusters may be all aligned for transmission in a frequency selective (FIG. 3A), a time selective channel (FIG. 3B), or a combination of clusters some of which are aligned for transmission in a frequency selective and a time selective channel. Further, the pilot clusters may be selected based upon whether there is a high degree of the mobility for the user. This may be done to improve channel estimation at the base station. Also, the number of antennas used to transmit at the mobile station, as well as the number of information streams being transmitted from those antennas may be utilized the number of clusters selected and the number of pilot symbols per cluster.


Once the pilot symbol clusters are selected, a determination is made as to whether the cluster of the base station in which the mobile station is communicating supports, or is in communication with, multiple mobile stations, block 802. This determination may be based upon predetermined knowledge of the network in which the mobile station. Alternatively, this information may be transmitted from the sector for the base station as part of its pilot information or broadcast messages.


If the cluster does not support communication, or is not currently in communication with multiple mobile stations, then scalar functions are applied to the pilot symbols that are unique to the cluster with which the mobile station is communicating, block 804. In an embodiment, the scalar functions for each sector may be stored in the mobile station and utilized depending on a sector identification signal that is part of its part of its pilot information or broadcast messages.


If the cluster does support communication with multiple mobile stations, then scalar functions are applied to the pilot symbols that are unique to the mobile station, block 806. In some embodiments, the scalar functions for each mobile station may be based upon its unique identifier used for registration or provided to the device at the time of manufacture.


After scalar functions, that are unique either to the sector with which the mobile station is communicating or the mobile station itself, are applied to the pilot symbols, another sequence of scalar functions is applied to the pilot symbols, block 808. The sequence of scalar functions relates to the cell in which the mobile station is communicating. This scalar function may vary over time, if each cell is not specifically assigned scalar functions that are known by or provided to the mobile stations. After this operation, the pilot symbols may be transmitted from the mobile station to base station.


The scalar functions discussed with respect to FIG. 8, may in an embodiment involve a phase shift of each of the samples that constitute the pilot symbols. As discussed with respect to FIGS. 4A, 4B, 5, and 6 the scalar functions are selected so that each cluster of pilot symbols is orthogonal to each other set of pilot symbols from the same mobile station in other pilot symbol clusters and in the same and other pilot symbol clusters for other mobile stations the same sector of the base station.


In addition, the blocks described with respect to FIG. 8 may each be implemented as one or more instructions on a computer readable media, such as a memory, which are implemented by a processor, controller, or other electronic circuitry.


Referring to FIG. 9, a flow chart of a method of altering pilot symbol patterns according to an embodiment is illustrated. Information regarding channel conditions is obtained, block 900. The information may comprise SNR ratios at one or more mobile stations, a selectivity of the channel, the traffic type, pedestrian or vehicular, delay spreads, or other characteristics of the channel. This information may determined by the base station or may provided as channel quality information feedback provided from the mobile station.


The information is analyzed to determine the channel conditions, block 902. The analysis may be a determination whether the channel is frequency selective, time selective, or a combination of both. The analysis is then utilized to determine a pilot symbol pattern that is to be transmitted from mobile stations that may communicate with the sector or base station, block 904. These pilot symbol clusters may be all aligned for transmission in a frequency selective (FIG. 3A), a time selective channel (FIG. 3B), a combination of clusters some of which are aligned for transmission in a frequency selective and a time selective channel, used for vehicular or other mobile traffic (FIG. 3D), optimized for a MIMO system (FIG. 3E), or combinations thereof. The specific pilot pattern selected may then be used by all of the mobile stations that communicate with the base station or sector until such time as the diagnostic is performed again for the base station or sector.


To implement a specific pilot pattern at mobile stations communicating at a base station or base station sector, an instruction may be sent from the base station or sector to the mobile stations as part of the initialization or set-up procedure. In some embodiments, information as which pilot pattern, user specific scrambling sequence, sector specific scrambling sequence, and/or cell specific scrambling sequence is to be utilized may transmitted in a preamble of one or more data packets that are transmitted from a base station to a mobile station at regular intervals or during initialization or set-up.


It should be noted that the analysis may also be utilized to determine the number of pilot symbols to be transmitted in each cluster of pilot symbols and the groupings of pilot symbols. Also, the blocks described with respect to FIG. 9 may each be implemented as one or more instructions on a computer readable media, such as a memory or removable media, which are implemented by a processor, controller, or other electronic circuitry.


Referring to FIG. 10, a flow chart of a method of pilot pattern selection is illustrated. A determination is made as to the frequency selectivity of a given user, block 1000. This may be done for example based upon a velocity of the user, a dopler spread of the user, delay spread of the user, or other channel information that may be utilized mobility related user conditions. This information may then be utilized to select one or more of a plurality of pilot patterns for transmission by the user to the base station, block 1002. The selection may include, for example, a number of pilots to transmit and the number of pilots in total and by cluster. Further, the selection may include information as to whether the user is a MIMO user as well as the users mobility. The selection may be made by determining the relationship of the frequency selectivity of the user and some frequency selective threshold determined by channel statistics for the user, sector, or cell over one more periods of time. An indication of the pilot pattern in then transmitted to the user, so that the user may utilize the pilot pattern in later transmissions to the base station, block 1004.


It should be noted that while FIG. 10 illustrates the base station may make the determination as to the user mobility, the same approach may be used by the mobile station. In this case, block 1000 may be performed based upon forward link pilots transmitted by the base station, and block 1004 may be omitted.


The techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing units within a base station or a mobile station 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.


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


The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments may be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims
  • 1. A wireless communication apparatus, comprising: at least one antenna;a memory that stores a plurality of patterns of pilot symbols, each of the plurality of patterns comprising four contiguous clusters, each of the four contiguous clusters located at substantially corners of a hop region; anda processor coupled with the at least one antenna and the memory, the processor configured to select at least one pilot pattern of the stored plurality of pilot patterns for transmission by the at least one antenna based upon a time selectivity or frequency selectivity of a channel,wherein the processor is further configured to select the at least one pilot pattern based upon whether the wireless communication apparatus is to receive a transmission in a Multiple Input Multiple Output (MIMO) mode.
  • 2. The wireless communication apparatus of claim 1, wherein the time selectivity or frequency selectivity of the channel is a function of mobility of the apparatus.
  • 3. The wireless communication apparatus of claim 1, wherein the at least one pilot pattern comprises a frequency selective pilot pattern for the apparatus.
  • 4. The wireless communication apparatus of claim 1, wherein the memory comprises a plurality of scalar functions and wherein the processor is further configured to multiply the pilot symbols in the at least one pilot pattern by at least one of the plurality of scalar functions.
  • 5. The wireless communication apparatus of claim 4, wherein the plurality of scalar functions comprises vectors of scalar functions and wherein each vector is orthogonal to each other vector.
  • 6. The wireless communication apparatus of claim 1, wherein the wireless communication apparatus receives signals using a plurality of frequency subcarriers in a frequency range between a maximum frequency and a minimum frequency and wherein each of the pilot symbol clusters comprises a plurality of pilot symbols so that at least one of the plurality of pilot symbols of each of the plurality of clusters is transmitted using a frequency subcarrier other than the maximum frequency or the minimum frequency.
  • 7. The wireless communication apparatus of claim 6, wherein the frequency range comprises a frequency range of a time frequency block.
  • 8. The wireless communication apparatus of claim 1, wherein the processor is further configured to select the at least one pilot pattern based upon a relationship of a delay spread of the apparatus and the frequency selectivity.
  • 9. A wireless communication apparatus, comprising: means for storing a plurality of patterns of pilot symbols, each of the plurality of patterns comprising four contiguous clusters, each of the four contiguous clusters located at substantially corners of a hop region to be transmitted from the wireless communication apparatus over a channel; andmeans, coupled with the means for storing, for selecting at least one pilot pattern of the plurality of pilot patterns for transmission by the wireless communication apparatus based upon a time selectivity or frequency selectivity of the channel,wherein the means for selecting the at least one pilot pattern further comprises means for selecting the at least one pilot pattern based upon whether the wireless communication apparatus is to receive a transmission in a Multiple Input Multiple Output (MIMO) mode.
  • 10. The wireless communication apparatus of claim 9, wherein the means for selecting the at least one pilot pattern further comprises means for selecting the at least one pilot pattern based upon a velocity of the apparatus.
  • 11. The wireless communication apparatus of claim 9, wherein the wireless communication apparatus receives signals using a plurality of frequency subcarriers in a frequency range between a maximum frequency and a minimum frequency and wherein each of the clusters comprises a plurality of pilot symbols so that at least one of the plurality of pilot symbols of each of the plurality of clusters is transmitted using a frequency subcarrier other than the maximum frequency or the minimum frequency.
  • 12. The wireless communication apparatus of claim 11, wherein the means for selecting the at least one pilot pattern comprises means for selecting the at least one pilot pattern based upon relationship of a delay spread of the apparatus and the frequency selectivity.
  • 13. A method for transmitting pilots in a wireless communication apparatus comprising: determining a time selectivity or frequency selectivity of a channel of a user; andselecting a pilot pattern having four contiguous clusters of pilot symbols at the corners of a hop region for the user based upon the time selectivity or frequency selectivity of the channel,wherein said selecting further comprises selecting the pilot pattern based upon whether the wireless communication apparatus is to receive a transmission in a Multiple Input Multiple Output (MIMO) mode.
  • 14. The method of claim 13, wherein determining the time selectivity or frequency selectivity of the channel comprises determining the time selectivity or frequency selectivity of the channel based upon a velocity of the user.
  • 15. The method of claim 14, wherein the selecting the pilot pattern comprises selecting the pilot pattern based upon the velocity of the user with respect to the frequency selectivity.
  • 16. The method of claim 15, wherein the selecting comprises selecting a number of pilots based upon the velocity.
  • 17. The method of claim 13, wherein the determining the time selectivity or frequency selectivity of the channel comprises determining the time selectivity or frequency selectivity of the channel based upon a delay spread of the user.
  • 18. The method of claim 13, wherein the determining the time selectivity or frequency selectivity of the channel comprises determining the time selectivity or frequency selectivity of the channel based upon a Doppler spread.
  • 19. A non-transitory machine-readable medium encoded with instructions for processing a communication signal, the instructions comprising code for: determining in a wireless communication apparatus a time selectivity or frequency selectivity of a channel of a user; andselecting a pilot pattern for the user based upon the-time selectivity or frequency selectivity of the channel, wherein the pilot pattern is selected from a plurality of patterns of pilot symbols, each of the patterns of pilot symbols comprising a plurality of contiguous clusters disposed substantially at the four corners of a hop region,wherein said selecting further comprises selecting the pilot pattern based upon whether the wireless communication apparatus is to receive a transmission in a Multiple Input Multiple Output (MIMO) mode.
CLAIM OF PRIORITY UNDER 35 U.S.C. §120

The present Application for Patent is a continuation-in-part and claims priority to patent application Ser. No. 11/083,693 entitled “PILOT SIGNAL TRANSMISSION FOR AN ORTHOGONAL FREQUENCY DIVISION WIRELESS COMMUNICATION SYSTEM” filed Mar. 17, 2005, pending, and assigned to the assignee hereof and hereby expressly incorporated by reference herein. The present Application for Patent is related to the following co-pending U.S. Patent Applications: “Systems And Methods For Control Channel Signaling” 11/261,836, filed concurrently herewith, assigned to the assignee hereof, and expressly incorporated by reference herein; and“Method And Apparatus For Providing Antenna Diversity In A Wireless Communication System” 11/261,823, filed concurrently herewith, assigned to the assignee hereof, and expressly incorporated by reference herein.

US Referenced Citations (806)
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 et al. 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
6473418 Laroia et al. Oct 2002 B1
6473467 Wallace et al. Oct 2002 B1
6477317 Itokawa Nov 2002 B1
6478422 Hansen Nov 2002 B1
6483820 Davidson et al. Nov 2002 B1
6487243 Hwang et al. Nov 2002 B1
6496790 Kathavate et al. Dec 2002 B1
6501810 Karim et al. Dec 2002 B1
6507601 Parsa et al. Jan 2003 B2
6519462 Lu et al. Feb 2003 B1
6529525 Pecen et al. Mar 2003 B1
6535666 Dogan et al. Mar 2003 B1
6539008 Ahn et al. Mar 2003 B1
6539213 Richards et al. Mar 2003 B1
6542485 Mujtaba Apr 2003 B1
6542743 Soliman Apr 2003 B1
6563806 Yano et al. May 2003 B1
6563881 Sakoda et al. May 2003 B1
6577739 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 et al. 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 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
7092670 Tanaka 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 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
7188300 Eriksson et al. Mar 2007 B2
7197282 Dent et al. Mar 2007 B2
7200177 Miyoshi et al. Apr 2007 B2
7209712 Holtzman 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 et al. Aug 2007 B2
7257406 Ji et al. Aug 2007 B2
7257423 Iochi et al. 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 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
7567621 Sampath 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
7639728 Laroia et al. Dec 2009 B2
7664061 Hottinen Feb 2010 B2
7676007 Choi et al. Mar 2010 B1
7684507 Levy Mar 2010 B2
7720000 Yoshida et al. May 2010 B2
7724777 Sutivong et al. May 2010 B2
7768979 Sutivong et al. Aug 2010 B2
7873002 Cai Jan 2011 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
8014271 Laroia et al. Sep 2011 B2
8031583 Classon et al. Oct 2011 B2
8045512 Khandekar et al. Oct 2011 B2
8095141 Teague Jan 2012 B2
8098568 Laroia et al. Jan 2012 B2
8098569 Laroia et al. Jan 2012 B2
8208420 Liu et al. Jun 2012 B2
8331463 Jayaraman et al. Dec 2012 B2
8446892 Ji et al. May 2013 B2
8462859 Sampath et al. Jun 2013 B2
8477684 Khandekar et al. Jul 2013 B2
8488507 Luft et al. Jul 2013 B2
8582509 Khandekar et al. Nov 2013 B2
8582548 Gore et al. Nov 2013 B2
8811306 Callard et al. Aug 2014 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 et al. 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
20020191569 Sung 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
20030035491 Walton et al. 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
20030109226 Brunner 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
20030157900 Gaal 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
20030236080 Kadous et al. Dec 2003 A1
20040001429 Ma et al. Jan 2004 A1
20040001460 Bevan et al. Jan 2004 A1
20040002364 Trikkonen et al. Jan 2004 A1
20040009783 Miyoshi et al. Jan 2004 A1
20040010623 Sher et al. Jan 2004 A1
20040015692 Green et al. Jan 2004 A1
20040017785 Zelst 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 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 et al. Feb 2005 A1
20050041618 Wei et al. Feb 2005 A1
20050041750 Lau et al. Feb 2005 A1
20050041775 Batzinger et al. Feb 2005 A1
20050044206 Johansson et al. Feb 2005 A1
20050047517 Georgios et al. Mar 2005 A1
20050052991 Kadous et al. Mar 2005 A1
20050053081 Andersson et al. Mar 2005 A1
20050053151 Lin et al. Mar 2005 A1
20050063298 Ling et al. Mar 2005 A1
20050068921 Liu Mar 2005 A1
20050073976 Fujii Apr 2005 A1
20050085195 Tong et al. Apr 2005 A1
20050085236 Gerlach et al. Apr 2005 A1
20050111397 Attar et al. May 2005 A1
20050113100 Oprescu-Surcobe et al. May 2005 A1
20050122898 Jang et al. Jun 2005 A1
20050128683 Watanabe et al. Jun 2005 A1
20050128983 Kim et al. Jun 2005 A1
20050135324 Kim et al. Jun 2005 A1
20050135498 Yee Jun 2005 A1
20050141624 Lakshmipathi et al. Jun 2005 A1
20050147024 Jung et al. Jul 2005 A1
20050147025 Auer et al. Jul 2005 A1
20050152484 Sandhu et al. Jul 2005 A1
20050157807 Shim et al. Jul 2005 A1
20050159162 Park Jul 2005 A1
20050164709 Balasubramanian et al. Jul 2005 A1
20050165949 Teague Jul 2005 A1
20050174981 Heath et al. Aug 2005 A1
20050175070 Grob et al. Aug 2005 A1
20050180311 Wang et al. Aug 2005 A1
20050180313 Kim et al. Aug 2005 A1
20050181799 Laroia et al. Aug 2005 A1
20050192011 Hong et al. Sep 2005 A1
20050195733 Walton et al. Sep 2005 A1
20050195852 Vayanos et al. Sep 2005 A1
20050195886 Lampinen et al. Sep 2005 A1
20050201180 Naguib 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 et al. 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
20060046643 Izumikawa 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
20060146764 Takemoto 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
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
20070049218 Gorokhov et al. Mar 2007 A1
20070053282 Tong et al. Mar 2007 A1
20070053383 Choi et al. Mar 2007 A1
20070060178 Gorokhov et al. Mar 2007 A1
20070064669 Classon et al. Mar 2007 A1
20070070952 Yoon et al. Mar 2007 A1
20070071147 Sampath et al. Mar 2007 A1
20070081507 Koo et al. Apr 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
20080075094 Ahn et al. Mar 2008 A1
20080095223 Tong et al. Apr 2008 A1
20080095262 Ho et al. Apr 2008 A1
20080108355 Oleszcsuk May 2008 A1
20080151829 Khandekar et al. Jun 2008 A1
20080181139 Rangarajan et al. Jul 2008 A1
20080181168 Han 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
20080285500 Zhang et al. Nov 2008 A1
20080299983 Kwak et al. Dec 2008 A1
20090003466 Taherzadehboroujeni et al. Jan 2009 A1
20090010351 Laroia et al. Jan 2009 A1
20090017753 Kim 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
20090116420 Jeong et al. May 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
20090225695 Kang et al. Sep 2009 A1
20090252078 Lim et al. Oct 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
20100002582 Luft et al. Jan 2010 A1
20100135242 Nam et al. Jun 2010 A1
20100173644 Koyanagi Jul 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
20110110310 Cai May 2011 A1
20110189946 Fukuzawa et al. Aug 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
20110269394 Mildh et al. Nov 2011 A1
20110306291 Ma et al. Dec 2011 A1
20110310814 Callard et al. Dec 2011 A1
20120002623 Khandekar et al. Jan 2012 A1
20120044814 Natarajan et al. Feb 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
20120236781 Liu et al. Sep 2012 A1
20120250603 Huang et al. Oct 2012 A1
20120307668 Wiemann et al. Dec 2012 A1
20130016678 Laroia et al. Jan 2013 A1
20130045674 Koyanagi Feb 2013 A1
20130070664 Nagata et al. Mar 2013 A1
20130150047 Zhang et al. Jun 2013 A1
20130201902 Nagata et al. Aug 2013 A1
20130208681 Gore et al. Aug 2013 A1
20130273836 Lim et al. Oct 2013 A1
20130287138 Ma et al. Oct 2013 A1
20130315200 Gorokhov et al. Nov 2013 A1
20140036763 Borran et al. Feb 2014 A1
20140247898 Laroia et al. Sep 2014 A1
20140376518 Palanki et al. Dec 2014 A1
Foreign Referenced Citations (423)
Number Date Country
2348137 Nov 2001 CA
2477536 Sep 2003 CA
2540688 May 2005 CA
2577369 Mar 2006 CA
19931400 Dec 1994 CL
1997846 Jan 1998 CL
27102004 Aug 2005 CL
22892004 Sep 2005 CL
30862004 Oct 2005 CL
29932005 May 2006 CL
15212006 Mar 2007 CL
14922006 Apr 2007 CL
14892006 May 2007 CL
14902006 May 2007 CL
46151 Dec 2009 CL
1252919 May 2000 CN
1267437 Sep 2000 CN
1284795 Feb 2001 CN
1296682 May 2001 CN
1344451 Apr 2002 CN
1346221 Apr 2002 CN
1383631 Dec 2002 CN
1386344 Dec 2002 CN
1402916 Mar 2003 CN
1424835 Jun 2003 CN
1132474 Dec 2003 CN
1467938 Jan 2004 CN
1487755 Apr 2004 CN
1520220 Aug 2004 CN
1525678 Sep 2004 CN
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
2584884 Jan 1987 FR
2276540 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
1997182148 Jul 1997 JP
09214404 Aug 1997 JP
9284200 Oct 1997 JP
10117162 May 1998 JP
H10210000 Aug 1998 JP
10322304 Dec 1998 JP
H11168453 Jun 1999 JP
11191756 Jul 1999 JP
11196109 Jul 1999 JP
11508417 Jul 1999 JP
11239155 Aug 1999 JP
11298954 Oct 1999 JP
11331927 Nov 1999 JP
2000022618 Jan 2000 JP
2000102065 Apr 2000 JP
2000184425 Jun 2000 JP
2000511750 Sep 2000 JP
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
2003169367 Jun 2003 JP
2003174426 Jun 2003 JP
2003199173 Jul 2003 JP
2003520523 Jul 2003 JP
2003235072 Aug 2003 JP
2003249907 Sep 2003 JP
2003292667 Oct 2003 JP
2003318857 Nov 2003 JP
2003347985 Dec 2003 JP
2003348047 Dec 2003 JP
2003536308 Dec 2003 JP
2004007643 Jan 2004 JP
2004023716 Jan 2004 JP
2004048716 Feb 2004 JP
200472457 Mar 2004 JP
2004072157 Mar 2004 JP
2004096142 Mar 2004 JP
2004507151 Mar 2004 JP
2004507950 Mar 2004 JP
2004153676 May 2004 JP
2004158901 Jun 2004 JP
2004162388 Jun 2004 JP
2004194262 Jul 2004 JP
2004201296 Jul 2004 JP
2004215022 Jul 2004 JP
2004221972 Aug 2004 JP
2004266818 Sep 2004 JP
2004529524 Sep 2004 JP
2004297276 Oct 2004 JP
2004297370 Oct 2004 JP
2004297756 Oct 2004 JP
2004534456 Nov 2004 JP
2004535106 Nov 2004 JP
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 Jun 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
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
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
2005106258 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
WO-9613920 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
0041542 Jul 2000 WO
0051389 Aug 2000 WO
WO0070897 Nov 2000 WO
WO0101596 Jan 2001 WO
WO0117125 Mar 2001 WO
WO0126269 Apr 2001 WO
WO-0139523 May 2001 WO
WO0145300 Jun 2001 WO
WO-0148969 Jul 2001 WO
WO-0158054 Aug 2001 WO
WO-0160106 Aug 2001 WO
0165637 Sep 2001 WO
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
02099995 Dec 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
2004008681 Jan 2004 WO
WO2004004370 Jan 2004 WO
WO2004008671 Jan 2004 WO
WO2004015912 Feb 2004 WO
WO2004016007 Feb 2004 WO
WO2004021605 Mar 2004 WO
WO2004023834 Mar 2004 WO
2004028037 Apr 2004 WO
WO-2004030238 Apr 2004 WO
WO-2004032443 Apr 2004 WO
2004038984 May 2004 WO
2004040825 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
2004073276 Aug 2004 WO
WO2004066520 Aug 2004 WO
WO2004068721 Aug 2004 WO
WO2004075023 Sep 2004 WO
WO2004075442 Sep 2004 WO
WO2004075448 Sep 2004 WO
WO2004075468 Sep 2004 WO
WO2004075596 Sep 2004 WO
WO2004077850 Sep 2004 WO
WO2004084509 Sep 2004 WO
WO-2004086706 Oct 2004 WO
WO-2004086711 Oct 2004 WO
2004098072 Nov 2004 WO
WO2004095730 Nov 2004 WO
WO-2004095851 Nov 2004 WO
WO2004095854 Nov 2004 WO
WO2004098222 Nov 2004 WO
WO2004102815 Nov 2004 WO
WO2004102816 Nov 2004 WO
2004114564 Dec 2004 WO
2004114615 Dec 2004 WO
WO2004105272 Dec 2004 WO
WO2004114549 Dec 2004 WO
2005002253 Jan 2005 WO
2005015797 Feb 2005 WO
2005018270 Feb 2005 WO
WO2005011163 Feb 2005 WO
WO-2005015795 Feb 2005 WO
WO2005015810 Feb 2005 WO
WO-2005015941 Feb 2005 WO
WO2005020488 Mar 2005 WO
WO2005020490 Mar 2005 WO
WO2005022811 Mar 2005 WO
WO2005025110 Mar 2005 WO
WO2005032004 Apr 2005 WO
2005043780 May 2005 WO
WO2005043855 May 2005 WO
WO2005046080 May 2005 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
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 (129)
Entry
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.
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.
International Search Report—PCT/US06/060336—International Search Authority, European Patent Office—Mar. 2, 2007.
Written Opinion—PCT/US06/060336—International Search Authority, European Patent Office—Mar. 2, 2007.
International Preliminary Report on Patentability—PCT/US06/060336—The International Bureau of WIPO—Geneva, Switzerland—Apr. 29, 2008.
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.
Molisch, et al., MIMO systems with antenna selection, IEEE Microwave Magazine, URL: http://ieeexplore.ieee.org/iel5/6668/28677/O1284943.pdf, Retrieved on Dec. 8, 2006, pp. 46-56 (2004).
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, at 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-19, 2004, pp. 1926-1928, XF010766497.
International Search Report and Written Opinion—PCT/US09/064871, International Searching Authority—European Patent Office, Feb. 17, 2010.
3GPP TS 33.220 V.1.1.0 XX,XX, “3rd Generation Partnership Projects; 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.
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).
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.
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, Arnab, et al. “Adaptive, asynchronous incremental redundancy (A-IR) with fixed transmission time intervals TTI for HSDPA.” IEEE, pp. 10-83-1087.
Das, et al. “On the Reverse Link Interference Structure for Next Generation Cellular Systems,” European Microwave Conference, Oct. 11, 2004, pp. 3068-3072.
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.
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.
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.
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.
Net Working Group, T. Dierks, C. Allen, Certicom; The TLS Protocol Version 1.0; Jan. 1999.
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, Jan. 2001.
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 International Symposium on Computers and Communications, 1999, Jul. 6-8, 1999, pp. 362-368.
S. Nishimura et al., “Downlink Null-Formation Using Receiving Antenna Selection in MIMO/SDMA”, Technical Search Report of Electric Information Communication Academic Conference, Feb. 28, 2002, vol. 101, No. 683, pp. 17-22, RCS 2001-286.
Chiani, et al. “Outage Evaluation for Slow Frequency-Hopping Mobile Radio Systems” IEEE Transactions on Communications, vol. 47, No. 12, Dec. 1999, pp. 1865-1874.
European Search Report—EP10008767, Search Authority—Berlin Patent Office, Sep. 24, 2010.
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.
Qualcomm Europe: “Description and link simulations for OFDMA based E-UTRA uplink” 3GPP Draft; R1-051100, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, vol. RAN WG1, No. San Diego, USA; Oct. 4, 2005, pp. 1-10, XP050100715 [retrieved on Oct. 4, 2005.
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.
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.
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.
European Search Report—EP10012081, Search Authority—Munich Patent Office, Dec. 17, 2010.
European Search Report—EP10012082, Search Authority—Munich Patent Office, Dec. 20, 2010.
European Search Report—EP10012083, Search Authority—Munich Patent Office, Dec. 30, 2010.
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.
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.
Sumii, Kenji et al.: “A Study on Computational Complexity Reduction of Iterative Decoding for Turbo-coded MIMO-SDM Using Sphere Decoding,” Technical Report of IEICE. RCS, Nov. 9, 2010, vol. 104, No. 675, pp. 43-48.
Tomcik, T.: “QTDD Performance Report 2,” IEEE C802.20-05/88, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, <http://ieee802.org/20/>, pp. 1-56, XP002386798 (Nov. 15, 2005).
Translation of Office Action in Chinese Application 2006800295980 corresponding to U.S. Appl. No. 11/260,895, citing CN1346221 and CN1383631 dated Feb. 16, 2011.
Translation of Office Action in Japan application 2008-538193 corresponding to U.S. Appl. No. 11/261,065, citing JP11196109, JP10322304 and JP9008725 dated Mar. 8, 2011.
Translation of Office Action in Korean application 10-2007-7031029 corresponding to U.S. Appl. No. 11/260,931, citing US20030202491 and KR20040063057 dated Jan. 28, 2011.
Translation of Office Action in Chinese application 200680040236.1 corresponding to U.S. Appl. No. 11/261,065, citing US20040048609 and CN1402916 dated Feb. 18, 2011.
Translation of Office Action in Chinese application 200680048832.4 corresponding to U.S. Appl. No. 11/261,158, citing CN1132474 dated Dec. 31, 2010.
Translation of Office Action in Japanese Application 2008-514880 corresponding to U.S. Appl. No. 11/445,377, citing JP2007519281 and JP2006505172 dated Nov. 9, 2010.
Translation of Office Action in Japanese application 2008-528103 corresponding to U.S. Appl. No. 11/260,924, citing JP2005502218, JP2004534456, JP2003348047, JP2003199173, JP2004529524, JP11508417, JP2001238269, JP2005130491 and JP2003500909 dated Feb. 8, 2011.
Translation of Office Action in Japanese Application 2008-529216 corresponding to U.S. Appl. No. 11/261,159, citing GB2348776, WO2004098222, WO2005065062 and WO2004102815. Dated Jan. 11, 2011.
Translation of Office Action in Japanese application 2008-538181 corresponding to U.S. Appl. No. 11/511,735, citing WO04064295, JP2002515203, JP8288927, JP7336323 and JP200157545 dated Jan. 25, 2011.
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.
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.
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).
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; Apr. 3, 2007, XP050105640 [retrieved on Apr. 3, 2007].
Bengtsson, M. et at, “A Generalization of Weighted Subspace Fitting to Full-Rank Models”, IEEE Transactions on Signal Processing, IEEE Service Center, New York, NY, US, vol. 49, No. 5, pp. 1002-1012, May 1, 2001.
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.
Physical Channels and Multiplexing in Evolved UTRA Downlink TSG-RAN Working Group 1 Meeting, XX, XX, vol. RI-050590, Jun. 20, 2005, pp. 1-24, XP003006923 the whole document.
Siemens, “Evolved UTRA uplink scheduling and frequency reuse” [online], 3GPP TSG-RAN WG1 #41 R1-050476, Internet <URL:http://www.3gpp.org/ftp/tsg—ran/WG1—RL1/TSGR1—41/Docs/R1-050476.zip>, May 9, 2005.
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.
Miorandi D., et al., “Analysis of master-slae 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.
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.
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].
Samsung: “Uplink Transmission and Multiplexing for EUTRA”, 3GPP Draft; R1-050605 UL Multiplexing, Jun. 16, 2005, XP050111420.
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.
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.
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
20060209732 A1 Sep 2006 US
Continuation in Parts (1)
Number Date Country
Parent 11083693 Mar 2005 US
Child 11261361 US