CN116318525A

CN116318525A - Data transmission method and device and communication equipment

Info

Publication number: CN116318525A
Application number: CN202111574554.9A
Authority: CN
Inventors: 李娜; 张慧敏; 赵泉; 刘光毅
Original assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Current assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Priority date: 2021-12-21
Filing date: 2021-12-21
Publication date: 2023-06-23

Abstract

The application discloses a data transmission method and device and communication equipment, wherein the method comprises the following steps: a Media Access Control (MAC) entity obtains data from at least two logic channels; the MAC entity encodes data of the at least two logical channels.

Description

Data transmission method and device and communication equipment

Technical Field

The present disclosure relates to the field of wireless communications technologies, and in particular, to a data transmission method and apparatus, and a communication device.

Background

Currently, the methods for improving the reliability of data transmission generally include: a method based on a hybrid Automatic Repeat reQuest (Hybrid Automatic Repeat reQuest, HARQ) and/or Automatic Repeat reQuest (ARQ) mechanism, a method based on a packet data convergence protocol (Packet Data Convergence Protocol, PDCP) repetition (multiplexing) mechanism. The general idea of these methods is to ensure the reliability of data reception by repeatedly transmitting the same data, but this results in waste of resources.

Disclosure of Invention

To solve the above technical problems, embodiments of the present invention provide a data transmission method, a terminal device, a network device, a chip, and a computer readable storage medium.

The data transmission method provided by the embodiment of the application comprises the following steps:

a medium access control (Media Access Control, MAC) entity obtains data from at least two logical channels;

the MAC entity encodes data of the at least two logical channels.

The data transmission device provided by the embodiment of the application is applied to an MAC entity of communication equipment, and the device comprises:

a receiving unit for acquiring data from at least two logical channels;

an encoding unit for encoding the data of the at least two logical channels;

and the transmitting unit is used for transmitting the encoded data.

The communication device provided by the embodiment of the application comprises: the processor is used for calling and running the computer program stored in the memory, and executing any one of the data transmission methods.

The chip provided by the embodiment of the application comprises: and a processor for calling and running the computer program from the memory, so that the device on which the chip is mounted performs any one of the methods described above.

The core computer readable storage medium provided in the embodiments of the present application is configured to store a computer program, where the computer program causes a computer to execute any one of the methods described above.

In the technical scheme of the embodiment of the application, the MAC entity encodes the data of at least two logical channels and transmits the encoded data, so that the 'multiple' transmission of the data is completed through the wireless resource equivalent to single transmission, and the resource utilization rate is improved while the data transmission reliability is improved.

Drawings

FIG. 1 is a schematic diagram of an application scenario according to an embodiment of the present application;

FIG. 2 is a schematic diagram of a butterfly graph transmission process;

FIG. 3 is a schematic diagram of transmitting encoded data according to an embodiment of the present application;

fig. 4 is a schematic flow chart of a data transmission method according to an embodiment of the present application;

fig. 5 is a schematic diagram of segmentation and MAC coding performed by an RLC entity provided in an embodiment of the present application;

FIG. 6 is a second schematic diagram of transmitting encoded data according to an embodiment of the present application;

fig. 7-1 is a schematic diagram of a MAC subheader provided in an embodiment of the present application;

fig. 7-2 is a schematic diagram two of a MAC subheader provided in an embodiment of the present application;

fig. 7-3 are schematic diagrams III of a MAC sub-header provided in an embodiment of the present application;

fig. 7-4 are schematic diagrams of formats of downlink MAC PDUs provided in embodiments of the present application;

fig. 7-5 are schematic diagrams of formats of uplink MAC PDUs provided in embodiments of the present application;

Fig. 8 is a schematic diagram of a flow of SDU multiplexing in a MAC PDU according to an embodiment of the present application;

fig. 9 is a schematic diagram of multiplexing data of different logical channels into MAC PDUs provided by an embodiment of the present application;

fig. 10 is a second schematic flow chart of SDU multiplexing in MAC PDU according to the embodiment of the present application;

fig. 11 is a schematic diagram of encoding a MAC SDU to be retransmitted provided in an embodiment of the present application;

fig. 12 is a schematic structural diagram of a data transmission device according to an embodiment of the present application;

fig. 13 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

fig. 14 is a schematic structural diagram of a chip of an embodiment of the present application.

Detailed Description

The following description of the technical solutions in the embodiments of the present application will be made with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.

Fig. 1 is a schematic diagram of an application scenario according to an embodiment of the present application.

As shown in fig. 1, communication system 100 may include a terminal device 110 and a network device 120. Network device 120 may communicate with terminal device 110 over the air interface. Multi-service transmission is supported between terminal device 110 and network device 120.

It should be understood that the present embodiments are illustrated by way of example only with respect to communication system 100, but the present embodiments are not limited thereto. That is, the technical solution of the embodiment of the present application may be applied to various communication systems, for example: long term evolution (Long Term Evolution, LTE) systems, LTE time division duplex (Time Division Duplex, TDD), universal mobile telecommunications system (Universal Mobile Telecommunication System, UMTS), internet of things (Internet of Things, ioT) systems, narrowband internet of things (Narrow Band Internet of Things, NB-IoT) systems, enhanced Machine-type-Type Communications (eMTC) systems, 5G communication systems (also known as New Radio (NR) communication systems), or future communication systems, etc.

In the communication system 100 shown in fig. 1, the network device 120 may be an access network device in communication with the terminal device 110. The access network device may provide communication coverage for a particular geographic area and may communicate with terminal devices 110 (e.g., UEs) located within the coverage area.

The network device 120 may be an evolved base station (Evolutional Node B, eNB or eNodeB) in a long term evolution (Long Term Evolution, LTE) system, or a next generation radio access network (Next Generation Radio Access Network, NG RAN) device, or a base station (gNB) in a NR system, or a radio controller in a cloud radio access network (Cloud Radio Access Network, CRAN), or the network device 120 may be a relay station, an access point, a vehicle device, a wearable device, a hub, a switch, a bridge, a router, or a network device in a future evolved public land mobile network (Public Land Mobile Network, PLMN), etc.

Terminal device 110 may be any terminal device including, but not limited to, a terminal device that employs a wired or wireless connection with network device 120 or other terminal devices.

For example, the terminal device 110 may refer to an access terminal, user Equipment (UE), subscriber unit, subscriber station, mobile station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or User Equipment. An access terminal may be a cellular telephone, a cordless telephone, a session initiation protocol (Session Initiation Protocol, SIP) phone, an IoT device, a satellite handset, a wireless local loop (Wireless Local Loop, WLL) station, a personal digital assistant (Personal Digital Assistant, PDA), a handset with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a 5G network or a terminal device in a future evolution network, etc.

The terminal Device 110 may be used for Device-to-Device (D2D) communication.

The wireless communication system 100 may further comprise a core network device 130 in communication with the base station, which core network device 130 may be a 5G core,5gc device, e.g. an access and mobility management function (Access and Mobility Management Function, AMF), further e.g. an authentication server function (Authentication Server Function, AUSF), further e.g. a user plane function (User Plane Function, UPF), further e.g. a session management function (Session Management Function, SMF). Optionally, the core network device 130 may also be a packet core evolution (Evolved Packet Core, EPC) device of the LTE network, for example a session management function+a data gateway (Session Management Function + Core Packet Gateway, smf+pgw-C) device of the core network. It should be appreciated that SMF+PGW-C may perform the functions performed by both SMF and PGW-C. In the network evolution process, the core network device may also call other names, or form a new network entity by dividing the functions of the core network, which is not limited in this embodiment of the present application.

Communication may also be achieved by establishing connections between various functional units in the communication system 100 through a next generation Network (NG) interface.

For example, the terminal device establishes an air interface connection with the access network device through an NR interface, and is used for transmitting user plane data and control plane signaling; the terminal equipment can establish control plane signaling connection with AMF through NG interface 1 (N1 for short); an access network device, such as a next generation radio access base station (gNB), can establish a user plane data connection with a UPF through an NG interface 3 (N3 for short); the access network equipment can establish control plane signaling connection with AMF through NG interface 2 (N2 for short); the UPF can establish control plane signaling connection with the SMF through an NG interface 4 (N4 for short); the UPF can interact user plane data with the data network through an NG interface 6 (N6 for short); the AMF may establish a control plane signaling connection with the SMF through NG interface 11 (N11 for short); the SMF may establish a control plane signaling connection with the PCF via NG interface 7 (N7 for short).

Fig. 1 exemplarily illustrates one base station, one core network device, and two terminal devices, alternatively, the wireless communication system 100 may include a plurality of base station devices and each base station may include other number of terminal devices within a coverage area, which is not limited in the embodiment of the present application.

It should be noted that fig. 1 illustrates, by way of example, a system to which the present application is applicable, and of course, the method shown in the embodiment of the present application may be applicable to other systems. Furthermore, the terms "system" and "network" are often used interchangeably herein. The term "and/or" is herein merely an association relationship describing an associated object, meaning that there may be three relationships, e.g., a and/or B, may represent: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship. It should also be understood that, in the embodiments of the present application, the "indication" may be a direct indication, an indirect indication, or an indication that there is an association relationship. For example, a indicates B, which may mean that a indicates B directly, e.g., B may be obtained by a; it may also indicate that a indicates B indirectly, e.g. a indicates C, B may be obtained by C; it may also be indicated that there is an association between a and B. It should also be understood that, in the embodiments of the present application, reference to "corresponding" may mean that there is a direct correspondence or an indirect correspondence between the two, or may mean that there is an association between the two, or may be a relationship between an instruction and an indicated, configured, or the like. It should also be understood that "predefined" or "predefined rules" mentioned in the embodiments of the present application may be implemented by pre-storing corresponding codes, tables or other manners that may be used to indicate relevant information in devices (e.g., including terminal devices and network devices), and the present application is not limited to a specific implementation thereof. Such as predefined may refer to what is defined in the protocol. It should also be understood that, in the embodiments of the present application, the "protocol" may refer to a standard protocol in the field of communications, and may include, for example, an LTE protocol, an NR protocol, and related protocols applied in future communication systems, which are not limited in this application.

In order to facilitate understanding of the technical solutions of the embodiments of the present application, the following description is given of related technologies of the embodiments of the present application, and the following related technologies may be optionally combined with the technical solutions of the embodiments of the present application as an alternative, which all belong to the protection scope of the embodiments of the present application.

With respect to network coding

Network coding techniques are applied in order to improve network throughput and to ensure link robustness. The network coding allows the intermediate node to code and forward the received information, and the network performance is improved through the integral cooperation of the network nodes.

Taking a butterfly graph as an example, S is a source node, and R1 and R2 are 2 destination nodes. If forwarding techniques are used, the transmission process is as shown in fig. 2 (a). Wherein 2 transmission paths overlap in links (3, 4), node 3 cannot transmit 2 bits (bit) data a and b in a unit time, and the theoretical capacity of the network cannot be achieved using the forwarding technique. If the network coding technology is adopted, the relay node is allowed to perform coding processing on the information, and the transmission process is shown in (b) of fig. 2. The node 3 encodes the data a and b to obtain a+b, and transmits the a+b within a unit time. Then, R1 receives a and a+b, and then decodes them to obtain b. Similarly, R2 is used to obtain bits a and b. Then, S sends 2bit information to 2 destination nodes in unit time, and the information transmission rate reaches the theoretical upper limit of network traffic.

Network coding schemes can be categorized into linear and nonlinear types

The encoding and decoding of the linear method are relatively simple and, therefore, linear methods are generally preferred. In the directed network, if a network coding problem has a solution, there is a certain linear solution, so that the effectiveness of the linear algorithm is ensured theoretically.

The linear network coding is to linearly map node transmission information into a finite field and realize the coding and decoding process by using a linear relation. Assuming that each packet is L bits long, when it is different from the packet length to be combined, the shorter information adds an extra string of 0 s, and each s consecutive bits in the packet form one symbol, and then one packet contains L/s symbols. Under linear coding, multiplication and addition are applied to make the data sent from a node a linear combination of information received by the node.

The selection of the coding vector can adopt a deterministic coding strategy and a random coding strategy

The deterministic scheme is to select the determined coding vector for the node according to the network topology, the related technology provides an iteration implementation method of the linear network coding, and the network coding is realized by analyzing the network structure, designing the corresponding local coding vector according to the number of the input and the output of the node and obtaining the global coding vector in an iteration mode. The deterministic coding scheme uses fixed coding vectors for each node, so that only information vectors need to be contained in data transmitted in the network, bandwidth is saved, and a required symbol set is smaller. However, the deterministic network coding scheme needs to know the topology structure of the whole network, and has high complexity, and in the distributed wireless communication network, the implementation difficulty is very high due to lack of centralized control. In addition, once the topology of the wireless communication network changes, the entire deterministic network coding scheme must be updated, so that the robustness to mobility support and to wireless environment changes is poor.

The related art proposes the concept of random coding due to the disadvantages of high complexity of deterministic network coding. The random coding is to make the nodes in the network randomly select coding coefficients in a completely independent distributed mode, code the input information, and send the set of random vectors as a part of the header to the receiving point, so as to facilitate decoding.

Linear network coding process

Assume that the original packet information generated by a source or sources is M ¹ ,...,M ⁿ The data transmitted in the linear network coding can be expressed as

(wherein g ₁ ,...,g _n Representing the corresponding coding coefficients), for each symbol there is: />

Wherein->

And X _k Respectively M ⁱ And the kth symbol of X. The transmitted data packet includes both the encoded vector, i.e., coefficient g= (g) ₁ ,...,g _n ) And also includes information vector->

The encoded vector is used for decoding at the receiving end.

The encoding process is performed by iterative methods, if a node has received and stored a set of packet information (g ¹ ,X ¹ )…(g ^m ,X ^m ) This node can then pass through the selected coding coefficient h ₁ ,...,h _m And apply the arithmetic formula

To obtain a new information package (g ', X '), the coding vector g ' can be obtained by direct algebraic calculation>

This process may be repeated in several nodes.

Decoding process for linear network coding

Suppose a node receives a set (g ¹ ,X ¹ )…(g ^m ,X ^m ) To recover the original information, a solution is needed

N unknowns M in M equations of (2) ⁱ And recovering all data, wherein the data requirement m is not less than n, that is, the number of the received packets is at least the number of the original information. While some linear combinations may be linearly related, m.gtoreq.n is not a sufficient condition, but an important condition for network coding.

Currently, the methods for improving the reliability of data transmission generally include: a method based on HARQ and/or ARQ mechanisms, a method based on PDCP multiplexing mechanisms, etc. The general idea of these methods is to ensure the reliability of data reception by repeatedly transmitting the same data, but this may cause resource waste, especially when the wireless channel condition is poor, and when multiple HARQ retransmissions are unsuccessful, ARQ retransmissions may continue to be enabled. For this reason, the following technical solutions of the embodiments of the present application are proposed.

In order to facilitate understanding of the technical solutions of the embodiments of the present application, the technical solutions of the present application are described in detail below through specific embodiments. The above related technologies may be optionally combined with the technical solutions of the embodiments of the present application, which all belong to the protection scope of the embodiments of the present application. Embodiments of the present application include at least some of the following.

In the technical solution of the embodiment of the present application, a radio link control (Radio Link Control, RLC) entity is responsible for segmenting a data packet into a plurality of sub-data packets with equal sizes, where the data packet carries an RLC Sequence Number (SN). The MAC entity is responsible for encoding equally sized subpackets from multiple RLC entities. Therefore, the data can be sent for multiple times through the wireless resource equivalent to single transmission, and the reliability of data transmission is improved. Compared with the traditional retransmission mechanism (such as HARQ and/or ARQ mechanism) based on feedback information, the technical scheme of the embodiment of the application adopts an advanced redundancy transmission mode similar to 'blind retransmission', reduces the feedback delay required by the retransmission mechanism based on feedback information, and improves the speed and efficiency of data transmission.

As an example, as shown in fig. 3, when the base station transmits data packets D1, D2, D3 to the UE, it additionally transmits a data packet D1D 2D 3, where the additional data packet is obtained by encoding D1, D2, and D3 by the MAC entity of the base station, so that the UE can successfully obtain all data packets by decoding D1D 2D 3 even if any one of D1, D2, and D3 is lost during the transmission. Similarly, for uplink, when the UE sends a packet U1, U2, U3 to the base station, an additional packet U1U 2U 3 is additionally sent, where the additional packet is obtained by encoding U1, U2, and U3 by the MAC entity of the UE, so that even if any one of U1, U2, and U3 is lost during the sending process, the base station can successfully obtain all the packets by decoding U1U 2U 3.

Fig. 4 is a flowchart of a data transmission method according to an embodiment of the present application, where the data transmission method is applied to a MAC entity of a communication device, as shown in fig. 4, and the data transmission method includes:

step 401: the MAC entity obtains data from at least two logical channels.

Step 402: the MAC entity encodes data of the at least two logical channels.

In the embodiment of the present application, the MAC entity is a MAC entity of the data transmitting end. Here, the data source (i.e. the communication device) may be a network device or a terminal device, wherein the network device may be, for example, a base station, and the terminal device may be, for example, a UE.

In the embodiment of the application, the MAC entity encodes data from at least two logical channels. Specifically, the MAC entity acquires data from at least two logical channels from at least two RLC entities, encodes the data of the at least two logical channels, and transmits the encoded data through a Physical (PHY) entity.

In some alternative embodiments, before the MAC entity encodes the data of the at least two logical channels, the method further comprises: for RLC entities respectively corresponding to the at least two logical channels, the MAC entity indicates to the RLC entity the number of submitted RLC protocol data units (Protocol Data Unit, PDUs) or indicates to the RLC entity the channel quality.

Here, before the MAC entity performs encoding, the MAC entity may further instruct the related RLC entity to submit a specific number of RLC PDUs or instruct the RLC entity of channel quality. Here, the related RLC entity is an RLC entity corresponding to the logical channel.

In some alternative embodiments, the MAC entity indicates to the RLC entity a status of the number of submitted RLC PDUs, the MAC entity determining the number of RLC PDUs based on at least one of: logical channel priority (Logical Channel Prioritization, LCP), uplink resource size, channel quality.

In some alternative embodiments, the MAC entity determines the number of RLC PDUs based on logical channel priority, the method further comprising:

for each of the at least two logical channels, the MAC entity performs the steps of:

step 1-1) the values of N and M are determined by the following formula: n=floor (PBR T/Tsdu) +1, m=floor (Bj/Tsdu); wherein FLOOR represents a downward rounding, PBR represents a priority bit rate of a logical channel, T represents a time interval of a last scheduling time of a current time interval (i.e., T transmission time intervals (Transmission Time Interval, TTI)), tsdu represents a size of a unit data packet, and Bj represents a number of tokens available in a token bucket corresponding to the logical channel;

Step 1-2) comparing whether Bj is larger than 0; multiplexing the data packet of the logical channel into a MAC PDU if Bj > 0; if Bj is less than or equal to 0, not multiplexing the data packet of the logic channel;

step 1-3) comparing the values of M and N; and if M-N >0, multiplexing the N data packets of the logic channel into the MAC PDU, otherwise, multiplexing the M data packets of the logic channel into the MAC PDU.

step 2-1) the values of N and M are determined by the following formula: n=floor (PBR X T/Tsdu) -x+1, m=floor (Bj/Tsdu); wherein FLOOR represents a downward rounding, PBR represents a priority bit rate of a logical channel, T represents a time interval (i.e., T TTIs) of a transmission time of current time interval data, tsdu represents a size of unit data packets, X represents a number of data packets transmitted by the logical channel, and Bj represents a number of tokens available in a token bucket corresponding to the logical channel;

step 2-2) comparing whether Bj is larger than 0; multiplexing the data packet of the logical channel into a MAC PDU if Bj > 0; if Bj is less than or equal to 0, not multiplexing the data packet of the logic channel;

Step 2-3) comparing the values of M and N; and if M-N >0, multiplexing the N data packets of the logic channel into the MAC PDU, otherwise, multiplexing the M data packets of the logic channel into the MAC PDU.

In some alternative embodiments, the at least two logical channels are associated using coded identification. As an example: the coded identity is represented by a logical channel identity ((Logical Channel Identifier, LCID) or an extended logical channel identity (extend Logical Channel Identifier, eclpid).

In some alternative embodiments, for RLC entities respectively corresponding to the at least two logical channels, the RLC entities segment data packets based on one of the following configurations:

a first configuration for configuring a segment size;

and the second configuration is used for configuring the corresponding relation between the channel quality grade and the segment size or the corresponding relation between the channel quality and the segment size.

In the above solution, optionally, the first configuration and/or the second configuration are configured by the network through RRC messages, where the second configuration information includes segment sizes corresponding to different channel quality classes or segment sizes corresponding to different channel qualities.

In some alternative embodiments, the network may also send a segment size dynamic adjustment configuration to the communication device via an RRC message, the configuration application and RLC entity. Wherein, the configuration at least comprises segment sizes corresponding to different channel quality or channel quality grades. Further optionally, the configuration may also include a segment-sized activation time.

Based on this, the MAC entity indicates to the RLC entity to adjust the segment size of the data packet, and accordingly, the RLC entity adjusts the segment size of the data packet based on the indication received from the MAC entity. Here, the MAC entity indicates to the RLC entity to adjust the segment size of the data packet, which may be achieved by:

mode one: for the case that the RLC entity segments the data packet based on the first configuration, the MAC entity indicates a first segment size to the RLC entity, where the first segment size is the adjusted segment size; or alternatively, the process may be performed,

mode two: for the case where the RLC entity segments data packets based on the second configuration, the MAC entity needs to indicate channel quality or channel quality class to the RLC entity, where the channel quality or channel quality class is used by the RLC entity to determine a corresponding segment size in conjunction with the second configuration and segment data packets based on the segment size.

Further optionally, the MAC entity indicates to the RLC entity a segment-sized activation time.

In this embodiment, the encoding of the data of the at least two logical channels by the MAC entity may be implemented in the following manner: the MAC entity performs network coding of MAC service data units (Service Data Unit, SDUs) to be retransmitted based on a retransmission policy.

In some alternative embodiments, the retransmission policy includes at least one of: the method comprises the steps of increasing the number of coded data packets, increasing the number of the coded data packets by a multiple, selecting the number of the coded data packets corresponding to the retransmission times, increasing the step of repeating the sub-data packets, increasing the number of the sub-data packets by a multiple, selecting the number of the sub-data packets and selecting the number of the sub-data packets corresponding to the retransmission times.

According to the technical scheme, the RLC entity of the data transmitting end (such as a base station or UE) divides the data packet to be transmitted into a plurality of sub-data packets and submits the sub-data packets to the MAC entity, and the MAC entity carries out network coding on the sub-data packets or retransmits the sub-data packets, so that the 'multi-time' transmission of the data packet is completed through the wireless resources equivalent to single transmission, and the resource utilization rate is improved.

The following describes the technical solutions of the embodiments of the present application by way of example with reference to specific application examples.

Application example 1

1. The originating RLC entity segments the data packets based on the segment related configuration.

Here, the segment-related configuration includes at least one of:

a first configuration for configuring a segment size;

Here, the originating RLC entity also needs to receive an indication of the channel quality level or channel quality from the MAC entity if the segmentation correlation configuration is in said second configuration. The originating RLC entity segments the data packets by selecting a corresponding segment size based on the channel quality class or channel quality.

2. The originating MAC entity network encodes RLC PDUs (i.e., MAC SDUs) on the associated radio bearer or logical channel.

Here, the originating MAC entity may also instruct the associated RLC entity to submit a specific number of RLC PDUs prior to encoding.

In some alternative embodiments, the originating MAC entity may determine the number of RLC PDUs before encoding based on logical channel priority. And/or, the originating MAC entity may determine a network coding scheme and a number of pre-coding RLC PDUs based on the uplink resource size. And/or the originating MAC entity may determine a network coding scheme and a number of pre-coding RLC PDUs based on the channel quality.

In some alternative embodiments, the association between radio bearers or logical channels using network coding may be configured by a MAC entity (e.g., by a CellGroupConfig cell). Here, in order to associate different logical channels of a certain network coding algorithm or network coding scheme, a coding identifier is introduced. The coded identity is associated with at least two logical channel identities. The specific implementation can be as follows: the code identification corresponding to the logical channel is configured in a logical channel configuration (logicalChannelConfig) or an RLC configuration (RLC-Config). In this way, the MAC can know which logical channels use the same network coding algorithm or network coding scheme.

3. The originating MAC entity generates a corresponding MAC PDU.

As an example, as shown in fig. 5, the RLC entity receives PDCP PDUs transmitted by the PDCP entity, segments the PDCP PDUs into a plurality of sub-packets, and then delivers the sub-packets to the MAC entity; the MAC entity encodes a plurality of sub-packets from different DRBs (i.e., logical channels) and generates corresponding MAC PDUs based on the encoded packets. The scheme shown in fig. 5 is applicable to multiple DRB data joint coding.

As an example, as shown in fig. 6, the data transmission method includes the following flow:

Step 601a/b: the originating RLC entity obtains the segmentation related configuration or the originating RLC entity obtains the channel quality indication from the originating MAC entity.

Step 602: the originating RLC entity determines the segmentation size and segments the data packets based on the segmentation size.

Optionally, the originating RLC entity may also re-acquire a channel quality indication from the originating MAC entity and adjust the segment size based on the channel quality indication.

Step 603: the originating MAC entity sends an indication of the number of RLC PDUs to the originating RLC entity.

Step 604: the originating RLC entity delivers a specific number of RLC PDUs to the originating MAC entity.

Step 605: the originating MAC entity performs network coding on a specific number of RLC PDUs and generates MAC PDUs.

Further, the originating MAC entity sends out the MAC PDU.

Step 606: the receiving MAC entity decodes the MAC PDU and obtains RLC PDUs of different logical channels.

Further, the receiving end MAC entity submits the RLC PDU to the corresponding receiving end RLC entity.

Step 607: if the receiving MAC entity does not decode successfully, then step 608 is performed.

Step 608: the receiving end MAC entity sends retransmission indication to the transmitting end MAC entity.

Step 609: the originating MAC entity re-encodes and generates a retransmission MAC PDU.

Further, the originating MAC entity sends out the retransmission MAC PDU.

Application instance two

The network configures RLC sub-packet size to dynamically adjust related configuration through RRC message, where the configuration includes at least a channel quality level and a sub-packet size (i.e., a segment size) corresponding to the channel quality level, and further optionally, may further include an enabling time after sub-packet size adjustment. As an example, the enablement time can be characterized by the SN, i.e., the adjusted packet size is enabled starting from a particular SN.

In particular, the MAC entity instructs the RLC entity to adjust the sub-packet size (i.e., segment size) based on the measured channel quality or channel quality class to which the channel quality belongs. The manner in which the MAC entity indicates to the RLC entity is as follows:

mode one: the MAC entity indicates the channel quality or channel quality class to the RLC entity, which determines the corresponding sub-packet size (i.e., segment size) according to the channel quality or channel quality class in combination with the configuration of the above RRC message.

Mode two: the MAC entity indicates the adjusted sub-packet size (i.e., segment size) to the RLC entity.

Application example three

Identifying network encoded data

Currently, the MAC sub PDU (MAC subPDU) packet comes from only one logical channel, and thus the corresponding MAC sub header (MAC sub header) includes only one LCID. In contrast to the present solution, in the solution of the embodiment of the present application, where one MAC subPDU is obtained by performing network coding on data of multiple logical channels, the technical solution of the embodiment of the present application needs to associate a coding identifier with multiple different LCIDs or eclcids, as shown in fig. 7-1, for example, the MAC subheader includes an LCID, and the associated coding identifier can be determined by using the LCID. As an example, as shown in fig. 7-2, the MAC subheader includes LCID and eclpid by which the encoded identification may be represented.

The receiving MAC entity distinguishes data from different logical channels

As shown in fig. 7-3, the R (reserved) bit is used to identify the MAC subheader as the first network encoded MAC subheader. Correspondingly, at least one coded packet number field (Num) is also included after the L field of the MAC subheader.

When the data of N logic channels are subjected to network coding, N-1 coded data packets exist in a number domain, and the number of the coded data packets participating in the network coding on different logic channels is respectively indicated. Further, optionally, there may be an E field to indicate whether there is an "e+num" field after the "e+num" field,

based on the MAC subheader format shown in fig. 7-3, the MAC PDU format is shown in fig. 7-4 and fig. 7-5, wherein fig. 7-4 illustrates the format of the downlink MAC PDU and fig. 7-5 illustrates the format of the uplink MAC PDU.

Application example four

At present, the multiplexing method of the logic channel priority and the MAC is as follows: the UE receives uplink radio resources from the base station, and the specific logical channels of data can be put into the allocated uplink resources, and how much data each logical channel places is determined by the UE based on RRC configuration and protocol specifications.

The RRC configures a priority (priority) field for each logical channel, and the smaller the value, the higher the priority. In addition, a priority bit rate (Prioritised Bit Rate, PBR) and a token bucket size duration (Bucket Size Duration, BSD) are configured for each logical channel, the PBR providing minimum data rate guarantees for each logical channel, avoiding the problem that low priority logical channel data cannot always be transmitted. The BSD together with the PBR determines the maximum capacity of the token bucket PBR x BSD, i.e. the total amount of data that each logical channel can buffer in the buffer.

As shown in fig. 8, the UE maintains a variable Bj for each logical channel j, the variable indicating the number of tokens (token) currently available in the token bucket, and each token corresponding to 1Byte of data. Bj is initialized to 0 at logical channel setup and PBR x TTI is increased every TTI (e.g., PBR is 8kBps, i.e., token with 8kBps x 1 ms=8 bytes is injected into token bucket every TTI). The value of Bj cannot exceed the maximum capacity PBR x BSD of the bucket (bsd=500 ms for example, maximum capacity 8kbps×500 ms=4k Byte).

Step one: for all the logical channels with Bj >0, the radio resources allocated to each logical channel can only meet the requirements of PBR according to the descending order of priority.

Step two: bj minus logical channel j is multiplexed into the size of all MAC SDUs of the MAC PDU in step 1. (reference implementation: for logical channel j, each RLC SDU is transmitted, compare first if Bj is greater than 0. If Bj is greater than 0, add this SDU to the MAC PDU, then subtract Bj by the size Tsdu of this SDU and determine if the PBR requirement is met. Iterate so until Bj is less than 0, or the PBR requirement is met, then process the next logical channel).

Step three: if there is any uplink resource left after the previous two steps, the remaining resources are allocated to each logical channel according to the logical channel priority, regardless of the size of Bj. Only when all data of the logical channels of high priority are transmitted and UL grant is not exhausted, the logical channels of low priority can be serviced. I.e. the UE at this point maximizes the data transmission of the high priority logical channels.

For multiple logical channels, it may be determined for which logical channel to place its data in the MAC PDU first and then for which logical channel to place its data in the MAC PDU according to the priority of the logical channel. As shown in fig. 9, channel 1 has Priority 1, channel 2 has Priority 2, and Channel 3 has Priority 3, wherein Channel 1 has the highest Priority, so that data is preferentially put in the MAC PDU, channel 2 is next, and Channel 3 is last. After all the logical channels are processed, there are remaining radio resources, and then the data of Channel 1 is placed preferentially.

In some alternative embodiments, as shown in FIG. 10, two values, namely, the value of N and M, need to be determined first.

Here, the value of N is the minimum value of N that can meet the PBR requirement, and as an example:

n=floor (PBR x T/Tsdu) +1, where T is the time since last scheduling, i.e. T TTIs, tsdu denotes the size of each packet; or alternatively, the process may be performed,

n=floor (PBR X T/Tsdu) -x+1, where T is the time period from the start of data transmission, i.e., T TTIs, X is the number of transmitted data packets, and Tsdu represents the size of each data packet.

Here, m=floor (Bj/Tsdu), where Tsdu denotes the size of each packet.

After the values of M and N are determined by the scheme, based on the values of M and N, how many data packets can be directly multiplexed into the MAC PDU, rather than one data packet being multiplexed into the MAC PDU like the prior art, thereby improving the processing efficiency. The method comprises the following specific steps:

step a) compares whether Bj is greater than 0. If Bj >0, multiplexing the data of the logical channel into a MAC PDU; if Bj is less than or equal to 0, the data of the logical channel is not multiplexed.

Step B) compares the M and N values. If M-N >0, N data packets are multiplexed into the MAC PDU, otherwise M data packets are multiplexed into the MAC PDU. Then, the next logically new data is processed next.

Application example five

The originating MAC entity may retransmit the data packet via HARQ, or may re-encode, and retransmit the encoded data packet. The retransmission of the data packet by HARQ is consistent with the prior art, but the retransmission of the encoded data packet by recoding requires modification of the retransmission mechanism. Specifically:

1. the originating MAC entity knows which MAC SDUs need to be retransmitted through HARQ feedback, or the originating MAC entity receives retransmission instructions from the originating RLC entity.

2. The originating MAC entity performs network coding on the MAC SDU to be retransmitted based on the retransmission strategy.

Here, the originating MAC entity generates a new packet header for the retransmitted MAC SDU and adds a new SN number.

Here, the retransmission policy may be transmitted to the communication device (e.g., UE) through an RRC message.

In some alternative embodiments, the retransmission policy includes at least one of:

strategy 1) increasing the number of coded data packets by a step length;

strategy 2) increasing the number of the coded data packets by multiple;

policy 3) optional range of number of encoded data packets;

policy 4) the number of coded data packets corresponding to the retransmission times is selected in a selectable range;

strategy 5) increasing the step length of the repetition times of the sub-data packets;

strategy 6) increasing the repetition times of the sub-data packets by multiple;

policy 7) optional range of sub-packet repetition times;

policy 8) a selectable range of sub-packet repetition times corresponding to the number of retransmissions.

The above strategies 1) to 4) promote reliability by repeating the encoding a plurality of times, and the above strategies 5) to 8) promote reliability by repeating the encoding a plurality of times. The above strategy is described below.

For strategy 1), the number of (encoded) encoded data packets is increased by a step Δm: indicating the number of coded data packets after the coding is increased compared with the number (M) of coded data packets in the last retransmission/new transmission. That is, the number of encoded data packets after this encoding is m+Δm.

For strategy 2), the number of (encoded) encoded data packets is increased by a factor B: indicating the number of coded data packets (M) after the last retransmission/new transmission, which is increased by a multiple. That is, the number of encoded data packets after this encoding is b×m.

For strategy 3), the number of encoded data packets (after encoding) may be selected from the range: the network defines an optional range of numbers of encoded data packets for retransmission situations.

For policy 4), (after encoding) the number of encoded data packets corresponding to the number of retransmissions is selectable: the network configures different selectable ranges of the number of coded data packets for different retransmission times.

For strategy 5), the number of subpacket repetitions is increased by a step Δt: indicating the number of sub-packet repetition (T) before this encoding as compared with the number of sub-packet repetition (T) at the time of the last retransmission/new transmission. That is, the number of sub-packet repetitions before this encoding is t+Δt.

For strategy 6), the number of sub-packet repetitions before encoding is increased by a factor E: indicating the number of sub-packet repetitions (T) before this encoding, as compared to the number of sub-packet repetitions (T) at the time of the last retransmission/new transmission. That is, the number of sub-packet repetitions before this encoding is e×t.

For strategy 7), (pre-coding) sub-packet repetition number optional range: the network defines an optional range of sub-packet retransmission times for retransmission conditions.

For strategy 8, (before encoding) the optional range of the sub-data packet repetition times corresponding to the retransmission times is for different retransmission times, and the network configures the optional range of different sub-data packet retransmission times.

As an example, as shown in fig. 11, in mode 1, the MAC SDU to be retransmitted may be repeated before encoding, and in mode 2, the number of encoded data packets may be increased.

Fig. 12 is a schematic structural diagram of a data transmission apparatus provided in the embodiment of the present application, which is applied to a MAC entity of a communication device, and the communication device may be a network device (such as a base station) or a terminal device (such as a UE), as shown in fig. 12, where the data transmission apparatus includes:

a receiving unit 1201 for acquiring data from at least two logical channels;

an encoding unit 1202 for encoding data of the at least two logical channels;

a transmitting unit 1203 configured to transmit the encoded data.

In some alternative embodiments, the apparatus further comprises: an indication unit 1204, configured to, for RLC entities corresponding to the at least two logical channels, indicate the number of RLC PDUs submitted to the RLC entities, or indicate channel quality to the RLC entities.

In some alternative embodiments, the apparatus further comprises: a determining unit 1205 for determining the number of RLC PDUs based on at least one of: logical channel priority, uplink resource size, channel quality.

In some alternative embodiments, the encoding unit 1202 is further configured to perform, for each of the at least two logical channels, the following steps:

the values of N and M are determined by the following formula: n=floor (PBR T/Tsdu) +1, m=floor (Bj/Tsdu); wherein FLOOR represents downward rounding, PBR represents a priority bit rate of a logic channel, T represents a time interval of last scheduling time of a current time interval, tsdu represents a size of a unit data packet, and Bj represents the number of available tokens in a token bucket corresponding to the logic channel;

comparing whether Bj is greater than 0; multiplexing the data packet of the logical channel into a MAC PDU if Bj > 0; if Bj is less than or equal to 0, not multiplexing the data packet of the logic channel;

comparing the values of M and N; and if M-N >0, multiplexing the N data packets of the logic channel into the MAC PDU, otherwise, multiplexing the M data packets of the logic channel into the MAC PDU.

The values of N and M are determined by the following formula: n=floor (PBR X T/Tsdu) -x+1, m=floor (Bj/Tsdu); wherein FLOOR represents downward rounding, PBR represents a priority bit rate of a logic channel, T represents a time interval of a transmission time of current time interval data, tsdu represents a size of a unit data packet, X represents a number of data packets transmitted by the logic channel, and Bj represents a number of tokens available in a token bucket corresponding to the logic channel;

In some alternative embodiments, the at least two logical channels are associated using coded identification.

In some alternative embodiments, the coded identification is represented by LCID or eclpid.

A first configuration for configuring a segment size;

In some alternative embodiments, for the case that the RLC entity segments data packets based on the second configuration, the apparatus further comprises: an indicating unit 1204, configured to indicate a channel quality or a channel quality class to the RLC entity, where the channel quality or the channel quality class is used by the RLC entity to determine a corresponding segment size in combination with the second configuration and segment the data packet based on the segment size.

In some alternative embodiments, for the case that the RLC entity segments data packets based on the first configuration, the apparatus further comprises: an indicating unit 1204, configured to indicate a first segment size to the RLC entity, where the first segment size is the adjusted segment size.

In some optional embodiments, the indicating unit 1204 is further configured to indicate to the RLC entity a segment-sized activation time.

In some optional embodiments, the first configuration and/or the second configuration are configured by the network through RRC messages, where the second configuration information includes segment sizes corresponding to different channel quality classes or segment sizes corresponding to different channel qualities.

In some optional embodiments, the encoding unit 1202 is further configured to perform network encoding on the MAC SDUs to be retransmitted based on a retransmission policy; wherein the retransmission policy includes at least one of: the method comprises the steps of increasing the number of coded data packets, increasing the number of the coded data packets by a multiple, selecting the number of the coded data packets corresponding to the retransmission times, increasing the step of repeating the sub-data packets, increasing the number of the sub-data packets by a multiple, selecting the number of the sub-data packets and selecting the number of the sub-data packets corresponding to the retransmission times.

Those skilled in the art will appreciate that the implementation functions of the units in the data transmission apparatus shown in fig. 12 can be understood with reference to the relevant description of the foregoing method. The functions of the respective units in the data transmission apparatus shown in fig. 12 may be realized by a program running on a processor or by a specific logic circuit.

Fig. 13 is a schematic block diagram of a communication device 1300 according to an embodiment of the present application. The communication device may be a terminal device (e.g., UE) or a network device (e.g., base station), and the communication device 1300 shown in fig. 13 includes a processor 1310, and the processor 1310 may call and execute a computer program from the memory to implement the methods in the embodiments of the present application.

Optionally, as shown in fig. 13, the communications device 1300 may also include a memory 1320. Wherein the processor 1310 may call and run a computer program from the memory 1320 to implement the methods in embodiments of the present application.

Wherein the memory 1320 may be a separate device from the processor 1310 or may be integrated into the processor 1310.

Optionally, as shown in fig. 13, the communication device 1300 may further include a transceiver 1330, and the processor 1310 may control the transceiver 1330 to communicate with other devices, and in particular, may send information or data to other devices, or receive information or data sent by other devices.

The transceiver 1330 may include, among other things, a transmitter and a receiver. The transceiver 1330 may further include antennas, the number of which may be one or more.

Optionally, the communication device 1300 may be a network device in the embodiment of the present application, and the communication device 1300 may implement a corresponding flow implemented by the network device in each method in the embodiment of the present application, which is not described herein for brevity.

Optionally, the communication device 1300 may be a mobile terminal/terminal device in the embodiment of the present application, and the communication device 1300 may implement a corresponding flow implemented by the mobile terminal/terminal device in each method in the embodiment of the present application, which is not described herein for brevity.

Fig. 14 is a schematic structural diagram of a chip of an embodiment of the present application. The chip 1400 shown in fig. 14 includes a processor 1410, and the processor 1410 may call and run a computer program from a memory to implement the method in the embodiments of the present application.

Optionally, as shown in fig. 14, the chip 1400 may further include a memory 1420. Wherein the processor 1410 may invoke and run a computer program from the memory 1420 to implement the method in the embodiments of the present application.

Wherein the memory 1420 may be a separate device from the processor 1410 or may be integrated into the processor 1410.

Optionally, the chip 1400 may also include an input interface 1430. Wherein the processor 1410 may control the input interface 1430 to communicate with other devices or chips, and in particular may obtain information or data sent by other devices or chips.

Optionally, the chip 1400 may also include an output interface 1440. Wherein processor 1410 may control the output interface 1440 to communicate with other devices or chips, and in particular, may output information or data to other devices or chips.

Optionally, the chip may be applied to a network device in the embodiment of the present application, and the chip may implement a corresponding flow implemented by the network device in each method in the embodiment of the present application, which is not described herein for brevity.

Optionally, the chip may be applied to a mobile terminal/terminal device in the embodiment of the present application, and the chip may implement a corresponding flow implemented by the mobile terminal/terminal device in each method in the embodiment of the present application, which is not described herein for brevity.

It should be understood that the chips referred to in the embodiments of the present application may also be referred to as system-on-chip chips, or the like.

It should be appreciated that the processor of an embodiment of the present application may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method embodiments may be implemented by integrated logic circuits of hardware in a processor or instructions in software form. The processor may be a general purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), an off-the-shelf programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. The disclosed methods, steps, and logic blocks in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in hardware, in a decoded processor, or in a combination of hardware and software modules in a decoded processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.

It will be appreciated that the memory in embodiments of the present application may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable EPROM (EEPROM), or a flash Memory. The volatile memory may be random access memory (Random Access Memory, RAM) which acts as an external cache. By way of example, and not limitation, many forms of RAM are available, such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (Double Data Rate SDRAM), enhanced SDRAM (ESDRAM), synchronous DRAM (SLDRAM), and Direct RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.

It should be understood that the above memory is exemplary but not limiting, and for example, the memory in the embodiments of the present application may be Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), direct RAM (DR RAM), and the like. That is, the memory in embodiments of the present application is intended to comprise, without being limited to, these and any other suitable types of memory.

Embodiments of the present application also provide a computer-readable storage medium for storing a computer program.

Optionally, the computer readable storage medium may be applied to a network device in the embodiments of the present application, and the computer program causes a computer to execute a corresponding flow implemented by the network device in each method in the embodiments of the present application, which is not described herein for brevity.

Optionally, the computer readable storage medium may be applied to a mobile terminal/terminal device in the embodiments of the present application, and the computer program causes a computer to execute a corresponding procedure implemented by the mobile terminal/terminal device in each method of the embodiments of the present application, which is not described herein for brevity.

Embodiments of the present application also provide a computer program product comprising computer program instructions.

Optionally, the computer program product may be applied to a network device in the embodiments of the present application, and the computer program instructions cause the computer to execute corresponding flows implemented by the network device in the methods in the embodiments of the present application, which are not described herein for brevity.

Optionally, the computer program product may be applied to a mobile terminal/terminal device in the embodiments of the present application, and the computer program instructions cause a computer to execute corresponding processes implemented by the mobile terminal/terminal device in the methods in the embodiments of the present application, which are not described herein for brevity.

The embodiment of the application also provides a computer program.

Optionally, the computer program may be applied to a network device in the embodiments of the present application, and when the computer program runs on a computer, the computer is caused to execute a corresponding flow implemented by the network device in each method in the embodiments of the present application, which is not described herein for brevity.

Optionally, the computer program may be applied to a mobile terminal/terminal device in the embodiments of the present application, where the computer program when run on a computer causes the computer to execute corresponding processes implemented by the mobile terminal/terminal device in the methods in the embodiments of the present application, and for brevity, will not be described herein.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.

In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

The foregoing is merely specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the present application, and the changes and substitutions are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method of data transmission, the method comprising:

a Media Access Control (MAC) entity obtains data from at least two logic channels;

the MAC entity encodes data of the at least two logical channels.

2. The method of claim 1, wherein prior to encoding the data of the at least two logical channels by the MAC entity, the method further comprises:

and controlling an RLC entity by the wireless link layer corresponding to the at least two logic channels respectively, wherein the MAC entity indicates the number of submitted RLC protocol data units PDU to the RLC entity or indicates channel quality to the RLC entity.

3. The method of claim 2 wherein the MAC entity indicates to the RLC entity a status of the number of RLC PDUs submitted, the method further comprising:

The MAC entity determines the number of RLC PDUs based on at least one of: logical channel priority LCP, uplink resource size, channel quality.

4. The method of claim 3, wherein the MAC entity determines the number of RLC PDUs based on a logical channel priority LCP, the method further comprising:

5. The method of claim 3, wherein the MAC entity determines the number of RLC PDUs based on a logical channel priority LCP, the method further comprising:

6. The method of claim 1, wherein the at least two logical channels are associated using coded identification.

7. The method of claim 6, wherein the coded identification is represented by a logical channel identification LCID or an extended logical channel identification eclcid.

8. The method of claim 1, wherein for RLC entities corresponding to each of the at least two logical channels, the RLC entities segment data packets based on one of the following configurations:

a first configuration for configuring a segment size;

9. The method of claim 8, wherein, for the case where the RLC entity segments data packets based on the second configuration,

the MAC entity indicates a channel quality or a channel quality class to the RLC entity, the channel quality or channel quality class being used by the RLC entity in combination with the second configuration to determine a corresponding segment size and segment the data packet based on the segment size.

10. The method of claim 8, wherein for the case where the RLC entity segments data packets based on the first configuration, the method further comprises:

The MAC entity indicates a first segment size to the RLC entity, the first segment size being the adjusted segment size.

11. The method according to claim 10, wherein the method further comprises:

the MAC entity indicates to the RLC entity a segment-sized activation time.

12. The method according to claim 8, wherein the first configuration and/or the second configuration is configured by a network via RRC messages, wherein the second configuration information comprises segment sizes corresponding to different channel quality classes or segment sizes corresponding to different channel qualities.

13. The method according to any one of claims 1 to 12, further comprising:

the MAC entity performs network coding on an MAC service data unit SDU to be retransmitted based on a retransmission strategy;

wherein the retransmission policy includes at least one of: the method comprises the steps of increasing the number of coded data packets, increasing the number of the coded data packets by a multiple, selecting the number of the coded data packets corresponding to the retransmission times, increasing the step of repeating the sub-data packets, increasing the number of the sub-data packets by a multiple, selecting the number of the sub-data packets and selecting the number of the sub-data packets corresponding to the retransmission times.

14. A data transmission apparatus, characterized by a MAC entity applied to a communication device, the apparatus comprising:

a receiving unit for acquiring data from at least two logical channels;

an encoding unit for encoding the data of the at least two logical channels;

and the transmitting unit is used for transmitting the encoded data.

15. A communication device, comprising: a processor and a memory for storing a computer program, the processor being adapted to invoke and run the computer program stored in the memory, to perform the method according to any of claims 1 to 13.

16. A chip, comprising: a processor for calling and running a computer program from a memory, causing a device on which the chip is mounted to perform the method of any one of claims 1 to 13.

17. A computer readable storage medium storing a computer program for causing a computer to perform the method of any one of claims 1 to 13.