Patent Grant
10790861
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”).
Transmissions from a transmitter to a receiver often employ a degree of redundancy to guard against errors in the received signals. For example, in a W-CDMA system, information bits corresponding to a transport channel may be processed using fractional-rate symbol encoding and symbol repetition (or puncturing). Such encoded symbols may be further multiplexed with encoded symbols from one or more other transport channels, grouped into sub-segments known as slots, and transmitted over the air. While symbol redundancy techniques may allow accurate recovery of the information bits in the presence of noise over the channel, such techniques also represent a premium in the overall system transmission power when signal reception conditions are good. Such a premium may undesirably reduce the system capacity, i.e., the number of users the system can reliably support at any given time.
It would be desirable to provide techniques to allow efficient transmission of data in a W-CDMA system to minimize transmission redundancy and increase capacity.
An aspect of the present disclosure provides a method comprising: multiplexing at least two transport channels to generate a composite channel; transmitting symbols corresponding to the composite channel during a first allotted transmission time interval (TTI); receiving an acknowledgment message (ACK) for at least one of the transport channels during the transmitting the symbols; and puncturing the symbols corresponding to the at least one of the acknowledged transport channels for the remainder of the first TTI.
Another aspect of the present disclosure provides an apparatus comprising: a multiplexing module configured to multiplex at least two transport channels to generate a composite channel; a transmitter configured to transmit symbols corresponding to the composite channel during a first allotted transmission time interval (TTI); a receiver configured to receive an acknowledgment message (ACK) for at least one of the transport channels during the transmitting the symbols; and a puncturing module configured to puncture the symbols corresponding to the at least one of the acknowledged transport channels for the remainder of the first TTI.
Yet another aspect of the present disclosure provides an apparatus comprising: means for multiplexing at least two transport channels to generate a composite channel; means for transmitting symbols corresponding to the composite channel during a first allotted transmission time interval (TTI); means for receiving an acknowledgment message (ACK) for at least one of the transport channels during the transmitting the symbols; and means for puncturing the symbols corresponding to the at least one of the acknowledged transport channels for the remainder of the first TTI.
Yet another aspect of the present disclosure provides a computer-readable storage medium storing instructions for causing a computer to: multiplex at least two transport channels to generate a composite channel; transmit symbols corresponding to the composite channel during a first allotted transmission time interval (TTI); receive an acknowledgment message (ACK) for at least one of the transport channels during the transmitting the symbols; and puncture the symbols corresponding to the at least one of the acknowledged transport channels for the remainder of the first TTI.
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 multiple-access techniques. The multiple-access concept is a channel allocation methodology which allows multiple users 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 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 W-CDMA 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 cdma2000 wireless communications standard, and/or any other communications standards. Such alternative exemplary embodiments are contemplated to be within the scope of the present disclosure.
The upper signaling layers of a W-CDMA system support data transmission on one or more transport channels to a specific terminal, with each transport channel (TrCH) being capable of carrying data for one or more services. These services may include voice, video, packet data, and so on, which are collectively referred to herein as “data.”
The data for each transport channel is processed based on one or more transport formats selected for that transport channel. Each transport format defines various processing parameters such as a transmission time interval (TTI) over which the transport format applies, the size of each transport block of data, the number of transport blocks within each TTI, the coding scheme to be used, and so on. The TTI may be specified as 10 milliseconds (ms), 20 ms, 40 ms, or 80 ms. Each TTI can be used to transmit a transport block set having a number of equal-sized transport blocks, as specified by the transport format for the TTI. For each transport channel, the transport format can dynamically change from TTI to TTI, and the set of transport formats that may be used for the transport channel is referred to as the transport format set.
As shown in
Rate matching is then performed on the coded bits in accordance with a rate-matching attribute assigned by higher signaling layers and specified by the transport format at block 218. On the uplink, bits are repeated or punctured (i.e., deleted) such that the number of bits to be transmitted matches the number of available bit positions. On the downlink, unused bit positions are filled with discontinuous transmission (DTX) bits at block 220. The DTX bits indicate when a transmission should be turned off and are not actually transmitted.
The rate-matched bits for each TTI are then interleaved in accordance with a particular interleaving scheme to provide time diversity at block 222. In accordance with the W-CDMA standard, the interleaving is performed over the TTI, which can be selected as 10 ms, 20 ms, 40 ms, or 80 ms. When the selected TTI is longer than 10 ms, the bits within the TTI are segmented and mapped onto consecutive transport channel frames at block 224. Each transport channel frame corresponds to the portion of the TTI that is to be transmitted over a (10 ms) physical channel radio frame period (or simply, a “frame”).
In W-CDMA, data to be transmitted to a particular terminal is processed as one or more transport channels at a higher signaling layer. The transport channels are then mapped to one or more physical channels assigned to the terminal for a communication (e.g., a call). In W-CDMA, a downlink dedicated physical channel (downlink DPCH) is typically assigned to each terminal for the duration of a communication. The downlink DPCH is used to carry the transport channel data in a time-division multiplexed manner along with control data (e.g., pilot, power control information, and so on). The downlink DPCH may thus be viewed as a multiplex of a downlink dedicated physical data channel (DPDCH) and a downlink dedicated physical control channel (DPCCH), as described below. The transport channel data is mapped only to the DPDCH, while the DPCCH includes the physical layer signaling information.
The transport channel frames from all active transport channel processing sections 210 are serially multiplexed into a coded composite transport channel (CCTrCH) at block 232. DTX bits may then be inserted into the multiplexed radio frames such that the number of bits to be transmitted matches the number of available bit positions on one or more “physical channels” to be used for the data transmission at block 234. If more than one physical channel is used, then the bits are segmented among the physical channels at block 236. The bits in each frame for each physical channel are then further interleaved to provide additional time diversity at block 238. The interleaved bits are then mapped to the data portions (e.g., DPDCH) of their respective physical channels at block 240. The bits of the physical channel are spread using orthogonal variable spreading factor (OVSF) codes at block 242, modulated at block 243, and subsequently segmented into physical channel radio frames 244a, 244b, etc. It will be appreciated that the spreading factor (SF) employed may be chosen based on how many bits are to be transmitted in a frame.
Note in this specification and in the claims, a “composite channel” may be defined as any transmission (e.g., DPCH TX) that contains data multiplexed from two or more transport channels.
As shown in
The signal processing shown in
Within each transport channel processing section 260, the transport channel radio frames are concatenated into transport block sets at block 262. Each transport block set includes one or more transport channel radio frames depending on the respective TTI. The symbols within each transport block set are de-interleaved at block 264, and non-transmitted symbols are removed at block 266. Inverse rate matching (or de-rate matching) is then performed to accumulate repeated symbols and insert “erasures” for punctured symbols at block 268. Each coded block in the transport block set is then decoded at block 270, and the decoded blocks are concatenated and segmented into one or more transport blocks at block 272. Each transport block is then checked for error using the CRC bits attached to the transport block at block 274. For each transport channel, one or more decoded transport blocks are provided for each TTI. In certain prior art implementations, the decoding of coded blocks at block 270 may commence only after all physical channel radio frames of the corresponding TTI are received.
In
In accordance with the present disclosure, early decoding and termination techniques for W-CDMA as described hereinbelow may allow a communications system to operate more efficiently and save transmission power, thereby increasing system capacity.
In
It will be appreciated that while the slots received prior to the decoding attempts of both TrCH's A and B at 421 and 423 correspond to only a portion of the total slots for the entire TTI, “early” decoding of the entire TTI using only the received slots may nevertheless be attempted on TrCH's A and B. Such early decoding attempts may have a substantial chance of decoding success due to, e.g., redundancy in the received symbols introduced by fractional rate encoding and/or repetition, e.g., at blocks 216 and 218 of
Returning to
It will be appreciated that by terminating slot transmission for a transport channel prior to the end of a TTI, the potential interference to other users may be significantly reduced, thereby increasing system capacity.
One of ordinary skill in the art will appreciate that the total time from: a) receiving a slot at the DPCH RX designated for a decoding attempt, to b) sending an ACK to terminate transmissions at the DPCH TX, includes the time intervals TDA and T ACK as described hereinabove, and may be determined by, e.g., the available computational resources for decoding. In an exemplary embodiment, such total time may be designed to be 3 slots.
In an exemplary embodiment, the time intervals separating decoding attempts for each transport channel may be chosen as a design parameter. For example, a decoding attempt for any particular transport channel may be made every one, two, or any number of slots. Alternatively, decoding attempts for any transport channel may be made aperiodically throughout the duration of the TTI. It will be appreciated that increasing the frequency of decoding attempts will generally increase the likelihood that a transport channel is decoded at the earliest possible opportunity, at the cost of greater required computational bandwidth. In an exemplary embodiment, decoding attempts of one or more transport channels may be performed every 3 slots, or 2 ms.
In an exemplary embodiment, decoding attempts of a transport channel may be offset in time from decoding attempts of another transport channel. For example, in
In the exemplary embodiment shown, a separate ACK is sent for early termination of each transport channel. One of ordinary skill in the art will appreciate that alternatively, a single ACK may signal early termination of more than one transport channel, as agreed upon by transmitter and receiver. Such alternative exemplary embodiments are contemplated to be within the scope of the present disclosure.
It will be appreciated that ACK channels for individual transport channels may be multiplexed in time, e.g., using a DPCCH portion of a transmission from the DPCH RX 410 to the DPCH TX 400, or in code, e.g., by allocating a separate Walsh code for each transport channel. Possible ACK signaling mechanisms in W-CDMA are described later herein.
In
At block 510, symbols are received for slot ID # n.
At block 520, the symbols received up to slot ID # n are processed. In an exemplary embodiment, such processing may include blocks 252-258 as described with reference to
Following block 520, n may be incremented at block 525, and reception of symbols for the next slot may proceed at block 510. Further following block 520, decoding attempts may be performed on a per-transport channel basis for one or more transport channels, as described with reference to blocks 530-560. One of ordinary skill in the art will appreciate that the techniques may be applied to any configuration of one or more transport channels.
At block 530.1, it is determined whether a decoding attempt should be performed for TrCH X1. If so, then operation proceeds to block 540.1. In an exemplary embodiment, the determination of whether decoding should be attempted may be based on the slot ID # of a slot that has been just received. For example, a decoding attempt for TrCH X1 may be made every 1, 2, or more slots starting with a first slot ID # x. Furthermore, decoding attempts for one transport channel may be offset from decoding attempts for other transport channels, as earlier described herein. Other schemes for determining whether decoding attempts should be performed will be clear to one of ordinary skill in the art in light of the present disclosure.
At block 540.1, decoding is performed for the symbols of TrCH X1 processed, e.g., at block 520, up to slot ID # n.
At block 550.1, it is determined whether the decoding performed at block 540.1 was a success. In an exemplary embodiment, decoding success may be determined based on whether a decoded CRC of one or more transport blocks of the transport channel is correctly verified. It will be appreciated that for transport channels having transport formats not specifying the use of a CRC, other metrics may be used to determine decoding success, e.g., an energy metric as computed by a decoder for the decoded block. If the decoding was a success, then operation proceeds to block 560.1, else operation returns to block 530.1.
At block 560.1, an ACK is transmitted for TrCH X1 at the next available opportunity. The mechanism for ACK transmission may utilize the techniques described hereinbelow with reference to
It will be appreciated that in alternative exemplary embodiments, control bits not shown may also be processed and multiplexed onto the DPCCH symbol stream, e.g., TFCI bits, etc.
In
In an exemplary embodiment, to accommodate the extra symbols for the ACK, the number of symbols allocated to the dedicated pilot bits DP may be correspondingly reduced, i.e., the ACK may be multiplexed with DP in time. To maintain a constant total energy allocated for the pilot DP, the power offset PODP applied to DP may be correspondingly increased.
The scheme shown in
In an alternative exemplary embodiment (not shown), the pilot portion may be omitted altogether, and the ACK may be provided in the time interval otherwise allocated to the pilot. Such alternative exemplary embodiments are contemplated to be within the scope of the present disclosure.
In alternative exemplary embodiments (not shown), an ACK may be separately provided on a separate channel independent of the DPCCH and DPDCH of an uplink frame. For example, a separate code channel may be assigned to an ACK. Furthermore, when multiple ACK's are provided for multiple transport channels, such multiple ACK's may be, e.g., multiplexed in code (by providing a separate code channel for each ACK) or multiplexed in time on a single code channel. Such alternative exemplary embodiments are contemplated to be within the scope of the present disclosure.
While specific exemplary embodiments have been described for accommodating ACK messaging in the present W-CDMA physical channel formats, one of ordinary skill in the art will appreciate that other exemplary embodiments are possible. In an alternative exemplary embodiment (not shown), any portion of the time intervals allocated to transmission of control symbols (on either uplink or downlink) may be replaced by ACK messaging symbols for any pre-designated slot or slots. The power allocated to such control symbols may be correspondingly upwardly adjusted to compensate for any decrease in total energy of the control symbols pilot due to the ACK messaging.
In
One of ordinary skill in the art will appreciate that the selective puncturing module 720 may be pre-programmed to identify which bits output by the second interleaving block 238 correspond to a particular transport channel, and may incorporate knowledge of, e.g., the first and second interleaving parameters, rate matching parameters, encoding, etc., of all the transport channels available.
Note in alternative exemplary embodiments, the ACK reception module 710 and the selective TrCH puncturing module 720 may readily be modified to accommodate fewer or more transport channels than shown in
In an exemplary embodiment, the early termination techniques described herein may be applied to voice communications using the adaptive multi-rate (AMR) speech codec according to the W-CDMA standard. In a voice communications system, a speech codec 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 W-CDMA, speech transmissions may be encoded using an adaptive multi-rate (AMR) codec, which encodes speech using one of a plurality of different bit rates or “AMR modes.” In particular, the AMR codec may support any of a plurality of full-rate (“FULL”) bit-rates ranging from 4.75 kbps (or kilobits per second) to 12.2 kbps, and for periods of silence, a silence indicator (“SID”) bit-rate of 1.8 kbps, and frames of discontinuous transmission (DTX or “NULL”) of 0 kbps.
It will be appreciated that full-rate AMR bits may be further partitioned into “class A bits” that are most sensitive to error, “class B bits” that are less sensitive to error, and “class C bits” that are least sensitive to error. In an exemplary embodiment, such class A, B, and C bits may be assigned to transport channels TrCH A, B, and C, respectively, for transmission over the air using the W-CDMA uplink or downlink interface. (See, e.g., the description of the W-CDMA downlink interface with reference to
In
Following blocks 830, 832, and 834, radio frame segmentation is performed at blocks 831, 833, and 835, respectively. For example, bits corresponding to AMR class A are segmented into a portion A1 for a first radio frame and A2 for a second radio frame, AMR class B bits are segmented into B1 and B2, and AMR class C bits are segmented into C1 and C2. The bits A1 are multiplexed with B1 and C1 to generate a CCTrCH 840.1, and the bits A2, B2, and C2 are likewise multiplexed to generate a CCTrCH 840.2. Second interleaving 850.1, 850.2 is separately performed for each of the CCTrCH's. The data for each frame is spread using a spreading factor of 64 at 860.1, 860.2 to generate frames 1 and 2.
In an implementation, per the W-CDMA standard, the uplink spreading factor is limited to at least 64.
According to the early decoding techniques described herein, the receiver may attempt early decoding on each of frames 1 and 2 generated according to the scheme shown in
Following blocks 930, 932, and 934, segmentation is performed at blocks 931, 933, and 935, respectively, to generate bits A1, A2, B1, B2, C1, and C2 at 940. These bits are collectively provided to a 20-ms second interleaver 950. In an exemplary embodiment, the second interleaver 950 is modified from the prior art W-CDMA second interleaver 850 in that the second interleaver 950 is designed to interleave bits over 20 ms rather than 10 ms. This may advantageously distribute the encoded bits of each AMR class more uniformly over an entire TTI, thereby leading to greater likelihood of decoding one or more classes of the AMR bits at an earlier time.
Radio frame segmentation 952 is performed at the output of the 20-ms second interleaver 950 to separate the second-interleaved bits into first and second radio frames. The bits are spread at blocks 960.1 and 960.2. In an exemplary embodiment, the spreading at 960.1 and 960.2 is performed using a spreading factor less than the spreading factor employed at blocks 860.1 and 860.2 in the prior art AMR transmission scheme. It will be appreciated that reducing the spreading factor allows each frame to accommodate an increased number of bits resulting from, e.g., reducing the coding rate at transport channel processing blocks 930, 932, and 934, as earlier described herein. By simultaneously reducing the coding rate and spreading factor, and further introducing 20-ms second interleaving, it will be appreciated that the likelihood of successful decoding at an earlier time may be improved.
While
In an exemplary embodiment, early decoding of TrCH's A, B, and C corresponding to AMR classes A, B, and C may proceed as earlier described herein with reference to
In a first exemplary embodiment (also referred to herein as “ET-A”), early decoding of the AMR class A bits may be attempted every 3 slots, or 2 ms, starting with any slot received. Once the class A bits are successfully decoded, e.g., based on CRC check, an ACK for TrCH A may be sent, and transmission of class A bits may be terminated. AMR class B and C bits may continue to be transmitted until the end of the TTI.
In a second exemplary embodiment (also referred to herein as “ET-A-B”), the transport formats of TrCH's A and B, corresponding to AMR class A and class B, may both specify inclusion of a CRC, and thus early decoding may be attempted on both TrCH's A and B. In certain exemplary embodiments, early decoding attempts of TrCH A may be offset in time from early decoding attempts of TrCH B. Alternatively, decoding attempts of TrCH's A and B may be concurrently performed at a receiver after receiving the same slot.
Note while an exemplary embodiment has been described with reference to
In an alternative exemplary embodiment, to further reduce the power required to transmit certain ARM classes over the W-CDMA interface, a transport format supporting a tail-biting convolutional coding scheme known in the art may be added to those already supported by the W-CDMA standard. It will be appreciated that a tail-biting convolutional code allows the tail bits associated with the convolutional code to be omitted by pre-loading the initial state of the convolutional code shift register with the expected ending state, thereby decreasing the overhead number of bits.
Following block 1010, a signal is transmitted over the channel 1019, and provided to PhCH/TrCH processing block 1020. Block 1020 includes a block 1030 that determines whether early decoding should be attempted based on the current slot received. If so, the received symbols are provided to the tail-biting convolutional code decoder 1040, which implements any of a variety of tail-biting convolutional code decoding schemes known in the art. At block 1050, it is determined whether the decoding is successful. If yes, the TTI is declared successfully declared, and the decoded bits are provided. If no, then operation returns to block 1030 to wait for the next early decoding opportunity.
It will be appreciated that by omitting the tail bits associated with a conventional convolutional code, less data needs to be transmitted over the channel in the case of a tail-biting convolutional code, thereby generating less interference to other users. It will be further appreciated that repeated early decoding attempts of a tail-biting convolutional code may take advantage of the fact that the ending state of a previous early decoding attempt is expected to be equal to the initial state of a subsequent early decoding attempt of the same transport channel, thereby potentially saving computational resources.
In an exemplary embodiment, a transport format for one or more classes of AMR bits may specify that a tail-biting convolutional code be used to encode the class of bits. For example, in an exemplary embodiment (also referred to herein as “ET-A-B-TB”), the transport formats of TrCH A for AMR class A bits and TrCH B for AMR class B bits may both specify the inclusion of a CRC, while the transport formats of TrCH B and TrCH C for AMR class C bits may both specify that a tail-biting convolutional code be used for the encoding scheme. At the receiver, early decoding may be attempted on TrCH A and TrCH B according to the principles earlier described. In an alternative exemplary embodiment (also referred to herein as “ET-A-B-TB-Mod”), only the transport format of TrCH C for AMR class C bits may specify that a tail-biting convolutional code be used for the encoding scheme.
One of ordinary skill in the art will appreciate that the combinations of the transport formats described are given for illustrative purposes only, and that alternative exemplary embodiments may readily employ other combinations of the features described for transmission of the AMR bits according to the W-CDMA standard. Such alternative exemplary embodiments are contemplated to be within the scope of the present disclosure.
In an exemplary embodiment, the number of source bits for each transport channel, the number of CRC bits, and the number of tail bits for various AMR transmission techniques described herein may be chosen as follows (Table 1):
In an exemplary embodiment, to further reduce transmission power in the system, the DPDCH portion of an AMR NULL packet may be entirely blanked, or inserted with DTX bits, on either the downlink or the uplink. In this case, no decoding would be performed at the receiver on such NULL packets. In conjunction therewith, outer-loop power control (OLPC) schemes at the receiver may be based only on received AMR FULL and SID packets, e.g., an OLPC scheme is not updated when an AMR NULL packet is received.
In an alternative exemplary embodiment, in conjunction with the early termination techniques described herein, the power control rate of the downlink or uplink may be further reduced. For example, rather than sending a power control command (e.g., in a TPC field of a slot) in every slot, a power control command may be sent once every two or more slots. In an exemplary embodiment, the DPCCH portion of an AMR NULL packet on the uplink may be gated according to a gating pattern determined by a power control rate on the downlink. For example, when 750 Hz power control is applied on the downlink, the uplink DPCCH may be gated (i.e., selectively turned off) once every other slot when transmitting AMR NULL packets. In alternative exemplary embodiments, if the power control rate of the downlink is even further slowed down when transmitting AMR NULL packets (e.g., <750 Hz), then the uplink DPCCH may be gated even more frequently (e.g., uplink DPCCH may be turned on only once every four or five slots). It will be appreciated that further considerations affecting how often the DPCCH may be gated include how reliably the uplink searcher can function, how reliably the uplink overhead channels can be decoded, and the configuration of the power control bit transmission waveforms on the uplink. Such exemplary embodiments are contemplated to be within the scope of the present disclosure.
Further described herein with reference to
The UTRAN is connected internally or externally to other functional entities by four interfaces: Iu, Uu, Iub and Iur. The UTRAN is attached to a GSM core network 121 via an external interface called Iu. Radio network controllers (RNC's) 141-144 (shown in
The radio network may be further connected to additional networks outside the radio network, such as a corporate intranet, the Internet, or a conventional public switched telephone network as stated above, and may transport data packets between each user equipment device 123-127 and such outside networks.
The RNC fills multiple roles. First, it may control the admission of new mobiles or services attempting to use the Node B. Second, from the Node B, or base station, point of view, the RNC is a controlling RNC. Controlling admission ensures that mobiles are allocated radio resources (bandwidth and signal/noise ratio) up to what the network has available. It is where the Node B's Iub interface terminates. From the UE, or mobile, point of view, the RNC acts as a serving RNC in which it terminates the mobile's link layer communications. From a core network point of view, the serving RNC terminates the Iu for the UE. The serving RNC also controls the admission of new mobiles or services attempting to use the core network over its Iu interface.
In an exemplary embodiment, each Node B may maintain a table which prioritizes early decoding attempts on the uplink among different UE's based on predetermined criteria. For example, a UE in soft hand-off (SHO) may cause more interference to other cells than a UE not in SHO, and therefore, system capacity may be improved by more frequently attempting to decode such UE's (in SHO).
It will be appreciated that such techniques may be readily applied by the UE on the downlink as well to, e.g., prioritize early decoding attempts of different channels being received by the UE.
For an air interface, UMTS most commonly uses a wideband spread-spectrum mobile air interface known as wideband code division multiple access (or W-CDMA). W-CDMA uses a direct sequence code division multiple access signaling method (or CDMA) to separate users. W-CDMA (Wideband Code Division Multiple Access) is a third generation standard for mobile communications. W-CDMA evolved from GSM (Global System for Mobile Communications)/GPRS a second generation standard, which is oriented to voice communications with limited data capability. The first commercial deployments of W-CDMA are based on a version of the standards called W-CDMA Release 99.
The Release 99 specification defines two techniques to enable Uplink packet data. Most commonly, data transmission is supported using either the Dedicated Channel (DCH) or the Random Access Channel (RACH). However, the DCH is the primary channel for support of packet data services. Each remote station 123-127 uses an orthogonal variable spreading factor (OVSF) code. An OVSF code is an orthogonal code that facilitates uniquely identifying individual communication channels, as will be appreciated by one skilled in the art. In addition, micro diversity is supported using soft handover and closed loop power control is employed with the DCH.
Pseudorandom noise (PN) sequences are commonly used in CDMA systems for spreading transmitted data, including transmitted pilot signals. The time required to transmit a single value of the PN sequence is known as a chip, and the rate at which the chips vary is known as the chip rate. Inherent in the design of direct sequence CDMA systems is the requirement that a receiver aligns its PN sequences to those of the Node B 110, 111, 114. Some systems, such as those defined by the W-CDMA standard, differentiate base stations 110, 111, 114 using a unique PN code for each, known as a primary scrambling code. The W-CDMA standard defines two Gold code sequences for scrambling the downlink, one for the in-phase component (I) and another for the quadrature (Q). The I and Q PN sequences together are broadcast throughout the cell without data modulation. This broadcast is referred to as the common pilot channel (CPICH). The PN sequences generated are truncated to a length of 38,400 chips. A period of 38,400 chips is referred to as a radio frame. Each radio frame is divided into 15 equal sections referred to as slots. W-CDMA Node Bs 110, 111, 114 operate asynchronously in relation to each other, so knowledge of the frame timing of one base station 110, 111, 114 does not translate into knowledge of the frame timing of any other Node B 110, 111, 114. In order to acquire this knowledge, W-CDMA systems use synchronization channels and a cell searching technique.
3GPP Release 5 and later supports High-Speed Downlink Packet Access (HSDPA). 3GPP Release 6 and later supports High-Speed Uplink Packet Access (HSUPA). HSDPA and HSUPA are sets of channels and procedures that enable high-speed packet data transmission on the downlink and uplink, respectively. Release 7 HSPA+ uses 3 enhancements to improve data rate. First, it introduced support for 2×2 MIMO on the downlink. With MIMO, the peak data rate supported on the downlink is 28 Mbps. Second, higher order modulation is introduced on the downlink. The use of 64 QAM on the downlink allows peak data rates of 21 Mbps. Third, higher order modulation is introduced on the uplink. The use of 16 QAM on the uplink allows peak data rates of 11 Mbps.
In HSUPA, the Node B 110, 111, 114 allows several user equipment devices 123-127 to transmit at a certain power level at the same time. These grants are assigned to users by using a fast scheduling algorithm that allocates the resources on a short-term basis (every tens of ms). The rapid scheduling of HSUPA is well suited to the bursty nature of packet data. During periods of high activity, a user may get a larger percentage of the available resources, while getting little or no bandwidth during periods of low activity.
In 3GPP Release 5 HSDPA, a base transceiver station 110, 111, 114 of an access network sends downlink payload data to user equipment devices 123-127 on High Speed Downlink Shared Channel (HS-DSCH), and the control information associated with the downlink data on High Speed Shared Control Channel (HS-SCCH). There are 256 Orthogonal Variable Spreading Factor (OVSF or Walsh) codes used for data transmission. In HSDPA systems, these codes are partitioned into release 1999 (legacy system) codes that are typically used for cellular telephony (voice), and HSDPA codes that are used for data services. For each transmission time interval (TTI), the dedicated control information sent to an HSDPA-enabled user equipment device 123-127 indicates to the device which codes within the code space will be used to send downlink payload data to the device, and the modulation that will be used for transmission of the downlink payload data.
With HSDPA operation, downlink transmissions to the user equipment devices 123-127 may be scheduled for different transmission time intervals using the 15 available HSDPA OVSF codes. For a given TTI, each user equipment device 123-127 may be using one or more of the 15 HSDPA codes, depending on the downlink bandwidth allocated to the device during the TTI. As has already been mentioned, for each TTI the control information indicates to the user equipment device 123-127 which codes within the code space will be used to send downlink payload data (data other than control data of the radio network) to the device, and the modulation that will be used for transmission of the downlink payload data.
In a MIMO system, there are N (# of transmitter antennas) by M (# of receiver antennas) signal paths from the transmit and the receive antennas, and the signals on these paths are not identical. MIMO creates multiple data transmission pipes. The pipes are orthogonal in the space-time domain. The number of pipes equals the rank of the system. Since these pipes are orthogonal in the space-time domain, they create little interference with each other. The data pipes are realized with proper digital signal processing by properly combining signals on the N×M paths. It is noted that a transmission pipe does not correspond to an antenna transmission chain or any one particular transmission path.
Communication systems may use a single carrier frequency or multiple carrier frequencies. Each link may incorporate a different number of carrier frequencies. Furthermore, an access terminal 123-127 may be any data device that communicates through a wireless channel or through a wired channel, for example using fiber optic or coaxial cables. An access terminal 123-127 may be any of a number of types of devices including but not limited to PC card, compact flash, external or internal modem, or wireless or wireline phone. The access terminal 123-127 is also known as user equipment (UE), a remote station, a mobile station or a subscriber station. Also, the UE 123-127 may be mobile or stationary.
User equipment 123-127 that has established an active traffic channel connection with one or more Node Bs 110, 111, 114 is called active user equipment 123-127, and is said to be in a traffic state. User equipment 123-127 that is in the process of establishing an active traffic channel connection with one or more Node Bs 110, 111, 114 is said to be in a connection setup state. User equipment 123-127 may be any data device that communicates through a wireless channel or through a wired channel, for example using fiber optic or coaxial cables. The communication link through which the user equipment 123-127 sends signals to the Node B 110, 111, 114 is called an uplink. The communication link through which a NodeB 110, 111, 114 sends signals to a user equipment 123-127 is called a downlink.
Radio network controller 141-144 interfaces with a Public Switched Telephone Network (PSTN) 148 through a mobile switching center 151, 152. Also, radio network controller 141-144 interfaces with Node Bs 110, 111, 114 in the communication system 100B. In addition, radio network controller 141-144 interfaces with a Packet Network Interface 146. Radio network controller 141-144 coordinates the communication between user equipment 123-127 in the communication system and other users connected to a packet network interface 146 and PSTN 148. PSTN 148 interfaces with users through a standard telephone network (not shown in
Radio network controller 141-144 contains many selector elements 136, although only one is shown in
Data source 122 contains a quantity of data, which is to be transmitted to a given user equipment 123-127. Data source 122 provides the data to packet network interface 146. Packet network interface 146 receives the data and routes the data to the selector element 136. Selector element 136 then transmits the data to Node B 110, 111, 114 in communication with the target user equipment 123-127. In the exemplary embodiment, each Node B 110, 111, 114 maintains a data queue 172, which stores the data to be transmitted to the user equipment 123-127.
For each data packet, channel element 168 inserts the control fields. In the exemplary embodiment, channel element 168 performs a cyclic redundancy check, CRC, encoding of the data packet and control fields and inserts a set of code tail bits. The data packet, control fields, CRC parity bits, and code tail bits comprise a formatted packet. In the exemplary embodiment, channel element 168 then encodes the formatted packet and interleaves (or reorders) the symbols within the encoded packet. In the exemplary embodiment, the interleaved packet is covered with a Walsh code, and spread with the short PNI and PNQ codes. The spread data is provided to RF unit 170 which quadrature modulates, filters, and amplifies the signal. The downlink signal is transmitted over the air through an antenna to the downlink.
At the user equipment 123-127, the downlink signal is received by an antenna and routed to a receiver. The receiver filters, amplifies, quadrature demodulates, and quantizes the signal. The digitized signal is provided to a demodulator where it is despread with the short PNI and PNQ codes and decovered with the Walsh cover. The demodulated data is provided to a decoder which performs the inverse of the signal processing functions done at Node B 110, 111, 114, specifically the de-interleaving, decoding, and CRC check functions. The decoded data is provided to a data sink.
The processing unit 103 controls operation of the UE 123-127. The processing unit 103 may also be referred to as a CPU. Memory 116, which may include both read-only memory (ROM) and random access memory (RAM), provides instructions and data to the processing unit 103. A portion of the memory 116 may also include non-volatile random access memory (NVRAM).
The UE 123-127, which may be embodied in a wireless communication device such as a cellular telephone, may also include a housing that contains a transmit circuitry 164 and a receive circuitry 109 to allow transmission and reception of data, such as audio communications, between the UE 123-127 and a remote location. The transmit circuitry 164 and receive circuitry 109 may be coupled to an antenna 118.
The various components of the UE 123-127 are coupled together by a bus system 130 which may include a power bus, a control signal bus, and a status signal bus in addition to a data bus. However, for the sake of clarity, the various busses are illustrated in
The steps of the methods discussed may also be stored as instructions in the form of software or firmware 43 located in memory 161 in the Node B 110, 111, 114, as shown in
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.
The present application for patent is a continuation of co-pending nonprovisional patent application Ser. No. 13/504,699, titled “Increasing Capacity in Wireless Communications” and filed in the United States Patent and Trademark Office on Nov. 27, 2009, and assigned to the assignee hereof and hereby expressly incorporated by reference herein as if fully set forth below and for all applicable purposes.
| 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 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 |
| 7801248 | Challa et al. | Sep 2010 | B2 |
| 7881711 | Lundby | Feb 2011 | B2 |
| 7933256 | Park 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 |
| 8503591 | Sikri et al. | Aug 2013 | B2 |
| 8509293 | Sikri et al. | Aug 2013 | B2 |
| 8588119 | Panta et al. | Nov 2013 | B2 |
| 8594252 | Black et al. | Nov 2013 | B2 |
| 8611305 | Black et al. | Dec 2013 | B2 |
| 8619928 | Chalia et al. | Dec 2013 | B2 |
| 8630602 | Smee et al. | Jan 2014 | B2 |
| 8660145 | Carmon et al. | Feb 2014 | B2 |
| 8675796 | Sikri et al. | Mar 2014 | B2 |
| 8743909 | Black et al. | Jun 2014 | B2 |
| 8787509 | Sikri et al. | Jul 2014 | B2 |
| 8831149 | Canpolat et al. | Sep 2014 | B2 |
| 8995417 | Jou et al. | Mar 2015 | B2 |
| 9014152 | Jou et al. | Apr 2015 | B2 |
| 9673837 | Xue et al. | Jun 2017 | B2 |
| 20010018650 | Dejaco | Aug 2001 | A1 |
| 20010021229 | Belaiche | Sep 2001 | A1 |
| 20020006138 | Odenwalder | Jan 2002 | A1 |
| 20020037000 | Park | Mar 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 | Jul 2003 | A1 |
| 20030147476 | Ma et al. | Aug 2003 | A1 |
| 20030174686 | Willenegger | Sep 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 et al. | Jan 2005 | A1 |
| 20050037718 | Kim et al. | Feb 2005 | A1 |
| 20050037775 | Moeglein et al. | Feb 2005 | A1 |
| 20050043052 | Whinnett | 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 |
| 20050141446 | Niwano | Jun 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 |
| 20060098688 | Parkvall | 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 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 |
| 20080298497 | Cho et al. | Dec 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 |
| 20090304024 | Jou et al. | Dec 2009 | A1 |
| 20100008282 | Bhattad et al. | Jan 2010 | A1 |
| 20100027702 | Vijayan et al. | Feb 2010 | A1 |
| 20100029213 | Wang | Feb 2010 | A1 |
| 20100029262 | Wang et al. | Feb 2010 | A1 |
| 20100040005 | Kim et al. | Feb 2010 | A1 |
| 20100040035 | Shapiro et al. | Feb 2010 | A1 |
| 20100046660 | 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 |
| 20100278227 | Sikri et al. | Nov 2010 | A1 |
| 20100296556 | Rave et al. | Nov 2010 | A1 |
| 20110264976 | Yang et al. | Oct 2011 | 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 | Apr 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 | Feb 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 | Apr 2002 | 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 |
| 62239735 | Oct 1987 | JP |
| 10500811 | Jan 1998 | JP |
| H10327126 | Dec 1998 | JP |
| 2000059290 | Feb 2000 | JP |
| 2000261397 | Sep 2000 | JP |
| 2000353982 | Dec 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 |
| 2004064691 | 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 |
| 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 |
| 2009515219 | Apr 2009 | JP |
| 2009545219 | Dec 2009 | JP |
| 2011521373 | Jul 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 |
| 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 |
| WO-1995026593 | Oct 1995 | WO |
| WO-1998018212 | Apr 1998 | WO |
| WO-1998032231 | Jul 1998 | WO |
| WO 9857452 | Dec 1998 | WO |
| WO-9857509 | Dec 1998 | WO |
| WO-9901950 | Jan 1999 | WO |
| WO-9912273 | Mar 1999 | WO |
| WO-1999023844 | May 1999 | WO |
| WO-1999029048 | Jun 1999 | WO |
| WO-0033528 | Jun 2000 | WO |
| WO-0035126 | Jun 2000 | WO |
| WO-2000035117 | Jun 2000 | WO |
| WO-0055992 | Sep 2000 | WO |
| WO-0062456 | Oct 2000 | WO |
| WO-0070786 | Nov 2000 | WO |
| WO-2001008324 | Feb 2001 | WO |
| WO-2001017158 | Mar 2001 | WO |
| WO-0223792 | Mar 2002 | WO |
| WO-0230004 | Apr 2002 | WO |
| WO-0232003 | Apr 2002 | WO |
| WO-0233877 | Apr 2002 | WO |
| WO-2002030004 | Apr 2002 | WO |
| WO-2002045288 | Jun 2002 | WO |
| WO-02067444 | Aug 2002 | WO |
| WO-02103920 | Dec 2002 | WO |
| WO-03001834 | Jan 2003 | WO |
| WO-03017527 | Feb 2003 | WO |
| WO-03021905 | Mar 2003 | WO |
| WO-03047124 | Jun 2003 | WO |
| WO-03067783 | Aug 2003 | WO |
| WO-03079577 | Sep 2003 | WO |
| WO-03096635 | Nov 2003 | WO |
| WO-03103328 | Dec 2003 | WO |
| WO-03105370 | Dec 2003 | WO |
| WO-2004010573 | Jan 2004 | WO |
| WO-2004015909 | Feb 2004 | WO |
| WO-2004025869 | Mar 2004 | WO |
| WO-2004025986 | Mar 2004 | WO |
| WO-2004032369 | Apr 2004 | WO |
| WO-04066666 | Aug 2004 | WO |
| WO-04084480 | Sep 2004 | WO |
| WO-2004102864 | Nov 2004 | WO |
| WO-2004107768 | Dec 2004 | WO |
| WO-2004114582 | Dec 2004 | WO |
| WO-2005020464 | Mar 2005 | WO |
| WO-2005034383 | Apr 2005 | WO |
| WO-2005036913 | Apr 2005 | WO |
| WO-05060192 | Jun 2005 | WO |
| WO-2005053177 | Jun 2005 | WO |
| WO-06004948 | Jan 2006 | WO |
| WO-2006060605 | Jun 2006 | WO |
| WO-06071761 | Jul 2006 | WO |
| WO-2006072088 | Jul 2006 | WO |
| WO-2006115979 | Nov 2006 | WO |
| WO-2007000620 | Jan 2007 | WO |
| WO-2007016553 | Feb 2007 | WO |
| WO-07024963 | Mar 2007 | WO |
| WO-2007029958 | Mar 2007 | WO |
| WO-07053840 | May 2007 | WO |
| WO-2007060093 | May 2007 | WO |
| WO-2007060229 | May 2007 | WO |
| WO-07140338 | Dec 2007 | WO |
| WO-08005890 | Jan 2008 | WO |
| WO-2008012265 | Jan 2008 | WO |
| WO-2008027192 | Mar 2008 | WO |
| WO-2008156061 | Dec 2008 | WO |
| WO-2009105611 | Aug 2009 | WO |
| WO-2009108586 | Sep 2009 | WO |
| WO-2009137464 | Nov 2009 | WO |
| WO-2009140338 | Nov 2009 | WO |
| WO-2009152138 | Dec 2009 | WO |
| WO-2010006285 | Jan 2010 | WO |
| WO-2010014968 | Feb 2010 | WO |
| WO-2011028978 | Mar 2011 | WO |
| Entry |
|---|
| 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; May 26, 2006, May 26, 2006 (May 26, 2006), XP050102001 pp. 29-30 p. 76 pp. 89-90. |
| 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 (Jun. 23, 2008), pp. 721-724, XP031312823 ISBN: 978-1-4244-2570-9. |
| 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. |
| International Search Report and Written Opinion—PCT/CN2009/075179, International Search Authority—European Patent Office—dated Sep. 2, 2010 (100147). |
| 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-14, 2003; Pattaya,TH: (Joint Video Team of ISO/IEC JTC1/SC29/WG11 and ITU-T 56.16 ), No. JVT-G050r1, Mar. 14, 2003 (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. |
| 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 (Aug. 1, 1984), pp. 935-947, XP000758571 ISSN: 0090-6778 abstract p. 941, section C. |
| 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. |
| 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. |
| 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. |
| 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. |
| 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, May 6, 2004 (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-17, 2012 Aug. 5, 2012 (Aug. 5, 2012). XP050661662. |
| 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. |
| 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. |
| Supplementary European Search Report—EP09851582—Search Authority—Munich—dated Jul. 31, 2014 (100147EP). |
| Taiwan Search Report—TW099105984—TIPO—dated Feb. 26, 2013 (100147TW). |
| 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. |
| Wu Q ., et al., “The cdma2000 High Rate Packet Data System”, Internet Citation, Mar. 26, 2002 (Mar. 26, 2002), XP002303829, Retrieved from the Internet: URL: http://www.qualcomm.com/technology/1xe v-do/publishedpapers/cdma2000HighRatePacket.pdf [retrieved on Nov. 3, 2004] Sections 3.1.7 and 3.2. |
| Xiaofa, L., “The study of Interference Cancellation based on Multi-User Detection”, Chinese Scientific Papers Online, pp. 7, Mar. 27, 2008. |
| Number | Date | Country | |
|---|---|---|---|
| 20170251473 A1 | Aug 2017 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13504699 | US | |
| Child | 15593075 | US |
