MX2008008747A - A flexible segmentation scheme for communication systems - Google Patents

Abstract

Methods, computer program products, electronic devices and information blocks are provided that improve both efficiency of transmission and efficiency of segmentation by enabling an intelligent transport block size determination and a flexible segmentation scheme suitable for utilization with retransmission. One exemplary method involves steps of:determining a size of a transport block based on criteria including a size of at least one data block to be transmitted, wherein the transport block size is determined such that the transport block will include at least one segment of a data block of the at least one data block;segmenting the data block of the at least one data block into a plurality of segments including the at least one segment;and populating the transport block with at least the at least one segment.

Description

A FLEXIBLE SEGMENTATION SCHEME FOR COMMUNICATION SYSTEMS TECHNICAL FIELD OF THE INVENTION The exemplary and non-restrictive embodiments of this invention refer generally to wireless communication systems and, more specifically, refer to segmentation schemes.

BACKGROUND OF THE INVENTION The following abbreviations are defined herein: 3G Third Generation Mobile Network AR Access Router ARQ automatic repetition request BS Base station (also referred to as Node B) E-UTRAN Evolved Universal Earth Radio Access Access Network HSDPA Downlink Packet Access at High Speed IP Internet Protocol Ll Layer 1 (Physical Layer) L2 Layer 2 (MAC Layer) LCID Logical Channel Identity MAC Medium Access Control Layer (L2) PHY Physical layer (Ll) PDU data unit QoS protocol quality of service RNC radio network controller SDU service data unit SSN service data unit sequence number (SDU) TB transport block TCP transmission control protocol UDP user datagram protocol UE user equipment UL UTRA uplink Universal Terrestrial Radio Access Network VoIP voice over Internet protocol WCDMA Broadband Code Division Multiple Access WLAN wireless local area network In the E-UTRAN, the flows of the application with different QoS requirements have service in the wireless path by different logical channels in the MAC protocol layer. MAC SDUs, which are upper layer packets such as IP packets, are queued in the priority queues, which are arranged for the channels logical The amount of data to be transmitted for each logical channel is determined for each radio frame transmission, trying to meet the QoS requirements of each IP traffic flow. Then, for each UE, the MAC multiplexes (concatenates) the programmed data from the priority queues in a TB. In this process, MAC may need to segment MAC SDUs to make it fit into the TB. After activating the TBs from the MAC, the PHY multiplexes the TBs from different UEs in a radio frame. In prior art cellular systems (eg, 3G), the SDUs are segmented and concatenated to the constant size PDUs, which are defined by the transport channel. This adds segmentation and multiplexing overhead. The reason is that the transmission capacity of a radio link varies with time and small payloads are often available. Thus, the constant-sized PDU typically needs to be small. A small PDU fits perfectly with the small classification channels, but will cause a lot of overhead when segmenting large SDUs in the small PDUs. On the other hand, many small PDUs need to be created for high-speed channels, which will cause multiplexing overhead. Optimally, the size of the PDU would be modified, depending on the capacities of the transport channel and its temporal conditions. However, the modification of the size of the PDU, in 3G, requires a procedure used between units of the same level and resegmentation. Therefore, this is typically not preferred. In prior art wireless systems (e.g., WLAN), the SDUs are transmitted as complete packets. Multiple access is based on detection of random access / uplink collision and downlink programming. In this way, once a transmission resource is indicated for a given user, it is allowed to use the full bandwidth for a short period of time, as required for the transmission of the full available SDU. In such a way, there is less segmentation and multiplexing overload. However, large gains expected by the multiplexing of multiple users will not be available. The problems of these prior art segmentation schemes are even more evident in the latest wireless and cellular systems, where the available bandwidth is large, the bandwidth flexibility is large and the symbol speed is high. , but the radioelectric conditions imposed by the dependent characteristics of the receiver vary and dependent on the time / frequency in the transmission of each radio link. On the other hand, for any receiver, the gains available for the frequency programming, gains available for exploitation of the frequency diversity present in the channel and the gains available for the selection of adaptive transmission bandwidth are significant. Furthermore, the gains for multiple users, which are made by assigning independent radio links efficiently in time and frequency, are also significant. In this way, the segmentation scheme should be flexible and efficient to allow the use of any of these types of transmission techniques. None of the aforementioned prior art schemes, ie a trivial segmentation scheme and one of fixed PDU size, can efficiently meet these contradictory requireme In such conditions, complete SDU transmissions are feasible and are generally preferred for low overload. However, segmentation may still be necessary for large SDUs to be received in difficult radio links with low bit rate. In conventional segmentation procedures for CDMA and HSDPA, segmentation is done before the size of a TB is decided. Therefore, the system it can only transmit segmeof fixed size or at least ready to be used and in this way it has to concatenate segmeto fill the TB efficiently. This increases the number of headings and complicates the procedure when trying to compare the segmeto the TB queue. In another segmentation scheme of the prior art, retransmissions of SDU using the SSN are employed. However, the complete retransmission of SDU is generally inefficient and can lead to problems in radio link conditions of low bit rate. Efficiency also depends on the kind of traffic and the size distribution of the data. If the application generates large segmeof TCP / UDP in the IP packets and the bandwidth of the system is narrow, an SDU must be segmented into many small segme For example, the maximum transmission unit (MTU) or the maximum segment size (MSS) for an IP packet over Ethernet is typically 1500 bytes, and a subframe over a 1.25 MHz system with coding rate 1/2 and Quadrature Phase Displacement Modulation (QPSK) only has approximately 450 bits of information. This means that, for this system, an SDU will be segmented into 28 segme thereby increasing the error probability of the SDU. A large SDU in such system would probably be retransmitted one or several times. Not only will the performance of the radio link be significantly reduced, but, in addition, the performance of the cell will be reduced since retransmissions are typically prioritized.

SUMMARY OF THE INVENTION In an exemplary aspect of the invention, a method is provided. The method includes: determining a size of a transport block based on criteria including a size of at least one block of data to be transmitted, wherein the size of the transport block is determined in such a way that the block of transport will include at least one segment of one of the data blocks; segmenting that data block into a plurality of segmethat include the segment or segeme and populate the transport block with the segment (s). In another exemplary aspect of the invention, a computer program product is provided. The computer program product includes program instructions exemplified in a tangible, computer readable medium. The execution of program instructions results in operations that include: determining a size of a transport block based on criteria that include a size of at least one block of data to be transmitted, wherein the size of the transport block is determined in such a way that the transport block will include at least one segment of a data block of at least one data block; segmenting the data block of the data block (s) into a plurality of segments that includes at least one segment; and populate the transport block with at least one segment. In a further exemplary aspect of the invention, another method is provided. The method includes: segmenting a data block into a plurality of segments, wherein each segment of the plurality of segments has a data block identifier, a length value and a compensation value, wherein the data block identifier has an identification of the segmented data block, where the length value has the length of the segment, where the compensation value has the segment limit compared to the segmented data block, where the segmented data block is going to transport by a plurality of transport blocks; populate a transport block of the plurality of transport blocks with at least one segment of the plurality of segments; and in response to receiving a retransmission notice indicate a segment of the plurality of segments, retransmit the indicated segment, wherein the retransmission notice includes the block identifier of data, the length value and the compensation value of the indicated segment. In another exemplary aspect, a computer program product is provided. The computer program product includes program instructions, exemplified in a tangible, computer readable medium. Execution of the program instructions results in operations that include: segmenting a data block into a plurality of segments, wherein each segment of the plurality of segments has a data block identifier, a length value and a value of compensation, wherein the data block identifier has an identification of the segmented data block, where the length value has the length of the segment, wherein the compensation value has the limit of the segment compared to the segmented data block, wherein the segmented data block is to be transported by a plurality of transport blocks; populate a transport block of the plurality of transport blocks with at least one segment of the plurality of segments; and in response to receiving a retransmission notice indicate a segment of the plurality of segments, retransmit the indicated segment, wherein the retransmission notice includes the data block identifier, the length value and the compensation value of the indicated segment. In a further exemplary aspect of the invention, an electronic device is provided. The electronic device includes: a memory configured to store at least one block of data that is to be transmitted by a transport block; and a data processor coupled to the memory, wherein the data processor is configured to perform the operations including: determining a transport block size based on the criteria including a data block size of the block (s) data, wherein the transport block size is determined such that the transport block will include at least one segment of the data block to segment the data block into a plurality of segments that include the segment or segements; and populating the transport block with the segment (s) and the complete data block (s). In another exemplary aspect of the invention, an information block is provided. The information block is to be transmitted from a first node to a second node and stored in a tangible computer-readable medium before transmission. The information block includes: a portion of a data block, where the portion of the data block does not include the entire block of data; a data block identifier that it has an identification of the data block; a length value having a size of the portion of the data block; and a compensation value having a limit of the portion of the data block compared to the complete data block. In a further exemplary aspect of the invention, an electronic device is provided. The electronic device includes: a data processor; and a transmitter coupled to the data processor. The transmitter is configured to transmit a retransmission warning indicating a segment of a plurality of segments. The retransmission notice includes a request for retransmission of the indicated segment. The plurality of segments includes a segmented block of data. The retransmission notice has a data block identifier, a length value and a compensation value of the indicated segment. The data block identifier has an identification of the segmented data block. The length value has a segment length indicated. The compensation value has a limit of the indicated segment compared to the segmented data block.

BRIEF DESCRIPTION OF THE DRAWINGS; The above and other aspects of modalities of this invention become more evident in the next Detailed Description, when read in conjunction with the Figures of the accompanying drawings, wherein: Figure 1A shows a simplified block diagram of various electronic devices, as they are connected to a wireless network, which are suitable for use in practicing the exemplary embodiments of this invention; Figure IB shows a simplified block diagram of various electronic devices, as they are connected to a base station that is itself connected to a network with one or more access routers, which are suitable for use in the practice of exemplary modes of this invention; Figure 2 illustrates an exemplary structure of segments of a segment as employed by the exemplary embodiments of this invention; Figure 3 describes the data flow to practice an exemplary embodiment of this invention; Figure 4 shows a detailed message signaling the diagram for the downlink data transmission procedures of an exemplary embodiment of this invention; Figure 5 shows a detailed message that indicates the diagram for transmission procedures uplink data of an exemplary embodiment of this invention; Figure 6 illustrates a detailed message signaling the diagram for the uplink data transmission procedures of an exemplary embodiment of this invention at a longer time scale than Figure 5; Figure 7 illustrates a detailed message signaling the diagram for the uplink data transmission procedures of another exemplary embodiment of this invention at a longer time scale than Figure 5; Figures 8A and 8B, referred to jointly as Figure 8, represent an exemplary embodiment of the invention with a vector transmission configured by logical channel; Figure 9 shows a message sequence diagram for an exemplary embodiment of the invention using the LCIDs and SDUs of Figure 8; Figures 10A-10D, referred to jointly as Figure 10, illustrate an exemplary embodiment of the invention, wherein an SDU is segmented based on a given TB size; Figures 11A-11C, referred to together as Figure 11, illustrate an additional implementation of the exemplary embodiment of Figure 10, wherein the SDU is further segmented based on another determined TB size; Figure 12 depicts a flow chart illustrating a non-restrictive example of a method for practicing exemplary embodiments of this invention; and Figure 13 describes a flow diagram illustrating another non-restrictive example of a method for practicing exemplary embodiments of this invention.

DETAILED DESCRIPTION OF THE INVENTION Exemplary embodiments of the invention improve both transmission efficiency and segmentation efficiency by providing an intelligent TB size determination method and a flexible segmentation scheme for retransmission. The description focuses on downlink transmission and is primarily for the BSs, although these serve as non-restrictive exemplary embodiments of the invention. Additional, non-restrictive exemplary embodiments of the invention include respective applications of the method for an UE and UL transmission. In exemplary downlink transmission, the functionality of the receiver is in the UE. In the exemplary uplink transmission, the functionality of the receiver is in the BS. Note that this invention can be applied to any protocol layer that has segmentation and retransmission functionalities. As a non-restrictive example, it can be applied to the L1 / L2 interface for E-UTRAN. First, reference is made to Figure 1A to illustrate a simplified block diagram of various electronic devices that are suitable for use in practicing the exemplary embodiments of this invention. In Figure 1A, a wireless network (1) is adapted for communication with a UE (10) via a Node B (base station) (12). The network (1) may include an RNC (14), which may be referred to as a service RNC (SRNC). The UE (10) includes a data processor (DP) (10A), a memory (MEM) (10B) that stores a program (PROG) (10C), and a suitable RF transceiver (10D) (which has a transmitter). (TX) and a receiver (RX)) for bidirectional wireless communications with Node B (12), which also includes a DP (12A), a MEM (12B) that stores a PROG (12C), and an RF transceiver ( 12D) adequate. The Node B (12) is coupled via a data path (13) (Iub) to the RNC (14) which also includes a DP (14A) and a MEM (14B) which stores an associated PROG (14C). The RNC (14) may be coupled to another RNC (not shown) by another data path (15) (Iur). It is assumed that less one of the PROG (10C), (12C) and (14C) includes program instructions that, when executed by the associated DP, make it possible for the electronic device to operate in accordance with the exemplary embodiments of this invention, as will be discussed right away in more detail. Figure IB shows a simplified block diagram of various electronic devices that are suitable for use in practicing the exemplary embodiments of this invention. As in Figure 1A, Figure IB describes a wireless network adapted for communication with a UE (10) via a Node B (base station) (12). The UE (10) includes a data processor (DP) (10A), a memory (MEM) (10B) that stores a PROG program (10C), and a suitable RF transceiver (10D) (which has a transmitter ( TX) and a receiver (RX)) for bidirectional wireless communications with the Node B (12), which also includes a DP (12A), a memory (12B) that stores a PROG (12C), and an RF transceiver (12D) ) suitable. The Node B (12) is coupled via a data path (16) to a network (17). The network (17) contains one or more access routers (AR) (17A), (17B) and (17C) to facilitate connection with the Node B (12). It is assumed that at least one of the PROG (10C) and (12C) includes program instructions that, when executed by the associated DP, make it possible for the electronic device to operate from I according to the exemplary embodiments of this invention, as will be discussed below in greater detail. In general, the various modes of the UE (10) may include, without restriction, cell phones, personal digital assistants (PDAs) having wireless communication capabilities, laptops having wireless communication capabilities, image capture devices such as cameras digital that have wireless communication capabilities, gaming devices that have wireless communication capabilities, music playback and storage devices that have wireless communication capabilities, Internet devices that allow wireless access and wireless Internet search, as well as portable units or terminals that incorporate combinations of such functions. The embodiments of this invention can be implemented by computer software executable by the DP (10A) or the UE (10) and other DPs such as the DP (12A), or by hardware, or by a combination of software and hardware. The MEM (10B), (12B) and (14B) can be of any type suitable for the local technical environment and can be implemented using any suitable data storage technology, such as semiconductor-based memory devices, devices and magnetic memory systems, devices and systems for optical memory, fixed memory and removable memory. The DPs (10A), (12A) and (14A) may be of any type suitable for the local technical environment, and may include one or more general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSP). , processors based on a multi-core processor architecture, and Application Specific Integrated Circuits (ASIC), as non-restrictive examples. Exemplary embodiments of this invention provide a TB size determination method that takes into account SDU limits, and a flexible segmentation scheme that allows the retransmission of flexible segments. According to exemplary embodiments of the invention, the TB size is determined taking into account the SDU limits and the segmentation is made after the TB size has been determined. Given a TB size and SDU limits, the MAC segments the MAC SDUs to fit in the TB considering the MAC SDU limit. For example, if the MAC SDU is very small, such as for a VoIP packet, the MAC does not segment the SDU at all. Another non-restrictive example of a small MAC SDU is a confirmation of TCP. Also, if the remaining part of the SDU is very small, additional segmentation is avoided, if it is possible. As many complete non-segmented SDUs as possible are transmitted for each TB. In the rest of the TB, that is, the portion that can not be filled by complete SDUs, a sequence of bytes (segments of variable length of SDUs) is inserted to fill the TB. Note that the headers, as well as the overhead of the payload, can be subtracted from the size of the variable length SDU by filling the TB exactly. In relation to the retransmission technique, the exemplary embodiments of this invention provide a segment structure that uses compensation and length fields. "Compensation" and "length" refer to the initial position of the segment in the original SDU and the segment length (for example, in byte resolution), respectively. The receiver is configured to maintain a receiver window for the complete SDUs having a designated compensation and length for the segments of partially transmitted SDUs. The receiver window indicates which SDUs are missing, which SDUs have been fully received, which SDUs have been partially received, and which or which parts of the SDUs are missing. Partially received SDUs may have one or more missing segments. However, once a last segment is received correctly, the receiver is enabled to track between which Offsets are losing data. In fact, the receiver does not need to know if the transmitter originally tried to transmit the missing part in one or more segments. When an ARQ status report is generated, the receiver calculates the missing data among the compensations received for any partially received SDU. In this way, the retransmission request indicates with respect to a portion of (compensation (early) + length) for (subsequent) compensation, which is announced as a retransmission request; compensation = compensation (early + length) and length = compensation (posterior) (compensation (early) + length). After the transmitter receives an ARQ status report or negative acknowledgments (NACK), it retransmits the missing data for the missing complete SDUs requested and for the partially missing SDUs requested. The transmitter may decide to retransmit the entire SDU or only the missing segments. By employing the segmentation scheme of the invention, the retransmission of the missing segments is not linked to the original segment sizes and the transmitter can attach them to the TB transmission either in larger numbers of smaller segments or in more numbers small of larger segments, compared to the original transmission. This choice may also depend on the size of B, which is determined in time based on the programming of the frame (programming of multiple users) and priorities of the logical channel. As a non-restrictive example, a method which can be used in conjunction with the exemplary embodiments of the invention, comprises using the segment sequence number to indicate the renumbering of the segments (i.e., the compensation value). Generally, using the segment sequence number for the retransmission requests independently of the aspects of the exemplary embodiments of the invention is not preferred since the size of the segment may change, depending on the conditions of the radio link and its retransmission by number Segment sequence would require resegmentation and renumbering. However, in this case, the segment sequence number (of the resegmented segment having a renumbered segment sequence number) can be used in conjunction with aspects of the exemplary embodiments of the invention, for example, using the sequence number of segment as the compensation value comprising a limit of the indicated segment. For a retransmission that requires a large SDU, the transmitter can simply segment the missing parts of the large SDU and try to transmit them. again, potentially as a sequence of smaller segments. (Note that resegmentation is not necessary since full non-segmented SDUs reside in the priority queues contrary to the prior art). Such smaller segments would consume marginal capacity of the subframe and cell performance would be maintained by the other radio links served, even if the performance of that specific radio link seems to fall. In addition, it is possible to apply more robust transport formats (low-order modulation, low-rate channel code, increased diversity mode) to smaller segments compared to the transport format selection for larger segments or SDUs complete. Note that a retransmission without adapting to smaller segments or a more robust transport format is also feasible and is within the scope of exemplary embodiments of this invention. When determining the TB size for each radio link (UE) in a given subframe case, the limits of the SDU must be taken into account in addition to other factors such as the expected channel conditions of the radio links, the amount of data to be transmitted from each of the priority queues of the logical channels and the priority of the UEs, as non-restrictive examples. The amount of data to be transmitted can be any amount from the guaranteed minimum data to all the available data in the queues. This is made possible due to the important degree of freedom that the programmer and allocation functions have, either to program fewer UEs per subframe with higher payloads less frequently or to program more UEs per subframe with lower payloads more frequently. These choices lead to different transmission gain factors and different amounts of segmentation and multiplexing overload. In exemplary embodiments of the invention, two methods, identified here as (A) and (B), may be employed when requesting data transmission. (A) The amount of data to be transmitted is provided for each traffic flow (priority queue) and the. limits of the MAC SDU more similar to these values. Subsequently, the TB size allocated for each UE is determined using all available information, so that the block size contains the SDUs with minimal or no segmentation. (B) The amount of data to be transmitted from each traffic flow (priority queue), here referred to as the amount of data aligned by SDU, is calculated based on the programming decision and is aligned to the limits of the SDU as much as possible. When requesting data transmission, the amount of aligned SDU data is provided. Using any method, given the information, the block size is determined so that segmentation is avoided as much as possible. However, this is only a guide and the size of the block or the size of the requested data does not always need to be aligned with the limits of the SDU if, for example, the discrepancy is large. For the method (A) above, a vector is provided comprising the minimum amount of data to be transmitted and the MAC SDU limits more similar to the minimum quantity (the elements of which correspond to the traffic flows) using the interface. Other parameters can also be provided, such as priority using the interface. For method (B) above, a vector of aligned data quantities of SDU is provided (the elements of which correspond to the traffic flows). Other parameters, such as priority, can also be provided using the interface. Given a TB size, segmentation is performed, when necessary, to package the SDUs in the TB. Each segment comprises the sequence number of SDU, length and partial SDUs, where the partial SDUs additionally include the compensation of segments within a complete SDU. As indicated above, the "compensation" indicates the initial position of the segment in the original SDU and the "length" indicates the length of the segment, which may be in byte resolution. Figure 2 illustrates an exemplary structure of segments of a segment (20). The segment (20) contains a segment header (21) and a payload (26). The segment header (21) comprises the SDU sequence number (SSN) (22), the segment length value (23), the compensation value (24) (optional) and other fields in the segment header ( OF) (25), if necessary. The payload (26) contains information from the SDU. When the retransmission is necessary, the receiver can request the retransmission of a missing SDU indicating the SSN. The receiver can request the retransmission of a missing part of an SDU indicating the SSN, the compensation and the length of the missing part.

These retransmission requests are signaled in an ARQ status report. When retransmission is requested and the given new TB size can not be accommodated to the size of the original segment, the transmitter can carry out the segmentation, in any size, using the fields of length and compensation. Figure 3 describes the data flow. Starting from the logical channel queues (30), (34), the MAC SDUs are segmented if necessary, (31), (35), and multiplexed (concatenated) (32), (36) into a block of transport (33), (37) for each UE. Then, the TBs (33), (37) are multiplexed (38) within a physical radio frame (40), they are sent through the Ll (39). As illustrated in the Figure for TB-n (37), TBs (33), (37) comprise a header with a combination of one or more SDUs, indicated in the Figure as SDU1 and SDU2, and / or a segment. The radio frame (40) comprises a header with one or several multiplexed TBs, indicated in the Figure by TB-1 and TB-n. Figures 4 and 5 illustrate detailed message signaling diagrams for the downlink and uplink data transmission procedures, respectively. Depending on the programming (for example, in the MAC layer), the amount of data to be transmitted is determined for each logical channel of each UE. Next, the MAC provides vector information for the amount of data (which may be option (A) or (B) as indicated above), each element of which corresponds to each logical channel. In this vector information, the limits of the SDU are taken into account.

Then, the allocation unit (for example, in PHY) determines the size of TB using the given information comprising the amount of data and the conditions of the radio link, among other factors, and returns the TB size information to the MAC layer for each of the active radio links . Given the size of TB, MAC initiates the segmentation taking into account the SDU limits. The segment structure may be as shown in Figure 2. Retransmission (in the MAC layer) may use flexible segment size according to the invention. For the above signaling procedure, the primitives are defined as follows in table 1.

Table 1 Figures 6 and 7 illustrate two different candidate message signaling diagrams for uplink data transmission procedures, shown at a longer time scale than Figure 5. In order to perform the uplink packet programming in BS as shown in Figure 5, the UE informs the BS of an amount of uplink data to be scheduled in the next uplink programming period. In these candidate examples, the uplink programming period is set to be several radio frames. For this uplink data indication from the UE to the BS, the RRC message (e.g., a Capacity Request Message) and MAC control PDU (e.g., an Uplink Buffer Status Report) are used. in Figures 6 and 7, respectively. Any of them can be used in the exemplary embodiments of this invention. Figure 8 shows an overview of the flexible segmentation method, which includes retransmissions. This Figure shows the invention with a vector transmission configured for logical channel. "KSx, y" and "LSy, y" denote the y-th segment of the logical channel K-th of number x of SDU and the y-th segment of the logical channel L-th of the number x of SDU, respectively.

For different logical channels K and L, the SDU limits are taken into account. For retransmission, the use of compensation and length makes the segment sizes fully flexible. The method used favors the transmission of complete SDUs, but also allows segmentation of SDUs in any aligned byte size, which is decided at the time of transmission. In this way, for any retransmission, the size of the segment can be freely changed. An ARQ status report is included, which, in addition to a total SDU error bit mapping, can list the compensation and length of the missing segments of the partially received SDUs. In Figure 8, five TBs are described, numbered from 1 to 5 (ie, TB1 to TB5). Of the five TBs, TB2 and TB3 are not received. Here, LSI, 2 and LSI, 3 (also referred to as LSI, 23) are retransmitted in TB5 in accordance with the exemplary embodiments of this invention. Figure 9 is a message sequence diagram based on LCIDs, SDUs and TBs of Figure 8. The transmitter (TX) and receiver (RX) windows are shown with their respective contents as the transmission progresses. According to the exemplary embodiments of the invention, the receiver initially fails to receive LSI, 2 and LSI, 3 of the partial SDUs, which are subsequently retransmit in TB5 as LSI, 23. As stated above, the request for retransmission of LSI, 23 of SDUs may comprise an ARQ status report or a NACK, as non-restrictive examples. Figure 10 illustrates an exemplary embodiment of the invention, wherein an SDU is segmented based on a given TB size. In Figure 10 (A), three SDUs, SDU0 (62), SOO1 (64) and SDU2 (66) are shown, each having a length L0, Lx and L2, respectively. As indicated, L0 = 100 bytes, Lj = 400 bytes and L2 = 300 bytes. The three SDUs (62), (64), (66) of Figure 10 (A) are to be transmitted. In Figure 10 (B), the length (LTB1) of a TBj (68) is determined based on the criteria including sizes L0, L17 L2 of the SDUs (62), (64), (66). As a non-restrictive example of this process, the following is considered. It is desirable to transmit at least one complete SDU. Thus, the size of the TB of preference should not be less than 100 bytes (ie, the TB of preference should have the ability to maintain at least the SDU, SDU0 (62) smaller). However, due to the programming and logical channel priorities, this communication link and the SDUs, for this particular time and formation of a TB, have been assigned 200 bytes (TBX length LTB1 = 200 bytes). Although in Figure 10 (B) it is shown for illustrative purposes, the Bj (68) has not really been created yet (for example, populated). Since it is desirable to transmit complete SDUs when possible, the TBX (68) will comprise SDU0 (62). In this way, the length value of 100 bytes will be filled, possibly by one or more segments of other SDUs, SOO1 (64) and / or SDU2 (66). In Figure 10 (C), based on the transmission preference established above, at least one complete SDU and others based on the length of ?? 1 given LTB1, an SDU, here the SD ^ (64), is segmented into a plurality of segments, segment 1-1 (S ^) (70) and segment 1-R (S ^ R) (72), each having a respective length of 100 bytes (L ^) and 300 bytes (L ^) . The SDUX (64) is deliberately segmented to produce S ^ (70) which has a length of L ^ of 100 bytes so that S1.1 (70) is of a suitable size to fill an available portion of the TBi (68), the portion available is the remaining portion of the TBX (68) after it has been populated with the SDU0 (62). The remaining portion of the SDU: (64), specifically the S ^, (72), can be transmitted, either totally or in part, in another TB. (See Figure 11 and analysis of it later). In Figure 10 (D), TBj ^ (68) is populated with SDU0 (62) and S1.1 (70). The TB! (68) then you can transmit using the method and components described above in Figure 3, as a non-restrictive example. As is evident, the LTB1 size of TI ^ (68) is determined adequately by considering the lengths L0, L1; L2 of the SDUs (62), (64), (66). In addition, the allocated size (200 bytes) of TB1 (68) is used efficiently to make it possible to segment an SDU (that is, SO31 (64)). Figure 11 illustrates a further implementation of the exemplary embodiment of Figure 10 wherein the SD ^ (64) is further segmented based on another determined TB size. In Figure 11, a second TB (TB2) (78) is configured and populated using the remaining SDUs (64), (66) or portions thereof of Figure 10 (A). The TB2 (78) is subsequent to the transmission of the 1 (68) described in Figure 10. In Figure 11 (A), the length (LTB2) of the TB2 (78) is determined based on criteria including the sizes LI-R, L2 of the SDUs (or partial SDUs, that is, segments) SI-R (72) and SDU2 (66) that are still missing. As a non-restrictive additional example of this process, consider the following. It is desirable to transmit at least one complete SDU if there is any remnant. In this way, the size of the TB of preference should not be less than 300 bytes (ie, the TB should preferably have the ability to keep at least the smallest remaining SDU, SDU2 (66)). Due to the programming and the priorities of the logical channel that have changed from the configuration and population of the first TB, TB1 (68), to this communication and data link, for this particular time and formation of a TB, 500 have been assigned bytes (length of TB2 LTB2 = 500 bytes). Although in Figure 11 (A) is shown for illustrative purposes, TB2 (78) has not really been created (eg, populated) yet. Since it is desirable to transmit complete SDUs when possible, TB2 (78) will comprise SDU2 (66). Thus, the value of 200 bytes in length remains to be filled, possibly by one or several segments of other SDUs (for example, a segment of S ^ R (72)). In Figure 11 (B), based on the transmission preference established above, at least one complete SDU and also based on the determined length of TB2, LTB2 a remaining portion of the SDU17 SX.R (72), becomes to segment in a plurality of segments, segment 1-23 (S ^^) (80) and segment 1-4 (S1-4) (82), each having a respective length of 200 bytes (L ^ j) and 100 bytes (L ^ J. The rest of the SDUs, (64), S1.R (72), is deliberately segmented to produce S1-23 (80) which has a length ^ .23 of 200 bytes in such a way that S1_23 (80) is of an adequate size to fill an available portion of TB2 (78), the available portion is the remaining portion of TB2 (78) after it has been populated with SDU2 (66). The remaining portion of SOO1 (64) that has not been assigned to a TB, specifically S ^^ (82), can be transmitted, in whole or in part, in another TB. In Figure 11 (C), TB2 (78) is populated with SDU2 (66) and S ^^ (80). TB2 (78) can then be transmitted using the method and components described above in Figure 3, as a non-restrictive example. As is evident, the size LTB2 of TB2 (78) is suitably determined by considering the lengths L ^ and L2 of the remaining portions of the SDUs (S1-R (72)) and SDUs (SDU2 (66)). In addition, the allocated size (500 bytes) of TB2 (78) is efficiently used to enable additional segmentation of a remaining portion of an SDU (i.e., the remaining portion of the SDU: (64), (72)) . Although the exemplary SDUs and TBs of the Figures and 11 are described with respect to their respective lengths, any indication of suitable size can be used. In addition, any suitable measurement scale and / or unit can be used. Although the TBs of Figures 10 and 11 are shown comprising only SDUs or portions thereof, the TBs usually comprise portions other than SDU, additional, such as portions used for signaling or identification purposes, as non-restrictive examples. The exemplary modalities described in Figures 10 and 11 can also be used in conjunction with retransmission, if retransmission is necessary. Each segment transmitted would include an SSN, a length and a compensation. If it was indicated that a segment should be retransmitted, the segment would be identifiable by its SSN, length and compensation. Thus, only that specific portion of the SDU (i.e., the portion comprising the identified segment) would have to be retransmitted. In such a way, the complete retransmission of a complete SDU is unnecessary, unless a TB has been populated with the complete SDU in question. An additional example is provided, no. restrictive, of an exemplary electronic device, suitable for use in conjunction with aspect of the exemplary embodiments of the invention. The electronic device comprises: a data processor; and a transmitter coupled to the data processor. The transmitter is configured to transmit a retransmission warning indicating a segment of a plurality of segments. The retransmission notice includes a request for retransmission of the indicated segment. The plurality of segments comprises a segmented block of data. The retransmission notice comprises a data block identifier, a length value and a compensation value of the indicated segment. The identifier of the data block comprises an identification of the segmented data block. The value of the length comprises a length of the indicated segment. The compensation value comprises a limit of the indicated segment compared to the segmented data block. In other embodiments, the electronic device further comprises: a receiver coupled to the data processor. In additional embodiments, the electronic device comprises a mobile terminal. In other embodiments, the electronic device comprises a base station in an Evolved Universal Terrestrial Radioelectric Access Network (E-UTRAN) system. In other embodiments, the electronic device may comprise any other aspect or component of the exemplary embodiments of the invention, as described herein. Figure 12 depicts a flow diagram illustrating a non-restrictive example of a method for practicing exemplary embodiments of this invention. The method includes the following steps. In the frame (101), a size of a transport block is determined based on in the criteria. The criteria comprise a size of at least one block of data to be transmitted. The size of the transport block is determined in such a way that the transport block will include at least one segment of the data block (s). In the box (102), that data block is segmented into a plurality of segments comprising the segment or segments. In the frame (103), the transport block is populated that segment or segments. In other embodiments, the method further comprises transmitting the populated transport block. In additional modalities, the criterion further comprises multi-user programming and / or logical channel priorities. In other embodiments, the criterion further comprises at least one of: expected channel conditions of a plurality of radio links, a quantity of data to be transmitted from each priority queue and a priority value of each terminal that is assigned to a logical channel. In further embodiments, each segment of the plurality of segments comprises a data block identifier a length value and a compensation value, wherein the data block identifier comprises an identification of the segmented block of data, wherein the value of length comprises a segment length, wherein the compensation value comprises a segment boundary as compared to the segmented data block.

In other embodiments, the method further comprises: in response to receiving a retransmission notice, indicating a segment of the plurality of segments, retransmitting the segment, wherein the retransmission announcement comprises the data block identifier, the value of length and the compensation value of the indicated segment. In further embodiments, determining the size of the transport block comprises calculating an amount of data to be transmitted for each priority queue based on a programming decision, wherein the retransmission announcement comprises the amount of data that is going to transmit for each priority queue. In other embodiments, determining the size of the transport block comprises providing a quantity of data to be transmitted for each priority queue and a size of at least one neighboring data block, wherein the neighboring data block or blocks comprise at least one data block having a size relatively similar to the amount of data to be transmitted for each priority queue, wherein the criterion further comprises the amount of data to be transmitted for each priority queue and the size of the neighboring data block (s), where the size of the transport block is determined in such a way that the block Transport includes one of: complete data blocks, data blocks with minimal segmentation or a combination of complete data blocks with minimum segmentation. In further embodiments, the provision of the amount of data to be transmitted for each priority queue comprises providing a vector comprising a minimum amount of data to be transmitted, wherein the sizes of the neighboring data blocks comprise values relatively close to the minimum amount of data that will be transmitted. In other embodiments, the provision of the amount of data to be transmitted for each priority queue and the size of the neighboring data block (s) comprises using an interface. In further embodiments, determining the size of the transport block comprises calculating a quantity of data to be transmitted for each priority queue, based on a programming decision. In other embodiments, the amount of data to be transmitted for each priority queue comprises a value relatively close to the size of each data block of the plurality of data blocks. In further embodiments, determining the size of the transport block further comprises providing a vector of the amount of data to be transmitted for each priority queue, wherein the vector comprises elements that correspond to each priority queue. In other modalities, the method is used in conjunction with an Evolved Universal Terrestrial Radioelectric Access Network (E-UTRAN) system. Figure 13 depicts a flow diagram illustrating another non-restrictive example of a method for practicing exemplary embodiments of this invention. The method includes the following steps. In the frame (151), a data block is segmented into a plurality of segments. Each segment of the plurality of segments comprises a data block identifier, a length value and a compensation value. The identifier of the data block comprises an identification of the segmented data block. The length value comprises a length of the segment. The compensation value comprises a segment limit compared to the segmented data block. The segmented data block is to be transported by a plurality of transport blocks. In frame (152), a transport block of the plurality of transport blocks is populated with at least one segment of the plurality of segments. In the frame (153), in response to receiving a retransmission notice indicating a segment of the plurality of segments, the indicated segment is retransmitted. The retransmission notice comprises the identifier of the block of data, the length value and the compensation value of the indicated segment. In other embodiments, the method further comprises transmitting the populated transport block. In further embodiments, the retransmission notice comprises an automatic replay request status (ARQ) report. In other modalities, the retransmission notice includes a negative confirmation (NACK). In additional modalities, the retransmission of the indicated segment comprises the resegmentation of the segment indicated in smaller segments and apply at least one of the following: a low order modulation, a channel code of low data transfer rate and a diversity mode increased. The exemplary, non-restrictive methods shown in Figures 12 and 13 and described with respect to these, can be exemplified as a computer program comprising program instructions exemplified in a tangible computer readable medium, execution of program instructions that give As a result, the operations that comprise the steps of the method. The embodiments of this invention are not limited to the protocol layers Ll (PHY) and L2 (MAC), as used in the previous examples. Rather, the embodiments of this invention can be implemented to any layer of protocol, simply to carry out the segmentation efficiently for programming and resource allocation. The scheduler and allocation functions, as they relate to the segmentation process of the invention, can be included in different protocol layers having a defined interface or, alternatively, they can be included in the same protocol layer that does not have such an interface specific. In addition, the functions of the programmer and the assignment can be included in different physical or logical processing units (or parts thereof) or can be included in the same processing unit. In one embodiment of this invention, the described method can be implemented for the MAC segmentation interconnection with the programming and PHY assignment functions. Here, all the labels of PHY / MAC / RRC, signaling flows, and primitives are used as non-restrictive examples. As is clear to one skilled in the art, such labels can be replaced by descriptions of any other functional and / or relevant protocol division. As a non-restrictive example, segmentation, scheduling and mapping can occur in the same layer. Although they have been described above with respect to the limits of SDUs, the exemplary modalities of the invention can use any feature of suitable size of the SDUs, such as length, as a non-restrictive example. Further, although described above with respect to compensation from the beginning of the SDU, the compensation value may comprise any suitable value indicating the placement of the segment with respect to the entire SDU. As a non-restrictive example, the compensation value could indicate the renumbering of segments as described above. As another non-restrictive example, the compensation value could indicate the limit (ie, the end) of the segment that is closest to the back end of the SDU. In addition, although exemplary embodiments have been described with respect to SDUs, exemplary embodiments may be used in conjunction with the transport of any suitable data collection (e.g., a data block). Based on the foregoing, it should be evident that exemplary embodiments of this invention provide a computer program method, apparatus and product (s) to improve segmentation efficiency by providing an intelligent method of determining TB size and a flexible segmentation scheme for transmission. Since exemplary modalities have been described above in the context of an E-UTRAN system, it should be appreciated that the exemplary embodiments of this invention are not limited to being used only with this particular type of wireless communication system, and that they can be used to take advantage of other wireless communication systems such as high-speed packet access evolution (HSPA) of 3G, ad hoc wireless networks, cognitive radios, systems after the third generation (B3G) and fourth generation systems (4G), as non-restrictive examples. It is expected that such systems include techniques that allow versatile methods of radio adaptation such as bandwidth adaptation, adaptation to spectral conditions, adaptation of radioelectric capacity, adaptation of radio links and adaptations of transmission formats, as non-restrictive examples. In general, the various modalities can be implemented in hardware or circuits for special use, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that may be executed by a controller, microprocessor or other computing device, although the invention is not limited thereto. Since various aspects of the invention can be illustrated and describe as block diagrams, flowcharts, or using some other pictorial representation, it will be understood perfectly that these blocks, apparatuses, systems, techns or methods described herein can be implemented in, as non-restrictive examples, hardware, software, firmware , circuits or logic for special use, hardware or controller for general use or other computing devices, or some combinations thereof. The embodiments of the inventions can be practiced in various components such as integrated circuit modules. The design of integrated circuits is in a general way a highly automated process. Powerful and complex software tools are available to convert a logic level design into a semiconductor circuit design ready to be recorded and formed on a semiconductor substrate. Various modifications and adaptations may become apparent to those skilled in the relevant arts in view of the foregoing description, when read in conjunction with the accompanying drawings and in the following claims. But as some examples, the use of other similar or equivalent procedures of data streams and transmission may be attempted by those skilled in the art. However, all such and similar modifications of the teachings of this invention will still fall within the scope of this invention. In addition, some of the features of the examples of this invention can be used to exploit without the corresponding use of other features. As such, the foregoing description should be considered only as illustrative of the exemplary principles, teachings, examples and embodiments of this invention, and not as a limitation thereto.

Claims (35)

1. CLAIMS. A method comprising: determining a size of a transport block based on criteria comprising a size of at least one block of data to be transmitted, wherein the size of the transport block is determined in such a way that it will include at least one segment of a data block of said data blocks, - segmenting the data blocks of the data block (s) into a plurality of segments comprising at least one segment; and populate the transport block with at least one of the segments.
2. 2. The method according to claim 1, further comprising: transmitting the populated transport block.
3. 3. The method according to claim 1, wherein the criterion further comprises multi-user programming.
4. 4. The method according to claim 1, wherein the criterion further comprises logical channel priorities.
5. The method according to claim 1, wherein the criterion further comprises at least one of: expected channel conditions of a plurality of links radioelectric, a quantity of data to be transmitted from each priority queue and a priority value of each terminal that is assigned to a logical channel.
6. The method according to claim 1, wherein each segment of the plurality of segments comprises a data block identifier, a length value and a compensation value, wherein the data block identifier comprises a segmented block identification of data, wherein the length value comprises a segment length, wherein the compensation value comprises a segment boundary as compared to the segmented data block.
7. The method according to claim 6, further comprising: in response to receiving a retransmission notice indicating a segment of the plurality of segments, retransmitting the segment, wherein the retransmission announcement comprises the data block identifier, the length value and the compensation value of the indicated segment.
8. The method according to claim 7, wherein determining the size of the transport block comprises calculating a quantity of data to be transmitted for each priority queue based on a programming decision, wherein the notification of retransmission comprises the amount of data that will be transmitted for each priority queue.
9. The method according to claim 1, wherein determining the size of the transport block comprises providing a quantity of data to be transmitted for each priority queue and a size of at least one block of nearby data, which comprises at least one data block having a size relatively close to the amount of data to be transmitted for each priority queue, wherein the criterion further comprises the amount of data to be transmitted for each priority queue and the size of the neighboring data block (s), wherein the size of the transport block is determined in such a way that the transport block comprises one of: complete data blocks, data blocks with minimal segmentation or a combination of complete data blocks and with minimal segmentation.
10. The method according to claim 9, wherein the provision of the amount of data to be transmitted for each priority queue comprises providing a vector comprising a minimum amount of data to be transmitted, wherein the sizes of nearby data blocks comprise values relatively close to the minimum amount of data to be transmitted.
11. 11. The method according to claim 9, wherein the provision of the amount of data to be transmitted for each priority queue and the size of the neighboring data block (s) comprises using an interface.
12. The method according to claim 1, wherein determining the size of the transport block comprises calculating a quantity of data to be transmitted for each priority queue based on a programming decision.
13. 13. The method according to claim 12, wherein the amount of data to be transmitted for each priority queue comprises a value relatively close to the size of each data block of the plurality of data blocks.
14. The method according to claim 12, wherein determining the size of the transport block further comprises providing a vector of the amount of data to be transmitted for each priority queue, wherein the vector comprises elements corresponding to each Priority queue
15. 15. A computer program product comprising program instructions exemplified on a tangible computer-readable medium, execution of the program instructions that result in the operations comprising: determining a size of a transport block based on criteria comprising a size of at least one transport block to be transmitted, wherein the size of the transport block is determined in such a way that the block of transport will include at least one segment of a data block of the data block (s); segmenting the data block of the data block (s) into a plurality of segments comprising at least one segment; and populate the transport block with that segment or segments.
16. 16. The computer program product according to claim 15, the execution of the program instructions results in operations that further comprise: transmitting the populated transport block.
17. The computer program product according to claim 15, wherein each segment of the plurality of segments comprises a data block identifier, a length value and a compensation value, wherein the data block identifier comprises a data block identifier. identification of the segmented data block, wherein the length value comprises a length of the segment, wherein the compensation value comprises a limit of the segment compared to the segmented block of data.
18. 18. The computer program product according to claim 15, wherein determining the size of the transport block comprises providing a quantity of data to be transmitted for each priority queue and a size of at least one data block nearby , wherein the neighboring data block (s) comprise at least one data block having a size relatively close to the amount of data to be transmitted for each priority queue, wherein the criterion further comprises the amount of data that will be transmitted for each priority queue and the size of the neighboring data block (s), wherein the size of the transport block is determined in such a way that the transport block comprises one of: complete data blocks, data blocks with minimum segmentation or a combination of complete data blocks and with minimal segmentation.
19. 19. A method comprising: segmenting a data block into a plurality of segments, wherein each segment comprises a data block identifier, a length value and a compensation value, wherein the identifier of the data block comprises a Identification of the segmented block of data, wherein the length value comprises a length of the segment, wherein the compensation value comprises a segment boundary in comparison to the segmented data block, wherein the segmented data block is for transporting by a plurality of blocks of data. transportation; populate a transport block of the plurality of transport blocks with at least one segment of the plurality of segments; and in response to the reception of a retransmission notice, indicate a segment of the plurality of segments, retransmit the indicated segment, wherein the retransmission notice comprises the identifier of the data block, the length value and the compensation value of the indicated segment.
20. 20. The method according to claim 19, further comprising: transmitting the populated transport block.
21. The method according to claim 19, wherein the retransmission announcement comprises one of an automatic replay request status report (ARQ) or a negative acknowledgment (NACK).
22. The method according to claim 19, wherein the retransmission of the indicated segment comprises the resegmentation of the indicated segment in further segments. small and apply at least one of a low order modulation, a low data transfer channel code and an increased diversity mode.
23. 23. A computer program product comprising program instructions, exemplified in a tangible computer readable medium, execution of program instructions that result in the operations comprising: segmenting a data block into a plurality of segments, wherein each segment of the plurality of segments comprises an identifier of the data block, a length value and a compensation value, wherein the identifier of the data block comprises an identification of the segmented data block, wherein the value of length comprises a segment length, wherein the compensation value comprises a segment boundary as compared to the segmented data block, wherein the segmented data block is to be transported by a plurality of transport blocks; populate a transport block of the plurality of transport blocks with at least one segment of the plurality of segments; and in response to the reception of a retransmission notice indicate a segment, retransmit the indicated segment, wherein the retransmission notice comprises the identifier of the data block, the length value and the compensation value of the indicated segment.
24. 24. The computer program product according to claim 23, the execution of the program instructions results in operations that further comprise: transmitting the populated transport block.
25. 25. The computer program product of claim 23, wherein the retransmission announcement comprises one of an automatic replay request status report (ARQ) or a negative acknowledgment (NACK).
26. 26. An electronic device comprising: a memory configured to store at least one data block to be transmitted by a transport block; and a data processor coupled to the memory, wherein the data processor is configured to perform the operations comprising: determining a size of the transport block based on criteria comprising a size of one of the data blocks, wherein the size of the transport block is determined in such a way that the transport block will include at least one segment of the data block; segmenting the data block into a plurality of segments comprising at least one segment; and populate the transport block with that segmeto or segments.
27. 27. The electronic device according to claim 26, further comprising: a transmitter coupled to the data processor, wherein the transmitter is configured to transmit the transport block.
28. The electronic device according to claim 26, wherein each segment of the plurality of segments comprises an identifier of the data block, a length value and a compensation value, wherein the identifier of the data block comprises a block identification segmented data, wherein the length value comprises a segment length, wherein the compensation value comprises a segment boundary as compared to the segmented data block.
29. 29. The electronic device according to claim 28, wherein the data processor is further configured to carry out the operation of: in response to receiving a retransmission notice indicating a segment of the plurality of segments, retransmitting the segment, where the retransmission notice comprises the identifier of the block of data, the length value and the compensation value of the indicated segment.
30. 30. The electronic device according to claim 26, wherein the electronic device comprises an access node of a wireless communication network.
31. 31. An information block to be transmitted from a first node to a second node, the information block is stored in a tangible computer readable medium before transmission, the information block comprises: a portion of a block of information. data, wherein the portion of the data block does not comprise the entire data block an identifier of the data block comprising an identification of the data block; a length value comprising a size of the portion of the data block; and a compensation value comprising a limit of the portion of the data block compared to the complete data block.
32. 32. The information block according to claim 31, further comprising: at least one other block of complete data.
33. 33. An electronic device comprising: a data processor; and a transmitter coupled to the data processor, wherein the transmitter is configured to transmit a retransmission warning indicating a segment of a plurality of segments, wherein the retransmission announcement comprises a request for retransmission of the indicated segment, wherein the plurality of segments comprises a segmented block of data, wherein the retransmission warning comprises a data block identifier, a length value and a compensation value of the indicated segment, wherein the identifier of the data block comprises an identification of the segmented data block, wherein the length value comprises a length of the indicated segment, wherein the compensation value comprises a limit of the indicated segment compared to the segmented data block. .
34. 34. The electronic device according to claim 33, further comprising: a receiver coupled to the data processor.
35. 35. The electronic device according to claim 33, wherein the electronic device comprises a mobile terminal.