Patent Grant
9408165
The present invention relates generally to digital communications, and more specifically, to techniques for reducing transmission power and improving the capacity of wireless digital communications systems.
Wireless communications systems are widely deployed to provide various types of communication such as voice, packet data, and so on. These systems may be based on code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), or other multiple access techniques. For example, such systems can conform to standards such as Third-Generation Partnership Project 2 (3gpp2, or “cdma2000”), Third-Generation Partnership (3gpp, or “W-CDMA”), or Long Term Evolution (“LTE”). In the design of such communications systems, it is desirable to maximize the capacity, or the number of users the system can reliably support, given the available resources. Several factors impact the capacity of a wireless communications system, some of which are described below.
For example, in a voice communications system, a vocoder is often employed to encode a voice transmission using one of a plurality of variable encoding rates. The encoding rate may be selected based on, e.g., the amount of speech activity detected during a particular time interval. In a vocoder for a cdma2000 wireless communication system, for example, speech transmissions may be sent using full rate (FR), half rate (HR), quarter rate (QR), or eighth rate (ER) frames, with a full rate frame containing the greatest number of traffic bits, and an eighth rate frame containing the least number of traffic bits. An eighth rate frame is usually sent during periods of silence, and generally corresponds to the lowest-rate transmission that may be achieved by the voice communications system.
While an eighth rate frame represents a reduced-rate transmission in a cdma2000 system, the eighth rate frame still contains a non-zero number of traffic bits. During certain intervals, e.g., relatively long periods wherein there is no speech activity and background noise remains constant, even the eighth rate frame transmissions may unnecessarily consume a significant level of transmission power in the system. This may raise the level of interference caused to other users, thereby undesirably decreasing system capacity.
It would be desirable to provide techniques to further decrease the transmission rate of a voice communications system below what minimum-rate frame transmissions such as eighth rate frame transmissions can provide.
In another aspect of a wireless communications system, transmissions between two units often employ a degree of redundancy to guard against errors in the received signals. For example, in a forward link (FL) transmission from a base station (BS) to a mobile station (MS) in a cdma2000 wireless communications system, redundancies such as fractional-rate symbol encoding and symbol repetition may be employed. In a cdma2000 system, encoded symbols are grouped into sub-segments known as power control groups (PCG's) and transmitted over the air, with a fixed number of PCG's defining a frame.
While symbol redundancy techniques such as those employed in cdma2000 may allow accurate recovery of transmitted signals in the presence of errors, such techniques also represent a premium in the overall system transmission power when signal reception conditions are good, which may also undesirably decrease the system capacity.
It would be further desirable to provide efficient techniques to, for example, terminate transmission of a frame when it is determined that the receiver has accurately recovered the information associated with that frame, thereby saving transmission power and increasing the system capacity. It would be further desirable to provide modified power control schemes to accommodate such techniques.
An aspect of the present disclosure provides a method of processing information according to a plurality of rates, the method comprising: receiving a current frame containing traffic information; determining whether the current frame is of a critical frame type; if the current frame is determined to be of a critical frame type, processing the traffic information for transmission; if the current frame is determined to be not of a critical frame type, determining whether the current frame is guaranteed for transmission; if the current frame is determined to be not guaranteed for transmission, processing a null rate for transmission, the null rate having a reduced information bitrate compared to the traffic information; and transmitting the result of said processing for transmission.
Another aspect of the present disclosure provides a method for power control of transmissions over a wireless channel, comprising: receiving a current frame, the frame being formatted into a plurality of sub-segments; processing the received frame according to physical layer protocols, the processing comprising determining whether the received frame was correctly received; determining whether the current received frame is a null rate frame; and if the current received frame is determined to be a null rate frame, not updating an outer loop power control algorithm with the result of whether the current received frame was correctly received.
Yet another aspect of the present disclosure provides an apparatus for processing information according to a plurality of rates, the apparatus comprising: a systematic blanking module configured to: receive a current frame containing traffic information; determine whether the current frame is of a critical frame type; if the current frame is determined to be of a critical frame type, process the traffic information for transmission; if the current frame is determined to be not of a critical frame type, determine whether the current frame is guaranteed for transmission; if the current frame is determined to be not guaranteed for transmission, process a null rate for transmission, the null rate having a reduced information bitrate compared to the traffic information; the apparatus further comprising: a transmitter configured to transmit the result of said processing for transmission.
Yet another aspect of the present disclosure provides an apparatus for power control of transmissions over a wireless channel, the apparatus comprising: a receiver configured to receive a current frame, the frame being formatted into a plurality of sub-segments; a processor configured to: process the received frame according to physical layer protocols; determine whether the received frame was correctly received; determine whether the current received frame is a null rate frame; and if the current received frame is determined to be a null rate frame, not update an outer loop power control algorithm with the result of whether the current received frame was correctly received.
Yet another aspect of the present disclosure provides an apparatus for processing information according to a plurality of rates, the apparatus comprising: systematic blanking means for processing a current frame containing traffic information for transmission; and a transmitter configured to transmit the result of said processing for transmission.
Yet another aspect of the present disclosure provides a computer-readable storage medium storing instructions for causing a computer to process information according to a plurality of rates, the medium further storing instructions for causing a computer to: receive a current frame containing traffic information; determine whether the current frame is of a critical frame type; if the current frame is determined to be of a critical frame type, process the traffic information for transmission; if the current frame is determined to be not of a critical frame type, determine whether the current frame is guaranteed for transmission; and if the current frame is determined to be not guaranteed for transmission, process a null rate for transmission, the null rate having a reduced information bitrate compared to the traffic information.
The detailed description set forth below in connection with the appended drawings is intended as a description of exemplary embodiments of the present invention and is not intended to represent the only exemplary embodiments in which the present invention can be practiced. The term “exemplary” used throughout this description means “serving as an example, instance, or illustration,” and should not necessarily be construed as preferred or advantageous over other exemplary embodiments. The detailed description includes specific details for the purpose of providing a thorough understanding of the exemplary embodiments of the invention. It will be apparent to those skilled in the art that the exemplary embodiments of the invention may be practiced without these specific details. In some instances, well known structures and devices are shown in block diagram form in order to avoid obscuring the novelty of the exemplary embodiments presented herein.
In this specification and in the claims, it will be understood that when an element is referred to as being “connected to” or “coupled to” another element, it can be directly connected or coupled to the other element or intervening elements may be present. In contrast, when an element is referred to as being “directly connected to” or “directly coupled to” another element, there are no intervening elements present.
Communications systems may use a single carrier frequency or multiple carrier frequencies. Referring to
Modern communications systems are designed to allow multiple users to access a common communications medium. Numerous multiple-access techniques are known in the art, such as time division multiple-access (TDMA), frequency division multiple-access (FDMA), space division multiple-access, polarization division multiple-access, code division multiple-access (CDMA), and other similar multi-access techniques. The multiple-access concept is a channel allocation methodology which allows multiple user access to a common communications link. The channel allocations can take on various forms depending on the specific multi-access technique. By way of example, in FDMA systems, the total frequency spectrum is divided into a number of smaller sub-bands and each user is given its own sub-band to access the communications link. Alternatively, in TDMA systems, each user is given the entire frequency spectrum during periodically recurring time slots. In CDMA systems, each user is given the entire frequency spectrum for all of the time but distinguishes its transmission through the use of a code.
While certain exemplary embodiments of the present disclosure may be described hereinbelow for operation according to the cdma2000 standard, one of ordinary skill in the art will appreciate that the techniques may readily be applied to other digital communications systems. For example, the techniques of the present disclosure may also be applied to systems based on the W-CDMA (or 3gpp) wireless communications standard, and/or any other communications standards. Such alternative exemplary embodiments are contemplated to be within the scope of the present disclosure.
In general, the rate of the voice frame 210a selected by the vocoder 210 to encode the voice signal 200a at any time may depend on the level of speech activity detected in the voice signal 200a. For example, a full rate (FR) may be selected for frames during which the voice signal 200a contains active speech, while an eighth rate (ER) may be selected for frames during which the voice signal 200a contains silence. During such periods of silence, an ER frame may contain parameters characterizing the “background noise” associated with the silence. While an ER frame contains significantly fewer bits than an FR frame, silence periods may occur quite often during a normal conversation, thereby causing the overall transmission bandwidth devoted to transmitting ER frames to be significant.
It would be desirable to further reduce the transmission bandwidth required to convey the voice signal 200a to a receiver.
The voice frame 310a is provided to a systematic blanking module 315, which in turn provides a processed voice frame 315a to the physical layer processing module 220. As further described hereinbelow, the systematic blanking module 315 is configured to minimize the transmission bitrate of the vocoder output 310a by selectively “blanking” the vocoder output, i.e., replacing certain frames of the vocoder output 310a with null rate (NR) frames having a data rate less than that of the eighth rate frame. In an exemplary embodiment, NR frames may have zero traffic content, i.e., a traffic bitrate of 0 bits per second (bps).
At step 410, the systematic blanking module 315 receives a frame 310a from the vocoder 310.
At step 420, the frame 310a is evaluated to determine whether it is FR, HR, QR, or ER-C. Such rates are deemed critical for transmission, and may also be referred to as critical frame types. If the frame 310a contains one of these critical rates, then the frame 310a is directly provided to the physical layer processing module 220 for transmission. If not, the frame is deemed to contain a non-critical rate, and the algorithm proceeds to step 430.
Note the exemplary designation of FR, HR, QR, and ER-C as “critical” is for illustrative purposes only, and is not meant to restrict the scope of the present disclosure to only those embodiments wherein such frame types are designated as critical. In alternative exemplary embodiments, other sets of frame types may be designated critical for transmission by a systematic blanking module. Such alternative exemplary embodiments are contemplated to be within the scope of the present disclosure.
At step 430, the algorithm evaluates a frame number of the current frame to be transmitted to determine whether the current frame is guaranteed for transmission. In an exemplary embodiment, a guaranteed transmission may include a non-zero rate (e.g., non-NR) transmission. In an exemplary embodiment, a frame number may be a number assigned to each frame that is continuously iterated for each successive frame. In the exemplary embodiment shown, the current frame number FrameNumber is added to the current frame offset FrameOffset, and the result (FrameNumber+FrameOffset) is applied to a modulo operation (mod) with a non-blanking interval parameter N. If the result of the modulo operation is 0, the algorithm proceeds to step 440. Otherwise, the algorithm proceeds to step 450.
One of ordinary skill in the art will appreciate that techniques other than the specific evaluation shown at step 430 may readily be applied to specify which frames are to be guaranteed for transmission. Such alternative techniques may utilize, e.g., parameters other than the current frame number or current frame offset, or operations other than the modulo operation depicted.
At step 450, the systematic blanking module 315 provides a null rate (NR) frame to the physical layer processing module 220 for transmission. In an exemplary embodiment, a null rate frame has a traffic data rate of 0 bps (bits per second), and thus consumes minimal signaling bandwidth. After transmission of the null rate frame, the algorithm returns to step 410 to receive the next voice frame 310a from the vocoder 310.
Based on the above description, one of ordinary skill in the art will appreciate that the non-blanking interval N controls how often non-critical frames are transmitted, with N=1 corresponding to transmission of all non-critical frames, and greater values of N corresponding to less frequent transmissions of non-critical frames. In an exemplary embodiment, N may take on values of 1, 4 by default, 8, or other reserved values specified, e.g., by external signaling (not shown).
In
In
In
At step 620, physical layer receive (RX) processing is performed using, e.g., operations complementary to the physical layer TX operations 220 shown in
At step 630, the algorithm 600 evaluates whether the current received frame is an NR frame. If yes, the algorithm returns to step 610 to begin receiving the next frame, as there is no traffic data to be processed for the NR frame. If no, the algorithm proceeds to step 640.
One of ordinary skill in the art will appreciate that various techniques may be employed to evaluate whether the current received frame is an NR frame. In an exemplary embodiment, an energy evaluation algorithm may be employed to detect the energy in the traffic portion of the received frame. For example, the energy corresponding to the traffic portion of a received frame may be measured, and compared to an appropriate scaled energy threshold. If the measured energy is less than the threshold, then a NR frame may be declared, since, in an exemplary embodiment, no signal is expected to be transmitted by the transmitter in the traffic portion of the NR frame. Such energy evaluation algorithms may also utilize knowledge of the systematic blanking algorithm and non-blanking interval N used by the transmitter to further assist in the detection of NR frames.
Note the preceding description of possible NR detection algorithms is given for illustrative purposes only, and is not meant to limit the scope of the present disclosure to any particular NR detection algorithms.
At step 640, a parameter of the received non-NR frame may be used to update an outer loop power control (OLPC) algorithm at the receiver. In an exemplary embodiment, a parameter of the received non-NR frame may include, e.g., the result of whether a frame quality indicator (FQI), such as a CRC for the received frame, has passed a quality check. One of ordinary skill in the art will appreciate that an OLPC algorithm may be used to, e.g., compute an appropriate signal-to-interference ratio (SIR) setpoint for received frames, which may be used to guide a power control feedback mechanism between the transmitter and receiver for the transmitted voice frames. By excluding quality check results derived from NR frames, the OLPC algorithm may be correctly updated using, e.g., only frames having significant transmitted energy for the traffic portion.
At step 650, the voice frame may be decoded to a voice output 650a, and the algorithm 600 returns to step 610 to receive the next frame.
The voice frame 710a is provided to a systematic blanking module 715, which in turn provides a processed voice frame 715a to the physical layer processing module 220. As further described hereinbelow, the systematic blanking module 715 is configured to minimize the transmission bitrate of the vocoder output 710a by selectively replacing certain frames of the vocoder output 710a with null rate (NR) or null-rate indicator (NRID) frames having little or no data content.
At step 810, the systematic blanking module 715 receives a frame 710a from the vocoder 710.
At step 820, the frame 710a is evaluated to determine whether it is FR, HR, QR, or ER. Such rates are deemed critical for transmission. If the frame 710a contains one of these critical rates, then the frame 710a is provided to the physical layer processing module 220 for transmission at step 840. If not, the frame is deemed to contain a non-critical rate, and the algorithm proceeds to step 830.
At step 830, the algorithm evaluates the current frame number of the transmission to determine whether a non-zero transmission should be made. In the exemplary embodiment shown, the current frame number FrameNumber is added to the current frame offset FrameOffset, and the result (FrameNumber+FrameOffset) is applied to a modulo operation (mod) with a non-blanking interval parameter N. If the result of the modulo operation is 0, the algorithm proceeds to step 835. Otherwise, the algorithm proceeds to step 850.
At step 835, a null rate indicator (NRID) frame may be transmitted. Such a frame may correspond to a predetermined frame or indicator recognizable to the receiver as containing no new information, also referred to as a frame comprising null traffic data. Null traffic data may contain a bit pattern that the receiving vocoder does not use, and thus the null traffic data will be discarded by the receiving vocoder. In one aspect, for example, the predetermined null frame or indicator may be a known 1.8-kbps frame having null traffic data. In another aspect, for example, the predetermined frame or indicator may repeat the last transmitted 1.8-kbps frame, thereby indicating null traffic data.
At step 850, the systematic blanking module 715 provides a null rate (NR) frame to the physical layer processing module 220 for transmission. In an exemplary embodiment, a null rate frame contains no traffic bits, and thus consumes minimal signaling bandwidth. After transmission of the null rate frame, the algorithm returns to step 810 to receive the next voice frame 710a from the vocoder 710.
In
In
In
At step 1020, a decision block determines the result of the determination at step 1010.
At step 1030, if new traffic information exists, a traffic portion comprising data representing the new traffic information can be added to a frame.
At step 1040, if no new traffic information exists, then no new frame is transmitted unless the respective frame corresponds to the frame guaranteed for transmission. In this case, generate the frame guaranteed for transmission including null traffic data recognizable by the receiving vocoder as the null data rate.
In
One of ordinary skill in the art will appreciate in light of the present disclosure that alternative pilot gating patterns may be readily derived to signal the presence of null frames. For example, the pilot gating pattern may include pilot transmissions every other sub-segment or PCG, or using any other pattern. Such alternative techniques are contemplated to be within the scope of the present disclosure.
In another aspect of the present disclosure, to further reduce the signal transmissions of the system, the power control rate of the forward link and/or reverse link of the system may be reduced. In an exemplary embodiment, the mobile station may reduce the number of forward link power control commands it sends to the base station, such as by only sending forward link power control commands only during PCG's corresponding to the gated reverse link pilot transmissions, even in frames where the reverse link pilot portion is continuous (i.e., non-gated). In another exemplary embodiment, the base station may transmit reverse link power control commands at a reduced rate, such as in every other power control group. Further, the mobile station receiving these reverse link power control commands may apply each one to control transmissions of non-null frames. For null frames, a reduced number (e.g. less than all) of the received power control commands from the base station may be utilized to control the mobile station's transmissions of null frames, such as when the reverse link pilot portion is gated, as described above. These exemplary power control techniques are further described with reference to
In
Note in
In
In
In
For example, the RL PC command sent by the base station in FL PCG #1 is applied by the mobile station in transmitting RL PCG #3, etc. On the other hand, the RL PC command sent by the base station in FL PCG #2 is not applied by the mobile station in transmitting RL PCG #4. Instead, in an exemplary embodiment, the mobile station can maintain the same power level as used for the previous PCG, e.g., RL PCG #3 in the example described. In an aspect of the present disclosure, this may be done to simplify the processing of RL PC commands by the mobile station.
At step 1510, a current frame is received, the frame being formatted into a plurality of sub-segments.
At step 1520, the received frame is processed according to physical layer protocols.
At step 1530, a power control command received in a sub-segment designated for transmission according to a first gated pilot pattern is received.
At step 1540, the transmission power of a TX sub-segment following the designated sub-segment is adjusted according to the received power control command, the TX sub-segment being transmitted according to a second gate pilot pattern.
According to another aspect of the present disclosure, techniques are provided for early termination of forward and/or reverse link transmissions in a wireless communications system to save power and increase capacity.
Note the frame processing scheme is shown for illustrative purposes only, and is not meant to restrict the scope of the present disclosure to any particular processing scheme shown. Alternative exemplary embodiments of the present disclosure may adopt alternative frame processing schemes which may, e.g., re-order the steps of the scheme shown in
In
At step 1600, a frame-quality indicator (FQI) may be generated and appended to the information bits 1600b for a frame. For example, an FQI may be a cyclical-redundancy check (CRC) known to one of ordinary skill in the art. Signal 1600a represents the combination of the information bits 1600b and the FQI, as also illustrated in
At step 1610, encoder tail bits may be added to the signal 1600a. For example, encoder tail bits may represent a fixed number of zero-valued tail bits for use with a convolutional encoder. Signal 1610a represents the combination of signal 1600a with the encoder tail bits, as also illustrated in
At step 1620, the signal 1610a is encoded and repeated (or punctured). As earlier described, the encoding may include convolutional encoding or turbo encoding, and the repetition may serve to further increase (or decrease, in the case of puncturing) the transmitted energy associated with each symbol. Note the encoding may employ other techniques known to one of ordinary skill in the art, such as block encoding or other types of encoding, and need not be limited to the encoding explicitly described in the present disclosure. The signal 1620a represents the encoded and repeated (or punctured) version of signal 1610a, as also illustrated in
At step 1630, the signal 1620a is interleaved, e.g., to improve the diversity of the encoded symbols along a chosen signal dimension. In an exemplary implementation, the symbols may be interleaved over time. Signal 1630a represents the interleaved version of signal 1620a, as also illustrated in
At step 1640, the interleaved symbols of signal 1630a are mapped to a pre-defined frame format, as also illustrated in
In certain exemplary embodiments, the interleaved symbols may be mapped in time, frequency, code, or any other dimensions used for signal transmission. Furthermore, a frame format may also specify the inclusion of, e.g., control symbols (not shown) along with the interleaved symbols of signal 1630a. Such control symbols may include, e.g., power control symbols, frame format information symbols, etc. Signal 1640a represents the output of the symbol-to-frame mapping step 1640, as also illustrated in
At step 1650, the signal 1640a is modulated, e.g., onto one or more carrier waveforms. In certain exemplary embodiments, the modulation may employ, e.g., QAM (quadrature amplitude modulation), QPSK (quadrature phase-shift keying), etc. Signal 1650a represents the modulated version of the signal 1640a, as also illustrated in
At step 1660, the modulated signal 1650a is further processed, transmitted over the air, and received by a receiver. Step 1660 generates the received symbols 1700a, further denoted by the variable y in
In
On the MS side, the MS receives at 1710 the PCG's transmitted. Upon receiving the last PCG (i.e., PCG #15) of RX Frame #0 corresponding to TX Frame #0, the MS begins decoding RX Frame #0 using all PCG's received. The decoded information is available a decoding time TD thereafter. In an exemplary embodiment, the decoding may be performed as described hereinbelow with reference to
At step 1805, symbols y or 1700a are received for an entire frame.
At step 1810, the symbols y or 1700a are demodulated, parsed, and deinterleaved to produce symbols y′, also denoted as signal 1810a. One of ordinary skill in the art will appreciate that the operations performed at step 1810 may correspond to an inverse of the operations performed at the transmitter, as shown in, e.g.,
At step 1820, the symbols y′ are decoded and combined, given knowledge of the rate R. In an implementation, the rate R may indicate how many bits are present in a received frame, and may be used, e.g., by the decoder to determine at which point in the received symbol sequence to terminate decoding, and/or remove tail bits from the decoded sequence. At step 1820, tail bits of the decoded sequence, e.g., as appended at step 1610 of
At step 1830, the FQI, e.g., as appended at step 1600 of
At step 1840, the method may proceed to the next frame, and repeat the steps described above for the next frame.
In accordance with the present disclosure, early frame decoding and termination techniques as described hereinbelow may allow the overall communications system 100 to operate more efficiently and save transmission power, thereby increasing cellular capacity.
In
Upon receiving the ACK 1945, the BS ceases transmission of PCG's corresponding to TX Frame #0, and waits until the beginning of the next frame, TX Frame #1, before transmitting PCG's for the new frame TX Frame #1. Note during the finite period of time associated with receiving and processing the ACK signal 1945, the BS may already have begun transmitting PCG #9 of TX Frame #0.
Reference numerals 1910 through 1940 illustrate the timing of actions taken by the MS to generate the ACK signal 1945 sent to the BS that allows early termination of TX frame transmissions by the BS.
At 1910, the MS receives the PCG's for TX Frame #0 and TX Frame #1 as RX Frame #0 and RX Frame #1, respectively.
At 1920, the MS attempts to decode RX Frame #0 as each PCG of RX Frame #0 is received, without waiting for all sixteen PCG's allocated to RX Frame #0 to be received. In an exemplary embodiment, to accomplish such decoding on a per-PCG basis, the MS may utilize a per-sub-segment decoding algorithm such as 2000 later described hereinbelow with reference to
At 1925, after receiving PCG #7, the MS successfully decodes RX Frame #0, as determined by, e.g., checking the CRC associated with the received bits. The MS declares a decoding success, and proceeds to the ACK transmission 1930.
At 1930, after declaring decoding success at 1925, the MS transmits an MS ACK signal 1945 to the BS during a portion of the transmission associated with PCG #8 of the reverse link.
In an exemplary embodiment, the MS may simply transmit the ACK signal during the PCG immediately subsequent to, or at any PCG subsequent to, the PCG in which a decoding success is determined. In an alternative exemplary embodiment such as that shown in
In
Note the particular ACK mask configurations shown herein are for illustrative purposes only, and are not meant to restrict the scope of the present disclosure to any ACK mask shown. One of ordinary skill in the art will appreciate that alternative ACK mask configurations may readily be provided to allow ACK transmission during different portions of the sub-segments or PCG's than those shown. Such alternative exemplary embodiments are contemplated to be within the scope of the present disclosure.
In an exemplary embodiment, the PCG's designated by the ACK mask pattern may overlap with the same PCG's as prescribed by a pattern for an RL gated pilot pattern used to signal an NR frame transmission, such as earlier described herein with reference to
In an exemplary embodiment, the BS TX may also include a pilot transmission (not shown) that may switch from a continuously transmitted pilot signal to a gated pilot signal upon receiving the MS ACK 1945, the gated pilot signal being transmitted according to a gated pilot pattern.
In
At step 2005, the method receives symbols yn for sub-segment n.
At step 2010, the method demodulates, parses, and deinterleaves all symbols yn received up to and including sub-segment n of the current frame. yn may include, e.g., all traffic symbols received from sub-segment 0 through sub-segment n, inclusive. The result of step 2010 is denoted as y′n.
At step 2020, the method decodes and combines the symbols y′n. One of ordinary skill in the art will appreciate that while the symbols y′n in general correspond to only a portion of the total symbols x allocated by the transmitter for the entire frame, “early” decoding of the entire frame using only the symbols y′n may nevertheless be attempted. Such an early decoding attempt may have a good chance of decoding success due to, e.g., redundancy in the symbols x introduced by fractional rate encoding and/or repetition, e.g., at step 1620 of
At step 2020, the encoded tail bits may further be removed from the decoded bit sequence to generate the signal 2020a.
At step 2030, the method checks the FQI from the signal 2020a, and generates an FQI result 2030a from the accumulated received sub-segments for the current frame up to n.
At step 2035, the method evaluates whether the FQI result indicated a success. If yes, the method proceeds to step 2040, wherein decoding is declared successful, and the method proceeds to ACK message generation to enable early termination of forward link transmissions. The next available opportunity may be, e.g., as specified by an ACK mask as described with reference to
At step 2037, the method increments n, and determines whether there are additional sub-segments left in the frame to be received. If yes, the method returns to step 2005. If no, the method proceeds to declare decoding for the frame unsuccessful at step 2060.
At step 2070, the decoder proceeds to evaluate the next frame.
As further shown in the implementation 2100, the symbol puncture rates are 1/5, 1/9, None, and None, depending on the frame symbol rate. In the exemplary embodiment 2110 according to the present disclosure, the symbol puncture rates are 1/3, 1/5, 1/25, and None, depending on the frame symbol rate. One of ordinary skill in the art will appreciate that the increased puncturing in the exemplary embodiment 2110 may be used to accommodate the increased length CRC's called for by the exemplary embodiment 2110.
In
Note the exemplary embodiment of the reverse link ACK signaling scheme shown with reference to
In
Reference numerals 2310 through 2340 illustrate the timing of actions taken by the BS to generate the ACK signal 2345 sent to the MS that allows early termination of reverse link frame transmissions by the MS.
At 2310, the BS receives the PCG's of TX Frame #0 and TX Frame #1 as RX Frame #0 and RX Frame #1, respectively.
At 2320, the BS attempts to decode RX Frame #0 as each individual PCG is received, without waiting for all sixteen PCG's allocated to RX Frame #0 to be received. In an exemplary embodiment, to accomplish such decoding on a per-PCG basis, the BS may utilize a per-sub-segment decoding algorithm such as 2000 earlier described with reference to
At 2325, after receiving PCG #5, the BS declares a decoding success, and proceeds to the ACK transmission step 2330 to generate the BS ACK TX signal.
At 2330, after declaring decoding success at step 2325, the BS transmits an ACK signal 2345 during a portion of the transmission associated with PCG #8 of the Forward Link. The portion of the transmission during which an ACK signal 2345 is sent may be defined by a corresponding ACK mask 2340.
In an exemplary embodiment, the ACK mask pattern may allow ACK transmission only during those PCG's in which a power control command is sent on the forward link (FL) to control reverse link (RL) power transmissions, as earlier described herein with reference to
In
In the exemplary embodiment shown, the RL pilot signal is gated OFF during PCG's 9, 10, 13, and 14. In general, the RL pilot signal may be gated OFF in alternating groups of two PCG's after the ACK signal is transmitted, until the end of the early terminated frame. It should further be noted that, as with pilot gating of NR frames, various schemes may be utilized for the pilot gating of early terminated frames, such as: one power control group on followed by one power control group off; two power control groups on followed by two power control groups off; and any other pattern operable to reduce transmission power.
As further shown in the implementation 2400, the symbol puncture rates are 1/5, 1/9, None, and None, depending on the frame symbol rate. In the exemplary embodiment 2410 according to the present disclosure, the symbol puncture rates are 1/3, 1/5, 1/25, and None, depending on the frame symbol rate. One of ordinary skill in the art will appreciate that the increased use of puncturing in the exemplary embodiment 2410 may accommodate the increased length CRC's that are also present in the exemplary embodiment 2410.
In an exemplary embodiment, the ACK signal sent by the BS to the MS may be provided by supplanting (puncturing) a bit having a predetermined position on a forward link traffic channel, and/or using on-off keying (OOK) at the predetermined position to signal an ACK or NAK (no acknowledgment) to the MS. In an exemplary embodiment, the predetermined position may be varied on a per-frame basis according to a predetermined pseudorandom bit pattern. In an exemplary embodiment, the ACK bit may be time domain multiplexed (TDM'ed) with a reverse link power control bit.
Note the frame early termination aspects described above may be applied not only to a fundamental channel of a cdma2000 communications link, but also to a “high data rate” supplemental channel. For example, in an alternative exemplary embodiment (not shown), an ACK signaling mechanism on the forward link may be used to enable early termination of transmissions by one or more MS's on one or more corresponding reverse supplemental channels.
For example, in an exemplary embodiment (not shown), one or more MS's may simultaneously transmit frames on corresponding reverse supplemental channels. If the BS successfully receives a frame on a reverse supplemental channel from an MS, the BS may transmit an ACK on a corresponding forward common acknowledgment subchannel of a forward common acknowledgment channel, with one subchannel of each forward common acknowledgment channel assigned to control one reverse supplemental channel. In this manner, forward common acknowledgment subchannels from multiple MS's may be multiplexed on a single forward common acknowledgment channel. For example, in an exemplary embodiment, multiple subchannels may be time multiplexed on a single common acknowledgment channel according to a predetermined pattern known to the BS and the one or more MS's. Such predetermined pattern may be indicated via external signaling (not shown).
The BS may support operation on one or more forward common acknowledgment channels. In an exemplary embodiment, the sub-segments or PCG's in which the forward common acknowledgment channel for the reverse supplemental channels can be transmitted may be indicated by an ACK mask as previously described herein.
In an alternative exemplary embodiment, an ACK signaling mechanism on the reverse link may be provided to control transmissions on both a forward fundamental channel and one or more forward supplemental channels, for systems operating according to the cdma2000 standard.
In
In
As further shown in
As further shown in
One of ordinary skill in the art will appreciate that the above illustrations of specific ACK signaling schemes for the forward link are given for illustrative purposes only, and are not meant to limit the scope of the present disclosure to any particular ACK signaling schemes for the forward and reverse channels.
At step 2610, a voice frame is received.
At step 2620, the method attempts early decoding of the voice frame received. In an exemplary embodiment, the early decoding may be attempted prior to all sub-segments of the frame being received.
At step 2630, the method determines whether the attempted voice frame decoding has been successful. In an exemplary embodiment, a frame quality indicator such as a CRC may be checked to determine whether frame decoding has been successful.
At step 2640, an acknowledgment signal (ACK) is transmitted to terminate voice frame transmission.
The early termination techniques of the present disclosure may readily be applied to situations wherein a mobile station is in “soft handoff,” i.e., wherein an MS communicates simultaneously with multiple BS's on the forward and/or reverse link.
For example, when an MS is in soft handoff between two BS's, the reverse link transmissions by the MS may be received at each of the two BS's, either or both of which may transmit an ACK signal (not necessarily at the same time) back to the MS to cease MS transmissions. In an exemplary embodiment, in response to receiving more than one ACK signal over the course of a reverse link frame transmission, the MS may cease transmission of the current frame after receiving the first of the ACK signals. Furthermore, early termination may be similarly applied to control forward link transmissions by the two BS's to an MS. For example, in response to successful early decoding of a frame received simultaneously from two BS's, an MS may transmit an ACK signal to cease transmissions by both BS's on the forward link. Such alternative exemplary embodiments are contemplated to be within the scope of the present disclosure.
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 would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the exemplary 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 exemplary embodiments of the invention.
The various illustrative logical blocks, modules, and circuits described in connection with the exemplary 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 exemplary 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 Random Access Memory (RAM), flash memory, Read Only Memory (ROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can 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.
In one or more exemplary embodiments, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
The previous description of the disclosed exemplary embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these exemplary embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other exemplary embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the exemplary embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
This application claims priority to U.S. Provisional Application Ser. No. 61/060,119, entitled “Apparatus and Methods for Increasing Capacity in Wireless Communications,” filed Jun. 9, 2008, and U.S. Provisional Application Ser. No. 61/060,408, entitled “Apparatus and Methods for Increasing Capacity in Wireless Communications,” filed Jun. 10, 2008, and U.S. Provisional Application Ser. No. 61/061,546, entitled “Apparatus and Methods for Increasing Capacity in Wireless Communications,” filed Jun. 13, 2008, the contents of which are hereby incorporated by reference in their entirety. This application is a continuation-in-part of U.S. patent application Ser. No. 12/389,211, entitled “Frame Termination,” filed Feb. 19, 2009, which claims priority to U.S. Provisional Application No. 61/030,215, filed Feb. 20, 2008, both assigned to the assignee of the present application, the contents of which are hereby incorporated by reference in their entirety. This application is related to U.S. patent application Ser. No. 12/252,544, entitled “Rate Determination,” filed Oct. 16, 2008, assigned to the assignee of the present application, the contents of which are hereby incorporated by reference in their entirety.
| 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 |
| 6603752 | Saifuddin et al. | Aug 2003 | B1 |
| 6615030 | Saito et al. | Sep 2003 | B1 |
| 6628707 | Rafie et al. | Sep 2003 | B2 |
| 6633601 | Yang | Oct 2003 | B1 |
| 6741661 | Wheatley, III | 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 |
| 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 et al. | 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 |
| 7783312 | Mudigonda et al. | Aug 2010 | B2 |
| 7792074 | Chen et al. | Sep 2010 | B2 |
| 7801248 | Challa et al. | Sep 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 |
| 8428109 | Yang et al. | Apr 2013 | B2 |
| 8442441 | Pfister et al. | May 2013 | B2 |
| 8489128 | Lundby | Jul 2013 | B2 |
| 8503591 | Sikri et al. | Aug 2013 | B2 |
| 8509293 | Sikri et al. | Aug 2013 | B2 |
| 8588119 | Panta et al. | Nov 2013 | B2 |
| 8619928 | Chalia et al. | Dec 2013 | B2 |
| 8660145 | Carmon et al. | Feb 2014 | B2 |
| 8675796 | Sikri et al. | Mar 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 |
| 20040081195 | El-Maleh 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 |
| 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 |
| 20060126491 | Ro et al. | Jun 2006 | A1 |
| 20060126765 | Shin et al. | Jun 2006 | A1 |
| 20060126844 | Mauro | Jun 2006 | A1 |
| 20060141933 | Smee 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 |
| 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 |
| 20090232052 | Black et al. | Sep 2009 | A1 |
| 20090252201 | Smee et al. | Oct 2009 | A1 |
| 20090303968 | Jou et al. | Dec 2009 | A1 |
| 20090303976 | 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 |
| 20100046660 | Sikri et al. | Feb 2010 | A1 |
| 20100054212 | Tang | Mar 2010 | A1 |
| 20100061496 | Black et al. | Mar 2010 | A1 |
| 20100097955 | Jou | Apr 2010 | A1 |
| 20100142479 | Black et al. | Jun 2010 | A1 |
| 20100172383 | Montalvo et al. | Jul 2010 | A1 |
| 20100202544 | Osseirar et al. | Aug 2010 | A1 |
| 20100248666 | Hui et al. | Sep 2010 | A1 |
| 20100278227 | Sikri et al. | Nov 2010 | A1 |
| 20100296556 | Rave et al. | Nov 2010 | A1 |
| 20100310026 | Sikri et al. | Dec 2010 | A1 |
| 20110051859 | Canpolat et al. | Mar 2011 | A1 |
| 20110264976 | Yang et al. | Oct 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 |
| 10500811 | Jan 1998 | GB |
| 233417 | Nov 1999 | GB |
| 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 |
| 2009506660 | Feb 2009 | JP |
| 2009515219 | Apr 2009 | JP |
| 2009545219 | Dec 2009 | JP |
| 2011521373 | Jul 2011 | JP |
| 20000052668SA | Aug 2000 | KR |
| 20000071672 | Nov 2000 | KR |
| 20010031665 | Apr 2001 | KR |
| 20010085143 | Sep 2001 | KR |
| 20020092136 | Dec 2002 | KR |
| 20030059528 | Jul 2003 | KR |
| 20040097893 | Nov 2004 | KR |
| 20040108813 | Dec 2004 | KR |
| 20050073113 | Jul 2005 | KR |
| 102005009755 | 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 |
| 2319307 | Mar 2008 | RU |
| 2323529 | Apr 2008 | RU |
| 365717 | Aug 1999 | TW |
| 200640202 | Nov 2006 | TW |
| 200704232 | Jan 2007 | TW |
| 201008148 | Feb 2010 | TW |
| WO9526593 | Oct 1995 | WO |
| WO9857452 | Dec 1998 | WO |
| WO-9857509 | Dec 1998 | WO |
| WO-9901950 | Jan 1999 | WO |
| WO-9912273 | Mar 1999 | WO |
| 9923844 | May 1999 | WO |
| 9929048 | Jun 1999 | WO |
| WO0033528 | Jun 2000 | WO |
| WO-0035117 | Jun 2000 | WO |
| WO0035126 | Jun 2000 | WO |
| WO-0055992 | Sep 2000 | WO |
| WO0062456 | Oct 2000 | WO |
| WO-0070786 | Nov 2000 | WO |
| 0110056 | Feb 2001 | WO |
| WO0223792 | Mar 2002 | WO |
| 0233877 | Apr 2002 | WO |
| WO-0232003 | Apr 2002 | WO |
| WO-02030004 | Apr 2002 | WO |
| WO-0245288 | Jun 2002 | WO |
| WO-02067444 | Aug 2002 | WO |
| 2002080609 | Oct 2002 | WO |
| WO02103920 | Dec 2002 | WO |
| 03001834 | Jan 2003 | WO |
| WO-03021905 | Mar 2003 | WO |
| WO-03047124 | Jun 2003 | WO |
| WO03105370 | Dec 2003 | WO |
| WO-2004010573 | Jan 2004 | WO |
| WO-2004015909 | Feb 2004 | WO |
| WO2004025986 | Mar 2004 | WO |
| WO-2004066666 | Aug 2004 | WO |
| WO-2004102864 | Nov 2004 | WO |
| 2004114582 | Dec 2004 | WO |
| WO-2004107768 | Dec 2004 | WO |
| 2005020464 | Mar 2005 | WO |
| WO-2005036913 | Apr 2005 | WO |
| WO-2005053177 | Jun 2005 | WO |
| WO-2006004948 | Jan 2006 | WO |
| WO-2006060605 | Jun 2006 | WO |
| WO2006071761 | Jul 2006 | WO |
| 2006115979 | Nov 2006 | WO |
| WO-2007000620 | Jan 2007 | WO |
| WO2007016553 | Feb 2007 | WO |
| WO-2007029958 | Mar 2007 | WO |
| WO-2007053840 | May 2007 | WO |
| WO-2007060093 | May 2007 | WO |
| WO-2007060229 | May 2007 | WO |
| WO-2007140338 | Dec 2007 | WO |
| WO-2008005890 | Jan 2008 | WO |
| WO-2008012265 | Jan 2008 | WO |
| 2008027192 | Mar 2008 | WO |
| WO2008156061 | Dec 2008 | WO |
| WO-2009108586 | Sep 2009 | WO |
| WO-2009137464 | Nov 2009 | WO |
| WO-2009140338 | Nov 2009 | WO |
| WO-2009152138 | Dec 2009 | WO |
| WO-2010014968 | Feb 2010 | WO |
| WO-2011028978 | Mar 2011 | WO |
| Entry |
|---|
| International Search Report & Written Opinion—PCT/US2009/046708, International Search Authority—European Patent Office—Oct. 14, 2009. |
| International Search Report & Written Opinion—PCT/US2009/046717, International Search Authority—European Patent Office—Oct. 7, 2009. |
| International Search Report & Written Opinion—PCT/US2009/046720, International Search Authority—European Patent Office—Nov. 27, 2009 |
| 3rd Generation Partnership, Project 2 “3GPP2” Physical Layer Standard for cdma2000,Spread Spectrum Systems. Revision D, 3GPP2 C.S0002-D, Version 2.0, Sep. 30, 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: Mar. 7, 2003-Mar. 14, 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. |
| Taiwan Search Report—TW098149248—TIPO—Oct. 19, 2012. |
| 3GPP Draft; 25.814-V1.5.0, 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. |
| Chunguang, W., et al., “Enhanced OTDOA Technology in 3G Location Service”, Shanghai Research Institute of China Telecom, Shanghai 200122, China, Aug. 31, 2005. |
| Divsalar, D., et al., “Improved parallel interference cancellation for CDMA”, Communications, IEEE Transactions on, Feb., 1998, vol. 46, Issue: 2, pp. 258-268. |
| 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. |
| 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. |
| 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., “Single antenna interference cancellation for synchronised GSM networks using a widely linear receiver” (Feb. 1, 2007) pp. 131-136, XP006028092. |
| 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, XP05010801, pp. 1-5. |
| 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. |
| Xiaofa, L., “The study of Interference Cancellation based on Multi-User Detection”, Chinese Scientific Papers Online, pp. 7, Mar. 27, 2008. |
| Lakkavalli, S., et al., “Stretchable Architectures for Next Generation Cellular Networks”, ISART'03, Mar. 4, 2003, 7 pages. |
| “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. |
| NTT DoCoMo: “Text proposals for detailed channel coding,” 3GPP TSG-RAN WG#7, R1-99b49, Aug. 1999, pp. 24. |
| 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, 20040506, 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; 20120813-20120817 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, &It:URL: http://www.3gpp.org/ftp/tsg—ran/WG2—RL2/TSGR2—51/Documents/R2-060424.zip>, Feb. 2006. |
| Number | Date | Country | |
|---|---|---|---|
| 20090304024 A1 | Dec 2009 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61060119 | Jun 2008 | US | |
| 61060408 | Jun 2008 | US | |
| 61061546 | Jun 2008 | US |
