Information reporting methods and communication equipment

Abstract

The present application discloses an information reporting method and a communication device. The method includes the steps of: obtaining first information, the first information indicating a first index or an index table corresponding to the first index; and transmitting a data format indicating the first information to a network device. The method described herein is useful for determining a specific table corresponding to the index from a plurality of index tables.

Description

[Technical Field]

[0001] [Related applications] This application claims priority to Chinese Patent Application No. 202211196975.7, filed with the State Intellectual Property Administration of China on 28 September 2022, which is incorporated herein by reference in its entirety.

[0002] [Technical field] This application relates to the field of communication technology, and more particularly to information reporting methods and communication equipment. [Background technology]

[0003] With the advancement of technology, extended reality (XR) technology is beginning to be researched. XR services require a large amount of data to be transmitted. Therefore, in the data transmission process, a large amount of data is buffered in the logical channel. The terminal device sends a buffer status report (BSR) to the network device to notify the network device of the amount of data buffered in the transmission logical channel.

[0004] Buffer status reports typically show the amount of data contained in a logical channel group using indexes and index tables. For example, Table 1 below is a conventional index table. [Table 1] [Table 1]

[0005] For example, suppose the buffer status report indicates that the index corresponding to the first logical channel group is 16. Based on Table 1, we can determine that the size of the data buffered in the first logical channel group is greater than 1038 bytes and less than or equal to 1446 bytes.

[0006] In Table 1, with the exception of index 0 and index 1, the ratio of the maximum buffer sections corresponding to two adjacent indices is 1.4. Therefore, the larger the index, the wider the range of buffered data size indicated by the index. For example, if the index is 2, the size of the corresponding buffered data is greater than 10 bytes and less than or equal to 14 bytes, and the length of the range section is 4 bytes. If the index is 30, the size of the corresponding buffered data is greater than 107,669 bytes and less than or equal to 150,000 bytes, and the length of the range section is 42,331 bytes. Because a larger index indicates a wider range of buffered data size, inappropriate allocation may occur when network devices schedule resources based on BSRs from terminal devices. For example, terminal devices may be allocated an excessive amount of resources.

[0007] Therefore, in conventional technology, the introduction of a new, more granular index table is expected to solve the above problems. Furthermore, terminal devices may use different index tables depending on different application scenarios. For this reason, how to distinguish between index tables corresponding to indexes in multiple tables is an urgent issue that needs to be resolved. [Overview of the project]

[0008] This invention proposes an information reporting method and communication device that are useful for determining a specific table corresponding to an index from among multiple index tables.

[0009] According to the first aspect, the present application proposes an information reporting method. The said method is A step of obtaining first information, wherein the first information indicates a first index or an index table corresponding to the first index, and the first index corresponds to one of at least two index tables, The step includes transmitting a data format representing the first information to a network device.

[0010] In possible implementations, the data format is one of the following: a media access control element (MAC CE), a service data unit, a protocol data unit set, downlink control information, or radio resource control signaling.

[0011] The media access control element (MAC CE) is MAC CE, the service data unit is SDU, the protocol data unit is PDU, downlink control information is DCI, or radio resource control signaling is RRC signaling.

[0012] In possible implementations, the data format includes a buffer status report.

[0013] In possible implementations, the first information indicates the data type or the data format, and the data format indicates the first index. This implementation helps determine a specific table corresponding to the first index from among multiple index tables.

[0014] In a possible implementation, the first information is the first index. This implementation helps determine a specific table from among multiple index tables that corresponds to the first index.

[0015] In a possible implementation, the at least two index tables include a first index table and a second index table. If the first information is greater than a first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than or equal to the first threshold, the first information indicates that the index table corresponding to the first index is the second index table. Alternatively, the at least two index tables include a first index table and a second index table. If the first information is greater than or equal to a first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than the first threshold, the first information indicates that the index table corresponding to the first index is the second index table.

[0016] In possible embodiments, the index table includes a correspondence between an index and second information. The at least two index tables include the first index table and the second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second information corresponding to two adjacent indexes in the index table. The adjacency ratio is the ratio between the second information corresponding to two adjacent indexes in the index table.

[0017] In possible implementations, the adjacency difference of the first index table is the same.

[0018] In possible implementations, the adjacency ratios of the first index table are the same, or the difference between the two adjacency ratios is less than the second threshold.

[0019] In a possible implementation, the first index table satisfies the following conditions: The difference in the adjacency relationship between two indexes belonging to the first value range of the first index table is equal to the first adjacency relationship difference; The difference in the adjacency relationship between two indexes belonging to the second value range of the first index table is equal to the second adjacency relationship difference; The ratio of the adjacency relationship between two indexes belonging to the third value range of the first index table is equal to the first adjacency relationship ratio; The ratio of the adjacency relationship between two indexes belonging to the fourth value range of the first index table is equal to the second adjacency relationship ratio. One or more of the above are satisfied. The first adjacency relationship difference is different from the second adjacency relationship difference, and the first adjacency relationship ratio is different from the second adjacency relationship ratio.

[0020] In a possible implementation, the minimum index of the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is 0 or M is an integer greater than 0.

[0021] In a possible implementation, the minimum index of the first index table is N. N is an integer greater than 0. The value range of the indexes included in the second index table is an integer between 0 and N - 1.

[0022] In a possible implementation, the method further includes the step of obtaining indication information. The indication information indicates the first index table.

[0023] In a possible implementation, the indication information indicates one or more of the following parameters: the number of indexes in the first index table, the maximum index in the first index table, the minimum index in the first index table, the second information in the first index table, the first range in the first index table, the difference in the adjacency relationship in the first index table, and the ratio of the adjacency relationship in the first index table.

[0024] In a possible implementation, the instruction information indicates the minimum index in the first index table. The method further includes the step of determining the first index table based on L preset buffer sections and the minimum index in the first index table. The difference between the minimum index in the first index table and the maximum index in the first index table is less than or equal to L, where L is an integer greater than 1.

[0025] According to a second aspect, the present invention proposes an information reporting method. The method includes the step of receiving a data format transmitted from a terminal device and indicating first information. The first information indicates a first index or an index table corresponding to the first index, the first index corresponding to one of at least two index tables.

[0026] In possible implementations, the data format is one of the following: a media access control element (MAC CE), a service data unit, a protocol data unit, downlink control information, or radio resource control signaling.

[0027] The media access control element (MAC CE) is MAC CE, the service data unit is SDU, the protocol data unit is PDU, downlink control information is DCI, or radio resource control signaling is RRC signaling.

[0028] In possible implementations, the data format includes a buffer status report.

[0029] In possible implementations, the first information indicates the data type or the data format, and the data format indicates the first index.

[0030] In a possible implementation, the first piece of information is the first index.

[0031] In a possible implementation, the at least two index tables include a first index table and a second index table. If the first information is greater than a first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than or equal to the first threshold, the first information indicates that the index table corresponding to the first index is the second index table. Alternatively, the at least two index tables include a first index table and a second index table. If the first information is greater than or equal to a first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than the first threshold, the first information indicates that the index table corresponding to the first index is the second index table.

[0032] In possible embodiments, the index table includes a correspondence between an index and second information. The at least two index tables include the first index table and the second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second information corresponding to two adjacent indexes in the index table. The adjacency ratio is the ratio between the second information corresponding to two adjacent indexes in the index table.

[0033] In possible implementations, the adjacency difference of the first index table is the same.

[0034] In possible implementations, the adjacency ratios of the first index table are the same, or the difference between the two adjacency ratios is less than the second threshold.

[0035] In a possible implementation, the first index table is subject to the following conditions: The difference in proximity relationship between two indices belonging to the first value range of the first index table is equal to the difference in first proximity relationship. The difference in proximity relationship between two indices belonging to the second value range of the first index table is equal to the difference in second proximity relationship. The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met. The first adjacent relationship difference is different from the second adjacent relationship difference, and the first adjacent relationship ratio is different from the second adjacent relationship ratio.

[0036] In a possible implementation, the minimum index of the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0037] In a possible implementation, the smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​included in the second index table is an integer between 0 and N-1.

[0038] In a possible implementation, the method further includes the step of transmitting instruction information to the terminal device, the instruction information indicating the first index table.

[0039] In possible implementations, the instruction information indicates one or more of the following parameters: the number of indexes in the first index table, the maximum index in the first index table, the minimum index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0040] According to a third aspect, the present invention proposes an information reporting method. The method includes the step of obtaining third information. The third information is of a first index and indicates an index table corresponding to a first granularity, and the index table is of a first index and corresponds to a first granularity, and is from one of at least two index tables.

[0041] In possible implementations, the first granularity is one of the following: logical channel groups, logical channels, protocol data unit sets, and quality of service flows.

[0042] In possible implementations, the third piece of information relates to a bitmap.

[0043] In a possible implementation, the third information is configuration information related to the first granularity, and the information parameter of the configuration information is the identifier of the first granularity.

[0044] In possible embodiments, the index table includes a correspondence between an index and second information. The at least two index tables include the first index table and the second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second information corresponding to two adjacent indexes in the index table. The adjacency ratio is the ratio between the second information corresponding to two adjacent indexes in the index table.

[0045] In possible implementations, the adjacency difference of the first index table is the same.

[0046] In possible implementations, the adjacency ratios of the first index table are the same, or the difference between the two adjacency ratios is less than the second threshold.

[0047] In a possible implementation, the first index table is subject to the following conditions: The difference in proximity relationship between two indices belonging to the first value range of the first index table is equal to the difference in first proximity relationship. The difference in proximity relationship between two indices belonging to the second value range of the first index table is equal to the difference in second proximity relationship. The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met. The first adjacent relationship difference is different from the second adjacent relationship difference, and the first adjacent relationship ratio is different from the second adjacent relationship ratio.

[0048] In a possible implementation, the minimum index of the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0049] In a possible implementation, the smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​included in the second index table is an integer between 0 and N-1.

[0050] In a possible implementation, the method further includes the step of obtaining instruction information, which indicates the first index table.

[0051] In possible implementations, the instruction information indicates one or more of the following parameters: the number of indexes in the first index table, the maximum index in the first index table, the minimum index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0052] In a possible implementation, the instruction information indicates the minimum index in the first index table. The method further includes the step of determining the first index table based on L preset buffer sections and the minimum index in the first index table. The difference between the minimum index in the first index table and the maximum index in the first index table is less than or equal to L, where L is an integer greater than 1.

[0053] In a possible implementation, the method is for the first index, and the index table corresponding to the target granularity is the first index table, and if the target information value of the target granularity is less than or equal to the second threshold, there is no need to report the data format at that time, and further includes reporting the data format after the target information value of the target granularity has grown greater than the third threshold.

[0054] According to a fourth aspect, the present invention proposes an information reporting method. The method includes the step of transmitting third information to a terminal device. The third information indicates an index table of a first index corresponding to a first granularity, the index table being from one of at least two index tables.

[0055] In possible implementations, the first level of granularity is one of the following: logical channel groups, logical channels, protocol data units, and quality of service flows.

[0056] In possible implementations, the aforementioned third piece of information is related to a bitmap.

[0057] In a possible implementation, the third information is configuration information related to the first granularity, and the information parameter of the configuration information is the identifier of the first granularity.

[0058] In possible embodiments, the index table includes a correspondence between an index and second information. The at least two index tables include the first index table and the second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second information corresponding to two adjacent indexes in the index table. The adjacency ratio is the ratio between the second information corresponding to two adjacent indexes in the index table.

[0059] In possible implementations, the adjacency difference of the first index table is the same.

[0060] In possible implementations, the adjacency ratios of the first index table are the same, or the difference between the two adjacency ratios is less than the second threshold.

[0061] In a possible implementation, the first index table is subject to the following conditions: The difference in proximity relationship between two indices belonging to the first value range of the first index table is equal to the difference in first proximity relationship. The difference in proximity relationship between two indices belonging to the second value range of the first index table is equal to the difference in second proximity relationship. The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met. The first adjacent relationship difference is different from the second adjacent relationship difference, and the first adjacent relationship ratio is different from the second adjacent relationship ratio.

[0062] In a possible implementation, the minimum index of the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0063] In a possible implementation, the smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​included in the second index table is an integer between 0 and N-1.

[0064] In a possible implementation, the method further includes the step of transmitting instruction information to the terminal device, the instruction information indicating the first index table.

[0065] In possible implementations, the instruction information indicates one or more of the following parameters: the number of indexes in the first index table, the maximum index in the first index table, the minimum index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0066] According to a fifth aspect, the present invention proposes an information reporting method. The method includes the step of obtaining a fourth piece of information, which represents a first index table.

[0067] In possible implementations, the fourth information indicates one or more of the following parameters: the number of indexes in the first index table, the maximum index in the first index table, the minimum index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0068] In a possible implementation, the terminal device determines one or more index tables. If two index tables are determined, the two index tables include the first index table and the second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second pieces of information corresponding to two adjacent indices in the index table. The adjacency ratio is the ratio between the second pieces of information corresponding to two adjacent indices in the index table.

[0069] In possible implementations, the adjacency difference of the first index table is the same.

[0070] In possible implementations, the adjacency ratios of the first index table are the same, or the difference between the two adjacency ratios is less than the second threshold.

[0071] In a possible implementation, the first index table is subject to the following conditions: The difference in proximity relationship between two indices belonging to the first value range of the first index table is equal to the difference in first proximity relationship. The difference in proximity relationship between two indices belonging to the second value range of the first index table is equal to the difference in second proximity relationship. The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met. The first adjacent relationship difference is different from the second adjacent relationship difference, and the first adjacent relationship ratio is different from the second adjacent relationship ratio.

[0072] In a possible implementation, the minimum index of the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0073] In a possible implementation, the smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​included in the second index table is an integer between 0 and N-1.

[0074] In possible implementations, the fourth piece of information is transmitted from the network device.

[0075] According to a sixth aspect, the present invention proposes an information reporting method. The method includes the step of transmitting fourth information to a terminal device. The fourth information represents a first index table.

[0076] In possible implementations, the instruction information indicates one or more of the following parameters: the number of indexes in the first index table, the maximum index in the first index table, the minimum index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0077] According to the seventh aspect, the present application provides a communication device. The communication device may be a terminal device or a network device, equipment of the terminal device or the network device, or equipment that can be used in conjunction with the terminal device or the network device. The communication device may, alternatively, be a chip system. The communication device can implement any one of the first, second, third, fourth, fifth, or sixth aspects and their possible implementations. The functions of the communication device may be implemented by hardware or by hardware running corresponding software. The hardware or software includes one or more units or modules corresponding to the functions described above. The units or modules may be software and / or hardware. For the operations and effects performed by the communication device, see the advantageous effects corresponding to the first, second, third, fourth, fifth, or sixth aspects and their possible implementations. Further details will not be described again here.

[0078] According to the eighth aspect, the present application provides a communication device, the communication device including a processor, the processor calling a computer program in memory, and any one of the first, second, third, fourth, fifth, or sixth aspects, or any possible implementations thereof, is performed.

[0079] According to the ninth aspect, the present application provides a communication device, the communication device including a processor and memory, the processor and memory being coupled, the processor being configured to implement the first, second, third, fourth, fifth, or sixth aspect and possible implementations thereof.

[0080] According to the tenth aspect, the present application provides a communication device, the communication device including a processor and an interface circuit. The interface circuit is configured to receive signals from a communication device other than the communication device and transmit the signals to the processor, or to transmit signals from the processor to a communication device other than the communication device. The processor is configured to implement the first, second, third, fourth, fifth, or sixth aspect and possible implementations thereof by means of logic circuits or by executing code instructions.

[0081] According to the eleventh aspect, the present application provides a computer-readable storage medium for storing a computer program or instruction. When the computer program or instruction is executed by a communication device, one of the first, second, third, fourth, fifth, or sixth aspects, or any possible implementation thereof, is performed.

[0082] According to the twelfth aspect, the present application provides a computer program product including instructions. When a computer reads and executes the computer program product, the computer is made executable according to the first, second, third, fourth, fifth, or sixth aspect, and possible implementations thereof. [Brief explanation of the drawing]

[0083] [Figure 1] This is a schematic diagram of the architecture of a communication system according to one embodiment of the present invention.

[0084] [Figure 2] This is a schematic flowchart of an information reporting method according to one embodiment of the present invention.

[0085] [Figure 3] This is a schematic diagram of the format of a short BSR according to one embodiment of the present invention.

[0086] [Figure 4]This is a schematic diagram of the format of an extended short BSR according to one embodiment of the present invention.

[0087] [Figure 5] This is a schematic diagram of the format of a long BSR according to one embodiment of the present invention.

[0088] [Figure 6] This is a schematic diagram of the format of the extended long BSR according to the embodiment of the present invention.

[0089] [Figure 7] This is a schematic diagram of the format of a new long BSR according to one embodiment of the present invention.

[0090] [Figure 8] This is a schematic flowchart of another information reporting method according to one embodiment of the present invention.

[0091] [Figure 9] This is a schematic flowchart of another information reporting method according to one embodiment of the present invention.

[0092] [Figure 10] This is a schematic diagram of the structure of a communication device according to an embodiment of the present invention.

[0093] [Figure 11] This is a schematic diagram of the structure of a communication device according to one embodiment of the present invention.

[0094] [Figure 12] This is a schematic diagram of the chip structure according to one embodiment of the present invention. [Modes for carrying out the invention]

[0095] Specific embodiments of the present application are described in further detail below with reference to the accompanying drawings.

[0096] The terms “First,” “Second,” etc., in the specification, claims, and accompanying drawings of this application are intended to distinguish different objects and not to describe a particular order. Furthermore, the terms “contains” and “has” or other variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the listed steps or units, but instead may optionally include steps, units, etc. not listed, or may optionally include other steps or units specific to these processes, methods, products, or apparatus.

[0097] The “embodiments” described herein mean that certain features, structures, or characteristics described with reference to an embodiment may be included in at least one embodiment of the present application. The occurrence of phrases in various places in this specification does not necessarily refer to the same embodiment, and another embodiment or alternative embodiment is not mutually exclusive with the other embodiments. Those skilled in the art will understand, both explicitly and implicitly, that the embodiments described herein can be combined with other embodiments.

[0098] In this specification, “at least one” means one or more, “multiple” means two or more, and “at least two” means two or three or more. The term “and / or” describes a correspondence between related objects and indicates that three associations may exist. For example, “A and / or B” may indicate that only A exists, only B exists, and both A and B exist. A and B may be singular or plural. The letter “ / ” usually indicates an “or” relationship between related objects. “At least one of the following items” or similar expressions represent any combination of these items, including single items or any combination of multiple items. For example, at least one of a, b, or c may represent a, b, c, “a and b”, “a and c”, “b and c”, or “a, b, and c”, where a, b, and c may be singular or plural.

[0099] The system architecture in the embodiment of this invention is described below.

[0100] To facilitate understanding of the technical solutions of the embodiments of this application, the system architecture of the method provided in the embodiments of this application is briefly described below. It should be understood that the system architecture described in the embodiments of this application is intended to provide a clearer explanation of the technical solutions in the embodiments of this application and does not constitute a limitation on the technical solutions provided in the embodiments of this application.

[0101] The technical solutions in the embodiments of this application may be applied to various communication systems, for example, satellite communication systems or conventional mobile communication systems. Satellite communication systems may be integrated with conventional mobile communication systems (i.e., terrestrial communication systems). Communication systems may be, for example, wireless local area network (WLAN) communication systems, wireless fidelity (WiFi) systems, long-term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, 5th generation (5G) systems or new radio (NR) systems, 6th generation (6G) systems, and other future communication systems. Communication systems integrating multiple wireless technologies are further supported. For example, the technical solution may be applied to a system in which a non-terrestrial network (NTN) is integrated into a terrestrial mobile communication system, such as an unmanned aerial vehicle, a satellite communication system, or a high-altitude platform station (HAPS).

[0102] Figure 1 shows an example of a communication system to which an embodiment of the present invention is applied. The communication system includes at least one network device 110 and at least one terminal device. In Figure 1, one terminal device and one network device are used as examples. The terminal device is connected to the network device and can perform data communication. Of course, the number of terminal devices and network devices in Figure 1 are merely examples, and the number of terminal devices and network devices may be fewer or more.

[0103] The network equipment in this application may include evolved NodeBs (eNBs or eNodeBs) in LTE, base stations in 5G networks, other base stations that will evolve in the future, broadband network gateways (BNGs), aggregation switches, 3rd generation partnership project (3GPP) access devices, etc. This is not specifically limited to the embodiments of this application. For example, the base stations in the embodiments of this application may include various forms of base stations such as transmitting and receiving points (TRPs), macro base stations, micro base stations (also called small stations), relay stations, access points, next-generation base stations (gNodeBs, gNBs), transmitting points (TPs), or mobile switch centers, or devices that provide wireless access functions in device-to-device (D2D), vehicle-to-everything (V2X), machine-to-machine (M2M), or Internet of Things communications. This is not specifically limited to the embodiments of the present application.

[0104] In embodiments of the present application, the equipment configured to implement the functions of a network device may be a network device, or it may be equipment capable of performing the functions of a network device, such as a chip system, or a combination of devices or components. The equipment may be mounted within a network device. The technical solutions provided in embodiments of the present application will be described using an example in which the equipment configured to implement the functions of a network device is a network device.

[0105] The terminal device in the embodiment of the present application may be a device having wireless transceiver functionality, and may be user equipment (UE), access terminal, subscriber unit, subscriber station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent, or user device. Terminal devices include cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminals in device-to-device (D2D) communication, terminals in vehicle-to-everything (V2X) communication, virtual reality (VR) terminal devices, augmented reality (AR) terminal devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical care, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, and wireless terminals in future communication networks. This is not limited to these.

[0106] Furthermore, in the embodiments of the present application, the terminal device may be a device configured to implement the functions of the terminal device, or a device that can assist the terminal device in implementing its functions, such as a chip system. The device may be mounted within the terminal device. For example, the terminal device may alternatively be a vehicle detector or sensor at a gas station.

[0107] Based on the above description of the communication system, the background of the embodiments of this application will be explained below.

[0108] With the advancement of technology, extended reality (XR) technology is beginning to be researched. XR services require a large amount of data to be transmitted. Therefore, in the data transmission process, a large amount of data is buffered in the logical channel. The terminal device sends a buffer status report (BSR) to the network device to notify the network device of the amount of data buffered in the transmission logical channel.

[0109] Buffer status reports typically show the amount of data contained in a logical channel group using indexes and index tables. For example, Table 1 below is a conventional index table. [Table 1] [Table 2]

[0110] For example, suppose the buffer status report indicates that the index corresponding to the first logical channel group is 16. Based on Table 1, we can determine that the size of the data buffered in the first logical channel group is greater than 1038 bytes and less than or equal to 1446 bytes.

[0111] In Table 1, with the exception of index 0 and index 1, the ratio between the maximum buffer sections corresponding to two adjacent indices is 1.4. Therefore, the larger the index, the wider the range of buffered data size indicated by the index. For example, if the index is 2, the size of the corresponding buffered data is greater than 10 bytes and less than or equal to 14 bytes, and the length of the range section is 4 bytes. If the index is 30, the size of the corresponding buffered data is greater than 107,669 bytes and less than or equal to 150,000 bytes, and the length of the range section is 42,331 bytes. Because a larger index indicates a wider range of buffered data size, inappropriate allocation may occur when network devices schedule resources based on BSRs from terminal devices. For example, terminal devices may be allocated an excessive amount of resources.

[0112] Therefore, in conventional technology, the introduction of new, more granular index tables is expected to solve the above problems. However, the definition and types of index tables are not yet established. Furthermore, terminal devices may use different index tables depending on different application scenarios. For this reason, how to distinguish between index tables corresponding to indexes in multiple tables is an urgent issue that needs to be resolved.

[0113] To distinguish index tables corresponding to indexes, embodiments of the present application propose an information reporting method. Refer to Figure 2. As shown in Figure 2, the information reporting method includes the following steps 201 and 202. The implementers of the method shown in Figure 2 may be terminal devices and network devices, or chips within terminal devices or chips within network devices. Figure 2 illustrates an example where the implementers of the method are terminal devices and network devices. The implementers of the method are not limited to these embodiments of the present application.

[0114] 201: The terminal device acquires first information. The first information indicates the first index or the index table corresponding to the first index, and the first index corresponds to one of at least two index tables.

[0115] In these embodiments of the present application, the first index represents second information of first granularity. The index table includes a correspondence between the index and the second information. The fact that the first index corresponds to one of at least two index tables can be understood as the first index being an index from one of at least two index tables. The second information of first granularity represented by the first index is determined based on the first index and the index table corresponding to the first index. Alternatively, the second information may be the maximum, minimum, or intermediate value within a section of the index table, the length of the section, or the maximum, minimum, or intermediate value within the index table. The at least two index tables include the first index table and the second index table. Note that the first and second index tables are merely examples provided in this application. The at least two index tables may, alternatively, include multiple index tables, such as a third index table. The number of index tables is not limited to these embodiments of the present application. The following uses the first and second index tables as examples. The number of index tables included in at least two index tables is not limited to these embodiments of the present application. Optionally, at least two index tables include index tables that are already defined in the current 3GPP R17 standard V17.2.0, such as Table 1 in the description above.

[0116] In possible implementations, the first granularity may be one of the following: Logical Channel (LCH), Logical Channel Group (LCG), Protocol Data Unit Set (PDU set), and Quality of Service Flow (Qos Flow). Optionally, the first index is an index included in the Buffer Status Report (BSR), the first granularity is the LCG, and the second information is the buffer section. In this implementation, the first index indicates the buffer section corresponding to the size of the data buffered in the LCG. Specifically, the buffer section corresponding to the size of the data buffered in the LCG may be determined based on the first index and the table corresponding to the first index.

[0117] BSR formats can be classified into short BSR formats and long BSR formats.

[0118] Figure 3 is a schematic diagram of the format of a short BSR according to one embodiment of the present invention. The short BSR contains only one LCG identifier and a first index corresponding to the LCG. The short BSR contains 1 byte. The field length corresponding to the LCG identifier is 3 bits. The field length corresponding to the first index is 5 bits.

[0119] Figure 4 is a schematic diagram of the format of an extended short BSR according to one embodiment of the present invention. The extended short BSR contains only one LCG identifier and a first index corresponding to the LCG. The extended short BSR contains 2 bytes. The field length corresponding to the LCG identifier is 8 bits. The field length corresponding to the first index is 8 bits.

[0120] Figure 5 is a schematic diagram of the format of a long BSR according to one embodiment of the present invention. The long BSR can indicate a first index corresponding to 8 LCGs. The long BSR contains m+1 bytes. The field length corresponding to the first index is 8 bits. m is the number of LCGs whose corresponding bit is the first bit of the BSR, and the value range of m is 1 to 8. i If the bit corresponding to is the first bit, then LCG is set in BSR. i This indicates that the first index corresponding to LCG is included. i If the corresponding bit is the second bit, then the BSR is LCG i This indicates that the first index corresponding to LCG4-LCG7 is not included. The value range of I is 0 to 7. The first bit is 0 and the second bit is 1. Alternatively, the first bit is 1 and the second bit is 0. For example, in a long BSR, the first bit corresponds to LCG0-LCG3 and the second bit corresponds to LCG4-LCG7. It can be understood that the first index 0 indicates the buffer section corresponding to the size of the data buffered in LCG0, the first index 1 indicates the buffer section corresponding to the size of the data buffered in LCG1, the first index 2 indicates the buffer section corresponding to the size of the data buffered in LCG2, and the first index 3 indicates the buffer section corresponding to the size of the data buffered in LCG3. This long BSR does not include the first index corresponding to LCG4-LCG7.

[0121] Figure 6 is a schematic diagram of the format of an extended long BSR according to an embodiment of the present invention. The extended long BSR can indicate a first index corresponding to 256 LCGs. The long BSR contains m + 32 bytes. The field length corresponding to the first index is 8 bits. m is the number of LCGs whose corresponding bit is the first bit of the BSR, and the value range of m is 1 to 256. Similar to the format of the long BSR, LCG i If the bit corresponding to is the first bit, then LCG is set in BSR. iThis indicates that the first index corresponding to LCG is included. i If the corresponding bit is the second bit, then the BSR is LCG i This indicates that the corresponding first index is not included. The value range of I is 0 to 255. The first bit is 0 and the second bit is 1. Alternatively, the first bit is 1 and the second bit is 0.

[0122] The first index indicates the buffer section corresponding to the size of the data to be buffered in the LCG. Specifically, the buffer section corresponding to the size of the data to be buffered in the LCG may be determined based on the first index and the table corresponding to the first index. For example, use Tables 2 and 3 below as examples. [Table 2] [Table 3] [Table 3] [Table 4]

[0123] The first piece of information is that the first index A is 2, and the table corresponding to the first index A is Table 2 of the two tables mentioned above. It may also be determined that the first index A indicates that the size of the data buffered in the logical channel group is within a buffer section of 2 to 4 bytes. The first piece of information is that the first index B is 2, and the table corresponding to the first index B is Table 3 of the two tables mentioned above. First index B This may indicate that the size of the data buffered in the logical channel group is within a buffer section of 10 to 14 bytes.

[0124] In possible implementations, the first information may indicate the first index or the index table corresponding to the first index in the following manner, where the first index corresponds to at least one of two index tables. Alternatively, the first information may indicate the first index or the index table corresponding to the first index in another manner. This is not limited to the present embodiment of the application.

[0125] 1. The first piece of information indicates the first index.

[0126] Method 1: The first information indicates the data type or data format. The data format includes a first index or includes information indicating a first index. Optionally, the first information is a logical channel identifier (LCID). For example, at least two index tables include a first index table and a second index table. If the LCID corresponding to the data format is the first LCID, the data format may be determined based on the first LCID. The data format includes a first index or includes information indicating a first index. The table corresponding to the first index is the first index table. Therefore, based on the first LCID, the index table corresponding to the first index may be determined to be the first index table. If the LCID corresponding to the data format is the second LCID, the data format may be determined based on the second LCID. The data format includes a first index or includes information about a first index. The table corresponding to the first index is the second index table. Therefore, based on the second LCID, the index table corresponding to the first index may be determined to be the second index table. This implementation helps determine which table corresponds to the first index from among multiple index tables.

[0127] Method 2: The first information is the first index. In this implementation, the index table corresponding to the first index may be determined based on the value of the first index. For example, at least two index tables include a first index table and a second index table. If the first information is greater than the first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than or equal to the first threshold, the first information indicates that the index table corresponding to the first index is the second index table. Alternatively, if the first information is greater than or equal to the first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than the first threshold, the first information indicates that the index table corresponding to the first index is the second index table. The first and second index tables may form a single index table or two different index tables. Optionally, the first threshold may be configured or predefined by the network device. This implementation helps determine the specific table corresponding to the first index.

[0128] 2. The first piece of information indicates the index table corresponding to the first index.

[0129] Method 3: The first piece of information indicates an index table corresponding to the first index. Optionally, the first piece of information may be instruction information newly defined in this application. The instruction information directly indicates an index table corresponding to the first index. Further optionally, the first index is an index held in the BSR. The first piece of information is an indication of the data format holding the BSR. The first piece of information indicates an index table corresponding to the first index. For example, FIG. 7 is a schematic diagram of the format of a new long BSR according to an embodiment of this application. The long BSR includes eight instructions. The first piece of information is an instruction. Instruction i indicates an index table corresponding to the first index corresponding to LCGi, and the value range of i is from 0 to 7. Assume that at least two index tables include a first index table and a second index table. If the bit indicated by instruction i is the first bit, it indicates that the index table corresponding to the first index corresponding to LCG i is the first index table. If the bit indicated by instruction i is the second bit, LCG i is the second index table. The first bit is 0 and the second bit is 1. Alternatively, the first bit is 1 and the second bit is 0. Alternatively, according to this method, a new BSR format can also be defined for the extended long BSR format. The new BSR includes 256 instructions. The specific implementation is the same as that of the long BSR and will not be described in detail here. In this embodiment of this application, only how the instruction information indicates the index table corresponding to the first index when there are two index tables will be described. When there are multiple index tables, similarly, the instruction information may indicate the index table corresponding to the first index according to a similar method. This is not limited in this embodiment of this application. This implementation helps to determine a specific table corresponding to the first index from multiple index tables.

[0130] Based on the above explanation of the first piece of information, the following will primarily describe the index table.

[0131] In a possible implementation, at least two index tables include a first index table and a second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second pieces of information corresponding to two adjacent indexes in the index table. The adjacency ratio is the ratio between the second pieces of information corresponding to two adjacent indexes in the index table.

[0132] The existence of an adjacency difference in the first index table that is smaller than the adjacency difference in the second index table can be understood as the first index table containing multiple adjacency differences, the second index table containing multiple adjacency differences, and at least one of the multiple adjacency differences in the first index table being smaller than the adjacency difference in the second index table. Similarly, the existence of an adjacency ratio in the first index table that is smaller than the adjacency ratio in the second index table can be understood as the first index table containing multiple adjacency ratios, the second index table containing multiple adjacency ratios, and at least one of the multiple adjacency ratios in the first index table being smaller than the adjacency ratio in the second index table.

[0133] Optionally, if the first index is an index included in the BSR, the first granularity is LCG. The second information can be understood as the maximum, minimum, or median value within the buffer section corresponding to the first index, or the length of the buffer section. Let's use an example where the second information is the maximum value within the buffer section. The adjacency difference can be understood as the difference between the maximum values ​​within the buffer sections corresponding to two adjacent indexes in the index table. In this case, the adjacency difference can also be understood as the lengths of the buffer sections corresponding to the two indexes. The adjacency ratio can be understood as the ratio of the maximum value within the buffer section corresponding to the second index to the maximum value within the buffer section corresponding to the third index in the index table. The second and third indexes are two adjacent indexes in the index table, and the value of the second index is greater than the value of the third index.

[0134] For example, suppose in an index table, the buffer section corresponding to index 1 is (10, 20) and the buffer section corresponding to index 2 is (20, 30). Index 1 and index 2 are two adjacent indexes. In the index table, the adjacency difference is the difference of 10 between the maximum values ​​in the buffer sections corresponding to index 1 and index 2.

[0135] In another example, suppose in an index table, the buffer section corresponding to index 1 is (10,20) and the buffer section corresponding to index 2 is (20,40). Index 1 and index 2 are two adjacent indexes. In an index table, the adjacency ratio is 2, which is the ratio between the maximum values ​​in the buffer sections corresponding to index 1 and index 2.

[0136] The existence of an adjacency difference in the first index table that is smaller than the adjacency difference in the second index table, or the existence of an adjacency ratio in the first index table that is smaller than the adjacency ratio in the second index table, can be understood as the granularity of the buffer section of the first index table being smaller than the granularity of the buffer section of the second index table, or the step value of the buffer section of the first index table being smaller than the step value of the buffer section of the second index table.

[0137] For example, use Tables 4 and 5 below as examples. [Table 4] [Table 5] [Table 5] [Table 6]

[0138] Assume that the first index table is Table 4 and the second index table is Table 5. We can calculate that the adjacency difference for the first index table is 2, and the adjacency difference for the second index table is 3. Therefore, the adjacency difference for the first index table is smaller than that for the second index table. In this case, if the index table corresponding to the first index is the first index table, the indicated range for the size of the buffered data is smaller than that for the second index table.

[0139] For example, use Tables 6 and 7 below as examples. [Table 6] [Table 7] [Table 7] [Table 8]

[0140] Assume that the first index table is Table 6 and the second index table is Table 7. We can calculate that the adjacency ratio of the first index table is 2 and the adjacency ratio of the second index table is 3. Therefore, the adjacency ratio of the first index table is smaller than that of the second index table. In this case, if the index table corresponding to the first index is indeed the first index table, the indicated range of the buffered data size is smaller than that of the second index table.

[0141] Furthermore, in this embodiment of the present application, we use examples where all adjacency differences in the first index table are smaller than the adjacency differences in the second index table, and examples where all adjacency ratios in the first index table are smaller than the adjacency ratios in the second index table. Alternatively, there may be cases where only some of the adjacency differences in the first index table are smaller than the adjacency differences in the second index table, or where only some of the adjacency ratios in the first index table are smaller than the adjacency ratios in the second index table. Related examples can be similarly obtained based on the above examples and are not described in this specification in this embodiment of the present application.

[0142] Furthermore, optionally, the second index table may be a table already defined in the current 3GPP R17 standard V17.2.0, for example, Table 1 in the above description. The first index table is a new index table defined in this embodiment of the present application, and its granularity is smaller than that of the second index table.

[0143] Based on the first index table described above, the granularity of the first index table is introduced below.

[0144] In possible implementations, the adjacency difference of the first index table is the same. The adjacency difference is the difference between the second pieces of information corresponding to two adjacent indexes in the index table. Optionally, if the second piece of information is a buffer section, the adjacency difference can be understood as the difference between the maximum values ​​in the buffer sections corresponding to two adjacent indexes in the index table. Alternatively, the adjacency difference can also be understood as the lengths of the buffer sections corresponding to the two indexes. For example, suppose the buffer section width for index 2 is (2,4). The length of the buffer section is 2, and therefore the adjacency difference is 2. Since the maximum value of the buffer section corresponding to index 2 is 4, we can determine that the buffer section corresponding to index 3 is (4,6).

[0145] In another possible implementation, the adjacency ratio between the second pieces of information corresponding to two adjacent indices in the first index table is the same, or the difference between the two adjacency ratios is less than the second threshold. The adjacency ratio is the ratio between the second pieces of information corresponding to two adjacent indices in the index table. The difference between the two adjacency ratios being less than the second threshold, and the second threshold being approximately 0, can be understood as all adjacency ratios in the first index table being approximately the same. Optionally, if the second piece of information is a buffer section, the adjacency ratio can be understood as the ratio between the maximum values ​​in the buffer sections corresponding to two adjacent indices in the index table. For example, suppose the buffer section corresponding to index 1 is (1,2) and the buffer section corresponding to index 2 is (2,4). We can calculate that the adjacency ratio is 2 and the maximum value in the buffer section corresponding to index 2 is 4. Therefore, we can determine that the buffer section corresponding to index 3 is (4,8).

[0146] In another possible implementation, the first index table is subject to the following conditions: (Condition 1) The difference in proximity between two indices belonging to the first range of values ​​in the first index table is equal to the difference in first proximity. (Condition 2) The difference in proximity between two indices belonging to the second range of the first index table is equal to the difference in the second proximity. (Condition 3) The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. (Condition 4) The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met. The first adjacency difference is different from the second adjacency difference, and the first adjacency ratio is different from the second adjacency ratio. Optionally, if the second information is a buffer section, the adjacency difference can be understood as the difference between the maximum values ​​in the buffer sections corresponding to two adjacent indexes in the index table. Alternatively, the adjacency difference can also be understood as the lengths of the buffer sections corresponding to the two indexes. The adjacency ratio can be understood as the ratio between the maximum values ​​in the buffer sections corresponding to two adjacent indexes in the index table. Furthermore, optionally, the value range may be an index range or a buffer section range.

[0147] The following explanation uses the case where the first index table satisfies conditions 1 and 3 as an example.

[0148] For example, the value range is the index range, the first value range is from index 1 to index 3, and the third value range is from index 4 to index 10. Both index 2 and index 3 belong to the first value range. The first adjacency difference is 2. Assume that the buffer section corresponding to index 2 is (2,4). Since the maximum value in the buffer section corresponding to index 2 is 4, we can determine that the buffer section corresponding to index 3 is (4,6). Indexes 4, 5, and 6 all belong to the third value range. The first adjacency ratio is 2. Assume that the buffer section corresponding to index 4 is (6,12), the buffer section corresponding to index 5 is (12,24), and the maximum value in the buffer section corresponding to index 5 is 24. Therefore, we can determine that the buffer section corresponding to index 6 is (24,48). The corresponding index table is as follows: [Table 8] [Table 9]

[0149] As another example, suppose the value range is a buffer section range, the first value range is 0 to less than 5, the third value range is 5 or greater and up to 20, the first adjacency difference is 1, and the first adjacency ratio is 2. Based on the first value range and the first adjacency difference, we determine that the buffer range for the second information is (0,1), (1,2), (2,3), (3,4), and (4,5). Based on the third value range and the first adjacency ratio, we determine that the buffer range for the second information is (5,10), (10,20), and (20,40). In this case, the corresponding index table is as follows: [Table 9] [Table 10]

[0150] The following explanation uses the case where the first index table satisfies conditions 1 and 2 as an example. For example, the value range is the buffer section range. Table 10 below is used as an example. [Table 10] [Table 11]

[0151] The first index table is Table 8, the first value range is 8 or less, the second value range is greater than 8, the first adjacency difference is 2, and the second adjacency difference is 4. From Table 8, we can see that the size of the buffer sections corresponding to indices 0 to 3 is all 8 or less. Therefore, for indices 0 to 3, the difference between the maximum values ​​in the buffer sections corresponding to two adjacent indices is 2. For example, the maximum value in the buffer section corresponding to index 1 is 2, the maximum value in the buffer section corresponding to index 2 is 4, and the difference in maximum values ​​is 2. From Table 8, we can see that the size of the buffer sections corresponding to indices 4 to 7 is all greater than 8. Therefore, for indices 4 to 7, the difference between the maximum values ​​in the buffer sections corresponding to two adjacent indices is 4. For example, the maximum value in the buffer section corresponding to index 5 is 16, the maximum value in the buffer section corresponding to index 6 is 20, and the difference in maximum values ​​is 4. If the value range is the index range, similar results can be obtained based on the above examples. Further details will not be explained again here.

[0152] The following explanation uses the case where the first index table satisfies conditions 3 and 4 as an example. For example, the value range is the buffer section range. Table 11 below is used as an example. [Table 11] [Table 12]

[0153] The first index table is Table 9, the third value range is 8 or less, the fourth value range is greater than 8, the first adjacency ratio is 2, and the second adjacency ratio is 3. From Table 9, it can be seen that the size of the buffer sections corresponding to indices 0 to 3 is all 8 or less. Therefore, for indices 0 to 3, the ratio between the maximum values ​​in the buffer sections corresponding to two adjacent indices is 2. For example, the maximum value of the buffer section corresponding to index 1 is 2, the maximum value of the buffer section corresponding to index 2 is 4, and the ratio of the maximum values ​​is 2. From Table 9, it can be seen that the size of the buffer sections corresponding to indices 4 to 7 is all greater than 8. Therefore, for indices 4 to 7, the ratio between the maximum values ​​in the buffer sections corresponding to two adjacent indices is 4. For example, the maximum value of the buffer section corresponding to index 5 is 36, the maximum value of the buffer section corresponding to index 6 is 108, and the ratio of the maximum values ​​is 3.

[0154] Optionally, the first value range may be understood as an alternative index satisfying the first condition, the second value range as an alternative index satisfying the second condition, the third value range as an alternative index satisfying the third condition, and the fourth value range as an alternative index satisfying the fourth condition. Note that the first, second, third, and fourth conditions described above may be arbitrary conditions. For example, the first condition is that the index value is greater than a preset threshold. This is not limited to this embodiment of the present application.

[0155] Based on the above description of the first index table, the indexes and second information included in the first index table will be described below.

[0156] In possible implementations, the smallest index in the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0. Optionally, the second information is a buffer section.

[0157] For example, suppose the first index table is Table 12. We can see that the maximum value in the buffer section corresponding to index 0 is 0. If the first index is 0 and the first index is from the first index table, then the buffer size indicated by the first index and corresponding to LCG is 0. [Table 12] [Table 13]

[0158] In another example, suppose the first index table is Table 13. We can see that the maximum value in the buffer section corresponding to index 0 is 1. If the first index is 0 and the first index is from the first index table, then the buffer size indicated by the first index and corresponding to the LCG is 1 or less. [Table 13] [Table 14]

[0159] In another possible implementation, the minimum index of the first index table is N, where N is an integer greater than 0. The range of index values ​​included in the second index table is an integer between 0 and N-1. Optionally, the second information is a buffer section. Referring to the above description of the first information, this implementation can be combined with the above-described method of using the first information as the first index. Specifically, if the first information is greater than the first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than or equal to the first threshold, the first information indicates that the index table corresponding to the first index is the second index table. The first threshold is N-1. This implementation may also be combined with other methods described in the first information, but is not limited to this embodiment of the present application.

[0160] For example, suppose the second index table is Table 14 and the first index table is Table 15. [Table 14] [Table 15] [Table 15] [Table 16]

[0161] The first threshold is set to 3. If the first index is 2, since the first index is less than 3, the size of the buffer section corresponding to the first index can be determined as (2,4) based on the second index table, i.e., Table 12. If the first index is 6, since the first index is greater than 3, the size of the buffer section corresponding to the first index can be determined as (10,12) based on the first index table, i.e., Table 13.

[0162] Furthermore, optionally, the first and second index tables may be combined to form a third index table. If the maximum index in the first index table is P, then the range of index values ​​in the third index table is from 0 to P. We will use the above example where the second index table is Table 14 and the first index table is Table 15. The first and second index tables may also be combined to form a third index table, for example, as shown in Table 16 below. [Table 16] [Table 17]

[0163] Based on the above description of the first index table, in this embodiment of the present application, the first index table may be predefined or configured by a network device. The method by which a terminal device determines the first index table is mainly described below.

[0164] In possible implementations, the terminal device acquires instruction information. Optionally, the instruction information is transmitted by the network device. Specifically, the network device constructs a first index table and transmits the instruction information to the terminal device. The instruction information refers to the first index table. Accordingly, the terminal device receives the instruction information from the network device. The terminal device may determine the first index table based on the instruction information. Based on this implementation, the network device can flexibly adjust the contents of the first index table based on changes in the current network load, so that the terminal device can more accurately instruct the corresponding second information based on the first index table and the first index.

[0165] Optionally, the instruction information may be a first index table, or the instruction information may indicate one or more of the following parameters: the number of indexes in the first index table, the maximum index in the first index table, the minimum index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table. The first range may be one or more of the first value range, second value range, third value range, and fourth value range described above. The terminal device may determine the first index table based on one or more parameters indicated by the instruction information. The one or more parameters indicated by the instruction information may be configured by the network device or predefined.

[0166] Furthermore, the instruction information may optionally be one or more of the parameters described above in the first index table, or any other information. The terminal device determines the parameters of the first index table based on the other information, and then determines the first index table. For example, the instruction information may be a threshold, and the minimum index in the first index table may be determined based on the threshold. Specifically, the terminal device determines that the minimum index in the first index table is the index value corresponding to the buffer section to which the limit in the second index table belongs. For example, the second information is a buffer section. Suppose the second index table is Table 17. [Table 17] [Table 18]

[0167] The terminal device determines that the threshold is 3 bytes. In Table 15, the buffer section corresponding to 3 bytes is (2,4), and the index value corresponding to buffer section (2,4) is 2. In this case, it can be determined that the smallest index in the first index table is 2. Furthermore, arbitrarily assuming that the largest index in the first index table is equal to the largest index in the second index table, the network device has already pre-configured five buffer sections, which are (4,6), (6,8), (8,10), (10,12), and (12,14). Therefore, two index tables suitable for the current first index table can be determined from the five buffer sections. Thus, it can be seen that the first index table is 18. [Table 18] [Table 19]

[0168] In possible implementations, instruction information does not need to be transmitted from the network device. Specifically, instruction information may be predefined, determined by the terminal device sensing the current network environment or other parameters, or transmitted from another device. This is not limited to the present embodiment of the application.

[0169] 202: The terminal device transmits a data format indicating the first information to the network device. In response, the network device receives a data format indicating the first information from the terminal device.

[0170] In this embodiment of the present application, the data format may be one of the following formats: Media Access Control Element (MAC CE), Service Data Unit (SDU), PDU, Downlink Control Information (DCI), or Radio Resource Control (RRC) signaling. Alternatively, the data format may be another format; this is not limited to this embodiment of the present application. Optionally, da includes BSR. Since the first information indicates a first index, the table corresponding to the first index may be determined from at least two index tables based on the first information. The method described herein helps determine a specific table corresponding to the first index from a plurality of index tables.

[0171] To distinguish the index table corresponding to the index, embodiments of the present application further propose an information reporting method. Refer to Figure 8. As shown in Figure 8, the information reporting method includes the following step 801. The implementers of the method shown in Figure 8 may be terminal devices and network devices, or chips within terminal devices or chips within network devices. Figure 8 illustrates an example in which the implementers of the method are terminal devices and network devices. The implementers of the method are not limited to these embodiments of the present application.

[0172] 801: The terminal device acquires third-party information. This third-party information is of the first index and indicates the index table corresponding to the first granularity.

[0173] In this embodiment of the present application, the first index indicates second information of first granularity. The index table includes a correspondence between the index and the second information. The third information is transmitted from the network device to the terminal device and is of the first index, for determining the index table corresponding to the first granularity. The index table of the first index, corresponding to the first granularity, is one of at least two index tables. Specifically, the first index is an index from one of at least two index tables. The second information of first granularity indicated by the first index is determined based on the first index and the index table corresponding to the first index. Alternatively, the second information may be the maximum, minimum, or intermediate value within a section of the index table, the length of the section, or the maximum, minimum, or intermediate value within the index table. The at least two index tables include the first index table and the second index table. Note that the first index table and the second index table are merely examples provided in this application. The at least two index tables may, alternatively, include multiple index tables, such as a third index table. The number of index tables is not limited to this embodiment of the present application. In the following description, a first index table and a second index table are used as examples. The number of index tables included in at least two index tables is not limited to this embodiment of the present application. Optionally, at least two index tables include index tables that are already defined in the current 3GPP R17 standard V17.2.0, for example, Table 1 in the above description.

[0174] In possible implementations, the third information may be transmitted by a network device, predefined, or obtained by other means. The method by which a terminal device obtains the third information is not limited in the embodiments of this application.

[0175] In possible implementations, the first granularity may be one of the following: LCH, LCG, PDU set, and QoS flow. Optionally, the first index is an index within the BSR. Further optional, the first granularity may be the LCG, and the second information may be a buffer section. In this implementation, the first index indicates the buffer section corresponding to the size of the data buffered in the LCG. The buffer section corresponding to the size of the data buffered in the LCG may be determined based on the first index and the table corresponding to the first index. See the description in step 201 for the format of the BSR. Further details are not described again in this embodiment of the present application.

[0176] In possible implementations, the third information may be of the first index and indicate an index table corresponding to the first granularity in one of two ways. Alternatively, the third information may be of the first index and indicate an index table corresponding to the first granularity in another way. This is not limited to the present embodiment of the application.

[0177] Method 1: The third information is related to a bitmap. In one implementation, the third information includes configuration information related to the first granularity. The information parameters of the configuration information correspond one-to-one with the bits in the bitmap. Optionally, Method 1 is implemented using a bitmapping method. The configuration information at the first granularity includes multiple information parameters. The multiple information parameters include a first information parameter and a second information parameter. The bitmap includes a first bit and a second bit. The bitmap corresponding to the first information parameter is the first bit, and the bitmap corresponding to the second information parameter is the second bit. The index table corresponding to the first information parameter and belonging to the first index is the first index table, and the index table corresponding to the second information parameter and belonging to the first index is the second index table. Optionally, the first bit is 0 and the second bit is 1. Alternatively, the first bit is 1 and the second bit is 0. For example, the first granularity is LCG. The configuration information includes four information parameters (LCG1, LCG2, LCG3, LCG4). For example, suppose the first bit is 0 and the second bit is 1. The bitmap is represented as 0011. The bitmap contains four bits, which correspond to LCG1, LCG2, LCG3, and LCG4, respectively. The bit corresponding to LCG1 and LCG2 is 1 and is the first bit. The corresponding index table for the first index is the first index table. The bit corresponding to LCG3 and LCG5 is 0 and is the second bit. The corresponding index table for the first index is the second index table.

[0178] Method 2: The third information is configuration information related to the first granularity, and the information parameter of the configuration information is the identifier of the first granularity. The third information is of the first index and indicates the index table corresponding to the information parameter of the configuration information. Optionally, the third information includes configuration parameters related to the LCG granularity. The information parameter is the LCG ID. The configuration parameters include (LCG2 and LCG3). The network is composed of a total of 8 LCGs, (LCG1 to LCG8). In this implementation, the third information is the LCG configuration and includes the LCG ID. The first index is the index table corresponding to the LCG ID composed in the third information, which is the first index. Note that an index table corresponding to other LCG IDs set in the network, separate from the LCG IDs shown in the third information, which is of the first index, may be the second index table or another index table, not the first index table.

[0179] Based on the above description of the first information, the following will mainly describe the index table. The description of the index table is the same as that described in step 201. In this embodiment of the application, only a brief description will be provided. For specific implementations and examples, please refer to the description in step 201.

[0180] In a possible implementation, at least two index tables include a first index table and a second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second pieces of information corresponding to two adjacent indexes in the index table. The adjacency ratio is the ratio between the second pieces of information corresponding to two adjacent indexes in the index table.

[0181] The existence of an adjacency difference in the first index table that is smaller than the adjacency difference in the second index table can be understood as the first index table containing multiple adjacency differences, the second index table containing multiple adjacency differences, and at least one of the multiple adjacency differences in the first index table being smaller than the adjacency difference in the second index table. Similarly, the existence of an adjacency ratio in the first index table that is smaller than the adjacency ratio in the second index table can be understood as the first index table containing multiple adjacency ratios, the second index table containing multiple adjacency ratios, and at least one of the multiple adjacency ratios in the first index table being smaller than the adjacency ratio in the second index table.

[0182] Optionally, if the first index is an index within the BSR, the first granularity is LCG. The second information can be understood as the maximum, minimum, or median value within the buffer section corresponding to the first index. Let's use an example where the second information is the maximum value within the buffer section. The adjacency difference can be understood as the difference between the maximum values ​​within the buffer sections corresponding to two adjacent indexes in the index table. In this case, the adjacency difference can also be understood as the length of the buffer sections corresponding to the two indexes. The adjacency ratio can be understood as the ratio of the maximum value in the buffer section corresponding to the second index to the maximum value in the buffer section corresponding to the third index in the index table. The second and third indexes are two adjacent indexes in the index table, and the value of the second index is greater than the value of the third index.

[0183] Furthermore, in this embodiment of the present application, we use examples where all adjacency differences in the first index table are smaller than the adjacency differences in the second index table, and examples where all adjacency ratios in the first index table are smaller than the adjacency ratios in the second index table. Alternatively, there may be cases where only some of the adjacency differences in the first index table are smaller than the adjacency differences in the second index table, or where only some of the adjacency ratios in the first index table are smaller than the adjacency ratios in the second index table. Related examples can be similarly obtained based on the above examples and are not described in this specification in this embodiment of the present application.

[0184] Furthermore, optionally, the second index table may be a table already defined in the current 3GPP R17 standard V17.2.0, for example, Table 1 in the above description. The first index table is a new index table defined in this embodiment of the present application, and its granularity is smaller than that of the second index table.

[0185] Based on the first index table described above, the granularity of the first index table is introduced below. The description of the index table is the same as that described in step 201. In this embodiment of the application, only a brief description is provided. For specific implementations and examples, refer to the description in step 201.

[0186] In possible implementations, the adjacency difference of the first index table is the same. The adjacency difference is the difference between the second pieces of information corresponding to two adjacent indexes in the index table. Optionally, if the second piece of information is a buffer section, the adjacency difference can be understood as the difference between the maximum values ​​in the buffer sections corresponding to two adjacent indexes in the index table. Alternatively, the adjacency difference can also be understood as the lengths of the buffer sections corresponding to the two indexes.

[0187] In another possible implementation, the adjacency ratio between the second information corresponding to two adjacent indexes in the first index table is the same, or the difference between the two adjacency ratios is less than the second threshold. The adjacency ratio is the ratio between the second information corresponding to two adjacent indexes in the index table. The difference between the two adjacency ratios being less than the second threshold, and the second threshold being close to 0, can be understood as all adjacency ratios in the first index table being approximately the same. Optionally, if the second information is a buffer section, the adjacency ratio can be understood as the ratio between the maximum values ​​in the buffer section corresponding to two adjacent indexes in the index table.

[0188] In another possible implementation, the first index table is subject to the following conditions: (Condition 1) The difference in proximity between two indices belonging to the first range of values ​​in the first index table is equal to the difference in first proximity. (Condition 2) The difference in proximity between two indices belonging to the second range of the first index table is equal to the difference in the second proximity. (Condition 3) The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. (Condition 4) The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met. The first adjacency difference is different from the second adjacency difference, and the first adjacency ratio is different from the second adjacency ratio. Optionally, if the second information is a buffer section, the adjacency difference can be understood as the difference between the maximum values ​​in the buffer sections corresponding to two adjacent indexes in the index table. Alternatively, the adjacency difference can also be understood as the lengths of the buffer sections corresponding to the two indexes. The adjacency ratio can be understood as the ratio between the maximum values ​​in the buffer sections corresponding to two adjacent indexes in the index table. Furthermore, optionally, the value range may be an index range or a buffer section range.

[0189] Optionally, the first value range may be understood as an alternative index satisfying the first condition, the second value range as an alternative index satisfying the second condition, the third value range as an alternative index satisfying the third condition, and the fourth value range as an alternative index satisfying the fourth condition. Note that the first, second, third, and fourth conditions described above may be arbitrary conditions. For example, the first condition is that the index value is greater than a preset threshold. This is not limited to this embodiment of the present application.

[0190] Based on the above description of the first index table, the indexes and second information included in the first index table are described below. The description of the indexes and second information is the same as the description in step 201. In this embodiment of the application, only a brief description is given. For specific implementations and examples, refer to the description in step 201. Details are again not described in this embodiment of the application.

[0191] In possible implementations, the smallest index in the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0192] In another possible implementation, the smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​contained in the second index table is an integer between 0 and N-1.

[0193] Based on the above description of the first index table, in this embodiment of the present application, the first index table may be predefined or configured by a network device. The method by which a terminal device determines the first index table is mainly described below. The method for configuring the first index table is the same as described in step 201. In this embodiment of the present application, only a brief description is given. For specific implementations and examples, see the description in step 201. Details are again not described in this embodiment of the present application.

[0194] In possible implementations, the terminal device acquires instruction information. Optionally, the instruction information is transmitted by the network device. Specifically, the network device constructs a first index table and transmits the instruction information to the terminal device. The instruction information refers to the first index table. Accordingly, the terminal device receives the instruction information from the network device. The terminal device may determine the first index table based on the instruction information. Based on this implementation, the network device can flexibly adjust the contents of the first index table based on changes in the current network load, so that the terminal device can more accurately instruct the corresponding second information based on the first index table and the first index.

[0195] Optionally, the instruction information may be a first index table, or the instruction information may indicate one or more of the following parameters: the number of indexes in the first index table, the maximum index in the first index table, the minimum index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table. The first range may be one or more of the first value range, second value range, third value range, and fourth value range described above. The terminal device may determine the first index table based on one or more parameters indicated by the instruction information. The one or more parameters indicated by the instruction information may be configured by the network device or predefined.

[0196] Furthermore, the instruction information may optionally be one or more of the parameters described above in the first index table, or any other information. The terminal device determines the parameters of the first index table based on the other information, and then determines the first index table. For example, the instruction information may be a threshold, and the minimum index in the first index table may be determined based on the threshold. Specifically, the terminal device determines that the minimum index in the first index table is the index value corresponding to the buffer section to which the limit in the second index table belongs.

[0197] In possible implementations, instruction information does not need to be transmitted from the network device. Specifically, instruction information may be predefined, determined by the terminal device sensing the current network environment or other parameters, or transmitted from another device. This is not limited to the present embodiment of the application.

[0198] Based on the method described above, in possible implementations, the method further includes: The terminal device generates a data format based on third information, the data format including a first index corresponding to a first granularity. The terminal device transmits the data format to the network device. Accordingly, the network device receives the data format. The data format may be one of the following formats: MAC CE, SDU, PDU, DCI, or RRC signaling. Optionally, the data format includes BSR. Furthermore, alternatively, the data format may be another format. This is not limited to the present embodiments of the application.

[0199] Referencing the first index table described above, if the index table corresponding to the target granularity is the first index table, and the target information value for the target granularity is less than or equal to the second threshold, then there is no need to report the data format at this time, and the data format will be reported after the target information value for the target granularity exceeds the third threshold. Furthermore, optionally, the target granularity is the target LCG, the target information value is the size of the data buffered in the target LCG, and the data format includes the BSR. For example, suppose the index table corresponding to LCG1 is the first index table. The terminal device currently needs to report the BSR to the network device, but the size of the data buffered in LCG1 is less than the second threshold. In this case, the reported BSR does not need to include the first index corresponding to LCG1, and the terminal device will use the BSR to report the first index corresponding to LCG1 to the network device until the size of the data buffered in LCG1 exceeds the third threshold. This implementation helps reduce the overhead of the data format.

[0200] With the advancements of the modern era, the amount of data that people need to transmit is increasing. As a result, the size of buffered data indicated by the index in the BSR reported from terminal devices to network devices is growing. Under current standards, the larger the index in the index table, the wider the range of buffered data size indicated by the index, which can lead to inappropriate allocation when network devices schedule resources based on the BSR from terminal devices. For example, terminal devices may be allocated an excessive amount of resources. Therefore, conventional technologies expect the introduction of new, more granular index tables to solve the above problem. However, the definition and types of index tables have not been established. Therefore, how to determine the index tables is an urgent issue that needs to be resolved.

[0201] In embodiments of the present application, an information reporting method is proposed to enable the index to more accurately indicate the buffer size corresponding to the logical channel. Refer to Figure 9. As shown in Figure 9, the information reporting method includes the following step 901. The entity executing the method shown in Figure 9 may be a terminal device or a chip within a terminal device. Figure 9 illustrates an example where the entity executing the method is a terminal device. The entity executing the method is not limited to these embodiments of the present application.

[0202] 901: The terminal device acquires the fourth piece of information, which represents the first index table.

[0203] In this embodiment of the present application, the first index table includes a correspondence between an index and second information. Alternatively, the second information may be the maximum, minimum, or intermediate value within a section of the index table, the length of the section, or the maximum, minimum, or intermediate value within the index table. The fourth information received by the terminal device indicates the first index table, and the terminal device may determine the first index table based on the fourth information. The terminal device needs to determine at least two index tables, and at least two index tables include the first index table.

[0204] In possible implementations, the fourth piece of information indicates one or more of the following parameters: the number of indexes in the first index table, the largest index in the first index table, the smallest index in the first index table, the second piece of information in the first index table, the first range in the first index table, the adjacency ratio in the first index table, and the adjacency difference in the first index table. The adjacency difference is the difference between the second pieces of information corresponding to two adjacent indexes in the index table. The adjacency ratio is the ratio between the second pieces of information corresponding to two adjacent indexes in the index table.

[0205] The terminal device may determine the first index table based on the first rule in the first index table and the parameters indicated in the fourth information.

[0206] The first rule includes several items, including the following:

[0207] 1. The adjacency difference within the first index table is the same. In this case, the fourth piece of information indicates the adjacency difference within the first index table. The terminal device may determine the first index table based on the first rule and the adjacency difference indicated by the fourth piece of information.

[0208] 2. The adjacency ratios within the first index table are the same. In this case, the fourth piece of information indicates the adjacency ratios within the first index table. The terminal device may determine the first index table based on the first rule and the adjacency ratios indicated by the fourth piece of information.

[0209] 3. The first index table is defined as follows: (Condition 1) The difference in proximity between two indices belonging to the first range of values ​​in the first index table is equal to the difference in first proximity. (Condition 2) The difference in proximity between two indices belonging to the second range of the first index table is equal to the difference in the second proximity. (Condition 3) The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. (Condition 4) The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met: The first adjacency difference is different from the second adjacency difference, and the first adjacency ratio is different from the second adjacency ratio.

[0210] In this case, the fourth piece of information indicates one or more of the adjacency difference, adjacency ratio, and first range in the first index table. Additionally, the adjacency difference may be the first adjacency difference and / or the second adjacency difference, and the adjacency ratio may be the first adjacency ratio and / or the second adjacency ratio. The first range may include one or more of the first value range, second value range, third value range, and fourth value range. The value range may be the index range in the first index table or the section range of the second piece of information. The terminal device may determine the first index table based on the first rule, adjacency difference, adjacency ratio, and the first range in the first index table indicated in the fourth piece of information.

[0211] 4. The smallest index in the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0. The fourth information indicates that the smallest index in the first index table corresponds to the maximum value M of the second information. Based on the first rule and the correspondence between the smallest index and the second information indicated by the fourth information, the terminal device can determine the first index table.

[0212] 5. The smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​included in the second index table is an integer between 0 and N-1. In this case, the fourth piece of information indicates the smallest index N in the first index table. The terminal device may determine the first index table based on the first rule and the smallest index indicated by the fourth piece of information.

[0213] In possible implementations, the fourth piece of information may be a target parameter. The target parameter represents one or more of the following parameters: the number of indexes in the first index table, the largest index in the first index table, the smallest index in the first index table, the second piece of information in the first index table, the first range in the first index table, the adjacency ratio in the first index table, and the adjacency difference in the first index table.

[0214] For example, the target parameter may be a threshold, and the minimum index in the first index table may be determined based on the threshold. Specifically, the terminal device determines that the minimum index in the first index table is the index value corresponding to the second piece of information to which the threshold in the second index table belongs. The target parameter being a threshold is an example provided in these embodiments of the Application. Alternatively, the target parameter may be any other parameter. This is not limited to these embodiments of the Application.

[0215] In possible implementations, the terminal device may predefine multiple buffer sections and determine the first index table based on the multiple predefined buffer sections and the fourth piece of information. The number of buffer sections predefined by the terminal device is greater than the number of first index tables.

[0216] In possible implementations, the fourth information may be transmitted by a network device, predefined, or determined by a terminal device sensing the current network environment or other parameters, or transmitted from another device. This is not limited to the present embodiment of the application.

[0217] In possible implementations, the method further includes: the terminal device determines one or more index tables. If two index tables are determined, at least two index tables include a first index table and a second index table. Note that the first and second index tables are merely examples provided herein. The at least two index tables may alternatively include a third index table and multiple index tables. The number of index tables is not limited to this embodiment of the present application. The first and second index tables are used as examples below. The number of index tables included in at least two index tables is not limited to this embodiment of the present application. Optionally, at least two index tables include index tables that are already defined in the current 3GPP R17 standard V17.2.0, for example, Table 1 in the above description.

[0218] In a possible implementation, at least two index tables are included, a first index table and a second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second pieces of information corresponding to two adjacent indexes in the index table. The adjacency ratio is the ratio between the second pieces of information corresponding to two adjacent indexes in the index table. This implementation helps allow the index to more accurately indicate the buffer size corresponding to the logical channel group.

[0219] Optionally, if the first index is an index represented by BSR, the first granularity is LCG. The second information can be understood as the maximum, minimum, or median value within the buffer section corresponding to the first index. Let's use an example where the second information is the maximum value within the buffer section. The adjacency difference can be understood as the difference between the maximum values ​​within the buffer sections corresponding to two adjacent indexes in the index table. In this case, the adjacency difference can also be understood as the length of the buffer sections corresponding to the two indexes. The adjacency ratio can be understood as the ratio of the maximum value in the buffer section corresponding to the second index to the maximum value in the buffer section corresponding to the third index in the index table. The second and third indexes are two adjacent indexes in the index table, where the value of the second index is greater than the value of the third index.

[0220] Furthermore, optionally, the second index table may be a table already defined in the current 3GPP R17 standard V17.2.0, for example, Table 1 in the above description. The first index table is a new index table defined in this embodiment of the present application, and its granularity is smaller than that of the second index table.

[0221] Based on the first index table described above, the granularity of the first index table is introduced below. The description of the index table is the same as that described in step 201. In this embodiment of the application, only a brief description is provided. For specific implementations and examples, refer to the description in step 201.

[0222] In possible implementations, the adjacency difference of the first index table is the same. The adjacency difference is the difference between the second pieces of information corresponding to two adjacent indexes in the index table. Optionally, if the second piece of information is a buffer section, the adjacency difference can be understood as the difference between the maximum values ​​in the buffer sections corresponding to two adjacent indexes in the index table. Alternatively, the adjacency difference can also be understood as the lengths of the buffer sections corresponding to the two indexes.

[0223] In another possible implementation, the adjacency ratio between the second information corresponding to two adjacent indexes in the first index table is the same, or the difference between the two adjacency ratios is less than the second threshold. The adjacency ratio is the ratio between the second information corresponding to two adjacent indexes in the index table. The difference between the two adjacency ratios being less than the second threshold, and the second threshold being close to 0, can be understood as all adjacency ratios in the first index table being approximately the same. Optionally, if the second information is a buffer section, the adjacency ratio can be understood as the ratio between the maximum values ​​in the buffer section corresponding to two adjacent indexes in the index table.

[0224] In possible implementations, the adjacency differences belonging to the first value range in the first index table are the same. The adjacency ratios belonging to the second value range in the first index table are the same, or the difference between the two adjacency ratios is less than the second threshold. Optionally, if the second information is a buffer section, the adjacency difference can be understood as the difference between the maximum values ​​in the buffer sections corresponding to two adjacent indices in the index table. Alternatively, the adjacency difference can also be understood as the lengths of the buffer sections corresponding to the two indices. The adjacency ratio can be understood as the ratio between the maximum values ​​in the buffer sections corresponding to two adjacent indices in the index table.

[0225] Optionally, the first value range includes index values ​​that satisfy the first condition, and the second value range includes index values ​​that do not satisfy the first condition. It should be noted that the first condition can be any condition. For example, the first condition is that the index value is greater than a preset threshold. This is not limited to the present embodiment of the application.

[0226] In another possible implementation, if in the first index table both of the second pieces of information corresponding to two adjacent indexes are less than the first threshold, the difference between the second pieces of information corresponding to the two adjacent indexes is the first value. If both of the second pieces of information corresponding to two adjacent indexes are greater than or equal to the first threshold, the difference between the second pieces of information corresponding to the two adjacent indexes is the second value. The first threshold may be configured by a network device or may be predefined. This is not limited to this embodiment of the present application. The first threshold is merely an example in this application and may include multiple thresholds, such as a second threshold. This is not limited to this embodiment of the present application.

[0227] In another possible implementation, if in the first index table both of the second pieces of information corresponding to two adjacent indexes are less than the second threshold, the ratio of the second pieces of information corresponding to two adjacent indexes is the third value. If both of the second pieces of information corresponding to two adjacent indexes are greater than or equal to the second threshold, the ratio of the second pieces of information corresponding to two adjacent indexes is the fourth value. The second threshold may be configured by a network device or may be predefined. This is not limited to this embodiment of the present application. The first threshold is merely an example in this application and may include multiple thresholds, such as a third threshold. This is not limited to this embodiment of the present application.

[0228] Based on the above description of the first index table, the indexes and second information included in the first index table are described below. The description of the indexes and second information is the same as the description in step 201. In this embodiment of the application, only a brief description is given. For specific implementations and examples, refer to the description in step 201. Details are again not described in this embodiment of the application.

[0229] In possible implementations, the smallest index in the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0230] In another possible implementation, the smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​contained in the second index table is an integer between 0 and N-1.

[0231] The function of the first index table is described below.

[0232] In possible implementations, the method further includes: a terminal device transmits a data format to a network device. The data format indicates a first index. The first index corresponds to one of at least two index tables, the at least two index tables including the first index table. The data format may be one of the following formats: MAC CE, SDU, PDU, DCI, or RRC signaling. Furthermore, alternatively, the data format may be another format, and is not limited to this embodiment of the application. The first index indicates second information of first granularity. The fact that the first index corresponds to one of at least two index tables can be understood as the first index being an index from one of at least two index tables. The second information of first granularity indicated by the first index is determined based on the first index and the index table corresponding to the first index. In possible implementations, the first granularity may be one of the following granularities: LCH, LCG, PDU set, and QoS flow. Optionally, the first index is an index indicated by BSR. Furthermore, optionally, the first granularity is the LCG, and the second information is the buffer section. In this implementation, the first index indicates the buffer section corresponding to the size of the data buffered in the LCG. The buffer section corresponding to the size of the data buffered in the LCG may be determined based on the first index and the table corresponding to the first index. See the description in step 201 for the format of the BSR. Details are not described again in this embodiment of the present application.

[0233] Figure 10 is a schematic diagram of the structure of a communication device according to an embodiment of the present invention. The communication device may be a terminal device or a device (such as a chip) that has the function of a terminal device. Specifically, as shown in Figure 10, the communication device 100 may include a processing unit 1001 and a communication unit 1002. The communication device may perform steps related to a terminal device in the embodiments of the method described above.

[0234] In one embodiment,

[0235] Processing 1001 acquires first information. The first information indicates a first index or an index table corresponding to the first index, and the first index corresponds to one of at least two index tables. The communication unit 1002 is configured to transmit to the network device a data format indicating the first information.

[0236] In a possible implementation, the data format is one of the following formats: Media Access Control Element (MAC CE), Service Data Unit, Protocol Data Unit, Downlink Control Information, or Radio Resource Control Signaling.

[0237] In a possible implementation, the data format includes a buffer status report.

[0238] In a possible implementation, the first information indicates a data type or a data format, and the data format indicates the first index.

[0239] In a possible implementation, the first information is the first index.

[0240] In a possible implementation, at least two index tables include a first index table and a second index table. If the first information is greater than the first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than or equal to the first threshold, the first information indicates that the index table corresponding to the first index is the second index table. Alternatively, at least two index tables include a first index table and a second index table. If the first information is greater than or equal to the first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than the first threshold, the first information indicates that the index table corresponding to the first index is the second index table.

[0241] In possible embodiments, an index table includes a correspondence between an index and second information. At least two index tables include a first index table and a second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second information corresponding to two adjacent indices in the index table. The adjacency ratio is the ratio between the second information corresponding to two adjacent indices in the index table.

[0242] In possible implementations, the adjacency differences of the first index table are the same.

[0243] In possible implementations, the adjacency ratios of the first index table are either the same, or the difference between the two adjacency ratios is less than the second threshold.

[0244] In possible implementations, the first index table is subject to the following conditions: The adjacency difference between two indices belonging to the first value range of the first index table is equal to the first adjacency difference. The difference in proximity between two indices belonging to the second range of the first index table is equal to the difference in the second proximity. The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met: The first adjacency difference is different from the second adjacency difference, and the first adjacency ratio is different from the second adjacency ratio.

[0245] In possible implementations, the smallest index in the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0246] In a possible implementation, the smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​in the second index table is an integer between 0 and N-1.

[0247] In possible implementations, the communication unit 1002 is further configured to acquire instruction information, which refers to a first index table.

[0248] In possible implementations, the instruction information indicates one or more of the following parameters: the number of indexes in the first index table, the largest index in the first index table, the smallest index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0249] In possible implementations, the instruction information indicates the minimum index in the first index table. The processing unit 1001 is further configured to determine the first index table based on L preset buffer sections and the minimum index in the first index table. The difference between the minimum index and the maximum index in the first index table is less than or equal to L, where L is an integer greater than 1.

[0250] In another embodiment,

[0251] The communication unit 1002 acquires third information. The third information is of the first index and indicates an index table corresponding to the first granularity, and the index table corresponding to the first index and the first granularity is from at least one of two index tables.

[0252] In possible implementations, the third piece of information is related to the bitmap.

[0253] In possible implementations, the third piece of information is configuration information related to the first granularity, and the information parameter of the configuration information is the identifier of the first granularity.

[0254] In possible embodiments, an index table includes a correspondence between an index and second information. At least two index tables include a first index table and a second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second information corresponding to two adjacent indices in the index table. The adjacency ratio is the ratio between the second information corresponding to two adjacent indices in the index table.

[0255] In possible implementations, the adjacency differences of the first index table are the same.

[0256] In a possible implementation, the adjacency relationship ratios of the first index table are the same, or the difference between two adjacency relationship ratios is less than a second threshold value.

[0257] In a possible implementation, the first index table satisfies the following conditions: The adjacency relationship difference between two indexes belonging to the first value range of the first index table is equal to the first adjacency relationship difference. The adjacency relationship difference between two indexes belonging to the second value range of the first index table is equal to the second adjacency relationship difference. The adjacency relationship ratio between two indexes belonging to the third value range of the first index table is equal to the first adjacency relationship ratio. The adjacency relationship ratio between two indexes belonging to the fourth value range of the first index table is equal to the second adjacency relationship ratio. Satisfies one or more of the above. The first adjacency relationship difference is different from the second adjacency relationship difference, and the first adjacency relationship ratio is different from the second adjacency relationship ratio.

[0258] In a possible implementation, the minimum index in the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is 0 or M is an integer greater than 0.

[0259] In a possible implementation, the minimum index of the first index table is N. N is an integer greater than 0. The value range of the indexes included in the second index table is an integer between 0 and N - 1.

[0260] In a possible implementation, the communication unit 1002 is further configured to obtain instruction information. The instruction information indicates the first index table.

[0261] In possible implementations, the instruction information indicates one or more of the following parameters: the number of indexes in the first index table, the largest index in the first index table, the smallest index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0262] In possible implementations, the instruction information indicates the minimum index in the first index table. The processing unit 1001 is further configured to determine the first index table based on L preset buffer sections and the minimum index in the first index table. The difference between the minimum index and the maximum index in the first index table is less than or equal to L, where L is an integer greater than 1.

[0263] In a possible implementation, the communication unit 1002 is configured to be of the first index, and the index table corresponding to the target granularity is the first index table, and to skip reporting the data format at the present time if the target information value of the target granularity is less than or equal to the second threshold, and to report the data format after the target information value of the target granularity has grown greater than the third threshold.

[0264] In another embodiment,

[0265] The processing unit 1001 is configured to acquire fourth information. The fourth information refers to the first index table.

[0266] In possible implementations, the fourth piece of information may include one or more of the following parameters: the number of indexes in the first index table, the largest index in the first index table, the smallest index in the first index table, the second piece of information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0267] In a possible implementation, the terminal device determines one or more index tables. If two index tables are determined, at least two of them include a first index table and a second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second pieces of information corresponding to two adjacent indices in the index table. The adjacency ratio is the ratio between the second pieces of information corresponding to two adjacent indices in the index table.

[0268] In possible implementations, the adjacency differences of the first index table are the same.

[0269] In possible implementations, the adjacency ratios of the first index table are either the same, or the difference between the two adjacency ratios is less than the second threshold.

[0270] In possible implementations, the first index table is subject to the following conditions: The adjacency difference between two indices belonging to the first value range of the first index table is equal to the first adjacency difference. The difference in proximity between two indices belonging to the second range of the first index table is equal to the difference in the second proximity. The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met: The first adjacency difference is different from the second adjacency difference, and the first adjacency ratio is different from the second adjacency ratio.

[0271] In possible implementations, the smallest index in the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0272] In possible implementations, the fourth piece of information is transmitted from the network device.

[0273] Figure 10 is a schematic diagram of the structure of a communication device according to an embodiment of the present invention. The communication device may be a network device or a device (such as a chip) that has the function of a network device. Specifically, as shown in Figure 10, the communication device 100 may include a processing unit 1001 and a communication unit 1002. The communication device may perform steps related to the network device in the embodiments of the method described above.

[0274] In one embodiment,

[0275] The communication unit 1002 is configured to receive a data format transmitted from a terminal device that indicates first information. The first information indicates a first index or an index table corresponding to the first index, and the first index corresponds to one of at least two index tables.

[0276] In possible implementations, the data format is one of the following: Media Access Control Element (MAC CE), Service Data Unit, Protocol Data Unit, Downlink Control Information, or Radio Resource Control Signaling.

[0277] The media access control element (MAC CE) is MAC CE, the service data unit is SDU, the protocol data unit is PDU, downlink control information is DCI, or radio resource control signaling is RRC signaling.

[0278] In possible implementations, the data format includes a buffer status report.

[0279] In possible implementations, the first piece of information indicates the data type or data format, and the data format indicates the first index.

[0280] In possible implementations, the first piece of information is the first index.

[0281] In a possible implementation, at least two index tables include a first index table and a second index table. If the first information is greater than the first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than or equal to the first threshold, the first information indicates that the index table corresponding to the first index is the second index table. Alternatively, at least two index tables include a first index table and a second index table. If the first information is greater than or equal to the first threshold, the first information indicates that the index table corresponding to the first index is the first index table. If the first information is less than the first threshold, the first information indicates that the index table corresponding to the first index is the second index table.

[0282] In possible embodiments, an index table includes a correspondence between an index and second information. At least two index tables include a first index table and a second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second information corresponding to two adjacent indices in the index table. The adjacency ratio is the ratio between the second information corresponding to two adjacent indices in the index table.

[0283] In possible implementations, the adjacency differences of the first index table are the same.

[0284] In possible implementations, the adjacency ratios of the first index table are either the same, or the difference between the two adjacency ratios is less than the second threshold.

[0285] In possible implementations, the first index table is subject to the following conditions: The adjacency difference between two indices belonging to the first value range of the first index table is equal to the first adjacency difference. The difference in proximity between two indices belonging to the second range of the first index table is equal to the difference in the second proximity. The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met: The first adjacency difference is different from the second adjacency difference, and the first adjacency ratio is different from the second adjacency ratio.

[0286] In possible implementations, the smallest index in the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0287] In a possible implementation, the smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​contained in the second index table is an integer between 0 and N-1.

[0288] In possible implementations, the communication unit 1002 transmits instruction information to the terminal device. The instruction information refers to the first index table.

[0289] In possible implementations, the instruction information indicates one or more of the following parameters: the number of indexes in the first index table, the largest index in the first index table, the smallest index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0290] In another embodiment,

[0291] The communication unit 1002 is configured to transmit third information to a terminal device. The third information indicates an index table of a first index corresponding to a first granularity, and the index table is derived from at least one of two index tables.

[0292] In possible implementations, the first level of granularity is one of the following: logical channel groups, logical channels, protocol data units, and quality of service flows.

[0293] In possible implementations, the third piece of information is related to the bitmap.

[0294] In possible implementations, the third piece of information is configuration information related to the first granularity, and the information parameter of the configuration information is the identifier of the first granularity.

[0295] In possible embodiments, an index table includes a correspondence between an index and second information. At least two index tables include a first index table and a second index table. The first index table has an adjacency difference smaller than the adjacency difference of the second index table. Alternatively, the first index table has an adjacency ratio smaller than the adjacency ratio of the second index table. The adjacency difference is the difference between the second information corresponding to two adjacent indices in the index table. The adjacency ratio is the ratio between the second information corresponding to two adjacent indices in the index table.

[0296] In possible implementations, the adjacency differences of the first index table are the same.

[0297] In possible implementations, the adjacency ratios of the first index table are either the same, or the difference between the two adjacency ratios is less than the second threshold.

[0298] In possible implementations, the first index table is subject to the following conditions: The adjacency difference between two indices belonging to the first value range of the first index table is equal to the first adjacency difference. The difference in proximity between two indices belonging to the second range of the first index table is equal to the difference in the second proximity. The adjacency ratio between two indices belonging to the third value range of the first index table is equal to the first adjacency ratio. The adjacency ratio between two indices belonging to the fourth value range of the first index table is equal to the second adjacency ratio. One or more of the following conditions are met: The first adjacency difference is different from the second adjacency difference, and the first adjacency ratio is different from the second adjacency ratio.

[0299] In possible implementations, the smallest index in the first index table is 0. The maximum value of the second information corresponding to index 0 is M. M is either 0 or an integer greater than 0.

[0300] In a possible implementation, the smallest index in the first index table is N, where N is an integer greater than 0. The range of index values ​​contained in the second index table is an integer between 0 and N-1.

[0301] In possible implementations, the communication unit 1002 is further configured to transmit instruction information to a terminal device. The instruction information refers to a first index table.

[0302] In possible implementations, the instruction information indicates one or more of the following parameters: the number of indexes in the first index table, the largest index in the first index table, the smallest index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0303] In another embodiment,

[0304] The communication unit 1002 transmits the fourth piece of information to the terminal device. The fourth piece of information indicates the first index table.

[0305] In possible implementations, the instruction information indicates one or more of the following parameters: the number of indexes in the first index table, the largest index in the first index table, the smallest index in the first index table, the second information in the first index table, the first range in the first index table, the adjacency difference in the first index table, and the adjacency ratio in the first index table.

[0306] Figure 11 is a schematic diagram of the structure of the communication device. The communication device 1100 may be a terminal device or network device in the embodiment of the method described above, or it may be a chip, chip system, processor, etc. that supports the terminal device or network device when carrying out the method described above. Optionally, the communication device 1100 may be an entity device corresponding to the communication device described in Figure 4. The communication device may be configured to carry out the method described in the embodiment of the method described above. For details, refer to the description of the embodiment of the method described above.

[0307] The communication device 1100 may include one or more processors 1101. The processors 1101 may be general-purpose processors, dedicated processors, etc. For example, the processor 1101 may be a baseband processor or a central processing unit. The baseband processor may be configured to process communication protocols and communication data. The central processing unit may be configured to control communication devices (e.g., base stations, baseband chips, terminals, terminal chips, DUs, or CUs), execute software programs, and process data from the software programs.

[0308] Optionally, the communication device 1100 may include one or more memories 1102 having stored instructions 1104. The instructions may be executed on the processor 1101, enabling the communication device 1100 to perform the method described in the embodiment of the above-described method. Optionally, the memories 1102 may store further data. The processor 1101 and the memories 1102 may be located separately or integrated together.

[0309] Optionally, the communication device 1100 may further include a transceiver 1105 and an antenna 1106. The transceiver 1105 may be called a transceiver unit, transceiver machine, transceiver circuit, etc., and is configured to implement transceiver functionality. The transceiver 1105 may include a receiver and a transmitter. The receiver may be called a receiving machine, receiving circuit, etc., and is configured to implement receiving functionality. The transmitter may be called a transmitting machine, transmitting circuit, etc., and is configured to implement transmitting functionality.

[0310] The communication device 1100 is a terminal device or a network device. The processor 1101 is configured to perform data processing operations of the terminal device or network device in the embodiment of the above method. The transceiver 1105 is configured to perform data transceiver operations of the terminal device or network device in the embodiment of the above method.

[0311] In another possible design, the processor 1101 may include a transceiver configured to perform both receiving and transmitting functions. For example, the transceiver may be a transceiver circuit, interface, or interface circuit. The transceiver circuit, interface, or interface circuit configured to perform transmitting and receiving functions may be separate or integrated together. The transceiver circuit, interface, or interface circuit may be configured to read and write code / data, or the transceiver circuit, interface, or interface circuit may be configured to transmit or transfer signals.

[0312] In another possible design, the processor 1101 may optionally store an instruction 1103. The instruction 1103 is executed on the processor 1101, enabling the communication device 1100 to perform the method described in the embodiment of the above-described method. The instruction 1103 may be fixed to the processor 1101. In this case, the processor 1101 may be implemented in hardware.

[0313] In another possible design, the communication device 1100 may include a circuit that can perform transmitting, receiving, or communication functions in the embodiments of the method described above. The processor and transceiver described in this embodiment of the application may be mounted on an integrated circuit (IC), analog IC, radio frequency integrated circuit (RFIC), mixed-signal IC, application-specific integrated circuit (ASIC), printed circuit board (PCB), electronic device, etc.

[0314] The communication equipment described in the above embodiments may be terminal devices or network devices, but the scope of communication equipment described in this embodiment of the present application is not limited to these, and the structure of the communication equipment is not limited by Figure 11. The communication equipment may be a standalone device or part of a larger device. For example, the communication equipment may be:

[0315] (1) an independent integrated circuit (IC), chip, or chip system or subsystem,

[0316] (2) A set comprising one or more ICs, optionally the IC set further comprising a storage component configured to store data or instructions.

[0317] (3) ASICs, for example, modems (MSMs),

[0318] (4) Modules that can be incorporated into other devices,

[0319] (5) Receivers, terminals, smart terminals, mobile phones, wireless devices, handsets, mobile units, in-vehicle devices, network devices, cloud devices, artificial intelligence devices, etc.

[0320] (6) Others, etc.

[0321] If the communication device can be a chip or a chip system, please refer to the schematic diagram of the chip structure shown in Figure 12. The chip shown in Figure 12 includes a processor 1201 and an interface 1202. Optionally, the chip may further include memory 1203. There may be one or more processors 1201 and multiple interfaces 1202.

[0322] In the design, if the chip is configured to perform the functions of the network device in the embodiment of the present invention:

[0323] The processor 1201 is configured to perform data processing operations of the network device in the embodiment of the present invention.

[0324] Interface 1202 is configured to receive or output signals.

[0325] In another design, if the chip is configured to perform the functions of the terminal device in the embodiment of the present application:

[0326] The processor 1201 is configured to perform the data processing operations of the terminal device in the embodiment of the above method.

[0327] Interface 1202 is configured to receive or output signals.

[0328] It should be understood that some optional features in the embodiments of this application can be implemented independently, without relying on other features such as current-based solutions, to solve corresponding technical problems and achieve corresponding effects in some scenarios, or can be combined with other features on a requirements basis in some scenarios. Correspondingly, the communication equipment provided in the embodiments of this application can also implement corresponding features or functions. Further details will not be described again here.

[0329] It should be understood that the processor in this embodiment of the present application may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the embodiments of the method described above may be implemented using hardware integrated logic circuits within the processor or using software-form instructions. The processor may be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), another programmable logic element, an discrete gate or transistor logic element, or a discrete hardware component.

[0330] It should be understood that the memory in this embodiment of the present application may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. Non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (Erasable PROM, EPROM), electrically erasable programmable read-only memory (Electrically EPROM, EEPROM), or flash memory. Volatile memory may be random access memory (RAM) and may be used as an external cache. Throughout the examples, many forms of RAM may be used, but are not limited to, static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct rambus random access memory (DR RAM). It should be noted that the memory included in the systems and methods described herein is intended to include, but is not limited to, these memories and any other suitable type of memory.

[0331] The present invention further provides a computer-readable medium configured to store computer software instructions. When the instructions are executed by a communication device, one of the functions of the embodiments of the method described above is performed.

[0332] The present invention further provides a computer program product configured to store computer software instructions. When the instructions are executed by a communication device, one of the functions of the embodiments of the method described above is performed.

[0333] All or part of the embodiments described above may be implemented using software, hardware, firmware, or any combination thereof. When software is used for implementation, the implementation may be implemented in whole or in part in the form of a computer program product. A computer program product includes one or more computer instructions. When the computer instructions are loaded onto a computer and executed, all or part of the procedures or functions according to the embodiments of the present application are generated. The computer may be a general-purpose computer, a dedicated computer, a computer network, or another programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wired means (e.g., coaxial cable, optical fiber, or digital subscriber line (DSL)) or wireless means (e.g., infrared, radio, or microwave). The computer-readable storage medium may be any available medium accessible by a computer, or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, or magnetic tapes), optical media (e.g., digital video discs (DVDs)), semiconductor media (e.g., solid-state disks (SSDs)), etc.

[0334] Embodiments of the present invention further provide a computer program product. When the computer program product is executed on a computer, the steps of the method in the embodiment of the method described above are performed.

[0335] The descriptions of embodiments provided herein may refer to one another, and each description of an embodiment has its own focus. For aspects not described in detail in an embodiment, refer to the relevant description of another embodiment. For convenience and brevity of explanation, for example, for the functions and operations performed by the devices and apparatus provided in the embodiments of this application, refer to the relevant description of the embodiments of the method of this application. Embodiments of the method and embodiments of the apparatus may refer to, combine, or refer to one another.

[0336] Those skilled in the art will further understand that the various illustrative logical blocks and steps enumerated in the embodiments of this application may be implemented using electronic hardware, computer software, or a combination of both. Whether a function is implemented using hardware or software depends on the specific application and the overall system design requirements. Those skilled in the art may implement a function for each specific application using various methods. However, such embodiments should not be considered to exceed the scope of protection of the embodiments of this application.

[0337] The present invention further provides a computer-readable storage medium having a stored computer program. When the computer-readable storage medium is executed by a computer, the functions of any one of the embodiments of the above-described method are performed.

[0338] The present invention further provides a computer program product. When the computer program product is executed by a computer, the functions of any one of the embodiments of the method described above are performed.

[0339] All or part of the embodiments described above may be implemented using software, hardware, firmware, or any combination thereof. When software is used for implementation, the implementation may be implemented in whole or in part in the form of a computer program product. A computer program product includes one or more computer instructions. When the computer instructions are loaded onto a computer and executed, all or part of the procedures or functions according to the embodiments of the present application are generated. The computer may be a general-purpose computer, a dedicated computer, a computer network, or another programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wired means (e.g., coaxial cable, optical fiber, or digital subscriber line (DSL)) or wireless means (e.g., infrared, radio, or microwave). The computer-readable storage medium may be any available medium accessible by a computer, or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, or magnetic tapes), optical media (e.g., digital video discs (DVDs)), semiconductor media (e.g., solid-state disks (SSDs)), etc.

[0340] Those skilled in the art will understand that the various numerical symbols such as "First" and "Second" in this application are used merely for the purpose of facilitating explanation and are not used to limit the scope of the embodiments of this application or to indicate order.

[0341] The correspondences shown in the tables of this application may be configured or predefined. The values ​​of the information in the tables are merely examples, and other values ​​may be set. This is not limited to this application. If there is a correspondence between the information and each parameter, not all of the correspondences shown in the tables must necessarily be configured. For example, the correspondences shown in some rows of the tables of this application may not be configured. As another example, appropriate transformations and adjustments such as splitting and joining may be made to the aforementioned tables. The names of the parameters shown in the titles of the above tables may be replaced with other names that the communication device can understand, and the values ​​and representations of the parameters may be replaced with other values ​​and representations that the communication device can understand. When implementing the above tables, other data structures may be used as alternatives. For example, arrays, queues, containers, stacks, linear tables, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables. "Predefined" in this application can be understood as "definition," "pre-defined," "storage," "pre-storage," "pre-negotiate," "pre-configuration," "fixing," or "pre-write."

[0342] A person skilled in the art will recognize, in combination with the examples described in the embodiments disclosed herein, that the units and algorithms may be implemented by electronic hardware or by a combination of computer software and electronic hardware. Whether the functions are performed by hardware or software depends on the specific application and design constraints of the technical solution. A person skilled in the art may implement the described functions by using different methods for each specific application, but such implementations should not be considered beyond the scope of the Application.

[0343] For convenience and to provide a concise explanation, the detailed operating processes of the aforementioned systems, equipment, and units will be clearly understood by those skilled in the art, with reference to the corresponding processes in the embodiments of the methods described above, and will not be described again here.

[0344] Each of the embodiments described above has its own focus. For aspects not described in detail in one embodiment, please refer to the relevant descriptions of other embodiments.

[0345] The embodiments described above are intended solely to illustrate the technical solutions of the present application and are not intended to limit the present application. Although the present application has been described in detail with reference to the embodiments described above, those skilled in the art should understand that they may modify the technical solutions described in the embodiments described above, or make equivalent substitutions to some or all of the technical features thereof, without departing from the scope of the technical solutions of the embodiments of the present application.

Claims

1. Information reporting method, A step of receiving third information from a network device, wherein the third information indicates a configured index table corresponding to a granularity, and the configured index table, which includes a first index and corresponds to the granularity, is one of at least two index tables, and the granularity is one of the following: logical channel group (LCG), logical channel, protocol data unit set, and quality of service flow. Based on the third information, the step of determining an index table that includes the first index and corresponds to the granularity, A step of transmitting a data format indicating first information to the network device, wherein the first information includes the first index and indicates an index table corresponding to the granularity, Information reporting methods that include this.

2. The information reporting method according to claim 1, wherein the third information indicates the configured index table corresponding to the granularity, and further includes indicating whether or not the third information uses the first index table of the granularity.

3. When the granularity is LCG, the third information includes a plurality of bits, the value of which indicates whether or not to use the first index table of the LCG corresponding to the bit, The information reporting method according to claim 2, wherein the first information further indicates an index table that includes the first index and corresponds to an LCG identifier.

4. The information reporting method according to claim 3, wherein if the value of the bit is a first value, it indicates that the first index table of the LCG corresponding to the bit is used.

5. The information reporting method according to claim 3, which indicates that the first index table of the LCG corresponding to the bit is not used when the value of the bit is a second value.

6. The aforementioned information reporting method is, The information reporting method according to any one of claims 2 to 5, further comprising the step of determining the first index table which includes the first index and corresponds to the granularity, based on the instruction information.

7. The aforementioned information reporting method is, The information reporting method according to claim 6, further comprising the step of determining the first index table which includes the first index and corresponds to the granularity, based on the third information and the instruction information.

8. The above instruction information consists of the following parameters: The number of indexes in the first index table, the maximum index in the first index table, the minimum index in the first index table, the buffer section in the first index table, the first range in the first index table, the adjacency ratio in the first index table, and the adjacency difference in the first index table, The first index table includes one or more of the following, the adjacency relationship difference in the first index table is the difference between the second information corresponding to two adjacent indexes in the first index table, and the adjacency relationship ratio in the first index table is the ratio between the second information corresponding to two adjacent indexes in the first index table. The second information mentioned above is, The maximum, minimum, or median value in the index table, or the length of the section corresponding to the index, or The maximum, minimum, or median value in the index table. The information reporting method according to claim 6, including the method described in claim 6.

9. The information reporting method according to claim 1, wherein the data format for indicating the first information is the format of a long buffer status report (BSR), and the format of the long BSR includes 8 bits, with each instruction bit representing one piece of first information.

10. The format of the long BSR includes a further 8 bits, each of which indicates whether or not a corresponding buffer state report is reported. The information reporting method according to claim 9, wherein if one of the further eight bits indicates that a corresponding buffer state report is reported, the corresponding first index is included in the long BSR.

11. The information reporting method according to claim 1, wherein if the first information is a first value, the index table that includes the first index and corresponds to the granularity is the first index table, and if the first information is a second value, the index table that includes the first index and corresponds to the granularity is the second index table, and the second index table is one of the at least two index tables.

12. The step of transmitting a data format indicating the first information to the network device is: The information reporting method according to claim 1, comprising the step of transmitting a data format indicating the first information to the network device if the amount of buffered data of the aforementioned granularity is greater than a third threshold, wherein the data format indicating the first information further indicates the amount of buffered data of the aforementioned granularity.

13. If the amount of buffered data of the aforementioned granularity is less than or equal to the second threshold, the step of skipping the transmission of the data format indicating the first information to the network device, The information reporting method according to claim 1, further comprising:

14. The information reporting method according to any one of claims 2 to 5, wherein the minimum index of the first index table is 0, and the maximum value of the second information corresponding to index 0 is M, where M is an integer greater than 0.

15. A communication device, including a processor, The processor is a communication device that executes a computer program or instruction stored in memory to perform the information reporting method described in any one of claims 1 to 5.

Images