1. Field
The present invention relates to wireless communication systems generally, and specifically to traffic interference cancellation in wireless communication systems.
2. Background
A communication system may provide communication between base stations and access terminals. Forward link or downlink refers to transmission from a base station to an access terminal. Reverse link or uplink refers to transmission from an access terminal to a base station. Each access terminal may communicate with one or more base stations on the forward and reverse links at a given moment, depending on whether the access terminal is active and whether the access terminal is in soft handoff.
The features, nature, and advantages of the present application may be more apparent from the detailed description set forth below with the drawings. Like reference numerals and characters may identify the same or similar objects.
Any embodiment described herein is not necessarily preferable or advantageous over other embodiments. While various aspects of the present disclosure are presented in drawings, the drawings are not necessarily drawn to scale or drawn to be all-inclusive.
Access terminals 106 may be mobile or stationary and may be dispersed throughout the communication system 100 of
The system 100 provides communication for a number of cells, where each cell is serviced by one or more base stations 104. A base station 104 may also be referred to as a base station transceiver system (BTS), an access point, a part of an access network, a modem pool transceiver (MPT), or a Node B. Access network refers to network equipment providing data connectivity between a packet switched data network (e.g., the Internet) and the access terminals 106.
Forward link (FL) or downlink refers to transmission from a base station 104 to an access terminal 106. Reverse link (RL) or uplink refers to transmission from an access terminal 106 to a base station 104.
A base station 104 may transmit data to an access terminal 106 using a data rate selected from a set of different data rates. An access terminal 106 may measure a signal-to-noise-and-interference ratio (SINR) of a pilot signal sent by the base station 104 and determine a desired data rate for the base station 104 to transmit data to the access terminal 106. The access terminal 106 may send data request channel or Data rate control (DRC) messages to the base station 104 to inform the base station 104 of the desired data rate.
The system controller 102 (also referred to as a base station controller (BSC)) may provide coordination and control for base stations 104, and may further control routing of calls to access terminals 106 via the base stations 104. The system controller 102 may be further coupled to a public switched telephone network (PSTN) via a mobile switching center (MSC), and to a packet data network via a packet data serving node (PDSN).
The communication system 100 may use one or more communication techniques, such as code division multiple access (CDMA), IS-95, High Rate Packet Data (HRPD), also referred to as High Data Rate (HDR), as specified in “cdma2000 High Rate Packet Data Air Interface Specification,” TIA/EIA/IS-856, CDMA 1× Evolution Data Optimized (EV-DO), 1×EV-DV, Wideband CDMA (WCDMA), Universal Mobile Telecommunications System (UMTS), Time Division Synchronous CDMA (TD-SCDMA), Orthogonal Frequency Division Multiplexing (OFDM), etc. The examples described below provide details for clarity of understanding. The ideas presented herein are applicable to other systems as well, and the present examples are not meant to limit the present application.
A data source 200 provides data to an encoder 202, which encodes data bits using one or more coding schemes to provide coded data chips. Each coding scheme may include one or more types of coding, such as cyclic redundancy check (CRC), convolutional coding, Turbo coding, block coding, other types of coding, or no coding at all. Other coding schemes may include automatic repeat request (ARQ), hybrid ARQ (H-ARQ), and incremental redundancy repeat techniques. Different types of data may be coded with different coding schemes. An interleaver 204 interleaves the coded data bits to combat fading.
A modulator 206 modulates coded, interleaved data to generate modulated data. Examples of modulation techniques include binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK). The modulator 206 may also repeat a sequence of modulated data or a symbol puncture unit may puncture bits of a symbol. The modulator 206 may also spread the modulated data with a Walsh cover (i.e., Walsh code) to form data chips. The modulator 206 may also time-division multiplex the data chips with pilot chips and MAC chips to form a stream of chips. The modulator 206 may also use a pseudo random noise (PN) spreader to spread the stream of chips with one or more PN codes (e.g., short code, long code).
A baseband-to-radio-frequency (RF) conversion unit 208 may convert baseband signals to RF signals for transmission via an antenna 210 over a wireless communication link to one or more base stations 104.
One or more antennas 300 receive the reverse link modulated signals from one or more access terminals 106. Multiple antennas may provide spatial diversity against deleterious path effects such as fading. Each received signal is provided to a respective receiver or RF-to-baseband conversion unit 302, which conditions (e.g., filters, amplifies, downconverts) and digitizes the received signal to generate data samples for that received signal.
A demodulator 304 may demodulate the received signals to provide recovered symbols. For CDMA2000, demodulation tries to recover a data transmission by (1) channelizing the despread samples to isolate or channelize the received data and pilot onto their respective code channels, and (2) coherently demodulating the channelized data with a recovered pilot to provide demodulated data. Demodulator 304 may include a received sample buffer 312 (also called joint front-end RAM (FERAM) or sample RAM) to store samples of received signals for all users/access terminals, a rake receiver 314 to despread and process multiple signal instances, and a demodulated symbol buffer 316 (also called back-end RAM (BERAM) or demodulated symbol RAM). There may be a plurality demodulated symbol buffers 316 to correspond to the plurality of users/access terminals.
A deinterleaver 306 deinterleaves data from the demodulator 304.
A decoder 308 may decode the demodulated data to recover decoded data bits transmitted by the access terminal 106. The decoded data may be provided to a data sink 310.
Although interference cancellation at a base station 104 is described below, the concepts herein may be applied to an access terminal 106 or any other component of a communication system.
Traffic Interference Cancellation
The capacity of a CDMA reverse link may be limited by the interference between users since the signals transmitted by different users are not orthogonal at the BTS 104. Therefore, techniques that decrease the interference between users will improve the system performance of a CDMA reverse link. Techniques are described herein for the efficient implementation of interference cancellation for advanced CDMA systems such as CDMA2000 1×EV-DO RevA.
Each DO RevA user transmits traffic, pilot, and overhead signals, all of which may cause interference to other users. As
Bits of a data packet from the data source 200 may be repeated and processed by the encoder 202, interleaver 204 and/or modulator 206 into a plurality of corresponding “subpackets” for transmitting to the base station 104. If the base station 104 receives a high signal-to-noise-ratio signal, the first subpacket may contain sufficient information for the base station 104 to decode and derive the original data packet. For example, a data packet from the data source 200 may be repeated and processed into four subpackets. The user terminal 106 sends a first subpacket to the base station 104. The base station 104 may have a relatively low probability of correctly decoding and deriving the original data packet from the first received subpacket. But as the base station 104 receives the second, third and fourth subpackets and combines information derived from each received subpacket, the probability of decoding and deriving the original data packet increases. As soon as the base station 104 correctly decodes the original packet (e.g., using a cyclic redundancy check (CRC) or other error detection techniques), the base station 104 sends an acknowledgement signal to the user terminal 106 to stop sending subpackets. The user terminal 106 may then send a first subpacket of a new packet.
The reverse link of DO-RevA employs H-ARQ (
The gains from interference cancellation depend on the order in which signals are removed from the FERAM 312. Techniques are disclosed herein related to decoding (and subtracting if CRC passes) users based on traffic-to-pilot (T2P) ratios, effective SINR, or probability of decoding. Various approaches are disclosed herein for re-attempting the demodulation and decoding of users after others have been removed from the FERAM 312. Interference cancellation from the BTS FERAM 312 may be efficiently implemented to account for asynchronous CDMA systems, such as EV-DO RevA, where users transmit pilot signals, control signals, and traffic signals using Hybrid-ARQ. This disclosure may also apply to EV-DV Rel D, W-CDMA EUL, and cdma2000.
Traffic interference cancellation (TIC) may be defined as subtractive interference cancellation which removes the contribution of a user's data to the FERAM 312 after that user has decoded correctly (
Multi-user detection is the main category of algorithms under which TIC falls, and refers to any algorithm which attempts to improve performance by allowing the detection of two different users to interact. A TIC method may involve a hybrid of successive interference cancellation (also called sequential interference cancellation or SIC) and parallel interference cancellation. “Successive interference cancellation” refers to any algorithm which decodes users sequentially and uses the data of previously decoded users to improve performance. “Parallel interference cancellation” refers broadly to decoding users at the same time and subtracting all decoded users at the same time.
TIC may be different than pilot interference cancellation (PIC). One difference between TIC and PIC is that the transmitted pilot signal is known perfectly by the receiver in advance. Therefore, PIC may subtract the pilot contribution to the received signal using only channel estimates. A second major difference is that the transmitter and the receiver interact closely on the traffic channel through the H-ARQ mechanism. The receiver does not know the transmitted data sequence until a user is successfully decoded.
Similarly, it is desirable to remove overhead channels from the front-end RAM, in a technique called overhead interference cancellation (OIC). Overhead channels cannot be removed until the BTS 104 knows the transmitted overhead data, and this is determined by decoding and then reforming the overhead messages.
Successive interference cancellation defines a class of methods. The chain rule of mutual information shows that, under ideal conditions, successive interference cancellation may achieve the capacity of a multiple access channel. The main conditions for this are that all users are frame synchronous and each user's channel may be estimated with negligible error.
The receiver process signals from the users in decreasing order by transmit power. Starting with k=1 (user 1 with highest power), the receiver attempts to decode for user 1. If decoding is successful, then user 1's contribution to the received signal is formed and subtracted based on his channel estimate. This may be called frame synchronous sequential interference cancellation. The receiver continues until decoding has been attempted for all users. Each user has the same SINR after interference cancellation of the previously decoded users' successive interference cancellation.
Unfortunately, this approach may be very sensitive to decoding errors. If a single large power user, such as user 1, does not decode correctly, the signal-to-interference-plus-noise ratio (SINR) of all following users may be severely degraded. This may prevent all users after that point from decoding. Another drawback of this approach is that it requires users to have particular relative powers at the receiver, which is difficult to ensure in fading channels.
Frame Asynchronism and Interference Cancellation, e.g. cdma2000
Suppose that user frame offsets are intentionally staggered with respect to each other. This frame asynchronous operation has a number of benefits to the system as a whole. For example, processing power and network bandwidth at the receiver would then have a more uniform usage profile in time. In contrast, frame synchronism among users requires a burst of processing power and network resources at the end of each frame boundary since all users would finish a packet at the same time. With frame asynchronism, the BTS 104 may decode the user with the earliest arrival time first rather than the user with the largest power.
In another embodiment, the users in
A benefit of asynchronism and interference cancellation is the relative symmetry between users in terms of power levels and error statistics if they want similar data rates. In general sequential interference cancellation with equal user data rates, the last user is received with very low power and is also quite dependent of the successful decoding of all prior users.
Asynchronism, Hybrid ARQ and Interlacing, e.g. EV-DO RevA
Hybrid ARQ takes advantage of the time-varying nature of fading channels. If the channel conditions are good for the first 1, 2 or 3 subpackets, then the data frame may be decoded using only those subpackets, and the receiver sends an ACK to the transmitter. The ACK instructs the transmitter not to send the remaining subpacket(s), but rather to start a new packet if desired.
Receiver Architectures for Interference Cancellation
With TIC, the data of decoded users is reconstructed and subtracted (
The FERAM 312 stores received samples (e.g., at 2× chip rate) and is common to all users. A non-TIC receiver would only use a FERAM of about 1-2 slots (to accommodate delays in the demodulation process) since no subtraction of traffic or overhead interference takes place. In a TIC receiver for a system with H-ARQ, the FERAM may span many slots, e.g., 40 slots, and is updated by TIC through the subtraction of interference of decoded users. In another configuration, the FERAM 312 may have a length that spans less than a full packet, such as a length that spans a time period from a beginning of a subpacket of a packet to an end of a subsequent subpacket of the packet.
The BERAM 316 stores demodulated symbols of the received bits as generated by the demodulator's rake receiver 314. Each user may have a different BERAM, since the demodulated symbols are obtained by despreading with the user-specific PN sequence, and combining across RAKE fingers. Both a TIC and non-TIC receiver may use a BERAM 316. The BERAM 316 in TIC is used to store demodulated symbols of previous subpackets that are no longer stored in a FERAM 312 when the FERAM 312 does not span all subpackets. The BERAM 316 may be updated either whenever an attempt to decode takes place or whenever a slot exists from the FERAM 312.
Methods for Choosing the FERAM Length
The size of the BERAM 316 and FERAM 312 may be chosen according to various trade-offs between required processing power, transfer bandwidth from the memories to the processors, delays and performance of the system. In general, by using a shorter FERAM 312 the benefits of TIC will be limited, since the oldest subpacket will not be updated. On the other hand, a shorter FERAM 312 yields a reduced number of demodulations, subtractions and a lower transfer bandwidth.
With the RevA interlacing, a 16-slot packet (four subpackets, each subpacket transmitted in 4 slots) would span 40 slots. Therefore, a 40-slot FERAM may be used to ensure removal of a user from all affected slots.
In block 904, demodulator 304 demodulates samples of the chosen user's subpackets for some or all time segments stored in the FERAM 312 according to the user's spreading and scrambling sequence, as well as to its constellation size. In block 906, the decoder 308 attempts to decode the user packet using the previously demodulated symbols stored in BERAM 316 and the demodulated FERAM samples.
In block 910, the decoder 308 or another unit may determine whether the user(s)'s packet was successfully decoded, i.e., passes an error check, such as using a cyclic redundancy code (CRC).
If the user packet fails to decode, a NAK is sent back to the access terminal 106 in block 918. If the user packet is correctly decoded, an ACK is sent to the access terminal 106 in block 908 and interference cancellation (IC) is performed in blocks 912-914. Block 912 regenerates the user signal according to the decoded signal, the channel impulse response and the transmit/receive filters. Block 914 subtracts the contribution of the user from the FERAM 312, thus reducing its interference on users that have not yet been decoded.
Upon both failure and success in the decoding, the receiver moves to the next user to be decoded in block 916. When an attempt to decode has been performed on all users, a new slot is inserted into the FERAM 312 and the entire process is repeated on the next slot. Samples may be written into the FERAM 312 in real time, i.e., the 2× chip rate samples may be written in every ½ chip.
Methods for Choosing a Decoding Order
Block 903 indicates TIC may be applied either sequentially to each user or parallel to groups of users. As groups grow larger, the implementation complexity may decrease but the benefits of TIC may decrease unless TIC is iterated as described below.
The criteria according to which users are grouped and/or ordered may vary according to the rate of channel variation, the type of traffic and the available processing power. Good decoding orders may include first decoding users who are most useful to remove and who are most likely to decode. The criteria for achieving the largest gains from TIC may include:
A. Payload Size and T2P: The BTS 104 may group or order users according to the payload size, and decode in order starting from those with highest transmit power, i.e., highest T2P to those with lowest T2P. Decoding and removing high T2P users from the FERAM 312 has the greatest benefit since they cause the most interference to other users.
B. SINR: The BTS 104 may decode users with higher SINR before users with lower SINR since users with higher SINR have a higher probability of decoding. Also, users with similar SINR may be grouped together. In case of fading channels, the SINR is time varying throughout the packet, and so an equivalent SINR may be computed in order to determine an appropriate ordering.
C. Time: The BTS 104 may decode “older” packets (i.e., those for which more subpackets have been received at the BTS 104) before “newer” packets. This choice reflects the assumption that for a given T2P ratio and ARQ termination goal, packets are more likely to decode with each incremental subpacket.
Methods for Re-Attempting Decoding
Whenever a user is correctly decoded, its interference contribution is subtracted from the FERAM 312, thus increasing the potential of correctly decoding all users that share some slots. It is advantageous to repeat the attempt to decode users that previously failed, since the interference they see may have dropped significantly. The choose delay block 902 selects the slot (current or in the past) used as reference for decoding and IC. The choose users block 903 will select users that terminate a subpacket in the slot of the chosen delay. The choice of delay may be based on the following options:
A. Current decoding indicates a choice of moving to the next (future) slot once all users have been attempted for decoding, and the next slot is available in the FERAM 312. In this case, each user is attempted to be decoded once per processed slot, and this would correspond to successive interference cancellation.
B. Iterative decoding attempts to decode users more than once per processed slot. The second and subsequent decoding iteration will benefit from the canceled interference of decoded users on previous iterations. Iterative decoding yields gains when multiple users are decoded in parallel without intervening IC. With pure iterative decoding on the current slot, the choose delay block 902 would simply select the same slot (i.e., delay) multiple times.
C. Backward decoding: The receiver demodulates subpackets and attempts to decode a packet based on demodulating all available subpackets in the FERAM corresponding to that packet. After attempting to decode packets with a subpacket that terminates in the current time slot (i.e., users on the current frame offset), the receiver may attempt to decode packets that failed decoding in the previous slot (i.e., users on the previous frame offset). Due to the partial overlap among asynchronous users, the removed interference of subpackets that terminate in the current slot will improve the chances of decoding past subpackets. The process may be iterated by going back more slots. The maximum delay in the forward link ACK/NAK transmission may limit backward decoding.
D. Forward decoding: After having attempted to decode all packets with subpackets that terminate in the current slot, the receiver may also attempt to decode the latest users before their full subpacket is written into the FERAM. For example, the receiver could attempt to decode users after 3 of their 4 slots of the latest subpacket have been received.
Methods for Updating the BERAM
In a non-TIC BTS receiver, packets are decoded based solely on the demodulated symbols stored in the BERAM, and the FERAM is used only to demodulate users from the most recent time segments. With TIC, the FERAM 312 is still accessed whenever the receiver attempts to demodulate a new user. However, with TIC, the FERAM 312 is updated after a user is correctly decoded based on reconstructing and subtracting out that user's contribution. Due to complexity considerations, it may be desirable to choose the FERAM buffer length to be less than the span of a packet (e.g., 40 slots are required to span a 16-slot packet in EV-DO RevA). As new slots are written into the FERAM 312, they would overwrite the oldest samples in the circular buffer. Therefore, as new slots are received the oldest slots are overwritten and the decoder 308 will use BERAM 316 for these old slots. It should be noted that even if a given subpacket is located in the FERAM 312, the BERAM 316 may be used to store the demodulator's latest demodulated symbols (determined from the FERAM 312) for that subpacket as an intermediate step in the interleaving and decoding process. There are two main options for the update of the BERAM 316:
A. User-based update: The BERAM 316 for a user is updated only in conjunction with a decoding attempted for that user. In this case, the update of the older FERAM slots might not benefit the BERAM 316 for a given user if that user is not decoded at an opportune time (i.e., the updated FERAM slots might slide out of the FERAM 312 before that user is attempted to be decoded).
B. Slot-based update: In order to fully exploit the benefits of TIC, the BERAM 316 for all affected users may be updated whenever a slot exits FERAM 312. In this case, the content of BERAM 316 includes all the interference subtraction done on the FERAM 312.
Methods for Canceling Interference from Subpackets that Arrive Due to a Missed ACK Deadline
In general, the extra processing used by TIC introduces a delay in the decoding process, which is particularly relevant when either iterative or backward schemes are used. This delay may exceed the maximum delay at which the ACK may be sent to the transmitter in order to stop the transmission of subpackets related to the same packet. In this case, the receiver may still take advantage of successful decoding by using the decoded data to subtract not only the past subpackets but also those which will be received in the near future due to the missing ACK.
With TIC, the data of decoded users is reconstructed and subtracted so that the base station 104 may remove the interference it causes to other users' subpackets. With H-ARQ, whenever a new subpacket is received, decoding is attempted for the original packet. If decoding is successful, then for H-ARQ with TIC, the contribution of that packet may be canceled from the received samples by reconstructing and subtracting out the component subpackets. Depending on complexity considerations, it is possible to cancel interference from 1, 2, 3 or 4 subpackets by storing a longer history of samples. In general, IC may be applied either sequentially to each user or to groups of users.
At time instance n+12 slots, successive subpackets of the interlace arrive with interference cancellation of Users 1's decoded (unshaded) subpackets 2, 3 and 4. During time instance n+12 slots, packets from Users 2 and 3 successfully decode.
Joint Interference Cancellation of Pilot, Overhead, and Traffic Channels
A problem addressed by this section is related to improving system capacity of a CDMA RL by efficiently estimating and canceling multi-user interference at the base station receiver. In general, a RL user's signal consists of pilot, overhead and traffic channels. This section describes a joint pilot, overhead, and traffic IC scheme for all users.
There two aspects described. First, overhead IC (OIC) is introduced. On the reverse link, overhead from each user acts as interference to signals of all other users. For each user, the aggregate interference due to overheads by all other users may be a large percentage of the total interference experienced by this user. Removing this aggregate overhead interference may further improve system performance (e.g., for a CDMA2000 1×EV-DO RevA system) and increase reverse link capacity beyond performance and capacity achieved by PIC and TIC.
Second, important interactions among PIC, OIC, and TIC are demonstrated through system performance and hardware (HW) design tradeoffs. A few schemes are described on how to best combine all three cancellation procedures. Some may have more performance gain, and some may have more complexity advantage. For example, one of the described schemes removes all the pilot signals before decoding any overhead and traffic channels, then decodes and cancels the users' overhead and traffic channels in a sequential manner.
This section is based on CDMA2000 1× EV-DO RevA systems and in general applies to other CDMA systems, such as W-CDMA, CDMA2000 1×, and CDMA2000 1× EV-DV.
Methods for Overhead Channels Cancellation
Among the overhead channels, the data of the auxiliary pilot channel is known a priori at the receiver. Therefore, similar to primary pilot channel, no demodulation and decoding are necessary for this channel, and the auxiliary pilot channel may be reconstructed based on knowledge about the channel. The reconstructed auxiliary pilot may be at 2× chip rate resolution and may be represented as (over one segment)
where n corresponds to chipx1 sampling rate, f is the finger number, cf is the PN sequence, wf,aux is the Walsh code assigned to the auxiliary pilot channel, Gaux is the relative gain of this channel to the primary pilot, hf is the estimated channel coefficient (or channel response) which is assumed to be a constant over one segment, φ is the filter function or convolution of the transmit pulse and the receiver low-pass filter of chipx8 resolution (φ is assumed non-negligible in [−MTc, MTc]), γf is the chipx8 time offset of this finger with αf=γf mod 4 and δf=└γf/4┘.
The second group of overhead channels, which includes DRC, DSC, and RRI channels, are encoded by either bi-orthogonal codes or simplex codes. On the receiver side, for each channel, the demodulated outputs are first compared with a threshold. If the output is below the threshold, an erasure is declared and no reconstruction is attempted for this signal. Otherwise, they are decoded by a symbol-based maximum-likelihood (ML) detector, which may be inside the decoder 308 in
Compared with Eq. 1, there is one new term do which is the overhead channel data, wf,o is the Walsh cover, and Gaux represents the overhead channel gain relative to the primary pilot.
The remaining overhead channel is the 1-bit ACK channel. It may be BPSK modulated, un-coded and repeated over half a slot. The receiver may demodulate the signal and make a hard-decision on the ACK channel data. The reconstruction signal model may be the same as Eq. 2.
Another approach to reconstruct the ACK channel signal assumes the demodulated and accumulated ACK signal, after normalization, may be represented as:
y=x+z,
where x is the transmitted signal, and z is the scaled noise term with variance of σ2. Then, the log-likelihood ratio (LLR) of y is given as
Then, for the reconstruction purpose, a soft estimate of the transmitted bit may be:
where the tanh function may be tabulated. The reconstructed ACK signal is very similar to Eq. 2 but with the exception of replacing do by {circumflex over (x)}. In general, the soft estimate and cancellation approach should give a better cancellation performance since the receiver does not know the data for sure and this method brings the confidence level into picture. This approach in general may be extended to overhead channels mentioned above. However, the complexity of the maximum aposteriori probability (MAP) detector to obtain the LLR for each bit grows exponentially with the number of information bits in one code symbol.
One efficient way to implement overhead channel reconstruction is one finger, may scale each decoded overhead signal by its relative gain, cover it by the Walsh code, and sum them together, then spread by one PN sequence and filter through the channel-scaled filter hφ all at once. This method may save both computation complexity and memory bandwidth for subtraction purpose.
Joint PIC, OIC, and TIC
Joint PIC, OIC and TIC may be performed to achieve high performance and increase system capacity. Different decoding and cancellation orders of PIC, OIC and TIC may yield different system performance and different impacts on hardware design complexity.
PIC First Then OIC and TIC Together (First Scheme)
Block 1206 chooses a group G of undecoded users, e.g., whose packets or subpackets terminate at current slot boundary. Blocks 1208-1210 perform overhead/traffic channel demodulation and decoding. In block 1212, only the successfully decoded channel data will be reconstructed and subtracted from the front-end RAM (FERAM) 312 shared by all users. Block 1214 checks whether there are more users to decode. Block 1216 terminates the process.
The decoding/reconstruction/cancellation may be in a sequential fashion from one user in a group to the next user in the group, which may be called successive interference cancellation. In this approach, users in late decoding order of the same group benefits from the cancellations of users in earlier decoding order. A simplified approach is to decode all users in the same group first, and then subtract their interference contributions all at once. The second approach or scheme (described below) allows both lower memory bandwidth and more efficient pipeline architecture. In both cases, the users' packets which do not terminate at the same slot boundary but overlap with this group of packets benefit from this cancellation. This cancellation may account for a majority of the cancellation gain in an asynchronous CDMA system.
For example, consider that blocks 1204-1210 resulted in removing an initial signal estimate (e.g., pilot signal) P1[n] from the received samples. Then, based on a better channel estimate derived in block 1300, the method forms the revised signal estimate P2[n]. The method may then remove the incremental P2[n]−P1[n] difference from the sample locations in the RAM 312.
PIC First, Then OIC, and Then TIC (Second Scheme)
This second scheme is similar to
Joint Pilot/Overhead/Traffic Channel Cancellation (The Third Scheme)
Different from the first scheme (
For an attempted decoding user, the method first re-estimates the channel from the pilot (block 1402). The pilot sees less interference compared to the time (block 1402) when it was demodulated for power control due to interference cancellation of previously decoded packets which overlap with the to-be-decoded traffic packet. Therefore, the channel estimation quality is improved, which benefits both traffic channel decoding and cancellation performance. This new channel estimation is used for traffic channel decoding (block 1410) as well as certain overhead channel decoding (block 1408) (e.g., RRI channel in EV-DO). Once the decoding process is finished for one user at block 1412, the method will subtract this user's interference contribution from the FERAM 312, which includes its pilot channel and any decoded overhead/traffic channel.
Block 1414 checks whether there are more users to decode. Block 1416 terminates the process.
Tradeoffs Between the First and Third Schemes
It may appear that first scheme should have superior performance compared to the third scheme since the pilot signals are known at the BTS and it makes sense to cancel them in front. If both schemes are assumed to have the same cancellation quality, the first scheme may outperform the third scheme throughout all data rates. However, for the first scheme, since the pilot channel estimation sees higher interference than the traffic data demodulation, the estimated channel coefficients used for reconstruction purpose (for both pilot and overhead/traffic) may be noisier. However, for the third scheme, since the pilot channel estimation is redone right before the traffic data demodulation/decoding, the interference level seen by this refined channel estimation is the same as the traffic data demodulation. Then, on average, the cancellation quality of the third scheme may be better than the first scheme.
From a hardware design perspective, the third scheme may have a slight edge: the method may sum the pilot and decoded overhead and traffic channel data and cancel them together, therefore, this approach saves memory bandwidth. On the other hand, the re-estimation of pilot may be performed together with either overhead channel demodulation or traffic channel demodulation (in terms of reading samples from memory), and thus, there is no increase on memory bandwidth requirements.
If it is assumed that the first scheme has 80% or 90% cancellation quality of the third scheme, there are tradeoffs between data rate per user verse gain on number of users. In general, it favors the first scheme if all users are in low data rates region and the opposite if all high data rate users. The method may also re-estimate the channel from the traffic channel once one packet of data is decoded. The cancellation quality shall improve since the traffic channel operates at (much) higher SNR compared to the pilot channel.
Overhead channels may be removed (canceled) once they are demodulated successfully, and traffic channels may be removed once they have been demodulated and decoded successfully. It is possible that the base station could successfully demodulate/decode the overhead and traffic channels of all the access terminals at some point in time. If this (PIC, OIC, TIC) occurs, then the FERAM would only contain residual interference and noise. Pilot, overhead and traffic channel data may be canceled in various orders, and canceled for subsets of access terminals.
One approach is to perform interference cancellation (of any combination of PIC, TIC and OIC) for one user at a time from the RAM 312. Another approach is to (a) accumulate reconstructed signals (of any combination of PIC, TIC and OIC) for a group of users and (b) then perform interference cancellation for the group at the same time. These two approaches may be applied to any of the methods, schemes, and processes disclosed herein.
Improving Channel Estimation for Interference Cancellation
The ability to accurately reconstruct received samples may significantly affect system performance of a CDMA receiver that implements interference cancellation by reconstructing and removing various components of transmitted data. In a RAKE receiver, a multipath channel is estimated by PN despreading with respect to the pilot sequence and then pilot filtering (i.e., accumulating) over an appropriate period of time. The length of the pilot filtering is typically chosen as a compromise between increasing the estimation SNR by accumulating more samples, while not accumulating so long that the estimation SNR is degraded by the time variations of the channel. The channel estimate from the pilot filter output is then used to perform data demodulation.
As described above with
This section discloses several techniques for improving this overall channel estimation for interference cancellation in a CDMA receiver. These techniques may be applicable to CDMA2000, 1×EV-DO, 1×EV-DV, WCDMA.
To perform TIC of a packet that decodes correctly, the receiver in
Instead of using the pilot channel estimate, an improved channel estimate (at each RAKE finger delay) may be obtained by despreading with the reconstructed data chips themselves. This improved channel estimate is not useful for data demodulation of the packet since the packet has already decoded correctly, but is rather used solely for reconstructing the contribution of this packet to the front-end samples. With this technique, for each of the delays of the RAKE fingers (e.g., chipX8 resolution), the method may “despread” the received samples (e.g., interpolated to chipx8 ) with the reconstructed data chip stream and accumulate over an appropriate period of time. This will lead to improved channel estimation since the traffic channel is transmitted at higher power than the pilot channel (this traffic-to-pilot T2P ratio is a function of data rate). Using the data chips to estimate the channel for TIC may result in a more accurate channel estimate for the higher powered users who are the most important to cancel with high accuracy.
Instead of estimating the multipath channel at each of the RAKE finger delays, this section also describes a channel estimation procedure that would explicitly estimate a combined effect of the transmitter filter, multipath channel, and receiver filter. This estimate may be at the same resolution as the oversampled front-end samples (e.g. chipx2 FERAM). The channel estimate may be achieved by despreading the front-end samples with the reconstructed transmit data chips to achieve the T2P gain in channel estimation accuracy. The time span of the uniformly spaced channel estimates may be chosen based on information about the RAKE finger delays and an a priori estimate of a combined response of the transmitter and receiver filters. Furthermore, information from the RAKE fingers may be used to refine the uniformly spaced channel estimates.
where the complex path amplitudes are α1 with corresponding delays τ1. The combined effect of the transmitter and receiver filters may be defines as φ(t), where
φ(t)=p(t){circle around (x)}q(t) Equation 4
where {circle around (x)} denotes convolution. The combined φ(t) is often chosen to be similar to a raised cosine response. For example, in CDMA2000 and its derivatives, the response is similar to an example φ(t) displayed in
Despreading at RAKE Finger Delays with Regenerated Data Chips Instead of Pilot Chips
The quality of channel estimation has a direct impact on the fidelity of reconstructing a user's contribution to the received signal. In order to improve the performance of CDMA systems that implement interference cancellation, it is possible to use a user's reconstructed data chips to determine an improved channel estimate. This will improve the accuracy of the interference subtraction. One technique for CDMA systems may be described as “despreading with respect to a user's transmitted data chips” as opposed to the classical “despreading with respect to a user's transmitted pilot chips.”
Recall that the RAKE finger channel estimates in
Estimating the Composite Channel at FERAM Resolution with Regenerated Data Chips
Classical CDMA receivers may estimate the complex value of the multipath channel at each of the RAKE finger delays. The receiver front-end prior to the RAKE receiver may include a low pass receiver filter (i.e., q(t)) which is matched to the transmitter filter (i.e., p(t)). Therefore, for the receiver to implement a filter matched to the channel output, the RAKE receiver itself attempts to match to the multipath channel only (i.e., g(t)). The delays of the RAKE fingers are typically driven from independent time-tracking loops within minimum separation requirements (e.g., fingers are at least one chip apart). However, the physical multipath channel itself may often have energy at a continuum of delays. Therefore, one method estimates the composite channel (i.e., h(t)) at the resolution of the front-end samples (e.g., chipx2 FERAM).
With transmit power control on the CDMA reverse link, the combined finger SNR from all multipaths and receiver antennas is typically controlled to lie in a particular range. This range of SNR may result in a composite channel estimate derived from the despread pilot chips that has a relatively large estimation variance. That is why the RAKE receiver attempts to only place fingers at the “peaks” of the energy delay profile. But with the T2P advantage of despreading with reconstructed data chips, the composite channel estimation may result in a better estimate of h(t) than the direct estimate of g(t) combined with a model of φ (t).
A channel estimation procedure described herein explicitly estimates the combined effect of the transmitter filter, multipath channel, and receiver filter. This estimate may be at the same resolution as the oversampled front-end samples (e.g., chipx2 FERAM). The channel estimate may be achieved by despreading the front-end samples with the reconstructed transmit data chips to achieve the T2P gain in channel estimation accuracy. The time span of the uniformly spaced channel estimates may be chosen based on information about the RAKE finger delays and an a priori estimate of the combined response of the transmitter and receiver filters. Furthermore, information from the RAKE fingers may be used to refine the uniformly spaced channel estimates. Note that the technique of estimating the composite channel itself is also useful because it does not require the design to use an a priori estimate of φ (t).
In the description above, g(t) is the wireless multipath channel itself, while h(t) includes the wireless multipath channel as well as the transmitter and receiver filtering: h(t)=g(t) convolved with phi(t).
In the description above, “samples” may be at any arbitrary rate (e.g., twice per chip), but “data chips” are one per chip.
“Regenerated data chips” are formed by re-encoding, re-interleaving, re-modulating, and re-spreading, as shown in block 2006 of
“Reconstructed samples” represent the samples stored in FERAM 312 or in a separate memory from FERAM 312 in the receiver (e.g., twice per chip). These reconstructed samples are formed by convolving the (regenerated) transmitted data chips with a channel estimate.
The words “reconstructed” and “regenerated” may be used interchangeably if context is provided to either reforming the transmitted data chips or reforming the received samples. Samples or chips may be reformed, since “chips” are reformed by re-encoding, etc., whereas “samples” are reformed based on using the reformed chips and incorporating the effects of the wireless channel (channel estimate) and the transmitter and receiver filtering. Both words “reconstruct” and “regenerate” essentially mean to rebuild or reform. There is no technical distinction. One embodiment uses “regenerate” for data chips and “reconstruct” for samples exclusively. Then, a receiver may have a data chip regeneration unit and a sample reconstruction unit.
Adaptation of Transmit Subchannel Gains on the Reverse Link of CDMA Systems with Interference Cancellation
Multi-user interference is a limiting factor in a CDMA transmission system and any receiver technique that mitigates this interference may allow significant improvements in the achievable throughput. This section describes techniques for adapting the transmit subchannels gains of a system with IC.
In the reverse link transmission, each user transmits pilot, overhead and traffic signals. Pilots provide synchronization and estimation of the transmission channel. Overhead subchannels (such as RRI, DRC, DSC, and ACK) are needed for MAC and traffic decoding set-up. Pilot, overhead and traffic subchannels have different requirements on the signal to interference plus noise ratio (SINR). In a CDMA system, a single power control may adapt the transmit power of pilots, while the power of overhead and traffic subchannels has a fixed gain relative to the pilots. When the BTS is equipped with PIC, OIC and TIC, the various subchannels see different levels of interference depending on the order of ICs and the cancellation capabilities. In this case, a static relation between subchannel gains may hurt the system performance.
This section describes new gain control strategies for the different logical subchannels on a system that implements IC. The techniques are based on CDMA systems such as EV-DO RevA and may be applied to EV-DV Rel D, W-CDMA EUL, and cdma2000.
The described techniques implement power and gain control on different subchannels by adaptively changing the gain of each subchannel according to the measured performance in terms of packet error rate, SINR or interference power. The aim is to provide a reliable power and gain control mechanism that allows fully exploiting the potentials of IC while providing robustness for a transmission on a time-varying dispersive subchannel.
Interference cancellation refers to removing a contribution of logical subchannels to the front-end samples after those subchannels have been decoded, in order to reduce the interference on other signals that will be decoded later. In PIC, the transmitted pilot signal is known at the BTS and the received pilot is reconstructed using the channel estimate. In TIC or OIC, the interference is removed by reconstructing the received subchannel through its decoded version at the BTS.
Current BTS (with no IC) control the power of the pilot subchannel Ecp in order to meet the error rate requirements in the traffic channel. The power of the traffic subchannel is related to pilots by a fixed factor T2P, which depends on the payload type and target termination goals. The adaptation of the pilot power is performed by closed loop power control mechanism including an inner and outer loop. The inner loop aims at keeping the SINR of the pilots (Ecp/Nt) at a threshold level T, while the outer-loop power control changes the threshold level T, for example, based on packet error rate (PER).
When IC is performed at the receiver (
Important Parameters in a System with IC
Two parameters that may be adjusted are overhead subchannel gains and traffic to pilot (T2P) gain. When TIC is active, the overhead subchannel gains may be increased (relative to non-TIC), in order to allow a more flexible trade-off between the pilot and overhead performance. By denoting with G the baseline G used in the current system, the new value of the overhead channel gain will be:
G′=G·ΔG.
In no-IC schemes the overhead/pilot subchannels see the same interference level as the traffic channels and a certain ratio T2P/G may give satisfactory performance for both overhead and traffic channels performance as well as pilot channel estimations. When IC is used, the interference level is different for the overhead/pilots and traffic, and T2P may be reduced in order to allow coherent performance of the two types of subchannels. For a given payload, the method may let the T2P decrease by a factor ΔT2P with respect to the tabulated value, in order to satisfy the requirements. By denoting with T2P the baseline T2P used for a particular payload in the current system, the new value of T2P will be:
T2P′=T2P·ΔT2P
The parameter ΔT2P can be quantized into a set of finite or discrete values (e.g., −0.1 dB to −1.0 dB) and sent to the access terminal 106.
Some quantities that may be kept under control are traffic PER, pilot SINR, and rise over thermal. The pilot SINR should not drop under the minimum level desired for good channel estimation. Rise over thermal (ROT) is important to ensure the stability and the link-budget of the power controlled CDMA reverse link. In non-TIC receivers, ROT is defined on the received signal. In general, ROT should stay within a predetermined range to allow for a good capacity/coverage tradeoff.
Rise Over Thermal Control
I0 indicates the power of the signal at the input of the receiver. The cancellation of interference from the received signal yields a reduction of power. I0′ indicates the average power of the signal at input of the demodulator 304 after IC:
I0′≦I0.
The value of I0′ may be measured from the front-end samples after it has been updated with the IC. When IC is performed, the ROT is still important for the overhead subchannel, and ROT should be controlled with respect to a threshold, i.e. to ensure that
where N0 is the noise power.
However, traffic and some overhead subchannels benefit also from the IC. The decoding performance of these subchannels is related to the rise over thermal, measured after IC. Effective ROT is the ratio between the signal power after IC and the noise power. The effective ROT may be controlled by a threshold, i.e.,
The constraint on the ROTeff may be equivalently stated as a constraint on I0′, under the assumption that the noise level does not change:
I0′≦I0(thr),
where I0(thr) is the signal power threshold corresponding to ROTthr(eff).
Fixed Overhead Gain Techniques
When the ROT increases, the SINR of the pilot and overhead channels (which do not benefit from IC) decreases, leading to a potential increase in the erasure rate. In order to compensate for this effect, the overhead channel gains may be raised, either by a fixed value or by adaptation to the particular system condition.
Techniques are described where the gain of the overhead subchannel is fixed with respect to the pilots. The proposed techniques adapt both the level of pilot subchannel and the ΔT2P for each user.
Closed Loop Control of T2P with Fixed ΔG=0 dB
A. Inner and outer loops 2300, 2302 may perform power control in a conventional manner for the adaptation of Ecp. Outer loop 2300 receives target PER and traffic PER. Inner loop 2304 receives a threshold T 2302 and a measured pilot SINR and outputs Ecp.
B. A closed loop gain control (GC) 2306 adapts ΔT2P based on the measure of the removed interference. The gain control 2306 receives measured ROT and measured ROTeff and outputs ΔT2P. The receiver measures the interference removed by the IC scheme and adapts ΔT2P.
C. ΔT2P can be sent in a message to all access terminals 106 in a sector periodically.
For the adaptation of ΔT2P, if the interference after IC is reduced from I0 to I0′, the T2P can be consequently reduced of the quantity:
The Ecp will increase (through the PC loop 2304) as:
The ratio between the total transmit power for the system with and without IC will be:
where G is the overhead channel gain. For large values of T2P (with respect to G), the ratio C can be approximated as:
For the estimation of the effective ROT, the effective ROT changes rapidly due to both PC and changes in channel conditions. Instead, ΔT2P reflects slow variations of the ROTeff. Hence, for the choice of ΔT2P the effective ROT is measured by means of a long averaging window of the signal after IC. The averaging window may have a length at least twice as long as a power control update period.
Closed Loop Control of T2P with Fixed ΔG>0 dB
ACK-Based Control of ΔT2P
The closed loop GC of ΔT2P requires a feedback signal from the BTS to the AT, where all ATs receive the same broadcast value of ΔT2P from a BTS. An alternative solution is based on an open-loop GC of ΔT2P 2510 and a closed loop PC 2500, 2504 for the pilots. The closed loop pilot PC comprises an inner loop 2504, which adjusts the Ecp according to a threshold value To 2502. The outer loop control 2500 is directed by the erasure rate of the overhead subchannels, e.g., the data rate control (DRC) subchannel error probability or DRC erasure rate. To is increased whenever the DRC erasure rate exceeds a threshold, but is gradually decreased when the DRC erasure rate is below the threshold.
The ΔT2P is adapted through the ACK forward subchannel. In particular, by measuring the statistics of the ACK and NACK, the AT can evaluate the traffic PER (block 2508) at the BTS. A gain control 2510 compares target traffic PER and measured PER. Whenever the PER is higher than a threshold, the ΔT2P is increased, until T2P′ reached the baseline value T2P of the no-IC system. On the other hand, for a lower PER, the ΔT2P is decreased in order to fully exploit the IC process.
Variable Overhead Gain Techniques
A further optimization of the transceiver can be obtained by adapting not only ΔT2P but also the overhead subchannel gains (G overhead) to the IC process. In this case, an extra feedback signal is needed. The values of ΔG can be quantized from 0 dB to 0.5 dB.
Interference Power-Based Overhead Gain Control
ΔG may be controlled to not go under 0 dB since this would correspond to decrease the overhead subchannel power which is unlikely to be helpful.
The gain and power control scheme may include an inner and outer loop PC 2304, 2300 for Ecp, as in
DRC-Only Overhead Gain Control
Even when the overhead subchannel gain is adapted, the gain control of ΔT2P 2700 can be performed with a closed loop, as described above. In this case, the Ecp and ΔT2P are controlled as in the scheme of
Control of T2P in a Multi-Sector Multi-Cell Network
Since the GC of ΔT2P is performed on a cell level, and an AT 106 may be in softer hand-off, the various sectors may generate different requests of adaptation. In this case various options may be considered for the choice of the ΔT2P request to be sent to the AT. At a cell level, a method may choose the minimum reduction of T2P, among those requested by fully loaded sectors, i.e.,
where ΔT2P(s) is the ΔT2P required by the sector s. The AT may receive different requests from various cells, and also in this case, various criteria can be adopted. A method may choose the ΔT2P corresponding to the serving sector in order to ensure the most reliable communication with it.
For the choice of ΔT2P both at a cell and at the AT, other choices may be considered, including the minimum, maximum or mean among the requested values.
One important aspect is for the mobiles to use T2P′=T2P×ΔT2P, where ΔT2P is calculated at the BTS based on measurements of Io and Io′ (and possibly also knowledge of Iothr), and G′=G×ΔG, where ΔG is also calculated at the BTS. With these delta_factors calculated at the BTS, they are broadcast by each BTS to all the access terminals, who react accordingly.
The concepts disclosed herein may be applied to a WCDMA system, which uses overhead channels such as a dedicated physical control channel (DPCCH), an enhanced dedicated physical control channel (E-DPCCH), or a high-speed dedicated physical control channel (HS-DPCCH). The WCDMA system may use a dedicated physical data channel (DPDCH) format and/or an enhanced dedicated physical data channel (E-DPDCH) format.
The disclosed herein may be applied to WCDMA systems with two different interlace structures, e.g., a 2-ms transmit time interval and 10-ms transmit time interval. thus, a front-end memory, demodulator, and subtractor may be configured to span one or more subpackets of packets that have different transmit time intervals.
For TIC, the traffic data may be sent by one or more users in at least one of an EV-DO Release 0 format or an EV-DO Revision A format.
Specific decoding orders described herein may correspond to an order for demodulating and decoding. Re-decoding a packet should be from re-demodulation because the process of demodulating a packet from the FERAM 312 translates the interference cancellation into a better decoder input.
Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of skill in the art would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium. A storage medium is coupled to the processor such that the processor may read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.
Headings are included herein for reference and to aid in locating certain sections. These headings are not intended to limit the scope of the concepts described therein under, and these concepts may have applicability in other sections throughout the entire specification.
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.
The present application claims priority to co-assigned U.S. Provisional Application No. 60/638,666, entitled “TRAFFIC INTERFERENCE CANCELLATION AT THE BTS ON A CDMA REVERSE LINK,” filed on Dec. 23, 2004, which is incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4901307 | Gilhousen et al. | Feb 1990 | A |
5103459 | Gilhousen et al. | Apr 1992 | A |
5490165 | Blakeney, II et al. | Feb 1996 | A |
5506865 | Weaver, Jr. | Apr 1996 | A |
5644591 | Sutton | Jul 1997 | A |
5703905 | Langberg | Dec 1997 | A |
5764687 | Easton | Jun 1998 | A |
5781543 | Ault et al. | Jul 1998 | A |
5789973 | Barrett, Jr. et al. | Aug 1998 | A |
5805648 | Sutton | Sep 1998 | A |
5812600 | Hess et al. | Sep 1998 | A |
5953369 | Suzuki | Sep 1999 | A |
6002715 | Brailean et al. | Dec 1999 | A |
6009089 | Huang et al. | Dec 1999 | A |
6032026 | Seki et al. | Feb 2000 | A |
6034986 | Yellin | Mar 2000 | A |
6067292 | Huang et al. | May 2000 | A |
6067333 | Kim et al. | May 2000 | A |
6122309 | Bergstrom et al. | Sep 2000 | A |
6131013 | Bergstrom et al. | Oct 2000 | A |
6137788 | Sawahashi et al. | Oct 2000 | A |
6137843 | Chennakeshu et al. | Oct 2000 | A |
6154443 | Huang et al. | Nov 2000 | A |
6175587 | Madhow et al. | Jan 2001 | B1 |
6201799 | Huang et al. | Mar 2001 | B1 |
6233229 | Ranta et al. | May 2001 | B1 |
6259724 | Esmailzadeh | Jul 2001 | B1 |
6295289 | Ionescu et al. | Sep 2001 | B1 |
6333947 | van Heeswyk et al. | Dec 2001 | B1 |
6393302 | O'Byrne | May 2002 | B1 |
6459693 | Park et al. | Oct 2002 | B1 |
6459694 | Sari et al. | Oct 2002 | B1 |
6493541 | Gunnarsson et al. | Dec 2002 | B1 |
6496706 | Jouu et al. | Dec 2002 | B1 |
6498784 | Ozluturk et al. | Dec 2002 | B1 |
6570909 | Kansakoski et al. | May 2003 | B1 |
6574211 | Padovani et al. | Jun 2003 | B2 |
6580899 | Dalgleish et al. | Jun 2003 | B1 |
6603743 | Ozluturk et al. | Aug 2003 | B2 |
6618429 | Gilhousen et al. | Sep 2003 | B2 |
6621804 | Holtzman et al. | Sep 2003 | B1 |
6642883 | Jacomb-Hood et al. | Nov 2003 | B2 |
6654408 | Kadous et al. | Nov 2003 | B1 |
6661835 | Sugimoto et al. | Dec 2003 | B1 |
6680727 | Butler et al. | Jan 2004 | B2 |
6683908 | Cleveland | Jan 2004 | B1 |
6690712 | Kim et al. | Feb 2004 | B2 |
6691362 | Phillipson et al. | Feb 2004 | B1 |
6697347 | Ostman et al. | Feb 2004 | B2 |
6788733 | Whang et al. | Sep 2004 | B1 |
6832073 | Jang et al. | Dec 2004 | B2 |
6850506 | Holtzman et al. | Feb 2005 | B1 |
6865218 | Sourour | Mar 2005 | B1 |
6917642 | Rouphael et al. | Jul 2005 | B1 |
6940827 | Li et al. | Sep 2005 | B2 |
6950411 | Ozluturk et al. | Sep 2005 | B2 |
6961362 | Ariyoshi et al. | Nov 2005 | B2 |
6975666 | Affes et al. | Dec 2005 | B2 |
6996069 | Willenegger | Feb 2006 | B2 |
6999430 | Holtzman et al. | Feb 2006 | B2 |
6999794 | Lindskog et al. | Feb 2006 | B1 |
7016327 | Grilli et al. | Mar 2006 | B2 |
7020109 | Grilli et al. | Mar 2006 | B2 |
7035284 | Willenegger et al. | Apr 2006 | B2 |
7042968 | Jansen et al. | May 2006 | B1 |
7061967 | Schelm et al. | Jun 2006 | B2 |
7068637 | Saito et al. | Jun 2006 | B2 |
7069034 | Sourour | Jun 2006 | B1 |
7072321 | Holtzman et al. | Jul 2006 | B2 |
7072322 | Holtzman et al. | Jul 2006 | B2 |
7099378 | Dunyak et al. | Aug 2006 | B2 |
7103094 | Lotter et al. | Sep 2006 | B2 |
7120447 | Chheda et al. | Oct 2006 | B1 |
7126928 | Tiedemann et al. | Oct 2006 | B2 |
7139306 | Oates | Nov 2006 | B2 |
7158560 | Cleveland | Jan 2007 | B2 |
7164739 | Trott | Jan 2007 | B1 |
7177344 | Oates | Feb 2007 | B2 |
7177658 | Willenegger et al. | Feb 2007 | B2 |
7190749 | Levin et al. | Mar 2007 | B2 |
7197282 | Dent et al. | Mar 2007 | B2 |
7203220 | Baltersee et al. | Apr 2007 | B2 |
7206554 | Lindskog | Apr 2007 | B1 |
7209515 | Kilfoyle et al. | Apr 2007 | B2 |
7221699 | Lindskog | May 2007 | B1 |
7245600 | Chen | Jul 2007 | B2 |
7254171 | Hudson | Aug 2007 | B2 |
7254197 | Heo et al. | Aug 2007 | B2 |
7257101 | Petrus et al. | Aug 2007 | B2 |
7263082 | Lindskog | Aug 2007 | B1 |
7269389 | Petrus et al. | Sep 2007 | B2 |
7292552 | Willenegger et al. | Nov 2007 | B2 |
7295597 | Fitton et al. | Nov 2007 | B2 |
7299402 | Soong et al. | Nov 2007 | B2 |
7317750 | Shattil | Jan 2008 | B2 |
7318187 | Vayanos et al. | Jan 2008 | B2 |
7321780 | Love et al. | Jan 2008 | B2 |
7333420 | Higuchi et al. | Feb 2008 | B2 |
7336930 | Larsson et al. | Feb 2008 | B2 |
7352725 | Tiirola et al. | Apr 2008 | B2 |
7391803 | Hess et al. | Jun 2008 | B2 |
7394792 | Von Der Embse | Jul 2008 | B1 |
7394879 | Narayan et al. | Jul 2008 | B2 |
7406065 | Willenegger et al. | Jul 2008 | B2 |
7437135 | Pan et al. | Oct 2008 | B2 |
7450536 | Li et al. | Nov 2008 | B2 |
7486726 | Alexander et al. | Feb 2009 | B2 |
7486750 | Baier et al. | Feb 2009 | B1 |
7515877 | Chen et al. | Apr 2009 | B2 |
7583977 | Willenegger et al. | Sep 2009 | B2 |
7593746 | Willenegger et al. | Sep 2009 | B2 |
7623553 | Bhushan et al. | Nov 2009 | B2 |
7643452 | Grilli et al. | Jan 2010 | B2 |
7675944 | Grilli et al. | Mar 2010 | B2 |
7787389 | Chen et al. | Aug 2010 | B2 |
8010111 | Grilli et al. | Aug 2011 | B2 |
8171381 | Vayanos et al. | May 2012 | B2 |
8175090 | Vayanos et al. | May 2012 | B2 |
20010019961 | Nakahara et al. | Sep 2001 | A1 |
20010040874 | Saito et al. | Nov 2001 | A1 |
20020021682 | Ariyoshi et al. | Feb 2002 | A1 |
20020051433 | Affes et al. | May 2002 | A1 |
20020118727 | Kim et al. | Aug 2002 | A1 |
20020154717 | Shima et al. | Oct 2002 | A1 |
20020186755 | Kim et al. | Dec 2002 | A1 |
20030021334 | Levin et al. | Jan 2003 | A1 |
20030035404 | Ozluturk et al. | Feb 2003 | A1 |
20030052819 | Jacomb-Hood et al. | Mar 2003 | A1 |
20030142655 | Higuchi et al. | Jul 2003 | A1 |
20030202568 | Choi et al. | Oct 2003 | A1 |
20030227962 | Hintz-Madsen | Dec 2003 | A1 |
20030235238 | Schelm et al. | Dec 2003 | A1 |
20040001429 | Ma et al. | Jan 2004 | A1 |
20040062302 | Fujii et al. | Apr 2004 | A1 |
20040077322 | Garmonov et al. | Apr 2004 | A1 |
20040120282 | Ozluturk et al. | Jun 2004 | A1 |
20040146024 | Li et al. | Jul 2004 | A1 |
20040160924 | Narayan et al. | Aug 2004 | A1 |
20040184570 | Thomas et al. | Sep 2004 | A1 |
20040192208 | Kong et al. | Sep 2004 | A1 |
20040202104 | Ishii et al. | Oct 2004 | A1 |
20040219920 | Love et al. | Nov 2004 | A1 |
20040252753 | Li et al. | Dec 2004 | A1 |
20050002445 | Dunyak et al. | Jan 2005 | A1 |
20050013350 | Coralli et al. | Jan 2005 | A1 |
20050041626 | Tiirola et al. | Feb 2005 | A1 |
20050047484 | He et al. | Mar 2005 | A1 |
20050063332 | Holtzman et al. | Mar 2005 | A1 |
20050094675 | Bhushan et al. | May 2005 | A1 |
20050169205 | Grilli et al. | Aug 2005 | A1 |
20050185701 | George | Aug 2005 | A1 |
20050192042 | Au et al. | Sep 2005 | A1 |
20050193309 | Grilli et al. | Sep 2005 | A1 |
20050243898 | Reznik et al. | Nov 2005 | A1 |
20060007895 | Coralli et al. | Jan 2006 | A1 |
20060034218 | Ozluturk et al. | Feb 2006 | A1 |
20060062283 | Zhang et al. | Mar 2006 | A1 |
20060115014 | Jeong et al. | Jun 2006 | A1 |
20060141933 | Smee et al. | Jun 2006 | A1 |
20060141934 | Pfister et al. | Jun 2006 | A1 |
20060142041 | Tomasin et al. | Jun 2006 | A1 |
20060229017 | Larssonn et al. | Oct 2006 | A1 |
20070002724 | Khan | Jan 2007 | A1 |
20070004337 | Biswas et al. | Jan 2007 | A1 |
20070093261 | Hou et al. | Apr 2007 | A1 |
20070111664 | Levin et al. | May 2007 | A1 |
20070115890 | Yi et al. | May 2007 | A1 |
20070127558 | Banister | Jun 2007 | A1 |
20070135051 | Zheng et al. | Jun 2007 | A1 |
20070147329 | Soriagaa et al. | Jun 2007 | A1 |
20070165704 | Yang et al. | Jul 2007 | A1 |
20080032630 | Kim et al. | Feb 2008 | A1 |
20080130714 | Wilborn et al. | Jun 2008 | A1 |
20080141094 | Vayanos et al. | Jun 2008 | A1 |
20080141097 | Vayanos et al. | Jun 2008 | A1 |
20100172279 | Chen et al. | Jul 2010 | A1 |
20110069736 | Coralli et al. | Mar 2011 | A1 |
Number | Date | Country |
---|---|---|
1397112 | Feb 2003 | CN |
1554156 | Dec 2004 | CN |
0954112 | Nov 1999 | EP |
0980149 | Feb 2000 | EP |
1229668 | Aug 2002 | EP |
1365518 | Nov 2003 | EP |
2 384 660 | Jul 2003 | GB |
10247894 | Sep 1998 | JP |
11317725 | Nov 1999 | JP |
2000115131 | Apr 2000 | JP |
2000278204 | Oct 2000 | JP |
2001186106 | Jul 2001 | JP |
2001211104 | Aug 2001 | JP |
2001251242 | Sep 2001 | JP |
2002044017 | Feb 2002 | JP |
2002044053 | Feb 2002 | JP |
2002217871 | Aug 2002 | JP |
2002535915 | Oct 2002 | JP |
2003264501 | Sep 2003 | JP |
2004535083 | Nov 2004 | JP |
2005519567 | Jun 2005 | JP |
2005198223 | Jul 2005 | JP |
19980081861 | Nov 1998 | KR |
0326183 | Jun 2002 | KR |
2004-28772 | Apr 2004 | KR |
1020040045102 | Jun 2004 | KR |
2216851 | Nov 2003 | RU |
2002115625 | Feb 2004 | RU |
WO9642146 | Dec 1996 | WO |
0025442 | May 2000 | WO |
WO0049724 | Aug 2000 | WO |
0158046 | Aug 2001 | WO |
WO 02033840 | Apr 2002 | WO |
WO 0239597 | May 2002 | WO |
0245288 | Jun 2002 | WO |
02082681 | Oct 2002 | WO |
WO02080432 | Oct 2002 | WO |
WO 02099992 | Dec 2002 | WO |
2004045239 | May 2004 | WO |
2004064304 | Jul 2004 | WO |
2004070958 | Aug 2004 | WO |
WO2004100416 | Nov 2004 | WO |
WO2004114535 | Dec 2004 | WO |
WO2005025118 | Mar 2005 | WO |
Entry |
---|
Iwakiri, N., “Interference Reduction Efficiency of a Turbo Coded CDMA Multilayer System Equipped with a Pilot Canceler”, VTC 1999-Fall. IEEE VTS 50th. Vehicular Technology Conference, Gateway to the 21st Century Communications Village. Amsterdam, Sep. 19-22, 1999, IEEE Vehicular Technology Conference, New York, NY: IEEE, US, Vol. 1 Conf. 50, Sep. 1999, pp. 391-395, XP000929078. |
Song et al., “Optimum Partial Interference Cancelling Factor in Pilot Assistant Coherent OFDM System with Partial Power Training Sequence Synchronization” 14th IEEE 2003 International Symposium on Personal Indoor and Mobile Radio Communication Proceedings. |
Tinnakornsrisuphap et al., “On the Fairness and Stability of the Reverse-Link MAC Layer in CDMA2000 1XEV-Do” Communications, 2004 IEEE International Conference on Paris France Jun. 20-24, 2004, Piscataway NJ, USA, IEEE Jun. 20, 2004, pp. 144-148, XP0107103. |
3GPP2, TSG-C: “CDMA2000 High Rate Packet Data Air Interface Specification” (online) Mar. 2004, Ver., 1.0 pp. 14-65, XP002382113. |
International Search Report—PCT/US05/046744 International Search Authority—European Patent Office—Jun. 2, 2006. |
Written Opinion - PCT/US05/046744, International Search Authority—European Patent Office—Jun. 2, 2006. |
International Preliminary Report on Patentability—PCT/US05/046744, International Bureau of WIPO, Geneva, Switzerland Jun. 26, 2007. |
cdma2000 High Rate Packet Data Air Interface Specification, 3GPP2C. S0024-A V1.0, Mar. 2004, p. 14-1 to p. 14-65. |
Daisuke Takeda, Takashi Wakutsu, and Mutsumu Serizawa, “Performance of Feedback Parallel Canceller Using Turbo Code in Multipath Fading Channel,” Technical Report of IEICE. RCS, Radio Communications System, The Institute of Electronics, Information and Communication Engineers, Oct. 12, 2001, 101 (370), pp. 63-68. |
Miki, et al.,. “Multipath Interference Canceller Using Sofidecision Replica Combined with Hybrid ARQ in W-CDMA Forward Link,” IEEE 54th Vehicular Technology Conference, Proceedings, Atlantic City, NJ, USA Oct. 7-11, 2001, pp. 1992-1926, vol. 1 of 4, IEEE Vehicular Technology Conference, Conf. 54, New York, NY, USA, XP010562300. |
“Multipath Intereference Cancellation Scheme for Multicode CDMA Systems in Multipath Fading Channels”, Mar. 2004. |
Shousei Yoshida, and Akihisa USHiROKAWA, “CDMA Multi-Stage Interference Canceller with Recursive Channel Estimation Based on Symbol Replica Processing,”. Technical Report of IEICE. RCS, Radio Communications System. The Institute of Electronics, Information and Communication Engineers, Feb. 20, 1997, 96(530), pp. 57-62. |
Yoshihisa Kishiyama, Koichi Okawa, and Mamoru Sawahashi, “Experiments on Parallel-type Coherent Multi-stage Interference Canceller with Channel Estimation Using Pilot and Decision-feedback Data Symbols in W-CDMA Reverse Link, ” Technical Report of IEICE. RCS, Radio Communications System. The Institute of Electronics, Information and Communication Engineers, Oct. 6, 2000, 100(346), pp. 13-19. |
Han. B., “OFDM systems iterative joint channel estimation and symbol detection algorithm”, Communications Technology, vol. 24, No. 8, section 2-3, Aug. 2003. |
Taiwan Search Report—TW094146427—TIPO—Jan. 3, 2012. |
Andrew J. Viterbi , “CDMA: Principles of Spread Spectrum Communications”, Chapter 4, Addison Wesley Longman, Reading, MA., pp. 77-121, 1995. |
Jakes W. C., “Microwave Mobile Communications”, IEEE, 1974, pp. 11-78, Chapter 1, John Wiley & Sons, New York. |
TIA/EIA Interim Standard; Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System; TIA/EIA/IS-95-A Revision of TIA/EIA/IS-95, May 1995. (Part 1 pp.1-351). |
TIA/EIA Interim Standard; Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System; TIA/EIA/IS-95-A Revision of TIA/EIA/IS-95-A Revision of TIA/EIA/IS-95. May 1995. (Part 2 pp. 352-744). |
Pilot and Decision-feedback Data Symbols in W-CDMA Reverse Link, Technical Report of IEICE. RCS, Radio Communications System. The Institute of Electronics, Information and Communication Engineers, Oct. 6, 2000, 100(346), pp. 13-19. |
Number | Date | Country | |
---|---|---|---|
20060141935 A1 | Jun 2006 | US |
Number | Date | Country | |
---|---|---|---|
60638666 | Dec 2004 | US |