The field of the invention is mobile communications and, more particularly, to Voice over IP (VoIP) and other real time services for WCDMA (Wideband Code Division Multiple Access) HSDPA (High-Speed Downlink Packet Access) and HSUPA (High-Speed Uplink Packet Access).
The invention relates to the 3GPP (Third Generation Partnership Project) specification of the Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access (UTRA) and more specifically to the Wideband Code Division Multiple Access (WCDMA) High Speed Downlink Packet Access (HSDPA) which is an enhanced downlink feature used in the Frequency Division Duplex (FDD) mode. This feature is specified in the 3GPP release 5.
We describe the invention here using the downlink (HSDPA) as an example. However, the invention can also be used in the uplink (HSUPA). High Speed Uplink Packet Access (HSUPA) is an enhanced uplink feature which may be used in the Frequency Division Duplex (FDD) mode. This feature is being specified in the 3GPP and targeted to 3GPP release 6. The invention is not limited to the specific context described, however.
HSDPA and HSUPA are designed for high speed data and therefore the associated control overhead is not a problem when high data rates are used. When introducing for instance a relatively low bit rate VoIP or other real time service on top of HSDPA and HSUPA, however, the control overhead becomes a major problem. There are other types of services where this can be a problem as well.
For HSDPA, the downlink shared control channels (HS-SCCH) consume channelization codes as well as downlink transmission power, thus reducing the voice capacity. HS-SCCH is used to tell the UE (User Equipment) when (timing) and on which codes the UE will receive communications on a shared data channel HS-DSCH. Also, the transmission format is indicated to the UE on HS-SCCH. HS-SCCH signalling is purely physical (/MAC) layer signalling, telling the UE the following parameters: UE id (intended recipient of the control on HS-SCCH and data on data channel (HS-DSCH)), modulation scheme and channelization codes used on data channel, transport block sizes (TBS), HARQ (Hybrid Automatic Repeat request) process id, HARQ redundancy and constellation version and NDI (new data indicator).
HS-SCCH(s) (there can be several of these and one UE can be configured to receive a maximum of four HS-SCCHs) are sent to the UE on separate (from data channels) code channels two slots earlier than corresponding HS-PDSCHs. The UE reads the HS-SCCHs and tries to find its UE id. When UE finds its UE id from one of the HS-SCCHs, then UE reads the transport format parameters and demodulates and decodes the corresponding HS-PDSCHs based on these parameter values. According to current 3GPP specifications, HS-SCCH is sent with every data packet sent on HS-DSCH.
For HSUPA, E-DPCCH (Enhanced Dedicated Physical Control Channel) tells the transmission format (transport block size). It is consuming some capacity but is not as big a problem as HS-SCCH in the downlink. E-DPCCH is a dedicated control channel which is power controlled whereas HS-SCCH as a shared channel typically requires higher transmission power. According to current 3GPP specification, E-DPCCH is always sent together with E-DPDCH (Enhanced Dedicated Physical Data Channel), i.e., no data is sent on E-DPDCH without associated signalling on E-DPCCH.
One way of solving the problem is by transmitting several VoIP or other real time type or other small packets for a user at the same time, which increases the data rate and reduces control overhead. This is one way of reducing HS-SCCH overhead and is already possible with the current specification.
Use of a multiuser packet is another way of reducing HS-SCCH overhead: VoIP or like packets from multiple users are combined into one HS-DSCH packet and only one HS-SCCH is sent. A similar approach is specified for the 1x-EV DO system.
The current invention is independent from the above described solutions and can also be used together with them.
The invention concerns reducing signalling.
For instance, in order to reduce the HS-SCCH overhead, a fixed time allocation approach could be used to reduce the HS-SCCH overhead. In that case, the scheduling time of each VoIP (or other real time type service) user is semi-static and thus there is no need to transmit HS-SCCH for the first transmissions, if the user knows when to receive data on HS-DSCH and what the used transport format is.
There are several ways implementing this, such as the following two alternatives:
In the Detailed Description Section below, we mainly describe the first alternative which is more dynamic in the sense that the stored parameters can be changed on-the-fly. The second alternative is more semi-static since RRC signalling is used to send the parameters to be stored and used when no HS-SCCH is sent (RRC signalling would be slower and changed less often).
Referring to
The signal processor 20 of
The method may include a step 40 of determining if the transmission of packets is for fixed allocation packets. If such is determined to be true in a step 42, a step 44 is executed to signal control information on the signaling channel but only for selected packets. This avoids excessive signalling of the control information for every small packet. Thus, if a normal packet is to be sent, as determined in the step 42, the control information is signaled for every such normal packet, as shown in a step 46. The fixed allocation principle would in practice be configured for one or more logical channels or MAC-d flows. Thus this invention would only be applied for packets sent on these logical channels or MAC-d flows. Here we call those packets ‘fixed allocation packets’ and other packets ‘normal packets.’ Non-limiting examples of the types of packets which would naturally fall within the fixed allocation type would be real time or delay-sensitive data packets while delay-insensitive data packets could fall within the normal type.
Of course, it should be realized that the step 40 is equivalent to determining if a transmission is of a normal packet (i.e., not a fixed allocation packet). In that case, the decision step 42 could stay the same or change to determine if the packet is a normal packet or not. If so, the step 46 would be executed and, if not, the step 44. Thus, such variations are merely semantical and are equivalent.
It should also be realized that the signaling steps 44, 46 of
The radio link 14 of
As pointed out above, the device of
The detailed description which follows describes the downlink (HSDPA) as an example. It should be kept in mind, however, that the invention can also be used in the uplink (HSUPA) and also that the invention is not limited to the embodiments shown.
Alternative 1, Fixed Allocation Using Last Successful HS-SCCH for HSDPA
One possible HSDPA implementation is to require that the UE tries to decode the HS-DSCH using the parameters received in the last successful transmission of HS-SCCH and HS-DSCH. Thus all the retransmissions would use HS-SCCH and also new transmissions after retransmissions, and naturally all transmissions with changed parameters.
The UE operation for HS-DSCH reception, as shown in
For VoIP, the periodicity parameter T could be set to, e.g., 20 or 40 ms (depending on the scheduling scheme used). When the UE receives/decodes HS-SCCH (and corresponding HS-DSCH) correctly, it stores the transport format parameters (modulation scheme, channelization codes, HARQ process id, redundancy and constellation version, and transport block size) received on HS-SCCH and tries to reuse these parameters after T ms. If the decoding of HS-DSCH is successful (using the stored parameters), these parameters are kept in the memory and reused again after T ms.
HS-SCCH(s) would always be decoded first. If one of them is for the UE, the new parameters will override the (T ms before) stored values (and the new values will be stored for future use). Not only will the new parameter values override the stored values, but also values received for the same HARQ process id (provided that it is initial transmission, i.e., not a retransmission). This is because the HARQ process id is one of the parameters sent on HS-SCCH and the fixed allocation assumes that the same parameter values are used after T ms. In practice, this means that the same HARQ process should always be used for VoIP if this fixed allocation scheme is to be used. In order to save in UE memory and operations, this HARQ process id used for fixed allocation could also be signalled by higher layers (RRC). Thus the UE would only store the HS-SCCH parameter values sent for this particular HARQ process.
Reception Window
As shown in
As mentioned,
The number inside HS-DSCH shows the value of the NDI (HARQ new data indicator (1 bit)), which is normally sent on HS-SCCH, Part 2. It should be noted that NDI value changes between new transmissions deterministically and therefore no HS-SCCH is needed to tell it. Also, from the point of view of the NDI, it is safer to send HS-SCCH after every retransmission.
Alternative 2, Fixed Allocation Using RRC Signalling
RRC (higher layer) signalling could be used to tell the default HS-SCCH parameters for each (VoIP) UE. UE would use these parameters if none of the sent HS-SCCHs is for it (thus the UE would first try to decode HS-SCCHs, as in step 50 and 52 of
Alternative 2 (fixed allocation, RRC signalling) is a good choice if there is clearly one (or a few) default TBS (Transport Block Size). Then this (these) default format(s) can be used often. However, if there are several transport formats that are used often, then alternative 1, where the parameter values of a successful HS-SCCH/HS-DSCH reception are stored, is better.
UE Specific CRC on HS-DSCH
In both alternatives, in order to avoid false alarms (i.e., UE reads other users data and if CRC matches forwards the wrong data to higher layers where decryption should fail), it is proposed to make the CRC of the HS-DSCH UE-specific in a manner similar to that of the CRC on HS-SCCH (see, e.g., 3GPP specification TS25.212, v. 6.3.0). Then, the L1 CRC will be already failed if the intended UE is not the one trying to decode it and the error will not be propagated to higher levels.
The UE specific CRC for the HS-DSCH can be implemented, for instance, as follows. Calculate the 24 bit CRC normally as specified in TS25.212. Then XOR (i.e., add using mod 2 arithmetic), e.g., the last 16 bits of the CRC with the 16 bit UE id. Alternatively, the first 16 bits of the 24 bit CRC could be XORed with the 16 bit UE id. Furthermore, it is possible to extend the 16 bit UE id into a unique 24 bit sequence (e.g., by using some (24,16) block code) and XOR the whole 24 bit CRC with this UE specific bit sequence.
New Data Indicator (NDI)
The NDI is the only parameter whose value changes between new transmissions even if the transport format, etc., remain the same. Thus it cannot be part of the fixed allocation. As described above, this may not be a problem if HS-SCCH is always sent for retransmission and for a new transmission after retransmission (or in other words, HS-SCCH transmission is avoided only when the previous new transmission was ACKed immediately (no retransmissions)). Another possibility could be to replace NDI and RV with retransmission sequence number (RSN) in the similar way as on E-DPCCH in HSUPA. Then RSN=0 tells the first transmission and thus UE always knows whether the HS-SCCH parameter values should be stored (1st transmission) or not (retransmission).
Another possibility is to indicate to the UE that the HS-SCCH parameters should be stored. This could be done with a 1 bit flag added on HS-SCCH (or HS-DSCH). This flag would be set to one when the HS-SCCH parameters are such that they could be used for the next transmission (provided that the RLC PDU size etc. remain constant)
Although the invention has been shown and described with respect to a best mode embodiment thereof, it will be evident to those of skill in the art that various other devices and methods can be provided to carry out the objectives of the present invention while still falling within the coverage of the appended claims.
This application is a continuation of U.S. patent application Ser. No. 15/611,214, filed Jun. 1, 2017, which is a continuation of U.S. patent application Ser. No. 14/330,211, filed Jul. 14, 2014, now U.S. Pat. No. 9,763,231, which is a continuation of U.S. patent application Ser. No. 11/411,995, filed Apr. 25, 2006, now U.S. Pat. No. 8,804,505, which claims the benefit under 35 U.S.C. § 119(e) of U.S. Provisional Patent Application No. 60/675,127, filed Apr. 26, 2005, all of which are incorporated by reference in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
5701294 | Ward et al. | Dec 1997 | A |
6282430 | Young | Aug 2001 | B1 |
6389038 | Goldberg et al. | May 2002 | B1 |
6542504 | Mahler et al. | Apr 2003 | B1 |
8804505 | Malkamaki et al. | Aug 2014 | B2 |
9763231 | Malkamaki et al. | Sep 2017 | B2 |
20030002472 | Choi | Jan 2003 | A1 |
20030043778 | Luschi et al. | Mar 2003 | A1 |
20030103481 | Heo et al. | Jun 2003 | A1 |
20030119557 | Lundby | Jun 2003 | A1 |
20030194922 | Kim et al. | Oct 2003 | A1 |
20030194992 | Kim et al. | Oct 2003 | A1 |
20040009767 | Lee et al. | Jan 2004 | A1 |
20040047425 | Itoh | Mar 2004 | A1 |
20040162083 | Chen | Aug 2004 | A1 |
20040187064 | Takahashi et al. | Sep 2004 | A1 |
20050018656 | Rudolf et al. | Jan 2005 | A1 |
20050063330 | Lee et al. | Mar 2005 | A1 |
20050073985 | Heo et al. | Apr 2005 | A1 |
20050075124 | Willenegger | Apr 2005 | A1 |
20050117553 | Wang | Jun 2005 | A1 |
20050180449 | Ranta-Aho | Aug 2005 | A1 |
20050213605 | Kim et al. | Sep 2005 | A1 |
20050257118 | Shien | Nov 2005 | A1 |
20050265373 | Khan | Dec 2005 | A1 |
20060014505 | Hiraki | Jan 2006 | A1 |
20060040645 | Grilli et al. | Feb 2006 | A1 |
20060046671 | Kondo et al. | Mar 2006 | A1 |
20060111133 | Hirano et al. | May 2006 | A1 |
20060120404 | Sebire et al. | Jun 2006 | A1 |
20060159061 | Takano et al. | Jul 2006 | A1 |
20060165028 | Hiraki et al. | Jul 2006 | A1 |
20110134787 | Hirano et al. | Jun 2011 | A1 |
20140321404 | Malkamaki et al. | Oct 2014 | A1 |
20170273073 | Malkamaki et al. | Sep 2017 | A1 |
Number | Date | Country |
---|---|---|
1476693 | Feb 2004 | CN |
101032136 | Sep 2007 | CN |
1126651 | Aug 2001 | EP |
1372300 | Dec 2003 | EP |
1480481 | Nov 2004 | EP |
1511221 | Mar 2005 | EP |
1601224 | Nov 2005 | EP |
2003-115796 | Apr 2003 | JP |
2003-188988 | Jul 2003 | JP |
2004-289234 | Oct 2004 | JP |
2005-064751 | Mar 2005 | JP |
0141349 | Jun 2001 | WO |
03056723 | Jul 2003 | WO |
2003096731 | Nov 2003 | WO |
2004042954 | May 2004 | WO |
2004073200 | Aug 2004 | WO |
2004095860 | Nov 2004 | WO |
2005079105 | Aug 2005 | WO |
2006020983 | Feb 2006 | WO |
2006038078 | Apr 2006 | WO |
2009013388 | Jan 2009 | WO |
Entry |
---|
3GPP TS 25.213, “Universal Mobile Telecommunication System (UMTS), Spreading and Modulation (FDD)”, V6.2.0, Mar. 2005, pp. 1-36. |
3GPP TS 25.212, “Universal Mobile Telecommunications Systems (UMTS); Multiplexing and Channel Coding (FDD)”, V6.3.0, Dec. 2004, pp. 1-87. |
Siemens 3GPP TSG RAN WG2 #24, “TFRI Signalling for HSDPA—R2-012355, 9.2.1., Decision” New York, U.S.A., Oct. 22-26, 2001, pp. 4. |
3GGP TS 25.308, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; UTRA High Speed Downlink Packet Access; Overall Description Stage 2”, Rel.5, Sep. 2001, pp. 1-28. |
3GPP TS 25331, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Radio Resource Control (RRC); Protocol Specification”, Rel. 5, Mar. 2002, pp. 1-909. |
3GPP TS 25.221, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical Channels and Mapping of Transport Channels onto Physical Channels (TDD)”, Rel. 5, Mar. 2002, pp. 1-96. |
3GPP TSF-RAN2, “Default Configurations in Rel-6”, Qualcomm Europe, Prague, Czech Republic, R2-042410, Aug. 16-20, 2004, pp. 1-9. |
3GPP TSG-RAN2 Meeting #45 bis, “Stored Configurations in Rel-6”, Qualcomm Europe, Sophia Antipolis, France, R2-050042, Jan. 10-14, 2005, pp. 1-2. |
3GPP TS 43.064 V6.6.0, “3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; General Packet Radio Services (GPRS); Overall Description of the GPRS Radio Interface Stage 2”, Rel. 6, Apr. 2005, pp. 1-68. |
3GPP TS 44.018 V6.12.0, “3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Mobile Radio Interface Layer 3 Specification; Radio Resource Control (RRC) Protocol”, Rel. 6, Apr. 2005, pp. 1-360. |
3GPP TS 44.060 V6.12.0, “3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; General Packet Radio Service (GPRS); Mobile Station (MS)—Base Station System (BSS) Interface; Radio Link Control/Medium Access Control (RLC/MAC) Protocol”, Rel. 6, Apr. 2005, pp. 1-404. |
3GPP TS 45.002 V6.9.0, “3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Multiplexing and Multiple Access on the Radio Path”, Rel. 6, Apr. 2005, pp. 1-90. |
3GPP TS 45.003 V6.7.0, “3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Channel Coding”, Rel. 6, Jan. 2005, pp. 1-203. |
Cuny et al., “VoIP in 3G Networks: An End-to-End-Quality of Service Analysis”, Vehicular Technology Conference, VTC 2003—Spring, The 57th IEEE Semiannual, pp. 930-934. |
3GPP TS 25.304, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; UE Procedures in Idle Mode and Procedures for Cell Reselection in Connected Mode”, Rel. 5, (Mar. 2002), pp. 1-40. |
3GPP TS 25.324, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Boradcast/Multicast Control BMC”, Rel. 5, (Mar. 2002), pp. 1-23. |
R1-060173, 3GPP TSG-RAN WG1 LTE Ad Hoc, “Considerations for Control Signalling Support of Real Time Services”, Qualcomm Europe, Jan. 23-25, 2006, pp. 1-5. |
R1-041369, 3GPP TSG RAN WG1 Meeting #39, “Scheduling Related Downlink Signaling”, Samsung, Nov. 15-19, 2004, pp. 1-3. |
3GPP TS 25.321, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Medium Access Control (MAC) Protocol Specification”, Rel 6, V6.4.0, Mar. 2005, pp. 1-74. |
R1-05-1511, “HS-SCCH-less HS-PDSCH Operation for Improved Support of IMS Real-time Services”, 3GPP TSG-RAN WG1 #43, Seoul, Korea, Nov. 7-11, 2005, pp. 1-7. |
R1-060450, “Further Details on HS-SCCH-less Operation for VoIP Traffic”, 3GPP TSG-RAN Wg1 #44, Denver U.S.A., Feb. 13-17, 2006, pp. 1-7. |
R1-060946, “TP for HS-SCCH-less Operation for Continuous Packet Connectivity”, 3GPP TSG-RAN WG1 #44bis, Athens, Greece, Mar. 27-31, 2006, pp. 1-7. |
R1-060944, “Further Evaluation of HS-SCCH-less Operation”, 3Gpp TSG-RAN WG1 #44bis, Athens, Greece, Mar. 27-31, 2006, pp. 1-8. |
3GPP TR 25.903, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Cntinuous Connectivity for Packet Data Users”, Rel 7, V0.3.0, Feb. 2006, pp. 1-54. |
3GPP TS 25.222, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Multiplexing and Channel Coding (TDD)”, Rel 6, V6.2.0, Dec. 2004, pp. 1-67. |
3GPP TS 25.308, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; High Speed Downlink Packet Access (HSDPA); Overall Description; Stage 2”, Rel 6, V6.3.0, Dec. 2004, pp. 1-28. |
Mexican Office Action, Apr. 22, 2010 in Parallel Mexican Patent Application No. MXa2007013260, pp. 4 together with English Translation pp. 2. |
Chinese Office Action, dated Apr. 26, 2011 in parallel Chinese Patent Application No. 2006800140867, pp. 3 with English Translation pp. 4. |
Taiwan Office Action Search Report, dated Dec. 10, 2012 in parallel ROC Patent Application No. 95115948, pp. 10 with English Translation, pp. 11. |
Malaysian Office Action, Adverse Examination Report, dated Oct. 24, 2012, in parallel MY Patent Application No. PI 20061935, pp. 2. |
Phillipines Office Action Action Paper No. 17, dated Feb. 15, 2013, in parallel PH Patent Application No. 12007502235, pp. 2. |
Bestak, “Thèse, Présentée pour obtenir le grade de docteur de l'École Nationale Supérieure des Télécommunications—Spécialité: Informatique et Réseaux”, Dec. 18, 2003, pp. 1-136. (See esp. pp. 81, 87-94.). |
Number | Date | Country | |
---|---|---|---|
20190150139 A1 | May 2019 | US |
Number | Date | Country | |
---|---|---|---|
60675127 | Apr 2005 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15611214 | Jun 2017 | US |
Child | 16247701 | US | |
Parent | 14330211 | Jul 2014 | US |
Child | 15611214 | US | |
Parent | 11411995 | Apr 2006 | US |
Child | 14330211 | US |