Patent Abstract:
Embodiments include a method and apparatus for processing a downlink shared channel. In one embodiment, a Node-B includes circuitry configured to process control information for a user equipment (UE) and to produce an N bit cyclic redundancy check (CRC) associated with the control information. The Node-B includes circuitry configured to modulo 2 add the N bit CRC with an N bit UE identity to produce an N bit field, wherein the UE identity is any one of a plurality of UE identities associated with the UE. The Node-B includes circuitry configured to transmit a wireless signal of a control channel, wherein the wireless signal comprises the N bit field and the control information.

Full Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
     This application claims priority to and is a continuation of U.S. patent application Ser. No. 13/711,501, filed Dec. 11, 2012, which is a continuation of U.S. patent application Ser. No. 13/285,831, filed Oct. 31, 2011, which issued as U.S. Pat. No. 8,347,177, on Jan. 1, 2013, which is a continuation of U.S. patent application Ser. No. 12/862,561, filed Aug. 24, 2010, which issued as U.S. Pat. No. 8,051,360, on Nov. 1, 2011, which 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 Patent 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. 
    
    
     BACKGROUND 
     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&#39;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  FIGS. 1A-1C . Referring to  FIG. 1A , an associated downlink dedicated physical channel (DPCH) is transmitted to each UE. The UE monitors associated downlink DPCH as well as the shared control channels (SCCH-HS). When there is no data being transmitted to the UE from the base station, the UE enters a standby mode whereby it periodically “wakes up” to attempt to monitor its associated downlink DPCH as well as SCCH-HSs. This permits the UE to save processing and battery resources. 
     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 2 n , SCCH-HSs shown in  FIG. 1B . For example a 2, bit HI can point to 4, SCCH-HSs, i.e., 00, 01, 10, or 11. 
     For the example shown in  FIG. 1A , the HI is (1, 0) which points to the third channel shown in  FIG. 1B . When the UE accesses the control channel identified by the HI, that particular SCCH-HS will direct the UE to the proper HS-DSCH, which has been allocated to the UE for reception of the data. As shown in  FIG. 1C , for example, the UE tunes to HS-DSCH (001) that was identified by SCCH-HS (1, 0). The UE then receives the data intended for it over the HS-DSCH (001). It should be noted that the graphical representation of  FIG. 1A-1C  has been presented to illustrate the process of assigning HS-DSCHs, and the configuration and use of channels may differ slightly from actual implementation in HSDPA standards. 
     The process as described with reference to  FIGS. 1A-1C  provides an efficient method for assigning common data channels for transmission of data. Since packet data is intended for one or more, specific UEs, the UE identity (ID) is a critical parameter for signaling from the base station to the UE. 
     There are several prior art methods for signaling the UE ID between the base station and the UE. Referring to  FIG. 2A , the first method appends the UE ID onto the data for transmission. The combination is fed to a cyclic redundancy check (CRC) generator, which outputs a CRC. The resulting data packet, which is ultimately transmitted, includes an X-bit data field, an M-bit UE ID and an N-bit CRC as shown in  FIG. 2B . Although this provides adequate signaling of both the CRC and the UE ID, it is wasteful of signaling bandwidth. 
     Another prior art technique shown in  FIG. 3A  appends the UE ID onto the data field for input into the CRC generator. The CRC generator outputs a CRC. As shown in  FIG. 3B , the data burst for transmission includes an X-bit data field and an N-bit CRC field. Although this also adequately signals the UE ID and the CRC between the base station and the UE, it is undesirable since it can only be used for unique UE Identification. This method also causes increased complexity of the UE when a group of UEs need to be identified. 
     SUMMARY 
     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. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIGS. 1A-1C  represent a prior art method for assigning shared data channels, where  FIG. 1A  illustrates the associated downlink channel,  FIG. 1B  illustrates a plurality of control channels and  FIG. 1C  illustrates a plurality of data channels. 
         FIG. 1D  is a block diagram of the universal mobile telecommunication system network architecture. 
         FIG. 2A  is a prior art user equipment identification (UE ID) specific cyclic redundancy check (CRC) method. 
         FIG. 2B  illustrates the transmitted data burst including a data field, a UE ID field and a CRC field. 
         FIG. 3A  is a second prior art user equipment identification (UE ID) specific cyclic redundancy check (CRC) method. 
         FIG. 3B  illustrates the transmitted data burst including a data field and a CRC field. 
         FIG. 4A  is a first embodiment of the present invention utilizing modulo 2 addition of the UE ID with the CRC to create a mask. 
         FIG. 4B  is a data burst transmitted by the system of  FIG. 4A  including a data field and a mask field. 
         FIG. 5A  is a second embodiment of the present invention including a CRC generator which is initialized using the UE ID. 
         FIG. 5B  is a data burst transmitted by the embodiment of  FIG. 5A  including a data field and a CRC field. 
         FIG. 6A  is a third embodiment of the present invention which modulo 2 adds the data field to a UE ID field padded with trailing zeros to create a mask. 
         FIG. 6B  is a fourth embodiment of the present invention which modulo 2 adds the data field to a UE ID field padded with leading zeros to create a mask. 
         FIG. 6C  is the data burst transmitted by the embodiments of  FIG. 6A and 6B  including a data field and a CRC field. 
         FIG. 7A  is a fifth embodiment of the present invention which modulo 2 adds the data field to a UE ID field repeated and padded a truncated UE ID in the trailing bits. 
         FIG. 7B  is a sixth embodiment of the present invention which modulo 2 adds the data field to a UE ID field repeated and padded a truncated UE ID in the leading bits. 
         FIG. 7C  is the data burst transmitted by the embodiments of  FIGS. 7A and 7B  including a data field and a CRC field. 
         FIG. 8  is a tabulation of global, subset, subsubset and unique IDs. 
         FIG. 9  is a flow diagram of the processing of a message in accordance with the present invention. 
     
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     The presently preferred embodiments are described below with reference to the drawing figures wherein like numerals represent like elements throughout. 
     Referring to  FIG. 1D , a Universal Mobile Telecommunications System (UMTS) network architecture used by the present invention includes a core network (CN), a UMTS Terrestrial Radio Access Network (UTRAN), and a User Equipment (UE). The two general interfaces are the Iu interface, between the UTRAN and the core network, as well as the radio interface Uu, between the UTRAN and the UE. The UTRAN consists of several Radio Network Subsystems (RNS). They can be interconnected by the Iur interface. This interconnection allows core network independent procedures between different RNSs. The RNS is further divided into the Radio Network Controller (RNC) and several base stations (Node-B). The Node-Bs are connected to the RNC by the Iub interface. One Node-B can serve one or multiple cells, and typically serves a plurality of UEs. The UTRAN supports both FDD mode and TDD mode on the radio interface. For both modes, the same network architecture and the same protocols are used. Only the physical layer and the air interface Uu are specified separately. 
     Referring to  FIG. 4A , one embodiment of the present invention is shown. In this embodiment, the system  100  utilizes the data for transmission (hereinafter referred to as “data”) from the data field  102 , a CRC generator  104  (which has been initialized to zero), the resulting CRC from the CRC field  106  output from the CRC generator  104 , the UE ID from the UE ID field  108 , a modulo 2, adder  110  and a mask  112 . It should be noted that in this embodiment and all of the embodiments described hereinafter, the number of bits of each field is noted above the field as an example. However, the specific number of bits is exemplary and should not be construed to limit the present invention. 
     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  FIG. 4A . However, if M and N are not equal, then an interim step is necessary to make them equal. If M&lt;N, then the UE ID is padded with either leading xeros or trailing zeros to be equal in length to the CRC. This “padded UE ID” is N modulo 2, added to the CRC  106 . If M&gt;N, then the least significant M−N bits are truncated from the UE ID. The truncated UE ID is then modulo 2, added to the CRC. 
     Referring to  FIG. 4B , the mask  112  that is generated is appended to the data field  102  for transmission. 
     Referring to  FIG. 5A , a second embodiment of the present invention is shown. In this embodiment, the system  200  utilizes the data from the data field  202 , a CRC generator  204 , the UE ID from the UE ID field  208 , and the resulting CRC field  212 . The system  200  receives the data field  202  and outputs the data from data field  202  into the CRC generator  204 . The CRC generator  204  is the same type of generator as the CRC generator  104  from  FIG. 4A , except that the CRC generator  204  is initialized with the UE ID from the UE ID field  208 . This initialization is illustrated by the dotted line in  FIG. 5A . As is well known by those of skill in the art, a CRC generator is typically initialized to all zeros, as was the case with the CRC generator  104  shown in  FIG. 4A . Accordingly, the CRC generator  204  generates a CRC based upon the input data from the data field  202  and the initialization of the CRC generator  204  with UE ID No modulo 2, addition is required in this embodiment. 
     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 . 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  FIG. 5B , the CRC field  212  that is generated is appended to the data field  202  for transmission. 
     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  FIG. 7A , a fifth embodiment of the present invention is shown. In this embodiment, the system  400  utilises the data from the data field  402 , the UE ID from the UE ID field  408 A, a modulo 2, adder  410 , a mask  411 , a CRC generator  404  and the resulting CRC field  412 . The system  400  receives the data field  402  and inputs the data from the data field  402  into a first input of the modulo 2, adder  410 . The UE ID from UE ID field  408 A is output to the second input to the modulo 2, adder  410 . The data from the data field  402  and the UE ID from the UE ID field  408 A are modulo 2 added to create a mask  411 . The mask  411  is input into the CRC generator  404 , which generates the CRC field  412 . 
     In this embodiment, the number of bits of the UE ID field  408 A (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  408 A 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 thus were to occur, then the least significant bits are truncated from the UE ID field  408 A until the length of the UE ID hold 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  308 A. The truncated UE ID is then modulo 2 added to the data from the data field  302 . 
     Referring to  FIG. 6B , a fourth embodiment of the present invention is shown. In this embodiment, the system  301  operates in the exact same manner as the third embodiment shown in  FIG. 6A . The only difference in this embodiment is the method in which the value from the UE ID field  308 B is generated. In this embodiment, the UE ID is padded with X−M leading zeros such that the UE ID from the UE ID field  308 B is equal in length to the data field  302 . This “padded UE ID value” as shown in  FIG. 6B , is then modulo 2, added to the data from the data field  302 . If should be noted that the padding may alternatively comprise a combination of leading and trailing zeros (not shown) in order to make the UE ID the same length as the data field. 
     Referring to  FIG. 6C , the CRC field  312  that is generated from the system  300  of the third embodiment shown in  FIG. 6A , or the CRC  314  that is generated from the system  301  of the fourth embodiment shown in  FIG. 6B , is appended to the data field  302  for transmission. Accordingly, either type of CRC field  312 ,  314  may be used and appended onto the data field  302 . 
     Referring to  FIG. 7A , a fifth embodiment of the present invention is shown. In this embodiment, the system  400  utilizes the data from the data field  402 , the UE ID from the UE ID field  408 A, a modulo 2, adder  410 , a mask  411 , a CRC generator  404  and the resulting CRC field  412 . The system  400  receives the data field  402  and inputs the data from the data field  302  into a first input of the modulo 2, adder  410 . The UE ID from UE ID field  408 A is output to the second input to the modulo 2, adder  410 . The data from the data field  402  and the UE ID from the UE ID field  408 A are modulo 2 added to create a mask  411 . The mask  411  is input into the CRC generator  404 , which generates the CRC field  412 . 
     In this embodiment, the number of bits of the UE ID field  408 A (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  408 A 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  408 A until the length of the UE ID field is equal to X. The truncated UE ID is the 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  408 A 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  408 A in  FIG. 7A . The composite UE ID is then modulo 2, added to the data from the data field  402 . 
     Referring to  FIG. 7B , a sixth embodiment of the present invention is shown. The system  401  of this embodiment operates in the same manner as the fifth embodiment shown in  FIG. 7A . The only difference in this embodiment is the value from the UE ID field  408 B. Although the composite UE ID created in the same manner as in  FIG. 7A , the truncated UE ID portion is added as leading bits, as opposed to the trailing bits in the UE ID field  408 A shown in  FIG. 7A . It should be noted that the truncated UE ID “padding” may include a combination of leading and trailing truncated bits in order in make the UE ID the same length as the data field  402 . 
     Referring to  FIG. 7C , the CRC field  412  that is generated from either the system  400  of the fifth embodiment shown in  FIG. 7A , or the CRC field  414  that is generated from the system  401  of the sixth embodiment shown in  FIG. 7B , is appended to the data field  402  for transmission. Accordingly, either type of CRC field  412 ,  414  may be used and appended onto the data field  402 . 
     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&#39;s unique ID. 2) an ID corresponding in 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  FIG. 8 , UE ID 12, has been highlighted to indicate that it will able to receive and process IDs at four different levels: 1) the UE-specific ID (#12); 2) subsubset C ID; 3) subset 2, ID; and 4) global ID. It should also be noted that alternate group identifications A-E, may also be created such that a different group of UEs may be included. For example, group B will include all of the UEs identified next to group B which include UE numbers 2, 7, 12, 17, 22, and 27. Additionally, any group or subgroup may be created by specifically identifying individual UEs as desired by a user. 
     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 of 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:
 
 P   fa   =P   fa   HI×P   fa   H×P   SD    Equation (1)
 
where P fa , is the probability of a false acceptance; P fa HI is the probability of a false acceptance of HI; P fa H is the probability of a false acceptance of SCCH-HS; and P SD , is the probability of a successful detection of HS-DSCH (P SD ).
 
     Using the above identified values for the present example with Equation (1):
 
 P   fs =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  FIG. 9 , the flow diagram illustrates a method for processing downlink messages between a node B and a UE in accordance with the present invention. This method provides a general overview and should not be interpreted as a comprehensive description of all of the detailed medium access control (MAC) layer and physical layer signaling required for processing a message, (i.e., a data packet). The code B first generates a downlink control message in the MAC layer (step  1 ) and then forwards the message and the UE ID to the physical layer (step  2 ). The physical layer generates the CRC and applies the UE ID for forwarding with the message (step  3 ) as a data burst. The message is then transmitted from the node B to the UE (step  4 ). At the physical layer, the UE ID and the CRC are checked to determine if they are correct (step  5 ). If so, the message is forwarded to the MAC layer (step  6 ) which then further processes the message (step  7 ). 
     It should be noted that step  6  in  FIG. 9  includes an additional signal between the physical layer and the MAC layer, which comprises a control message that indicates the CRC/UE ID is valid. However, this is an optional step. In the preferred embodiment, only valid messages will be forwarded from the physical layer to the MAC layer. Accordingly, in the preferred embodiment, the MAC layer will assume that any message that is forwarded to the MAC is valid. In the alternative embodiment, the additional CRC/UE ID valid signaling will be forwarded along with the message as an additional confirmation. 
     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  FIG. 8 ) are correct. 
     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.

Technology Classification (CPC): 7