Communication method and apparatus

Abstract

The present application belongs to the field of communications. Provided are a communication method and apparatus, which meet the communication requirements between a terminal and a network in a future communication system. The method includes: determining a first message, wherein the first message indicates first data, the first data being data obtained by means of compressing second data on the basis of compression information, the second data having N vectors, the j-th vector among the N vectors having Mj elements, both N and Mj being positive integers, and j ranging from 1 to N; and sending the first message, wherein the first message is a media access control message or a radio resource control message.

Description

Communication methods and devices

[0001] This application claims priority to Chinese Patent Application No. 202510127753.7, filed with the State Intellectual Property Office of China on January 27, 2025, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communications, and more particularly to a communication method and apparatus. Background Technology

[0003] In wireless communication systems, medium / media access control (MAC) signaling and radio resource control (RRC) signaling are two key control signaling protocols. MAC signaling resides at the data link layer (L2) of the protocol stack, responsible for lower-level link control and resource management. RRC signaling resides at the control layer (L3) of the protocol stack, responsible for higher-level connection management and system configuration. Terminals can interact with access network devices / networks through these MAC and RRC signaling protocols.

[0004] However, with the continuous development of communication technology, the existing MAC signaling structure and RRC signaling structure may not be able to meet future communication needs. Summary of the Invention

[0005] This application provides a communication method and apparatus to support improvements to media access control messages and radio resource control messages, thereby meeting the communication needs between terminals and networks in future communication systems.

[0006] To achieve the above objectives, this application adopts the following technical solution:

[0007] Firstly, a communication method is provided, which is applied to a terminal-side device, such as a terminal device or a chip in a terminal device, or a device containing a terminal device; or, the method is also applied to a network-side device, such as a network device or a device containing a network device. For ease of understanding, taking a user equipment (UE) as the terminal-side device or a base station as the network-side device as an example, the method includes:

[0008] The first message is determined, indicating the first data. The first data is data obtained by compressing the second data according to the compression information. The second data has N vectors, and the j-th vector among the N vectors has M. j There are elements, where N and M j All are positive integers, and j iterates from 1 to N;

[0009] Send the first message, which is either a media access control message or a radio resource control message.

[0010] In other words, this method transmits compressed first data by carrying it in a first message, enabling the compressed data to be transmitted through the L2 and L3 layers of the protocol stack. Furthermore, compared to directly transmitting the second data, transmitting the compressed first data can significantly reduce the communication overhead required for instruction data and transmission data, thus meeting the diverse service needs of future communication systems.

[0011] In one possible design scheme, the j-th vector among N vectors has M elements. j Satisfy M j =M, where M is a positive integer, or, M is the number of elements in the j1-th vector among N vectors. j1 The number of elements M of the j2-th vector among N vectors j2 Satisfy: M j1 ≠M j2 In other words, the second data is multidimensional data, but it can include data with multiple different dimensions. For example, the second data can include multiple types of data, and different types of data have different data dimensions. In this case, compressing multiple types of data together as the second data can improve the efficiency of compression / decompression and data transmission compared to compressing each type of data separately as the second data and then transmitting them one by one.

[0012] In one possible design, the second data includes data in K groups. The first data is obtained by compressing the data of the i-th group of the second data according to the compression parameters corresponding to the i-th group in the K groups. The compression information includes the compression parameters corresponding to the i-th group, and i iterates from 1 to K.

[0013] Optionally, the compression parameters corresponding to the i-th group include the first quantization parameter and / or the second quantization parameter corresponding to the i-th group. The first quantization parameter corresponding to the i-th group is the quantization boundary / data boundary corresponding to the i-th group, and the second quantization parameter corresponding to the i-th group is the quantization bit or quantization step size corresponding to the i-th group.

[0014] Optionally, the compressed information also includes first indication information, which indicates the group to which the K value and the j-th vector of the second data belong in the K groups.

[0015] In other words, during the compression of the second data, the compression parameters corresponding to each group can be used to compress the data in each group at the group level. The grouping rules for the second data (i.e., the content indicated by the first indication information) can be default / pre-configured or vary with the characteristics of the second data. For example, vectors with similar data ranges can be grouped together for compression. This reduces redundant steps in the compression process and the overhead required to transmit compression parameters while ensuring data accuracy.

[0016] In one possible design, the second data is multipath component data, perception data, 3D target bounding box data, or geometric semantic data. The geometric semantic data includes at least one of the following: point data, line data, or surface data, which can meet different types of communication needs.

[0017] In one possible design, the first message includes first information indicating the type of first data, so that the receiving end can determine the type of received data and perform corresponding services based on the first data.

[0018] Optionally, the first message also includes second information, which indicates that the first data corresponds to the data of the i-th group among the K groups. The first data is obtained by compressing the data of the i-th group of the second data according to the compression parameters corresponding to the i-th group among the K groups. i traverses from 1 to K, that is, the second information can indicate the data content included in the first data.

[0019] Optionally, the first message may also include third information, which indicates the first indication information. The first indication information indicates the group to which the K value and the j-th vector of the second data belong in the K groups. That is, the third information may indicate the grouping rules of the second data.

[0020] Optionally, the first message may also include a fourth message, which indicates the compression parameters corresponding to the i-th group.

[0021] Optionally, the compression parameters corresponding to the i-th group include the first quantization parameter and / or the second quantization parameter corresponding to the i-th group, wherein the first quantization parameter corresponding to the i-th group is the quantization boundary / data boundary corresponding to the i-th group, and the second quantization parameter corresponding to the i-th group is the quantization bit or quantization step size corresponding to the i-th group, and the fourth information includes at least one of the following:

[0022] The value of the first quantization parameter corresponding to the i-th group, the index of the first quantization parameter corresponding to the i-th group, the value of the second quantization parameter corresponding to the i-th group, or the index of the second quantization parameter corresponding to the i-th group.

[0023] In other words, the fourth information can indicate the first quantization parameter and / or the second quantization parameter included in the compression parameters corresponding to the i-th group, indicating a one-to-one correspondence between the compression parameters of different groups and the groups, so that the second device can decompress the first data according to the first message to obtain the third data.

[0024] Optionally, if the second data is geometric semantic data, the first message further includes fifth information, which includes at least one of the geometric information of line data or geometric information of surface data, and the geometric semantic data includes at least one of point data, line data or surface data.

[0025] Optionally, the geometric information of the line data includes the number of line clusters.

[0026] Optionally, the geometric information of the surface data includes the number of surfaces and the number of boundary points for each surface.

[0027] In other words, the fifth piece of information can indicate information in the geometric semantic data that may not be available from the second data, enabling the first data obtained by combining the second data with compression to better determine the information of the geometric object.

[0028] Secondly, a communication method is provided, the method being applied to a terminal-side device, such as a terminal device or a chip in a terminal device, or a device containing a terminal device; or, the method is also applied to a network-side device, such as a network device or a device containing a network device, the method comprising:

[0029] Receive a first message, which is either a data link message or a radio resource control message. The first message indicates first data, which is data obtained by compressing second data according to compression information. The second data has N vectors, and the j-th vector among the N vectors has M. j There are elements, where N and M j All are positive integers, and j iterates from 1 to N;

[0030] Based on the first message, the third data is determined, and the second data is the data obtained by decompressing the first data based on the compression information.

[0031] In one possible design scheme, the j-th vector among N vectors has M elements. j Satisfy M j =M, where M is a positive integer.

[0032] In one possible design, the second data includes data in K groups. The first data is obtained by compressing the data of the i-th group of the second data according to the compression parameters corresponding to the i-th group in the K groups. The compression information includes the compression parameters corresponding to the i-th group, and i iterates from 1 to K.

[0033] Optionally, the compression parameters corresponding to the i-th group include the first quantization parameter and / or the second quantization parameter corresponding to the i-th group. The first quantization parameter corresponding to the i-th group is the quantization boundary / data boundary corresponding to the i-th group, and the second quantization parameter corresponding to the i-th group is the quantization bit or quantization step size corresponding to the i-th group.

[0034] Optionally, the compressed information also includes first indication information, which indicates the group to which the K value and the j-th vector of the second data belong in the K groups.

[0035] In one possible design, the second data is multipath component data, perception data, 3D target bounding box data, or geometric semantic data, wherein the geometric semantic data includes at least one of the following: point data, line data, or surface data.

[0036] In one possible design, the first message includes first information, which indicates the type of the first data.

[0037] Optionally, the first message also includes second information, which indicates that the first data corresponds to the data of the i-th group among the K groups. The first data is obtained by compressing the data of the i-th group of the second data according to the compression parameters corresponding to the i-th group among the K groups, where i traverses from 1 to K.

[0038] Optionally, the first message may also include third information, which indicates the first indication information, and the first indication information indicates the group to which the j-th vector of the K value and the second data belongs in the K groups.

[0039] Optionally, the first message may also include a fourth message, which indicates the compression parameters corresponding to the i-th group.

[0040] Optionally, the compression parameters corresponding to the i-th group include the first quantization parameter and the second quantization parameter corresponding to the i-th group, where the first quantization parameter is the quantization boundary / data boundary of the i-th group, and the second quantization parameter is the quantization bit or quantization step size of the i-th group. The fourth information includes at least one of the following:

[0041] The value of the first quantization parameter corresponding to the i-th group, the index of the first quantization parameter corresponding to the i-th group, the value of the second quantization parameter corresponding to the i-th group, or the index of the second quantization parameter corresponding to the i-th group.

[0042] Optionally, if the second data is geometric semantic data, the first message further includes fifth information, which includes at least one of the geometric information of line data or geometric information of surface data, and the geometric semantic data includes at least one of point data, line data or surface data.

[0043] Optionally, the geometric information of the line data includes the number of line clusters.

[0044] Optionally, the geometric information of the surface data includes the number of surfaces and the number of boundary points for each surface.

[0045] It is understandable that the technical effects of the method described in the second aspect can also refer to the relevant introduction of the method described in the first aspect above, and will not be repeated here.

[0046] Thirdly, a communication device is provided, the communication device including a module for performing the method described in any one of the first to second aspects.

[0047] In one possible design, the communication device described in the third aspect may further include a transceiver. This transceiver may be a transceiver circuit or an interface circuit. The transceiver can be used for communication between the communication device described in the third aspect and other communication devices.

[0048] In one possible design, the communication device described in the third aspect may further include a memory. This memory may be integrated with the processor or disposed separately. The memory may be used to store instructions relating to the methods of any of the first to second aspects.

[0049] In the embodiments of this application, the communication device described in the third aspect may be a network device, or a chip (system) or other component or assembly disposed in the network device, or a device containing the network device.

[0050] It is understood that the technical effects of the device described in the third aspect can also be referred to the relevant descriptions of the methods in any of the first to second aspects above, and will not be repeated here.

[0051] Fourthly, a communication device is provided. The communication device includes a processor configured to execute a computer program or instructions to cause the communication device to perform the method described in any one of the first to second aspects.

[0052] Optionally, the communication device further includes a memory for storing the computer program or instructions.

[0053] In one possible design, the communication device described in the fourth aspect may further include a transceiver. This transceiver may be a transceiver circuit or an interface circuit. The transceiver can be used for communication between the communication device described in the fourth aspect and other communication devices.

[0054] In the embodiments of this application, the communication device described in the fourth aspect may be a network device described in any one of the first to second aspects, or a chip (system) or other component or assembly disposed in the network device, or a device containing the network device.

[0055] Furthermore, the technical effects of the communication device described in the fourth aspect can be referred to the technical effects of the method described in any one of the first or second aspects, and will not be repeated here.

[0056] Fifthly, a communication device is provided, comprising: a processor and a memory; the memory being used to store instructions that, when executed by the processor, cause the communication device to perform the method as described in any one of the first to second aspects.

[0057] In one possible design, the communication device described in the fifth aspect may further include a transceiver. This transceiver may be a transceiver circuit or an interface circuit. The transceiver can be used by the communication device described in the third aspect to communicate with other communication devices.

[0058] In the embodiments of this application, the communication device described in the fifth aspect may be a network device described in any one of the first to second aspects, or a chip (system) or other component or assembly disposed in the network device, or a device containing the network device.

[0059] Furthermore, the technical effects of the communication device described in the fifth aspect can be referred to the technical effects of the method described in any one of the first or second aspects, and will not be repeated here.

[0060] A sixth aspect provides a chip comprising: a controller and an interface circuit, wherein the controller is configured to interact with other devices via the interface circuit to perform the method as described in any one of the first to second aspects.

[0061] A seventh aspect provides a communication system. The communication system includes a first communication device for performing the method described in the first aspect, and a second communication device for performing the method described in the second aspect.

[0062] Eighthly, a computer-readable storage medium is provided, the computer-readable storage medium including storage of a computer program or instructions that, when executed, cause the method described in any one of the first to second aspects to be performed.

[0063] A ninth aspect provides a computer program product comprising a computer program or instructions that, when executed, cause the method described in any one of the first to second aspects to be performed. Attached Figure Description

[0064] Figure 1 is a schematic diagram of the architecture of the communication system provided in an embodiment of this application;

[0065] Figure 2 is a schematic diagram of the architecture of the communication system provided in an embodiment of this application;

[0066] Figure 3 is a flowchart illustrating the communication method provided in an embodiment of this application;

[0067] Figure 4 is a MAC message structure diagram provided in an embodiment of this application;

[0068] Figure 5 is a second MAC message structure diagram provided in an embodiment of this application;

[0069] Figure 6 is a MAC message structure diagram three provided in the embodiments of this application;

[0070] Figure 7 is a fourth MAC message structure diagram provided in an embodiment of this application;

[0071] Figure 8 is a diagram of the MAC message structure provided in an embodiment of this application.

[0072] Figure 9 is a diagram of the MAC message structure provided in an embodiment of this application.

[0073] Figure 10 is a schematic diagram of the communication device provided in an embodiment of this application;

[0074] Figure 11 is a schematic diagram of the structure of the communication device provided in the embodiment of this application. Detailed Implementation

[0075] The technical solutions of this application embodiment can be applied to various communication systems, such as Wi-Fi systems, vehicle-to-everything (V2X) communication systems, device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, fourth-generation (4G) mobile communication systems, such as long-term evolution (LTE) systems, worldwide interoperability for microwave access (WiMAX) communication systems, fifth-generation (5G) mobile communication systems, such as new radio (NR) systems, and future communication systems.

[0076] This application will present various aspects, embodiments, or features relating to systems that may include multiple devices, components, modules, etc. It should be understood and appreciated that individual systems may include additional devices, components, modules, etc., and / or may not include all the devices, components, modules, etc. discussed in conjunction with the accompanying drawings. Furthermore, combinations of these approaches are also possible.

[0077] Furthermore, in the embodiments of this application, words such as "exemplarily" and "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as an "example" in this application should not be construed as being better or more advantageous than other embodiments or designs. Rather, the use of the word "example" is intended to present the concept in a specific manner.

[0078] First, in this application, "for indicating" can include both direct and indirect indication. When describing "information" for indicating A, it can include whether the information directly indicates A or indirectly indicates A, but does not necessarily mean that the information carries A.

[0079] The information indicated by a given piece of information is called the information to be indicated. In the specific implementation process, there are many ways to indicate the information to be indicated, such as, but not limited to, directly indicating the information to be indicated, such as the information to be indicated itself or its index. It can also be indirectly indicated by indicating other information, where there is a relationship between the other information and the information to be indicated. It can also indicate only a part of the information to be indicated, while the other parts are known or pre-agreed upon. For example, the indication of specific information can be achieved by using a pre-agreed (e.g., protocol-defined) arrangement of various pieces of information, thereby reducing the indication overhead to some extent. At the same time, common parts of various pieces of information can be identified and indicated uniformly to reduce the indication overhead caused by individually indicating the same information.

[0080] Furthermore, the specific indication method can also be any existing indication method, such as, but not limited to, the above-mentioned indication methods and their various combinations. Specific details of various indication methods can be found in existing technologies, and will not be repeated here. As described above, for example, when multiple pieces of information of the same type need to be indicated, the indication methods for different pieces of information may differ. In the specific implementation process, the required indication method can be selected according to specific needs. This application embodiment does not limit the selected indication method; therefore, the indication methods involved in this application embodiment should be understood to cover various methods that enable the party to be indicated to obtain the information to be indicated.

[0081] The information to be instructed can be sent as a whole or divided into multiple sub-information messages, and the sending period and / or timing of these sub-information messages can be the same or different. This application does not limit the specific sending method. The sending period and / or timing of these sub-information messages can be predefined, for example, according to a protocol, or configured by the transmitting device by sending configuration information to the receiving device. This configuration information can include, for example, but not limited to, one or a combination of at least two of radio resource control (RRC) signaling, medium / media access control (MAC) layer signaling, and physical layer signaling. MAC layer signaling includes, for example, a MAC control element (CE); physical (PHY) layer signaling includes, for example, downlink control information (DCI).

[0082] "Sending information" can be understood as one device sending information to another device, or it can also be understood as one logical module within a device sending information to another logical module. For example, "a network device sending information" can be understood as a network device sending information to another device (such as a terminal or other network device), or it can be understood as logical module 1 in the network device sending information to logical module 2 in the network device.

[0083] "Receiving information" can be understood as one device receiving information from another device, or it can be understood as a logical module within a device receiving information from another logical module. For example, "network device receiving information" can be understood as a network device receiving information from another device (such as a terminal or other network device), or it can be understood as logical module 1 in the network device receiving information from logical module 2 in the network device.

[0084] The phrase "sending information to... (e.g., a node)" or the related illustrations in the accompanying drawings can be understood as the destination of the information being a node. This can include sending information directly or indirectly to a node. Similarly, the phrase "receiving information from... (e.g., a node)," "receiving information from... (e.g., a node)," or "receiving information sent by (e.g., a node)," or the related illustrations in the accompanying drawings, can be understood as the source of the information being a node. This can include receiving information directly or indirectly from a node. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source. Similar expressions in this application can be interpreted similarly, and will not be elaborated further here.

[0085] Second, in the embodiments shown below, the first, second, and various numerical designations are merely distinctions for descriptive convenience and are not intended to limit the scope of the embodiments of this application. For example, to distinguish different indication information.

[0086] Third, "pre-defined," "pre-configured," or "pre-specified" can be achieved by pre-saving corresponding codes, tables, or other means of indicating relevant information in the device (e.g., including terminal devices and network devices), or by pre-defining them in a protocol. This application does not limit the specific implementation method. "Saving" can refer to saving in one or more memories. These memories can be separate installations or integrated into the encoder, decoder, processor, or communication device. Alternatively, some memories can be separately installed, while others are integrated into the decoder, processor, or communication device. The type of memory can be any form of storage medium, and this application does not limit this.

[0087] Fourth, the “protocol” involved in the embodiments of this application may refer to standard protocols in the field of communication, such as 3GPP’s LTE protocols (such as technical specification (TS) 36, i.e., the TS36 series of technical specifications), NR protocols (such as the TS38 series of technical specifications), and related protocols applied to future communication systems. This application does not limit this.

[0088] The network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0089] To facilitate understanding of the embodiments of this application, a communication system will be used as an example to describe in detail the communication system applicable to the embodiments of this application.

[0090] As shown in Figure 1, which is a schematic diagram of the architecture of a communication system, the communication system includes a first device and a second device.

[0091] As shown in Figure 1, the communication system includes at least one second device (such as second device 110a and second device 110b) and at least one first device (such as first devices 120a to 120j).

[0092] The first device can be connected to the second device wirelessly, and the second device can be connected to the core network (not shown in Figure 1) via wired or wireless means.

[0093] The second device can exchange information with the first device.

[0094] The first device can be a terminal with transceiver capabilities. This first device can also be referred to as user equipment (UE), access terminal, subscriber unit, user station, mobile station (MS), mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent, or user apparatus. The first device in the embodiments of this application may be a mobile phone, cellular phone, smartphone, tablet computer, wireless data card, personal digital assistant (PDA), wireless modem, handset, laptop computer, machine type communication (MTC) terminal, computer with wireless transceiver function, virtual reality (VR) terminal, augmented reality (AR) terminal, smart home device (e.g., refrigerator, television, air conditioner, electricity meter, etc.), intelligent robot, robotic arm, workshop equipment, wireless terminal in autonomous driving, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in telemedicine, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, vehicle terminal, or roadside unit with terminal function. The first device in this application can also be an onboard module, onboard unit, onboard component, onboard chip, or onboard unit built into a vehicle as one or more components or units. The first device can also be other devices with terminal functions; for example, it can be a device that functions as a terminal in D2D communication. The embodiments of this application do not limit the form of the first device. The apparatus for implementing the function of the first device can be the first device itself; it can also be an apparatus capable of supporting the first device in implementing that function, such as a communication module, chip, chip system, other components or parts, or circuits or functional components. This apparatus can be installed in the first device or used in conjunction with the first device. The chip system can be composed of chips or include chips and other discrete devices.Among them, the first device in each of the above-mentioned forms can also be called a terminal-side device.

[0095] In this application embodiment, the network device can be a device with wireless transceiver capabilities. For example, the second device can be a device located in the access network (AN) of a communication system, which can be used to provide access services for terminals. In one possible scenario, the second device can be a radio access network (RAN) device, such as a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), or a base station in a future communication system. In future mobile communication systems, the second device may also have other naming conventions, all of which are covered within the protection scope of this application embodiment, and this application does not impose any limitations on them. Alternatively, the second device may also include 5G, such as a gNB in ​​an NR system, or one or a group of antenna panels (including multiple antenna panels) of a 5G base station, or it may also be a network node constituting a gNB, a transmission point (TP), or a transmission measurement function (TMF). Alternatively, the second device can be a macro base station (as shown in Figure 1, 110a), a micro base station or indoor station (as shown in Figure 1, 110b), a relay node or donor node, or a wireless controller in a cloud radio access network (CRAN) scenario. Optionally, the second device can also be a server, wearable device, vehicle, or in-vehicle equipment, etc. For example, the access network device in V2X technology can be a roadside unit (RSU). All or part of the functions of the second device in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (e.g., a cloud platform). The second device in this application can also be a logical node, logical module, or software capable of implementing all or part of the functions of the second device.

[0096] In another possible scenario, multiple second devices collaborate to assist the first device in achieving wireless access, with each second device performing a portion of the base station's functions. For example, the second devices 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 DU can be configured separately or included in the same network element, such as a baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0097] In different systems, CU (or centralized unit control plane (CU-CP)) and centralized unit user plane (CU-UP)), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an open radio access network (O-RAN or ORAN) system, CU can also be called an open centralized unit (O-CU) (open CU), DU can also be called an open distributed unit (O-DU), CU-CP can also be called an open central unit control plane (O-CU-CP), CU-UP can also be called an open central unit user plane (O-CU-UP), and RU can also be called an open radio unit (O-RU). For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the CU (or CU-CP, CU-UP), DU and RU units in this application can be implemented through a software module, a hardware module, or a combination of software and hardware modules.

[0098] In this embodiment, the form of the second device is not limited. The apparatus used to implement the function of the second device can be the second device itself; it can also be any apparatus capable of supporting the second device in implementing that function, such as a communication module, chip, chip system, other components or parts, or circuits or functional components. This apparatus can be installed in the second device or used in conjunction with the second device. The chip system can be composed of chips or can include chips and other discrete devices. The various forms of the second device described above can also be referred to as network-side devices.

[0099] It should be understood that Figure 1 is a simplified schematic diagram for ease of understanding only, and the communication system may also include other second devices, and / or other first devices, which are not shown in Figure 1.

[0100] As shown in Figure 2, the second device includes an RRC signaling interaction module (RRC in Figure 2), a MAC signaling interaction module (MAC in Figure 2), and a PHY signaling and data interaction module (PHY in Figure 2). The first device includes an RRC signaling interaction module, a MAC signaling interaction module, and a PHY signaling and data interaction module.

[0101] The second device and the first device can exchange RRC signaling via the RRC signaling interaction module. The second device and the first device can exchange media access control element (MAC CE) signaling via the MAC signaling interaction module. The second device and the first device can exchange one or more of the following via the PHY interaction module: uplink control signaling, downlink control signaling (such as DCI), uplink data, or downlink data.

[0102] In this communication system, a first device determines a first message and sends it to a second device. The first message indicates first data, which is data obtained by compressing second data according to compression information. The second device receives the first message from the first device and determines third data based on the first message. The first message is either a Media Access Control message or a Radio Resource Control message. This enables the compressed first data to be transmitted through the L2 and L3 layers of the protocol stack, meeting the diverse service requirements of future communication systems. Furthermore, compared to directly transmitting the second data, transmitting the compressed first data significantly reduces the communication overhead required for indicating and transmitting data.

[0103] The communication method and apparatus of this application embodiments will be further described below with reference to the accompanying drawings. It is understood that this application uses network devices and terminal devices as examples to illustrate the interaction, but this application does not limit the execution subject of the interaction. The interaction flow between devices in the above-described communication system will be specifically described below through method embodiments. The communication method provided in this application embodiments can be applied to the above-described communication system and specifically applied to various scenarios involved in the above-described communication system, which will be described in detail below.

[0104] Figure 3 is a schematic flowchart of the communication method provided in this application embodiment. This communication method is applicable to the aforementioned communication system, applied to a first device and a second device, and mainly involves the interaction between the first device and the second device. The first device can be a terminal device (such as a UE), or a chip or chip system applicable to a terminal device, or a device containing a terminal device. The first device can also be a network device (such as a base station or other RAN node), or a chip or chip system applicable to a network device, or a device containing a network device. The second device can be a terminal device (such as a UE), or a chip or chip system applicable to a terminal device, or a device containing a terminal device. The second device can also be a network device (such as a base station or other RAN node), or a chip or chip system applicable to a network device, or a device containing a network device. For ease of understanding, unless otherwise specified, the first device in the following text can be a terminal device (such as a UE), and the second device can be a network device (such as a base station or other RAN node).

[0105] As shown in Figure 3, the specific process of this method is as follows:

[0106] S301, the first device determines the first message and sends the first message to the second device, and the second device receives the first message from the first device.

[0107] The first message indicates the first data, which is obtained by compressing the second data based on the compression information. Specifically, the second data can be collected and obtained by the first device itself, or it can be obtained by the first device from other devices; the first data can be obtained by the first device itself by compressing the second data in combination with the compression information, or it can be obtained by the first device from other devices (in this case, the first device can also obtain the compression information corresponding to the first data). This document does not restrict the acquisition methods of the second data and the first data.

[0108] In some possible implementations, the first data can be the value of data obtained by compressing the second data or an index corresponding to that data. During the decompression of the first data, the compressed second data can be retrieved based on the index. That is, the form of the first data is not limited, as long as the second device can reconstruct the second data from the first data. In this embodiment, the first data is used as the index for illustration. It can be understood that using the first data as the index can further reduce the overhead of data indication.

[0109] The second data type includes, but is not limited to, at least one of the following: multipath component (MPC) data, perception data, 3D box data, or geometric semantic data, wherein geometric semantic data includes, but is not limited to, at least one of the following: point data, line data, or polygon data. Different types of second data are used to support different types of services between the terminal and the network. For example, perception data can be used to support intelligent perception services, and 3D box data can be used to support intelligent driving services.

[0110] The second data consists of N vectors, and the j-th vector among the N vectors has M... j Elements, N and M j Both are positive integers, for example, N and M. j All vectors can be positive integers greater than or equal to 2, and j can be any value from 1 to N. Here, N vectors can refer to N row vectors or N column vectors, without restriction. For ease of understanding, unless otherwise specified, the following explanation will use column vectors as an example.

[0111] The second data will now be discussed in detail:

[0112] For example, different vectors in the second data are used to indicate different field types that the second data has, N indicates the number of field types, and the elements in each vector are used to indicate the data that exists under that field type, M j Indicates the number of data items under this field type, where the specific meaning of the field type and the data is related to the type of the second data item.

[0113] For example, the second data type is MPC data, and the field types included in the second data may include at least one of the following, but are not limited to: azimuth of arrival, azimuth of departure, zenith of arrival, zenith of departure, time delay, power, Doppler quantity, etc. In this example, the second data has the number of vectors N = 7, and the number of data points M in each vector can represent the number of paths.

[0114] For example, the type of the second data is sensing data (e.g., scatter, point cloud data). The field types included in the second data may include at least one of the following, but not limited to {x,y,z,p,d,…}, where x, y, and z are the coordinates of the sensing points, and p and d are the power, time delay, and other attributes of the sensing points. In this example, the second data has a vector number N = 5, and the number of data points M in each vector can represent the number of sensing points.

[0115] For example, if the type of the second data is 3D box data, then the field types included in the second data may include at least one of the following, but are not limited to: Where x, y, z are the center coordinates of the 3D box, l, w, h are the length, width, and height of the 3D box, respectively, and α, θ, ... These are the roll angle, pitch angle, and yaw angle of the 3D box, respectively. In this example, the second data has a vector number N = 9, and the number of data points M in each vector can represent the number of 3D boxes.

[0116] For example, if the type of the second data is line data in geometric semantic data, then the field types included in the second data may include at least one of the following, but not limited to {a,b,c,w,h,l,…}, where a,b,c are the coordinates of the center point of the line cluster, w,h are the range values ​​of the line cluster, and l is the length of the line cluster. In this example, the second data has the number of vectors N=6, and the number of data M in each vector can characterize the number of line clusters.

[0117] For example, if the second data type is surface data in geometric semantic data, then the field types included in the second data can be at least one of the following, but not limited to {x,y,z,l,p,d}, where x,y,z are the coordinates of all boundary points of multiple surfaces, l is the normal of the boundary point, and p,d are attributes such as power and time delay of the boundary point. In this example, the second data has N = 5 vectors, and the number of data points M in each vector can represent the number of boundary points of multiple surfaces.

[0118] As explained above, each vector in the second data contains M elements. j They can be equal, if they both satisfy M. j = M, where M is a positive integer. In some possible implementations, each vector in the second data has the number of elements M. j They can also be unequal, for example, when the second data contains multiple types of data, the number of elements M of the j1-th vector in the second data. j1 It may not be equal to the number of elements M of the j2-th vector. j2For example, if the second data consists of line data and surface data in geometric semantic data, then the j1-th vector could belong to the line data, M. j1 This represents the number of line clusters, where the j2-th vector belongs to the surface data, M. j2 M represents the number of boundary points of multiple faces. j1 With M j2 They can be unequal; or the second data includes 3D box data and perceptual data, in which case the j1-th vector could belong to the 3D box data, M j1 This represents the number of 3D boxes, where the j2-th vector belongs to the perceptual data, and M. j2 M represents the number of sensing points. j1 With M j2 They don't have to be equal. There are no specific restrictions.

[0119] Next, we will introduce compressed information and the principle of determining the first data based on compressed information:

[0120] Compression information is used to indicate the relevant parameters involved in the compression process of the second data. For example, there can be various compression methods for compressing the second data, such as quantization, entropy coding, dictionary coding, etc. The relevant parameters and specific compression processes involved in different compression methods may vary. For ease of understanding, this article uses the quantization method to compress the second data as an example.

[0121] In this example, the compression information may include first indication information for indicating grouping rules, according to which the N vectors of the second data can be divided into K groups. The compression information may also include compression parameters corresponding to the i-th group among the K groups, which are used to compress the data of the i-th group to obtain the first data.

[0122] The following explanation uses perceptual data as an example of the second data type. Examples of the second data can be found in Table 1, which is for illustrative purposes only and not as a final limitation.

[0123] Table 1

[0124] As shown in Table 1, one vector (corresponding to one field type) in the second data corresponds to one column in the table. For example, the second data includes four vectors with corresponding field types: {x, y, z, p}. x, y, z, and p correspond to the four columns of the table from left to right, and each vector has three elements (i.e., the second data can reflect data from three sensing points), i.e., N = 4, M j =M=3. Alternatively, the order of x, y, z, p in Table 1 can also be arranged in other ways.

[0125] In this example, firstly, the N vectors of the second data are grouped according to the grouping rules to obtain K groups, such as {g1, g2, ..., g...} K For example, K ≤ N. The grouping rule is used to indicate the value of K (i.e., the number of groups for the second data) and the group to which the j-th vector of the second data belongs.

[0126] In one possible implementation, the grouping rules can be determined in various ways. For example, based on the data characteristics of each vector in the second data, vectors with similar data characteristics can be grouped into the same group. For instance, the vectors x, y, and z, which reflect the coordinates of a point, can be grouped into the first group, and the vector p, which reflects the attribute of a point, can be grouped into the second group, thus determining K=2 and the group to which each vector belongs. Alternatively, the grouping rules can be determined based on the data range r of the j-th vector in the second data. j =max j -min j , j∈{1,…,N}, where max j min is the maximum value of the data contained in the j-th vector. j The minimum value of the data included in the j-th vector is used to group vectors with similar data ranges into the same group. Optionally, vectors in the same group can be further clustered based on the minimum or maximum value of their data range, grouping vectors of the same category together. For example, if the data range of x is 0-2, y is 0-1, z is 3-4, and p is 100-200, then first, x, y, and z are grouped into one group based on their data ranges, and p is grouped into another. Further, the minimum values ​​in the data ranges of x, y, and z are clustered, with x and y having similar minimum values ​​grouped into the first group, z into the second group, and p into the third group, thus determining K=3 and the group to which each vector belongs, and so on. In other words, the grouping rules can be fixed or flexibly set based on the second data, without any specific restrictions.

[0127] In one possible implementation, the grouping rules can be defaulted / pre-configured / predefined by the protocol for the first device, or they can be dynamically indicated to the first device. Optionally, when K=N, the value of K can be omitted and the default number of groups can be N to reduce the indication overhead. Optionally, if the data range values ​​of vectors in the same group are not aligned, the grouping rules also need to include the maximum / minimum values ​​of the data ranges corresponding to the vectors within the group.

[0128] Next, after grouping the second data, the data of the i-th group is compressed according to the compression parameters corresponding to the i-th group among the K groups, i∈{1,…,K}, thus obtaining the first data corresponding to the i-th group of the second data. Optionally, the compression parameters corresponding to different groups among the K groups can be the same or different, without specific restrictions. The compression parameters of the i-th group may include the first quantization parameter and / or the second quantization parameter of the i-th group. The first quantization parameter of the i-th group is used to characterize the data range of the i-th group. For example, the first quantization parameter can be a quantization boundary (Xi, Yi) or a data boundary (min). i max i In this example, Xi is the smaller value among the quantization boundary values, Yi is the larger value among the quantization boundary values, and min... i max represents the smaller value within the data boundary. i The quantization boundary is a larger value within the data boundary. It can also be named such as quantization range, quantization parameter, or any other possible name without restriction. The second quantization parameter for the i-th group is the quantization bits or quantization step size of the i-th group, used to characterize the data precision of the i-th group. For example, the second quantization parameter can be the quantization bits qi.

[0129] For example, the first quantization parameter (i.e., quantization boundary) corresponding to the i-th group can be a fixed value, or it can be flexibly set according to the data of the i-th group. For example, the quantization boundary can be the maximum value of the data included in the i-th group, which is the second data obtained through a single data acquisition (such as a sensing process). i To determine Yi, we use the minimum value min of the data in the i-th group. i To determine Xi; alternatively, the quantization boundary can also be the second data statistical value obtained through multiple data acquisitions (such as a sensing process), based on the maximum data value max of the i-th group corresponding to the statistical value. i To determine Yi, we need to use the minimum value of the data, min. i To determine Xi, or other possible methods, are not limited.

[0130] For example, suppose the minimum value of the data in the first group g1 (i.e., data D11-D31, D12-D32 including two field types x and y) is D12, and the maximum value of the data in the first group is D31, then X1 = D12, Y1 = D31.

[0131] For example, the second quantization parameter (i.e., quantization bits) corresponding to the i-th group can be a fixed value or can be flexibly set according to requirements. For example, the quantization bits qi of the i-th group can be determined according to the data compression accuracy requirements of the i-th group.

[0132] For example, the quantization bit qi of the i-th group is determined by combining the reference data range r0 and the reference quantization bit q0. The possible forms of r0 are max0-min0, (max0-min0) / sqrt((max0-min0) / q0). 2 +min0 2 () / 2) or (max0-min0) / ((max0+min0) / 2), etc.

[0133] Furthermore, the quantized bits qi of the i-th group can satisfy the following equation (1):

[0134] Where the subscript i represents the corresponding group, r i =max i -min i Let represent the data range of the i-th group, and let 'round' represent the rounding operation. Equation (1) can normalize the precision of the data in the i-th group traversing from 1 to K to the same precision standard.

[0135] In one possible implementation, the compression parameters of the i-th packet can be given to the first device by default / preconfiguration / protocol predefined, or dynamically indicated to the first device.

[0136] The above describes the content of compressed information. The following section uses the first group as an example to illustrate how to perform quantization compression to obtain the corresponding first data.

[0137] Method 1: The first data is determined through calculation.

[0138] Specifically, the correspondence between the first data and the second data can satisfy the following equation (2).

[0139] Where g1[a] is the a-th data contained in the j-th vector of the second data, a∈{0,…,M} j -1}, the j-th vector belongs to the first group, M j Let be the number of data points contained in the j-th vector. Y1 and X1 are the quantization boundary values ​​of the first block, and q1 is the quantization bit value of the first block. This indicates rounding down. index[a] is the quantization index value obtained after quantizing and compressing the a-th data of the j-th vector using equation (2), which is the first data.

[0140] It can be seen that the data in the j-th vector are traversed from 0 to M according to a. j -1 Executing formula (2) yields M j Each corresponding quantization index value is used as the first data. Then, the above operation is performed on the data in each vector of the first group to obtain the first data corresponding to the first group.

[0141] For example, the first group includes the first and second vectors of the second data, i.e., g1 = {D11, D21, D31, D12, D22, D32}, where D11 is the first data contained in the first vector of the second data, and D12 is the first data contained in the second vector of the second data. Furthermore, by sequentially applying equation (2) to the data in the first vector and the data in the second vector, the corresponding first data can be obtained. in, The index[a] obtained when g1[a] = D11 The index[a] obtained when g1[a] = D12, and so on, will not be elaborated further.

[0142] Method 2: The first data is determined through a table.

[0143] Specifically, the table is used to reflect the correspondence between the first data and the second data, which can be determined based on compression parameters (such as quantization boundaries and quantization bits).

[0144] For example, multiple data intervals of recovered data can be divided within a range based on quantization boundaries and quantization bits. Each data in the second data is mapped to a data interval of a certain recovered data within that range, thereby obtaining an index associated with that data, which serves as the first data.

[0145] For example, suppose the quantization boundary (Xi, Yi) = (0, 1) of the first group is divided according to the second data, and the quantization bits q1 = 3, as shown in Table 2 below.

[0146] Table 2

[0147] Therefore, each data point in the first group is mapped to the nearest recovered data point in Table 2, so as to obtain the corresponding index sequence according to Table 2. For example, the first group g1 = {D11,D21,D31,D12,D22,D32}, let D11 = 0.1, the nearest recovered data point to D11 is 1 / 7, so according to Table 2, the index corresponding to D11 is 1, that is, the first data point. And so on, without further explanation.

[0148] Therefore, after compressing the second data into groups, the corresponding grouped data can be obtained as the first data. The grouping of the first data follows the grouping of the second data, that is, the first data has the same number of groups as the second data, and the data in the i-th group of the first data corresponds to the data in the i-th group of the second data.

[0149] It should be noted that the above examples all illustrate the second data as being of a certain type of data (such as perceptual data), meaning that each vector in the second data has the same number of elements. However, in some possible implementations, the second data may also include two or more types of data. For example, the second data may be line data and surface data in geometric semantic data, or the second data may include 3D box data and perceptual data, etc. The above method can still be used to compress the second data to obtain the corresponding first data. This application does not limit the types of data that the second data can contain.

[0150] As can be seen from the above description, the first data is an index value obtained through quantization compression. Compared with the second data, the required index overhead is greatly reduced. Furthermore, the data type of the first data remains consistent with that of the second data after compression, and the number of data included in the first data is also the same as that included in the second data, ensuring that the characteristics of the data are not lost.

[0151] The process of determining the first message will now be explained in detail.

[0152] The first message can be a Media Access Control message (such as MAC CE), a Radio Resource Control message (such as RRC signaling), or other messages contained in the L2 or L3 layers of the protocol stack. In some possible implementations, the communication method described herein can also be applied to messages contained in the L1 layer of the protocol stack, such as uplink control information (UCI), without any specific limitations.

[0153] For example, the first message indicates the compression method used to obtain the first data based on the second data. For instance, the first message may include one or more of the information such as the index and sequence number corresponding to the compression method.

[0154] For example, the first message may include first information, which indicates the data type of the first data. It is understood that the type of the first data is the same as the type of the second data used to compress it. For instance, the first information may include one or more of the following: an index, a sequence number, etc., corresponding to the data type. For example, index 01 indicates that the first data is MPC data, index 02 indicates that the first data is perceptual data, index 03 indicates that the first data is 3D box data, index 04 indicates that the first data is geometric semantic data, etc. Further, when the first data is geometric semantic data, the first information may also include one or more of the following: an index, a sequence number, etc., indicating a subtype under the geometric semantic data. For example, index 11 indicates that the first data is point data in geometric semantic data, index 12 indicates that the first data is line data in geometric semantic data, etc. The first information may also indicate the permutation and combination of multiple data types through indexes, sequences, etc., when the first data includes multiple data types, or reuse the above-mentioned combination of single data type indices to indicate the multiple data types that the first data may include. Specific details will not be elaborated further.

[0155] For example, the first data may also include second information indicating that the first data corresponds to the data of each group in the second data. In conjunction with the above description of the first data, that is, the second information includes all the indices obtained after compressing the second data, or the index sequence obtained after compressing the data corresponding to each group in the second data.

[0156] For example, the first message may also include information indicating compression information to indicate the compression information to the second device, ensuring that the second device can decompress the first data and recover the decompressed data according to the received compression message.

[0157] For example, the first message may also include third information, which indicates the aforementioned first indication information. That is, the first message may indicate the grouping rules of the second data. In some possible implementations, the grouping rules are variable. For example, the grouping rules may change as the acquired second data changes. Please refer to the above description for details, which will not be repeated here, to achieve indication of the changing first indication information. For example, the third information can utilize... Each bit indicates the number of blocks K, N is the number of vectors in the second data, and is expressed in bits. Each bit indicates the group to which each vector in the second data belongs, where... This indicates rounding up to the nearest integer.

[0158] As the above analysis shows, the grouping rules can determine the number of groups and the group to which the vectors in the second data belong. In other words, the grouping rules can establish a one-to-one correspondence between the data in the first data and the data in the second data. Furthermore, by combining the grouping rules, the data obtained by decompressing the first data can be matched one-to-one with the data in the second data. In some embodiments, the data in the first data and the data in the second data are not in a one-to-one correspondence. The data in the first data is obtained by entropy encoding the data in the second data, and the original second data is obtained by entropy decoding during the decompression of the first data.

[0159] For example, the first message may also include a fourth message, which indicates the compression parameters mentioned above. In some possible implementations, the compression parameters may also be variable. For example, the compression parameters may also change as the second data is acquired. For details, please refer to the above description, which will not be repeated here, in order to indicate the changing compression parameters.

[0160] For example, the compression parameters include a first quantization parameter, and the fourth information can indicate the value of the first quantization parameter, such as indicating the value of the first quantization parameter of the j-th group, such as indicating the value of Xj, the value of Yj, or the values ​​of Xj and Yj, or indicating the index of the first quantization parameter, such as indicating the index corresponding to Xj, the index corresponding to Yj, or the index corresponding to Xj and Yj.

[0161] Specifically, taking the first group as an example, let the statistical range of the data in the first group be (0,1), and determine the quantization step size of the first quantization parameter, such as step = 2. This divides the statistical range into 2step intervals, with each interval's boundary value corresponding to an index value. Taking the first quantization parameter of the first group as the quantization boundary (X1, Y1) as an example, we can replace X1 with the smaller boundary value of its interval based on the interval where the value of X1 of the first group's quantization boundary lies, and replace Y1 with the larger boundary value of its interval based on the interval where the value of Y1 of the first group's quantization boundary lies. Then, based on the index corresponding to the interval's boundary value, we determine the index of the quantization boundary. See Table 3 for an example of a correspondence between the index of the first quantization parameter and the first quantization parameter itself.

[0162] Table 3

[0163] As explained above, after replacing the first quantization parameter with boundary values, the quantization boundary can be indicated by the index of the boundary value. For example, for the quantization boundary (X1, Y1) of the first group, if X1 ∈ {1 / 4, 2 / 4}, then the index corresponding to X1 is the index corresponding to the boundary value 1 / 4, which is 1. If Y1 ∈ {1 / 4, 2 / 4}, then the index corresponding to Y1 is the index corresponding to the boundary value 2 / 4, which is 2, and so on. In other words, the index value corresponding to the first quantization parameter of each group of the second data can be determined to indicate the first quantization parameter.

[0164] In one possible implementation, the interval containing the first quantization parameter can be further determined to indicate the first quantization parameter using a new index corresponding to the interval. For example, in conjunction with the above example, the new index corresponding to the index interval (0,1) can be set to 0, the new index corresponding to the index interval (1,2) to 1, the new index corresponding to the index interval (2,3) to 2, and the new index corresponding to the boundary value index interval (3,4) to 3. Then, if X1∈{1 / 4, 2 / 4} and the index interval is (1,2), then for the quantization boundary (X1,Y1) of the first group, X1 can be indicated by the new index = 1, and X1 corresponds to the smaller index value in the index interval. Similarly, if Y1∈{1 / 4, 2 / 4} and the index interval is (1,2), then Y1 can be indicated by the new index = 1, and Y1 corresponds to the larger index value in the index interval, so as to continue to determine the boundary value used to replace the quantization boundary X1 or Y1 according to Table 3. In some embodiments, the above interval values ​​may include boundary values ​​or may not include boundary values, or may only include one of the boundary values.

[0165] For example, compression parameters also include a second quantization parameter. The fourth information can also directly indicate the value of the second quantization parameter, such as directly indicating the value of the second quantization parameter qj for the j-th group, or indicating the index of the second quantization parameter. As shown in Table 4, Table 4 shows an example of a correspondence between the index of a second quantization parameter and the second quantization parameter.

[0166] Table 4

[0167] Alternatively, based on the above explanation of the second quantization parameter, the second quantization parameter can also be determined by combining the reference data range r0 and the reference quantization bit q0. In other words, the fourth information can also directly indicate the values ​​of r0 and q0 to indicate the second quantization parameter. For details, please refer to the above content, which will not be repeated here.

[0168] For example, the first message may also include fifth information, which indicates the geometric information of the geometric semantic data. For instance, the geometric information of line data is the number of line clusters, and the geometric information of surface data is the number of surfaces and the number of boundary points per surface. That is, when the second data is line data in the geometric semantic data, the fifth information can indicate the number of line clusters; when the second data is surface data in the geometric semantic data, the fifth information can indicate the number of surfaces and the number of boundary points per surface. This clearly indicates information in the geometric semantic data that may not be obtainable from the second data, enabling the first data obtained by combining the second data with compression to better determine the information of the geometric object.

[0169] The following section uses MAC and RRC messages as examples to illustrate the possible formats of the first message.

[0170] Scenario 1: The first message is a MAC message.

[0171] The content indicated by the first message (such as the first data) can be transmitted in a protocol data unit (PDU) of the MAC layer. The content indicating the first data can be stored by adding a control element (CE) to the MAC PDU. For example, as shown in Figure 4, the MAC subPDU is a newly inserted PDU structure in the MAC PDU. The MAC subPDU includes a subheader field and a MAC CE. The subheader field is used to carry information indicating the type of the first data, and the MAC CE is used to carry information indicating data related to the first data. Different subheader fields correspond to different MAC CEs. For example, if the subheader field indicates that the type of the first data is sensor data, then the corresponding MAC CE carries information indicating data related to sensor data. Or, if the subheader field indicates that the type of the first data is 3D box data, then the corresponding MAC CE carries information indicating data related to 3D box data. This will not be elaborated further.

[0172] For example, the aforementioned first information is carried in the subheading field. The reserved fields in the logical channel ID (LCID) or extended logical channel ID (eLCID) of the subheading field can be used to carry information about the type of the first data. For example, as shown in Figure 5, R is a reserved bit, LCID=35 indicates that the data type of the first data is sensory data (such as scatter compressed data), LCID=36 indicates that the data type of the first data is 3D box data (such as 3D box compressed data), LCID=37 indicates that the data type of the first data is geometric semantic data (such as geometric compressed data), and so on. Alternatively, the type of the first data can be defined in the MAC CE corresponding to a specific LCID, such as defining type=0,1… in the MAC CE corresponding to LCID=35 to indicate data types such as sensory data and 3D box data, respectively.

[0173] For ease of explanation, unless otherwise specified, the following text will use LCID=35, where LCID=35 indicates the first data carried by the corresponding MAC CE as the perceived data. The first data is obtained by compressing the second data and the second data includes K=3 groups, meaning that all parameters involved are presented in the form of three groups. Taking this as an example, we will continue to explain other possible structures of the MAC CE. It is understood that the relevant explanations below are all examples and can be extended to cases where the first data is other types of data, that is, cases where LCID is other values, or cases where the compressed information is different. No specific restrictions are imposed.

[0174] For example, the MAC CE includes a compressed data field (e.g., named compressed data or any other possible name), in which the aforementioned second information is carried. Specifically, the compressed data field stores the contents of the first data in groups. Multiple groups in the first data can be arranged in order of group number, or in reverse order, or in a specific order. The data contained in any group in the first data can also be arranged in order of data number, or in reverse order, or in a specific order, without any particular limitation. Furthermore, each data contained in the i-th group in the first data can be indicated using q1 bits, where q1 is the quantization bit corresponding to the i-th group.

[0175] For example, as shown in Figure 6, the first data has K = 3 groups, where the first group contains m*n data, where n is the number of vectors included in the second data corresponding to the i-th group, and m is the number of elements contained in each vector.

[0176] For example, MAC CE may also include a partition indication field (such as partition indication or any other possible name) to indicate the grouping rules of the second data, i.e., the aforementioned third information is carried in the data compression format field. Combining the above description of the grouping rules, it can be seen that the partition indication field stores the value of the number of groups K and the group to which the j-th vector of the second data belongs among the K groups. The number of groups k is determined by... Each bit indicates that the group to which the j-th vector belongs is... A number of bits indicate that N is the number of vectors in the second data. This indicates rounding up. For example, a possible implementation of the partition indicator field is shown in Figure 7. In the partition indicator field, the group number k and the information of the group to which the j-th vector of the N vectors (N=4) in the second data belong are arranged sequentially.

[0177] For example, the MAC CE may also include a quantization parameter field (such as a quantization parameter or any other possible name) to indicate the compression parameters used to compress the second data to obtain the first data; that is, the fourth information mentioned above is carried in the quantization parameter field. Specifically, the quantization parameter field may include the value of the first quantization parameter (i.e., the quantization boundary) and / or the value of the second quantization parameter (i.e., the quantization bits).

[0178] One implementation of the quantization parameter field is shown in Figure 8(a), which indicates only the first quantization parameter. Based on the above description of the process for determining the first quantization parameter, it may include the step size step and each quantization boundary corresponding to the i-th group, such as (Xi, Yi), where (Xi, Yi) can refer to the index corresponding to the quantization boundary or directly be the value of the quantization boundary. Another implementation of the quantization parameter field is shown in Figure 8(b), which indicates only the second quantization parameter, such as including the value of the quantization bit corresponding to the i-th group. The quantization parameter field may also indicate both the first and second quantization parameters simultaneously. The first and second quantization parameters can be arranged sequentially, as shown in Figure 8(c), or they can be arranged alternately, as shown in Figure 8(d), without any specific restrictions.

[0179] For example, the MAC CE may also include fields indicating geometric information for geometric semantic data, such as indicating the number of line clusters for line data and / or the number of faces and the number of boundary points for each face for face data. For example, the MAC CE may include a face parameter field (such as face parameters or any other possible naming), taking the face data as having two faces as an example, the specific format of which is shown in Figure 9(a); as another example, the MAC CE may include a line parameter field (such as line parameters or any other possible naming), which indicates the number of line clusters, the specific format of which is shown in Figure 9(b); as yet another example, the MAC CE may include a geometric parameter field (such as geometric parameters or any other possible naming), used to jointly indicate the geometric information of all possible geometric semantic data, as shown in Figure 9(c). The geometric parameter field may also include a subtype indicating the geometric semantic data included in the field, such as type = {0, 1, 2} representing the cases of {face, line, face & line} respectively, and the different geometric information in the geometric parameter field can be arranged sequentially according to data type or interleaved, without any specific limitation. That is, the fifth piece of information mentioned above can be contained in any of the following fields: surface parameter field, line parameter field, or geometric parameter field.

[0180] It is understandable that the "field" mentioned in Case 1 is one possible naming method. It can also be named as a domain, structure, data frame, or any other possible name, without any specific restrictions.

[0181] Scenario 2: The first message is an RRC message.

[0182] The content indicated by the first message (such as the first data) can be indicated by various elements based on the RRC sequence format. The following explanation uses any one of the following: perceptual data (such as scatter compressed data), 3D box data (such as 3D box compressed data), or geometric semantic data (such as geometric compressed data). The first data is obtained by compressing the second data, and the second data includes K=3 groups, meaning all parameters involved are presented in the form of three groups.

[0183] For example, the first information mentioned above is indicated by DataInfo in RRC SEQUENCE format.

[0184] For example:

[0185] In this example, the data type can be implicitly indicated by the presence or absence of the corresponding data type element (such as scatter-compressed-Data) in the DataInfo.

[0186] For example:

[0187] In this example, the data type can be indicated by a boolean variable indicating whether the data type (such as scatter-compressed-Data) exists, and if it exists, the indicator is true.

[0188] For example, the second information described above is indicated by a ScatterCompressedData element in RRC SEQUENCE format, which includes grouping information indicating the first data, such as:

[0189] Furthermore, the elements in each group are used to indicate the quantity and range of data within that group. For example:

[0190] SIZE(D1) indicates that the number of data in the first group is D1. The value of each data in the first group is indicated by q1 bits (e.g., q1 = 3). The format of the second and third groups is similar and will not be described again.

[0191] For example, the third information described above is indicated by adding a corresponding grouping indicator element under the sequence of each data type. The grouping indicator element can be named "partition indication" or any other possible name. For example, for the ScatterCompressedData data type:

[0192] ScatterCompressedData::=SEQUENCE{

[0193] partition-Indication PartitionIndication,

[0194] }

[0195] PartitionIndication is achieved through Each bit indicates the number of packets, k, and the packet to which the j-th vector belongs is... A number of bits indicate that N is the number of vectors in the second data. This indicates rounding up to the nearest integer. For example:

[0196] Wherein, fieldIndication1, fieldIndication2, fieldIndication3, and fieldIndication4 represent the groups in which the four vectors of the second data belong.

[0197] For example, the fourth piece of information described above is indicated by adding a corresponding compression parameter element under the sequence for each data type. This compression parameter element can be named `quantization param` or any other possible name. For example, for the `ScatterCompressedData` data type:

[0198] ScatterCompressedData::=SEQUENCE{

[0199] quantization-Param QuantizationParam,

[0200] }

[0201] The compression parameter element can indicate only the first quantization parameter (i.e., the quantization boundary), such as using 16 bits to indicate the step size and 3 bits to indicate the boundary value of each block, as shown below. It is understood that the number of indicator bits used in the example is merely illustrative and can be adjusted according to actual needs in the application; there are no restrictions.

[0202] The compression parameter element can indicate only the second quantization parameter (i.e., the quantization bit), such as using a 2-bit index bit to indicate the value of the quantization bit corresponding to each block, as shown below. It should be understood that the number of indicator bits used in the example is merely illustrative and can be adjusted according to actual needs in applications without limitation.

[0203] The compression parameter element can simultaneously indicate the first quantization parameter and the second quantization parameter, as shown below.

[0204] For example, the fifth information mentioned above is indicated by adding corresponding geometric information elements under the sequence of each data type. For example, it can be a face parameter element to indicate the number of faces and the number of boundary points of each face, a line parameter element to indicate the number of line clusters, or a geometric parameter element to jointly indicate the geometric information of all possible geometric semantic data.

[0205] For example, face parameter elements are named "face parameters" or any other possible name, as shown below for the ScatterCompressedData data type:

[0206] For example, line parameter elements are named "line parameters" or any other possible name, as shown below for the ScatterCompressedData data type:

[0207] For example, the geometric parameter element can be named "geometric parameters" or any other possible name. Taking the ScatterCompressedData data type as an example, the geometric parameter element can also include subtypes indicating the geometric semantic data included in the element, such as type = {0, 1, 2} representing {face, line, face & line} respectively. Furthermore, different geometric information in the geometric parameter field can be arranged sequentially by data type or interleaved; there are no specific restrictions. As shown below:

[0208] It is understandable that in scenarios 1 and 2 above, the way the first message indicates the first, second, third, fourth, or fifth information can be arbitrarily combined according to needs. For example, the first message can carry the first, second, and third information; the first message can carry the first, second, and fourth information; or the first message can carry the first, second, third, and fourth information, etc. Furthermore, one or more of the first, second, third, fourth, or fifth information can be set sequentially or alternately within the first message, without specific restrictions. Therefore, enabling the first message to indicate one or more of the compressed information while indicating the content of the first data—for example, not indicating the compressed information to reduce indication overhead when the compressed information has fixed parameters, and then indicating the corresponding changed information when the compressed information changes dynamically—is more suitable for situations where the compressed information changes dynamically.

[0209] In summary, in this embodiment, various types of second data are compressed to obtain corresponding types of first data, and the first data is carried in the first message for transmission, which can meet the diverse service needs of future communication systems. Furthermore, compared to directly transmitting the second data, transmitting the compressed first data can significantly reduce the communication overhead required for both the instruction data and the transmission data.

[0210] S302, the second device determines the third data based on the first message.

[0211] According to the first message, the second device can obtain information about the type of the first data, information about the data of each group in the K groups of the second data corresponding to the first data, first indication information for indicating the grouping rules of the second data, compression parameters for decompressing the i-th group in the K groups, and information indicating the geometric parameters of line data and surface data in the geometric semantic data when the second data is geometric semantic data.

[0212] Therefore, the second device can decompress the first data based on the first message to obtain the third data.

[0213] Method 3: If the first data satisfies equation (3), for example, if it is determined by calculation using equation (3), then the third data is determined based on the first data.

[0214] Specifically, the correspondence between the third data and the first data can satisfy the following equation (3).

[0215] Where R[i] is the third data and Index[i] is the corresponding first data. For the relevant explanation of Equation (3), please refer to the relevant content of Equation (2) of Method 1 in S301, which will not be repeated here.

[0216] Method 4: If the first data is determined through a table, determine the third data based on the first data.

[0217] Based on the relevant explanation of Method 2 in S301, it is easy to see that the recovery data (i.e., the third data) corresponding to the first data can be determined according to the correspondence between the first data (i.e., the index) and the table. Relevant examples and explanations can be found in Method 2, and will not be repeated here.

[0218] It is understood that, depending on the compression method, the data contained in the third data may be exactly the same as the data contained in the second data, or there may be an error between the data contained in the third data and the data contained in the second data that meets the accuracy requirements. This embodiment does not impose any restrictions.

[0219] In summary, this embodiment enables data transmission through the L2 and / or L3 layers of the protocol stack by indicating first data in the first message (which is a Media Access Control message or a Radio Resource Control message). Furthermore, the first data is data obtained by compressing the second data, reducing the overhead required for indicating and transmitting data. At the same time, the first message can also indicate the compression information used when compressing the second data, enabling the device receiving the first message to decompress the first data according to the compression information to obtain third data that is the same as the second data or whose error between the third and second data meets the accuracy requirements. This achieves low-power and high-efficiency data transmission in future communication systems, meets the diverse service needs of communication systems, and increases the flexibility of data transmission.

[0220] The communication method provided by the embodiments of this application has been described in detail above with reference to Figures 3-9. The communication apparatus used to perform the communication method provided by the embodiments of this application is described in detail below with reference to Figures 10-11.

[0221] Figure 10 is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Exemplarily, as shown in Figure 10, the communication device 1000 includes a transceiver module 1001 and a processing module 1002. For ease of explanation, Figure 10 only shows the main components of the communication device.

[0222] The communication device 1000 can be applied to the communication method of Figure 3 and the MAC message structure of Figures 4-9 to realize the corresponding functions. For example, the transceiver module 1001 can be used to implement the transmission and reception functions of the communication method shown in Figure 3, and the processing module 1002 can be used to implement other functions of the communication method of Figure 3 besides the transmission and reception functions.

[0223] Optionally, the transceiver module 1001 may include a transmitting module (not shown in FIG10) and a receiving module (not shown in FIG10). The transmitting module is used to implement the transmitting function of the communication device 1000, and the receiving module is used to implement the receiving function of the communication device 1000.

[0224] Optionally, the communication device 1000 may further include a storage module (not shown in FIG10) that stores programs or instructions. When the processing module 1002 executes the program or instructions, the communication device 1000 can perform the functions of the communication method shown in FIG3 and the MAC message structure shown in FIG4-9.

[0225] It is understood that the communication device 1000 may be a network device, or a chip (system) or other component or assembly that can be set in the network device, or a device that includes the network device. This application does not limit this.

[0226] Furthermore, the technical effects of the communication device 1000 can be referenced from the technical effects of the communication method described above, and will not be repeated here.

[0227] Figure 11 is a second schematic diagram of the structure of the communication device provided in an embodiment of this application. Exemplarily, the communication device can be a terminal, or a chip (system) or other component or assembly that can be disposed in the terminal. As shown in Figure 11, the communication device 1100 may include a processor 1101. Optionally, the communication device 1100 may further include a memory 1102 and / or a transceiver 1103. The processor 1101 is coupled to the memory 1102 and the transceiver 1103, for example, they can be connected via a communication bus.

[0228] The following is a detailed description of each component of the communication device 1100 with reference to Figure 11:

[0229] The processor 1101 is the control center of the communication device 1100. It can be a single processor or a collective term for multiple processing elements. For example, the processor 1101 can be one or more central processing units (CPUs), application-specific integrated circuits (ASICs), or one or more integrated circuits configured to implement the embodiments of this application, such as one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs).

[0230] Optionally, the processor 1101 can perform various functions of the communication device 1100 by running or executing software programs stored in the memory 1102 and calling data stored in the memory 1102, such as performing the communication method shown in FIG3 above.

[0231] In a specific implementation, as one embodiment, processor 1101 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG11.

[0232] In a specific implementation, as one embodiment, the communication device 1100 may also include multiple processors, such as processors 1101 and 1104 shown in FIG. 11. Each of these processors may be a single-core processor (single-CPU) or a multi-core processor (multi-CPU). Here, a processor may refer to one or more devices, circuits, and / or processing cores used to process data (e.g., computer program instructions).

[0233] The memory 1102 is used to store the software program that executes the solution of this application, and is controlled by the processor 901 to execute it. The specific implementation method can be referred to the above method embodiment, and will not be repeated here.

[0234] Optionally, the memory 1102 may be a read-only memory (ROM) or other type of static storage device capable of storing static information and instructions, random access memory (RAM) or other type of dynamic storage device capable of storing information and instructions, or electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but not limited thereto. The memory 1102 may be integrated with the processor 1101 or may exist independently and be coupled to the processor 1101 through the interface circuit of the communication device 1100 (not shown in FIG. 11). This application embodiment does not specifically limit this.

[0235] Transceiver 1103 is used for communication with other communication devices. For example, if communication device 1100 is a terminal, transceiver 1103 can be used to communicate with a network device or with another terminal device. As another example, if communication device 1100 is a network device, transceiver 1103 can be used to communicate with a terminal or with another network device.

[0236] Optionally, transceiver 1103 may include a receiver and a transmitter (not shown separately in Figure 11). The receiver is used to implement the receiving function, and the transmitter is used to implement the transmitting function.

[0237] Optionally, the transceiver 1103 can be integrated with the processor 1101 or exist independently and be coupled to the processor 1101 through the interface circuit of the communication device 1100 (not shown in FIG11). This application embodiment does not specifically limit this.

[0238] It is understood that the structure of the communication device 1100 shown in Figure 11 does not constitute a limitation on the communication device. Actual communication devices may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0239] Furthermore, the technical effects of the communication device 1100 can be referred to the technical effects of the method described in the above method embodiments, and will not be repeated here.

[0240] It should be understood that the processor in the embodiments of this application can be a central processing unit (CPU), or it can be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or any conventional processor.

[0241] It should also be understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of random access memory (RAM) are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate synchronous DRAM (DDR SDRAM), enhanced synchronous DRAM (ESDRAM), synchronous linked DRAM (SLDRAM), and direct rambus RAM (DR RAM).

[0242] The above embodiments can be implemented, in whole or in part, by software, hardware (such as circuits), firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded or executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more sets of available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. A semiconductor medium can be a solid-state drive.

[0243] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0244] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented 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 each specific application, but such implementation should not be considered beyond the scope of this application.

[0245] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0246] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0247] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0248] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0249] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0250] It should be understood that the term "and / or" in this article is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. A and B can be singular or plural. Additionally, the character " / " in this article generally indicates an "or" relationship between the preceding and following related objects, but it can also represent an "and / or" relationship. Please refer to the context for a more accurate understanding.

[0251] In this application, "at least one" means one or more, and "more than one" means two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple.

[0252] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0253] In this application, descriptions such as "when," "under the circumstances," "if," and "if" all refer to the device taking corresponding actions under certain objective circumstances. They are not time limits, nor do they require the device to perform a judgment action during implementation, nor do they imply any other limitations.

[0254] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented 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 each specific application, but such implementation should not be considered beyond the scope of this application.

[0255] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0256] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0257] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0258] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0259] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

[0260] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A communication method, characterized in that, The method includes: A first message is determined, indicating first data, which is data obtained by compressing second data according to compression information. The second data has N vectors, and the j-th vector among the N vectors has M. j There are elements, where N and M j All are positive integers, and j iterates from 1 to N; Send the first message, which is a media access control message or a radio resource control message.

2. A communication method, characterized in that, The method includes: Receive a first message, which is a data link message or a radio resource control message. The first message indicates first data, which is data obtained by compressing second data according to compression information. The second data has N vectors, and the j-th vector among the N vectors has M. j There are elements, where N and M j All are positive integers, and j iterates from 1 to N; Based on the first message, the third data is determined, and the second data is the data obtained by decompressing the first data according to the compression information.

3. The method according to claim 1 or 2, characterized in that, The number of elements M of the j-th vector among the N vectors j Satisfy M j =M, where M is a positive integer.

4. The method according to any one of claims 1-3, characterized in that, The second data includes data in K groups. The first data is obtained by compressing the data of the i-th group of the second data according to the compression parameters corresponding to the i-th group in the K groups. The compression information includes the compression parameters corresponding to the i-th group, and i traverses from 1 to K.

5. The method according to claim 4, characterized in that, The compression parameters corresponding to the i-th group include the first quantization parameter and / or the second quantization parameter corresponding to the i-th group. The first quantization parameter corresponding to the i-th group is the quantization boundary / data boundary corresponding to the i-th group, and the second quantization parameter corresponding to the i-th group is the quantization bit or quantization step size corresponding to the i-th group.

6. The method according to claim 4 or 5, characterized in that, The compression information also includes first indication information, which indicates the group to which the K value and the j-th vector of the second data belong in the K groups.

7. The method according to any one of claims 1-6, characterized in that, The second data is multipath component data, perception data, three-dimensional target bounding box data, or geometric semantic data, wherein the geometric semantic data includes at least one of the following: point data, line data, or surface data.

8. The method according to any one of claims 1-7, characterized in that, The first message includes first information, which indicates the type of the first data.

9. The method according to claim 8, characterized in that, The first message also includes second information, which indicates that the first data corresponds to the data of the i-th group among the K groups. The first data is obtained by compressing the data of the i-th group of the second data according to the compression parameters corresponding to the i-th group among the K groups, where i traverses from 1 to K.

10. The method according to claim 9, characterized in that, The first message also includes third information, which indicates first indication information, and the first indication information indicates the group to which the K value and the j-th vector of the second data belong in the K groups.

11. The method according to claim 10, characterized in that, The first message also includes fourth information, which indicates the compression parameters corresponding to the i-th group.

12. The method according to claim 11, characterized in that, The compression parameters corresponding to the i-th group include the first quantization parameter and / or the second quantization parameter corresponding to the i-th group. The first quantization parameter corresponding to the i-th group is the quantization boundary / data boundary corresponding to the i-th group. The second quantization parameter corresponding to the i-th group is the quantization bit or quantization step size corresponding to the i-th group. The fourth information includes at least one of the following: The value of the first quantization parameter corresponding to the i-th group, the index of the first quantization parameter corresponding to the i-th group, the value of the second quantization parameter corresponding to the i-th group, or the index of the second quantization parameter corresponding to the i-th group.

13. The method according to any one of claims 7-12, characterized in that, In the case that the second data is geometric semantic data, the first message further includes fifth information, which includes at least one of the geometric information of line data or the geometric information of surface data, and the geometric semantic data includes point data, the line data or the surface data.

14. The method according to claim 13, characterized in that, The geometric information of the line data includes the number of line clusters.

15. The method according to claim 13, characterized in that, The geometric information of the surface data includes the number of surfaces and the number of boundary points for each surface.

16. A communication device, characterized in that, include: A module for performing the method as described in any one of claims 1, 3-15, or a module for performing the method as described in any one of claims 2-15.

17. A communication device, characterized in that, The communication device includes: a processor; when the processor executes a computer program or instructions, it causes the communication device to perform the method as described in any one of claims 1, 3-15, or causes the communication device to perform the method as described in any one of claims 2-15.

18. The communication device according to claim 17, characterized in that, It also includes a memory for storing the computer program or instructions.

19. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a computer program or instructions that, when executed, cause the method as claimed in any one of claims 1, 3-15 to be performed, or cause the method as claimed in any one of claims 2-15 to be performed.

20. A computer program product, characterized in that, Includes a computer program or instructions that, when executed, cause the method as described in any one of claims 1, 3-15 to be performed, or cause the method as described in any one of claims 2-15 to be performed.

Images