1. Field
The present invention relates to wireless communication and, in particular, relates to antenna interference cancellation.
2. Background
In a communication system, a transmitter processes data to generate a modulated signal and transmits the modulated signal on a frequency band/channel and via a communication channel to a receiver. The transmitted signal is distorted by the communication channel, corrupted by noise, and further degraded by co-channel interference, which is interference from other transmitters transmitting on the same frequency band/channel. The receiver receives the transmitted signal, processes the received signal, and attempts to recover the data sent by the transmitter. The distortion due to the communication channel, the noise, and the co-channel interference all hinder the receiver's ability to recover the transmitted data.
There is therefore a need in the art for a receiver that can effectively deal with co-channel interference and channel distortion.
A receiver comprising a hybrid demodulator that can be configured as an interference suppression (IS) demodulator on a first iteration and as a SAIC demodulator on a subsequent iteration is disclosed. This hybrid configuration can be utilized when a measured signal level associated with a received signal is below a threshold level.
According to one aspect of the subject technology, a receiver in a wireless communication system comprises an interference suppressor configured to suppress co-channel interference. The receiver can further comprise an equalizer configured to suppress intersymbol interference. The receiver can further comprise a controller configured to: a) control the equalizer to suppress intersymbol interference in a plurality of input samples of a received signal and provide a first set of detected bits based on a first set of reference bits comprising a training sequence on a first iteration; b) control the interference suppressor to suppress co-channel interference in the plurality of input samples and provide a set of suppressed samples based on a second set of reference bits comprising the first set of detected bits on a second iteration; and c) control the equalizer to suppress intersymbol interference in the set of suppressed samples of b) and provide a second set of detected bits based on the second set of reference bits on the second iteration.
According to another aspect of the subject technology, a method for processing input samples of a signal received in a wireless communication system comprises: a) equalizing a plurality of input samples to suppress intersymbol interference and provide a first set of detected bits based on a first set of reference bits comprising a training sequence on a first iteration; b) suppressing co-channel interference in the plurality of input samples and provide a set of suppressed samples based on a second set of reference bits comprising the first set of detected bits on a second iteration; and c) equalizing the set of suppressed samples of the step b) to suppress intersymbol interference and provide a second set of detected bits based on the second set of reference bits on the second iteration.
According to yet another aspect of the subject technology, a receiver comprises first interference suppressing means for suppressing co-channel interference. The receiver can further comprise second interference suppressing means for suppressing intersymbol interference. The receiver can further comprise controlling means for: a) controlling the second interference suppressing means to suppress intersymbol interference in a plurality of input samples of a received signal and provide a first set of detected bits based on a first set of reference bits comprising a training sequence on a first iteration; b) controlling the first interference suppressing means to suppress co-channel interference in the plurality of input samples and provide a set of suppressed samples based on a second set of reference bits comprising the first set of detected bits on a second iteration; and c) controlling the second interference suppressing means to suppress intersymbol interference in the set of suppressed samples of b) and provide a second set of detected bits based on the second set of reference bits on the second iteration.
According to yet another aspect of the subject technology, a machine-readable medium comprises instructions for processing input samples of a signal received in a wireless communication system. The instructions comprise code for: a) controlling the second interference suppressing means to suppress intersymbol interference in a plurality of input samples of a received signal and provide a first set of detected bits based on a first set of reference bits comprising a training sequence on a first iteration; b) controlling the first interference suppressing means to suppress co-channel interference in the plurality of input samples and provide a set of suppressed samples based on a second set of reference bits comprising the first set of detected bits on a second iteration; and c) controlling the second interference suppressing means to suppress intersymbol interference in the set of suppressed samples of b) and provide a second set of detected bits based on the second set of reference bits on the second iteration.
It is understood that other configurations of the subject technology will become readily apparent to those skilled in the art from the following detailed description, wherein various configurations of the subject technology are shown and described by way of illustration. As will be realized, the subject technology is capable of other and different configurations and its several details are capable of modification in various other respects, all without departing from the scope of the subject technology. Accordingly, the drawings and detailed description are to be regarded as illustrative in nature and not as restrictive.
A receiver comprising a hybrid demodulator that can be configured as an IS demodulator on a first iteration and as a SAIC demodulator on a subsequent iteration is disclosed. For clarity, various aspects of a receiver are specifically described below for Global System for Mobile Communications (GSM) technology.
In one aspect, to generate a GMSK signal, the modulator 130 receives input bits a from the TX data processor 120 and performs differential encoding on the inputs bits to generate code symbols c. On new code symbol is generated for each new input bit. Each input bit and each code symbol have a real value either +1 or −1. The modulator 130 further filters each code symbol with a Gaussian lowpass filter to generate a frequency pulse having a duration of approximately four sample periods (4T). The modulator 130 integrates the frequency pulses for the code symbols to generate a modulating signal and further modulates a carrier signal with the modulating signal to generate the GMSK signal.
At the receiver 150, an antenna 152 receives the RF modulated signal from the transmitter 110 and RF modulated signals from other transmitters in the GSM system. The antenna 152 provides a received GMSK signal to a receiver unit (RCVR) 154. The receiver unit 154 conditions and digitizes the received GMSK signal and provides received samples. A demodulator 160 processes the received samples and provides detected bits, as described below. An RX data processor 170 processes (e.g., deinterleaves and decodes) the detected bits and recovers the data sent by transmitter 110. The processing by the demodulator 160 and the RX data processor 170 can be complementary to the processing by modulator 130 and TX data processor 120, respectively, at the transmitter 110.
Controllers 140 and 180 direct operation at transmitter 110 and receiver 150, respectively. Memory units 142 and 182 provide storage for program codes and data used by controllers 140 and 180, respectively.
Each TDMA frame, such as exemplary TDMA frame 202, is further partitioned into eight time slots, which are labeled as time slots 0 through 7. Each active wireless device/user is assigned one time slot index for the duration of a call. User-specific data for each wireless device is sent in the time slot assigned to that wireless device and in TDMA frames used for the traffic channels.
The transmission in each time slot is called a “burst” in GSM. Each burst, such as exemplary burst 203, includes two tail fields, two data fields, a training sequence (or midamble) field, and a guard period (GP). The number of bits in each field is shown inside the parentheses. GSM defines eight different training sequences that may be sent in the training sequence field. Each training sequence, such as midamble 204, contains 26 bits and is defined such that the first five bits are repeated and the second five bits are also repeated. Each training sequence is also defined such that the correlation of that sequence with a 16-bit truncated version of that sequence is equal to (a) sixteen for a time shift of zero, (b) zero for time shifts of ±1, ±2, ±3, ±4, and ±5, and (3) a zero or non-zero value for all other time shifts.
One approach to locating a midamble in a burst of symbols serially compares hypotheses regarding the midamble position to determine which hypothesis provides the highest correlation energy between the known midamble sequence and the hypothesized position in the burst of symbols. This method is very sensitive to interference from multi-paths of the same midamble sequence, which can cause the correlation energy of inaccurate hypotheses to be affected by time-delayed copies thereof.
A GMSK-to-BPSK rotator 314 performs phase rotation on the intermediate samples r and provides input samples z. For example, the rotator 314 can rotate the intermediate samples by successively more negative phases, or 0° for r(t), then −90° for r(t+1), then −180° for r(t+2), then −270° for r(t+3), then 0° for r(t+4), and so on.
An equalizer 350 performs equalization on the input samples z to remove intersymbol interference caused by multipath in the wireless channel. For the design shown in
The detector 370 receives the input samples z and the channel estimate ĥ and performs detection to recover input bits a. The detector 370 may implement a maximum likelihood sequence estimator (MLSE) that determines a sequence of bits that is most likely to have been transmitted given the input sample sequence z and the channel estimate ĥ. The MLSE can use a Viterbi algorithm with 2L−1 states, where L is the length of the channel estimate ĥ. Detection with MLSE for GSM is well known in the art and not described in detail herein. The detector 370 provides detected bits xdet, which are hard decision estimates of the input bits a sent by the transmitter 110.
Within the RX data processor 170a, a soft output generator 380 receives the detected bits xdet and the input samples z and generates soft decisions that indicate the confidence in the detected bits. The soft output generator 380 may implement an Ono algorithm that is well known in the art. A de-interleaver 382 de-interleaves the soft decisions in a manner complementary to the interleaving performed by the transmitter 110. A Viterbi decoder 384 decodes the deinterleaved soft decisions and provides decoded data ydec, which is an estimate of the traffic data provided to the TX data processor 120 at the transmitter 110.
An interference suppressor 420 receives the two input sample sequences z1 and z2, suppresses co-channel interference from the undesired transmitter(s), and provides sequences of CCI-suppressed samples z1f and z2f. An equalizer 450 performs equalization on the CCI-suppressed samples z1f and z2f to suppress intersymbol interference and provides detected bits xdet. The interference suppressor 420 and the equalizer 450 may be implemented in various manners, and several exemplary designs are described below.
The demodulator 160b may perform co-channel interference suppression and equalization for a single iteration or for multiple iterations to improve performance. Each iteration of the co-channel interference suppression and equalization is called an outer iteration. A selector (SEL) 452 receives the training sequence xts and the detected bits xdet and provides reference bits xref for the interference suppressor 420 and the equalizer 450. In general, the selector 452 may provide the same reference bits to both the interference suppressor 420 and the equalizer 450 (as shown in
The interference suppressor 420a is configured to suppress co-channel interference and provides two sequences of CCI-suppressed samples z1f and z2f. The interference suppressor 420a includes a channel estimator 530, a desired signal estimator 532, a weight computation unit 534, and a multiple-in multiple-out (MIMO) filter 540. The channel estimator 530 may implement a least-squares (LS) estimator, a linear minimum mean square error (LMMSE), an adaptive filter, or some other type of estimator. The interference suppressor 420a may perform channel estimation and MIMO filtering for a single iteration or for multiple iterations to improve performance. The equalizer 450a includes a channel estimator 560, a desired signal estimator 562, a pair of summers 564a, 564b, a noise correlation matrix computation unit 566, and a detector 570 (e.g., an MLSE).
Operation of the exemplary SAIC demodulator 160c is now described. The following description is a summary of a more detailed description of operation of a SAIC demodulator provided in provided in U.S. patent application Ser. No. 11/122,654, titled “Interference Suppression With Virtual Antennas”, which is incorporated herein by reference in its entirety. The channel estimator 530 receives one or more sequences of complex-valued input sample sequences (e.g., the first sequence z1 and the second sequence zs) from the pre-processor 410 and the reference bits xref from the selector 452 and derives effective channel impulse response estimates (e.g., ĥ1 for z1 and ĥ2 for z2). The channel estimator 530 may implement a least-squares (LS) estimator, a linear minimum mean square error (LMMSE), an adaptive filter, or some other type of estimator. The desired signal estimator 532 receives the reference bits xref and the effective channel response estimates ĥ1 and ĥ2 for the first and second sequences z1 and z2 and derives a desired signal estimate s1 and s2 based on xref and ĥ1 and ĥ2. The weight computation unit 534 receives the input sample sequences z1 and z2 and the desired signal estimates s1 and s2 generates weights W1 and W2 for the MIMO filter 540.
The MIMO filter 540 may include two separate filters which are referred to as first and second MIMO filters. The first MIMO filter filters the input sample sequences z1 and z2 with the weights W1 and provides a first CCI-suppressed sample sequence z1f. The second MIMO filter filters the input sample sequences z1 and z2 with the weights W2 and provides a second CCI-suppressed sample sequence z2f. The first and second MIMO filters operate independently of one another. The weight computation unit 534 derives the weights W1 such that the mean square error between the CCI-suppressed samples z1f and the desired signal estimate s1 is minimized. The weight computation unit 534 derives the weights W2 such that the mean square error between the CCI-suppressed samples z2f and the desired signal estimate s2 is minimized.
Turning now to the equalizer 450a, the channel estimator 560 receives the two CCI-suppressed sample sequences z1f and z2f provided by the interference suppressor 420a and the reference bits xref provided by the selector 452 and derives improved effective channel impulse response estimates ĥ1f and ĥ2f for sequences z1f and z2f, respectively. In one aspect, the selector 452 provides a training sequence (xts), (e.g., the midamble 204 shown in
The desired signal estimator 562 receives the reference bits xref and the improved channel estimates ĥ1f and ĥ2f, derives a desired signal estimate s1f based on xref and ĥ1f, derives a desired signal estimate s2f based on xref and ĥ2f, and provides the two desired signal estimates s1f and s2f. The desired signal estimates s1f and s1f are typically of higher quality than the desired signal estimates s1 and s1 because of the improved channel estimates ĥ1f and ĥ2f used to derive the desired signal estimates s1f and s2f.
The summer 564a subtracts the desired signal estimate s1f from the CCI-suppressed samples z1f and provides a noise estimate n1f. The summer 564b subtracts the desired signal estimate s2f from the CCI-suppressed samples z2f and provides a noise estimate n2f. The computation unit 566 computes a 4×4 noise correlation matrix Rnn based on the real and imaginary parts of the noise samples in n1f and n2f.
The detector 570 receives the CCI-suppressed sample sequences z1f and z2f, the improved channel estimates ĥ1f and ĥ2f, and the noise correlation matrix Rnn. The detector 570 can perform detection based on the inputs and provides the detected bits xdet that are deemed most likely to have been transmitted based on the branch metrics. In certain embodiment, the detector 570 is implemented with an MLSE. In other embodiments, the detector 570 may be implemented with other types of equalizers such as a decision feedback equalizer (DFE).
For the exemplary receiver shown in
Additionally, it shall be appreciated that symbols such as Z, Zf, H, and S can include one or more data sequences. For example, a single line connecting the pre-processor 410 and the interference suppressor 420b can indicate a single line carrying a single sequence of input samples (e.g., z1) or multiple (e.g., two) lines carrying multiple sequences of input samples (e.g., z1 and z2). Similarly, Zfcan denote z1f or z1f and z2f, Hf can denote ĥ1f or ĥ1f and ĥ2f, and Sf can denote s1f or s1f and s2f.
Operation of the SAIC demodulator 160d is substantially the same as the operation of the SAIC demodulator 160c described above with respect to
For improved detection performance, a hybrid SAIC demodulator is implemented wherein the demodulator is configured as a non-SAIC demodulator such as the one shown in
In a first configuration corresponding to the first iteration (It. 0), the pairs of bypass switches 791a,b and 793a,b are in first positions such that: 1) the co-channel interference suppressor 420c is bypassed or skipped, and sequences of input samples (e.g., z1 and z2) flow from the pre-processor 410 to the detector (e.g., MLSE); and 2) the desired signal estimator 762 and the noise correlation matrix generation module 765 are bypassed or skipped. The channel estimator 760 receives a first set of reference bits (xref) comprising a training sequence (xts) and derives a first set of one or more channel estimates (e.g., ĥ1f and ĥ2f). The detector 770 performs detection on Z, the sequences of input samples (e.g., z1 and z2), with Hf, the set of one or more channel estimates, to provide a set of detected bits (xdet). In this configuration, the hybrid SAIC demodulator 160e behaves substantially like a non-SAIC demodulator, such as the demodulator 160a illustrated in
In a second configuration corresponding to a second iteration (It. 1), for example, the pairs of bypass switches 791a,b and 793a,b are in second positions such that the hybrid demodulator 160e is configured as, and behaves like, a SAIC demodulator, such as the SAIC demodulator 160d illustrated in
In one aspect, the hybrid SAIC demodulator 160e can be configured as a non-SAIC demodulator (e.g., the demodulator 160a of
can be computed as follows: The received samples are squared and added to compute the signal energy at the equalizer input. Division by N gives the signal power at the input of the equalizer. The power is divided by the gain G of the receiver chain to translate it into the received power at the antenna. The process 800 proceeds to a decision state 830, in which a query is made as to whether the measured RxLev is larger than a threshold level.
The threshold level can be determined at the product design stage for the receiver based on various factors including an experimentally or theoretically determined background white noise level inherent to the receiver design. For example, suppose that the background white noise level is −100 dbm for a particular receiver design. Subsequently, a determination can be made as to at what signal power level below the background white noise level (e.g., −100 dbm) the performance advantage of the SAIC detection is lost and the non-SAIC detection is favorable to the SAIC detection. This determination can be made experimentally or theoretically. For example, if is determined that the performance advantage of the SAIC detection as compared to the non-SAIC detection is lost at 5 dbm below the background white noise level of −100 dbm, the threshold is set at −95 dbm.
RxLev>Threshold
Returning to the process 800 (
The process 800 then proceeds to a decision state 860, in which a query is made as to whether the iteration variable (It) is 0. At this stage, the query condition is satisfied because It=0, and the process 800 proceeds to a state 870, where the iteration variable (It) is incremented from 0 to 1. The process 800 begins its second iteration (It=0) stage by proceeding to a state 875, in which the reference bits (xref) are assigned to the first set of detected bits obtained on the first iteration at the state 858a to provide a second set of reference bits comprising the first set of detected bits. The process 800 then loops back to the state 840, and the steps 840-858a described above are repeated, with a notable difference this time being that: 1) a second set of channel estimates (Hf) is derived based on the second set of reference bits comprising the first set of detected bits obtained on the first iteration (It=0) as opposed to the first set of reference bits comprising the training sequence; and 2) a second set of detected bits is obtained at the state 858a based on the second set of channel estimates. After the second set of detected bits is obtained, the process proceeds to the decision state 860 again. This time, the query condition (It=0?) is no longer satisfied, and the process 800 ends the demodulation and proceeds to a state 880, in which a soft decision is peformed on the second set of detected bits, e.g., by the Rx data processor 170 to provide ydet. The process 800 ends at state 890.
RxLev≦Threshold
On the other hand, if the answer to the query at the decision state 830 is No (indicating, e.g., a poor SNR condition), the operation of the hybrid demodulator takes on its “hybrid” nature. For example, on a first iteration (e.g., It=0), the operation of the hybrid demodulator substantially tracks that of a non-SAIC demodulator, such as the demodulators 160a of
The process 800 then proceeds to the decision state 860, in which a query is made as to whether the iteration variable (It) is 0. At this stage, the query condition is satisfied because It=0, and the process 800 proceeds to a state 870, where the iteration variable (It) is incremented from 0 to 1. The process 800 then begins its second iteration stage by proceeding to a state 875, in which the reference bits (xref) are assigned to the first set of detected bits obtained on the first iteration at the state 858b to provide a second set of reference bits comprising the first set of detected bits. The process 800 then proceeds to a state 840, in which co-channel interference in the plurality of input samples (Z) is suppressed, e.g., by the interference suppressor 420c, to provide a set of suppressed samples (Zf) based on the second set of reference bits comprising the first set of detected bits obtained at the state 858b. The process 800 proceeds to a state 852a, in which a set of one or more channel estimates (Hf) is derived, e.g., by the channel estimator 760, based on the second set of reference bits comprising the first set of detected bits assigned at the state 875 and the set of suppressed samples provided at the state 840. The process 800 proceeds to a state 854, in which a set of one or more desired signal estimates (Sf)is derived, e.g., by the desired signal estimator 762, based on the set of suppressed samples provided at the state 840 and the set of one or more channel estimates derived at the state 852a. The process 800 proceeds to a state 854, in which a noise correlation matrix (Rnn) is computed, e.g., by the noise correlation matrix generation module 765, based on the set of suppressed samples provided at the state 840 and the set of one or more desired signal estimates derived at the state 854. The process 800 proceeds to a state 858a, in which the detector 770 detects the set of suppressed samples based on the set of one or more channel estimates derived at the state 852a to provide a second set of detected bits.
After the second set of detected bits is obtained at the state 858a, the process proceeds to the decision state 860 again. This time, the query condition (It=0?) is no longer satisfied, and the process 800 ends the demodulation and proceeds to a state 880, in which a soft decision is peformed on the second set of detected bits, e.g., by the Rx data processor 170 to provide ydet. The process 800 ends at state 890.
It shall be appreciated that the process 800 described above is for illustration purpose only, and a multitude of variations can be made to the described process without departing from the scope of the present disclosure. For example, in one variation, instead of ending the demodulation after the second iteration, the demodulation steps of the states 840-858a can be repeated for additional Itps−2 times, where Itps denotes a preset upper limit on the number of iterations, or until another pre-established condition is satisfied (e.g., when the SNR does not improve any further) before proceeding to the soft decision at the state 880. In another variation, the state 815 can be performed at any point between the state 820 and the state 840 or the state 852b. In yet another variation, the set of reference bits used for suppressing co-channel interference at the state 840 can be different from the set of reference bits used for generating the set of one or more channel estimates at the state 852a. In yet another variation, the hybrid demodulator may not generate the Rnn matrix to perform the noise decorrelation, in which case the states 854 and 856 may not be present.
Computer system 900 may be coupled via I/O module 908 to a display device (not illustrated), such as a cathode ray tube (“CRT”) or liquid crystal display (“LCD”) for displaying information to a computer user. An input device, such as, for example, a keyboard or a mouse may also be coupled to computer system 900 via I/O module 908 for communicating information and command selections to processor 904.
According to one aspect, various functions of a hybrid SAIC demodulator described herein are performed by a computer system 900 in response to processor 904 executing one or more sequences of one or more instructions contained in memory 906. Such instructions may be read into memory 906 from another machine-readable medium, such as data storage device 910. Execution of the sequences of instructions contained in main memory 906 causes processor 904 to perform the process steps described herein. One or more processors in a multi-processing arrangement may also be employed to execute the sequences of instructions contained in memory 906. In alternative aspects, hard-wired circuitry may be used in place of or in combination with software instructions to implement various aspects. Thus, aspects are not limited to any specific combination of hardware circuitry and software.
The term “machine-readable medium” as used herein refers to any medium that participates in providing instructions to processor 904 for execution. Such a medium may take many forms, including, but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media include, for example, optical or magnetic disks, such as data storage device 910. Volatile media include dynamic memory, such as memory 906. Transmission media include coaxial cables, copper wire, and fiber optics, including the wires that comprise bus 902. Transmission media can also take the form of acoustic or light waves, such as those generated during radio frequency and infrared data communications. Common forms of machine-readable media include, for example, floppy disk, a flexible disk, hard disk, magnetic tape, any other magnetic medium, a CD-ROM, DVD, any other optical medium, punch cards, paper tape, any other physical medium with patterns of holes, a RAM, a PROM, an EPROM, a FLASH EPROM, any other memory chip or cartridge, a carrier wave, or any other medium from which a computer can read.
Those of skill in the art would appreciate that the various illustrative blocks, modules, elements, components, methods, and algorithms described herein may be implemented as electronic hardware, computer software, or combinations of both. Furthermore, these may be partitioned differently than what is described. To illustrate this interchangeability of hardware and software, various illustrative blocks, modules, elements, components, methods, and algorithms 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.
It is understood that the specific order or hierarchy of steps or blocks in the processes disclosed is an illustration of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps or blocks in the processes may be rearranged. The accompanying method claims present elements of the various steps in a sample order, and are not meant to be limited to the specific order or hierarchy presented.
The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein, but is to be accorded the full scope consistent with the language claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.” Unless specifically stated otherwise, the term “some” refers to one or more. Pronouns in the masculine (e.g., his) include the feminine and neuter gender (e.g., her and its) and vice versa. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims. No claim element is to be construed under the provisions of 35 U.S.C. §112, sixth paragraph, unless the element is expressly recited using the phrase “means for” or, in the case of a method claim, the element is recited using the phrase “step for.”
Number | Name | Date | Kind |
---|---|---|---|
4718066 | Rogard | Jan 1988 | A |
4885744 | Lespagnol et al. | Dec 1989 | A |
5172118 | Peregrim et al. | Dec 1992 | A |
5173702 | Young et al. | Dec 1992 | A |
5173703 | Mangiapane et al. | Dec 1992 | A |
5185608 | Pozgay | Feb 1993 | A |
5267249 | Dong | Nov 1993 | A |
5710784 | Kindred et al. | Jan 1998 | A |
5721745 | Hladik et al. | Feb 1998 | A |
5751725 | Chen | May 1998 | A |
5774450 | Harada et al. | Jun 1998 | A |
5774496 | Butler et al. | Jun 1998 | A |
5887035 | Molnar | Mar 1999 | A |
5960361 | Chen | Sep 1999 | A |
5983383 | Wolf | Nov 1999 | A |
6108373 | Fargues et al. | Aug 2000 | A |
6169759 | Kanterakis et al. | Jan 2001 | B1 |
6208699 | Chen et al. | Mar 2001 | B1 |
6259730 | Solondz | Jul 2001 | B1 |
6282233 | Yoshida | Aug 2001 | B1 |
6285682 | Proctor et al. | Sep 2001 | B1 |
6396867 | Tiedemann, Jr. et al. | May 2002 | B1 |
6480558 | Ottosson et al. | Nov 2002 | B1 |
6496706 | Jou et al. | Dec 2002 | B1 |
6532254 | Jokinen | Mar 2003 | B1 |
6545989 | Butler | Apr 2003 | B1 |
6553224 | Kim | Apr 2003 | B1 |
6587522 | Wheeler et al. | Jul 2003 | B1 |
6590881 | Wallace et al. | Jul 2003 | B1 |
6615030 | Saito et al. | Sep 2003 | B1 |
6628707 | Rafie et al. | Sep 2003 | B2 |
6633601 | Yang | Oct 2003 | B1 |
6741661 | Wheatley, III et al. | May 2004 | B2 |
6744814 | Blanksby et al. | Jun 2004 | B1 |
6747963 | Park et al. | Jun 2004 | B1 |
6765531 | Anderson | Jul 2004 | B2 |
6765894 | Hayashi | Jul 2004 | B1 |
6771689 | Solondz | Aug 2004 | B2 |
6771934 | Demers et al. | Aug 2004 | B2 |
6834197 | Nakahara et al. | Dec 2004 | B2 |
6907092 | Yakhnich et al. | Jun 2005 | B1 |
6917607 | Yeom et al. | Jul 2005 | B1 |
6931030 | Dogan | Aug 2005 | B1 |
6934264 | Jou | Aug 2005 | B2 |
6956893 | Frank et al. | Oct 2005 | B2 |
6959010 | Bahrenburg et al. | Oct 2005 | B1 |
6975604 | Ishida et al. | Dec 2005 | B1 |
6977888 | Frenger et al. | Dec 2005 | B1 |
6983166 | Shiu et al. | Jan 2006 | B2 |
6985516 | Easton et al. | Jan 2006 | B1 |
7006439 | Thron et al. | Feb 2006 | B2 |
7006795 | Foschini et al. | Feb 2006 | B2 |
7013147 | Kuwahara et al. | Mar 2006 | B1 |
7023880 | El-Maleh et al. | Apr 2006 | B2 |
7031742 | Chen et al. | Apr 2006 | B2 |
7042869 | Bender | May 2006 | B1 |
7051268 | Sindhushayana et al. | May 2006 | B1 |
7107031 | Kristensson et al. | Sep 2006 | B2 |
7116735 | Yamada et al. | Oct 2006 | B2 |
7123590 | Mir et al. | Oct 2006 | B2 |
7130365 | Li | Oct 2006 | B2 |
7167502 | Tsaur | Jan 2007 | B1 |
7187736 | Buckley et al. | Mar 2007 | B2 |
7200172 | Pukkila et al. | Apr 2007 | B2 |
7224962 | Kite | May 2007 | B1 |
7295636 | Onggosanusi et al. | Nov 2007 | B2 |
7298806 | Varma et al. | Nov 2007 | B1 |
7302009 | Walton et al. | Nov 2007 | B2 |
7308056 | Pukkila et al. | Dec 2007 | B2 |
7313189 | Yoshida et al. | Dec 2007 | B2 |
7315527 | Wei et al. | Jan 2008 | B2 |
7349379 | Schmidl et al. | Mar 2008 | B2 |
7406065 | Willenegger et al. | Jul 2008 | B2 |
7466666 | Yoon et al. | Dec 2008 | B2 |
7613144 | Malladi et al. | Nov 2009 | B2 |
7620662 | Kassai et al. | Nov 2009 | B2 |
7630321 | Jain et al. | Dec 2009 | B2 |
7649839 | Dendy | Jan 2010 | B2 |
7650116 | Haartsen | Jan 2010 | B2 |
7693210 | Margetts et al. | Apr 2010 | B2 |
7706430 | Guo et al. | Apr 2010 | B2 |
7724701 | Lundby et al. | May 2010 | B2 |
7764726 | Simic et al. | Jul 2010 | B2 |
7881711 | Lundby | Feb 2011 | B2 |
7933256 | Abrishamkar et al. | Apr 2011 | B2 |
8077637 | Fujimoto | Dec 2011 | B2 |
8160002 | Rajkotia et al. | Apr 2012 | B2 |
8201039 | Tiedemann, Jr. et al. | Jun 2012 | B2 |
8259848 | Malladi | Sep 2012 | B2 |
8332710 | Tsai et al. | Dec 2012 | B2 |
8369214 | Kim et al. | Feb 2013 | B2 |
8396440 | Canpolat et al. | Mar 2013 | B2 |
8411618 | Kim et al. | Apr 2013 | B2 |
8422955 | Smee et al. | Apr 2013 | B2 |
8428109 | Yang et al. | Apr 2013 | B2 |
8442441 | Pfister et al. | May 2013 | B2 |
8489128 | Lundby | Jul 2013 | B2 |
8588119 | Panta et al. | Nov 2013 | B2 |
8594252 | Black et al. | Nov 2013 | B2 |
8611305 | Black et al. | Dec 2013 | B2 |
8630602 | Attar et al. | Jan 2014 | B2 |
8660145 | Carmon et al. | Feb 2014 | B2 |
8743909 | Black et al. | Jun 2014 | B2 |
8787509 | Sikri et al. | Jul 2014 | B2 |
20010018650 | DeJaco | Aug 2001 | A1 |
20010021229 | Belaiche | Sep 2001 | A1 |
20020006138 | Odenwalder | Jan 2002 | A1 |
20020046379 | Miki et al. | Apr 2002 | A1 |
20020071407 | Koo et al. | Jun 2002 | A1 |
20020093937 | Kim et al. | Jul 2002 | A1 |
20020131381 | Kim et al. | Sep 2002 | A1 |
20020131532 | Chi et al. | Sep 2002 | A1 |
20020132625 | Ogino et al. | Sep 2002 | A1 |
20020181557 | Fujii | Dec 2002 | A1 |
20030004784 | Li et al. | Jan 2003 | A1 |
20030041206 | Dickie | Feb 2003 | A1 |
20030063596 | Arslan et al. | Apr 2003 | A1 |
20030078067 | Kim et al. | Apr 2003 | A1 |
20030103470 | Yafuso | Jun 2003 | A1 |
20030112370 | Long et al. | Jun 2003 | A1 |
20030119451 | Jang et al. | Jun 2003 | A1 |
20030125037 | Bae et al. | Jul 2003 | A1 |
20030134656 | Chang et al. | Jul 2003 | A1 |
20030147476 | Ma et al. | Aug 2003 | A1 |
20030199290 | Viertola | Oct 2003 | A1 |
20030212816 | Bender et al. | Nov 2003 | A1 |
20030223396 | Tsai et al. | Dec 2003 | A1 |
20040001563 | Scarpa | Jan 2004 | A1 |
20040005897 | Tomoe et al. | Jan 2004 | A1 |
20040017311 | Thomas et al. | Jan 2004 | A1 |
20040043746 | Hiramatsu | Mar 2004 | A1 |
20040062302 | Fujii et al. | Apr 2004 | A1 |
20040081124 | Black et al. | Apr 2004 | A1 |
20040081248 | Parolari | Apr 2004 | A1 |
20040082356 | Walton et al. | Apr 2004 | A1 |
20040085917 | Fitton et al. | May 2004 | A1 |
20040085936 | Gopalakrishnan et al. | May 2004 | A1 |
20040116122 | Zeira et al. | Jun 2004 | A1 |
20040131007 | Smee et al. | Jul 2004 | A1 |
20040141525 | Bhushan et al. | Jul 2004 | A1 |
20040157614 | Fujita et al. | Aug 2004 | A1 |
20040160933 | Odenwalder et al. | Aug 2004 | A1 |
20040168113 | Murata et al. | Aug 2004 | A1 |
20040185868 | Jain et al. | Sep 2004 | A1 |
20040198404 | Attar et al. | Oct 2004 | A1 |
20040203913 | Ogino et al. | Oct 2004 | A1 |
20040223507 | Kuchibhotla et al. | Nov 2004 | A1 |
20040223538 | Zeira | Nov 2004 | A1 |
20040229615 | Agrawal | Nov 2004 | A1 |
20040240400 | Khan | Dec 2004 | A1 |
20040240416 | Derryberry et al. | Dec 2004 | A1 |
20050013263 | Kim et al. | Jan 2005 | A1 |
20050018614 | Kiran | Jan 2005 | A1 |
20050037718 | Kim et al. | Feb 2005 | A1 |
20050037775 | Moeglein et al. | Feb 2005 | A1 |
20050053088 | Cheng et al. | Mar 2005 | A1 |
20050058154 | Lee et al. | Mar 2005 | A1 |
20050084045 | Stewart et al. | Apr 2005 | A1 |
20050111408 | Skillermark et al. | May 2005 | A1 |
20050147024 | Jung et al. | Jul 2005 | A1 |
20050153695 | Cho | Jul 2005 | A1 |
20050185364 | Bell et al. | Aug 2005 | A1 |
20050195889 | Grant et al. | Sep 2005 | A1 |
20050213505 | Iochi et al. | Sep 2005 | A1 |
20050220042 | Chang et al. | Oct 2005 | A1 |
20050232174 | Onggosanusi et al. | Oct 2005 | A1 |
20050249163 | Kim et al. | Nov 2005 | A1 |
20050265399 | El-Maleh et al. | Dec 2005 | A1 |
20050265465 | Hosur et al. | Dec 2005 | A1 |
20050277429 | Laroia et al. | Dec 2005 | A1 |
20060003792 | Gholmieh et al. | Jan 2006 | A1 |
20060050666 | Odenwalder | Mar 2006 | A1 |
20060109938 | Challa et al. | May 2006 | A1 |
20060126491 | Ro et al. | Jun 2006 | A1 |
20060126765 | Shin et al. | Jun 2006 | A1 |
20060126844 | Mauro | Jun 2006 | A1 |
20060141935 | Hou et al. | Jun 2006 | A1 |
20060142038 | Ozarow et al. | Jun 2006 | A1 |
20060146953 | Raghothaman et al. | Jul 2006 | A1 |
20060146969 | Zhang et al. | Jul 2006 | A1 |
20060203943 | Scheim et al. | Sep 2006 | A1 |
20060209783 | Jain et al. | Sep 2006 | A1 |
20060209902 | Grilli et al. | Sep 2006 | A1 |
20060209982 | De Gaudenzi et al. | Sep 2006 | A1 |
20060227853 | Liang et al. | Oct 2006 | A1 |
20060234715 | Cho et al. | Oct 2006 | A1 |
20070021148 | Mahini | Jan 2007 | A1 |
20070040704 | Smee et al. | Feb 2007 | A1 |
20070050189 | Cruz-Zeno et al. | Mar 2007 | A1 |
20070058709 | Chen et al. | Mar 2007 | A1 |
20070058746 | Gueguen | Mar 2007 | A1 |
20070063897 | Matsuda | Mar 2007 | A1 |
20070071145 | Perets | Mar 2007 | A1 |
20070076707 | Link et al. | Apr 2007 | A1 |
20070086513 | Fernandez-Corbaton et al. | Apr 2007 | A1 |
20070110095 | Attar et al. | May 2007 | A1 |
20070112564 | Jelinek | May 2007 | A1 |
20070121554 | Luo et al. | May 2007 | A1 |
20070121764 | Chen et al. | May 2007 | A1 |
20070127608 | Scheim et al. | Jun 2007 | A1 |
20070133423 | Okumura | Jun 2007 | A1 |
20070133475 | Peisa et al. | Jun 2007 | A1 |
20070150787 | Kim et al. | Jun 2007 | A1 |
20070150788 | Zhuyan | Jun 2007 | A1 |
20070183483 | Narayan et al. | Aug 2007 | A1 |
20070201548 | Badri-Hoeher et al. | Aug 2007 | A1 |
20070273698 | Du et al. | Nov 2007 | A1 |
20080019308 | Chuan-Lin et al. | Jan 2008 | A1 |
20080019467 | He | Jan 2008 | A1 |
20080031368 | Lindoff et al. | Feb 2008 | A1 |
20080057963 | Kayama et al. | Mar 2008 | A1 |
20080076432 | Senarath et al. | Mar 2008 | A1 |
20080080363 | Black et al. | Apr 2008 | A1 |
20080080406 | Peplinski et al. | Apr 2008 | A1 |
20080101440 | Lee | May 2008 | A1 |
20080125070 | Grieco et al. | May 2008 | A1 |
20080212462 | Ahn et al. | Sep 2008 | A1 |
20080227456 | Huang et al. | Sep 2008 | A1 |
20080232439 | Chen | Sep 2008 | A1 |
20080298521 | Wu | Dec 2008 | A1 |
20080298524 | Koorapaty et al. | Dec 2008 | A1 |
20080305790 | Wakabayashi | Dec 2008 | A1 |
20090022098 | Novak et al. | Jan 2009 | A1 |
20090052591 | Chen | Feb 2009 | A1 |
20090058728 | Mostafa et al. | Mar 2009 | A1 |
20090092178 | Sayana et al. | Apr 2009 | A1 |
20090109907 | Tsai et al. | Apr 2009 | A1 |
20090207944 | Furman et al. | Aug 2009 | A1 |
20090213971 | Park et al. | Aug 2009 | A1 |
20090303968 | Jou et al. | Dec 2009 | A1 |
20090303976 | Jou et al. | Dec 2009 | A1 |
20090304024 | Jou et al. | Dec 2009 | A1 |
20100027702 | Vijayan et al. | Feb 2010 | A1 |
20100029213 | Wang | Feb 2010 | A1 |
20100029262 | Wang et al. | Feb 2010 | A1 |
20100040035 | Shapiro et al. | Feb 2010 | A1 |
20100046595 | Sikri et al. | Feb 2010 | A1 |
20100046660 | Sikri et al. | Feb 2010 | A1 |
20100046682 | Sikri et al. | Feb 2010 | A1 |
20100054212 | Tang | Mar 2010 | A1 |
20100097955 | Jou | Apr 2010 | A1 |
20100172383 | Montalvo et al. | Jul 2010 | A1 |
20100202544 | Osseirar et al. | Aug 2010 | A1 |
20100248666 | Hui et al. | Sep 2010 | A1 |
20100296556 | Rave et al. | Nov 2010 | A1 |
20100310026 | Sikri et al. | Dec 2010 | A1 |
20110051859 | Canpolat et al. | Mar 2011 | A1 |
20110051864 | Chalia et al. | Mar 2011 | A1 |
20110264976 | Yang et al. | Oct 2011 | A1 |
20110305303 | Sikri et al. | Dec 2011 | A1 |
20120243515 | Xue et al. | Sep 2012 | A1 |
20120281675 | Liang et al. | Nov 2012 | A1 |
20140187248 | Black et al. | Jul 2014 | A1 |
Number | Date | Country |
---|---|---|
1207835 | Feb 1999 | CN |
1250269 | Apr 2000 | CN |
1278382 | Dec 2000 | CN |
1304589 | Jul 2001 | CN |
1311612 | Sep 2001 | CN |
1315095 | Sep 2001 | CN |
1394407 | Jan 2003 | CN |
1447549 | Oct 2003 | CN |
1497857 | May 2004 | CN |
1552133 | Dec 2004 | CN |
1736101 | Feb 2006 | CN |
1742457 | Mar 2006 | CN |
1758563 | Apr 2006 | CN |
1893406 | Jan 2007 | CN |
1906862 | Jan 2007 | CN |
1983913 | Jun 2007 | CN |
101189901 | May 2008 | CN |
101366305 | Feb 2009 | CN |
101465689 | Jun 2009 | CN |
101483499 | Jul 2009 | CN |
0396403 | Nov 1990 | EP |
0949766 | Oct 1999 | EP |
0969608 | Jan 2000 | EP |
1168703 | Jan 2002 | EP |
1199833 | Apr 2002 | EP |
1347611 | Sep 2003 | EP |
1398984 | Mar 2004 | EP |
1404047 | Mar 2004 | EP |
1411693 | Apr 2004 | EP |
1422900 | May 2004 | EP |
1478117 | Nov 2004 | EP |
1569399 | Aug 2005 | EP |
1643737 | Apr 2006 | EP |
1677433 | Jul 2006 | EP |
1681775 | Jul 2006 | EP |
1699194 | Sep 2006 | EP |
1699195 | Sep 2006 | EP |
1701565 | Sep 2006 | EP |
1703659 | Sep 2006 | EP |
1821497 | Aug 2007 | EP |
1928138 | Jun 2008 | EP |
2337417 | Nov 1999 | GB |
62239735 | Oct 1987 | JP |
10500811 | Jan 1998 | JP |
H10327126 | Dec 1998 | JP |
2000059290 | Feb 2000 | JP |
2000261397 | Sep 2000 | JP |
2001036964 | Feb 2001 | JP |
2001078252 | Mar 2001 | JP |
2001166026 | Jun 2001 | JP |
2001512916 | Aug 2001 | JP |
3210915 | Sep 2001 | JP |
2001257626 | Sep 2001 | JP |
2001267987 | Sep 2001 | JP |
2001519113 | Oct 2001 | JP |
2002009741 | Jan 2002 | JP |
2002506583 | Feb 2002 | JP |
2002507342 | Mar 2002 | JP |
2002508129 | Mar 2002 | JP |
2002532008 | Sep 2002 | JP |
2002539711 | Nov 2002 | JP |
2002353824 | Dec 2002 | JP |
2003051762 | Feb 2003 | JP |
2003152603 | May 2003 | JP |
2003194916 | Jul 2003 | JP |
2003244103 | Aug 2003 | JP |
2003338779 | Nov 2003 | JP |
2004048307 | Feb 2004 | JP |
2004112094 | Apr 2004 | JP |
2004511189 | Apr 2004 | JP |
2004512733 | Apr 2004 | JP |
2004159277 | Jun 2004 | JP |
2004166218 | Jun 2004 | JP |
2004194288 | Jul 2004 | JP |
2004531975 | Oct 2004 | JP |
2004343754 | Dec 2004 | JP |
2005065197 | Mar 2005 | JP |
2005510940 | Apr 2005 | JP |
2006503485 | Jan 2006 | JP |
2006180266 | Jul 2006 | JP |
2006191582 | Jul 2006 | JP |
2006191587 | Jul 2006 | JP |
2006314086 | Nov 2006 | JP |
2007503169 | Feb 2007 | JP |
2007195247 | Aug 2007 | JP |
2007524269 | Aug 2007 | JP |
2008053889 | Mar 2008 | JP |
2008199493 | Aug 2008 | JP |
2008278338 | Nov 2008 | JP |
2008539664 | Nov 2008 | JP |
2009545219 | Dec 2009 | JP |
2011521373 | Jul 2011 | JP |
2011524115 | Aug 2011 | JP |
20010031665 | Apr 2001 | KR |
20010085143 | Sep 2001 | KR |
20020092136 | Dec 2002 | KR |
20030059528 | Jul 2003 | KR |
20040097893 | Nov 2004 | KR |
20050073113 | Jul 2005 | KR |
1020050097552 | Oct 2005 | KR |
20070091214 | Sep 2007 | KR |
20070104633 | Oct 2007 | KR |
20080039772 | May 2008 | KR |
2211531 | Aug 2003 | RU |
2233033 | Jul 2004 | RU |
2233045 | Jul 2004 | RU |
2280329 | Jul 2006 | RU |
2301493 | Jun 2007 | RU |
2319307 | Mar 2008 | RU |
2323529 | Apr 2008 | RU |
365717 | Aug 1999 | TW |
200640202 | Nov 2006 | TW |
200704232 | Jan 2007 | TW |
201008148 | Feb 2010 | TW |
9526593 | Oct 1995 | WO |
98018212 | Apr 1998 | WO |
9832231 | Jul 1998 | WO |
9857452 | Dec 1998 | WO |
9857509 | Dec 1998 | WO |
9901950 | Jan 1999 | WO |
9912273 | Mar 1999 | WO |
9923844 | May 1999 | WO |
99029048 | Jun 1999 | WO |
0033528 | Jun 2000 | WO |
00035117 | Jun 2000 | WO |
0035126 | Jun 2000 | WO |
WO0055992 | Sep 2000 | WO |
0062456 | Oct 2000 | WO |
0070786 | Nov 2000 | WO |
01008324 | Feb 2001 | WO |
01017158 | Mar 2001 | WO |
0223792 | Mar 2002 | WO |
0233877 | Apr 2002 | WO |
02030004 | Apr 2002 | WO |
WO0232003 | Apr 2002 | WO |
WO020674 | Aug 2002 | WO |
02103920 | Dec 2002 | WO |
03001834 | Jan 2003 | WO |
03017527 | Feb 2003 | WO |
03021905 | Mar 2003 | WO |
WO03047124 | Jun 2003 | WO |
03067783 | Aug 2003 | WO |
03079577 | Sep 2003 | WO |
03096635 | Nov 2003 | WO |
03105370 | Dec 2003 | WO |
2004010573 | Jan 2004 | WO |
2004015909 | Feb 2004 | WO |
2004025869 | Mar 2004 | WO |
2004025986 | Mar 2004 | WO |
2004032369 | Apr 2004 | WO |
WO2004066666 | Aug 2004 | WO |
2004084480 | Sep 2004 | WO |
2004102864 | Nov 2004 | WO |
2004107768 | Dec 2004 | WO |
2004114582 | Dec 2004 | WO |
2005020464 | Mar 2005 | WO |
2005034383 | Apr 2005 | WO |
2005036913 | Apr 2005 | WO |
2005053177 | Jun 2005 | WO |
2005060192 | Jun 2005 | WO |
2006004948 | Jan 2006 | WO |
2006071761 | Jul 2006 | WO |
2006115979 | Nov 2006 | WO |
WO2007000620 | Jan 2007 | WO |
2007016553 | Feb 2007 | WO |
2007024963 | Mar 2007 | WO |
WO2007029958 | Mar 2007 | WO |
2007053840 | May 2007 | WO |
WO2007060093 | May 2007 | WO |
WO2007060229 | May 2007 | WO |
2008005890 | Jan 2008 | WO |
WO2008012265 | Jan 2008 | WO |
2008027192 | Mar 2008 | WO |
2008156061 | Dec 2008 | WO |
2009105611 | Aug 2009 | WO |
WO2009108586 | Sep 2009 | WO |
2009137464 | Nov 2009 | WO |
WO2009140338 | Nov 2009 | WO |
2009152138 | Dec 2009 | WO |
2010014968 | Feb 2010 | WO |
2011028978 | Mar 2011 | WO |
Entry |
---|
3GPP Draft; 25814-150, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, vol. RAN WG1, No. Shanghai, China; 20060526, May 26, 2006, XP050102001 pp. 29-30 p. 76 pp. 89-90. |
Huaiyu, D. et al., “Asymptotic spectral efficiency of multi cell MIMO systems with frequency-flat fading,” IEEE Transactions on Signal Processing, IEEE Service Center, New York, NY, US, vol. 51, No. 11, Nov. 1, 2003, pp. 2976-2988, XP011102811. |
International Search Report—PCT/US2010/032858—International Search Authority, European Patent Office, Dec. 15, 2010. |
Meyr, H. et al., “Chapter 5: Synthesis of Synchronization Algorithms” and “Chapter 8: Frequency Estimation,” Jan. 1, 1998, Digital Communication Receivers:Synchronization,Channel Estimation, and Signal Processing; John Wiley and Sons, Inc.: New York, pp. 271-323,445, XP002547568. |
Pais, A.V., et al., “Indoor DS-CDMA system deployment and performance with successive interference cancellation,” Electronics Letters: GB, vol. 40, No. 19, Sep. 16, 2004, pp. 1200-1201, XP006022654. |
Ritt: “Performance of IDMA-based inter-cell interference cancellation,” 3GPP Draft TSG-RAN WG1 #44-bis Meeting, R1-060895, 3rd Generation Partnership Project (3GPP), Athens, Greece; Mar. 27, 2006, XP050101801, pp. 1-5. |
Written Opinion—PCT/US2010/032858—ISA/EPO—Dec. 15, 2010. |
Natali F D: “AFC Tracking Algorithms” IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, US, vol. COM-32, No. 8, Aug. 1, 1984, pp. 935-947, XP000758571 ISSN: 0090-6778 abstract p. 941, section C. |
Olivier J.C., et al., “Single antenna interference cancellation for synchronised GSM networks using a widely linear receiver” (Feb. 1, 2007) pp. 131-136, XP006028092. |
Sawahashi M., et al., “Multipath Interference Canceller for Orthogonal Multiplexed Channel and its Performance in W-CDMA Forward Link,” Technical Report of the Institute of Electronics, Information and Communication Engineers, Jan. 12, 2001, vol. 100, No. 558, pp. 27-33, RCS2000-195. |
Taiwan Search Report—TW099113967—TIPO—Jan. 8, 2013. |
Chunguang, W., et al., “Enhanced OTDOA Technology in 3G Location Service”, Shanghai Research Institute of China Telecom, Shanghai 200122, China, Aug. 31, 2005. |
Xiaofa, L., “The study of Interference Cancellation based on Multi-User Detection”, Chinese Scientific Papers Online, pp. 7, Mar. 27, 2008. |
Divsalar, D., et al., “Improved parallel interference cancellation for CDMA”, Communications, IEEE Transactions on, Feb. 1998, Volume: 46, Issue: 2, pp. 258-268. |
3rd Generation Partnership, Project 2 “3GPP2” Physical Layer Standard for cdma2000,Spread Spectrum Systems. Revision D, 3GPP2 C.50002-D, Version 2.0, 30 Sep. 2005 (538 pages). |
Chen, B.Y., et al., “Using H.264 Coded Block Patterns for Fast Inter-Mode Selection” Multimedia and Expo, 2008 IEEE International Conference on, IEEE, Piscataway, NJ, USA, Jun. 23, 2008, pp. 721-724, XP031312823 ISBN: 978-1-4244-2570-9. |
JVT: “Draft ITU-T Recommendation and Final Draft International Standard of Joint Video Specification (ITU-T Rec.H .264 ISO/IEC 14496-10 AVC)”, 7. JVT Meeting; 64. MPEG Meeting; 07-03-2003-14-13-2003; Pattaya,TH; (Joint Video Team of ISO/IEC JTC1/SC29/WG11 and ITU-T 56.16 ), No. JVT-G050r1, Mar. 14, 2003, XP030005712, ISSN: 0000-0427. |
Lakkavalli, S., et al., “Stretchable Architectures for Next Generation Cellular Networks”, ISART'03, Mar. 4, 2003, 7 pages. |
NTT DoCoMo: “Text proposals for detailed channel coding,” 3GPP TSG-RAN WG1 #7, R1-99b49, Aug. 1999, pp. 24. |
“Soft Handoff and Power Control in IS-95 CDMA”, CDMA95.10, Dec. 6, 1999, pp. 181-212. |
Tseng, S-M., et al., Fuzzy adaptive parallel interference cancellation and vector channel prediction for CDMA in fading channels, Communications, 2002. Icc 2002. IEEE International Conference on, 2002, vol. 1, pp. 252-256. |
Qualcomm Europe: “On E-DCH structure”, 3GPP Draft, R1-040538, 3RD Generation Partnership Project (3GPP), Mobile Competence Centre, 650, Route Des Lucioles, F-06921 Sophia-Antipolis Cedex, France, vol. RAN WG1, no. Montreal, Canada, May 6, 2004, XP050098746, [retrieved on May 6, 2004] Section 3. |
Qualcomm Incorporated: “Introducing Enhancements to CS voice over DCH,” 3GPP Draft; R1-123809 (3GPP),Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; FR, vol. RAN WG1, no. Qingdao, China; Aug. 13, 2012-Aug. 17, 2012, Aug. 5, 2012. XP050661662. |
Wu Q ., et al., “The cdma2000 High Rate Packet Data System”, Internet Citation, Mar. 26, 2002, XP002303829, Retrieved from the Internet: URL: http://www.qualcomm.com/technology/1xe v-do/publishedpapers/cdma2000 HighRatePacket.pdf [retrieved on Nov. 3, 2004] Sections 3.1.7 and 3.2. |
Philips, “Mapping of Transport Channels to Physical Channels [online],” 3GPP TSG-RAN WG2#51 R2-060424, <URL: http://www.3gpp.org/ftp/tsg—ran/WG2—RL2/TSGR2—51/Documents/R2-060424.zip>, Feb. 2006. |
Number | Date | Country | |
---|---|---|---|
20100278227 A1 | Nov 2010 | US |