The present invention relates to the field of wireless communications. One of the applications of the present invention is directed to a downlink signaling approach employing a modified cyclic redundancy check for both data protection and unique/group UE identification.
Wireless communication systems have become an integral link in today's modern telecommunications infrastructure. As such, they have become increasingly relied upon not only to support voice communications, but also data communications. Voice communications are relatively low-rate, symmetrical in the upstream and downstream bandwidths and are predictable in the amount of bandwidth required.
However, data communications can place severe burdens upon a telecommunication system, particularly a wireless telecommunication system. First, data communications can often require extremely high data rates. Second, the amount of bandwidth for a data related application can vary greatly from several kilohertz of bandwidth to several megahertz. Third, the amount of bandwidth in the upstream and downstream directions can be drastically different. For example, with a typical Internet browsing application, very little data is sent in the upstream direction while vast amounts of data are downloaded in the downstream direction. These factors can place severe constraints upon a wireless telecommunication system.
The Wideband CDMA (WCDMA) standard, as the leading global third generation (3G) (IMT-2000) standard, supports data rates up to 2 Mb/s in indoor/small-cell-outdoor environments and up to 384 kb/switch wide-area coverage, as well as support for both high-rate packet data and high-rate circuit-switched data. However to satisfy the future demands for packet-data services, there is a need for a substantial increase in this data rate, especially in the downlink. High speed downlink packet access (HSDPA) would allow WCDMA to support downlink peak data rates in the range of approximately 8-10 Mb/s for best-effort packet-data services. This rate is far beyond the IMT-2000 requirement of 2 Mb/s. It also enhances the packet-data capability in terms of lower delay and improved capacity.
One solution for supporting data communications is the allocation of dedicated channels to each user equipment (UE). However, this results in an extremely inefficient use of the bandwidth since such channels often remain idle for long durations.
An alternative to dedicated channels for each UE is the use of the high speed shared data channels and the packeting of data. In this method, a plurality of high speed data channels are shared between a plurality of UEs. Those UEs having data for transmission or reception are dynamically assigned one of the shared data channels. This results in a much more efficient use of the spectrum.
One such process for assigning a high speed shared data channel when a base station has data waiting for transmission to a particular UE is shown in
If data at the base station is ready for transmission to the UE, a High Speed Downlink Shared Channel (HS-DSCH) indicator (HI) is transmitted in the associated DPCH. The HI has n-bit length, which points to one of 2n SCCH-HSs shown in
For the example shown in
The process as described with reference to
There are several prior art methods for signaling the UE ID between the base station and the UE. Referring to
Another prior art technique shown in
A method and apparatus is disclosed wherein a user equipment (UE) receives control information on a first channel and uses the control information to process a second channel.
The presently preferred embodiments are described below with reference to the drawing figures wherein like numerals represent like elements throughout.
Referring to
Referring to
The system 100 receives the data field 102 and inputs the data from the data field 102 into the CRC generator 104. The CRC generator 104 generates the CRC field 106 and outputs the CRC from the CRC field 106 to a first input of the modulo 2 adder 110. The UE ID from the UE ID field 108 is output to the second input to the modulo 2 adder 110. The CRC and UE ID are then modulo 2 added to create a mask 112.
Preferably, the number of bits of the UE ID field 108 (M bits) is the same as the number of bits of the CRC field 106 (N bits). If M=N, then the UE ID may be directly modulo 2 added to the CRC as shown in
Referring to
Referring to
Preferably, the number of bits of the UE ID from the UE ID field 208 (M bits) is the same as the size of the CRC generator 204, although this is not necessary. If the size of the UE ID (M-bits) is less than the size of the CRC generator 204, then the UE ID may be padded with either leading zeros or trailing zeros to be equal in length to the size of the CRC generator 204. This “padded UE ID” may then be used to initialize the CRC generator 204. Alternatively, the value in the UE ID field 208 may be loaded to initialize the CRC generator 204, and any bit positions not filled by the UE ID would be zero. If the size of the UE ID (M bits) is greater than the size of the CRC generator 204, then the least significant bits are truncated from the UE ID in order to fit the UE ID to CRC generator 204. The truncated UE ID is then used to initialize the CRC generator 204.
Referring to
This second embodiment of the present invention utilizing implicit UE ID presents a simplistic, yet robust, alternative since it does not require assembly and disassembly of the UE ID with the SCCH-HS, at the transmitter or the receiver, as required by UE-specific CRC methods of the prior art and the first embodiment.
Referring to
In this embodiment, the number of bits of the UE ID field 408A (M bits) must be the same as the number of bits of the data field 402 in order to perform the modulo 2 addition. If the M is equal to X, then the UE ID from the UE ID field 408A may be directly modulo 2 added to the data from the data field 402. Due to the length of the data field 402, it is not expected that M will be greater than X. However, if this were to occur, then the least significant bits are truncated from the UE ID field 408A until the length of the UE ID field is equal to X. The truncated UE ID is then modulo 2 added to the value from the data field 402.
Due to the length X of the data field 302, it is not expected that M will be greater than X. However, if this were to occur, then the least significant M-X bits are truncated from the value in UE ID field 308A. The truncated UE ID is then modulo 2 added to the data from the data field 302.
Referring to
Referring to
Referring to
In this embodiment, the number of bits of the UE ID field 408A (M bits) must be the same as the number of bits of the data field 402 in order to perform the modulo 2 addition. If the M is equal to X, then the UE ID from the UE ID field 408A may be directly modulo 2 added to the data from the data field 402. Due to the length of the data field 302, it is not expected that M will be greater than X. However, if this were to occur, then the least significant bits are truncated from the UE ID field 408A until the length of the UE ID field is equal to X. The truncated UE ID is then modulo 2 added to the value from the data field 402.
If the length of the UE ID is shorter than the data field 402, then a “composite UE ID” is created such that the value from the UE ID field 408A is equal to X. The composite UE ID is created by repeating the UE ID as many times as it will fit within an X-bit field, then filling in the remaining trailing bits with a truncated UE ID. This is represented in the UE ID field 408A in
Referring to
Referring to
It should be noted that all of the above-described embodiments can be used to support multiple identities (IDs). A UE may be required to process messages addressed at several levels: 1) the UE's unique ID, 2) an ID corresponding to a subset or group of UEs, where the UE belongs to the subset; or 3) a broadcast (global ID) corresponding to all UEs in the system. For example, as shown in
To support this requirement, the transmitter generates the CRC as described above with each of the embodiments. At the receiver, the UE processes the message and generates the expected CRC, without the ID-based modification. The UE processor then modulo 2 adds the received CRC to the calculated CRC. The resultant output is the transmitted ID, which can be any one of the IDs described above. If the ID is none of these, then the UE discards the transmission.
In accordance with the present invention, using the CRC code of the length N, the undetected error probability on the identified SCCH-HS approaches 2−n. Using a 24-bit CRC to protect data transmitted on HS-DSCH, a 16-bit CRC to protect control information transmitted on SCCH-HS, and assuming 10−3 false acceptance probability for HI bits by an unintended UE, the embodiments in accordance with the present invention hereinbefore described will provide the probability of the false acceptances as follows:
Pfa=PfaHI×PfaH×PSD Equation (1)
where Pfa is the probability of a false acceptance; PfaHI is the probability of a false acceptance of HI; PfaH is the probability of a false acceptance of SCCH-HS; and PSD is the probability of a successful detection of HS-DSCH (PSD).
Using the above identified values for the present example with Equation (1):
Pfa=10−3×2−16×2−24=9.1×10−16
The reliability computation indicates that for the same length CRC, the probability of a user passing erroneous data up to a higher layer, will be extremely low.
Referring to
It should be noted that step 6 in
The present invention has the advantage of eliminating separate processing steps for the UE ID and the CRC. When the two fields are combined as hereinbefore described, the UE will not further process any message until both the CRC and the UE ID (or other type of ID shown in
While the present invention has been described in terms of the preferred embodiment, other variations, which are within the scope of the invention, as outlined in the claims below will be apparent to those skilled in the art.
This application is a continuation of U.S. patent application Ser. No. 11/129,850, filed May 16, 2005, which issued as U.S, Pat. No. 7,783,953 on Aug. 24, 2010, which is a continuation of U.S. patent application Ser. No. 10/035,771, filed Dec. 26, 2001, which issued as U.S. Pat. No. 6,915,473 on Jul. 5, 2005, which claims the benefit of U.S. Provisional Application Nos. 60/290,740, filed May 14, 2001; 60/314,993, filed Aug. 24, 2001; and 60/345,358, filed Oct. 25, 2001, which are incorporated by reference as if fully set forth herein.
Number | Name | Date | Kind |
---|---|---|---|
4910736 | Tanaka et al. | Mar 1990 | A |
5142539 | Dahlin et al. | Aug 1992 | A |
5301247 | Rasmussen et al. | Apr 1994 | A |
5355412 | Kangas | Oct 1994 | A |
5357525 | Moriue et al. | Oct 1994 | A |
5390197 | MacDonald et al. | Feb 1995 | A |
5404355 | Raith | Apr 1995 | A |
5659569 | Padovani et al. | Aug 1997 | A |
5689518 | Galand et al. | Nov 1997 | A |
5722077 | Kanai | Feb 1998 | A |
5845212 | Tanaka | Dec 1998 | A |
5917810 | De Bot | Jun 1999 | A |
5917840 | Cheney et al. | Jun 1999 | A |
5930706 | Raith | Jul 1999 | A |
6005871 | Petersen et al. | Dec 1999 | A |
6134597 | Rieth et al. | Oct 2000 | A |
6172971 | Kim | Jan 2001 | B1 |
6201811 | Larsson et al. | Mar 2001 | B1 |
6240304 | Blankenstein et al. | May 2001 | B1 |
6424632 | Poret et al. | Jul 2002 | B1 |
6430163 | Mustajarvi | Aug 2002 | B1 |
6735185 | Noneman | May 2004 | B1 |
6850509 | Lee et al. | Feb 2005 | B2 |
6859445 | Moon et al. | Feb 2005 | B1 |
6882727 | Vialen et al. | Apr 2005 | B1 |
6901104 | Du et al. | May 2005 | B1 |
6928066 | Moon et al. | Aug 2005 | B1 |
7054633 | Seo et al. | May 2006 | B2 |
7079848 | Das et al. | Jul 2006 | B2 |
7181298 | Yoshio et al. | Feb 2007 | B1 |
7184447 | Koo et al. | Feb 2007 | B1 |
7184743 | Walton et al. | Feb 2007 | B2 |
7200788 | Hiraki et al. | Apr 2007 | B2 |
7366105 | Yi et al. | Apr 2008 | B2 |
7394799 | Li et al. | Jul 2008 | B2 |
7426201 | Kim et al. | Sep 2008 | B2 |
7558228 | Lee et al. | Jul 2009 | B2 |
7693110 | Love et al. | Apr 2010 | B2 |
7783953 | Bolourchi et al. | Aug 2010 | B2 |
20020051431 | Choi et al. | May 2002 | A1 |
20020093918 | Kim et al. | Jul 2002 | A1 |
20020181422 | Parantainen et al. | Dec 2002 | A1 |
20030219037 | Toskala et al. | Nov 2003 | A1 |
20040043783 | Anderson | Mar 2004 | A1 |
20040085989 | Boumendil et al. | May 2004 | A1 |
Number | Date | Country |
---|---|---|
2374815 | Dec 2000 | CA |
0564825 | Oct 1993 | EP |
1187500 | Mar 2002 | EP |
1248476 | Oct 2002 | EP |
1351424 | Oct 2003 | EP |
2372409 | Aug 2002 | GB |
01-196774 | Aug 1989 | JP |
05-236073 | Sep 1993 | JP |
08-316967 | Nov 1996 | JP |
11-136138 | May 1999 | JP |
11-196070 | Jul 1999 | JP |
276382 | May 1996 | TW |
9938076 | Jul 1999 | WO |
0021210 | Apr 2000 | WO |
0028763 | May 2000 | WO |
0030378 | May 2000 | WO |
0057660 | Sep 2000 | WO |
0101609 | Jan 2001 | WO |
0105050 | Jan 2001 | WO |
0251177 | Jun 2002 | WO |
02051177 | Jun 2002 | WO |
02096030 | Nov 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20100318886 A1 | Dec 2010 | US |
Number | Date | Country | |
---|---|---|---|
60290740 | May 2001 | US | |
60314993 | Aug 2001 | US | |
60345358 | Oct 2001 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11129850 | May 2005 | US |
Child | 12862561 | US | |
Parent | 10035771 | Dec 2001 | US |
Child | 11129850 | US |