Title of Invention

"A SYSTEM AND METHOD FOR TRANSMITTING A BURST BETWEEN COMMUNICATION UNITS"

Abstract

A system and method for data related downlink signaling including selectively tailoring the UE ID to create a UE ID value, which is then added to a data field to create a data mask. This data mask is then further processed as the CRC field and transmitted with the data burst to provide CRC - related functions. An alternative embodiment discloses initializing a CRC generator with UE identification prior to CRC generation. This implicitly includes the UE ID within the CRC without requiring additional overhead signaling.

Full Text

Field of Invention The present invention relates to system and method for transmitting a burst between communication units. One of the application 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. Background of The Invention 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 sates. 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. I he Wideband CDMA (WCDMA) standard, as the leading global third generation (3(1) (1MT-2000) standard, supports data rates up to 2 Mb/s in indoor smail-cell-outdoor envmmments 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 MbOs 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. \n 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. 1 A-1C. Referring to Fig. I A, 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 CE- 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 (111) is transmitted in the associated DPCH. The -bit length, which points to one of 2" SCCH-HSs shown in lug. 1B. lor example a bit III can point to 4 SCCH-HSs, re. 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.IB. 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. IC, 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 mpiu 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 it is undesirable since it can only be used for unique UE identification. This method also causes increase complexity of 1 if. when a group UEs need to be identified. Statement of Invention The present invention provides for a system for transmitting a communication burst from a first communicating unit to at least a second communicating unit; characterized in that the system comprises at said first communicating unit, a cyclic redundancy check (CRC) generator for receiving data and generating a CRC, a first combiner for combining said CRC with an identification of the second communicating unit to generate a mask and a transmitter for transmitting the burst comprising said mask and said data and at said second communicating unit, a memory for storing the identification of the second communicating unit, a receiver for receiving said communication burst including said mask and said data, a second combiner for combining said mask with said stored identification to recover the CRC and means for determining whether said recovered CRC is valid. Summary of The Invention The present invention discloses several implementations for data related downlink signaling. The embodiments disclose selectively tailoring the UE ID to create a UE ID value, which is then modulo 2 added to a data field to create a data mask. This data mask may be further processed as the CRC field, flic CRC field is then transmitted with the data burst to provide CRC-related functions. An alternative embodiment discloses intializing a CRC generator with IT: identification prior to CRC generation. This implicitly includes the UE ID within the CRC without requiring additional overhead signaling Brief Description of The Accompanying Drawings Figs. 1A-1C represent a prior art method lor 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. ID 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 UF 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 UF.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 dala field and a CRC field. Fig. 7 A 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 UF ID in the trailing bits fig. 7B is a sixth embodiment of the present invention which modulo 2 adds the data field to a CE . ID field repeated and padded a truncated UF ID in the leading bits Fig. 7C is the data burst transmitted by the embodiments of Fig. 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. ID, a Universal Mobile Telecommunications System (UMTS) network architecture used by the present invention includes a core network t(CN), a UMTS TeiTestrial 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 arc connected to the RNC by the lub interface. One Node-B can serve one or multiple cells, and typically serves a plurality of UEs. The 1)1 RAN 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 CI II) from the F II) field 108, a modulo 2 adder 1 10 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 exemplar} and should not be con0strued 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 MN, 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 generalor 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 ease 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 generalor 204 with UE ID. No modulo 2 addition is required in this embodiment. Preferably, the number of bits of the UE ID from the 1 4: 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 UF ID (M-hits) 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 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. 6A, a third embodiment of the present invention is shown. In this embodiment, the system 300 utilizes the data from the data field 302, the UE ID from the UE ID field 308A, a modulo 2 adder 310 and a mask 311, a CRC generator 304 and the resulting CRC field 312. The system 300 receives the data field 302 and inputs the data from the data field 302 into a first input of the modulo 2 adder 310. The UF ID from UE 11) field 308A is output to the second input to the modulo 2 adder 310. Accordingly, the data from the data field 302 and the UE ID from the UE ID field 308A are modulo 2 Lidded to create a mask 311. The mask 3 11 is input into the CRC generator 304 which generates a CRC field 3 12. In this embodiment, the number of bits of the UE ID field 308A (M bits) must be the same as the number of bits (X bits) of the data field 302 in order to perform the modulo 2 addition. If M and X are equal, then the value from the UE ID field 308A may be directly modulo 2 added to the data from the data field 302. However, if M and X arc not equal, then an interim step is necessary to make them equal, if M is less than X. then the Uf ID is padded with either X-M trailing zeros such that the value from the UE ID field 308A is equal in length to the data field 302. This "padded UE ID value" as shown in Fig. 6A is then modulo 2 added to the data from the data field 302. 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 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 308B is generated. In this embodiment, the UH 11) is padded with X-M leading zeros such that the UE ID from the UE ID field 308B 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. It should be noted that the padding may alternatively comprise a combination of leading and trailing zeros (not shown) in order to make the UH ID the same length as the data field. Referring to Fig. 6C, the CRC field 3 12 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. 7 A, a fifth embodiment of the present invention is shown. In this embodiment, the system 400 utili7es the data from the data field 402, the 11 ID from the UH ID field 40SA, 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 408A 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 408A 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 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 UI: 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 Fig. 7 A. The composite UE ID is then modulo 2 added to the data from the data field 402. Referring to Pig. 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. 7 A fhe only difference in this embodiment is the value from the UE ID field 408B. Although the composite UE ID created in (he same manner as in Fig. 7 A, the truncated UE ID portion is added as leading bits, as opposed to the trailing bits in the I UE ID field 408A shown in Fig. 7 A. It should be noted that the truncated UE ID "padding" may include a combination of leading and trailing truncated bits in order to 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'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 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 lo 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 anyone of the IDs described above. If the ID is none of these, then the Ill-discards the transmission. In accordance with the present invention, using the CRC code of the length N. the undetected error probability on the identified SCCE1-HS approaches 2 ". Using a 24-bit CRC to protect data transmitted on HS-DSCH a l6-bit CRC to protect control information transmitted on SCCH-HS, and assuming 10" false acceptance probability lor II! 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: (Equation Removed) where Pfa is the probability of a false acceptance; PfaHl is the probability of a false acceptance of HI; PraH 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 (i): (Equation Removed) 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 UF in accordance with the present invention. This method provides a genera! 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 node B first generates a downlink control message in the MAC layer (step 1) and then forwards the messuge and the UF 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 UF (step 4). At the physical layer, the I I: 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). 1". 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 H) is valid. However, das 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 lit: 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. We Claim: 1. A system (100) for transmitting a communication burst from a first communicating unit to at least a second communicating unit; characterized in that the system (100) comprises: at said first communicating unit: a cyclic redundancy check (CRC) generator (104) for receiving data (102) and generating a CRC (106); a first combiner (110) for combining said CRC (106) with an identification (108) of the second communicating unit to generate a mask (112); and a transmitter for transmitting the burst comprising said mask (112) and said data (102); and at said second communicating unit: a memory for storing the identification (108) of the second communicating unit; a receiver for receiving said communication burst including said mask (112) and said data (102); a second combiner for combining said mask (112) with said stored identification (108) to recover the CRC (106); and means for determining whether said recovered CRC (106) is valid. 2. The system (100) as claimed in claim 1, wherein said first and second combiners (110) are modulo-2 adders. 3. The system (100) as claimed in claim 1, comprising at least a third communication unit, whereby said third communication unit is associated with said identification number (108). 4. The system (100) as claimed in claim 1, comprising a plurality of communication units, wherein only a portion of said plurality of communication units is associated with said identification number (108). 5. A method for transmitting a data burst from a first communicating unit to a second communicating unit, in the system as claimed in claim 1; wherein the method having the steps of: at the first communicating unit: receiving data (102) for transmission by the said CRC generator; generating a cyclic redundancy check (CRC) (106) based upon the data by said CRC generator(102); combining the CRC (106) with an identification (108) of the second unit to generate a mask (112); and appending the mask (112) onto the data (102) to form a data burst by said combiner; and transmitting the data burst; and at the second communicating unit: receiving the data burst by said receiver; retrieving the identification (108) of the second unit from memory; and combining the retrieved identification with the mask (112) to generate the CRC (106) by said combiner; and determining whether the CRC (106) is valid by said CRC generator.

Documents:

1910-delnp-2003-abstract.pdf

1910-delnp-2003-assignment.pdf

1910-delnp-2003-claims-cancelled.pdf

1910-delnp-2003-claims.pdf

1910-delnp-2003-complete specification (as files).pdf

1910-delnp-2003-complete specification (granted).pdf

1910-DELNP-2003-Correspondence Others-(29-04-2011).pdf

1910-DELNP-2003-Correspondence-Others-(31-03-2010).pdf

1910-delnp-2003-correspondence-others.pdf

1910-delnp-2003-correspondence-po.pdf

1910-delnp-2003-description (complete).pdf

1910-delnp-2003-drawings.pdf

1910-delnp-2003-form-1.pdf

1910-delnp-2003-form-13.pdf

1910-delnp-2003-form-19.pdf

1910-delnp-2003-form-2.pdf

1910-DELNP-2003-Form-27-(29-04-2011).pdf

1910-delnp-2003-form-3.pdf

1910-delnp-2003-form-5.pdf

1910-delnp-2003-gpa.pdf

1910-delnp-2003-pct-101.pdf

1910-delnp-2003-pct-210.pdf

1910-delnp-2003-pct-304.pdf

1910-delnp-2003-pct-401.pdf

1910-delnp-2003-pct-408.pdf

1910-delnp-2003-pct-409.pdf

1910-delnp-2003-pct-424.pdf

1910-DELNP-2003-Petition 138-(31-03-2010).pdf

1910-DELNP-2003-Petition-137-(29-04-2011).pdf

1910-delnp-2003-petition-138.pdf