Communication method and communication apparatus

Abstract

Provided in the present application are a communication method and a communication apparatus, which relate to the field of communications. In the method, a terminal can map data of a burst to M logical channels on the basis of a first resource allocated by a network device to the burst, wherein the first resource occupies M time units, the amount of data in the burst mapped to an i-th logical channel among the M logical channels is determined by the amount of data that can be transmitted by a resource in the first resource in an i-th time unit, and the i-th time unit is an i-th time unit among the M time units; and the terminal sending the data in the i-th logical channel in the i-th time unit. On the basis of the above solution, data of a burst can be mapped to at least one logical channel; and by means of sending data in logical channels in time units respectively corresponding to the logical channels, it can be ensured that data in a corresponding logical channel is sent in a corresponding time unit, thereby implementing the deterministic transmission of the burst and improving user experience.

Description

Communication method and communication apparatus

[0001] The present application claims priority to the Chinese Patent Application No. 202410889681.5, filed on July 3, 2024, and entitled "Communication method and communication apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of communication, and more particularly, to a communication method and a communication apparatus. BACKGROUND

[0003] The time delay of different bursts from a terminal to a network device in a service can be different, and if the time delay of different bursts is within a certain range, the air interface transmission time delay of the service is called deterministic time delay. Deterministic time delay is to pursue the consistency of user experience, for example, for extended reality (XR) service, if the time delay of each burst is within a certain range, the user will not feel the phenomenon of picture freezing. Therefore, how to realize the deterministic time delay of air interface transmission is a problem to be solved at present. SUMMARY

[0004] The present application provides a communication method and a communication apparatus, which can realize the deterministic time delay of air interface transmission, i.e., the deterministic transmission of air interface.

[0005] In a first aspect, a communication method is provided, which can be applied to the terminal side, such as a terminal or a communication module in the terminal, or a circuit or chip responsible for communication function in the terminal (such as a modem chip, also known as a baseband chip, or a system on chip (SoC) chip or a system in package (SIP) chip containing a modem core).

[0006] The method comprises: mapping data of a burst to M logical channels according to a first resource allocated by a network device for the burst, M being a positive integer, the first resource occupying M time units, and the amount of data in the burst mapped to an i-th logical channel of the M logical channels being determined by the amount of data that can be transmitted by a resource on an i-th time unit in the first resource, the i-th time unit being an i-th time unit in the M time units, and i being a positive integer; and transmitting data in the i-th logical channel at the i-th time unit.

[0007] For example, the time unit can be a minimum unit (or minimum granularity, etc.) of time domain resources allocated by the network device. For example, the time unit can be a symbol, a time slot, a subframe, a half frame, or a frame, etc. In this example, the first resource occupying M time units means that the time domain resources corresponding to the first resource are the M time units.

[0008] For example, the time unit is a basic scheduling unit of the network device (or also can be referred to as a scheduling time unit or a scheduling time unit, etc.). For example, the basic scheduling unit can be a time slot, a mini-slot, a subframe, or a transmission time interval (TTI), etc. In this example, the first resource occupying M time units can mean that the time domain resources corresponding to the first resource belong to the M time units.

[0009] According to the method provided in the present application, the terminal can map the data of the burst to at least one logical channel according to the transmission resources allocated by the network device for the burst, and by transmitting the data in the logical channel in the time unit corresponding to the logical channel, the data in the corresponding time unit can be ensured to be transmitted in the corresponding logical channel, so as to control the transmission delay of the burst within a certain range and improve the user experience.

[0010] In a possible implementation, the M logical channels belong to R logical channels corresponding to a first service to which the burst belongs, and R≥ceil (transmission delay of the first burst of the first service / length of the time unit), wherein ceil represents rounding up.

[0011] For example, each burst can correspond to at least one logical channel, and the logical channels corresponding to any two bursts can be different. The data of a burst is mapped to the at least one logical channel corresponding to the burst. The mapping relationship between the burst and the logical channel in this scheme is relatively simple.

[0012] For example, each time unit can correspond to a logical channel. Then, according to the time unit occupied by the burst, the burst can be mapped to the logical channel corresponding to the time unit occupied by the burst. In this design, if the resources allocated for multiple bursts include the same time domain resources, at least part of the data in the multiple bursts will be mapped to the same time domain resources.

[0013] In a possible implementation, the nth logical channel in the R logical channels is used to carry the data in the first service that is mapped to the nth time unit for transmission, n is a positive integer, and % represents the remainder. The arrival time of the first burst in the first service is the first time unit.

[0014] In the implementation, R logical channels can be established for the first service, and then data of the first service is mapped into corresponding logical channels according to the correspondence between the R logical channels and the time units.

[0015] In a possible implementation, R = ceil (transmission delay of the first burst of the first service / length of the time unit), or R = ceil (delay budget of the first service / length of the time unit).

[0016] The scheme can limit the number of logical channels established for the first service within a certain range, reduce the number of logical channels, and save resources. It should be understood that the scheme of R = ceil (transmission delay budget of the first service / length of the time unit) can further reduce the number of required logical channels, thereby further saving resources and reducing the processing complexity of the terminal.

[0017] In a second aspect, a communication method is provided. The method can be applied to a terminal side, for example, a terminal or a communication module in the terminal, or a circuit or chip (such as a modem chip, also known as a baseband chip, or a SoC chip or SIP chip containing a modem core) responsible for communication functions in the terminal.

[0018] The method includes: mapping first data of a burst into a logical channel according to an arrival time of the first data, the logical channel being used to carry data in a first service to which the burst belongs and having an arrival time within a first time period, a length of the first time period being a jitter budget of the first service, and an amount of data in the burst mapped into the logical channel being determined by an amount of data that can be transmitted by first transmission resources allocated by a network device for the burst, the first transmission resources being located in a first time unit; and transmitting data in the logical channel in the first time unit.

[0019] According to the method provided in the embodiments of the present application, data can be mapped into a corresponding logical channel according to an arrival time of the data. Since the data mapped into the logical channel meets the jitter requirement of the service, transmitting the data in the logical channel at a time when transmission resources of a burst to which the data belongs are located in a network device can ensure that a transmission delay of the burst is controlled within a certain range, thereby improving user experience.

[0020] In a possible implementation, the logical channel belongs to R logical channels corresponding to the first service, and R ≥ ceil (transmission delay of the first burst of the first service / jitter), ceil representing rounding up, and jitter being the jitter budget.

[0021] In the implementation, R logical channels can be established for the first service, and then the data of the first service is mapped into corresponding logical channels according to the correspondence between the R logical channels and the arrival time of the data.

[0022] In a possible implementation, the i th logical channel of the R logical channels is used to map the data of the first service that arrives at the ( (i-1) jitter+k*PDB, jitter*i+k*PDB) th time, PDB is the delay budget of the first service, R≥ceil(PDB / jitter), i is a positive integer, and k is an integer. The arrival time of the first burst is the 0 th time.

[0023] For example, R=ceil(PDB / jitter).

[0024] The scheme can limit the number of logical channels established for the first service within a certain range, reduce the number of logical channels, and save resources.

[0025] In a possible implementation, the i th logical channel of the R logical channels is used to map the data of the first service that arrives at the ( (i-1) jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter), jitter*i+jitter*k*ceil(transmission delay of the first burst of the first service / jitter)) th time, R≥ceil(transmission delay of the first burst of the first service / jitter), i is a positive integer, and k is an integer. The arrival time of the first burst is the 0 th time.

[0026] For example, R=ceil(transmission delay of the first burst of the first service / jitter).

[0027] The scheme can limit the number of logical channels established for the first service within a certain range, reduce the number of logical channels, and save resources.

[0028] In a possible implementation, before the data of the first service that arrives at the ( (i-1) jitter+(k+1)*PDB, jitter*i+(k+1)*PDB) th time is mapped into the i th logical channel, the data of the first service that arrives at the ( (i-1) jitter+k*PDB, jitter*i+k*PDB) th time in the i th logical channel is emptied.

[0029] Generally, at the (i-1)jitter+(k+1)*PDB moment, the data in the ith logical channel has been sent. But to avoid the situation that there is still data in the ith logical channel at the (i-1)jitter+(k+1)*PDB moment due to other reasons, the ith logical channel can be emptied first, which can further guarantee the deterministic delay of the first service.

[0030] In a possible implementation, before the data arriving at the [(i-1)jitter+jitter*(k+1)*ceil(transmission delay of the first burst of the first service / jitter), jitter*i+jitter*(k+1)*ceil(transmission delay of the first burst of the first service / jitter)] moment in the first service is sent to the ith logical channel, the data arriving at the [(i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter), jitter*i+jitter*k*ceil(transmission delay of the first burst of the first service / jitter)] moment in the first service in the ith logical channel is emptied.

[0031] Generally, at the (i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter) moment, the data in the ith logical channel has been sent. But to avoid the situation that there is still data in the ith logical channel at the (i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter) moment due to other reasons, the ith logical channel can be emptied first, which can further guarantee the deterministic delay of the first service.

[0032] In a third aspect, a communication apparatus is provided. In a possible design of the communication apparatus, the communication apparatus can implement the functions in the first aspect or the second aspect. For example, the communication apparatus can include a module or unit or means corresponding to the operations in the first aspect or the second aspect. The module or unit or means can be implemented in software, hardware, or a combination of software and hardware.

[0033] In a fourth aspect, a communication apparatus is provided. The communication apparatus can include an interface circuit and one or more processors. The one or more processors can be coupled to a memory. The memory can be configured to store a portion or all of computer program or instructions necessary to implement the functions related to the first aspect or the second aspect. The one or more processors can execute the computer program or instructions, which when executed, cause the communication apparatus to implement the method in any possible design or implementation of the first aspect or the second aspect. The interface circuit can be configured to enable communication functions within the communication apparatus and / or between the communication apparatus and other apparatuses or components.

[0034] In a possible design, the processor can be configured to communicate with other apparatuses or components via the interface circuit.

[0035] In a possible design, the communication apparatus can further include the memory.

[0036] The communication apparatus described above can be a terminal, a communication module in a terminal, or a chip responsible for communication functions in a terminal, such as a modem chip (also referred to as a baseband chip) or a SoC or SIP chip including a modem module.

[0037] In a fifth aspect, a communication system is provided. The communication system can include a terminal and a network device. The terminal can be the communication apparatus provided in the first aspect or the second aspect.

[0038] In a sixth aspect, a computer-readable storage medium is provided. The computer-readable storage medium can store computer readable instructions. When a computer reads and executes the computer readable instructions, the method in the first aspect or any possible implementation of the first aspect can be performed, or the method in the second aspect or any possible implementation of the second aspect can be performed.

[0039] In a seventh aspect, a computer program product is provided. When a computer reads and executes the computer program product, the method in the first aspect or any possible implementation of the first aspect can be performed, or the method in the second aspect or any possible implementation of the second aspect can be performed.

[0040] In an eighth aspect, a communication apparatus is provided. The communication apparatus can include a processor. When the processor executes a program or instructions, the method in the first aspect or any possible implementation of the first aspect can be performed, or the method in the second aspect or any possible implementation of the second aspect can be performed.

[0041] A ninth aspect provides a chip including a processor for calling and running a computer program from a memory, such that the method in the first aspect or any possible implementation of the first aspect is executed, or that the method in the second aspect or any possible implementation of the second aspect is executed. Attached Figure Description

[0042] Figure 1 is a possible, non-limiting system schematic diagram provided in an embodiment of this application;

[0043] Figure 2 is a schematic diagram of the time delay jitter of periodic data provided in the embodiments of this application;

[0044] Figure 3 is a schematic diagram of another delay jitter provided in an embodiment of this application;

[0045] Figure 4 is a schematic diagram of a resource allocation scheme provided in an embodiment of this application;

[0046] Figure 5 is a protocol stack architecture diagram of a terminal provided in an embodiment of this application;

[0047] Figure 6 is a schematic flowchart of a communication method provided in an embodiment of this application;

[0048] Figures 7 to 9 are schematic diagrams illustrating the mapping relationship between data and logical channels, and the mapping relationship between logical channels and resources, provided in the embodiments of this application.

[0049] Figure 10 is a schematic flowchart of a specific example of the communication method provided in the embodiments of this application;

[0050] Figure 11 is a schematic flowchart of another communication method provided in an embodiment of this application;

[0051] Figure 12 is a schematic diagram of a data-logic channel mapping relationship provided in an embodiment of this application;

[0052] Figures 13 and 14 are schematic diagrams illustrating a mapping relationship between data and logical channels, and a mapping relationship between logical channels and resources, provided in an embodiment of this application.

[0053] Figure 15 is a schematic flowchart of a specific example of the communication method provided in the embodiments of this application;

[0054] Figure 16 is a schematic diagram of a communication device provided in an embodiment of this application;

[0055] Figure 17 is a schematic diagram of the structure of a terminal provided in an embodiment of this application. Detailed Implementation

[0056] The technical solutions in the embodiments of this application will now be described with reference to the accompanying drawings.

[0057] In the description of the present application, unless otherwise specified, " / " means that the objects before and after the correlation are in an "or" relationship, for example, A / B can represent A or B; "and / or" in the present application is only a description of the correlation of the associated objects, which means that there can be three relationships, for example, A and / or B, which can represent: A exists alone, A and B exist simultaneously, and B exists alone, where A, B can be singular or plural. And, in the description of the present application, unless otherwise specified, "multiple" means two or more than two. "At least one of the following" or the like refers to any combination of the items, including any combination of single or multiple items. For example, at least one of a, b, or c can represent: a, b, c, a-b, a-c, b-c, or a-b-c, where a, b, c can be single or multiple. In addition, in order to clearly describe the technical solutions of the embodiments of the present application, in the embodiments of the present application, "first", "second", etc. are used to distinguish the same items or similar items with basically the same function and effect. Those skilled in the art can understand that "first", "second", etc. do not limit the quantity and execution order, and "first", "second", etc. also do not necessarily mean different.

[0058] In the method embodiments of the present application, the size of the serial number does not mean the execution order, the execution order should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0059] It can be understood that in the present application, "in the case of", "if", "when", "if", and similar descriptions can be used instead. And these descriptions all mean that under certain objective circumstances, the corresponding processing will be done, not limited by time, and also does not require a judgment action when implemented, nor means that there are other limitations.

[0060] It can be understood that some optional features in the embodiments of the present application can not depend on other features in some scenarios, such as the scheme it is currently based on, and can be independently implemented to solve the corresponding technical problems and achieve the corresponding effects. Also, in some scenarios, it can be combined with other features according to needs. Correspondingly, the devices given in the embodiments of the present application can also realize these features or functions, which will not be described here.

[0061] In the present application, the same or similar parts among various embodiments can be mutually referred to, unless otherwise specified. In the present application, the terms and / or descriptions of different embodiments, and the technical features in various implementation manners / implementation methods / implementation approaches in each embodiment have consistency, and can be mutually referred to or combined, unless otherwise specified and logically conflicted. The technical features in different embodiments, and the technical features in various implementation manners / implementation methods / implementation approaches in each embodiment can be combined to form new embodiments, implementation manners, implementation methods, or implementation approaches according to their inherent logical relationship. The implementation manners of the present application described below do not constitute a limitation on the protection scope of the present application.

[0062] The technical solutions of the embodiments of the present application can also be applied to various communication systems, such as a long term evolution (LTE) system, a 5th generation (5G) system, a new radio (NR), a future communication system, and the like. The technical solutions provided by the present application can also be applied to an internet of things (IoT) network or vehicle-to-everything (V2X) communication, and the like. It should be understood that the above-mentioned communication systems to which the present application is applied are only illustrative, and the communication systems to which the present application is applied are not limited thereto.

[0063] FIG. 1 shows a possible, non-limiting, system diagram. As shown in FIG. 1, the communication system 10 includes a radio access network (RAN) 100 and a core network (CN) 130. The RAN 100 includes at least one RAN node (e.g., 110a and 110b in FIG. 1, collectively referred to as 110) and at least one terminal (e.g., 120a-120j in FIG. 1, collectively referred to as 120). The RAN 100 can also include other RAN nodes, such as a wireless relay device and / or a wireless backhaul device (not shown in FIG. 1), and the like. The terminal 120 is connected to the RAN node 110 in a wireless manner. The RAN node 110 is connected to the core network 130 in a wireless or wired manner. The core network device in the core network 130 and the RAN node 110 in the RAN 100 can be different physical devices, respectively, or can be the same physical device integrated with the logical functions of the core network and the logical functions of the radio access network.

[0064] The RAN 100 can be a 3rd generation partnership project (3GPP) related cellular system, e.g., a 4G, 5G mobile communication system, or a future oriented evolved system, e.g., a 6G mobile communication system. The RAN 100 can also be an open radio access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. The RAN 100 can also be a communication system that combines two or more of the above systems.

[0065] The RAN nodes 110, which can also be referred to as access network devices, network devices, RAN entities, or access nodes, etc., form part of the communication system 100 and are configured to facilitate wireless access to the communication system 100 by terminals. The RAN nodes 110 in the communication system 100 can be nodes of the same type or nodes of different types. In some scenarios, the roles of the RAN nodes 110 and the terminals 120 are relative, e.g., a net element 120i in Figure 1 can be a helicopter or a drone, which can be configured to be a mobile base station, for a terminal 120j that accesses the RAN 100 through the net element 120i, the net element 120i is a base station; but for the base station 110a, the net element 120i is a terminal. The RAN nodes 110 and the terminals 120 are sometimes referred to as communication apparatuses, e.g., the net elements 110a and 110b in Figure 1 can be understood as communication apparatuses with base station functions, and the net elements 120a-120j can be understood as communication apparatuses with terminal functions.

[0066] In a possible scenario, the RAN node can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a transmission point (TP), a next generation NodeB (gNB), a base station in a future mobile communication system, or an access node in a WiFi system, etc. The RAN node can be a macro base station (such as 110a in FIG. 1), a micro base station or an indoor station (such as 110b in FIG. 1), a relay node or a donor node, or a wireless controller in a CRAN scenario. Optionally, the RAN node can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, an access network device in vehicle to everything (V2X) technology can be a road side unit (RSU). All or part of the functions of the RAN node in this application can also be implemented by software functions running on hardware, or by virtualized functions instantiated on a platform (such as a cloud platform). The RAN node can also be provided with a communication module, circuit or chip for performing corresponding communication functions, and program instructions for performing corresponding communication functions. The RAN node in this application can also be a logical node, a logical module or software that can implement all or part of the functions of the RAN node.

[0067] In another possible scenario, multiple RAN nodes cooperate to assist a terminal to implement wireless access, and different RAN nodes respectively implement part of the functions of a base station. For example, the RAN node can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be separately arranged, or can be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, such as a radio frequency remote unit (RRU), an active antenna processing unit (AAU), or a remote radio head (RRH).

[0068] In different systems, the CU (or CU-CP and CU-UP), DU or RU can also have different names, but those skilled in the art can understand their meanings. For example, in the ORAN system, the CU can also be referred to as O-CU (open CU), the DU can also be referred to as O-DU, the CU-CP can also be referred to as O-CU-CP, the CU-UP can also be referred to as O-CU-UP, and the RU can also be referred to as O-RU. For the convenience of description, the CU, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any one of the CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0069] It should be understood that the RAN node can also have different expressions in different communication systems or communication technologies. For example, in a wireless local area network (WLAN) system, the RAN node can be referred to as an access point (AP). In this application, the "network device" is used for description unless otherwise specified.

[0070] A terminal can be a device or module with corresponding communication functions for accessing the above communication system. The terminal can also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. The terminal can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), internet of things (IOT), virtual reality (VR), augmented reality (AR), mediated reality (MR), industrial control, autonomous driving, remote medical treatment, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver function, wearable device, vehicle, unmanned aerial vehicle, helicopter, airplane, ship, robot, mechanical arm, smart home device, wireless communication function transport vehicle, communication module, etc. The embodiments of this application do not limit the device form of the terminal. The terminal usually has a communication module, circuit or chip for executing corresponding communication functions. The terminal also has a program instruction for executing corresponding communication functions.

[0071] For the convenience of those skilled in the art to understand, some terms or words in this application are explained below.

[0072] (1) burst

[0073] Generally, a service, such as an extended reality (XR) service, includes multiple bursts, or in other words, the service is composed of multiple bursts. A burst includes multiple packets, or in other words, a burst is a group composed of multiple packets. For example, a photo may need dozens of packets to be carried out, and the dozens of packets are almost simultaneously generated and almost simultaneously expired, and the dozens of packets can become a burst.

[0074] In the embodiments of the present application, the burst can also be replaced by a frame, a protocol data unit (PDU) set, or other terms representing the same concept. The packet can also be replaced by a data packet, a packet, a PDU, or other terms representing the same concept. Alternatively, the burst can also be replaced by data, etc.

[0075] (2) transmission delay

[0076] The transmission delay in the embodiments of the present application refers to the air interface transmission delay. For any burst in a service, the transmission delay (i.e., the air interface transmission delay) of the burst is equal to the time difference between the time when the first packet / byte / bit of the burst arrives at the terminal and the time when the terminal ends sending the burst. Alternatively, for any burst, the transmission delay of the burst is equal to the difference between the end time of the transmission resource allocated by the network device for the burst and the time when the first packet / byte / bit of the burst arrives at the terminal.

[0077] It should be noted that in the embodiments of the present application, for any burst, the amount of data sent by the terminal for the burst can be greater than, less than, or equal to the amount of data of the burst, and the amount of data sent by the terminal for the burst is determined according to the amount of data that can be transmitted by the transmission resource allocated by the network device for the terminal. Therefore, the time when the terminal ends sending the burst can not be the time when the terminal sends the last packet / byte / bit in the burst. The amount of data sent by the terminal for the burst will be described in detail in the method embodiments below, and will not be described here.

[0078] (3) transmission delay budget

[0079] A service generally has a transmission delay requirement, which is referred to as the transmission delay budget of the service. In the embodiments of the present application, the transmission delay budget of the service refers to the air interface transmission delay budget of the service. In addition, the transmission delay budget of the service is also sometimes referred to as the transmission delay budget of the burst.

[0080] Generally, for any burst of a service, if the transmission delay budget of the service is exceeded and the burst has not been successfully sent to the receiving end, the sending end can discard the burst and does not need to send the packets in the burst that have not been successfully sent to the receiving end. For example, taking the transmission delay budget of a service as 10 ms as an example, timing starts from the arrival of the first packet / byte / bit of a burst of the service at the terminal, and if all the packets / bytes / bits of the burst are not successfully sent within 10 ms, the burst is discarded. It should be noted that, in the embodiments of the present application, successfully sending all the packets / bytes / bits of the burst means successfully sending data of a certain data amount in the burst, and the data amount is the data amount of the burst sent by the terminal as described above.

[0081] In the embodiments of the present application, packet delay budget (PDB) is used to represent the transmission delay budget of a service for the convenience of description and understanding.

[0082] Further, the PDB in the embodiments of the present application refers to the PDB between the terminal and the network device, which can be referred to as access network packet delay budget (AN-PDB) for example.

[0083] It should be noted that, in the art, PDU set delay budget (PSDB) can also be used to represent the transmission delay budget of a service. It should be understood that other reasonable names (or terms, etc.) can also be used to describe the transmission delay budget of a service.

[0084] (4) Delay jitter budget / requirement / requirement

[0085] Delay jitter actually refers to the difference between two times. The delay jitter we often say is in a periodic service, at this time the meaning of delay jitter is shown in FIG. 2, that is, the difference between the arrival time of data in theory and the arrival time of data in practice of a periodic service. In the embodiments of the present application, referring to FIG. 3, delay jitter is a more general concept, which refers to the difference between the maximum transmission delay and the minimum transmission delay. The delay jitter budget of a service refers to the maximum value of the absolute value of the difference between the transmission delays (i.e., air interface transmission delays) of any two bursts in the service.

[0086] In the embodiments of the present application, for the convenience of description, the delay jitter budget of a service is denoted as jitter.

[0087] The latency jitter requirement / demand and the latency jitter budget can be used to describe the latency jitter. For example, the latency demand can be expressed as [-1ms, +1ms], which means that the data can arrive 1ms in advance or be delayed 1ms, and the latency jitter budget is 2ms. The latency jitter budget can also be replaced by the length of the latency jitter interval, such as the length of the latency jitter interval being 2ms.

[0088] (5) Deterministic latency

[0089] The latency jitter within a certain range is referred to as deterministic latency. In the embodiments of the present application, the deterministic latency refers to the deterministic latency of the air interface transmission latency. That is, for a service, if the air interface transmission latency of any one burst in the service is located within a certain range, or if the absolute value of the difference between the air interface transmission latencies of any two bursts in the service is less than or equal to the latency jitter budget of the service, the air interface transmission latency of the service is referred to as deterministic latency.

[0090] (6) Time of arrival of the packet / byte / bit at the terminal

[0091] In the embodiments of the present application, the time of arrival of the packet / byte / bit at the terminal can refer to the time of arrival of the packet / byte / bit at a certain layer (such as the service data adaptation protocol (SDAP) layer, the packet data convergence protocol (PDCP) layer, or the radio link control (RLC) layer) above the media access control (MAC) layer of the terminal, the time of arrival of the packet / byte / bit at the MAC layer of the terminal, or the time of arrival at the shaping module below, or the time of arrival at the buffer in the shaping module, and the like. The shaping module will be described in detail below, and will not be described here.

[0092] It should be noted that in the embodiments of the present application, the time of arrival of the packet / byte / bit at the terminal is also described as the arrival time of the packet / byte / bit, and the two descriptions can be replaced by each other.

[0093] (7) Burst arrival at the terminal

[0094] In the embodiments of the present application, the burst arrival at the terminal refers to the arrival of all the packets / bytes / bits of the burst at the terminal, such as the arrival of all the packets / bytes / bits of the burst at a certain layer (such as the SDAP layer, the PDCP layer, or the RLC layer) above the MAC layer of the terminal or at the MAC layer of the terminal.

[0095] (8) Transmission resource

[0096] A transmission resource refers to a physical resource used for transmitting data, and can also be referred to as a time-frequency resource. For example, the transmission resource allocated by the network device for a certain burst can occupy X subcarriers in the frequency domain and Y time slots / symbols / mini-symbols / frames / subframes / halves of frames / mini-slots in the time domain, where X and Y can be positive integers.

[0097] (9) Buffering duration of a burst

[0098] The buffering duration of a burst can also be referred to as the buffering time of a burst, the buffering delay of a burst, etc., and can refer to the duration between the time when the first packet / byte / bit of the burst arrives at the terminal and the time when the last packet / byte / bit of the burst arrives at the terminal. For example, if the time difference between the arrival times of all packets / bytes / bits of a certain burst at the terminal is small or negligible, the buffering duration of the burst can be considered as 0 or approximately 0.

[0099] As can be seen from the above, if the transmission delays of different bursts of the same service fluctuate greatly, data transmission may be interrupted, or even packets may be lost, which affects the user experience.

[0100] Based on this, a scheme based on allocating transmission resources (i.e., resources used for transmitting data, which can also be referred to as time-frequency resources) to bursts can be considered. In this scheme, the network device requests resources for each burst in a service, and the network device can control the transmission delays of the bursts in the service within a certain range by allocating appropriate transmission resources to each burst.

[0101] Specifically, assuming that the transmission delay of the first burst in a service is T1, the network device can control the transmission delays of other bursts in the service within [T1-jitter / 2, T1+jitter / 2] by allocating appropriate transmission resources to the other bursts, where jitter is the delay jitter budget of the service.

[0102] Taking the minimum granularity of the time domain of the transmission resource allocated by the network device as 1 ms and the jitter as 2 ms as an example, an example is illustrated in combination with FIG. 4. Referring to FIG. 4, the first burst (denoted as: burst 1) in a service arrives at the terminal at t0, the terminal requests the transmission resource for the burst 1 at t0, and the end time of the transmission resource allocated by the network device for the burst 1 is t2. It can be seen that the transmission delay of the burst 1 is 5 ms. Then, the transmission delay of other bursts in the service should be within [4 ms, 6 ms]. Taking the second burst (denoted as: burst 2) as an example, assuming that the buffer duration of the burst 2 is 1 ms, that is, the time experienced by the terminal from the first packet / byte / bit of the burst 2 to the last packet / byte / bit of the burst 2 arriving at the terminal is 1 ms, and the terminal requests the transmission resource for the burst 2 at t1 (t1 is also the time when the last packet / byte / bit of the burst 2 arrives at the terminal). Then, the end position of the transmission resource of the burst 2 should be the time corresponding to 3 ms after t1 (that is, t3 in the figure), or the time corresponding to 4 ms after t1 (that is, t4 in the figure), or the time corresponding to 5 ms after t1 (that is, t5 in the figure). It should be understood that t2 in FIG. 4 is actually the start time of the transmission resource allocated by the network device for the burst 2.

[0103] It should be understood that only the first burst and the second burst of the service are taken as examples in FIG. 4 to illustrate how the network device allocates the transmission resource. For other bursts in the service, the transmission resource allocation can be performed in the manner of allocating the transmission resource for the second burst, as long as the transmission delay of the other bursts in the service is controlled within [T1-jitter / 2, T1+jitter / 2].

[0104] It has been clearly defined in the related art that one service corresponds to one logical channel (LCH), that is, the data of the service arriving at the terminal will be buffered in the logical channel corresponding to the service. If the data buffered in the logical channel corresponding to the service is transmitted on the transmission resource allocated based on the burst-based transmission resource allocation scheme described above, it can not be possible to guarantee that the transmission delay of each burst in the service is within a certain range, that is, it cannot guarantee the deterministic delay / transmission.

[0105] For example, in one case, the transmission resource allocated for burst 1 in FIG. 4 can transmit data of an amount greater than that of burst 1, and the terminal can transmit data of other bursts in the transmission resource allocated for burst 1. For example, the transmission resource allocated for burst 1 can transmit 100M data, and the data amount of burst 1 is 80M, and the terminal can transmit 20M data of other bursts in the transmission resource allocated for burst 1. If the data amount of burst 2 is less than or equal to 20M, the data of burst 2 will be transmitted in the transmission resource allocated for burst 1, resulting in that the transmission delay of burst 2 cannot be guaranteed within a certain range due to the transmission of data of burst 2 earlier. In another case, the transmission resource allocated for burst 1 in FIG. 4 can transmit data of an amount less than that of burst 1, and the terminal can transmit the data of burst 1 in the transmission resource allocated for burst 2, so that the transmission delay of burst 1 cannot be guaranteed within a certain range.

[0106] In summary, the scheme of one service corresponding to one logical channel in the related art is not applicable to the scheme of allocating transmission resources based on bursts provided in the foregoing of the present application. Therefore, the present application provides two communication methods, in which one service can correspond to multiple logical channels, and by mapping the messages of the service into the logical channels according to the correspondence between the logical channels and the messages and transmitting through the corresponding transmission resources, the deterministic delay can be guaranteed.

[0107] The two communication methods provided by the present application can be applied to the architecture provided in FIG. 5. FIG. 5 is a protocol stack architecture diagram of a terminal provided by the present application. Referring to FIG. 5, a module, for example, a shaping module in the embodiment of the present application, can be added in the existing protocol stack. The main functions of the shaping module include burst identification and message buffering, resource reservation and logical channel mapping, which are described below.

[0108] (1) Burst identification and message buffering.

[0109] The burst identification refers to identifying which packet belongs to which burst, or which packets belong to a burst. For example, the last packet in a burst can carry an identification information indicating that the packet is the last packet of the burst. In this example, the shaping module considers the first packet after the packet carrying the identification information to the packet carrying the identification information again and the packets therebetween as belonging to a burst. For example, the shaping module considers the packets received in a certain time period as belonging to a burst. In this example, assuming that the certain time period is 30 ms, the packets received within 30 ms from the time of receiving the first packet belong to one burst, and the packets received within 30 ms from the end of the 30 ms belong to another burst. For example, each packet can carry an identification information indicating the burst to which the packet belongs. In this example, the packets belonging to a burst can be determined according to the identification information. It should be understood that any reasonable way of identifying a burst can be used, and the application does not limit the way of identifying a burst.

[0110] For example, the embodiments of the application also do not limit the order of burst identification and packet buffering, and the two can be performed simultaneously or one can be performed first and the other can be performed second.

[0111] (2) Resource reservation

[0112] The resource reservation refers to requesting transmission resources from a network device based on a burst. If all the packets / bytes / bits of a burst are received at a time, transmission resources can be requested from the network device at the time. For example, the terminal can carry parameters such as the data volume of the burst when requesting transmission resources, and the network device allocates appropriate transmission resources to the terminal according to the request of the terminal to achieve deterministic transmission of the terminal. It should be understood that the network device can allocate transmission resources to each burst based on the scheme described in FIG. 4, for example.

[0113] (3) Logical channel mapping: mapping the packets of a service to a logical channel according to the correspondence between the logical channel and the packet. This part will be described in detail in the method embodiment below.

[0114] In one example, referring to the protocol stack shown in FIG. 5, the shaping module is located before the logical channel (Logical, LCH). It should be noted that the application does not limit the location of the shaping module in the protocol stack, for example, the shaping module can also be part of the logical channel.

[0115] In one example, the shaping module can belong to the MAC layer, or the shaping module can belong to the RLC layer. Alternatively, the shaping module does not belong to the MAC layer or the RLC layer.

[0116] Referring to FIG. 5, the protocol stack shown in FIG. 5 includes an SDAP layer and a PDCP layer. It should be understood that although the physical layer is not shown in FIG. 5, it should be understood that the protocol stack of the terminal can also include the physical layer.

[0117] The SDAP layer is mainly responsible for QoS flow processing. Specifically, the functions of the SDAP layer mainly include: transmitting user plane data, performing QoS flow to data radio bearer (DRB) mapping for uplink and downlink data, marking QoS flow identifiers (IDs) in uplink and downlink data packets, and performing reflective QoS flow to DRB mapping for uplink SDAP data.

[0118] The PDCP layer accesses the transmission service of the RLC layer through the RLC channel and provides DRB (to the SDAP, user plane) and signaling radio bearer (SRB) (to the radio resource control (RRC), signaling plane) service access points to the upper layer. The PDCP mainly has three functions: header compression, encryption / integrity protection, and sequencing. The header compression is Comp shown in FIG. 5; the encryption / integrity protection is the security function shown in FIG. 5.

[0119] Modules for processing segmentation and automatic repeat reQuest (ARQ) are also shown in FIG. 5. Based on ARQ, retransmission processing can be performed. For example, the modules for segmentation and ARQ can belong to the RLC layer, but the present application is not limited thereto.

[0120] Modules for processing scheduling, multiplexing (multiplexing of logical channels), and hybrid automatic repeat reQuest (HARQ) are also shown in FIG. 5. For example, these modules can be located in the MAC layer, but the present application is not limited thereto.

[0121] The physical layer can be responsible for processing encoding and decoding, modulation and demodulation, multi-antenna mapping, and other telecommunication physical layer functions. The physical layer provides services to the MAC layer in the form of transport channels.

[0122] More details about the functions of the layers shown in FIG. 6 can be referred to the related art, which will not be repeated here. In addition, it should be noted that the shaping module can also be named as other names. In addition, the protocol stack shown in FIG. 6 is only an example of the protocol stack of the terminal, and the name of each protocol layer of the terminal is not limited by the present application. The protocol layer or protocol entity performing / completing similar functions can have different names in different technologies. In addition, the terminal can also include more or less protocol layers than the protocol layers shown in FIG. 6.

[0123] The two communication methods provided in the present application are described in detail below.

[0124] In the present application, "sending information" can be understood as that a device sends information to another device, or can also be understood as that a logical module in a device sends information to another logical module. For example, "the network device sends information" can be understood as that the network device sends information to another device (such as a terminal), or can be understood as that a logical module 1 in the network device sends information to a logical module 2 in the network device.

[0125] In the present application, "receiving information" can be understood as that a device receives information from another device, or can also be understood as that a logical module in a device receives information from another logical module. For example, "the network device receives information" can be understood as that the network device receives information from another device (such as a terminal), or can be understood as that a logical module 1 in the network device receives information from a logical module 2 in the network device.

[0126] In the present application, "sending information to (for example, a terminal)" or the related illustration in the drawings can be understood as that the destination of the information is the terminal. It can include directly or indirectly sending information to the terminal. "Receiving information from (for example, a terminal)" or "receiving information sent by (for example, a terminal)" or "receiving information (for example, a terminal)", or the related illustration in the drawings can be understood as that the source of the information is the terminal, which can include directly or indirectly receiving information from the terminal. The information can be processed as necessary between the source and the destination of the information, such as format change, etc., but the destination can understand the valid information from the source. Similar expressions in the present application can be understood similarly, which will not be repeated here.

[0127] The terminal and the network device are taken as the execution subject of the interaction in the embodiments of the method of the present application, but it should be understood that the execution subject is not limited in the present application. For example, the terminal can also be a module applied to the terminal, such as a circuit, a chip, a chip system or a processor, and can also be a logic node, a logic module or software capable of realizing all or part of the terminal function; the network device can also be a module applied to the network device, such as a circuit, a chip, a chip system or a processor, and can also be a logic node, a logic module or software capable of realizing all or part of the network device function.

[0128] FIG. 6 is a schematic flow chart of a communication method provided by an embodiment of the present application. The method 200 includes S210 and S220, and each step is described below.

[0129] In S210, the terminal maps data of a burst to M logical channels according to a first resource allocated by a network device for the burst, where M is a positive integer.

[0130] The burst can be any burst of a first service, and the first service can be any service. For example, the first service can be an XR service or a service similar to the XR service. After the burst arrives at the terminal, the terminal can request transmission resources for the burst, and the network device allocates a first resource for the burst according to the request of the terminal. The first resource can be a time-frequency resource or a time domain resource. The first resource occupies M time units, which can be continuous or discontinuous. After the terminal learns the first resource, the terminal can map data of the burst to M logical channels. The amount of data mapped to the i th logical channel in the M logical channels in the burst is determined by the amount of data that can be transmitted by the resource of the i th time unit in the M time units of the first resource, where i is a positive integer.

[0131] In one example, the time unit can be the smallest unit (or minimum granularity) of the time domain resource allocated by the network device. For example, the time unit can be a symbol, a slot, a subframe, a half frame or a frame.

[0132] In this example, taking time unit 1 and time unit 2 of the M time units as an example, the transmission resource allocated by the network device for the burst is composed of resource A occupying time unit 1 and resource B occupying time unit 2, and the resource of the first resource on the i th time unit of the M time units is described. Wherein, if the first resource is a time-frequency resource, the first resource is resource A and resource B, the resource of the first resource on the 1 th time unit (i.e. time unit 1) of the 2 (M=2) time units is resource A, and the resource of the first resource on the 2 th time unit (i.e. time unit 2) of the 2 time units is resource B. If the first resource is a time domain resource, the first resource is time unit 1 and time unit 2, the resource of the first resource on the 1 th time unit (i.e. time unit 1) of the 2 (M=2) time units is the resource occupying time unit 1 in the transmission resource allocated by the network device for the burst, that is, resource A, and the resource of the first resource on the 2 th time unit (i.e. time unit 2) of the 2 time units is the resource occupying time unit 1 in the transmission resource allocated by the network device for the burst, that is, resource B.

[0133] In one example, the time unit is a basic scheduling unit (or also can be referred to as a scheduling time unit or a scheduling time unit, etc.) of the network device. For example, the basic scheduling unit can be a time slot, a mini time slot, a subframe, a TTI, etc.

[0134] In this example, the first resource occupying M time units can mean that the time domain resource corresponding to the first resource belongs to M time units. For example, the first resource occupies 5 symbols, and the first resource occupying M time units can mean that the 5 symbols occupied by the first resource belong to M time units. For example, the first 3 symbols of the 5 symbols belong to time slot 1, and the last 2 symbols belong to time slot 2, then the first resource occupies time slot 1 and time slot 2. Further, assuming that the transmission resource allocated by the network device for the burst is composed of resource A and resource B, wherein resource A occupies the first 3 symbols in the time domain, and resource B occupies the last 2 symbols in the time domain, then the resource of the first resource on the 1 th time unit (i.e. time slot 1) of the 2 (M=2) time units is resource A, and the resource of the first resource on the 2 th time unit (i.e. time slot 2) of the 2 time units is resource B.

[0135] For example, the amount of data that the first resource on the i-th time unit of the M time units can transmit can be determined according to the size of the first resource on the i-th time unit. For example, the amount of data that the first resource on the i-th time unit can transmit can be determined according to the number of subcarriers, the bandwidth, the number of resource blocks (RBs), and the like of the first resource on the i-th time unit. How to determine the amount of data that a resource can transmit can refer to related technologies, and will not be described in detail here. It can be understood that the amount of data in the burst mapped to the M logical channels can be greater than, less than, or equal to the amount of data in the burst.

[0136] In the embodiment of the present application, if the first resource allocated for the burst occupies M time units, the burst can be mapped to M logical channels.

[0137] For example, FIG. 7 shows an example of the first resource and the correspondence between the packet and the logical channel. Referring to FIG. 7, the first resource occupies 3 time units, i.e., M = 3, and the 3 time units are time unit 2, time unit 4, and time unit 5. The burst is burst 1, and the packet of burst 1 is mapped to 3 logical channels, i.e., logical channel 1, logical channel 2, and logical channel 3. Among them, the amount of data in burst 1 mapped to logical channel 1 is determined by the amount of data that the first resource on time unit 2 can transmit, i.e., determined by resource block 1 shown in the figure; the amount of data in burst 1 mapped to logical channel 2 is determined by the amount of data that the first resource on time unit 4 can transmit, i.e., determined by resource block 2 shown in the figure; and the amount of data in burst 1 mapped to logical channel 3 is determined by the amount of data that the first resource on time unit 5 can transmit, i.e., determined by resource block 3 and resource block 4 shown in the figure. For example, each resource block can carry 20M of data, then 40M of data in burst 1 can be mapped to logical channel 1, 20M of data in burst 1 can be mapped to logical channel 2, and 20M of data in burst 1 can be mapped to logical channel 3.

[0138] The present application does not limit how any of the M logical channels specifically maps which data in the burst (e.g., burst 1) to. For example, the data in the burst can be mapped to the M logical channels in the order of arrival of the data in the burst, or the data in the burst can be randomly mapped to the M logical channels regardless of the order of arrival of the data in the burst. In addition, assuming that the first resource can transmit a first amount of data, in the case that the amount of data that the first resource can transmit is greater than or less than the amount of data in the burst, the present application does not limit how the first amount of data is obtained based on the data in the burst to be mapped to the M logical channels. For example, in the example shown in FIG. 7, if the amount of data in the burst is 100M, 80M of the 100M of data can be selected, and then the 80M of data can be mapped to the three logical channels in the order of arrival of the 80M of data. If the amount of data in the burst is 60M, 20M of the 60M of data can be copied, and the 20M of data and the 60M of data together form 80M of data, and then the 80M of data can be mapped to the three logical channels in the order of arrival of the 80M of data.

[0139] S220, the terminal transmits the data in the i th logical channel in the i th time unit. Correspondingly, the network device receives the data in the i th logical channel in the i th time unit.

[0140] For example, in the example shown in FIG. 7, the terminal transmits the data of logical channel 1 in time unit 2, transmits the data of logical channel 2 in time unit 4, and transmits the data of logical channel 3 in time unit 5.

[0141] It should be understood that if the time unit is the basic scheduling unit of the network device, transmitting the data in the i th logical channel in the i th time unit means transmitting the data in the i th logical channel on the resource of the first resource in the i th time unit.

[0142] According to the method provided in the present application, the terminal can map the data in the burst to at least one logical channel according to the transmission resource allocated by the network device for the burst, and by transmitting the data in the logical channel in the corresponding time unit, the corresponding time unit can be ensured to transmit the data in the corresponding logical channel, so as to control the transmission delay of the burst within a certain range and improve the user experience.

[0143] In a possible implementation, each burst can correspond to at least one logical channel, and the logical channels corresponding to any two bursts can be different. The data of a burst is mapped to the at least one logical channel corresponding to the burst. In this scheme, the mapping relationship between the burst and the logical channel is relatively simple.

[0144] For example, referring to FIG. 7, the packet of the burst 2 of the first service can be mapped to the logical channel 4, the data amount of the burst 2 mapped to the logical channel 4 is determined by the data amount that the resource block 5 can transmit, and the data in the logical channel 4 will be transmitted in the time unit 4.

[0145] In a possible implementation, each time unit can correspond to one logical channel. Then, according to the time unit occupied by a burst, the burst can be mapped to the logical channel corresponding to the time unit occupied by the burst. In this design, if the resources allocated for multiple bursts include the same time domain resource, at least part of the data in the multiple bursts will be mapped to the same time domain resource.

[0146] In a possible implementation, the M logical channels belong to the R logical channels corresponding to the first service to which the burst belongs. That is, the first service corresponds to R logical channels, and the data of any burst of the first service is mapped to part or all of the R logical channels. Wherein, R≥ceil (transmission delay of the first burst of the first service / length of the time unit), and ceil represents rounding up.

[0147] For example, the transmission delay of the first burst is 5 ms, and the length of the time unit is 1 ms, so R≥5. For example, in the example shown in FIG. 7, the ending time of the transmission resource allocated by the network device for the first burst (i.e., burst 1) is t1, and the arrival time of the first burst is t0, so the transmission delay is t1-t0=5 ms, and R≥5.

[0148] In this implementation, R logical channels can be established for the first service, and then the data of the first service is mapped to the corresponding logical channel according to the correspondence between the R logical channels and the time units.

[0149] In one design, R=ceil (transmission delay of the first burst of the first service / length of the time unit). In another design, R=ceil (transmission delay budget of the first service / length of the time unit).

[0150] In one design, the correspondence between the time unit and the logical channel is that the nth %R logical channel in the R logical channels is used to carry the data of any burst of the first service mapped to the nth time unit. That is, if the resource allocated for a certain burst in the first service includes the resource occupying the nth time unit, the data in the burst is mapped in the nth %R logical channel in the R logical channels, and the data in the nth %R logical channel is transmitted in the nth time unit. Wherein, n is a positive integer, % represents the remainder, and the arrival time of the first burst in the first service is the first time unit (here, the starting time of the first time unit).

[0151] As mentioned above, the minimum value of R is ceil (transmission delay of the first burst of the first service / length of the time unit). Assuming that the transmission delay of the first burst of the first service is 5 ms and the length of the time unit is 1 ms, R = 5. It can be understood that if the arrival time of the first burst in the first service is the first time unit, the end time of the fifth time unit has already transmitted the data of the first burst in the first service, and therefore the first logical channel of the sixth time unit, the eleventh time unit, or the sixteenth time unit, etc. has been empty, and therefore the first logical channel can be mapped to the data transmitted in the sixth time unit, the eleventh time unit, or the sixteenth time unit, etc. of the first service.

[0152] This scheme can limit the number of logical channels established for the first service within a certain range, reduce the number of logical channels, and save resources. It should be understood that the scheme of R = ceil (transmission delay budget of the first service / length of the time unit) can further reduce the number of required logical channels, thereby further saving resources and reducing the processing complexity of the terminal.

[0153] For example, FIG. 8 shows another example of the correspondence between the time unit and the logical channel. In the example shown in FIG. 8, the transmission delay budget PDB of the first service is 10 ms, the transmission delay of burst 1 is 5 ms, the length of the time unit is 1 ms, and R = ceil (transmission delay budget of the first service / length of the time unit) = 10. Then, logical channel 1 can carry data mapped to time unit 1, time unit 11, time unit 21, etc. transmitted; logical channel 2 can carry data mapped to time unit 2, time unit 12, time unit 22, etc. transmitted; logical channel 3 can carry data mapped to time unit 3, time unit 13, time unit 23, etc. transmitted;...; logical channel 10 can carry data mapped to time unit 10, time unit 20, time unit 30, etc. transmitted. Referring to FIG. 8, the data of burst 1 (the first burst) will be mapped to logical channel 2, logical channel 4, and logical channel 5; the data of burst 2 (the second burst) will be mapped to logical channel 4 and logical channel 7; the data of burst 3 (the third burst) will be mapped to logical channel 7 and logical channel 8;...; the data of burst N (the Nth burst) will be mapped to logical channel 6 and logical channel 7; the data of burst N+1 (the N+1th burst) will be mapped to logical channel 8.

[0154] For example, FIG. 9 shows an example of the correspondence between time units and logical channels. In the example shown in FIG. 9, the transmission delay budget PDB of the first service is 10 ms, burst 1 is the first burst of the first service, the transmission delay of burst 1 is 5 ms, the length of a time unit is 1 ms, and R = ceil (transmission delay of the first burst of the first service / length of a time unit) = 5. Then, logical channel 1 can carry data transmitted in time units 1, 6, 11, 16, and the like, logical channel 2 can carry data transmitted in time units 2, 7, 12, 17, and the like, logical channel 3 can carry data transmitted in time units 3, 8, 13, 18, and the like, logical channel 4 can carry data transmitted in time units 4, 9, 14, 19, and the like, and logical channel 5 can carry data transmitted in time units 5, 10, 15, 20, and the like. Referring to FIG. 9, the data of burst 1 will be mapped to logical channel 2, logical channel 4, and logical channel 5; the data of burst 2 (the second burst) will be mapped to logical channel 4 and logical channel 2; the data of burst 3 (the third burst) will be mapped to logical channel 2 and logical channel 3;...; the data of burst N (the Nth burst) will be mapped to logical channel 1 and logical channel 2; and the data of burst N+1 (the (N+1)th burst) will be mapped to logical channel 3.

[0155] In summary, based on the transmission resources allocated by the network device for the terminal being within a certain range, the terminal can determine the logical channel to which a burst is mapped based on the time units occupied by the transmission resources allocated by the network device for the burst, and by mapping the burst to the corresponding logical channel, the data in the corresponding logical channel can be transmitted in the corresponding time unit, thereby ensuring that the transmission delay of the burst is controlled within a certain range, i.e., ensuring deterministic transmission and improving user experience.

[0156] FIG. 10 is one specific example of the method 200 provided in FIG. 6. The method 300 provided in FIG. 10 can include S310 to S360, which are briefly described below.

[0157] S310, the terminal establishes R logical channels corresponding to the first service.

[0158] For example, R = ceil (transmission delay of the first burst of the first service / length of a time unit). Alternatively, R = ceil (transmission delay budget of the first service / length of a time unit).

[0159] For example, S310 can be performed when / at the terminal receives the first burst of the first service, or when / at the terminal receives the first packet / byte / bit of the first service, or when / at the terminal obtains the transmission delay of the first burst of the first service or the transmission delay budget of the first service. It should be understood that the application does not limit the timing of performing S310, such as S310 can be performed before the terminal maps the first burst of the first service to the logical channel. In addition, S310 can be performed only once, such as only performed once before the terminal maps the first burst of the first service to the logical channel, and then can no longer be performed.

[0160] S320, after the terminal receives the packet of the first service, the terminal identifies and buffers the packet.

[0161] This step can be performed by the shaping module, and for this step, reference can be made to the foregoing description of FIG. 5.

[0162] S330, after the terminal receives a certain burst (for example, denoted as burst X), the terminal sends resource request information to the network device, and the resource request information is used to request the network device to allocate transmission resources for burst X.

[0163] S340, the network device sends resource indication information to the terminal according to the resource request information. The resource indication information indicates the transmission resources (for example, denoted as transmission resources X) allocated for burst X.

[0164] S350, the terminal maps burst X to the R logical channels according to the time unit occupied by transmission resources X and the correspondence between the time unit and the R logical channels. The correspondence between the time unit and the R logical channels is that the nth logical channel in the R logical channels is used to carry data transmitted by any burst in the first service mapped to the nth time unit.

[0165] S360, the terminal transmits data in the nth logical channel in the nth time unit. Correspondingly, the network device receives data in the nth logical channel in the nth time unit.

[0166] For example, R = ceil (transmission delay of the first burst of the first service / length of the time unit), burst X is burst 2, and transmission resources X are shown in FIG. 9, then the data of burst 2 will be mapped to logical channel 4 and logical channel 2, and the data in logical channel 4 will be transmitted in time unit 4, and the data in logical channel 2 will be transmitted in time unit 7.

[0167] It should be understood that the same concepts or operations as described above in the method 300 can be referred to the foregoing description, and the method 300 will not be described again.

[0168] According to the method 800 provided in FIG. 10, the terminal can first establish a logical channel corresponding to a service, then request a transmission resource from the network device based on a burst, and determine a logical channel to which the burst is mapped based on a time unit occupied by the transmission resource allocated to the burst by the network device. By mapping the burst to the corresponding logical channel, it can be ensured that the corresponding time unit transmits data in the corresponding logical channel, thereby realizing that the transmission delay of the burst is controlled within a certain range and improving user experience.

[0169] FIG. 11 is a schematic flowchart of another communication method provided by an embodiment of the present application. The method 400 includes S410 and S420, and each step is described below.

[0170] S410, mapping first data of a burst into a logical channel according to an arrival time of the first data.

[0171] The first data can be any packet / byte / bit of the burst. The logical channel is used to carry data in a first service to which the burst belongs and whose arrival time is within a first time period, that is, data in the first service and whose arrival time is within the first time period is mapped into the logical channel. The length of the first time period is the delay jitter requirement of the first service. For example, if the delay jitter requirement of the first service is 2 ms, the length of the first time period is 2 ms. The amount of data in the burst mapped into the logical channel is determined by the amount of data that can be transmitted by a first transmission resource allocated to the burst by the network device, and the first transmission resource is located at a first time. For example, the first time = the start time of the first time period + the transmission delay of the first burst in the first service.

[0172] For example, the first transmission resource occupies a minimum unit of a time domain resource or a basic scheduling unit. The minimum unit of the time domain resource and the basic scheduling unit can be referred to the description in the method 200, which will not be repeated here. Alternatively, the first time can be a time domain resource or a basic scheduling unit occupied by the first transmission resource.

[0173] For example, the amount of data that can be transmitted by the first transmission resource can be determined according to the size of the first transmission resource. How to determine the amount of data that can be transmitted by the transmission resource according to the size of the transmission resource can be referred to the description of related technologies, which will not be described in detail here.

[0174] S420, transmitting data in the logical channel at the first time.

[0175] For example, FIG. 12 shows an example of the correspondence between the arrival time of data and a logical channel. Referring to FIG. 12, it is assumed that the delay jitter requirement of the first service is 2 ms, logical channel 1 can be mapped to data arriving in the period [0 ms, 2 ms), logical channel 2 can be mapped to data arriving in the period [2 ms, 4 ms), and logical channel 3 can be mapped to data arriving in the period [4 ms, 6 ms). If the first data arrives at 0.5 ms, the first data is mapped to logical channel 1. It is assumed that the first data belongs to burst 1, and the transmission resource allocated for burst 1 is at 5 ms, the data in logical channel 1 is sent at 5 ms. The delay jitter requirement of the first service is 2 ms, the data in logical channel 2 is sent at 7 ms, and the data in logical channel 3 is sent at 9 ms.

[0176] According to the method provided in the embodiments of the present application, data can be mapped to a corresponding logical channel according to the arrival time of the data. Since the data mapped by the logical channel meets the delay jitter requirement of the service, by sending the data in the logical channel at the time when the transmission resource of the burst to which the data belongs is in the network device, the transmission delay of the burst can be controlled within a certain range, and the user experience can be improved.

[0177] In one example, [a, b) in the present application can be replaced by: the start time of a to the end time of b-1. For example, a is 0 ms, and b is 2 ms.

[0178] In one example, [a, b) in the present application can be replaced by: [a, b]. Wherein, b=a+2, for example, a is 0 ms, and b is 2 ms.

[0179] It should be understood that the data with the arrival time belonging to [a, b] will be sent at t, t=a+the transmission delay of the first burst in the first service.

[0180] In one example, [a, b) in the present application can be replaced by: [slot c, slot (c+the delay jitter requirement of the first service / slot length)].

[0181] It should be understood that the data with the arrival time belonging to [slot c, slot (c+the delay jitter requirement of the first service / slot length)] will be sent at slot (c+the transmission delay of the first burst in the first service / slot length).

[0182] In a possible implementation, the logical channel belongs to R logical channels corresponding to the first service, R≥ceil(the transmission delay of the first burst in the first service / jitter), ceil represents rounding up, and jitter is the delay jitter budget of the first service.

[0183] For example, the transmission delay of the first burst is 5 ms, and jitter = 2 ms, so R > 3.

[0184] In this implementation, R logical channels can be established for the first service, and then the data of the first service is mapped into the corresponding logical channel according to the correspondence between the R logical channels and the arrival time of the data.

[0185] In one design, R = ceil (transmission delay budget of the first service / jitter). In another design, R = ceil (transmission delay of the first burst of the first service / jitter).

[0186] In one design, the correspondence between the arrival time of the data and the logical channel is as follows: the i th logical channel of the R logical channels is used to map the data arriving at the time of [(i-1) jitter + k*PDB, jitter*i + k*PDB) in the first service, and PDB is the transmission delay budget of the first service. Wherein, R > ceil (PDB / jitter), i is a positive integer, k is an integer, and the arrival time of the first burst of the first service is the 0 th time. Wherein, the terminal sends the data arriving at the time of [(i-1) jitter + k*PDB, jitter*i + k*PDB) in the i th logical channel at t1 = (i-1) jitter + k*PDB + the transmission delay of the first burst of the first service.

[0187] In this design, the minimum value of R is ceil(PDB / jitter). Assuming PDB=10ms and jitter=2ms, the minimum value of R is 5. Taking R=5 as an example, referring to an example shown in FIG. 13, in the first logical channel, data arriving at time [0ms, 2ms), [10ms, 12ms), [20ms, 22ms), [30ms, 32ms), etc. of the first service can be mapped; in the second logical channel, data arriving at time [2ms, 4ms), [12ms, 14ms), [22ms, 24ms), [32ms, 34ms), etc. of the first service can be mapped; in the third logical channel, data arriving at time [4ms, 6ms), [14ms, 16ms), [24ms, 26ms), [34ms, 36ms), etc. of the first service can be mapped; in the fourth logical channel, data arriving at time [6ms, 8ms), [16ms, 18ms), [26ms, 28ms), [36ms, 38ms), etc. of the first service can be mapped; and in the fifth logical channel, data arriving at time [8ms, 10ms), [18ms, 20ms), [28ms, 30ms), [38ms, 40ms), etc. of the first service can be mapped. Taking the first logical channel as an example, data arriving at time [0ms, 2ms) of the first service will be sent at the 5th ms, and therefore the first logical channel will be empty after the 5th ms, so that data arriving at time [10ms, 12ms) of the first service can be mapped in the first logical channel. Similarly, data arriving at time [10ms, 12ms) of the first service will be sent at the 15th ms, and therefore the first logical channel will be empty after the 15th ms, so that data arriving at time [20ms, 22ms) of the first service can be mapped in the first logical channel.

[0188] In another design, the correspondence between the arrival time of data and the logical channel is as follows: the i-th logical channel among the R logical channels is used to map the data in the first service that arrives at the time [(i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter), jitter*i+jitter*k*ceil(transmission delay of the first burst of the first service / jitter)], where R≥ceil(transmission delay of the first burst of the first service / jitter), i is a positive integer, k is an integer, and the arrival time of the first burst of the first service is time 0. The terminal transmits the data in the i-th logical channel that arrives at the time [(i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter), jitter*i+jitter*k*ceil(transmission delay of the first burst of the first service / jitter)] at time t2, where t2=(i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter)+transmission delay of the first burst of the first service.

[0189] In this design, the minimum value of R is ceil(transmission delay of the first burst of the first service / jitter). Assuming that the transmission delay of the first burst of the first service is 5 ms and jitter=2 ms, the minimum value of R is 3. Taking R=3 as an example, referring to the example shown in FIG. 14, the data in the first service that arrives at time [0 ms, 2 ms), [6 ms, 8 ms), [12 ms, 14 ms), [18 ms, 20 ms), etc. can be mapped in the first logical channel; the data in the first service that arrives at time [2 ms, 4 ms), [8 ms, 10 ms), [14 ms, 16 ms), [20 ms, 22 ms), etc. can be mapped in the second logical channel; and the data in the first service that arrives at time [4 ms, 6 ms), [10 ms, 12 ms), [16 ms, 18 ms), [22 ms, 24 ms), etc. can be mapped in the third logical channel. Taking the first logical channel as an example, the data in the first service that arrives at time [0 ms, 2 ms) will be transmitted at time 5 ms, and thus the first logical channel will be empty after time 5 ms, so that the data in the first service that arrives at time [6 ms, 8 ms) can be mapped in the first logical channel. Similarly, the data in the first service that arrives at time [6 ms, 8 ms) will be transmitted at time 11 ms, and thus the first logical channel will be empty after time 11 ms, so that the data in the first service that arrives at time [12 ms, 14 ms) can be mapped in the first logical channel.

[0190] In a possible implementation, before mapping the data of the first service arriving at the (i-1)jitter+k*PDB time to the i th logical channel, the data of the first service arriving at the [(i-1)jitter+(k+1)*PDB, jitter*i+(k+1)*PDB) time in the i th logical channel is emptied.

[0191] Generally, at the (i-1)jitter+(k+1)*PDB time, the data in the i th logical channel has been sent completely. In order to avoid the case that there is still data in the i th logical channel at the (i-1)jitter+(k+1)*PDB time due to other reasons, the i th logical channel can be emptied first, so as to further guarantee the deterministic delay of the first service.

[0192] In a possible implementation, before mapping the data of the first service arriving at the [(i-1)jitter+jitter*(k+1)*ceil(transmission delay of the first burst of the first service / jitter), jitter*i+jitter*(k+1)*ceil(transmission delay of the first burst of the first service / jitter)] time to the i th logical channel, the data of the first service arriving at the [(i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter), jitter*i+jitter*k*ceil(transmission delay of the first burst of the first service / jitter)] time in the i th logical channel is emptied.

[0193] Generally, at the (i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter) time, the data in the i th logical channel has been sent completely. In order to avoid the case that there is still data in the i th logical channel at the (i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter) time due to other reasons, the i th logical channel can be emptied first, so as to further guarantee the deterministic delay of the first service.

[0194] The method 400 is described by taking the arrival time of the first burst of the service as the 0 th time. It should be understood that the arrival time of the first burst of the first service can also be taken as the 1 st time, for example. Correspondingly, equivalent transformations of the related content are also made. These equivalent transformation schemes should also fall within the protection scope of the present application.

[0195] FIG. 15 is one specific example of the method 400 provided in FIG. 13. The method 500 provided in FIG. 15 can include S510-S560, which are briefly described as follows.

[0196] S510, the terminal establishes R logical channels corresponding to the first service.

[0197] For example, R = ceil(PDB / jitter). Or, R = ceil(transmission delay of the first burst of the first service / jitter).

[0198] For example, S510 can be performed when / at the time the terminal receives the first burst of the first service, or when / at the time the terminal receives the first packet / byte / bit of the first service, or when / at the time the terminal obtains the transmission delay of the first burst of the first service or the transmission delay budget of the first service. It should be understood that the application does not limit the timing of performing S510, for example, S510 can be performed before the terminal maps the first packet / byte / bit of the first service to the logical channel. In addition, S510 can be performed only once, for example, only before the terminal maps the first packet / byte / bit of the first service to the logical channel, and then it can not be performed again.

[0199] S520, after the terminal receives a packet of the first service, the terminal identifies and buffers the packet.

[0200] For this step, please refer to the foregoing description of FIG. 5.

[0201] S530, after receiving a certain burst (for example, denoted as burst X), the terminal sends resource request information to the network device, and the resource request information is used to request the network device to allocate transmission resources for burst X.

[0202] S540, the network device sends resource indication information to the terminal according to the resource request information, and the resource indication information indicates the transmission resources (for example, denoted as transmission resources X) allocated for burst A.

[0203] S550, the terminal maps the data in the first service to the R logical channels according to the arrival time of the data in the first service and the correspondence between the arrival time of the data and the R logical channels.

[0204] In Example 1, the correspondence between the arrival time of the data and the R logical channels is that the i-th logical channel in the R logical channels is used to map the data in the first service that arrives at the time [(i-1)jitter+k*PDB, jitter*i+k*PDB).

[0205] In Example 2, the correspondence between the arrival time of the data and the R logical channels is that the i-th logical channel of the R logical channels is used to map the data arriving at the time of [(i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter), jitter*i+jitter*k*ceil(transmission delay of the first burst of the first service / jitter)] of the first service.

[0206] S560, the terminal transmits the data in the i-th logical channel at the corresponding time.

[0207] For example, for Example 1 described above, the terminal transmits the data arriving at the time of [(i-1)jitter+k*PDB, jitter*i+k*PDB) of the i-th logical channel at t1. Wherein, t1=(i-1)jitter+k*PDB+transmission delay of the first burst of the first service.

[0208] For example, for Example 2 described above, the terminal transmits the data arriving at the time of [(i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter), jitter*i+jitter*k*ceil(transmission delay of the first burst of the first service / jitter)] of the i-th logical channel at t2. Wherein, t2=(i-1)jitter+jitter*k*ceil(transmission delay of the first burst of the first service / jitter)+transmission delay of the first burst of the first service.

[0209] It should be understood that the same concepts or operations as those described above appearing in the method 500 can be referred to the description above, and will not be repeated here.

[0210] According to the method 500 provided in FIG. 15, the terminal can first establish the logical channel corresponding to the service, then request the transmission resource from the network device based on the burst, and map the data to the corresponding logical channel for transmission based on the mapping relationship between the arrival time of the data and the logical channel and the transmission resource allocated by the network device for the burst. The method can ensure that the data in the corresponding logical channel is transmitted at the corresponding time, so as to control the transmission delay of the burst within a certain range and improve the user experience.

[0211] The above describes the method provided by the present application, and the device provided by the present application is described below.

[0212] FIG. 16 shows a possible exemplary block diagram of a communication apparatus involved in the embodiments of the present application. As shown in FIG. 16, the communication apparatus 1600 can include modules or units for implementing the above-described method embodiments. In one possible design, the communication apparatus 1600 includes a processing unit 1602 and a communication unit 1603. Optionally, the communication apparatus 1600 can further include a storage unit 1601 for storing apparatus program code and / or data.

[0213] The communication apparatus 1600 can be a terminal-side apparatus in the above-described embodiments, for example, a terminal or a communication module in a terminal, or a circuit or chip responsible for communication functions in a terminal.

[0214] For example, in one embodiment, the processing unit 1602 is configured to map data of a burst to M logical channels according to first resources allocated to the burst by a network device, where M is a positive integer, the first resources occupy M time units, and an amount of data mapped to an i th logical channel of the M logical channels in the burst is determined by an amount of data that can be transmitted by resources on an i th time unit of the first resources, where the i th time unit is an i th time unit of the M time units, and i is a positive integer. The communication unit 1603 is configured to transmit data in the i th logical channel on the i th time unit.

[0215] In one possible design, the M logical channels belong to R logical channels corresponding to a first service to which the burst belongs, where R ≥ ceil (a transmission delay of a first burst of the first service / a length of the time unit), and ceil represents rounding up.

[0216] In one possible design, an n th %R logical channel of the R logical channels is configured to carry data of the first service that is mapped to be transmitted on an n th time unit, where n is a positive integer, and % represents modulo, and a first time unit is an arrival time of a first burst of the first service.

[0217] In one possible design, R = ceil (a transmission delay of a first burst of the first service / a length of the time unit), or R = ceil (a delay budget of the first service / a length of the time unit).

[0218] For another example, in another embodiment, the processing unit 1602 is configured to map, according to an arrival time of first data of a burst, the first data into a logical channel, the logical channel being used to carry data of a first service to which the burst belongs and having an arrival time within a first time period, a length of the first time period being a jitter budget of the first service, an amount of data of the burst mapped into the logical channel being determined according to an amount of data that can be transmitted by a first transmission resource allocated by a network device for the burst, the first transmission resource being located in a first time unit. The communication unit 1603 is configured to transmit the data in the logical channel in the first time unit.

[0219] In a possible design, the logical channel belongs to R logical channels corresponding to the first service, R≥ceil (a transmission delay of a first burst of the first service / jitter), ceil denoting a ceiling function, and jitter being the jitter budget.

[0220] In a possible design, an i-th logical channel of the R logical channels is used to map data of the first service that arrives at a time of [(i-1)jitter+k*PDB, jitter*i+k*PDB), PDB being a delay budget of the first service, R≥ceil (PDB / jitter), i being a positive integer, and k being an integer, the arrival time of the first burst being time 0.

[0221] In a possible design, R=ceil (PDB / jitter).

[0222] In a possible design, an i-th logical channel of the R logical channels is used to map data of the first service that arrives at a time of [(i-1)jitter+jitter*k*ceil (a transmission delay of a first burst of the first service / jitter), jitter*i+jitter*k*ceil (a transmission delay of a first burst of the first service / jitter)], R≥ceil (a transmission delay of a first burst of the first service / jitter), i being a positive integer, k being an integer, and the arrival time of the first burst being time 0.

[0223] In a possible design, R=ceil (a transmission delay of a first burst of the first service / jitter).

[0224] In one possible design, when the communication device 1600 is a terminal or a communication module within a terminal, the function of the processing unit 1602 can be implemented by one or more processors. Specifically, the processor may include a modem chip, or a system-on-a-chip (SoC) or SIP chip containing a modem core. The function of the communication unit 1603 can be implemented by transceiver circuitry.

[0225] In one possible design, when the communication device 1600 is a circuit or chip in a terminal responsible for communication functions, such as a modem chip or a system-on-a-chip (SoC) or SIP chip containing a modem core, the function of the processing unit 1602 can be implemented by a circuit system in the aforementioned chip that includes one or more processors or processor cores. The function of the communication unit 1603 can be implemented by an interface circuit or data transceiver circuit on the aforementioned chip.

[0226] It is understood that the division of units in the above-described device is merely a logical functional division. One function can correspond to one functional unit, or two or more functions can be integrated into one functional unit. In actual implementation, all or some units can be integrated onto a single physical entity, or distributed across different physical entities. Furthermore, the aforementioned functional units can be implemented in hardware, software, or a combination of both. Whether a function is executed in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for specific applications, but such implementations should not be considered beyond the scope of this application.

[0227] In one example, the functional unit in any of the above devices may be one or more integrated circuits configured to implement the above methods, such as: one or more application-specific integrated circuits (ASICs), or one or more central processing units (CPUs), one or more microcontroller units (MCUs), one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these integrated circuit forms.

[0228] In one example, storage unit 1601 may include random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory and / or registers, etc.

[0229] Referring to FIG. 17, a structural schematic diagram of a terminal 1700 is provided according to an embodiment of the present application, which can correspond to the terminal shown in FIG. 1, and is used to implement the operation of the terminal in the above embodiments. As shown in FIG. 17, the terminal includes one or more antennas 1710, a radio frequency processing system 1720, and a processor system 1730.

[0230] In the downlink or sidelink direction, the radio frequency processing system 1720 receives radio frequency signals through the antenna 1710, and sends the signals processed by the radio frequency to the processor system 1730 for further processing. In the uplink or sidelink direction, the processor system 1730 performs signal processing on the information at the terminal side, and sends it to the radio frequency processing system 1720, which performs radio frequency processing on the signal and transmits it through the antenna 1710.

[0231] In one example, the radio frequency processing system 1720, as a communication interface of the terminal for external communication, can include a radio frequency front end 1721 (RFFE) and a radio frequency transceiver 1722. The RFFE 1721 is mainly used for one or more of shaping, passband selection, or gain processing of RF signals received by the antenna or RF signals to be sent through the antenna, and can include one or more of radio frequency switches, duplexers, filters, power amplifiers, antenna tuning, and low-noise amplifiers. The RFFE 1721 can be a circuit system composed of multiple discrete devices, or can be integrated and packaged in one or more chips. The radio frequency transceiver 1722 is used to process the RF signals received by the RFFE into baseband / intermediate frequency signals for the processor system 1730 to perform the next step of processing, and to process the baseband / intermediate frequency signals provided by the processor system 1730 into RF signals to send to the RFFE 1721. The baseband / intermediate frequency signals transmitted between the radio frequency transceiver 1722 and the processor system 1730 can be digital signals or analog signals. The radio frequency transceiver 1722 can be implemented by one or more chips, which are usually referred to as radio frequency chips (RFIC).

[0232] In one example, the processor system 1730 can include one or more processors for processing signals and for executing instructions. Optionally, the processor system 1730 can also include the memory 1736. In one example, the one or more processors include at least one baseband processor 1731 (also referred to as a modem processor). The memory 1736 is used for storing data and / or computer program instructions. Optionally, the processor system 1730 can also include one or more application processors 1732 for handling operation of the terminal's operating system and application layer. Optionally, the processor system 1730 can also include one or more of a voice subsystem 1733, a multimedia subsystem 1734, or an interface circuit 1735. The voice subsystem 1733 is used for processing voice signals, the multimedia subsystem 1734 is used for processing multimedia related operations, such as video coding, image processing, etc., and the interface circuit 1735 is used for communicating with other terminal components, such as the display 1740, the input device 1750, the memory 1760, etc. The above components in the processor system 1730 can communicate with each other through a bus or a communication interface circuit.

[0233] In one example, the processor system 1730 can be packaged as a processor chip, such as a SoC chip or a SIP chip. In one example, the processor system 1730 can be a system of multiple chips, for example, the baseband processor 1731 can be packaged separately as a chip, or packaged with part or all of the circuitry of the radio frequency processing system as a chip.

[0234] In one example, the memory 1736 can be an on-chip memory, i.e., located on the chip of the processor system 1730. In one example, the memory 1760 can be an off-chip memory, i.e., located off the chip of the processor system 1730.

[0235] In one example, the baseband processor 1731 can include one or more processor cores 17311 and interface circuit 17314. The one or more processor cores 17311 are configured to process signals and perform one or more communication protocols. Optionally, the baseband processor 1731 can also include a memory 17312 configured to store at least part of corresponding computer program instructions and / or data. In one example, the one or more processor cores 17311 implement the relevant operations in the above method embodiments by executing the computer program instructions stored in the memory 17312. In the present disclosure, the memory 17312 configured to store corresponding computer program instructions and / or data can mean that the memory 17312 is configured to store all corresponding computer program instructions and / or data for execution by the processor core 17311; or can mean that the memory 17312 is configured to store part of corresponding computer program instructions and / or data, which includes computer program instructions and / or data currently required for execution by the processor core 17311, and the memory 17312 can store different parts of computer program instructions and / or data for execution by the processor core 17311 multiple times to implement the relevant operations in the above method embodiments. The interface circuit 17314 serves as a communication interface to realize communication with other components, such as transmitting signals with the radio frequency processing system 1720, communicating with other subsystems and related components of the processor system 1730 through a bus, such as transmitting data control signals with the application processor 1732, and transmitting data or computer program instructions with the memory 1736 or the memory 1760. Optionally, in order to reduce the load of the processor core, a baseband signal processing circuit 17313 can also be provided to implement at least part of the processing work of the baseband signal, including one or more of signal demodulation, modulation, encoding or decoding, etc.

[0236] In one example, the terminal 1700 can include a communication module of the processor system 1730 and the radio frequency system 1720, the processor system 1730, or the baseband processor 1731.

[0237] The processor, processor system, application processor, baseband processor, processor circuit, or processor core can be collectively referred to as a processor, which can include one or a combination of a central processing unit (CPU), a digital signal processor (DSP), a microprocessor unit (MPU), a microcontroller unit (MCU), a graphics processing unit (GPU), a field programmable gate array (FPGA), an artificial intelligence processor (AI processor), or a neural processing unit (NPU).

[0238] The above memory can include one or more of the following storage media: random access memory (RAM), static RAM (SRAM), dynamic RAM (DRAM), phase-change memory (PCM), resistive RAM (ReRAM), magnetoresistive RAM (MRAM), ferroelectric RAM (FRAM), cache, register, read-only memory (ROM), flash memory, erasable programmable ROM (EPROM), hard disk, etc. In one example, computer program instructions for implementing the above embodiments can be stored on a non-volatile memory, such as at least part of the above memory 1760 (e.g., one or more of ROM, flash memory, EPROM, or hard disk). During terminal operation, the corresponding computer program instructions can be loaded in whole or in part into a memory with faster transmission speed to the processor, such as at least part of the above memory 1736 and / or memory 17312 (e.g., one or more of RAM, SRAM, DRAM, PCM, RERAM, MRAM, FRAM, cache, or register), for execution by the processor to implement the steps in the above method embodiments.

[0239] In one example, the radio frequency transceiver 1722 and the radio frequency front end 1721 can also be packaged in one chip. In one example, the radio frequency transceiver 1722, the radio frequency front end 1721, and the baseband processor 1731 can also be packaged in one chip.

[0240] The present application also provides a computer program product, including computer program instructions, which, when executed, cause the steps or processes performed by the terminal in any of the above method embodiments to be performed.

[0241] The present application also provides a computer-readable storage medium, which stores computer programs or instructions, which, when executed, cause the steps or processes performed by the terminal in any of the above method embodiments to be performed.

[0242] The application also provides a chip comprising a processor for calling and running a computer program or instructions from a memory, which, when executed, causes each step or procedure performed by the terminal in any of the method embodiments described above to be performed.

[0243] The application also provides a communication system comprising at least one of a terminal and a network device.

[0244] Those skilled in the art will understand that embodiments of the application can be provided as methods, systems, or computer program products. Accordingly, the application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the application can take the form of a computer program product on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) embodying computer-usable program code.

[0245] The application is described with reference to the flowcharts and / or block diagrams of the methods, apparatus (systems), and computer program products according to this application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and combinations of flows and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general purpose computer, a special purpose computer, an embedded processor, or other programmable data processing apparatus to produce a machine, so that the instructions, which are executed via the processor of the computer or other programmable data processing apparatus, generate means for implementing the functions specified in the flowchart one or more flows and / or block diagram one or more blocks.

[0246] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product comprising instruction means, which implement the functions specified in the flowchart one or more flows and / or block diagram one or more blocks.

[0247] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus, so that a series of operational steps are performed on the computer or other programmable data processing apparatus to produce a computer-implemented process, so that the instructions executed on the computer or other programmable data processing apparatus provide steps for implementing the functions specified in the flowchart one or more flows and / or block diagram one or more blocks.

[0248] Obviously, many modifications and variations of the present application are possible in light of the above teachings. It is, therefore, to be understood that within the scope of the appended claims and their equivalents, the application can be practiced otherwise than as specifically described.

Claims

1. A communication method characterized by comprising: The method comprises: mapping data of a burst to M logical channels according to first resources allocated to the burst by a network device, M being a positive integer, the first resources occupying M time units, an amount of data in the burst mapped to an i-th logical channel of the M logical channels being determined by an amount of data that can be transmitted by resources on an i-th time unit of the first resources, the i-th time unit being an i-th time unit of the M time units, i being a positive integer; transmitting data in the i-th logical channel on the i-th time unit.

2. The method of claim 1, wherein, The M logical channels belong to R logical channels corresponding to a first service to which the burst belongs, R≥ceil(a transmission delay of a first burst of the first service / a length of the time unit), ceil representing rounding up.

3. The method of claim 2, wherein, An n-th %R logical channel of the R logical channels is used to carry data in the first service that is mapped to be transmitted on an n-th time unit, n being a positive integer, % representing a remainder, an arrival time of a first burst of the first service being a first time unit.

4. The method of claim 2 or 3, wherein, R=ceil(a transmission delay of a first burst of the first service / a length of the time unit), or R=ceil(a delay budget of the first service / a length of the time unit).

5. A communication method characterized by comprising: The method comprises: mapping first data of a burst to a logical channel according to an arrival time of the first data, the logical channel being used to carry data in a first service to which the burst belongs and having an arrival time within a first time period, a length of the first time period being a delay jitter budget of the first service, an amount of data in the burst mapped to the logical channel being determined by an amount of data that can be transmitted by first transmission resources allocated to the burst by a network device, the first transmission resources being located on a first time unit; transmitting data in the logical channel on the first time unit.

6. The method of claim 5, wherein, The logical channel belongs to R logical channels corresponding to the first service, R≥ceil(a transmission delay of a first burst of the first service / jitter), ceil representing rounding up, jitter being the delay jitter budget.

7. The method of claim 6, wherein, An i-th logical channel of the R logical channels is used to map data in the first service that arrives at a time of [(i-1)jitter+k*PDB, jitter*i+k*PDB), PDB being a delay budget of the first service, R≥ceil(PDB / jitter), i being a positive integer, k being an integer, an arrival time of the first burst being a 0-th time.

8. The method of claim 7, wherein, R=ceil(PDB / jitter).

9. The method of claim 6, wherein, An i th logical channel of the R logical channels is used to map data in the first service arriving at a time of [(i-1)jitter+jitter*k*ceil(a transmission time delay of a first burst of the first service / jitter)], jitter*i+jitter*k*ceil(a transmission time delay of a first burst of the first service / jitter)), R≥ceil(a transmission time delay of a first burst of the first service / jitter), i is a positive integer, k is an integer, and the arrival time of the first burst is a time of 0.

10. The method of claim 9, wherein, R=ceil(a transmission time delay of a first burst of the first service / jitter).

11. A communications device, characterized by Comprise: A processing unit is configured to map data of a burst to M logical channels according to a first resource allocated to the burst by a network device, M is a positive integer, the first resource occupies M time units, and an amount of data in the burst mapped to an i th logical channel of the M logical channels is determined by an amount of data that can be transmitted by a resource at an i th time unit of the first resource, the i th time unit is an i th time unit of the M time units, and i is a positive integer. A communication unit is configured to transmit data in the i th logical channel at the i th time unit.

12. The apparatus of claim 11, wherein, The M logical channels belong to R logical channels corresponding to a first service to which the burst belongs, R≥ceil(a transmission time delay of a first burst of the first service / a length of the time unit), and ceil represents rounding up.

13. The apparatus of claim 12, wherein, An n th %R logical channel of the R logical channels is used to carry data in the first service mapped to be transmitted at an n th time unit, n is a positive integer, % represents a remainder, and an arrival time of a first burst in the first service is a first time unit.

14. The apparatus of claim 12 or 13, wherein, R=ceil(a transmission time delay of a first burst of the first service / a length of the time unit), or R=ceil(a delay budget of the first service / a length of the time unit).

15. A communications device, characterized by Comprise: A processing unit is configured to map first data of a burst to a logical channel according to an arrival time of the first data, the logical channel is used to carry data in a first service to which the burst belongs and arriving at a time within a first time period, a length of the first time period is a delay jitter budget of the first service, and an amount of data in the burst mapped to the logical channel is determined by an amount of data that can be transmitted by a first transmission resource allocated to the burst by a network device, and the first transmission resource is at a first time unit. A communication unit is configured to transmit data in the logical channel at the first time unit.

16. The apparatus of claim 15, wherein, The logical channel belongs to R logical channels corresponding to the first service, R≥ceil(a transmission time delay of a first burst of the first service / jitter), ceil represents rounding up, and jitter is the delay jitter budget.

17. The apparatus of claim 16, wherein, The i-th logical channel of the R logical channels is used to map data of the first service arriving at the ([(i-1)jitter+k*PDB, jitter*i+k*PDB) time point, PDB is a delay budget of the first service, R≥ceil(PDB / jitter), i is a positive integer, and k is an integer. The arrival time point of the first burst is the 0th time point.

18. The apparatus of claim 17, wherein, R = ceil(PDB / jitter).

19. The apparatus of claim 16, wherein, The i-th logical channel of the R logical channels is used to map data of the first service arriving at the ([(i-1)jitter+jitter*k*ceil(a transmission time delay of a first burst of the first service / jitter), jitter*i+jitter*k*ceil(a transmission time delay of a first burst of the first service / jitter)) time point, R≥ceil(a transmission time delay of a first burst of the first service / jitter), i is a positive integer, and k is an integer. The arrival time point of the first burst is the 0th time point.

20. The apparatus of claim 19, wherein, R = ceil(a transmission time delay of a first burst of the first service / jitter).

21. A communications device, characterized by The computer program or instructions, when executed, cause the method of any one of claims 1-4 to be performed, or cause the method of any one of claims 5-10 to be performed.

22. A readable storage medium, on which a computer program or instructions are stored, characterized in that, The computer program or instructions, when executed, cause the method of any one of claims 1-4 to be performed, or cause the method of any one of claims 5-10 to be performed.

23. A computer program product, characterised in that, The computer program or instructions, when executed, cause the method of any one of claims 1-4 to be performed, or cause the method of any one of claims 5-10 to be performed.

24. A chip, characterized by The computer program or instructions, when executed, cause the method of any one of claims 1-4 to be performed, or cause the method of any one of claims 5-10 to be performed.

Images