Robust erasure detection and erasure-rate-based closed loop power control

Information

  • Patent Grant
  • 8516314
  • Patent Number
    8,516,314
  • Date Filed
    Tuesday, August 9, 2011
    12 years ago
  • Date Issued
    Tuesday, August 20, 2013
    10 years ago
Abstract
Techniques for performing erasure detection and power control for a transmission without error detection coding are described. For erasure detection, a transmitter transmits codewords via a wireless channel. A receiver computes a metric for each received codeword, compares the computed metric against an erasure threshold, and declares the received codeword to be “erased” or “non-erased”. The receiver dynamically adjusts the erasure threshold based on received known codewords to achieve a target level of performance. For power control, an inner loop adjusts the transmit power to maintain a received signal quality (SNR) at a target SNR. An outer loop adjusts the target SNR based on the status of received codewords (erased or non-erased) to achieve a target erasure rate. A third loop adjusts the erasure threshold based on the status of received known codewords (“good”, “bad”, or erased) to achieve a target conditional error rate.
Description
BACKGROUND

I. Field


The present invention relates generally to data communication, and more specifically to techniques for performing erasure detection and power control in a wireless communication system.


II. Background


A wireless multiple-access communication system can simultaneously support communication for multiple wireless terminals. Each terminal communicates with one or more base stations via transmissions on the forward and reverse links. The forward link (or downlink) refers to the communication link from the base stations to the terminals, and the reverse link (or uplink) refers to the communication link from the terminals to the base stations.


Multiple terminals may simultaneously transmit on the reverse link by multiplexing their transmissions to be orthogonal to one another. The multiplexing attempts to achieve orthogonality among the multiple reverse link transmissions in time, frequency, and/or code domain. Complete orthogonality, if achieved, results in the transmission from each terminal not interfering with the transmissions from other terminals at a receiving base station. However, complete orthogonality among the transmissions from different terminals is often not realized due to channel conditions, receiver imperfections, and so on. The loss in orthogonality results in each terminal causing some amounts of interference to other terminals. The performance of each terminal is then degraded by the interference from all other terminals.


On the reverse link, a power control mechanism may be used to control the transmit power of each terminal in order to ensure good performance for all terminals. This power control mechanism is normally implemented with two power control loops, which are often called an “inner” loop and an “outer” loop. The inner loop adjusts the transmit power of a terminal such that its received signal quality (SNR), as measured at a receiving base station, is maintained at a target SNR. The outer loop adjusts the target SNR to maintain a desired block error rate (BLER) or packet error rate (PER).


The conventional power control mechanism adjusts the transmit power of each terminal such that the desired block/packet error rate is achieved for the reverse link transmission from the terminal. An error detection code, such as a cyclic redundancy check (CRC) code, is typically used to determine whether each received data block/packet is decoded correctly or in error. The target SNR is then adjusted accordingly based on the result of the error detection decoding. However, an error detection code may not be used for some transmissions, e.g., if the overhead for the error detection code is deemed excessive. A conventional power control mechanism that relies on an error detection code cannot be used directly for these transmissions.


There is therefore a need in the art for techniques to properly adjust transmit power for a transmission when error detection coding is not used.


SUMMARY

Techniques for performing erasure detection and power control for a transmission on a “physical” channel (e.g., a control channel or a data channel) that does not employ error detection coding are described herein. Data is transmitted as “codewords” on the physical channel, where each codeword may be a block of coded or uncoded data.


For erasure detection, a transmitting entity (e.g., a wireless terminal) transmits codewords on the physical channel and via a wireless channel to a receiving entity (e.g., a base station). The base station computes a metric for each received codeword, as described below, and compares the computed metric against an erasure threshold. The base station declares each received codeword to be an “erased” codeword or a “non-erased” codeword based on the comparison result. The base station dynamically adjusts the erasure threshold to achieve a target level of performance, which may be quantified by a target conditional error rate that indicates the probability of a received codeword being decoded in error when declared to be a non-erased codeword. The erasure threshold may be adjusted based on received known codewords, which are received codewords for known codewords transmitted by terminals in communication with the base station, as described below. The adjustable erasure threshold can provide robust erasure detection performance in various channel conditions.


A power control mechanism with three loops (an inner loop, an outer loop, and a third loop) may be used to control the transmit power for the physical channel. The inner loop adjusts the transmit power for the physical channel to maintain the received SNR at or near a target SNR. The outer loop adjusts the target SNR based on the status of received codewords (erased or non-erased) to achieve a target erasure rate, which is the probability of declaring a received codeword as an erased codeword. The third loop adjusts the erasure threshold based on the status of received known codewords (“good”, “bad”, or erased) to achieve the target conditional error rate. The target erasure rate and the target conditional error rate are two measures of performance for the physical channel.


Various aspects and embodiments of the invention are described in further detail below.





BRIEF DESCRIPTION OF THE DRAWINGS

The features and nature of the present invention will 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 shows a wireless multiple-access communication system;



FIG. 2 shows a power control mechanism with three loops;



FIGS. 3A and 3B show a process for updating the second and third loops for the power control mechanism shown in FIG. 2;



FIG. 4 shows data and control channels for a data transmission scheme; and



FIG. 5 shows a block diagram of a base station and a terminal.





DETAILED DESCRIPTION

The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments or designs.



FIG. 1 shows a wireless multiple-access communication system 100. System 100 includes a number of base stations 110 that support communication for a number of wireless terminals 120. A base station is 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. Terminals 120 are typically dispersed throughout the system, and each terminal may be fixed or mobile. A terminal may also be referred to as a mobile station, a user equipment (UE), a wireless communication device, or some other terminology. Each terminal may communicate with one or more base stations on the forward and reverse links at any given moment. This depends on whether the terminal is active, whether soft handoff is supported, and whether the terminal is in soft handoff. For simplicity, FIG. 1 only shows transmissions on the reverse link. A system controller 130 couples to base stations 110, provides coordination and control for these base stations, and further controls the routing of data for the terminals served by these base stations.


The erasure detection and power control techniques described herein may be used for various wireless communication systems. For example, these techniques may be used for a Code Division Multiple Access (CDMA) system, a Time Division Multiple Access (TDMA) system, a Frequency Division Multiple Access (FDMA) system, an orthogonal frequency division multiple access (OFDMA) system, and so on. A CDMA system uses code division multiplexing, and transmissions for different terminals are orthogonalized by using different orthogonal (e.g., Walsh) codes for the forward link. The terminals use different pseudo-random number (PN) sequences for the reverse link in CDMA and are not completely orthogonal to one another. A TDMA system uses time division multiplexing, and transmissions for different terminals are orthogonalized by transmitting in different time intervals. An FDMA system uses frequency division multiplexing, and the transmissions for different terminals are orthogonalized by transmitting in different frequency subbands. An OFDMA system utilizes orthogonal frequency division multiplexing (OFDM), which effectively partitions the overall system bandwidth into a number of orthogonal frequency subbands. These subbands are also commonly referred to as tones, sub-carriers, bins, and frequency channels. An OFDMA system may use various orthogonal multiplexing schemes and may employ any combination of time, frequency, and/or code division multiplexing.


The techniques described herein may be used for various types of “physical” channels that do not employ error detection coding. The physical channels may also be referred to as code channels, transport channels, or some other terminology. The physical channels typically include “data” channels used to send traffic/packet data and “control” channels used to send overhead/control data. A system may employ different control channels to send different types of control information. For example, a system may use (1) a CQI channel to send channel quality indicators (CQI) indicative of the quality of a wireless channel, (2) an ACK channel to send acknowledgments (ACK) for a hybrid automatic retransmission (H-ARQ) scheme, (3) a REQ channel to send requests for data transmission, and so on. The physical channels may or may not employ other types of coding, even though error detection coding is not used. For example, a physical channel may not employ any coding, and data is sent “in the clear” on the physical channel. A physical channel may also employ block coding so that each block of data is coded to obtain a corresponding block of coded data, which is then sent on the physical channel. The techniques described herein may be used for any and all of these different physical (data and control) channels.


For clarity, the erasure detection and power control techniques are specifically described below for an exemplary control channel used for the reverse link. Transmissions from different terminals on this control channel may be orthogonally multiplexed in frequency, time, and/or code space. With complete orthogonality, no interference is observed by each terminal on the control channel. However, in the presence of frequency selective fading (or variation in frequency response across the system bandwidth) and Doppler (due to movement), the transmissions from different terminals may not be orthogonal to one another at a receiving base station.


Data is sent in blocks on the exemplary control channel, with each block containing a predetermined number of (L) data bits. Each data block is coded with a block code to obtain a corresponding codeword or coded data block. Since each data block contains L bits, there are 2L possible different data blocks that are mapped to 2L possible codewords in a codebook, one codeword for each different data block. The terminals transmit codewords for the data blocks on the control channel.


A base station receives the codewords transmitted on the control channel by different terminals. The base station performs the complementary block decoding on each received codeword to obtain a decoded data block, which is a data block deemed most likely to have been transmitted for the received codeword. The block decoding may be performed in various manners. For example, the base station may compute a Euclidean distance between the received codeword and each of the 2L possible valid codewords in the codebook. In general, the Euclidean distance between the received codeword and a given valid codeword is shorter the closer the received codeword is to the valid codeword, and is longer the farther away the received codeword is from the valid codeword. The data block corresponding to the valid codeword with the shortest Euclidean distance to the received codeword is provided as the decoded data block for the received codeword.


As an example, the L data bits for a data block may be mapped to a codeword containing K modulation symbols for a particular modulation scheme (e.g., BPSK, QPSK, M-PSK, M-QAM, and so on). Each valid codeword is associated with a different set of K modulation symbols, and the 2L sets of modulation symbols for the 2L possible valid codewords may be selected to be as far apart (in Euclidean distance) from each other as possible. A received codeword would then contain K received symbols, where each received symbol is a noisy version of a transmitted modulation symbol. The Euclidean distance between the received codeword and a given valid codeword may be computed as:












d
i



(
k
)


=


1
K






j
=
1

K




(




s
^

k



(
j
)


-


s
i



(
j
)



)

2




,




Eq






(
1
)








where ŝk(j) is the j-th received symbol for received codeword k;


si(j) is the j-th modulation symbol for valid codeword i; and


di(k) is the Euclidean distance between received codeword k and valid codeword i.


Equation (1) computes the Euclidean distance as the mean-squared error between the K received symbols for the received codeword and the K modulation symbols for the valid codeword. The data block corresponding to the valid codeword with the smallest di(k) is provided as the decoded data block for the received codeword.


Without an error detection code, there is no direct way to determine whether the block decoding of a given received codeword is correct or in error, and that the decoded data block is indeed the transmitted data block. A metric may be defined and used to provide an indication of the confidence in the decoding result. In an embodiment, a metric may be defined as follows:











m


(
k
)


=



d

n





1




(
k
)




d

n





2




(
k
)




,




Eq






(
2
)










    • where dn1(k) is the Euclidean distance between received codeword k and the nearest valid codeword;

    • dn2(k) is the Euclidean distance between received codeword k and the next nearest valid codeword; and

    • m(k) is the metric for received codeword k.





If the received codeword is much closer to the nearest codeword than the next nearest codeword, then the metric m(k) is a small value and there is a high degree of confidence that the decoded data block is correct. Conversely, if the received codeword has approximately equal distance to the nearest codeword and the next nearest codeword, then the metric m(k) approaches one, or m(k)→1, and there is less confidence that the decoded data block is correct.


Equation (2) shows one exemplary metric that is based on the ratio of Euclidean distances and which may be used to determine whether the block decoding of a given received codeword is correct or in error. Other metrics may also be used for erasure detection, and this is within the scope of the invention. In general, a metric may be defined based on any suitable reliability function ƒ(r,C), where r is a received codeword and C is a codebook or collection of all possible codewords. The function ƒ(r,C) should be indicative of the quality/reliability of a received codeword and should have the proper characteristic (e.g., monotonic with detection reliability).


Erasure detection may be performed to determine whether the decoding result for each received codeword meets a predetermined level of confidence. The metric m(k) for a received codeword may be compared against an erasure threshold, THerasure, to obtain a decoding decision for the received codeword, as follows:

m(k)<THerasure, declare a non-erased codeword,
m(k)≧THerasure, declare an erased codeword.  Eq (3)


As shown in equation (3), the received codeword is declared as (1) an “erased” codeword if the metric m(k) is equal to or greater than the erasure threshold and (2) a “non-erased” codeword if the metric m(k) is less than the erasure threshold. The base station may treat decoded data blocks for non-erased and erased codewords differently. For example, the base station may use decoded data blocks for non-erased codewords for subsequent processing and may discard decoded data blocks for erased codewords.


The probability of declaring a received codeword as an erased codeword is called an erasure rate and is denoted as Prerasure. The erasure rate is dependent on the erasure threshold used for erasure detection and the received signal quality (SNR) for the received codeword. The signal quality may be quantified by a signal-to-noise ratio, a signal-to-noise-and-interference ratio, and so on. For a given received SNR, a low erasure threshold increases the likelihood of a received codeword being declared an erased codeword, and vice versa. For a given erasure threshold, a low received SNR also increases the likelihood of a received codeword being declared an erased codeword, and vice versa. For a given erasure threshold, the received SNR may be set (by controlling the transmit power for the control channel, as described below) to achieve the desired erasure rate.


The erasure threshold may be set to achieve the desired performance for the control channel. For example, a probability of error conditioned on non-erased codewords, which is called a conditional error rate, may be used for the control channel. This conditional error rate is denoted as Prerror and means the following: given that a received codeword is declared to be a non-erased codeword, the probability of the decoded data block for the received codeword being incorrect is Prerror. A low Prerror (e.g., 1% or 0.1%) corresponds to a high degree of confidence in the decoding result when a non-erased codeword is declared. A low Prerror may be desirable for many types of transmission where reliable decoding is important. The erasure threshold may be set to the proper level to achieve the desired Prerror.


A well-defined relationship may be expected to exist between the erasure rate Prerasure, the conditional error rate Prerror, the erasure threshold THerasure, and the received SNR. In particular, for a given erasure threshold and a given received SNR, there exists a specific erasure rate and a specific conditional error rate. By changing the erasure threshold, a trade off may be made between the erasure rate and the conditional error rate. Computer simulation may be performed and/or empirical measurements may be made to determine or predict the relationship between the erasure rate and the conditional error rate for different erasure threshold values and different received SNRs.


However, in a practical system, the relationship between these four parameters may not be known in advance and may be dependent on deployment scenarios. For example, the specific erasure threshold that can achieve the desired erasure rate and conditional error rate may not be known a priori and may even change over time, but probably slowly. Furthermore, it is not known whether “predicted” relationship between the erasure rate and the conditional error rate, obtained via simulation or by some other means, will hold true in an actual deployment.


A power control mechanism may be used to dynamically adjust the erasure threshold and the received SNR to achieve the desired performance for the control channel. The control channel performance may be quantified by a target erasure rate Prerasure (e.g., 10% erasure rate, or Prerasure=0.1) and a target conditional error rate Prerror (e.g., 1% conditional error rate, or Prerror=0.01), i.e., a (Prerasure, Prerror) pair.



FIG. 2 shows a power control mechanism 200 that may be used to dynamically adjust the erasure threshold and to control the transmit power for a transmission sent on the control channel from a terminal to a base station. Power control mechanism 200 includes an inner loop 210, an outer loop 220, and a third loop 230.


Inner loop 210 attempts to maintain the received SNR for the transmission, as measured at the base station, as close as possible to a target SNR. For inner loop 210, an SNR estimator 242 at the base station estimates the received SNR for the transmission and provides the received SNR to a transmit power control (TPC) generator 244. TPC generator 244 also receives the target SNR for the control channel, compares the received SNR against the target SNR, and generates TPC commands based on the comparison results. Each TPC command is either (1) an UP command to direct an increase in transmit power for the control channel or (2) a DOWN command to direct a decrease in transmit power. The base station transmits the TPC commands on the forward link (cloud 260) to the terminal.


The terminal receives and processes the forward link transmission from the base station and provides “received” TPC commands to a TPC processor 262. Each received TPC command is a noisy version of a TPC command sent by the base station. TPC processor 262 detects each received TPC command and obtains a TPC decision, which may be (1) an UP decision if the received TPC command is deemed to be an UP command or (2) a DOWN decision if the received TPC command is deemed to be a DOWN command.


A transmit (TX) power adjustment unit 264 adjusts the transmit power for the transmission on the control channel based on the TPC decisions from TPC processor 262. Unit 264 may adjust the transmit power as follows:











P
cch



(

n
+
1

)


=

{






P
cch



(
n
)


+

Δ






P
up






for an UP decision,








P
cch



(
n
)


-

Δ






P
dn






for a DOWN decision,









Eq






(
4
)








where Pcch(n) is the transmit power for inner loop update interval n;


ΔPup is an up step size for the transmit power; and


ΔPdn is a down step size for the transmit power.


The transmit power Pcch(n) and step sizes ΔPup and ΔPdn are in units of decibels (dB). As shown in equation (4), the transmit power is increased by ΔPup for each UP decision and decreased by ΔPdn for each DOWN decision. Although not described above for simplicity, a TPC decision may also be a “no-OP” decision if a received TPC command is deemed to be too unreliable, in which case the transmit power may be maintained at the same level, or Pcch(n+1)=Pcch(n). The ΔPup and ΔPdn step sizes are typically equal, and may both be set to 1.0 dB, 0.5 dB, or some other value.


Due to path loss, fading, and multipath effects on the reverse link (cloud 240), which typically vary over time and especially for a mobile terminal, the received SNR for the transmission on the control channel continually fluctuates. Inner loop 210 attempts to maintain the received SNR at or near the target SNR in the presence of changes in the reverse link channel condition.


Outer loop 220 continually adjusts the target SNR such that the target erasure rate is achieved for the control channel. A metric computation unit 252 computes the metric m(k) for each received codeword obtained from the control channel, as described above. An erasure detector 254 performs erasure detection for each received codeword based on the computed metric m(k) for the codeword and the erasure threshold and provides the status of the received codeword (either erased or non-erased) to a target SNR adjustment unit 256.


Target SNR adjustment unit 256 obtains the status of each received codeword and adjusts the target SNR for the control channel, as follows:










S





N







R
target



(

k
+
1

)



=

{






S





N







R
target



(
k
)



+

Δ





S





N






R
up



,




for an erased codeword,








S





N







R
target



(
k
)



-

Δ





S





N






R
dn



,




for a non-erased codeword,









Eq






(
5
)









where


SNRtarget(k) is the target SNR for outer loop update interval k;


ΔSNRup is an up step size for the target SNR; and


ΔSNRdn is a down step size for the target SNR.


The target SNR SNRtarget(k) and the step sizes ΔSNRup and ΔSNRdn are in units of dB. As shown in equation (5), unit 256 reduces the target SNR by ΔSNRdn if a received codeword is deemed to be a non-erased codeword, which may indicate that the received SNR for the control channel is higher than necessary. Conversely, unit 256 increases the target SNR by ΔSNRup if a received codeword is deemed to be an erased codeword, which may indicate that the received SNR for the control channel is lower than necessary.


The ΔSNRup and ΔSNRdn step sizes for adjusting the target SNR may be set based on the following relationship:










Δ





S





N






R
up


=

Δ





S





N







R
dn

·


(


1
-

Pr
erasure



Pr
erasure


)

.







Eq






(
6
)








For example, if the target erasure rate for the control channel is 10% (or Prerasure=0.1), then the up step size is 9 times the down step size (or ΔSNRup=9·ΔSNRdn). If the up step size is selected to be 0.5 decibel (dB), then the down step size is approximately 0.056 dB. Larger values for ΔSNRup and ΔSNRdn speed up the convergence rate for outer loop 220. A large value for ΔSNRup also causes more fluctuation or variation of the target SNR at steady state.


Third loop 230 dynamically adjusts the erasure threshold such that the target conditional error rate is achieved for the control channel. The terminal may transmit a known codeword on the control channel periodically or whenever triggered. The base station receives the transmitted known codeword. Metric computation unit 252 and erasure detector 254 perform erasure detection for each received known codeword based on the erasure threshold and in the same manner as for the received codewords. For each received known codeword deemed to be non-erased, a decoder 262 decodes the received known codeword and determines whether the decoded data block is correct or in error, which can be done since the codeword is known. Decoder 262 provides to an erasure threshold adjustment unit 264 the status of each received known codeword, which may be: (1) an erased codeword, (2) a “good” codeword if the received known codeword is a non-erased codeword and decoded correctly, or (3) a “bad” codeword if the received known codeword is a non-erased codeword but decoded in error.


Erasure threshold adjustment unit 264 obtains the status of the received known codewords and adjusts the erasure threshold, as follows:











TH
erasure



(

l
+
1

)


=

{







TH
erasure



(
l
)


+

Δ






TH
up



,




for a good codeword,









TH
erasure



(
l
)


-

Δ






TH
dn



,




for a bad codeword, and








TH
erasure



(
l
)


,




for an erased codeword,









Eq






(
7
)








where


ΔTHerasure(l) is the erasure threshold for third loop update interval l;


ΔTHup is an up step size for the erasure threshold; and


ΔTHdn is a down step size for the erasure threshold.


As shown in equation (7), the erasure threshold is decreased by ΔTHdn for each received known codeword that is a bad codeword. The lower erasure threshold corresponds to a more stringent erasure detection criterion and results in a received codeword being more likely to be deemed erased, which in turn results in the received codeword being more likely to be decoded correctly when deemed to be non-erased. Conversely, the erasure threshold is increased by ΔTHup for each received known codeword that is a good codeword. The higher erasure threshold corresponds to a less stringent erasure detection criterion and results in a received codeword being less likely to be deemed erased, which in turn results in the received codeword being more likely to be decoded in error when deemed to be non-erased. The erasure threshold is maintained at the same level for received known codewords that are erased.


The ΔTHup and ΔTHdn step sizes for adjusting the erasure threshold may be set based on the following relationship:










Δ






TH
dn


=

Δ







TH
up

·


(


1
-

Pr
error



Pr
error


)

.







Eq






(
8
)








For example, if the target conditional error rate for the control channel is 1%, then the down step size is 99 times the up step size. The magnitude of ΔTHup and ΔTHdn may be determined based on the expected magnitude of the received symbols, the desired convergence rate for the third loop, and possibly other factors.


In general, the adjustment of the erasure threshold is dependent on how the metric used for erasure detection is defined. Equations (7) and (8) are based on the metric defined as shown in equation (2). The metric may also be defined in other manners (e.g., m(k)=dn2(k)=dn1(k) instead of m(k)=dn1(k)/dn2(k)), in which case the adjustment of the erasure threshold may be modified accordingly. The adjustable erasure threshold may also be used in combination with any erasure detection technique to achieve robust erasure detection performance for various channel conditions.


The erasure threshold, THensure(l), may be dynamically adjusted in various manners. In one embodiment, a separate third loop is maintained by the base station for each terminal in communication with the base station. This embodiment allows the erasure threshold to be individually adjusted for each terminal, which then allows the control channel performance to be specifically tailored for the terminal. For example, different terminals may have different target conditional error rates, which may be achieved by operating separate third loops for these terminals. In another embodiment, a single third loop is maintained by the base station for all terminals in communication with the base station. The common erasure threshold is then used for erasure detection for all of these terminals and is also updated based on known codewords received by the base station from these terminals. This embodiment provides good performance for all terminals if the control channel performance is robust for these terminals for various channel conditions. This embodiment allows for a faster rate of convergence for the third loop and also reduces overhead since each terminal may transmit the known codeword at a lower rate (e.g., once every few hundred milli-seconds). In yet another embodiment, a single third loop is maintained by the base station for each group of terminals having the same control channel performance, and the erasure threshold is updated based on known codewords received by the base station from all terminals in the group.


Inner loop 210, outer loop 220, and third loop 230 are typically updated at different rates. Inner loop 210 is the fastest loop of the three loops, and the transmit power for the control channel may be updated at a particular rate (e.g., 150 times per second). Outer loop 220 is the next fastest loop, and the target SNR may be updated whenever a codeword is received on the control channel. Third loop 230 is the slowest loop, and the erasure threshold may be updated whenever a known codeword is received on the control channel. The update rates for the three loops may be selected to achieve the desired performance for erasure detection and power control.


For the embodiment described above, the target conditional error rate Prerror is used as one of the measures of performance for the control channel, and the third loop is designed to achieve this Prerror. Other measures of performance may also be used for the control channel, and the third loop may be designed accordingly. For example, a target probability of a received codeword being decoded in error when deemed to be erased may be used for the third loop.



FIGS. 3A and 3B show a flow diagram of a process 300 for updating the second and third loops of power control mechanism 300. A received codeword k is initially obtained from the control channel (block 312). The metric m(k) is computed for the received codeword, e.g., as described above, (block 314) and compared against the erasure threshold (block 316). If the computed metric m(k) is greater than or equal to the erasure threshold, as determined in block 320, and if the received codeword is not a known codeword, as determined in block 322, then the received codeword is declared as an erased codeword (block 324). The target SNR is increased by the ΔSNRup step size if the computed metric m(k) is greater than or equal to the erasure threshold, regardless of whether the received codeword is known or not known (block 326). After block 326, the process returns to block 312 to process the next received codeword.


If the computed metric m(k) is less than the erasure threshold, as determined in block 320, and if the received codeword is not a known codeword, as determined in block 332, then the received codeword is declared as a non-erased codeword (block 334), and the target SNR is decreased by the ΔSNRdn step size (block 336). The process returns to block 312 to process the next received codeword.


If the computed metric m(k) is less than the erasure threshold, as determined in block 320, and if the received codeword is a known codeword, as determined in block 332, then (referring to FIG. 3B) the received codeword is decoded (block 340). If the decoding was correct, as determined in block 342, then the received known codeword is declared as a good codeword (block 344), and the erasure threshold is increased by the ΔTHup step size (block 346). Otherwise, if there was a decoding error, as determined in block 342, then the received known codeword is declared as a bad codeword (block 354), and the erasure threshold is decreased by the ΔTHdn step size (block 356). From blocks 346 and 356, the process returns to block 312 in FIG. 3A to process the next received codeword.


As noted above, the techniques described herein may be used for various types of physical channels that do not employ error detection coding. The use of these techniques for an exemplary data transmission scheme is described below. For this transmission scheme, a terminal desiring a forward link transmission estimates the received signal quality of the forward link for its serving base station (e.g., based on a pilot transmitted by the base station). The received signal quality estimate may be translated to an L-bit value, which is called a channel quality indicator (CQI). The CQI may indicate the received SNR for the forward link, the supported data rate for the forward link, and so on. In any case, block coding is performed on the CQI to obtain a CQI codeword. As a specific example, L may be equal to 4, and the CQI codeword may contain 16 QPSK modulation symbols, or [si(1) si(2) . . . si(16)]. The terminal transmits the CQI codeword on the CQI channel (which is one of the control channels) to the serving base station. The serving base station receives the CQI codeword sent on the CQI channel and performs erasure detection on the received CQI codeword. If the received CQI codeword is not erased, then the serving base station decodes the received CQI codeword and uses the decoded CQI to schedule a data transmission for the terminal.



FIG. 4 shows a set of data and control channels used for the exemplary data transmission scheme. The terminal measures the received signal quality of the forward link and transmits a CQI codeword on the CQI channel. The terminal continually makes measurements of the forward link quality and sends updated CQI codewords on the CQI channel. Thus, discarding received CQI codewords deemed to be erased is not detrimental to system performance. However, received CQI codewords deemed to be non-erased should be of high quality since a forward link transmission may be scheduled based on the information contained in these non-erased CQI codewords.


If the terminal is scheduled for forward link transmission, then the serving base station processes data packets to obtain coded packets and transmits the coded packets on a forward link data channel to the terminal. For a hybrid automatic retransmission (H-ARQ) scheme, each coded packet is partitioned into multiple subblocks, and one subblock is transmitted at a time for the coded packet. As each subblock for a given coded packet is received on the forward link data channel, the terminal attempts to decode and recover the packet based on all subblocks received thus far for the packet. The terminal is able to recover the packet based on a partial transmission because the subblocks contain redundant information that is useful for decoding when the received signal quality is poor but may not be needed when the received signal quality is good. The terminal then transmits an acknowledgment (ACK) on an ACK channel if the packet is decoded correctly, or a negative acknowledgment (NAK) otherwise. The forward link transmission continues in this manner until all coded packets are transmitted to the terminal.


The techniques described herein may be advantageously used for the CQI channel. Erasure detection may be performed on each received CQI codeword as described above. The transmit power for the CQI channel may be adjusted using power control mechanism 300 to achieve the desired performance for the CQI channel (e.g., the desired erasure rate and the desired conditional error rate). The transmit power for other control channels (e.g., the ACK channel) and reverse link data channels may also be set based on the power-controlled transmit power for the CQI channel.


For clarity, the erasure detection and power control techniques have been specifically described for the reverse link. These techniques may also be used for erasure detection and power control for a transmission sent on the forward link.



FIG. 5 shows a block diagram of an embodiment of a base station 110x and a terminal 120x. On the reverse link, at terminal 120x, a transmit (TX) data processor 510 receives and processes (e.g., formats, codes, interleaves, and modulates) reverse link (RL) traffic data and provides modulation symbols for the traffic data. TX data processor 510 also processes control data (e.g., CQI) from a controller 520 and provides modulation symbols for the control data. A modulator (MOD) 512 processes the modulation symbols for traffic and control data and pilot symbols and provides a sequence of complex-valued chips. The processing by TX data processor 510 and modulator 512 is dependent on the system. For example, modulator 512 may perform OFDM modulation if the system utilizes OFDM. A transmitter unit (TMTR) 514 conditions (e.g., converts to analog, amplifies, filters, and frequency upconverts) the sequence of chips and generates a reverse link signal, which is routed through a duplexer (D) 516 and transmitted via an antenna 518.


At base station 110x, the reverse link signal from terminal 120x is received by an antenna 552, routed through a duplexer 554, and provided to a receiver unit (RCVR) 556. Receiver unit 556 conditions (e.g., filters, amplifies, and frequency downconverts) the received signal and further digitizes the conditioned signal to obtain a stream of data samples. A demodulator (DEMOD) 558 processes the data samples to obtain symbol estimates. A receive (RX) data processor 560 then processes (e.g., deinterleaves and decodes) the symbol estimates to obtain decoded data for terminal 120x. RX data processor 560 also performs erasure detection and provides to a controller 570 the status of each received codeword used for power control. The processing by demodulator 558 and RX data processor 560 is complementary to the processing performed by modulator 512 and TX data processor 510, respectively.


The processing for a forward link transmission may be performed similarly to that described above for the reverse link. The processing for reverse link and forward link transmissions is typically specified by the system.


For reverse link power control, an SNR estimator 574 estimates the received SNR for terminal 120x and provides the received SNR to a TPC generator 576. TPC generator 576 also receives the target SNR and generates TPC commands for terminal 120x. The TPC commands are processed by a TX data processor 582, further processed by a modulator 584, conditioned by a transmitter unit 586, routed through duplexer 554, and transmitted via antenna 552 to terminal 120x.


At terminal 120x, the forward link signal from base station 110x is received by antenna 518, routed through duplexer 516, conditioned and digitized by a receiver unit 540, processed by a demodulator 542, and further processed by an RX data processor 544 to obtain received TPC commands. A TPC processor 524 then detects the received TPC commands to obtain TPC decisions, which are used to generate a transmit power adjustment control. Modulator 512 receives the control from TPC processor 524 and adjusts the transmit power for the reverse link transmission. Forward link power control may be achieved in a similar manner.


Controllers 520 and 570 direct the operations of various processing units within terminal 120x and base station 110x, respectively. Controller 520 and 570 may also perform various functions for erasure detection and power control for the forward link and reverse link. For example, each controller may implement the SNR estimator, TPC generator, and target SNR adjustment unit for its link. Controller 570 and RX data processor 560 may also implement process 300 in FIGS. 3A and 3B. Memory units 522 and 572 store data and program codes for controllers 520 and 570, respectively.


The erasure detection and power control techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing units used to perform erasure detection and/or power control 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 a memory unit (e.g., memory unit 572 in FIG. 5) and executed by a processor (e.g., controller 570). 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 will 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. An apparatus which controls a transmit power for a physical channel in a wireless communications system, comprising: a first sub-system utilizing an inner loop operable to adjust the transmit power for the physical channel to maintain a received Signal-to-Noise Ratio (SNR) substantially at a target SNR value;a second sub-system utilizing an outer loop operable to adjust the target SNR value which achieves a target erasure rate; anda third sub-system utilizing a third loop is operable to adjust an erasure threshold to achieve a target conditional error rate.
  • 2. The apparatus of claim 1, wherein the first sub-system further comprises: an SNR estimator operable to determine an of estimate the received SNR at a base station; anda transmit power control (TPC) generator, functionally coupled to the SNR estimator, operable to determine a comparison between the estimate of the received SNR with the target SNR value, and generate TPC commands based the comparison.
  • 3. The apparatus of claim 2, wherein the TPC generator receives the target SNR associated with a control channel from the second sub-system, and provides TPC commands over a forward link to a mobile terminal.
  • 4. The apparatus of claim 3, wherein the TPC commands include at least one of an UP command to direct an increase in transmit power for the control channel or a DOWN command to direct a decrease in channel power.
  • 5. The apparatus of claim 1, wherein the second sub-system further comprises: a metric computation unit operative to determine a metric for received codewords obtained from a control channel;an erasure detector, functionally coupled to the metric computation unit, operable to perform erasure detection for the received codewords based on the determined metric for the received codeword and the erasure threshold; anda target SNR adjustment unit, functionally coupled to the erasure detector, operable to obtain the status of the received codewords and adjust the target SNR for the control channel.
  • 6. The apparatus of claim 5, wherein the erasure detector is further operable to provide a status of the received codewords are defined as being one of erased or non-erased.
  • 7. The apparatus of claim 5, wherein the target SNR adjustment unit is further operable to provide the target SNR to the first sub-system.
  • 8. The apparatus of claim 1, wherein the third sub-system further comprises: a decoder operable to decode received known codewords and determine whether the codewords are correct, and generate a codeword status based upon the determination; andan erasure threshold adjustment unit, functionally coupled to the decoder, operable to determine the erasure threshold based upon the generated codeword status, and provide the erasure threshold to the second sub-system.
  • 9. The apparatus of claim 8, wherein the codeword status is defined as one of good, bad or erased.
  • 10. The apparatus of claim 1, wherein the inner loop, the outer loop, and the third loop are updated at different rates.
  • 11. The apparatus of claim 10, wherein inner loop is the fastest loop, the outer loop is the next fastest loop, and the third loop is the slowest loop.
  • 12. A method for controlling a transmit power for a physical channel in a wireless communications system, comprising: adjusting the transmit power for the physical channel within a first loop to maintain a received Signal-to-Noise Ratio (SNR) substantially at a target SNR value;adjusting the target SNR value within a second loop which achieves a target erasure rate;adjusting an erasure threshold within a third loop to achieve a target conditional error rate.
  • 13. The method of claim 1, further comprising: determining an of estimate the received SNR at a base station; anddetermining a comparison the estimate of the received SNR with the target SNR value; andgenerating transmit power control (TPC) commands based the comparison.
  • 14. The method of claim 13, further comprising: receiving the target SNR for a control channel from the second sub-system; andproviding the TPC commands over a forward link to a mobile terminal.
  • 15. The method of claim 14, wherein the TPC commands include at least one of an UP command to direct an increase in transmit power for the control channel or a DOWN command to direct a decrease in channel power.
  • 16. The method of claim 12, further comprising: determining a metric for received codewords obtained from a control channel;performing erasure detection for the received codewords based on the determined metric for the received codeword and the erasure threshold;obtaining the status of the received codewords; andadjusting the target SNR for the control channel.
  • 17. The method of claim 16, further comprising providing a status of the received codewords which are defined as being one of erased or non-erased.
  • 18. The method of claim 16, further comprising providing the target SNR to the first loop.
  • 19. The method of claim 12, further comprising: decoding received known codewords and determining whether the codewords are correct, and generating a codeword status based upon the determination; anddetermining the erasure threshold based upon the generated codeword status, and providing the erasure threshold to the second sub-system.
  • 20. The method of claim 19, wherein the codeword status is defined as one of good, bad or erased.
  • 21. The method of claim 12, further comprising updating the inner loop, the outer loop, and the third loop at different rates.
CLAIM OF PRIORITY UNDER 35 U.S.C. §120

The present Application for Patent is a Divisional of patent application Ser. No. 11/676,563 entitled “ROBUST ERASURE DETECTION AND ERASURE-RATE-BASED CLOSED LOOP POWER CONTROL” filed Feb. 20, 2007, pending, which is a Continuation of patent application Ser. No. 10/890,717 entitled “ROBUST ERASURE DETECTION AND ERASURE-RATE-BASED CLOSED LOOP POWER CONTROL” filed Jul. 13, 2004, pending, which claims priority to Provisional Application No. 60/580,819 entitled “REVERSE-LINK POWER CONTROL ALGORITHM” filed Jun. 18, 2004, expired, and assigned to the assignee hereof and hereby expressly incorporated by reference herein.

US Referenced Citations (221)
Number Name Date Kind
3577080 Cannalte May 1971 A
4225976 Osborne et al. Sep 1980 A
4539684 Kloker Sep 1985 A
4638479 Alexis Jan 1987 A
4901307 Gilhousen et al. Feb 1990 A
4908827 Gates Mar 1990 A
5103459 Gilhousen et al. Apr 1992 A
5267262 Wheatley, III Nov 1993 A
5301364 Arens et al. Apr 1994 A
5396516 Padovani et al. Mar 1995 A
5406613 Peponides et al. Apr 1995 A
5448600 Lucas Sep 1995 A
5469471 Wheatley, III Nov 1995 A
5548812 Padovani et al. Aug 1996 A
5559790 Yano et al. Sep 1996 A
5574984 Reed et al. Nov 1996 A
5722063 Peterzell et al. Feb 1998 A
5734646 I et al. Mar 1998 A
5754533 Bender et al. May 1998 A
5774785 Karlsson Jun 1998 A
5784363 Engstrom et al. Jul 1998 A
5815507 Vinggaard et al. Sep 1998 A
5839056 Hakkinen Nov 1998 A
5859383 Davison et al. Jan 1999 A
5933768 Skold et al. Aug 1999 A
5956642 Larsson et al. Sep 1999 A
5961588 Cooper et al. Oct 1999 A
5995488 Kalkunte et al. Nov 1999 A
5996103 Jahanghir Nov 1999 A
5996110 Kosmach Nov 1999 A
6006073 Glauner et al. Dec 1999 A
6012160 Dent Jan 2000 A
6038220 Kang et al. Mar 2000 A
6044072 Ueda Mar 2000 A
6047189 Yun et al. Apr 2000 A
6061339 Nieczyporowicz et al. May 2000 A
6075974 Saints et al. Jun 2000 A
6101179 Soliman Aug 2000 A
6112325 Burshtein Aug 2000 A
6144841 Feeney Nov 2000 A
6154659 Jalali et al. Nov 2000 A
6173187 Salonaho et al. Jan 2001 B1
6173188 Kim Jan 2001 B1
6175587 Madhow et al. Jan 2001 B1
6175588 Visotsky et al. Jan 2001 B1
6181738 Chheda et al. Jan 2001 B1
6188678 Prescott Feb 2001 B1
6192249 Padovani Feb 2001 B1
6208699 Chen et al. Mar 2001 B1
6212364 Park Apr 2001 B1
6216006 Scholefield et al. Apr 2001 B1
6226529 Bruno et al. May 2001 B1
6233222 Wallentin May 2001 B1
6397070 Black May 2002 B1
6405043 Jensen et al. Jun 2002 B1
6446236 McEwen et al. Sep 2002 B1
6449463 Schiff Sep 2002 B1
6519705 Leung Feb 2003 B1
6532563 Nobelen Mar 2003 B2
6539065 Furukawa Mar 2003 B1
6553231 Karlsson et al. Apr 2003 B1
6560744 Burshtein May 2003 B1
6560774 Gordon et al. May 2003 B1
6574211 Padovani et al. Jun 2003 B2
6597705 Rezaiifar et al. Jul 2003 B1
6597923 Vanghi et al. Jul 2003 B1
6597932 Tian et al. Jul 2003 B2
6603746 Larijani et al. Aug 2003 B1
6611507 Hottinen et al. Aug 2003 B1
6621454 Reudink et al. Sep 2003 B1
6628956 Bark et al. Sep 2003 B2
6643520 Park et al. Nov 2003 B1
6697634 Hayashi Feb 2004 B1
6711150 Vanghi Mar 2004 B1
6711515 Lehtinen et al. Mar 2004 B1
6717976 Shen Apr 2004 B1
6721373 Frenkel et al. Apr 2004 B1
6744743 Walton et al. Jun 2004 B2
6745045 Terry et al. Jun 2004 B2
6751444 Meiyappan Jun 2004 B1
6763244 Chen et al. Jul 2004 B2
6801515 Ishikawa et al. Oct 2004 B1
6801759 Saifuddin Oct 2004 B1
6807164 Almgren et al. Oct 2004 B1
6895245 Wallentin May 2005 B2
6950669 Simonsson Sep 2005 B2
6952591 Budka et al. Oct 2005 B2
6968201 Gandhi et al. Nov 2005 B1
6977912 Porter et al. Dec 2005 B1
7012912 Naguib et al. Mar 2006 B2
7054275 Kim et al. May 2006 B2
7058421 Ngai et al. Jun 2006 B2
7062288 Raaf et al. Jun 2006 B2
7072315 Liu et al. Jul 2006 B1
7103316 Hall Sep 2006 B1
7145935 Won et al. Dec 2006 B2
7158450 Wada et al. Jan 2007 B2
7158504 Kadaba et al. Jan 2007 B2
7181170 Love et al. Feb 2007 B2
7184381 Ohkubo et al. Feb 2007 B2
7197692 Sutivong et al. Mar 2007 B2
7215653 Kim et al. May 2007 B2
7224993 Meyers et al. May 2007 B2
7254158 Agrawal Aug 2007 B2
7302276 Bernhardsson et al. Nov 2007 B2
7310526 Sang et al. Dec 2007 B2
7324785 Hansen et al. Jan 2008 B2
7349667 Magee et al. Mar 2008 B2
7359727 Tsien et al. Apr 2008 B2
7359838 Marro et al. Apr 2008 B2
7400887 Azman et al. Jul 2008 B2
7418241 Bao et al. Aug 2008 B2
7420939 Laroia et al. Sep 2008 B2
7477920 Scheinert et al. Jan 2009 B2
7536626 Sutivong et al. May 2009 B2
7594151 Sutivong et al. Sep 2009 B2
7639943 Kalajan Dec 2009 B1
7808895 Nalawadi et al. Oct 2010 B2
7962826 Sutivong et al. Jun 2011 B2
7965789 Khandekar et al. Jun 2011 B2
8095166 Sampath et al. Jan 2012 B2
8116800 Gorokhov et al. Feb 2012 B2
8150448 Farnsworth et al. Apr 2012 B2
8442572 Borran et al. May 2013 B2
8452316 Sutivong et al. May 2013 B2
20010040880 Chen et al. Nov 2001 A1
20010055968 Yoshida et al. Dec 2001 A1
20020018446 Huh et al. Feb 2002 A1
20020077985 Kobata et al. Jun 2002 A1
20020102984 Furuskar et al. Aug 2002 A1
20020145968 Zhang et al. Oct 2002 A1
20020167907 Sarkar et al. Nov 2002 A1
20020187801 Vanghi Dec 2002 A1
20020196766 Hwang et al. Dec 2002 A1
20030012425 Suzuki et al. Jan 2003 A1
20030013451 Walton Jan 2003 A1
20030016770 Trans et al. Jan 2003 A1
20030069014 Raffel et al. Apr 2003 A1
20030081538 Walton et al. May 2003 A1
20030086371 Walton et al. May 2003 A1
20030128705 Yi et al. Jul 2003 A1
20030185159 Seo et al. Oct 2003 A1
20030185285 Talwar Oct 2003 A1
20040038699 Toono Feb 2004 A1
20040062192 Liu et al. Apr 2004 A1
20040077370 Dick et al. Apr 2004 A1
20040081121 Xu Apr 2004 A1
20040095880 Laroia et al. May 2004 A1
20040109432 Laroia et al. Jun 2004 A1
20040151109 Batra et al. Aug 2004 A1
20040166886 Laroia et al. Aug 2004 A1
20040166887 Laroia et al. Aug 2004 A1
20040166900 Qiu et al. Aug 2004 A1
20050002324 Sutivong et al. Jan 2005 A1
20050013283 Yoon et al. Jan 2005 A1
20050026624 Gandhi et al. Feb 2005 A1
20050037796 Tsai et al. Feb 2005 A1
20050096061 Ji et al. May 2005 A1
20050113106 Duan et al. May 2005 A1
20050135457 Molisch et al. Jun 2005 A1
20050147063 Pi et al. Jul 2005 A1
20050153690 Marinier et al. Jul 2005 A1
20050176455 Krishnan et al. Aug 2005 A1
20050192042 Au et al. Sep 2005 A1
20050276248 Butala et al. Dec 2005 A1
20060009226 Vicharelli et al. Jan 2006 A1
20060019496 Onishi et al. Jan 2006 A1
20060019694 Sutivong et al. Jan 2006 A1
20060025158 Leblanc et al. Feb 2006 A1
20060034173 Teague et al. Feb 2006 A1
20060089154 Laroia et al. Apr 2006 A1
20060105796 Malladi et al. May 2006 A1
20060135080 Khandekar et al. Jun 2006 A1
20060135169 Sampath et al. Jun 2006 A1
20060164993 Teague et al. Jul 2006 A1
20060165650 Pavone et al. Jul 2006 A1
20060171326 Durand et al. Aug 2006 A1
20060187885 Roy et al. Aug 2006 A1
20060189344 Umesh et al. Aug 2006 A1
20060209721 Mese et al. Sep 2006 A1
20060211441 Mese et al. Sep 2006 A1
20060234752 Mese et al. Oct 2006 A1
20060262868 Leshem Nov 2006 A1
20060285503 Mese et al. Dec 2006 A1
20070030827 Rui et al. Feb 2007 A1
20070081491 Kim et al. Apr 2007 A1
20070150799 Sutivong et al. Jun 2007 A1
20070161385 Anderson Jul 2007 A1
20070249363 Amalfitano et al. Oct 2007 A1
20070258525 Jacobsen et al. Nov 2007 A1
20070270100 Agrawal et al. Nov 2007 A1
20070274257 Bae et al. Nov 2007 A1
20070280170 Kawasaki Dec 2007 A1
20070286105 Kim et al. Dec 2007 A1
20070286128 Bae et al. Dec 2007 A1
20080014980 Yano et al. Jan 2008 A1
20080031380 Takabayashi Feb 2008 A1
20080037439 Cave et al. Feb 2008 A1
20080039129 Li et al. Feb 2008 A1
20080043880 Matsushita Feb 2008 A1
20080045260 Muharemovic et al. Feb 2008 A1
20080056181 Imamura et al. Mar 2008 A1
20080117833 Borran et al. May 2008 A1
20080117849 Borran et al. May 2008 A1
20080161033 Borran et al. Jul 2008 A1
20080165675 Yang et al. Jul 2008 A1
20080166976 Rao Jul 2008 A1
20080214121 Sutivong et al. Sep 2008 A1
20080267067 Salazar et al. Oct 2008 A1
20080291856 Li et al. Nov 2008 A1
20090023466 Sutivong et al. Jan 2009 A1
20090082052 Bhushan et al. Mar 2009 A1
20090109939 Bhushan et al. Apr 2009 A1
20090117931 Shin et al. May 2009 A1
20100027451 Khandekar et al. Feb 2010 A1
20100061243 Yi et al. Mar 2010 A1
20110105111 Plestid et al. May 2011 A1
20110282999 Teague et al. Nov 2011 A1
20120083302 Borran et al. Apr 2012 A1
20120270582 Mese et al. Oct 2012 A1
20130107740 Mese et al. May 2013 A1
Foreign Referenced Citations (110)
Number Date Country
2340201 Jan 2001 CA
2635291 Oct 2007 CA
199500144 Dec 1995 CL
184195 Jul 1996 CL
199701119 Mar 1998 CL
199800442 Nov 1998 CL
33582005 Dec 2006 CL
04992006 Feb 2007 CL
47.478 Oct 2011 CL
1190848 Aug 1998 CN
1250342 Apr 2000 CN
0889663 Jan 1999 EA
0668662 Aug 1995 EP
0673125 Sep 1995 EP
0715423 Jun 1996 EP
0767548 Apr 1997 EP
0955736 Nov 1999 EP
1315310 May 2003 EP
1320276 Jun 2003 EP
1515475 Mar 2006 EP
2378858 Feb 2003 GB
2000040999 Feb 2000 JP
2000504529 Apr 2000 JP
2001044926 Feb 2001 JP
2001274748 Oct 2001 JP
2001285193 Oct 2001 JP
2001519618 Oct 2001 JP
2001358649 Dec 2001 JP
2002026747 Jan 2002 JP
2002501353 Jan 2002 JP
2002506334 Feb 2002 JP
2002077985 Mar 2002 JP
2003032218 Jan 2003 JP
2003505973 Feb 2003 JP
2003510950 Mar 2003 JP
200318818 Nov 2003 JP
2004064142 Feb 2004 JP
2004080340 Mar 2004 JP
2004104293 Apr 2004 JP
2004215914 Jul 2004 JP
2004253899 Sep 2004 JP
2004260467 Sep 2004 JP
2004503126 Sep 2004 JP
20044533188 Oct 2004 JP
2005501444 Jan 2005 JP
2005502218 Jan 2005 JP
2005505954 Feb 2005 JP
2005065182 Mar 2005 JP
2005348433 Dec 2005 JP
2005537691 Dec 2005 JP
2005538650 Dec 2005 JP
2007518361 Jul 2007 JP
2008503925 Feb 2008 JP
2008526136 Jul 2008 JP
52008533924 Aug 2008 JP
4522634 Jun 2010 JP
2010200474 Sep 2010 JP
100262027 Jul 2000 KR
200228664 Apr 2002 KR
20030004985 Jan 2003 KR
20030024442 Mar 2003 KR
200427165 Apr 2004 KR
20040088982 Oct 2004 KR
200153 Oct 1993 RU
2120183 Oct 1998 RU
2163053 Feb 2001 RU
2198465 Feb 2003 RU
2214680 Oct 2003 RU
2214690 Oct 2003 RU
2277762 Jun 2006 RU
2360364 Jun 2006 RU
462155 Nov 2001 TW
508910 Nov 2002 TW
546927 Aug 2003 TW
584996 Apr 2004 TW
WO94237381 Nov 1994 WO
WO9824198 Jun 1998 WO
WO9830057 Jul 1998 WO
WO9918689 Apr 1999 WO
WO9935865 Jul 1999 WO
WO9945736 Sep 1999 WO
WO0014900 Mar 2000 WO
WO0055976 Sep 2000 WO
WO0108325 Feb 2001 WO
WO0117158 Mar 2001 WO
WO0120808 Mar 2001 WO
0124402 Apr 2001 WO
WO0178291 Oct 2001 WO
WO0182504 Nov 2001 WO
WO0232179 Apr 2002 WO
WO0239609 May 2002 WO
WO0249305 Jun 2002 WO
WO02091597 Nov 2002 WO
WO03034645 Apr 2003 WO
203085878 Oct 2003 WO
WO2004025869 Mar 2004 WO
WO2004025946 Mar 2004 WO
WO2004032548 Apr 2004 WO
WO2004042954 May 2004 WO
WO2004059874 Jul 2004 WO
WO2004104530 Dec 2004 WO
WO2004105294 Dec 2004 WO
2005034545 Apr 2005 WO
WO2006007318 Jan 2006 WO
WO2006012376 Feb 2006 WO
WO2007014037 Feb 2007 WO
WO2007050846 May 2007 WO
WO2007112141 Oct 2007 WO
WO2007146891 Dec 2007 WO
WO2008030826 Mar 2008 WO
Non-Patent Literature Citations (17)
Entry
Bowie, Song, et al., “Iterative Joint Channel Estimation and Signal Detection in MIMO OFDM Systems,” Institute of Image Communication and Information Processing, Shanghai Jiao Tong University Shanghai, China, 2005, pp. 39-43.
Damnjanovic and Vanghi, “IS-2000 Enhanced Closed Loop Power Control for Turbo Coding,” IEEE 54th Vehicular Technology Proceedings, Oct. 7-11, 2001, pp. 2314- 2318, XP-010562383.
Elmusrati, et al., “Multi-Objective Distributed Power Control Algorithm,” Vehicular Technology Conference Proceedings VTC 2002 Fall IEEE 56th, vol. 2. pp. 812-816.
Hosein, “Interference Management of OFDM Uplinks,” IEEE 65th Vehicular Technology Conference, VTC2007-Spring, pp. 2435-2439, Apr. 22-25, 2007.
International Search Report—PCT/US05/020087, International Search Authority—European Patent Office, Oct. 4, 2005.
L.M. Nevdyaev, Telecommunication Technologies, Moscow, Svyaz' I Biznes, 2002, p. 209.
Roberto Padovani, “The Application of Spread Spectrum to PCS has Become a Reality Reverse Link Performance of IS-95 Based Cellular Systems,” IEEE Personal Communication, US, IEEE Communications Society, vol. 1. No. 3, Jul. 1, 1994, pp. 28-34.
Shao, L. et al.; “Downlink multicell MIMO-OFDM: An architecture for next generation wireless networks,” in Proc. IEEE Wireless Commun. and Networking Conf. (WCNC), vol. 2, Santa Clara, USA, Mar. 2005, pp. 1120-1125.
Taiwan Search Report—TW094120047—TIPO—Jul. 31, 2011.
Tanaka et al., Fast initial acquisition of transmitter power for the reverse link DS/CDMA cellular systems, May 1998, IEEE Vehicular Technology Conference, p. 2436-2440.
Telecommunications Industry Association, “Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System,” TIA/EIA-95, Jul. 1993.
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).
U.S. Appl. No. 60/516,557, “Layered Frequency Hopping for OFDMA”, filed on Oct. 30, 2003 by Ji et al., 6 pages.
Written Opinion—PCT/US05/020087, International Search Authority—European Patent Office, Oct. 4, 2005.
C30-20060327-023 “QUALCOMM Propose for 3GPP2 Air Interface Evolution Phase 2”, Dallas, TX, Mar. 2006.
Qualcomm Incorporated: OFDD Technology Overview Presentation, IEEE 802.20 Working Group on Mobile 2 Broadband Wireless Access, 0802.20-05-59, Nov. 2005, XP002518165, Retrieved from Internet. URL:http://grouper.ieee.org/groups/802/20/Contributions.html pp. 45-47. Oct. 28, 2005.
Tomck J., “OFD and OTDD :Technology Overview”, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, XP002480491, Oct. 28, 2005, pp. 1, 61-106, Retrieved from Internet: URL: http://gourper.iee.org/gourps/802/20/Contributions.html.
Related Publications (1)
Number Date Country
20110296279 A1 Dec 2011 US
Provisional Applications (1)
Number Date Country
60580819 Jun 2004 US
Divisions (1)
Number Date Country
Parent 11676563 Feb 2007 US
Child 13206206 US
Continuations (1)
Number Date Country
Parent 10890717 Jul 2004 US
Child 11676563 US