WO2003085874A1 - Generation of a block coded terminal identifier - Google Patents

Generation of a block coded terminal identifier Download PDF

Info

Publication number
WO2003085874A1
WO2003085874A1 PCT/EP2003/003405 EP0303405W WO03085874A1 WO 2003085874 A1 WO2003085874 A1 WO 2003085874A1 EP 0303405 W EP0303405 W EP 0303405W WO 03085874 A1 WO03085874 A1 WO 03085874A1
Authority
WO
WIPO (PCT)
Prior art keywords
code
message
unique identifier
block
error check
Prior art date
Application number
PCT/EP2003/003405
Other languages
French (fr)
Inventor
Eric Douglas Murray
Original Assignee
Roke Manor Research
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from GB0207905A external-priority patent/GB0207905D0/en
Application filed by Roke Manor Research filed Critical Roke Manor Research
Priority to AU2003221542A priority Critical patent/AU2003221542A1/en
Publication of WO2003085874A1 publication Critical patent/WO2003085874A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0072—Error control for data other than payload data, e.g. control data

Definitions

  • the present invention relates to improvements in or relating to mobile terminal identification.
  • the present invention relates to an apparatus and a method for addressing a digital data message to a recipient device using block coded scrambling codes, thereby providing implicit mobile terminal identification.
  • a scrambling code specific to a given user equipment can be used for the purposes of implicitly identifying the intended UE for a transmission on a shared channel: no explicit UE identifier need be transmitted. Implicit identification is achieved by scrambling a known or derivable data sequence that must be transmitted anyway. One suitable sequence would be an error checking sequence.
  • the term user equipment refers generally to a class of user devices which operate within a telecommunications network and which are distinct from base stations. An important example of a UE is a mobile telephone handset.
  • Error checking seeks to ensure the accuracy of transmission of digital data.
  • One commonly used error checking technique is CRC (Cyclical Redundancy Checking).
  • CRC Cyclical Redundancy Checking
  • the transmitted messages are divided into blocks of a predetermined number of bits.
  • a fixed (known) polynomial operates upon each message block.
  • the result of the operation known as the cyclical redundancy code, is appended onto and sent with each message block as check data.
  • the device receiving the message performs the same calculation for each message block received so that the remainder is recalculated. If the locally calculated CR code does not match the transmitted CR code, an error is detected.
  • UE is carried implicitly by scrambling the CR code with a UE specific scrambling code. This scrambling code is generated by zero-padding the
  • UE identifier to the predetermined length of a CR code, (generally either 16 bits or 32 bits).
  • the zero-padding scrambling technique can potentially lead to incorrect identification where there are unfavourable minimum distance properties for the set of UE identifiers. Although an erroneous message on a shared channel will be rejected by the intended recipient, there is an ever- present possibility that the error could lead to the identification of a different and unintended, yet valid, recipient.
  • the minimum "distance" between UE identifiers can be calculated from the number of bits whose values must change when switching from one identifier to the next.
  • scrambling code for implicit identification of a given UE may be generated by block coding a unique identifier such that the set of scrambling codes has good minimum distance properties for the set of UE identifiers.
  • a method for addressing, to a selected recipient device having associated therewith a unique identifier, a message for transmission over a telecommunications network supporting communication with many recipient devices comprising the steps of: providing an error check portion for inclusion in the message; block-coding the unique identifier; and combining the error check portion and the block-coded unique identifier, thereby generating for said message a coded inclusion implicitly indicative of the unique identity of said selected recipient device.
  • said error check portion comprises a code derived from the message and, in one embodiment, such a code comprises a cyclical redundancy code derived by performing the step of cyclical redundancy checking on said message.
  • said error check portion comprises a code of Z-bits in length and said unique identifier comprises a code of X bits in length; said block coding step is performed on said unique identifier by means of a (Z, X) block code conforming, for example, to Reed-Muller criteria.
  • the step of combining the error check portion and the block-coded unique identifier is implemented by means of an exclusive OR operation.
  • the invention also provides, from another aspect, a communications network comprising means configured to implement the methods described in any of the preceding paragraphs for addressing, to a selected recipient device having associated therewith a unique identifier, a message for transmission over the network.
  • Figure 2 shows a method for generating scrambling code in accordance with the present invention.
  • HS-DSCH (HS-SCCH) transmission can be carried implicitly by scrambling the CR code with a UE specific scrambling code.
  • HS-SCCH HS-DSCH
  • this scrambling code is generated by zero- padding the UE identifier to the length of a CR code.
  • UTRA denotes UMTS Terrestrial Radio Access, where UMTS stands for Universal Mobile Telecommunications System.
  • each CR code is Z bits in length
  • the (X bit long) unique identifier for each UE is zero-padded.
  • the zero-padding is applied to the most significant bits (MSB).
  • MSB most significant bits
  • the data of each message is Y bits in length. Y may be greater than, less than or equal to the predetermined length of a CR code.
  • a CR code is generated from the message by a CRC generator.
  • the CR code and the zero-padded identifier are combined.
  • the combining function is a bitwise exclusive-OR (XOR) operation.
  • the combined output is thus a CR code which has been scrambled for the receipt by a specific UE. If there are no channel errors, then this scheme works adequately for both the intended and unintended UEs. If a CR code computed for the received data matches the unscrambled transmitted CR code, then the UE can be reasonably certain that the message is intended for it. If on the other hand, the two do not match, then the UE can assume that either the message was intended for it, but has been corrupted by errors, or that the message was not intended for it. In both cases, the UE should not attempt to decode the message.
  • the probability of a HS-SCCH (shared channel) transmission appearing to have a valid scrambling code for a user equipment other than the originally intended UE is 1 in 2 (Z"X , and is independent of the method used to generate the scrambling code (provided each scrambling code is imique).
  • Z"X the probability of a HS-SCCH (shared channel) transmission appearing to have a valid scrambling code for a user equipment other than the originally intended UE.
  • the scrambling code is generated using a (Z, X) block code. This code is constructed as follows:
  • ⁇ X j : j 0 .. X-l
  • X ⁇ Z ⁇ is the X-bit UE identifier
  • ⁇ is the exclusive-OR operator
  • each CR code is Z bits in length and the unique identifier for each UE is X bits in length.
  • the block code described above results in a coded identifier that is Z bits long.
  • a CR code is generated from the message by a CRC generator.
  • the CR code and the coded identifier are combined.
  • the combining function is a bitwise exclusive-OR (XOR) operation.
  • the combined output is thus a CR code which has been scrambled for the receipt by a specific UE.
  • the block coding technique applied uses Reed-Muller code.
  • Reed-Muller code gives near-optimum mimmum distance properties irrespective of the actual value of X.
  • the use of Reed- Muller codes does however require that Z is a power of 2. However, as is known in the art, the code can be "punctured" even where Z is not a power of2.
  • Reed-Muller encoded messages relies on the minimum distance properties between UE identifiers. Reed-Muller codes are distributed evenly amongst the possible Z bit long sequences thereby maintaining the maximum distance between codes. Even in the presence of errors, Reed-Muller codes allow a decoder to assume that the message was encoded according to the closest (most similar) Reed-Muller codeword. It will be understood that the generation of scrambling code is not limited to UEs. Certainly scrambling codes may be generated by UEs that have an appropriate set of basis functions. It is also possible that scrambling codes may be generated elsewhere on the network and signalled directly to the UE over the network.

Abstract

A user equipment (UE) specific scrambling code can be used for the purposes of implicitly identifying the intended UE for a transmission on a shared channel (i.e. no explicit UE identifier is transmitted). This is achieved by scrambling a known or derivable data sequence that must be transmitted anyway, such as a cyclic redundancy code (CRC). It is proposed that this scrambling code be generated by block coding the UE identifier such that the set of scrambling codes has good minimum distance properties for the set of UE identifiers. The proposed technique is to use a set of basis sequence to generate the code. Basis sequences sets exist that will give good minimum distance properties independent of the size of the UE identifier. By using one of these sets, the probability that an unintended UE will incorrectly believe a message on the shared channel to be intended for it can be reduced when compared to existing techniques, such as zero-padding the UE identifier.

Description

GENERATION OF A BLOCK CODED TERMINAL IDENTIFIER
The present invention relates to improvements in or relating to mobile terminal identification. In particular the present invention relates to an apparatus and a method for addressing a digital data message to a recipient device using block coded scrambling codes, thereby providing implicit mobile terminal identification.
A scrambling code specific to a given user equipment (UE) can be used for the purposes of implicitly identifying the intended UE for a transmission on a shared channel: no explicit UE identifier need be transmitted. Implicit identification is achieved by scrambling a known or derivable data sequence that must be transmitted anyway. One suitable sequence would be an error checking sequence. As is well known in the art, the term user equipment refers generally to a class of user devices which operate within a telecommunications network and which are distinct from base stations. An important example of a UE is a mobile telephone handset.
Error checking seeks to ensure the accuracy of transmission of digital data. One commonly used error checking technique is CRC (Cyclical Redundancy Checking). In CRC, the transmitted messages are divided into blocks of a predetermined number of bits. A fixed (known) polynomial operates upon each message block. The result of the operation, known as the cyclical redundancy code, is appended onto and sent with each message block as check data. The device receiving the message performs the same calculation for each message block received so that the remainder is recalculated. If the locally calculated CR code does not match the transmitted CR code, an error is detected.
In 2002-03 release of the UTRA system, the address of the recipient
UE is carried implicitly by scrambling the CR code with a UE specific scrambling code. This scrambling code is generated by zero-padding the
UE identifier to the predetermined length of a CR code, (generally either 16 bits or 32 bits).
The zero-padding scrambling technique can potentially lead to incorrect identification where there are unfavourable minimum distance properties for the set of UE identifiers. Although an erroneous message on a shared channel will be rejected by the intended recipient, there is an ever- present possibility that the error could lead to the identification of a different and unintended, yet valid, recipient. The minimum "distance" between UE identifiers can be calculated from the number of bits whose values must change when switching from one identifier to the next.
It is therefore an object of the invention to obviate or at least mitigate the aforementioned problems.
Advantageously, scrambling code for implicit identification of a given UE may be generated by block coding a unique identifier such that the set of scrambling codes has good minimum distance properties for the set of UE identifiers.
In accordance with one aspect of the present invention, there is provided a method for addressing, to a selected recipient device having associated therewith a unique identifier, a message for transmission over a telecommunications network supporting communication with many recipient devices; the method comprising the steps of: providing an error check portion for inclusion in the message; block-coding the unique identifier; and combining the error check portion and the block-coded unique identifier, thereby generating for said message a coded inclusion implicitly indicative of the unique identity of said selected recipient device. Preferably, said error check portion comprises a code derived from the message and, in one embodiment, such a code comprises a cyclical redundancy code derived by performing the step of cyclical redundancy checking on said message.
It is preferred that, in circumstances where said error check portion comprises a code of Z-bits in length and said unique identifier comprises a code of X bits in length; said block coding step is performed on said unique identifier by means of a (Z, X) block code conforming, for example, to Reed-Muller criteria.
Conveniently and preferably, the step of combining the error check portion and the block-coded unique identifier is implemented by means of an exclusive OR operation.
The invention also provides, from another aspect, a communications network comprising means configured to implement the methods described in any of the preceding paragraphs for addressing, to a selected recipient device having associated therewith a unique identifier, a message for transmission over the network.
For a better understanding of the present invention, reference will now be made, by way of example only, to the accompanying drawings in which: - Figure 1 shows the method for generating scrambling code adopted in the 2002-03 release of the current UTRA standard; and
Figure 2 shows a method for generating scrambling code in accordance with the present invention. The address of the recipient UE for a Shared Control Channel for
HS-DSCH (HS-SCCH) transmission can be carried implicitly by scrambling the CR code with a UE specific scrambling code. In the 2002-
03 release of the UTRA system, this scrambling code is generated by zero- padding the UE identifier to the length of a CR code.
Note that the abbreviation UTRA denotes UMTS Terrestrial Radio Access, where UMTS stands for Universal Mobile Telecommunications System.
The standard scrambling process is shown in Figure 1. Where each CR code is Z bits in length, the (X bit long) unique identifier for each UE is zero-padded. In Figure 1, the zero-padding is applied to the most significant bits (MSB). The zero-padded identifier is now Z bits long.
The data of each message is Y bits in length. Y may be greater than, less than or equal to the predetermined length of a CR code. A CR code is generated from the message by a CRC generator.
The CR code and the zero-padded identifier are combined. In Figure 1, the combining function is a bitwise exclusive-OR (XOR) operation. The combined output is thus a CR code which has been scrambled for the receipt by a specific UE. If there are no channel errors, then this scheme works adequately for both the intended and unintended UEs. If a CR code computed for the received data matches the unscrambled transmitted CR code, then the UE can be reasonably certain that the message is intended for it. If on the other hand, the two do not match, then the UE can assume that either the message was intended for it, but has been corrupted by errors, or that the message was not intended for it. In both cases, the UE should not attempt to decode the message. In the presence of channel errors, however, the possibility that an unintended UE believes that it is the intended UE must be considered. This could happen because errors in the message data change the computed CR code in the UE, or because errors in the received CR code itself change the effective scrambling code used (or a combination of both these errors).
If all error combinations were equally likely, then the probability of a HS-SCCH (shared channel) transmission appearing to have a valid scrambling code for a user equipment other than the originally intended UE is 1 in 2(Z"X , and is independent of the method used to generate the scrambling code (provided each scrambling code is imique). However, in practice, all error combinations will not be equally likely due to the nature of the channel and the convolutional decoding procedure, and hence the method of generating the scrambling code will have an effect on the probability of reception by an unintended UE. The proposed technique is to use a set of basis sequences to generate the code. Basis sequences sets exist that will give good minimum distance properties independent of the size of the UE identifier. By using one of these sets, the probability that an unintended UE will incorrectly believe a message on the shared channel to be intended for it can be reduced when compared to existing teclmiques, such as zero-padding the UE identifier.
In a preferred embodiment, the scrambling code is generated using a (Z, X) block code. This code is constructed as follows:
for all i = 0 .. Z-l, where {zi : i = 0 .. Z-l} is the Z-bit scrambling code;
{Xj : j = 0 .. X-l; X < Z} is the X-bit UE identifier; {Aj : j = 0 .. X-l} is a set of X basis sequences of Z bits each; {Ajsi : i = 0 .. Z-l} is the set of bits of basis sequence AJ;
Θ is the exclusive-OR operator; and
• is the AND operator.
The method is illustrated in Figure 2. Again each CR code is Z bits in length and the unique identifier for each UE is X bits in length. The block code described above results in a coded identifier that is Z bits long.
As in the conventional method, a CR code is generated from the message by a CRC generator.
The CR code and the coded identifier are combined. As before, the combining function is a bitwise exclusive-OR (XOR) operation. The combined output is thus a CR code which has been scrambled for the receipt by a specific UE.
In a preferred embodiment the block coding technique applied uses Reed-Muller code. Reed-Muller code gives near-optimum mimmum distance properties irrespective of the actual value of X. The use of Reed- Muller codes does however require that Z is a power of 2. However, as is known in the art, the code can be "punctured" even where Z is not a power of2.
The decoding of Reed-Muller encoded messages relies on the minimum distance properties between UE identifiers. Reed-Muller codes are distributed evenly amongst the possible Z bit long sequences thereby maintaining the maximum distance between codes. Even in the presence of errors, Reed-Muller codes allow a decoder to assume that the message was encoded according to the closest (most similar) Reed-Muller codeword. It will be understood that the generation of scrambling code is not limited to UEs. Certainly scrambling codes may be generated by UEs that have an appropriate set of basis functions. It is also possible that scrambling codes may be generated elsewhere on the network and signalled directly to the UE over the network.
Although the preceding discussion is concerned with specific sets of basis functions it will be understood that basis functions for use in the block code method may be selected in a great many different ways. The present invention is not intended to be limited to the sets of basis functions given in illustrative examples; indeed any sets of X basis functions of Z bits length can be adopted.

Claims

CLAIMS:
1. A method for addressing, to a selected recipient device having associated therewith a unique identifier, a message for transmission over a telecommunications network supporting communication with many recipient devices; the method comprising the steps of: providing an error check portion for inclusion in the message; block-coding the unique identifier; and combining the error check portion and the block-coded unique identifier, thereby generating for said message a coded inclusion implicitly indicative of the unique identity of said selected recipient device.
2. A method according to claim 1 wherein said error check portion comprises a code derived from the message.
3. A method according to claim 2 wherein the code comprises a cyclical redundancy code derived by performing the step of cyclical redundancy checking on said message.
4. A method according to any preceding claim wherein said error check portion comprises a code of Z-bits in length and said unique identifier comprises a code of X bits in length; and wherein said block coding step is performed on said unique identifier by means of a (Z, X) block code.
5. A method according to claim 4 wherein said block-coding step is performed in accordance with a Reed-Muller code.
6. A method according to any preceding claim wherein said step of combining the error check portion and the block-coded unique identifier is implemented by means of an exclusive OR operation.
7. A method for addressing, to a selected recipient device having associated therewith a unique identifier, a message for transmission over a telecommunications network supporting communication with many recipient devices; the method being substantially as herein described with reference to and/or as shown in Figure 2 of the accompanying drawings.
8. A communications network comprising means configured to implement a method, according to any preceding claim, for addressing, to a selected recipient device having associated therewith a unique identifier, a message for transmission over the network.
9. An apparatus for addressing, to a selected recipient device having associated therewith a unique identifier, a message for transmission over a telecommunications network supporting communication with many recipient devices; the apparatus comprising: means for providing an error check portion for inclusion in the message; means for block-coding the unique identifier; and means for combining the error check portion and the block-coded unique identifier, thereby generating for said message a coded inclusion implicitly indicative of the unique identity of said selected recipient device.
10. An apparatus according to claim 9 wherein said error check portion comprises a code derived from the message.
11. An apparatus according to claim 10 wherein the code comprises a cyclical redundancy code derived by performing the step of cyclical redundancy checking on said message.
12. An apparatus according to any preceding claim wherein said error check portion comprises a code of Z-bits in length and said unique identifier comprises a code of X bits in length; and wherein said block coding step is performed on said unique identifier by means of a (Z, X) block code.
13. An apparatus according to claim 12 wherein said block-coding step is performed in accordance with a Reed-Muller code.
14. An apparatus according to any preceding claim wherein said step of combining the error check portion and the block-coded unique identifier is implemented by means of an exclusive OR operation.
PCT/EP2003/003405 2002-04-05 2003-03-31 Generation of a block coded terminal identifier WO2003085874A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2003221542A AU2003221542A1 (en) 2002-04-05 2003-03-31 Generation of a block coded terminal identifier

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
GB0207905A GB0207905D0 (en) 2002-04-05 2002-04-05 Improvements in or relating to mobile terminal identification
GB0207905.1 2002-04-05
GB0223130A GB2387303B (en) 2002-04-05 2002-10-07 Improvements in or relating to mobile terminal identification
GB0223130.6 2002-10-07

Publications (1)

Publication Number Publication Date
WO2003085874A1 true WO2003085874A1 (en) 2003-10-16

Family

ID=28793306

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2003/003405 WO2003085874A1 (en) 2002-04-05 2003-03-31 Generation of a block coded terminal identifier

Country Status (2)

Country Link
AU (1) AU2003221542A1 (en)
WO (1) WO2003085874A1 (en)

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005091540A1 (en) * 2004-03-19 2005-09-29 Novo Nordisk A/S A reduced size transmission data packet header format for a medical device
WO2008084985A2 (en) * 2007-01-09 2008-07-17 Lg Electronics Inc. Method of transmitting and receiving data in a wireless communication system
US8059606B2 (en) 2007-01-09 2011-11-15 Lg Electronics Inc. Method for reporting channel quality through uplink common channel in wireless communication
CN101594679B (en) * 2008-05-26 2011-12-28 中兴通讯股份有限公司 Method for allocating scrambling codes in self-adapting mode for a WCDMA network
US8155069B2 (en) 2007-01-09 2012-04-10 Lg Electronics Inc. Method of transmitting and receiving scheduling information in a wireless communication system
US8194559B2 (en) 2007-01-09 2012-06-05 Lg Electronics Inc. Method of controlling data retransmission in a wireless communication system
US8218491B2 (en) 2007-01-10 2012-07-10 Lg Electronics Inc. Method of transmitting data in wireless communication system
US8265007B2 (en) 2007-01-31 2012-09-11 Lg Electronics Inc. Method for receiving system information in multimedia broadcast/multicast service
US8265000B2 (en) 2007-01-08 2012-09-11 Lg Electronics Inc. Method for receiving common channel in wireless communication and terminal thereof
US8274950B2 (en) 2006-12-07 2012-09-25 Lg Electronics Inc. Method of performing status report in a mobile communication system
US8284722B2 (en) 2007-02-06 2012-10-09 Lg Electronics Inc. Method and apparatus of transmitting data in a wireless communication system
CN103036644A (en) * 2006-10-30 2013-04-10 交互数字技术公司 Wireless transmit/receive unit, node B, and method of implementing in node B
US8483127B2 (en) 2007-01-10 2013-07-09 Lg Electronics Inc. Method for constructing data format in mobile communication and terminal thereof
US8787920B2 (en) 2007-01-31 2014-07-22 Lg Electronics Inc. Method for transmitting and receiving system information via a broadcast channel (BCH) and a downlink shared channel (DL—SCH)
US9173223B2 (en) 2006-12-07 2015-10-27 Lg Electronics Inc. Method of transferring data in a wireless communication system
US9432878B2 (en) 2007-01-10 2016-08-30 Lg Electronics Inc. Method of generating data block in wireless communication system
EP3340722A4 (en) * 2015-09-09 2018-08-08 Huawei Technologies Co., Ltd. Method and device for transmitting data
US10390333B2 (en) 2013-05-02 2019-08-20 Huawei Technologies Co., Ltd. System and method for transmission source identification

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5142539A (en) * 1990-03-06 1992-08-25 Telefonaktiebolaget L M Ericsson Method of processing a radio signal message
EP0552861A2 (en) * 1992-01-13 1993-07-28 AT&T Corp. Modifying check codes in data packet transmission
US5870414A (en) * 1996-09-18 1999-02-09 Mcgill University Method and apparatus for encoding and decoding digital signals
US5935268A (en) * 1997-06-03 1999-08-10 Bay Networks, Inc. Method and apparatus for generating an error detection code for a modified data packet derived from an original data packet
US6201811B1 (en) * 1998-03-24 2001-03-13 Telefonaktiebolaget Lm Ericsson (Publ) Transferring Identifier information in a telecommunications system
WO2001097394A1 (en) * 2000-06-12 2001-12-20 Samsung Electronics Co., Ltd Apparatus and method for encoding and decoding tfci in a mobile communication system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5142539A (en) * 1990-03-06 1992-08-25 Telefonaktiebolaget L M Ericsson Method of processing a radio signal message
EP0552861A2 (en) * 1992-01-13 1993-07-28 AT&T Corp. Modifying check codes in data packet transmission
US5870414A (en) * 1996-09-18 1999-02-09 Mcgill University Method and apparatus for encoding and decoding digital signals
US5935268A (en) * 1997-06-03 1999-08-10 Bay Networks, Inc. Method and apparatus for generating an error detection code for a modified data packet derived from an original data packet
US6201811B1 (en) * 1998-03-24 2001-03-13 Telefonaktiebolaget Lm Ericsson (Publ) Transferring Identifier information in a telecommunications system
WO2001097394A1 (en) * 2000-06-12 2001-12-20 Samsung Electronics Co., Ltd Apparatus and method for encoding and decoding tfci in a mobile communication system

Cited By (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005091540A1 (en) * 2004-03-19 2005-09-29 Novo Nordisk A/S A reduced size transmission data packet header format for a medical device
CN103036644A (en) * 2006-10-30 2013-04-10 交互数字技术公司 Wireless transmit/receive unit, node B, and method of implementing in node B
CN103036645A (en) * 2006-10-30 2013-04-10 交互数字技术公司 Wireless transmit/receive unit, node B, and method of implementing in node B
US9173223B2 (en) 2006-12-07 2015-10-27 Lg Electronics Inc. Method of transferring data in a wireless communication system
US8274950B2 (en) 2006-12-07 2012-09-25 Lg Electronics Inc. Method of performing status report in a mobile communication system
US8265000B2 (en) 2007-01-08 2012-09-11 Lg Electronics Inc. Method for receiving common channel in wireless communication and terminal thereof
WO2008084985A2 (en) * 2007-01-09 2008-07-17 Lg Electronics Inc. Method of transmitting and receiving data in a wireless communication system
WO2008084985A3 (en) * 2007-01-09 2009-02-19 Lg Electronics Inc Method of transmitting and receiving data in a wireless communication system
US8059606B2 (en) 2007-01-09 2011-11-15 Lg Electronics Inc. Method for reporting channel quality through uplink common channel in wireless communication
US8155069B2 (en) 2007-01-09 2012-04-10 Lg Electronics Inc. Method of transmitting and receiving scheduling information in a wireless communication system
US8194559B2 (en) 2007-01-09 2012-06-05 Lg Electronics Inc. Method of controlling data retransmission in a wireless communication system
US8483127B2 (en) 2007-01-10 2013-07-09 Lg Electronics Inc. Method for constructing data format in mobile communication and terminal thereof
US8891453B2 (en) 2007-01-10 2014-11-18 Lg Electronics Inc. Method for constructing data format in mobile communication and terminal thereof
US9432878B2 (en) 2007-01-10 2016-08-30 Lg Electronics Inc. Method of generating data block in wireless communication system
US8218491B2 (en) 2007-01-10 2012-07-10 Lg Electronics Inc. Method of transmitting data in wireless communication system
US8787920B2 (en) 2007-01-31 2014-07-22 Lg Electronics Inc. Method for transmitting and receiving system information via a broadcast channel (BCH) and a downlink shared channel (DL—SCH)
US8798635B2 (en) 2007-01-31 2014-08-05 Lg Electronics Inc. Method for transmitting and receiving system information via a broadcast channel (BCH) and a downlink shared channel (DL—SCH)
US10439783B2 (en) 2007-01-31 2019-10-08 Lg Electronics Inc. Method for transmitting and receiving system information via a broadcast channel (BCH) and a downlink shared channel (DL_SCH)
US9008672B2 (en) 2007-01-31 2015-04-14 Lg Electronics Inc. Method for transmitting and receiving system information via a broadcast channel (BCH) and a downlink shared channel (DL—SCH)
US9130721B2 (en) 2007-01-31 2015-09-08 Lg Electronics Inc. Method for transmitting and receiving system information via a broadcast channel (BCH) and a downlink shared channel (DL—SCH)
US8265007B2 (en) 2007-01-31 2012-09-11 Lg Electronics Inc. Method for receiving system information in multimedia broadcast/multicast service
US9490952B2 (en) 2007-01-31 2016-11-08 Lg Electronics Inc. Method for transmitting and receiving system information via a broadcast channel (BCH) and a downlink shared channel (DL—SCH)
US9712307B2 (en) 2007-01-31 2017-07-18 Lg Electronics Inc. Method for transmitting and receiving system information via a broadcast channel (BCH) and a downlink shared channel (DL—SCH)
US11218270B2 (en) 2007-01-31 2022-01-04 Lg Electronics Inc. Method for transmitting and receiving system information via a broadcast channel (BCH) and a downlink shared channel (DL_SCH)
US8284722B2 (en) 2007-02-06 2012-10-09 Lg Electronics Inc. Method and apparatus of transmitting data in a wireless communication system
CN101594679B (en) * 2008-05-26 2011-12-28 中兴通讯股份有限公司 Method for allocating scrambling codes in self-adapting mode for a WCDMA network
US10390333B2 (en) 2013-05-02 2019-08-20 Huawei Technologies Co., Ltd. System and method for transmission source identification
US10440732B2 (en) 2015-09-09 2019-10-08 Huawei Technologies Co., Ltd. Method and device for transmitting data
EP3340722A4 (en) * 2015-09-09 2018-08-08 Huawei Technologies Co., Ltd. Method and device for transmitting data

Also Published As

Publication number Publication date
AU2003221542A1 (en) 2003-10-20

Similar Documents

Publication Publication Date Title
US7853857B2 (en) Multi-layer cyclic redundancy check code in wireless communication system
WO2003085874A1 (en) Generation of a block coded terminal identifier
JP4271855B2 (en) Method and apparatus for transmitting identifier information in communication system
KR100730715B1 (en) Flexible method of error protection in communications systems
KR100994351B1 (en) A method for encoding and decoding a user identifier in a communications system
AU2003202162B2 (en) Method for scrambling packet data using variable slot length and apparatus thereof
EP1317092B1 (en) Apparatus and method for transmitting and receiving data on packet data control channel
CA2468919A1 (en) Error detection code generating method and error detection code generator
US6690734B1 (en) Method and apparatus for puncturing code symbols in a communications system
US20200119844A1 (en) System and method for interleaving distributed crc in polar codes for early termination
GB2387303A (en) Mobile terminal identification/addressing
US20210242964A1 (en) Device and method for supporting harq
WO1998042097A1 (en) Message encoding technique for communication systems
KR100866192B1 (en) Apparatus and method for transmitting/receiving packet control data in a mobile communication system
CN111052614A (en) Message processing and corresponding device

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PH PL PT RO RU SC SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP