WO2008041296A1 - Appareil de communication sans fil - Google Patents
Appareil de communication sans fil Download PDFInfo
- Publication number
- WO2008041296A1 WO2008041296A1 PCT/JP2006/319549 JP2006319549W WO2008041296A1 WO 2008041296 A1 WO2008041296 A1 WO 2008041296A1 JP 2006319549 W JP2006319549 W JP 2006319549W WO 2008041296 A1 WO2008041296 A1 WO 2008041296A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- sdu
- pdu
- data unit
- area
- 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.)
- Ceased
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W80/00—Wireless network protocols or protocol adaptations to wireless operation
- H04W80/02—Data link layer protocols
Definitions
- the present invention relates to a wireless communication apparatus having a function of dividing or combining first data items into a second data unit in data transfer between protocol layers of wireless communication, and more particularly to wireless communication.
- a wireless communication apparatus having a function of dividing or combining first data items into a second data unit in data transfer between protocol layers of wireless communication, and more particularly to wireless communication.
- this relates to a wireless communication device that performs communication processing when the end of the SDU is included in the PDU.
- the protocol layer in a wireless communication system such as W-CDMA is composed of a physical layer (layer 1), a data link layer (layer 2), and a network layer (layer 3).
- Layer 2 is MAC (Medium
- RLC Radio Link Control
- FIG. 1 shows RLC PDU (Protocol Data
- FIG. 2 is a diagram showing a format of (Unit).
- the RLC PDU (hereinafter referred to as PDU) shown in Fig. 1 is an Acknowledge that allows data acknowledgment control and retransmission control.
- the PDU header is a D / C bit that distinguishes between user data and control data, and a sequence number (SN (Sequence
- the data size of the PDU is fixed to, for example, 42 oct, 82 oct, 122 oct (loct (octet) is 8 bits), and is not changed during communication.
- the PDU is identified by the sequence number SN and The Kens number SN is given a number from 0 to a maximum of 4095, for example.
- the RLC transmission side is fixed by dividing, combining, and padding variable-length RLC SDUs (Service Data Units) (hereinafter referred to as SDUs) transmitted from higher layers. Convert to long PDU. Since the SDU size is variable, when the SDU is divided or combined into fixed-length PDUs, the end position of the SDU does not necessarily match the end position of the PDU. Therefore, if the end position of the SDU is present in the PDU, a length indicator LI is added to the PDU as header information to indicate the end position.
- SDUs Service Data Units
- the number of LI bits may be 7 bits (substantially 1 octet) or 15 bits (substantially 2 octets), and either one operates according to an instruction from an upper layer. However, since LI is usually 15 bits, the following description will be made with an example of operation with 15 bits. Whether LI is present in the PDU depends on the HE (Header
- FIG. 2 is a diagram showing a pattern of conventional PDU generation processing.
- 02 (A) is the case where the SDU data does not end with the last octet of the current PDU and continues. In this case, L I is not inserted.
- a PDU has a fixed length of 12 octets. If the header area does not contain LI, the header area is 2 octets and the data area is 10 octets. Each time the PDU includes the end of the SDU and a 2-octet LI is inserted to indicate it, the data area is decremented by 2 octets.
- Figure 2 ( ⁇ ') shows the case where the last segment data of the SDU data matches the last octet of the current PDU.
- the LI indicating that the end of the SDU ends with the end octet of the PDU cannot be inserted. If LI is inserted, the last segment data of the SDU will not end with the last octet of the PDU. Therefore, conventionally, as shown in Fig. 7 (b) described later, LI "0x0000" indicating that "SDU ended in accordance with the last octet of the previous SN PDU" is set to the header area of the next PDU. Insert into. In this case, there is a problem that it is not possible to determine that the SDU ends with the current PDU until the next PDU is received.
- FIG. 2 (B) shows a case where the SDU data ends with the last octet-1 of the current PDU and padding is inserted into the last octet.
- an LI since there is the end of the SDU in the PDU, it is necessary to insert an LI to indicate the position. If an LI with 2 octets is inserted, On the contrary, 1 octet is not enough. Therefore, without inserting the LI indicating the end position of the SDU, the last segment data of the S DU is stored up to the last octet of the PDU—padding is inserted into the remaining one octet, and the LI is inserted into the header area of the next PDU.
- [0010] 02 (C) is the case where the end of the SDU is included in the current PDU, and the end of the SDU and the end of the PDU match by inserting the LI indicating the end position of the SDU.
- the end position of the SDU can be determined from the current PDU, and no padding is inserted, so there is no problem.
- Figure 2 (D) shows the case where the end of the SDU is included in the current PDU, and when a 2-octet LI indicating the end position of the SDU is inserted, the last 1 octet is left and padding is inserted there. It is. In this case, it is not possible to insert a LI that indicates that the last 1 octet is padding. In this case, a normal LI value indicating the end position of the SDU is inserted, and padding is inserted into the remaining 1 octet. In the header area of the next PDU, ⁇ SDU matches the end octet of the previous PDU. LI "0x7FFB" is inserted to indicate that the remaining 1 octet is padding.
- Figure 2 (E) shows that when the end of an SDU is included in the current PDU and a 2-octet LI indicating the end position of the SDU is inserted, the last 2 octets are left, and there is segment data for the next SDU. Is inserted. The end position of the SDU is indicated by LI, and no padding is inserted, so there is no problem.
- Figure 2 (F) shows the case where the end of the SDU is included in the current PDU, and when the 2-octet LI indicating the end position of the SDU is inserted, the last 2 octets are left and padding is inserted there. It is. However, in practice, LI indicates that the remaining octets are padding.
- [0015] 02 (G) is the case where the end of the SDU is included in the current PDU, and when a 2-octet LI indicating the end position of the SDU is inserted, the last 2 octets are left and padding is inserted there. is there.
- the force to insert LI "0x7FFF" indicating that the octet is 2 octets of LI and the remaining octets are padding Ll "0x7FFF" j Even if is inserted, the last one octet is left, so padding is inserted there.
- FIG. 2 (H) shows a case where the last segment data of SDU # 1 ends with the current PDU, and the entire next SDU # 2 ends with the last octet of the current PDU.
- LI indicating the end position of SDU # 1 is inserted force.
- LI indicating the end position of SDU # 2 cannot be inserted! /. Therefore, there is a problem that it cannot be determined that the next SDU # 2 will end in the current PDU.
- [0017] 02 (1) is the case where SDU # 1 ends with the current PDU, and the next entire SDU # 2 ends with tail octet-1 of the current PDU.
- the LI indicating the end position of the SDI cannot include the LI indicating that the end of the next SDU # 2 is included and the end octet is padding. Therefore, there is a problem that it cannot be determined that the next SDU # 2 will be terminated in the current PDU.
- SDU # 1 ends with the current PDU, and the entire next SDU # 2 is also included in the current PDU, and LI indicating the end positions of SDU # 1 and SDU # 2 is displayed. This is the case when the end of SDU # 2 and the end of the PDU match. In this case, the end position of SDU # 2 can also be determined from the LI of the current PDU, and no problem occurs.
- SDU # 1 ends with the current PDU, and the entire next SDU # 2 is also included in the current PDU, and LI indicating the end positions of SDU # 1 and SDU # 2 is displayed.
- LI indicates that the last 1 octet of padding is inserted into the 2 octets of LI that indicate the end positions of SDU # 1 and SDU # 2.
- LI "0x7FFB" is inserted in the header area of the next PDU, indicating that "SDU ended with a match with the last octet of the previous PDU.
- Patent Document 1 in a wireless packet communication system configured to include one access point and a plurality of terminals, a terminal that transmits a packet to the access point receives a packet next to the access point. Is characterized in that next packet information indicating the size of the next packet to be transmitted or the presence or absence of the next packet is added to the packet.
- Patent Document 1 Japanese Unexamined Patent Publication No. 2006-67115
- FIG. 3 is a diagram showing processing when the next PDU after reception of the current PDU is retransmitted.
- the LC receiver (receiver's wireless communication device) receives PDUs sequentially.
- the end of SDU # 1 is the power contained in PDU # 3.
- LI indicating that PDU # 3 has the end of SDU # 1 is included in the next PDU # 4. Therefore, when PDU # 3 is received, SDU # 1 is completed, but the completion cannot be recognized until PDU # 4 is received and the LI included in it is acquired.
- a first configuration of the wireless communication apparatus of the present invention for achieving the above object is to receive a variable-length first data unit at a predetermined layer constituting a wireless communication protocol layer, and In a wireless communication device that converts one data unit to one or more fixed-length second data units, the received data size of the first data unit is the data size of the free data area of the second data unit. If larger, the dividing means for dividing the first data unit into a plurality of segment data in accordance with the data size of the empty data area of the second data unit, and the entire received first data unit or the plurality of data The data size of the last segment data of the segment data is one octet larger than the data size of the empty data area of the second data unit.
- a second configuration of the wireless communication apparatus is characterized in that, in the first configuration, the predetermined area is a header extension area of a protocol data unit.
- a third configuration of the wireless communication apparatus of the present invention is a predetermined layer that constitutes a protocol layer for wireless communication, receives a variable-length first data unit, and receives one first data unit. Or, in a wireless communication device that converts to a plurality of fixed-length second data units, if the data size of the received first data unit is larger than the data size of the empty data area of the second data unit, A dividing means for dividing the first data unit into a plurality of segment data in accordance with the data size of the empty data area of the second data unit; and the received first data unit or the plurality of segment data The end of the last segment data is included in the free data area of the second data unit, and the end of the end of the last segment data is included in the header area of the second data unit. If the indicator indicating the position is included, the remaining identifier indicating the type of data stored in the remaining free area of the second data unit after the end is set in the predetermined area of the header area of the second data unit. And a control means.
- the predetermined area in which the remaining identifier is set is a part of an area assigned to the indicator, and the remaining The end position can be indicated by the area.
- a fifth configuration of the wireless communication apparatus of the present invention is the same as the fourth configuration described above, wherein the empty data area of the second data unit includes the entire first data unit or a plurality of the last segment data. If the indicator indicating the position of each end is included, a remaining identifier indicating the type of data stored in the remaining free space of the second data unit is set in a part of the area of the last indicator. It is characterized by that.
- the remaining identifier has at least a first type of data stored in a remaining free area of the data unit. It is characterized by identifying whether the whole data unit, segment data of the first data unit or padding data.
- a seventh configuration of the wireless communication apparatus of the present invention is the above-described remaining configuration in the third configuration.
- the bespoke means that at least the first data unit, the segment data of the first data unit, the padding data or the entire first data unit and the end of the data type stored in the remaining free space of the data unit are It is characterized by identifying whether it is a combination of paddings inserted in octets.
- the first data unit is provided in a layer 2 constituting a protocol layer for wireless communication. It is a service data unit (SDU) transmitted / received in the RLC layer to which it belongs, and the second data unit is a protocol data unit (PDU) transmitted / received in the RLC layer.
- SDU service data unit
- PDU protocol data unit
- the indicator indicating the end position of the first data unit is inserted into the header area of the second data unit.
- the dilemma that the end of the data unit is not included in the second data area can be resolved.
- the receiving side wireless communication apparatus can determine completion of the first data unit from the current second data unit without waiting for reception of the next second data unit. it can. Also, the type of data after the end of the first data unit included in the current second data unit can be determined without waiting for the reception of the next second data unit. Therefore, even if reception of the next second data unit is delayed due to the retransmission processing of the next second data unit, the completion of the first data unit can be determined from the current second data unit.
- the assembled first data unit can be quickly transferred to the upper layer, and the transfer delay can be shortened.
- FIG. 1 is a diagram showing a format of RLC PDU (Protocol Data Unit).
- FIG. 2 is a diagram showing a pattern of conventional PDU generation processing.
- FIG. 3 is a diagram showing a process when the next PDU after receiving the current PDU is retransmitted.
- FIG. 4 is a configuration diagram of a wireless communication apparatus in an embodiment of the present invention.
- FIG. 5 is a diagram showing a PDU format in the embodiment of the present invention.
- FIG. 6 is a diagram for explaining the definition of RI in the embodiment of the present invention.
- FIG. 7 is a diagram illustrating the definition of LI in the embodiment of the present invention.
- FIG. 8 is a diagram for explaining the definition of the HE region in the embodiment of the present invention.
- FIG. 9 is a diagram showing a pattern of PDU generation processing in the embodiment of the present invention.
- FIG. 10 is a diagram showing a process when the next PDU after receiving the current PDU is retransmitted in the embodiment of the present invention.
- FIG. 11 is a diagram for explaining a delay in SDU transfer to a higher layer than in the first example.
- FIG. 12 is a diagram for explaining the delay of SDU transfer to a higher layer than in the second example. Explanation of symbols
- FIG. 4 is a configuration diagram of the wireless communication apparatus according to the embodiment of the present invention.
- the wireless communication device is the wireless communication terminal device 10 or the wireless base station device 20, and the wireless communication terminal device 1
- radio base station apparatus 20 is RLC transmission control units 11 and 21 and RLC reception control unit 12, respectively.
- the RLC transmission control units 11 and 21 divide the SDU from the upper layer into one or more segment data (if the SDU is smaller than the data size of the PDU, It has a function of converting into a PDU (in combination) and a function of resending the PDU subject to the retransmission request based on a retransmission request from the receiving side.
- RLC reception control units 12 and 22 assemble SDUs from received PDUs in the RLC layer
- the embodiment described below is the control in the RLC transmission control units 11 and 21, and the RLC transmission control units 11 and 21 are provided with the dividing means and the control means in the present invention.
- the radio base station apparatus 20 is the radio communication apparatus of the present invention
- the radio communication terminal apparatus 10 is the radio communication apparatus of the present invention.
- the RLC transmission control unit 11 of the radio communication terminal apparatus 10 will be described as an example, but the embodiment of the present invention is similarly applied to the RLC transmission control unit 21 of the radio base station apparatus 20.
- the RLC transmission control units 11 and 12 and the RLC reception control units 12 and 22 may be configured by deviations of hardware, software, or a combination of both.
- FIG. 5 is a diagram showing a PDU format in the embodiment of the present invention.
- the conventional 15-bit LI is reduced to 12 bits, and the 3-bit RI area is concatenated to the final LI. Since the maximum size of a PDU is 5000 bits, the maximum number of octets in the data area when LI is inserted is
- the content of the remaining data area after the position indicated by LI is determined by RI concatenated with the final LI (E bit is determined by "0"). Show. If the remaining data area is only padding, or Piggybacked
- STATUS PDU STATUS PDU
- FIG. 6 is a diagram for explaining the definition of RI in the embodiment of the present invention.
- five RI values are defined. Specifically, RI “000” is defined as “the rest of the position indicated by the LI value is SDU segment data”, and RI “001” is “the rest of the position indicated by the LI value is padding”
- RI “010” is defined as "the rest of the position indicated by the LI value is the entire SDU”
- RI “011” is the "the rest of the position indicated by the LI value is the entire SDU.
- the last octet Is defined as “padding”
- RI “100” is defined as “the rest of the position indicated by the LI value is Piggybacked STATUS PDU”.
- the remaining values are reserved values (Reserved). The processing using each RI will be described later.
- the conventional special LI value becomes unnecessary, and the LI value is purely a pointer indicating the position in the PDU.
- FIG. 7 is a diagram for explaining the definition of LI in the embodiment of the present invention.
- FIG. 7 (a) shows only the LI (normal LI value) used in the embodiment of the present invention
- FIG. 7 (b) shows the LI used in the embodiment of the present invention and the conventional LI.
- FIG. 5 is a diagram including a special LI that has been used and that is not used in the embodiment of the present invention.
- the special LI values “0x0000” and “0x7FFA”, “0x7FFB”, “0x7FFE”, and “0x7FFF”, which are conventionally used as shown in Fig. 7 (b), are no longer necessary, and the SDU from the next octet in the header area Only the normal LI value indicating the number of octets to the end is used (see Fig. 7 (a)).
- an unused value is newly defined in the HE area of the header area of the PDU.
- the upper bits are not currently used as "Reserved". Therefore, a new definition is added to indicate that the end of the SDU matches the end of the PDU using this upper bit. This makes it possible to indicate that the end of SDU without inserting LI matches the end of PDU, and inserts LI indicating that the end of SDU matches the end of PDU as before. This eliminates the dilemma that the end of the SDU does not match the end of the PDU.
- FIG. 8 is a diagram for explaining the definition of the HE region in the embodiment of the present invention.
- the values "00" and "01" are already defined values.
- a new value "10" is followed by the entire SDU or the end of the SDU. This is segment data and defines that the end of the PDU and the end of the SDU match.
- the value "1 ⁇ " is followed by the octet that follows the entire SDU or the last segment data of the SDU, and the end of the SDU is from the end of the PDU. There is up to 1 octet, the last 1 octet is padding ”. Processing using this HE region value will be described later.
- FIG. 9 is a diagram showing a pattern of PDU generation processing in the embodiment of the present invention. Corresponds to Figure 2. This processing is executed by the RLC transmission control units 11 and 21.
- Figure 9 (A) shows the case where the SDU data does not end with the last octet of the current PDU and continues. Since the SDU is larger than the data area of the PDU, the SDU is divided into multiple segment data and non-final segment data is stored in the PDU. In this case, there is no problem and it is the same as Fig. 2 (A).
- Figure 9 ( ⁇ ') shows the case where the last segment data of the SDU matches the last octet of the current PDU.
- the end of the SDU ends with the end octet of the PDU without inserting an LI.
- the value “10” in the HE area is defined as “the entire SDU or the last segment of the SDU after the following octet”, and a 2-octet LI indicating that the end of the SDU is the end of the PDU. It can be shown that the end of the SDU without insertion is the end of the PDU. Since LI is not inserted, the dilemma that the end of SDU does not coincide with the end of PDU by inserting LI is also resolved. On the receiving side (corresponding to RLC reception control units 12 and 22), it is possible to determine that the end of the SDU is the end of the PDU by reading the value “10” in the HE area. In addition, it is not necessary to insert a special LI value (see Fig. 7) indicating that the previous PDU has the end of the SDU in the next PDU. This solves the problem in Fig. 2 ( ⁇ ').
- Figure 9 (iii) shows the case where the SDU ends with the last octet-1 of the current PDU and padding is inserted into the last octet.
- the SDU ends with the last octet-1 of the current PDU and padding is inserted into the last octet.
- the value “11” in the HE area is defined as “the entire SDU or the last segment of the SDU after the following octet, and the last one octet is padding”, and the value “11” in the HE area is used. By doing so, it is possible to indicate that the SDU without inserting a 2-octet LI ends with the last octet of the current PDU, and that the last octet is padding. Since LI is not inserted, the dilemma that the end of SDU does not coincide with the end of PDU by inserting LI is also resolved.
- Fig. 9 (C) shows the case where the end of the SDU is included in the current PDU, and the end of the SDU and the end of the PDU match by inserting the LI indicating the end position of the SDU.
- the SDU end position can be determined from the current PDU by inserting a 2-octet LI that indicates the end position of the SDU, and no padding is inserted.
- RI "001” is defined as "the rest of the position indicated by the LI value is padding", and there is no padding, but it is assumed that padding of 0 octets is inserted.
- Figure 9 (D) shows the case where the end of the SDU is included in the current PDU, and when a 2-octet LI indicating the end position of the SDU is inserted, the last 1 octet is left and padding is inserted there. It is.
- RI “001” that is linked to the 2-octet LI indicating the end position of the SDU is also inserted.
- the last octet of the PDU is padding. With RI "001”, it can be determined that the last octet after the LI value is padding.
- a special LI value see Fig. 7) indicating that "the previous PDU has the end of SDU” in the next PDU. This eliminates the problem in Figure 2 (D).
- Figure 9 (E) shows that when the end of the SDU is included in the current PDU and a 2-octet LI indicating the end position of the SDU is inserted, the last 2 octets are left, and there is segment data for the next SDU. Is inserted. In this case, a 2-octet LI indicating the end position of the SDU is inserted, and the RI “000” to be linked to it is set.
- RI “000” is defined as “the remainder of the position indicated by the LI value is an SDU segment”, and the octet after the LI value (last 2 octets) stores the segment of the next SDU. Can be determined. When LI is set, the last 2 octets of the PDU become the next SDU segment.
- Figure 9 (F) shows the case where the end of the SDU is included in the current PDU, and when the 2-octet LI indicating the end position of the SDU is inserted, the last 2 octets are left and padding is inserted there. It is.
- insert an LI of 2 octets indicating the end position of the SDU and insert “001” to connect to the LI.
- LI the last 2 octets of the PDU are padded.
- RI “001” can be used to determine that the last two octets after the LI value are padding. Togashi.
- Figure 9 (G) shows the case where the end of the SDU is included in the current PDU, and when 2 octets of LI indicating the end position of the SDU are inserted, there is an extra 2 octets and padding is inserted there. It is.
- a 2-octet LI indicating the end position of the SDU is inserted, and RI “001” connected to the LI is inserted.
- the last 3 octets of the PDU are padding. With RI “001”, it is possible to determine that the last 3 octets after the LI value are padding.
- FIG. 9 (H) shows a case where the last segment data of SDU # 1 ends with the current PDU, and the entire next SDU # 2 ends with the last octet of the current PDU.
- set RI “010” to be linked to LI indicating the end position of SDU # 1. Since RI “010” is defined as “the rest of the position indicated by the LI value is the entire S DU”, the octet after the LI value is the entire next SDU # 2, and the end of the SDU # 2 It can be determined that the end of the PDU matches. As a result, the problem shown in FIG. 2 (H) can be solved.
- FIG. 9 (I) shows a case where SDU # 1 ends with the current PDU, and the next SDU # 2 as a whole ends with the last octet-1 of the current PDU.
- RI “011” is defined as “the rest of the position indicated by the LI value is the entire SDU.
- the last one octet is padding”, so the entire S DU # 2 following the octet after the LI value is defined.
- SDU # 2 ends with the last octet of the PDU) and it can be determined that the last octet is padding.
- the problem shown in Fig. 2 (1) can be solved.
- Figure 9 (J) shows that SDU # 1 ends with the current PDU, and the entire next SDU # 2 is also included in the current PDU, and LI indicating the end positions of SDU # 1 and SDU # 2 is displayed. This is the case when the last one octet is left after insertion, and padding is inserted there.
- the LI indicating the end position of SDU # 1 is inserted, and the LI indicating the end position of the next SDU # 2 is inserted, so that the entire SDU # 2 ends with the end octet of the current PDU.
- Each LI is linked to RI.
- SDU # 1 ends with the current PDU, and the entire next SDU # 2 is also included in the current PDU, and LI indicating the end positions of SDU # 1 and SDU # 2 is displayed.
- the LI indicating the end position of SDU # 1 is inserted, and further, the LI indicating the end position of the next SDU # 2 is inserted, so that the entire SDU # 2 ends with the end octet 1 of the current PDU.
- Padding is inserted in the last octet.
- 15-bit LI is reduced by 3 bits, for example, and 12 bits are used to indicate the state of octets after the end of the SDU. Introduce some remaining identifier RI.
- the end of the SDU matches the end of the PDU, and the end of the SDU ends at the end of the PDU—one octet, and the new octet is padding. Give a value of the proper definition to the HE area.
- FIG. 10 is a diagram showing processing when the next PDU after reception of the current PDU is retransmitted in the embodiment of the present invention.
- Fig. 4 shows the conventional processing.
- the RLC receiving side receives PDUs sequentially.
- the end of SDU # 1 is included in PDU # 3, and it is also indicated in PDU # 3 that the end of SDU # 1 matches the end of PDU # 3 by the processing of the embodiment of the present invention described above. Therefore, from the reception of PDU # 3, the end of SDU # 1 can be recognized and the completion of SDU # 1 can be confirmed. In other words, it is not affected by the delay in receiving the next PDU # 4 (such as when it is retransmitted), and can be transferred to the upper layer as soon as SDI is completed.
- FIG. 11 is a diagram for explaining the delay of SDU transfer to higher layers according to the first example.
- the first example shows the case of forwarding according to the order of PDUs (sequence number order).
- PDU # 1 is the end of PDU # 1
- Fig. 11 (a) shows the delay when there is no retransmission
- Fig. 11 (b) shows the end of SDU # 1 is the end of PDU # 1.
- Figure 11 (c) shows the delay due to conventional processing when PDU # 2 including LI indicating the end is retransmitted.
- Figure 11 (c) shows PDU # including the LI indicating the end of PDU # 1.
- FIG. 11 shows the case of forwarding according to the order of PDUs (sequence number order).
- 5 is a diagram showing a delay due to processing in the embodiment of the present invention when 2 is retransmitted.
- the time (delay time) from the start of reception of one PDU to the start of SDU transfer to the upper layer is set to 1.
- the delay time is the reference time “1” for all four PDUs, so the average delay time is “1”.
- Fig. 11 (b) showing the conventional case, when PDU # 2 is retransmitted and PDU # 2 retransmitted after PDU # 4 is received, the completion power of SDU # 1 Since it cannot be determined until PDU # 2 is received and cannot be transferred, the transfer of SDU # 1 is greatly delayed. When transferring SDUs in order, the transfer delay of SDU # 1 is affected and the transfer of subsequent SDUs is also greatly delayed. In the case of Fig. 11 (b), the average delay time is "5". .
- FIG. 11 (c) showing the case of the embodiment of the present invention
- SDU # 1 is a normal delay time. Transferred with ⁇ 1 '' and SDU Only the SDUs after # 2 are delayed, and the average delay time in this case is “3.25”, which is significantly reduced compared to the case of Fig. 11 (b).
- the capacity of the notifier memory for holding data can be reduced.
- FIG. 12 is a diagram for explaining the delay of SDU transfer to a higher layer than in the second example.
- the second example shows the case of transferring in the order of completion of SDUs in any order other than the order of SDUs. Similar to Fig. 11, the explanation is simplified when one SDU is assembled by one PDU.
- the end of SDU # 1 is the end of PDU # 1
- Fig. 12 (a) shows the delay when there is no retransmission
- Fig. 12 (b) shows the end of SDU # 1 is PDU #
- Figure 12 (c) shows the delay due to conventional processing when PDU # 2 including LI indicating the end of 1 is retransmitted.
- Figure 12 (c) shows the end of SDU # 1 with LI indicating the end of PDU # 1.
- FIG. 12 shows the end of SDU # 1 with LI indicating the end of PDU # 1.
- FIG. 10 is a diagram showing a delay due to processing in the embodiment of the present invention when included PDU # 2 is retransmitted.
- the time (delay time) from the start of reception of one PDU to the start of SDU transfer to higher layers is set to 1.
- the delay time is the reference time “1” for all four PDUs, so the average delay time is “1”.
- FIG. 12 (c) showing the case of the embodiment of the present invention
- SDU # 1 since information indicating the end of SDU # 1 is included in PDU # 1, SDU # 1 is a normal delay time. It is transferred with “1”, and SDU # 3 and # 4 are also transferred with normal delay time “1”, and only SDU # 2 is delayed.
- the average delay time is “1.75”, which is significantly reduced compared to the case of Fig. 12 (b).
- the capacity of the noffer memory for holding data can be reduced.
- the wireless communication device of the present invention is a radio communication protocol configuration.
- the communication processing in the case of converting from the SDU to the PDU has been described for the RLC layer belonging to the carrier 2, but this is not limited to the SDU and PDU in the RLC layer. It can be applied to communication processing when one data unit is divided or combined and converted to a second data unit.
- the present invention can be applied to a radio communication terminal apparatus and a radio base station apparatus constituting a radio communication system such as W-CDMA.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Dans une couche RLC dans la structure de couches de protocole d'un système de communication sans fil, pour convertir un SDU d'une couche supérieure en un PDU, un LI de 15 bits est par exemple réduit à 12 bits par soustraction de 3 bits, lesquels sont utilisés pour introduire un identificateur restant RI indiquant l'état des octets de la queue du SDU et des octets suivants. De plus, sans utiliser les LI, on fournit un secteur d'expansion d'en-tête avec les valeurs d'une nouvelle définition indiquant que la queue du SDU coïncide avec la queue du PDU, et que la queue du SDU se termine avec celle du PDU moins un octet, les octets de queue étant des éléments de remplissage. Cela peut résoudre le problème selon lequel l'insertion des LI indicateurs de la queue du SDU entraîne l'exclusion de la queue du SDU. Il devient en outre possible de déterminer, à partir du PDU actuel, que la queue du SDU est incluse dans le PDU actuel, et de déterminer, à partir du PDU actuel, les états des octets de la queue du SDU et des octets suivants, sans attendre la réception du PDU suivant.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/JP2006/319549 WO2008041296A1 (fr) | 2006-09-29 | 2006-09-29 | Appareil de communication sans fil |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/JP2006/319549 WO2008041296A1 (fr) | 2006-09-29 | 2006-09-29 | Appareil de communication sans fil |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2008041296A1 true WO2008041296A1 (fr) | 2008-04-10 |
Family
ID=39268162
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/JP2006/319549 Ceased WO2008041296A1 (fr) | 2006-09-29 | 2006-09-29 | Appareil de communication sans fil |
Country Status (1)
| Country | Link |
|---|---|
| WO (1) | WO2008041296A1 (fr) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010016151A1 (fr) * | 2008-08-08 | 2010-02-11 | 富士通株式会社 | Dispositif de communication, programme de génération de données d'émission, et procédé de génération de données d'émission |
| JP2011199647A (ja) * | 2010-03-19 | 2011-10-06 | Nippon Telegr & Teleph Corp <Ntt> | 誤り訂正符号化装置及び方法及びプログラム及び誤り訂正復号化装置及び方法及びプログラム |
| JP2012514952A (ja) * | 2009-01-07 | 2012-06-28 | クゥアルコム・インコーポレイテッド | 無線通信において受信されるパケットのアンバンドリング |
| US9326191B2 (en) | 2008-11-10 | 2016-04-26 | Qualcomm Incorporated | Method and apparatus for supporting the large service data unit (SDU) |
| US10569097B2 (en) | 2015-07-28 | 2020-02-25 | Photonmd, Inc. | Systems and methods for phototherapeutic modulation of nitric oxide |
| US11147984B2 (en) | 2020-03-19 | 2021-10-19 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US11654294B2 (en) | 2021-03-15 | 2023-05-23 | Know Bio, Llc | Intranasal illumination devices |
| US11986666B2 (en) | 2020-03-19 | 2024-05-21 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US12011611B2 (en) | 2020-03-19 | 2024-06-18 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US12029914B2 (en) | 2015-07-28 | 2024-07-09 | Know Bio, Llc | Phototherapeutic light for treatment of pathogens |
| US12115384B2 (en) | 2021-03-15 | 2024-10-15 | Know Bio, Llc | Devices and methods for illuminating tissue to induce biological effects |
| US12347337B2 (en) | 2020-12-10 | 2025-07-01 | Know Bio, Llc | Enhanced testing and characterization techniques for phototherapeutic light treatments |
| US12447354B2 (en) | 2020-03-19 | 2025-10-21 | Know Bio, Llc | Illumination devices for inducing biological effects |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000349814A (ja) * | 1999-06-03 | 2000-12-15 | Matsushita Electric Ind Co Ltd | 無線通信装置および無線通信方法 |
| JP2006025305A (ja) * | 2004-07-09 | 2006-01-26 | Fujitsu Ltd | パケット通信装置 |
-
2006
- 2006-09-29 WO PCT/JP2006/319549 patent/WO2008041296A1/fr not_active Ceased
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000349814A (ja) * | 1999-06-03 | 2000-12-15 | Matsushita Electric Ind Co Ltd | 無線通信装置および無線通信方法 |
| JP2006025305A (ja) * | 2004-07-09 | 2006-01-26 | Fujitsu Ltd | パケット通信装置 |
Cited By (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010016151A1 (fr) * | 2008-08-08 | 2010-02-11 | 富士通株式会社 | Dispositif de communication, programme de génération de données d'émission, et procédé de génération de données d'émission |
| CN102113368A (zh) * | 2008-08-08 | 2011-06-29 | 富士通株式会社 | 通信装置、发送数据生成程序以及发送数据生成方法 |
| JP5104952B2 (ja) * | 2008-08-08 | 2012-12-19 | 富士通株式会社 | 通信装置 |
| KR101234484B1 (ko) * | 2008-08-08 | 2013-02-18 | 후지쯔 가부시끼가이샤 | 통신 장치, 기록 매체, 및 송신 데이터 생성 방법 |
| RU2483462C2 (ru) * | 2008-08-08 | 2013-05-27 | Фудзицу Лимитед | Устройство передачи данных, программа генерирования данных передачи и способ генерирования данных передачи |
| KR101294570B1 (ko) | 2008-08-08 | 2013-08-07 | 후지쯔 가부시끼가이샤 | 통신 장치, 기록 매체, 및 송신 데이터 생성 방법 |
| US8681670B2 (en) | 2008-08-08 | 2014-03-25 | Fujitsu Limited | Apparatus and method for multiplexing data of a layer into data transmission unit of another layer |
| US9100965B2 (en) | 2008-08-08 | 2015-08-04 | Fujitsu Limited | Apparatus and method for multiplexing data of a layer into data transmission unit of another layer |
| US9326191B2 (en) | 2008-11-10 | 2016-04-26 | Qualcomm Incorporated | Method and apparatus for supporting the large service data unit (SDU) |
| JP2012514952A (ja) * | 2009-01-07 | 2012-06-28 | クゥアルコム・インコーポレイテッド | 無線通信において受信されるパケットのアンバンドリング |
| JP2011199647A (ja) * | 2010-03-19 | 2011-10-06 | Nippon Telegr & Teleph Corp <Ntt> | 誤り訂正符号化装置及び方法及びプログラム及び誤り訂正復号化装置及び方法及びプログラム |
| US11617895B2 (en) | 2015-07-28 | 2023-04-04 | Know Bio, Llc | Systems and methods for phototherapeutic modulation of nitric oxide |
| US12029914B2 (en) | 2015-07-28 | 2024-07-09 | Know Bio, Llc | Phototherapeutic light for treatment of pathogens |
| US11524173B2 (en) | 2015-07-28 | 2022-12-13 | Know Bio, Llc | Systems and methods for phototherapeutic modulation of nitric oxide |
| US10569097B2 (en) | 2015-07-28 | 2020-02-25 | Photonmd, Inc. | Systems and methods for phototherapeutic modulation of nitric oxide |
| US12440697B2 (en) | 2015-07-28 | 2025-10-14 | Know Bio, Llc | Systems and methods for phototherapeutic modulation of nitric oxide |
| US12397169B2 (en) | 2015-07-28 | 2025-08-26 | Know Bio, Llc | Phototherapeutic light for treatment of pathogens |
| US12179035B2 (en) | 2015-07-28 | 2024-12-31 | Know Bio, Llc | Phototherapeutic light for treatment of pathogens |
| US12109429B2 (en) | 2015-07-28 | 2024-10-08 | Know Bio, Llc | Phototherapeutic light for treatment of pathogens |
| US11684798B2 (en) | 2020-03-19 | 2023-06-27 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US12011611B2 (en) | 2020-03-19 | 2024-06-18 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US11986666B2 (en) | 2020-03-19 | 2024-05-21 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US11752359B2 (en) | 2020-03-19 | 2023-09-12 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US12390657B2 (en) | 2020-03-19 | 2025-08-19 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US11147984B2 (en) | 2020-03-19 | 2021-10-19 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US12447354B2 (en) | 2020-03-19 | 2025-10-21 | Know Bio, Llc | Illumination devices for inducing biological effects |
| US12347337B2 (en) | 2020-12-10 | 2025-07-01 | Know Bio, Llc | Enhanced testing and characterization techniques for phototherapeutic light treatments |
| US12115384B2 (en) | 2021-03-15 | 2024-10-15 | Know Bio, Llc | Devices and methods for illuminating tissue to induce biological effects |
| US11654294B2 (en) | 2021-03-15 | 2023-05-23 | Know Bio, Llc | Intranasal illumination devices |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7894443B2 (en) | Radio link control unacknowledged mode header optimization | |
| JP3811678B2 (ja) | 移動通信システムにおける無線リンクプロトコルによるデータ送受信装置及び方法 | |
| AU2008350292B2 (en) | Methods and apparatus for formatting headers in a communication frame | |
| JP4917750B2 (ja) | フレーム集約 | |
| EP2923514B1 (fr) | Procédé et système d'amélioration d'efficacité de liaison sans fil | |
| EP2009833B1 (fr) | Procédé et appareil associé de configuration d'un ensemble d'en-têtes "Header Extension type field (HE)" dans un système de communication sans fil fonctionnant en RLC "acknowledged mode" | |
| US7936735B2 (en) | Radio communication apparatus and transmission method | |
| JP5329581B2 (ja) | 無線通信端末および無線通信方法 | |
| US20050286561A1 (en) | Apparatus and method for exchanging variable-length data according to radio link protocol in mobile communication system | |
| JP2008509622A (ja) | Ackフレーム伝送方法及び装置 | |
| JP6322667B2 (ja) | シングルビットのセグメンテーションのインジケータ | |
| WO2008041296A1 (fr) | Appareil de communication sans fil | |
| EP3490182B1 (fr) | Procédé et système de demande de répétition automatique hybride | |
| EP3790213B1 (fr) | Demande de répétition automatique hybride basée sur mac (harq) | |
| CN101695018A (zh) | 在使用共同的混合自动请求重发过程的情况下在无线通信系统中数据包的传输 | |
| WO2005083951A1 (fr) | Appareil de communication, procede de communication, programme de communication, et support d'enregistrement ayant un programme de communication enregistré | |
| JP2006352897A (ja) | 通信装置、通信方法、および通信システム | |
| KR100631742B1 (ko) | Ack 프레임 전송 방법 및 장치 | |
| WO2008041295A1 (fr) | Appareil de communication sans fil | |
| JP6373319B2 (ja) | 無線通信端末 | |
| JP5634572B2 (ja) | 無線通信端末 | |
| WO2018203180A1 (fr) | Procédé et appareil de transfert de paquets agrégés | |
| JP2015006008A (ja) | 無線通信端末 | |
| CN119698921A (zh) | 提高资源效率的方法 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 06810928 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 06810928 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: JP |