AU2012200817B2 - Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed - Google Patents

Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed Download PDF

Info

Publication number
AU2012200817B2
AU2012200817B2 AU2012200817A AU2012200817A AU2012200817B2 AU 2012200817 B2 AU2012200817 B2 AU 2012200817B2 AU 2012200817 A AU2012200817 A AU 2012200817A AU 2012200817 A AU2012200817 A AU 2012200817A AU 2012200817 B2 AU2012200817 B2 AU 2012200817B2
Authority
AU
Australia
Prior art keywords
pcs
tbf
pan
bits
masked
Prior art date
Legal status (The legal status 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 status listed.)
Expired - Fee Related
Application number
AU2012200817A
Other versions
AU2012200817A1 (en
Inventor
Behrouz Aghili
Prabhakar R. Chitrapu
Stephen Dick
Yan Li
Marian Rudolf
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
InterDigital Technology Corp
Original Assignee
InterDigital Technology Corp
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 AU2008233171A external-priority patent/AU2008233171B8/en
Application filed by InterDigital Technology Corp filed Critical InterDigital Technology Corp
Priority to AU2012200817A priority Critical patent/AU2012200817B2/en
Publication of AU2012200817A1 publication Critical patent/AU2012200817A1/en
Application granted granted Critical
Publication of AU2012200817B2 publication Critical patent/AU2012200817B2/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

A method and apparatus for indicating a temporary block flow (TBF) to which a piggybacked acknowledgement/non-acknowledgement (PAN) field is addressed. A PAN check sequence (PCS) is created, for example using a cyclic redundancy check (CRC) encoding.. The PCS is masked with a temporary flow identity (TFI) assigned to a TBF or a mask generated based on the Tl. A data block including the PAN field and the masked PCS is then processed for transmission, The mask may be generated by converting the TF1 using an (M, N) code, M being not greater than the number of bits of the PCS and N being the number of bits of the TFl. With this scheme, a TFl may be transmitted in a PAN field without using explicit bits to identify the TBF. Go h ci I --

Description

P01 Seqtllon 29 Regulaln 3,2(2) AUSTRALIA Patents Act 1990 COMPLETE SPECIFICATION STANDARD PATENT Application Number: Lodged: Invention Title: Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed. The following statement is a full description of this invention, including the best method of performing it known to us: P111AIAU/07-ID (0001] METHOD AND APPARATUS FOR INDICATING A TEMPORARY BLOCK FLOW TO WHICH A PIGGYBACKED ACKNOWLEDGEMENT/NON-ACKNOWLEDGEMENT FIELD IS ADDRESSED [0002] FIELD OF INVENTION [0003] The present invention is related to a wireless communication system. {0004] BACKGROUND [0005] Latency reduction is one of the considerations in a GSM/EDGE radio access network (GERAN). Two techniques have been proposed for the latency reduction: reduced transmission time interval (RTTI) and fast acknowledgement/non-acknowledgernent (ACK/NACK) reporting (FANR). [0006] Conventionally, an ACK/NACK report is sent in an explicit message, also referred to as a radio link control/medium access control (RLC/MAC) control block. The ACK/NACK report is addressed to a particular radio resource, called a Temporary Block Flow (TBF). [0007] A TBF is a temporal connection between a mobile station and a network to support a uni-directional transfer of data, ATBF is temporary and is maintained only for the duration of the data transfer. Each TBF is assigned a temporary flow identity (TF) by the network, The TFI is unique among concurrent~TBFs in each direction and is used instead of mobile station identity in the RLC/MAC layer. The same TFI is included in every RLC header belonging to a particular TBF. [0008] It has been proposed to send the ACK/NACK report for a certain TBF as a "piggyback" on an RLC/MAC data block that 'nay be addressed to another TBF. The field that carries the ACK/NACK report is referred to as a piggybacked ACK/NACK (PAN) field. [0009] Since the PAN field is included in a data block that may be addressed to a different TBF, it is necessary to identify to which TBF the PAN 2 field is addressed. Various proposals have been made to identify the correct TBF in the PAN field, including using a TFI or an uplink (UL) state flag (USF). During establishment of the uplink TBF, a USF is assigned to each mobile station. The USF is used by the network to indicate which mobile terminal is allowed to transmit in the following uplink radio block. [0010] In either case, some number of bits, (typically ranging from three to five), should be dedicated to the TBF identity in the PAN field. It would be desirable to have an efficient method of sending the TBF identity in the PAN field such that no dedicated bits are needed to identify the TBF. [0011] SUMMARY [0012] A method and apparatus are described for indicating a TBF to which a PAN field is addressed. A PAN check sequence (PCS) is created, for example using a cyclic redundancy check (CRC) encoding. The PCS is masked with a TFl assigned to a TBF or a mask generated based on the TFI. A data block including the PAN field and the masked PCS is then processed for transmission. The mask may be generated by converting the TFI using an (M, N) code, M being the number of bits of the PCS and N being the number of bits of the TFl. With this scheme, a TFI may be transmitted in a PAN field without using explicit bits to identify the TBF. [0013] In one aspect the present invention provides a method for use in a Global System for Mobile Communication (GSM) / Enhanced Data Rates for Global Evolution (EDGE) Radio Access Network (GERAN) compliant wireless transmit/receive unit (WTRU), the method including: receiving a first data block associated with a downlink temporary block flow (TBF), wherein the first data block includes a first header that includes a temporary flow identity (TFI) that identifies the downlink TBF; generating a piggybacked acknowledgement/non-acknowledgement (PAN) field corresponding to the downlink TBF; generating a PAN check sequence (PCS) based on the PAN field; masking a subset of PCS bits with the TFI to generate a masked PCS; generating a second data block, associated with an uplink TBF, that includes a second header, a data part corresponding to the uplink TBF, the PAN field, and the masked PCS; and 2a transmitting the second data block. [0014] In another aspect the present invention provides a Global System for Mobile Communication (GSM) / Enhanced Data Rates for Global Evolution (EDGE) Radio Access Network (GERAN) compliant wireless transmit/receive unit (WTRU) including: a receiver configured to receive a first data block associated with a downlink temporary block flow (TBF), wherein the first data block includes a first header that includes a temporary flow identity (TFI) that identifies the downlink TBF; a processor configured to: generate a piggybacked acknowledgement/non-acknowledgement (PAN) field corresponding to the downlink TBF; generate a PAN check sequence (PCS) based on the PAN field; mask a subset of PCS bits with the TFI to generate a masked PCS; and generate a second data block, associated with an uplink TBF, that includes a second header, a data part corresponding to the uplink TBF, the PAN field, and the masked PCS; and a transmitter configured to transmit the second data block. [0015] In a further aspect the present invention provides a method for use in a Global System for Mobile Communication (GSM) / Enhanced Data Rates for Global Evolution (EDGE) Radio Access Network (GERAN) compliant wireless transmit/receive unit (WTRU), the method including: transmitting a first data block associated with an uplink temporary block flow (TBF), wherein the first data block includes a first header that includes a temporary flow identity (TFI) that identifies the uplink TBF; receiving a second data block associated with a downlink TBF, wherein the second data block includes a header, a data part corresponding to the downlink TBF, a piggybacked acknowledgement/non-acknowledgement (PAN) field corresponding to the uplink TBF, and a masked PAN check sequence (PCS), wherein the masked PCS was masked with the TFl that identifies the uplink TBF; and de-masking the masked PCS using the TFl that identifies the uplink TBF.
2b [0016] In yet another aspect the present provides a Global System for Mobile Communication (GSM) / Enhanced Data Rates for Global Evolution (EDGE) Radio Access Network (GERAN) compliant wireless transmit/receive unit (WTRU) including: a transmitter configured to transmit a first data block associated with an uplink temporary block flow (TBF), wherein the first data block includes a first header that includes a temporary flow identity (TFI) that identifies the uplink TBF; a receiver configured to receive a second data block associated with a downlink TBF, wherein the second data block includes a header, a data part corresponding to the downlink TBF, a piggybacked acknowledgement/non acknowledgement (PAN) field corresponding to the uplink TBF, and a masked PAN check sequence (PCS), wherein the masked PCS was masked with the TFl that identifies the uplink TBF; and a processor configured to de-mask the masked PCS using the TFI that identifies the uplink TBF. [0017] BRIEF DESCRIPTION OF THE DRAWINGS [0017a] A more detailed understanding may be had from the following description, given by way of example in conjunction with the accompanying drawings wherein: Figure 1 shows an example radio block; Figure 2 is an example block diagram of a transmitting station; and Figure 3 is an example block diagram of a receiving station.
[00181 DETAILED DESCRIPTION [0019] When referred to hereafter, the terminology "wireless transmit/receive unit (WTRU)" includes but is not limited to a user equipment (UE), a mobile station (MS), a fixed or mobile subscriber unit, a pager, a cellular telephone, a personal digital assistant (PDA), a computer, or any other type of user device capable of operating in a wireless environment. When referred to hereafter, the terminology "base station" includes but is not limited to a Node-B, a site controller, an access point (AP), or any other type of interfacing device capable of operating in a wireless environment. (0020] Figure 1 shows an example radio block 100. The radio block 100 for data transfer includes one RLC/MAC header 102, a header check sequence (ICS) 104, one or more RLC data block(s) 106, a block check sequence (BCS) 108, a PAN field 110, and a PCS 112. The RLC/MAC header 102, the RLC data block(s) 106 and the PAN field 110 are coded separately for error detection and correction, and a separate checksum, (e.g., a cyclic redundancy check (CRC) checksum), is attached to each of them. The RLC/MAC header 102 contains a control field indicating whether a PAN field 110 is included or not in the radio block 100. The HCS 104 is used for error detection of the RLC/MAC header 102. The BCS 108 is used for error detection of the RLC data block 106. A separate BCS may be included for each RLC data block. The PAN field 110 contains piggy-backed ACK/NACK information sent in one direction to provide acknowledgement for a TEF in the other direction. The PCS 112 h used for error detection of the PAN field 110. [0021] Figure 2 is an example block diagram of a transmitting station 200. The transmitting station 200 may be a WTRU, a Node-B, or any other apparatus or device. The transmitting station 200 includes an encoder 202, a masking unit 204, and a transceiver 206. A PAN feld is input into the encoder 202. The encoder 202 generates a PCS based on the PAN field 201. For example, the encoder may be a cyclic redundancy check (CRC) encoder and the PCS may be a CRC checksum generated based on the PAN field 110. The masking unit 204 then masks the PCS with a TFI, (i.e,, TFI is used as a mask). The masking of the -3- POS bits with the TFI may be performed by modulo-2 addition, (i.e., an exclusive OR (XOR) operation). The transceiver 206 sends a data block 100 including the PAN field 110 and the masked PCS 112. With this scheme, a TFI may he transmitted in a PAN field without using explicit bits to identify the TBF. Before transmission, a channel coding, (such as forward error correction (FEC) coding, rate matching, interleaving, or the like), may be performed. [0022] At least one bit of the TFI is masked with at least one bit of the PCs. For example, when the number of PCS bits (M) is greater than the number of TFI bits (N), (e.g., N-5 and M=10), the TFI bits may be mapped to a portion or all of the PCS bits, (e.g., first N bits, last N bits, or a subset of the M bits). The opposite case is also possible if N is greater than M. [0023} Alternatively, the transmitting station 200 may include a mask generator 208. The mask generator 208 generates a mask from the TFI, and the masking unit 204 masks the PCS with the mask generated by the mask generator 208. The N-bit TFl may be converted into an M-bit mask using an (M, N) code, (M is the number of bits of the PCS.), and then the mask may be XORed with the PCS. [0024] Alternatively, the N-bit TFI may be converted into an L-bit mask using an (L, N) code, where L<M, (M is the number of bits of the PCS), and then the mask may be XORed with the PCS. For example, when the number of PCS bits (M) is greater than the number of mask bits (L), (e.g., L=8 and M=10), the mask bits may be mapped to a portion or all of the PCS bits, (e.g., first L bits, last L bits, or a subset of the L bits). The opposite case is also possible. [0025] The M-bit mask may be selected to provide improved separation, (e.g., Hamming distance), between the M bit sequences. For example, it may be obtained by binary multiplying the N-bit TFI with a generator matrix. A good masking code shall have the largest possible minimum distance and the lowest frequency of occurrence of this minimum value. 10026] Example generator matrices of the linear binary codes with maximal minimum distances are provided below. In these examples, the TFI is assumed to be 5 bits long. -4- (1) A (6,5) code with minimum distance 2 (applicable if M=6): I 0) 0 0 0 1 0 1 0 0 0 1 0 0 1 0 0 1. 0 0 0 1 0 1 0 0 0 0 3 1 (2) A (7,5) code with minimum distance 2 (applicable if M=7): 1 0 0 0 0 1 1 0 1 0 0 0. 1 1 0 0 1 0 0 1 1. 0 0 0 1 0 1 1 0 0 0 0 1 1 1 (3) An (8, 5) code with minimum distance 2 (applicable if M=8): 1 0 0 0 0 'A 1 0 0 0 1 0 0 0 1 t. 0 0 0 1 0 1 1 1 0 0 0 0 1 1 1 1 (4) A (9, 5) code with minimum distance 3 (applicable if M=9): 1 0 0 0 0 0 1 1 1 0 1 0 0 0 1 0 1 1 0 0 1 0 0 1 1 0 1. 0 0 0 1 0 1 1 1 0 (5) A (10, 5) code with minimum distance 4 (applicable if M=10): 1 0 0 0 0 0 1 1 1 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 1 1 0 1 1. 0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 1 1 1 1 0 (6) An (11, 5) code with minimum distance 4 (applicable if M±=11): -5- 1 0 0 0 1 1 0 0 0 1 0 0 1 0 0 1 0 1 0 0 1 0 0 0 1 0 1 0 0 1 0 1 0. 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 1 1 1 1 1 1 [00271 It should be noted that the above generator matrices are provided as an example, not as a limitation, and any other variances are also possible. For example, the matrices set forth above may be pre-multiplied and post-multiplied by binary permutation matrices, resulting in new matrices with the rows and/or the columns permuted, This column and/or row permutation will preserve the distance properties of the code. [0028] Figure 3 is an example block diagram of a receiving station 300. The receiving station 300 may be a WTRU, a base station, or any other apparatus or device. The receiving station 300 includes a transceiver 302, a de masking unit 304, and a decoder 306. The receiving station 300 may optionally further include a mask generator 308. The transceiver 302 receives a radio block including a PAN field and a masked PCS, such as the one shown in Figure 1. The transceiver 302 outputs the PAN field and the masked PCS. The de-masking unit 304 de-masks the received masked PCS with its own TFI assigned to a TBF or alternatively with a mask generated by the mask generator 308 using its own TF. The de-masking unit 304 outputs PAN hits and de-masked PCS bits. The decoder 306 then computes a PCS, (e.g., CRC bits), based on the received PAN field and compares the computed POS with the de-masked received PCS. If the two PCSs agree, then the received PAN field is declared to be addressed to the receiving station 300. If the two PCSs do not agree, the PAN field is declared to be not addressed to the receiving station 300 and then may be discarded. 10029] Alternatively, the decoder 306 may compute a PCS, (e.g., using CRC), and then mask the computed PCS with its TFI or a mask generated based on the TFI and then compare the computed masked PCS to the received masked PCs, [0030] The receiving station 300 may need to decode the received PAN against more than I stored TFIs because the receiving station 300 may be -6allocated more than one TBF, and each TBF has a TFI of its own. When multiple .TBFs are allocated to the receiving station 300, the receiving station 300 determines which TBF the PAN is addressed by de-masking against each possible TFI corresponding to its allocated TBFs. [0031] Embodiments. [0032] 1. A method for indicating a TBF to which a PAN field is addressed. [00331 2. The method of embodiment 1 comprising generating a PCS based on the PAN field. [0034] 3. The method of embodiment 2 comprising masking the PCS with a mask, the mask being related to the TBF. [0035] 4. The method of embodiment 3 comprising sending a data block including the PAN field and the masked PCS. [0036] 5. The method as in any one of embodiments 3-4, wherein the mask is a TFI assigned to the TBF. [0037] 6. The method as in any one of embodiments 3-5, wherein the masking of the PCS with the TFI is performed by bit-wise modulo-2 addition of at least one bit of the PCS with at least one bit of the TFI. [0038] 7. The method as in any one of embodiments 3-6, wherein a length of the PCS and a length of the TFI are different and N bits of the TF1 are masked with N bits of the PCS. [00391 8. The method of embodiment 7, wherein the N bits of the PCS are one of first N bits of the PCS, last N bits of the P0S, and a subset of the PCS. [0040] 9. The method as in any one of embodiments 3-8, wherein the PCS is generated by performing ORC encoding with the PAN field. [0041] 10. The method as in any one of embodiments 2-3, wherein the mask is generated based on a TFI assigned to the TBF. 10042] 11. The method of embodiment 10 wherein the mask is generated by. converting the TFI using an (M, N) code, M being not greater than the number of PCS bits and N being the number of TFI bits. (0043] 12. The method of embodiment 10 wherein the mask is obtained -7by binary multiplying the TFI with a generator matrix. [00441 13. The method of embodiment 12 wherein M equals 6 and the generator matrix is as follows: 1 0 0 0 0 1 0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 1 0 0 0 0 1 1 [0045 14. The method of embodiment 12 wherein M equals 7 and the generator matrix is as follows: 1 0 0 0 0 1 1 0 1 0 0 0 1 1 0 0 1 0 0 11 0 0 0 1 0 l1 0 0 0 0 1 1 1 [0046} 15. The method of embodiment 12 wherein M equals 8 and the generator matrix is as follows: 1 0 0 0 0 1 1 0 0 1 0 0 0 1 0 1 0 0 1 0 0 0 1 1 0 0 0 1 0 1 1 1 0 0 0 0 1 1 1 1 [0047J 16. The method of embodiment 12 wherein M equals 9 and the generator matrix is as follows: 1 0 0 0 0 01 1 1 0 1 0 0 0 1 0 1 1 0 0 1 0 0 1 1 0 1 0 0 0 1 0 1 1 1 0 0 0 0 011 11 [0048] 17. The method of embodiment 12 wherein M equals 10 and the generator matrix is as follows: -8- 1 0 0 0 0 0 1 1 1 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 1 1 0 1 1 0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 1 1 1 1 0. [0049] 18. The method of embodiment 12 wherein M equals 11 and the generator matrix is as follows: 1 0 0 0 1 1 0 0 0 1 0 0 1 0 0 1 0 1 0 0 1 0 0 0 1 0 1 0 0 1 0 1 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 1 1 1 1 1 1, [0050] 19. A method for processing a PAN field addressing a TBF. [0051] 20. The method of embodiment 19 comprising receiving a data block including a PAN field and a masked PCS. [0052] 21. The method of embodiment 20 comprising de-masking the masked PCS with a mask, the mask being related to the TBF. [0053] 22. The method of embodiment 21 comprising performing PCS decoding with the PAN field and the dc-masked PCS. [0054] 23. The method as in any one of embodiments 21-22, wherein the mask is a TFI assigned to the TBF. [0055] 24, The method as in any one of embodiments 21-22, wherein the mask is generated based on a TFI assigned to the TBF. [0056] 25. The method as in any one of embodiments 22-24, wherein the P0S decoding is performed by CRC decoding with the received PAN field. [0057] 26. A method for processing a PAN field addressing a TBF. [00581 27. The method of embodiment 26 comprising receiving a data block including a PAN field and a masked POS. [0059] 28. The method of embodiment 27 comprising computing a PCS with the received PAN field. [0060] 29. The method of embodiment 28 comprising masking the computed PCS with a mask, the mask being related to the TBF. -9- 100611 30. The method of embodiment 29 comprising comparing the received masked PCS and the computed masked PCS. [0062] 31. The method as in any one of embodiments 29-30, wherein the mask is a TFI assigned to the TBF. [0063] 32. The method as in any one of embodiments 29-30, wherein the mask is generated based on a TFI assigned to the TBP. [00641 33. The method as in any one of embodiments 28-32, wherein the PCS is computed by performing CRC encoding with the received PAN field. [00651 34. The method as in any one of embodiments 29-30, wherein the mask is generated by converting the TFI using an (M, N) code, M being not greater than the number of PCS bits and N being the number of TFI bits. [0066] 35. An apparatus for indicating a TBF to which a PAN field is addressed. [0067] 36, The apparatus of embodiment 35 comprising a P0S generator for processing a PAN field to generate a PCS. [0068] 37. The apparatus of embodiment 36 comprising a masking unit for masking the PCS with a mask, the mask being related to the TBF. [0069} 38, The apparatus of embodiment 37 comprising a transceiver for sending a data block including the PAN field and the masked PCS. [0070] 39. The apparatus as in any one of embodiments 37-38, wherein the mask is a TFI assigned to the TBF. [0071] 40. The apparatus of embodiment-39 wherein the masking unit performs the masking of the PCS and the TFI by bit-wise modulo-2 addition of at least one bit of the PCS with at least one bit of the TFL [00721 41. The apparatus as in any one of embodiments 39-40, wherein a length of the PCS and a length of the TFI are different and N bits of the TFI are masked with N bits of the PCS. [0073] 42. The apparatus of embodiment 41 wherein the N bits of the PCS are one of first N bits of the PCS, last N bits of the PS, and a subset of the PCs. [0074 43. The apparatus as in any one of embodiments 37-42, wherein -10the PCS is generated by performing CRC encoding with the PAN field. [0075] 44. The apparatus as in any one of embodiments 37-43, further comprising a mask generator for generating the mask based on a TFI assigned to the TBF. 100761 45. The apparatus of embodiment 44 wherein the mask generator converts the TFI into the mask using an (M, N) code, M being not greater than the number of PCS bits and N being the number of TFI bits. [00771 46. The apparatus of embodiment 44 wherein the mask is generated by binary multiplying the TFI with a generator matrix. [00781 47. The apparatus of embodiment 46 wherein M equals 6 and the generator matrix is as follows: 1 0 0 0 0 1 .0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 1 0 0 0 0 1 1 [00719] 48. The apparatus of embodiment 46 whereina M equals 7 and the generator matrix is as follows: 1 0 0 0 0 1 1 0 1 0 0 0 1 1 0 0 1 0 0 1 1 0 0 0 1 0 1 1 0 0 0 0 1 1 1, [0080) 49. The apparatus of embodiment 46 wherein M equals 8 and the generator matrix is as follows: 1 0 0 0 0 1 1 0 0 1 0 0 0 1 0 1 0 0 1 0 0 0 1 1 0 01 00 1 1 1 0 0 0 0 1 1 1 1_ [0081] 50. The apparatus of embodiment 46 wherein M equals 9 and the generator matrix is as follows: 0000111- 1 0 0 0 0 0 1 1 1 0 1 0 0 0 1 0 1 1 0 0 1 0 0 1 1 0 1 0 0 0 1 0 1 1 1 0 0 0 0 0 1 1 1 1 1 [0082] 51. The apparatus of embodiment 46 wherein M equals 10 and the generator matrix is as follows: 1 0 0 0 0 0 1 1 1 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 1 1 0 1 1 0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 1 1 1 1 0 [0083] 52. The apparatus of embodiment 46 wherein M equals 11 and the generator matrix is as follows: 1 0 0 0 1 1 0 0 0 -1 0 0 1 0 0 1 0 1 0 0 1 0 0 0 1 0 1 0 0 1 0 1 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 1 1 1 1 1 1. 100841 53, An apparatus for processing a PAN field addressing a TBF. [0085] 54. The apparatus of embodiment 53 comprising a transceiver for receiving a data block including a PAN field and a masked PCS. -[0086] 55. The'apparatus of emnbodftment 54 comprising a de-mnasking u-nit for de-masking the masked PCS with a mask, the mask being related to the TBF. [0087] 66, The apparatus of embodiment 55 comprising a PCS decoder for performing PCS decoding with the PAN field and the de-masked PCS. [0088] 57. The apparatus as in any one of embodiments 55-56, wherein the mask is a TFI assigned to the TBF, [0089] 58. The apparatus as in any one of embodiments 55-56, wherein the mask is generated based on a TFI assigned to the TBF. 100901 59. The apparatus as in any one of embodiments 56-58, -wherein the PCS. decoder is a CRC decoder.
[0091) 60. An apparatus for processing a PAN field addressing a TBF. [0092] 61. The apparatus of embodiment 60 comprising a transceiver for receiving a data block including a PAN field and a masked PCS, [0093] 62. The apparatus of embodiment 61 comprising a P0S encoder for computing a PCS with the received PAN field. [00941 63. The apparatus of embodiment 62 comprising a masking unit for masking the computed PCS with a mask, the mask being related to the TBF. [0095] 64. The apparatus of embodiment 63 comprising a comparator for comparing the received masked PCS and the computed masked PCS. [0096] 65. The apparatus as in any one of embodiments 63-64, wherein the mask is a TFI assigned to the TBF. [0097] 66. The apparatus as in any one of embodiments 63-64, wherein the mask is generated based on a TFI assigned to the TBF. [0098] 67. The apparatus of embodiment 66 wherein the mask generator converts the TFI into the mask using an (M, N) code, M being not greater than the number of PCS bits and N being the number of TF1 bits. [0099] 68. The apparatus as in any one of embodiments 62-67, wherein the PCS encoder is a CRC encoder and the PCS is a CRC checksum. [001001 Although features and elements are described above in particular combinations, each feature or element can be used alone without the other features and elements or in various combinations with or without other features and elements. The methods or flow charts provided herein may be implemented in a computer program, software, or firmware incorporated in a computer readable storage medium for execution by a general purpose computer or a processor. Examples of computer-readable storage mediums include a read only memory (ROM), a random access memory (RAM), a register, cache memory, semiconductor memory devices, magnetic media such as internal hard disks and removable disks, magneto-optical media, and optical media such as CD-ROM disks, and digital versatile disks (DVDs). [00101] Suitable processors include, by way of example, a general purpose processor, a special purpose processor, a conventional processor, a digital signal -13processor (DSP), a plurality of microprocessors, one or more microprocessors in association with a DSP core, a controller, a microcontroller, Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) circuits, any other type of integrated circuit (IC), and/or a state machine. [001.02] A processor in association with software may be used to implement a radio frequency transceiver for use in a wireless transmit receive unit (WTRU), user equipment (UE), terminal, base station, radio network controller (RNC), or any host computer. The WTHU may be used in conjunction with modules, implemented in hardware and/or software, such as a caniera, a video camera module, a videophone, a speakerphone, a vibration device, a speaker, a microphone, a television transceiver, a hands free headset, a keyboard, a Bluetooth@ module, a frequency modulated (FM) radio unit, a liquid crystal display (LCD) display unit, an organic light-emitting diode (OLED) display unit, a digital music player, a media player, a video game player module, an Internet browser, and/or any wireless local area network (WLAN) or Ultra Wide Band (UWB) module. -14-

Claims (12)

1. A method for use in a Global System for Mobile Communication (GSM) / Enhanced Data Rates for Global Evolution (EDGE) Radio Access Network (GERAN) compliant wireless transmit/receive unit (WTRU), the method including: receiving a first data block associated with a downlink temporary block flow (TBF), wherein the first data block includes a first header that includes a temporary flow identity (TFI) that identifies the downlink TBF; generating a piggybacked acknowledgement/non-acknowledgement (PAN) field corresponding to the downlink TBF; generating a PAN check sequence (PCS) based on the PAN field; masking a subset of PCS bits with the TF1 to generate a masked PCS; generating a second data block, associated with an uplink TBF, that includes a second header, a data part corresponding to the uplink TBF, the PAN field, and the masked PCS; and transmitting the second data block.
2. The method of claim 1, wherein the subset of PCS bits is a first N bits of the PCS bits, or a last N bits of the PCS bits.
3. The method of claim 1, wherein the PCS is generated by performing cyclic redundancy check (CRC) encoding with the PAN field.
4. A Global System for Mobile Communication (GSM) / Enhanced Data Rates for Global Evolution (EDGE) Radio Access Network (GERAN) compliant wireless transmit/receive unit (WTRU) including: a receiver configured to receive a first data block associated with a downlink temporary block flow (TBF), wherein the first data block includes a first header that includes a temporary flow identity (TFI) that identifies the downlink TBF; a processor configured to: generate a piggybacked acknowledgement/non-acknowledgement (PAN) field corresponding to the downlink TBF; 16 generate a PAN check sequence (PCS) based on the PAN field; mask a subset of PCS bits with the TFI to generate a masked PCS; and generate a second data block, associated with an uplink TBF, that includes a second header, a data part corresponding to the uplink TBF, the PAN field, and the masked PCS; and a transmitter configured to transmit the second data block.
5. The WTRU of claim 4, wherein the subset of PCS bits is a first N bits of the PCS bits, or a last N bits of the PCS bits.
6. The WTRU of claim 4, wherein the processor is further configured to generate the PCS by performing cyclic redundancy check (CRC) encoding with the PAN field.
7. A method for use in a Global System for Mobile Communication (GSM) / Enhanced Data Rates for Global Evolution (EDGE) Radio Access Network (GERAN) compliant wireless transmit/receive unit (WTRU), the method including: transmitting a first data block associated with an uplink temporary block flow (TBF), wherein the first data block includes a first header that includes a temporary flow identity (TFI) that identifies the uplink TBF; receiving a second data block associated with a downlink TBF, wherein the second data block includes a header, a data part corresponding to the downlink TBF, a piggybacked acknowledgement/non-acknowledgement (PAN) field corresponding to the uplink TBF, and a masked PAN check sequence (PCS), wherein the masked PCS was masked with the TFI that identifies the uplink TBF; and de-masking the masked PCS using the TF1 that identifies the uplink TBF.
8. The method of claim 7, wherein the de-masking further includes: de-masking the masked PCS using all TFIs identifying all TBFs associated with the WTRU. 17
9. The method of claim 7, wherein the de-masking further includes: performing cyclic redundancy check (CRC) decoding with the PAN field.
10. A Global System for Mobile Communication (GSM) / Enhanced Data Rates for Global Evolution (EDGE) Radio Access Network (GERAN) compliant wireless transmit/receive unit (WTRU) including: a transmitter configured to transmit a first data block associated with an uplink temporary block flow (TBF), wherein the first data block includes a first header that includes a temporary flow identity (TFI) that identifies the uplink TBF; a receiver configured to receive a second data block associated with a downlink TBF, wherein the second data block includes a header, a data part corresponding to the downlink TBF, a piggybacked acknowledgement/non acknowledgement (PAN) field corresponding to the uplink TBF, and a masked PAN check sequence (PCS), wherein the masked PCS was masked with the TFI that identifies the uplink TBF; and a processor configured to de-mask the masked PCS using the TFI that identifies the uplink TBF.
11. The WTRU of claim 10, wherein the processor is further configured to de mask the masked PCS using all TFIs identifying all TBFs associated with the WTRU.
12. The WTRU of claim 10, wherein the processor is further configured to de mask the masked PCS by performing cyclic redundancy check (CRC) decoding with the PAN field. INTERDIGITAL TECHNOLOGY CORPORATION WATERMARK PATENT AND TRADE MARKS ATTORNEYS P32413AU01
AU2012200817A 2007-03-28 2012-02-10 Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed Expired - Fee Related AU2012200817B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2012200817A AU2012200817B2 (en) 2007-03-28 2012-02-10 Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed

Applications Claiming Priority (7)

Application Number Priority Date Filing Date Title
US60/908,535 2007-03-28
US60/945,057 2007-06-19
US60/944,982 2007-06-19
US60/945,034 2007-06-19
US60/956,765 2007-08-20
AU2008233171A AU2008233171B8 (en) 2007-03-28 2008-03-27 Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed
AU2012200817A AU2012200817B2 (en) 2007-03-28 2012-02-10 Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
AU2008233171A Division AU2008233171B8 (en) 2007-03-28 2008-03-27 Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed

Publications (2)

Publication Number Publication Date
AU2012200817A1 AU2012200817A1 (en) 2012-03-01
AU2012200817B2 true AU2012200817B2 (en) 2015-01-22

Family

ID=45812553

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2012200817A Expired - Fee Related AU2012200817B2 (en) 2007-03-28 2012-02-10 Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed

Country Status (1)

Country Link
AU (1) AU2012200817B2 (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2387303A (en) * 2002-04-05 2003-10-08 Roke Manor Research Mobile terminal identification/addressing

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2387303A (en) * 2002-04-05 2003-10-08 Roke Manor Research Mobile terminal identification/addressing

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
HUAWEI, "Discussion on Fast Ack/Nack Report", 3GPP TSG GERAN #33, TDoc GP-070172, 12-16 February 2007 *

Also Published As

Publication number Publication date
AU2012200817A1 (en) 2012-03-01

Similar Documents

Publication Publication Date Title
US8681816B2 (en) Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed
US7912093B2 (en) Method and apparatus for providing piggybacked positive acknowledgement/negative acknowledgement field indicator and a polling indicator
US8572451B2 (en) Method and apparatus for indicating a temporary block flow to which a piggybacked ACK/NACK field is addressed
US8539308B2 (en) Method and apparatus for indicating a temporary block flow to which a piggybacked ACK/NACK field is addressed
AU2012200817B2 (en) Method and apparatus for indicating a temporary block flow to which a piggybacked acknowledgement/non-acknowledgement field is addressed
RU2426244C1 (en) Method and apparatus for indicating temporary block flow to which piggybacked ack/nack field is addressed

Legal Events

Date Code Title Description
DA3 Amendments made section 104

Free format text: THE NATURE OF THE AMENDMENT IS: AMEND THE NAME OF THE INVENTOR TO READ RUDOLF, MARIAN; AGHILI, BEHROUZ; CHITRAPU, PRABHAKAR R.; DICK, STEPHEN AND LI, YAN

MK25 Application lapsed reg. 22.2i(2) - failure to pay acceptance fee