Communication method and apparatus

By establishing a mapping relationship between location information and matrices between terminals and network devices, the problems of high complexity in channel information processing and excessive feedback overhead in ultra-large-scale MIMO systems are solved, achieving more efficient channel information processing.

WO2026098270A1PCT designated stage Publication Date: 2026-05-15HUAWEI TECH CO LTD
View PDF 3 Cites 0 Cited by

Patent Information

Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
HUAWEI TECH CO LTD
Filing Date
2025-10-27
Publication Date
2026-05-15

AI Technical Summary

Technical Problem

In ultra-large-scale MIMO systems, existing CSI feedback schemes cannot meet the processing requirements of channel information, resulting in excessive complexity and feedback overhead.

Method used

By establishing a mapping relationship between location information and the first matrix between the terminal and network devices, the terminal can determine the appropriate first matrix based on its own location information, thereby processing downlink channel information and reducing the processing complexity and feedback overhead of channel information.

Benefits of technology

It effectively reduces the processing complexity and feedback overhead of channel information, and improves the adaptability and efficiency of channel information processing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2025130203_15052026_PF_FP_ABST
    Figure CN2025130203_15052026_PF_FP_ABST
Patent Text Reader

Abstract

A communication method and apparatus, relating to the technical field of communications. In the method, a network device sends to a terminal first information indicating mapping relationships between location information and first matrices, so that the terminal can, on the basis of location information of the terminal and the mapping relationships, determine a first matrix corresponding to the terminal, and, on the basis of the first matrix corresponding to the terminal, process downlink channel information and further report the processed downlink channel information to the network device. In the present application, considering that channel states at different locations may be different, mapping relationships between different location information and first matrices are configured, so that the first matrix determined on the basis of the location information of the terminal better meets actual requirements, thereby helping to reduce the processing complexity and feedback overhead of channel information.
Need to check novelty before this filing date? Find Prior Art

Description

Communication methods and devices

[0001] This application claims priority to Chinese Patent Application No. 202411600657.1, filed on November 8, 2024, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to a communication method and apparatus. Background Technology

[0003] Configuring ultra-large-scale multiple-input multiple-output (MIMO) arrays is one of the future evolution trends of cellular systems. In MIMO, the base station will be equipped with thousands of antenna elements, while the terminal side will also be equipped with more antenna elements (such as 16 or 32) to support more spatial streams. In addition, with the increase in carrier frequency, the bandwidth that can be allocated to the wireless communication system will further increase, and the number of subcarriers and resource blocks (RBs) will increase dramatically. This will lead to a sharp increase in the amount of channel information to be fed back (such as channel state information (CSI)). If the existing CSI processing scheme is continued, it will be unable to meet the CSI feedback requirements of MIMO. Summary of the Invention

[0004] This application provides a communication method and apparatus that can reduce the processing complexity of channel information and the feedback overhead.

[0005] The present application is described below from different aspects. It should be understood that the different implementation methods and beneficial effects described below can be referenced from each other.

[0006] Firstly, this application provides a communication method that can be applied to a first communication device (or, in other words, the method can be executed by the first communication device). The first communication device can be a terminal or a communication module / processing module within the terminal, or a circuit or chip within the terminal (such as a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip containing a modem core, or a system-in-package (SIP) chip, etc.). Taking the application of this method to a terminal as an example, in this method, the terminal receives first information indicating a mapping relationship between location information and a first matrix. This mapping relationship is used to determine the first matrix corresponding to the terminal in conjunction with the terminal's location information. The first matrix corresponding to the terminal is used to process downlink channel information. The terminal can then transmit the processed downlink channel information.

[0007] It is understood that the downlink channel information in this application can be replaced by channel information, channel state information, etc. This application does not restrict this, and will not be elaborated further below.

[0008] In this application, the network device distributes a mapping relationship between location information and a first matrix, enabling the terminal to determine its corresponding first matrix based on its own location information and the mapping relationship. The terminal then processes downlink channel information based on the first matrix corresponding to the terminal and reports the processed downlink channel information to the network device. Compared to the current scheme that uses a fixed matrix to process downlink channel information, this application considers that the channel state may be different at different locations. Therefore, it configures different mapping relationships between location information and the first matrix, making the first matrix determined based on the terminal's location information more adaptable to actual needs. This helps to reduce the processing complexity and feedback overhead of channel information.

[0009] In one possible implementation, the method further includes:

[0010] Send a second message, which indicates the location information of the terminal, or the second message indicates the first matrix corresponding to the terminal.

[0011] In this implementation, when the second information indicates the terminal's location information, the network device can determine the first matrix corresponding to the terminal based on the terminal's location information and mapping relationship. Therefore, the network device can process the processed downlink channel information from the terminal based on the first matrix corresponding to the terminal. Alternatively, the second information can directly indicate the first matrix corresponding to the terminal, so that the network device can process the processed downlink channel information from the terminal based on the first matrix corresponding to the terminal to obtain the reconstructed downlink channel information.

[0012] In one possible implementation, before transmitting the processed downlink channel information, the method further includes:

[0013] Receive third information, which is used to indicate the location information of the terminal.

[0014] In this implementation, the network device can send the location information of the terminal to the terminal, so the terminal can determine the first matrix corresponding to the terminal based on the received location information and mapping relationship.

[0015] In one possible implementation, in the mapping relationship, any location information corresponds to one or more first matrices.

[0016] In this implementation, the number of first matrices corresponding to different positional information in the mapping relationship can be different or the same, which is related to the channel state and better meets actual needs.

[0017] In one possible implementation, each location information corresponds to M first matrices, where M is an integer greater than 0.

[0018] In this implementation, information at different positions in the mapping relationship can correspond to the same number of first matrices, which makes the implementation simple.

[0019] In one possible implementation, the first information includes location information, which is the original location information, or the location information included in the first information is compressed location information obtained by compressing the original location information.

[0020] In this implementation, when the location information included in the first information is the raw location information, i.e., the uncompressed location information, the terminal can directly obtain the content of the location information upon receiving the first information. However, when the location information included in the first information is compressed location information, the transmission overhead of the first information can be saved.

[0021] In one possible implementation, the original location information is a location coordinate point or a location range.

[0022] In this implementation, location information can be represented by a single location coordinate point, which is convenient and helps save on the transmission overhead of the first information. Alternatively, it can be represented by a location range, which helps improve the accuracy of obtaining the first matrix corresponding to the terminal.

[0023] In one possible implementation, when the original location information is a location coordinate point, the compressed location information includes one or more of the following:

[0024] Reference point coordinates, the difference between the location coordinates and the reference point coordinates, or the difference between different location coordinates.

[0025] In this implementation, when the original location information is a location coordinate point, for multiple location coordinate points in the mapping relationship, the amount of data transmitted can be reduced and compression can be achieved by sending the difference value between the location coordinate point and the reference point coordinate, or the difference value between different location coordinate points.

[0026] In one possible implementation, when the original location information is a location range, the compressed location information includes one or more of the following:

[0027] Reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices within the location range, or the correspondence between the location range and the vertices.

[0028] In this implementation, when the original location information is a location range, for multiple location ranges in the mapping relationship, the amount of data transmitted can be reduced and compression can be achieved by sending the difference value between the vertex coordinates and the reference point coordinates in the location range, or the difference value between the coordinates of different vertices.

[0029] In one possible implementation, the first information includes information about a first matrix, wherein the information about the first matrix included in the first information is the original first matrix, or the information about the first matrix included in the first information is compressed matrix information obtained after compressing the original first matrix.

[0030] In this implementation, when the information of the first matrix included in the first information is the original first matrix, i.e., the uncompressed first matrix, the terminal can directly obtain the content of the first matrix when receiving the first information. However, when the information of the first matrix included in the first information is a compressed matrix after compression, the transmission overhead of the first information can be saved.

[0031] In one possible implementation, the original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

[0032] In one possible implementation, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the real part value and imaginary part value corresponding to the first coefficient.

[0033] The first coefficient is the coefficient in the matrix obtained by the original first matrix through discrete Fourier transform (DFT) whose corresponding amplitude value is greater than a preset amplitude value, or the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the original first matrix through discrete Fourier transform in descending order of amplitude value, where N is an integer greater than 0.

[0034] In this implementation, by performing a discrete Fourier transform on the original first matrix, and then selecting the coefficients with larger amplitude values ​​based on the coefficients obtained from the transform for transmission, the transmission overhead of the first information can be saved compared to directly transmitting the original first matrix.

[0035] In one possible implementation, the first information is carried in a broadcast message or a multicast message.

[0036] In this implementation, it is easy to include the first information in the broadcast message or multicast message.

[0037] Secondly, this application provides a communication method that can be applied to a second communication device (or, in other words, the method can be executed by the second communication device). The second communication device can be a network device, a module within the network device (e.g., a module, circuit, chip, or chip system), or a logical node, logical module, or software capable of implementing all or part of the functions of the network device. Taking the application of this method to a network device as an example, in this method, the network device sends first information, which indicates a mapping relationship between location information and a first matrix. The mapping relationship is used to determine the first matrix corresponding to the terminal in conjunction with the terminal's location information. The first matrix corresponding to the terminal is used to process downlink channel information; and the processed downlink channel information is received.

[0038] In one possible implementation, the method further includes:

[0039] Receive second information, the second information being used to indicate the location information of the terminal, or the second information being used to indicate the first matrix corresponding to the terminal;

[0040] The processed downlink channel information is processed based on the first matrix corresponding to the terminal to obtain the reconstructed downlink channel information.

[0041] In one possible implementation, the method further includes:

[0042] Send a third message, which is used to indicate the location information of the terminal.

[0043] In one possible implementation, in the mapping relationship, any location information corresponds to one or more first matrices.

[0044] In one possible implementation, each location information corresponds to M first matrices, where M is an integer greater than 0.

[0045] In one possible implementation, the first information includes location information, which is the original location information, or the location information included in the first information is compressed location information obtained by compressing the original location information.

[0046] In one possible implementation, the original location information is a location coordinate point or a location range.

[0047] In one possible implementation, when the original location information is a location coordinate point, the compressed location information includes one or more of the following:

[0048] Reference point coordinates, the difference between the location coordinates and the reference point coordinates, or the difference between different location coordinates.

[0049] In one possible implementation, when the original location information is a location range, the compressed location information includes one or more of the following:

[0050] Reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices within the location range, or the correspondence between the location range and the vertices.

[0051] In one possible implementation, the first information includes information about a first matrix, wherein the information about the first matrix included in the first information is the original first matrix, or the information about the first matrix included in the first information is compressed matrix information obtained after compressing the original first matrix.

[0052] In one possible implementation, the original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

[0053] In one possible implementation, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the real part value and imaginary part value corresponding to the first coefficient.

[0054] The first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

[0055] In one possible implementation, the first information is carried in a broadcast message or a multicast message.

[0056] Thirdly, this application provides a communication method that can be applied to a first communication device (or, in other words, the method can be executed by the first communication device). The first communication device can be a terminal or a communication module / processing module within the terminal, or a circuit or chip within the terminal (such as a modem chip, also known as a baseband chip, or a SoC chip or SIP chip containing a modem core). Taking the application of this method to a terminal as an example, in this method, the terminal receives first information and processed uplink channel information. The first information is used to indicate the mapping relationship between location information and a first matrix. The mapping relationship is used to determine the first matrix corresponding to the terminal based on the terminal's location information. The first matrix corresponding to the terminal is used to process the uplink channel information. The terminal processes the processed uplink channel information based on the first matrix corresponding to the terminal to obtain reconstructed uplink channel information.

[0057] It is understood that the uplink channel information in this application can be replaced by channel information, channel state information, etc. This application does not restrict this, and will not be elaborated further below.

[0058] In this embodiment, the network device sends a mapping relationship between location information and a first matrix, enabling the terminal to determine its corresponding first matrix based on its own location information and the mapping relationship. The terminal then processes the received uplink channel information according to the first matrix corresponding to the terminal to obtain the reconstructed uplink channel information. Compared with the current scheme that uses a fixed matrix to process uplink channel information, this application considers that the channel state may be different at different locations. Therefore, it configures different mapping relationships between location information and the first matrix, making the first matrix determined based on the terminal's location information more adaptable to actual needs. This helps to reduce the processing complexity and feedback overhead of channel information.

[0059] In one possible implementation, the method further includes:

[0060] Send a second message, which indicates the location information of the terminal, or the second message indicates the first matrix corresponding to the terminal.

[0061] In one possible implementation, before the terminal processes the processed uplink channel information based on the first matrix corresponding to the terminal to obtain the reconstructed uplink channel information, the method further includes:

[0062] Receive third information, which is used to indicate the location information of the terminal.

[0063] In one possible implementation, in the mapping relationship, any location information corresponds to one or more first matrices.

[0064] In one possible implementation, each location information corresponds to M first matrices, where M is an integer greater than 0.

[0065] In one possible implementation, the first information includes location information, which is the original location information, or the location information included in the first information is compressed location information obtained by compressing the original location information.

[0066] In one possible implementation, the original location information is a location coordinate point or a location range.

[0067] In one possible implementation, when the original location information is a location coordinate point, the compressed location information includes one or more of the following:

[0068] Reference point coordinates, the difference between the location coordinates and the reference point coordinates, or the difference between different location coordinates.

[0069] In one possible implementation, when the original location information is a location range, the compressed location information includes one or more of the following:

[0070] Reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices within the location range, or the correspondence between the location range and the vertices.

[0071] In one possible implementation, the first information includes information about a first matrix, wherein the information about the first matrix included in the first information is the original first matrix, or the information about the first matrix included in the first information is compressed matrix information obtained after compressing the original first matrix.

[0072] In one possible implementation, the original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

[0073] In one possible implementation, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the real part value and imaginary part value corresponding to the first coefficient.

[0074] The first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

[0075] In one possible implementation, the first information is carried in a broadcast message or a multicast message.

[0076] Fourthly, this application provides a communication method that can be applied to a second communication device, such as a network device on the network side, a module (e.g., a circuit, chip, or chip system) within the network device, or a logical node, logical module, or software capable of implementing all or part of the functions of the network device. Taking the application of this method to a network device as an example, in this method, the network device sends first information, which is used to indicate a mapping relationship between location information and a first matrix; wherein, the mapping relationship is used to determine the first matrix corresponding to the terminal in combination with the terminal's location information, and the first matrix corresponding to the terminal is used to process uplink channel information; the network device sends the processed uplink channel information.

[0077] It is understood that the first information and the processed uplink channel information can be sent together or separately.

[0078] In one possible implementation, the method further includes:

[0079] Receive second information, the second information being used to indicate the location information of the terminal, or the second information being used to indicate the first matrix corresponding to the terminal;

[0080] The uplink channel information is processed based on the first matrix corresponding to the terminal to obtain the processed uplink channel information.

[0081] In one possible implementation, the method further includes:

[0082] Send a third message, which is used to indicate the location information of the terminal.

[0083] In one possible implementation, in the mapping relationship, any location information corresponds to one or more first matrices.

[0084] In one possible implementation, each location information corresponds to M first matrices, where M is an integer greater than 0.

[0085] In one possible implementation, the first information includes location information, which is the original location information, or the location information included in the first information is compressed location information obtained by compressing the original location information.

[0086] In one possible implementation, the original location information is a location coordinate point or a location range.

[0087] In one possible implementation, when the original location information is a location coordinate point, the compressed location information includes one or more of the following:

[0088] Reference point coordinates, the difference between the location coordinates and the reference point coordinates, or the difference between different location coordinates.

[0089] In one possible implementation, when the original location information is a location range, the compressed location information includes one or more of the following:

[0090] Reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices within the location range, or the correspondence between the location range and the vertices.

[0091] In one possible implementation, the first information includes information about a first matrix, wherein the information about the first matrix included in the first information is the original first matrix, or the information about the first matrix included in the first information is compressed matrix information obtained after compressing the original first matrix.

[0092] In one possible implementation, the original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

[0093] In one possible implementation, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the real part value and imaginary part value corresponding to the first coefficient.

[0094] The first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

[0095] In one possible implementation, the first information is carried in a broadcast message or a multicast message.

[0096] Fifthly, this application provides a communication device comprising units, modules, or means for implementing any of the methods described in the first to fourth aspects, or any possible implementations of any of the aspects. These modules, units, or means may be implemented in software, hardware, or a combination of software and hardware.

[0097] Sixthly, this application provides a communication device including a processor. The processor is configured to cause the communication device to implement the methods shown in any of the first to fourth aspects, or any possible implementation thereof.

[0098] Optionally, the communication device further includes a transceiver for sending and receiving information.

[0099] Optionally, the communication device further includes a memory storing a computer program; the processor and transceiver are used to invoke the computer program in the memory, causing the communication device to implement the method shown in any of the first to fourth aspects, or any possible implementation of any of the aspects.

[0100] In one possible design, the communication device can be a chip that implements the above method or a device containing a chip.

[0101] In a seventh aspect, this application provides a communication device comprising one or more processors, which implement, via logic circuits or executable code instructions, any of the methods described in the first to fourth aspects, or any possible implementation thereof.

[0102] Optionally, the communication device further includes an interface circuit for receiving signals from other communication devices outside the communication device and transmitting them to the processor, or sending signals from the processor to other communication devices outside the communication device.

[0103] Optionally, the communication device may further include a memory for storing part or all of the computer programs or instructions necessary to implement the functions involved in the first aspect above.

[0104] The aforementioned communication device may be a terminal, a communication module in a terminal, or a chip in a terminal that is responsible for communication functions, such as a modem chip (also known as a baseband chip) or a SoC or SIP chip that contains a modem module.

[0105] The aforementioned communication device may be a network device, a module (e.g., a circuit, chip, or chip system) in a network device, or a logical node, logical module, or software that can realize all or part of the functions of a network device.

[0106] Eighthly, this application provides a computer-readable storage medium storing a computer program or instructions that, when executed by a computer, implement the method shown in any of the first to fourth aspects, or any possible implementation thereof.

[0107] Ninthly, this application provides a computer program product that, when read and executed by a computer, causes the computer to perform any of the methods in the first to fourth aspects, or any possible implementation thereof.

[0108] In a tenth aspect, this application provides a chip system including at least one processor and an interface, the processor being configured to read and execute a computer program or instructions in a memory, wherein when the computer program or instructions are executed, the chip performs the method described in any one of the first to fourth aspects, or the method shown in any possible implementation of any one of the aspects.

[0109] Eleventhly, this application provides a communication system that may include a terminal and a network device. The terminal is used to perform the method shown in the first aspect or any possible implementation thereof, or the terminal is used to perform the method shown in the third aspect or any possible implementation thereof. The network device is used to perform the method shown in the second aspect or any possible implementation thereof, or the network device is used to perform the method shown in the fourth aspect or any possible implementation thereof. Attached Figure Description

[0110] Figure 1 is a schematic diagram of the architecture of the communication system used in the embodiments of this application;

[0111] Figure 2 is a schematic diagram of the architecture of the O-RAN system provided in this application;

[0112] Figure 3 is a schematic diagram of the network element function division and protocol layer structure of an O-RAN device provided in this application;

[0113] Figure 4 is a schematic diagram of the division of location information provided in an embodiment of this application;

[0114] Figure 5 is a flowchart illustrating a communication method provided in an embodiment of this application;

[0115] Figure 6 is a schematic diagram of a regular region represented by the overall region coordinates and the size of the sub-regions according to an embodiment of this application;

[0116] Figure 7 is a schematic diagram showing the location information provided in the embodiments of this application, namely the location coordinates and the location range;

[0117] Figure 8 is a schematic diagram of the compressed location information provided in an embodiment of this application;

[0118] Figure 9 is a schematic diagram of the original first matrix provided in an embodiment of this application;

[0119] Figure 10 is a schematic diagram of compressed matrix information obtained by compressing the original first matrix according to an embodiment of this application;

[0120] Figure 11 is a schematic diagram of a terminal processing downlink channel information based on a first matrix corresponding to the terminal, according to an embodiment of this application.

[0121] Figure 12 is a schematic diagram of the second information fed back by the terminal and the processed downlink channel information provided in an embodiment of this application;

[0122] Figure 13 is a schematic diagram of the network device provided in this application reconstructing downlink channel information based on the first matrix corresponding to the terminal;

[0123] Figure 14 is another flowchart illustrating the communication method provided in an embodiment of this application;

[0124] Figure 15 is a schematic diagram of the structure of a possible communication device provided in an embodiment of this application;

[0125] Figure 16 is a schematic diagram of the structure of a possible communication device provided in an embodiment of this application;

[0126] Figure 17 is a schematic diagram of the structure of a possible communication device provided in an embodiment of this application. Detailed Implementation

[0127] The technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings.

[0128] In the description of this application, terms such as "first" and "second" are used only to distinguish different objects, not to describe a specific order. Furthermore, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Additionally, "at least one" refers to one or more, and "multiple" refers to two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, or c can represent: a, b, c; a and b; a and c; b and c; or a and b and c. Where a, b, and c can be single or multiple.

[0129] The terms “comprising” and “having”, and any 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 steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0130] In this application, the words "exemplary" or "for example" are used to indicate that something is an example, illustration, or illustration. Any embodiment or design described as "exemplary," "for example," or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Rather, the use of the words "exemplary," "for example," or "for example" is intended to present the relevant concepts in a specific manner.

[0131] It is understood that in this application, "when," "if," and "if" all refer to the device making a corresponding action under certain objective circumstances, and are not time-limited, nor do they require the device to make a judgment when it is implemented, nor do they imply any other limitations.

[0132] In this application, the use of singular pronouns for elements is intended to indicate "one or more," rather than "one and only one," unless otherwise specified. The terms "system" and "network" in the embodiments of this application are used interchangeably.

[0133] It is understood that in the embodiments of this application, "B corresponding to A" means that there is a correspondence between A and B, and B can be determined based on A. Determining B based on A does not mean that B can be determined solely based on A; B can also be determined based on A and / or other information.

[0134] To better understand the embodiments of this application, the system architecture involved in the embodiments of this application will be described first below:

[0135] The technical solutions of the embodiments of this application can be applied to various communication systems, such as: frequency division duplex (FDD) systems, time division duplex (TDD) systems, public land mobile network (PLMN) systems, LTE-Advanced (LTE-A) systems, the 5th generation (5G) systems, new radio (NR) systems, machine-to-machine (M2M) systems, or other future communication systems, or other wireless communication systems that adopt wireless access technologies, etc., all of which can adopt the technical solutions of the embodiments of this application.

[0136] Please refer to Figure 1, which is a schematic diagram of the architecture of the communication system applied in the embodiments of this application. It should be noted that Figure 1 is a possible, non-limiting system schematic diagram. As shown in Figure 1, the communication system 10 includes a radio access network (RAN) 100 and a core network (CN) 200. Optionally, the communication system 10 may also include an Internet 300. RAN 100 includes at least one RAN node (110a and 110b in Figure 1, collectively referred to as 110) and at least one terminal (120a-120j in Figure 1, collectively referred to as 120). RAN 100 may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in Figure 1). Terminal 120 is wirelessly connected to RAN node 110. RAN node 110 is connected to core network 200 wirelessly or via a wired connection. The core network elements in core network 200 and RAN nodes 110 in RAN 100 can be different physical devices, or they can be the same physical device integrating core network logical functions and radio access network logical functions, or they can be a single physical device integrating some core network element functions and some RAN node 110 functions. Terminals can be interconnected with each other, and RAN nodes 110 can be interconnected with each other via wired or wireless means. Figure 1 is only a schematic diagram. This communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices. Each device may also include different functional units, which are not shown in Figure 1.

[0137] RAN 100 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as 4G, 5G mobile communication systems, or future-oriented evolution systems. RAN 100 can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. RAN 100 can also be a communication system that integrates two or more of the above systems.

[0138] RAN node 110, sometimes also referred to as a radio access network device, access network apparatus, network equipment, RAN entity, or access node, constitutes part of the communication system and is used to help terminals achieve wireless access. Multiple RAN nodes 110 in communication system 10 can be of the same type or different types. In some scenarios, the roles of RAN node 110 and terminal 120 are relative. For example, network element 120i in Figure 1 can be a helicopter or drone, which can be configured as a mobile base station. For terminals 120j accessing RAN 100 through network element 120i, network element 120i is a base station; but for base station 110a, network element 120i is a terminal. RAN node 110 and terminal 120 are sometimes both referred to as communication devices. For example, network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functions, and network elements 120a-120j can be understood as communication devices with terminal functions.

[0139] In one possible scenario, RAN node 110 can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next-generation NodeB (gNB), a base station in a future mobile communication system, or an access node in a WiFi system. RAN node 110 can be a macro base station (as shown in Figure 1, 110a), a micro base station or indoor station (as shown in Figure 1, 110b), a relay node or donor node, or a radio controller in a CRAN scenario. Optionally, RAN node 110 can also be a server, a wearable device, a vehicle, or an in-vehicle device. For example, the access network device in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). All or part of the functions of RAN node 110 in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (e.g., a cloud platform). In this application, RAN node 110 can also be a logical node, logical module, or software that can implement all or part of the functions of RAN node 110.

[0140] In another possible scenario, multiple RAN nodes 110 collaborate to assist the terminal in achieving wireless access, with each RAN node 110 implementing a portion of the base station's functions. For example, a RAN node 110 can be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. CUs and DUs can be set up separately or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0141] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.

[0142] For example, please refer to Figure 2, which is a schematic diagram of the architecture of the O-RAN system provided in this application. Figure 2 is only a schematic diagram, and the O-RAN system may also include other components besides those shown in Figure 2. As shown in Figure 2, the access network device (e.g., it may be an eNB, gNB, or next-generation access network device) communicates with the core network elements in the CN through a backhaul link and communicates with the terminal through the air interface.

[0143] Specifically, the BBU in the access network device communicates with the core network elements in the CN via a backhaul link, and the RU in the access network device communicates with at least one terminal via an air interface. The BBU communicates with at least one RU via a fronthaul link. The BBU and RU may or may not be co-located. The BBU includes at least one CU and at least one DU, which can communicate via at least one midhaul link.

[0144] Figure 3 illustrates a schematic diagram of the network element function division and protocol layer structure of an O-RAN device. In some examples, the CU is a logical node carrying the radio resource control (RRC) layer, service data adaptation protocol (SDAP) layer, packet data convergence protocol (PDCP) layer, and other control functions of the access network device. The CU connects to network nodes such as the core network through interfaces, which can be interfaces such as E2 interfaces. Optionally, the CU may have some core network functions. The CU (e.g., the PDCP layer and higher layers) connects to the DU (e.g., the RLC layer and lower layers) through interfaces, which can be interfaces such as F1 interfaces. In some examples, these interfaces (e.g., the F1 interface) can provide control plane (C-Plane) and user plane (U-Plane) functions (e.g., interface management, system information management, UE context management, RRC message transmission, etc.). F1AP is the application protocol of the F1 interface, and in some examples, it defines the signaling procedures of F1. The F1 interface supports the control plane F1-C and the user plane F1-U.

[0145] In some examples, the CU can be split into CU-CP (control unit-control plane) and CU-UP (control unit-user plane). CU-CP is a logical node carrying the RRC layer and PDCP-C (control plane part of PDCP) layer, used to implement the CU's control plane functions. CU-CP can interact with network elements in the core network used to implement control plane functions. These network elements in the core network can be access and mobility function (AMF) network elements, such as the access and mobility management function (AMF) in a 5G system. The AMF network element is responsible for mobility management in the mobile network, such as terminal location updates, terminal registration with the network, and terminal handover. CU-UP is a logical node carrying the SDAP layer and PDCP-U (user plane part of PDCP) layer, used to implement the CU's user plane functions. CU-UP can interact with network elements in the core network used to implement user plane functions. These network elements in the core network, such as the user plane function (UPF) in a 5G system, are responsible for data forwarding and receiving in the terminal. The above CU and DU configurations are merely examples; the functions of the CU and DU can be configured as needed. For instance, the CU or DU can be configured to have more protocol layer functions, or only some protocol layer processing functions. For example, some RLC layer functions and protocol layer functions above the RLC layer can be placed in the CU, while the remaining RLC layer functions and protocol layer functions below the RLC layer can be placed in the DU. Furthermore, the functions of the CU or DU can be divided according to service type or other system requirements, such as by latency. Functions that require low latency can be placed in the DU, while functions that do not require low latency can be placed in the CU.

[0146] In some examples, a DU is a logical node that carries the radio link control (RLC) layer, medium access control (MAC) layer, higher physical layer (Higher PHY) layer, and other functions. In some examples, a DU can control at least one RU. The DU connects to the RU through interfaces, which can be fronthaul interfaces. In some examples, the Higher PHY layer includes the PHY layer processing, such as forward error correction (FEC) encoding and decoding, scrambling, modulation, and demodulation.

[0147] In some examples, the RU is a logical node that carries both lower physical layer (PHY) and radio frequency (RF) processing. In some examples, the RU can be a 3GPP transmission reception point (TRP), a remote radio head (RRH), or other similar entities. In some examples, the Low-PHY includes PHY processing functions such as Fast Fourier Transform (FFT), Inverse Fast Fourier Transform (IFFT), digital beamforming, and filtering. The RU communicates with one or more terminals via a wireless link.

[0148] The DU and RU can be co-located or not. The DU and RU exchange control plane and user plane information via a fronthaul link through the Lower-Layer Split CUS-Plane (LLS-CUS) interface. LLS-CUS may include LLS-C and LLS-U interfaces providing the control plane (C-Plane) and user plane (U-Plane), respectively. In some examples, the control plane (C-Plane) refers to real-time control between the DU and RU. The DU and RU exchange management information via an LLS-M interface on the fronthaul link; the management plane (M-Plane) refers to non-real-time management operations between the DU and RU.

[0149] DU and RU can cooperate to implement the functions of the PHY layer. A DU can be connected to one or more RUs. The functions of DU and RU can be configured in various ways depending on the design. For example, a DU can be configured to implement baseband functions, and an RU can be configured to implement mid-RF functions. Another example is that a DU can be configured to implement higher-level functions in the PHY layer, and an RU can be configured to implement lower-level functions in the PHY layer, or to implement both lower-level and RF functions. Higher-level functions in the physical layer can include a portion of the physical layer's functions that are closer to the MAC layer, while lower-level functions in the physical layer can include another portion of the physical layer's functions that are closer to the mid-RF side.

[0150] A terminal is a device or module that connects to the aforementioned communication system and possesses corresponding communication functions. Terminals can also be referred to as terminal equipment, user equipment (UE), user devices, access terminals, user units, user stations, mobile stations, mobile stations (MS), remote stations, remote terminals, mobile devices, user terminals, terminal units, terminal stations, terminal devices, wireless communication equipment, user agents, or user devices, etc. Terminals typically contain communication modules, circuits, or chips that perform the corresponding communication functions. They can also be configured with program instructions for performing these functions. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), the Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, and smart cities. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver function, wearable device, vehicle, drone, helicopter, airplane, ship, robot, robotic arm, smart home device, transportation vehicle with wireless communication function, communication module, roadside unit (RSU) with terminal function, etc. The embodiments of this application do not limit the device form of the terminal.

[0151] For ease of description, the following description uses a base station as an example of RAN node 110. Base stations and terminals can be fixed or mobile. Base stations and terminals can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of the base stations and terminals.

[0152] The roles of base stations and terminals can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile base station. For terminals 120j that access the wireless access network 100 through 120i, terminal 120i is a base station; however, for base station 110a, 120i is a terminal, meaning that 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a base station-to-base station interface protocol. In this case, relative to 110a, 120i is also a base station. Therefore, both base stations and terminals can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be called communication devices with base station functions, and 120a-120j in Figure 1 can be called communication devices with terminal functions.

[0153] Communication between base stations and terminals, between base stations, and between terminals can be conducted using licensed spectrum, unlicensed spectrum, or both simultaneously. Communication can be conducted using spectrum below 6 GHz, spectrum above 6 GHz, or both simultaneously. The embodiments of this application do not limit the spectrum resources used for wireless communication.

[0154] In the embodiments of this application, the functions of the base station can be executed by modules (such as chips) within the base station, or by a control subsystem that includes base station functions. This control subsystem, including base station functions, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities. Similarly, the functions of the terminal can be executed by modules (such as chips or modems) within the terminal, or by a device that includes terminal functions.

[0155] In this application, the base station sends downlink signals or downlink information to the terminal, with the downlink information carried on the downlink channel; the terminal sends uplink signals or uplink information to the base station, with the uplink information carried on the uplink channel. To communicate with the base station, the terminal needs to establish a radio connection on a cell controlled by the base station. The cell with which the terminal has established a radio connection is called the terminal's serving cell. When the terminal communicates with this serving cell, it is also susceptible to interference from signals from neighboring cells.

[0156] In this application, "sending information" can be understood as one device sending information to another device, or it can also be understood as one logical module within a device sending information to another logical module. For example, "base station sending information" can be understood as the base station sending information to another device (such as a terminal), or it can be understood as logical module 1 in the base station sending information to logical module 2 in the base station.

[0157] In this application, "receiving information" can be understood as one device receiving information from another device, or it can also be understood as a logical module within a device receiving information from another logical module. For example, "base station receiving information" can be understood as the base station receiving information from another device (such as a terminal), or it can be understood as logical module 1 in the base station receiving information from logical module 2 in the base station.

[0158] The communication between different devices involved in this application can refer to direct communication between different devices (i.e., without the need for relaying or forwarding by other devices), or communication between different devices through other devices (i.e., requiring relaying or forwarding by other devices), or communication between a functional unit within a device and other devices through another functional unit. In other words, "sending information to… (e.g., a terminal)" or the relevant illustrations in the accompanying drawings can be understood as the destination of the information being the terminal. This can include sending information directly or indirectly to the terminal. "Receiving information from… (e.g., a terminal)" or "receiving information from… (e.g., a terminal)" or "receiving information sent (e.g., by a terminal)" or the relevant illustrations in the accompanying drawings can be understood as the source of the information being the terminal. This can include receiving information directly or indirectly from the terminal. Information may undergo necessary processing between the source and destination, such as format changes, analog-to-digital conversion, amplification, filtering, etc., but the destination can understand the valid information from the source. Similar expressions in this application can be understood in a similar way, and will not be elaborated further here.

[0159] To facilitate understanding of the embodiments of this application, some knowledge / terms used in the solutions of this application are introduced below. It should be noted that these explanations are for the purpose of making the embodiments of this application easier to understand, and should not be regarded as limiting the scope of protection claimed by this application.

[0160] 1. Uplink channel information and downlink channel information

[0161] An uplink channel is a channel used for transmitting signals from a terminal to a network device, and a downlink channel is a channel used for transmitting signals from a network device to a terminal. In the embodiments of this application, the uplink channel information may refer to the Channel Identity System (CSI) of the uplink channel, and the downlink channel information may refer to the Channel Identity System (CSI) of the downlink channel. Generally, the CSI may include indication information of the channel matrix or precoding matrix.

[0162] 2. Channel matrix and precoding matrix

[0163] The channel matrix represents the channel response of the transmitting and receiving ends. It can be a three-dimensional matrix (i.e., the matrix has 3 dimensions), with the three dimensions corresponding to the transmit antenna, receive antenna, and subcarrier, respectively. Optionally, the channel matrix can also be a four-dimensional matrix (i.e., the matrix has 4 dimensions), for example, with the four dimensions corresponding to the transmit antenna, receive antenna, subcarrier, and time, respectively.

[0164] The precoding matrix can be obtained by performing singular value decomposition (SVD) on the channel matrix. For example, for a three-dimensional channel matrix, the precoding matrix can be obtained by performing SVD on the channel matrix subcarrier by subcarrier. More specifically, the operation can be to perform SVD on the two-dimensional matrix corresponding to each subcarrier (the two dimensions correspond to the transmit antenna and the receive antenna, respectively). The resulting left singular value matrix corresponds to the two-dimensional precoding matrix used for transmitting data (the two dimensions correspond to the transmit antenna and the spatial stream, respectively). By concatenating the two-dimensional precoding matrices of all subcarriers, the precoding matrix (the three dimensions correspond to the transmit antenna, the spatial stream, and the subcarrier, respectively) can be obtained.

[0165] The following text will mainly use the channel matrix as an example for illustrative explanation, where the channel matrix can be represented by H.

[0166] 3. First Matrix

[0167] The first matrix is ​​used to process channel information (e.g., downlink or uplink channel information). For example, at the transmitting end of the channel information, the first matrix can be used to encode or compress the channel information, including transformation processing, dimensionality reduction processing, etc. At the receiving end of the channel information, the first matrix can be used to decode or decompress the channel information, including inverse transformation processing, dimensionality increase processing, etc.

[0168] 4. Location Information

[0169] Location information can be sub-regions obtained by dividing the entire service area of ​​the cell, as shown in Figure 4(a), where the entire service area of ​​the cell can be divided into sub-regions corresponding to location information 1 to location information 20. Alternatively, location information can also be sub-regions obtained by dividing a portion of the service area of ​​the cell, as shown in Figure 4(b), where a portion of the service area of ​​the cell can be divided into sub-regions corresponding to location information 1 to location information 8. In other words, location information can be a subdivided area within the entire service area of ​​the cell, or it can be a subdivided area within a portion of the service area of ​​the cell.

[0170] Alternatively, the service range of the aforementioned cell can also be described as the coverage area of ​​the cell, or the service area of ​​the cell, or the coverage area of ​​the cell, etc., without limitation.

[0171] Optionally, the location information involved in the embodiments of this application can be the location of a regular region, such as a square region or a rectangular region, where, in addition to being regular in shape, different regions typically have the same area size. Alternatively, the location information involved in the embodiments of this application can also be the location of an irregular region, such as a polygonal region, an elliptical / circular region, etc., where each irregular region typically has a different area. That is to say, the sub-region corresponding to the location information can also be a regular region or an irregular region.

[0172] As an evolution of MIMO technology, ultra-large-scale MIMO can not only serve multiple users simultaneously on the same time-frequency resources, but also achieve higher spectral efficiency and energy efficiency. In ultra-large-scale MIMO configurations, the base station and terminal sides are equipped with more antenna elements. In addition, with the increase in carrier frequency, the bandwidth available for allocation in the wireless system also increases further, resulting in a sharp increase in the amount of channel information to be fed back (such as CSI). Therefore, CSI data processing and feedback face problems such as high processing complexity and large data transmission volume.

[0173] Based on this, this application proposes a communication method and apparatus that can adapt to the CSI feedback requirements of ultra-large-scale MIMO, reduce the processing complexity of channel information, and reduce feedback overhead.

[0174] It should be noted that in the description of this application, "instruction" can include direct and indirect instructions, as well as explicit and implicit instructions. The information indicated by a certain piece of information (such as the first information, second information, third information, etc., as described below) is called the information to be instructed. In specific implementation, there are many ways to instruct the information to be instructed. For example, the information to be instructed can be directly instructed, where the information to be instructed itself or its index is used. Alternatively, the information to be instructed can be indirectly indicated by indicating other information, where there is a correlation between the other information and the information to be instructed. Another example is that only a part of the information to be instructed can be indicated, while the other parts are known, pre-agreed upon, or deducible. Furthermore, the instruction of specific information can be achieved by using a pre-agreed (e.g., protocol-defined) arrangement of various pieces of information, thereby reducing instruction overhead to some extent.

[0175] The communication method and apparatus provided in this application will be further described below with reference to the accompanying drawings. It is understood that this application uses network devices and terminals as examples of the execution subjects in the interactive illustration, but this application does not limit the execution subjects of the interactive illustration. For example, the method executed by the network device in this application can also be implemented by modules (e.g., circuits, chips, or chip systems) in the network device, or by logic nodes, logic modules, or software that can implement all or part of the functions of the network device; the method executed by the terminal in this application can also be implemented by the communication / processing module in the terminal or by circuits or chips (such as modem chips (also known as baseband chips), or SoC chips / SIP chips containing modem cores) in the terminal responsible for communication / processing functions.

[0176] Please refer to Figure 5, which is a flowchart illustrating a communication method provided in an embodiment of this application. As shown in Figure 5, the communication method may include the following steps:

[0177] S501, the network device sends first information to the terminal. Accordingly, the terminal receives the first information from the network device, which is used to indicate the mapping relationship between location information and the first matrix.

[0178] Optionally, the first information can also be described as radio frequency map information (RFMapInfo). For ease of description, the mapping relationship between the location information and the first matrix will sometimes be referred to as a mapping relationship in the following text.

[0179] In the mapping relationship between the above location information and the first matrix, any location information can correspond to one or more first matrices. For example, each location information corresponds to M first matrices, or different location information corresponds to different numbers of first matrices. The following will explain these two cases (i.e., case 1 and case 2) respectively. That is to say, in the mapping relationship between the above location information and the first matrix, any location information can correspond to a set of matrices, and the number of first matrices included in each set of matrices can be the same or different.

[0180] Case 1: Each location information corresponds to M first matrices. For example, in scenarios with similar channel characteristics (e.g., the scenario of partial service range shown in Figure 4(b)), the number of first matrices corresponding to each location information may be the same, M, where M is an integer greater than 0. Optionally, the size of M can be carried in the first information, or the size of M can be predefined, such as that predefined by the protocol, which is not limited here. For example, depending on the location information (i.e., regular or irregular area), the mapping relationship between location information and the first matrix can include the two representations shown in Tables 1 and 2 below:

[0181] Table 1

[0182] Generally speaking, for regular regions, the position information of each sub-region can be derived from the overall region coordinates and the size of the sub-regions. For example, as shown in Figure 6, taking the sub-regions as grids, when the grid dividing lines are parallel to the x and y axes respectively, only the bottom left vertex (x1, y1) and the top right vertex (x2, y2) are needed to determine the coordinate range of the overall region. Assuming that the size of each grid is d1×d2, then the position range of the grid corresponding to the i-th row and j-th column is (x1+(i–1)×d1, y1+(j–1)×d2)~(x1+i×d1, y1+j×d2), where the value range of i is {1,2,…,N1}, and the value range of j is {1,2,…,N2}, where N1=(x2–x1) / d1) and N2=(y2–y1) / d2.

[0183] Optionally, for a regular region, the location information of a sub-region can also be represented by location coordinates or location range, which is not limited in this application. For example, when the location information of a sub-region is represented by location coordinates, the location coordinates can be, for example, the coordinates of the center of the sub-region, or the coordinates of the centroid of the sub-region, etc., which is not limited.

[0184] Table 2

[0185] Generally, for irregular regions, the location information of each sub-region can also be represented by location coordinates or location ranges. For example, when the location information of a sub-region is represented by location coordinates, these coordinates can be, for example, the coordinates of the center of the sub-region, or the coordinates of the centroid of the sub-region, etc., without limitation. The method of sending location coordinates or location ranges will be described later and will not be elaborated here.

[0186] Scenario 2: The number of first matrices corresponding to different location information can also be different. For example, in scenarios with significant differences in channel characteristics (as shown in Figure 4(a), where some locations are line-of-sight (LOS) and some are non-line-of-sight (NLOS) within the entire service range), the number of first matrices corresponding to different location information may differ. Here, "different number of first matrices corresponding to different location information" can mean completely different (or all different), or partially different, depending on the actual situation. This application does not limit this. For example, depending on the location information (i.e., regular or irregular regions), the mapping relationship between location information and the first matrix can include the two representations shown in Tables 3 and 4 below:

[0187] Table 3

[0188] Table 4

[0189] Optionally, if the number of first matrices corresponding to different positional information is different, additional indicator information can be added to the first information. This additional indicator information is used to indicate the number of first matrices corresponding to different positional information. Alternatively, this additional indicator information can also be used to indicate the index of the first matrix corresponding to different positional information. For example, this indicator information can specifically be a bitmap or a set of indices of the first matrix.

[0190] For example, in the case of a regular region, the mapping relationship between the location information and the first matrix, and the way the newly added indication information indicates the number of first matrices or bitmaps corresponding to different location information, can be shown in Tables 5 and 6 below, respectively:

[0191] Table 5

[0192] Table 6

[0193] In Table 6 above, each bit in the bitmap can correspond to a predetermined piece of information, such as a dimension of the channel matrix H. The value of the bit indicates whether a corresponding first matrix exists. For example, when a bit is 1, it means that the dimension corresponds to a first matrix; when a bit is 0, it means that the dimension does not correspond to a first matrix. For instance, for the row with position index 1, assuming the bitmap is [1,0,1], it means that the first and third dimensions of the channel matrix H each have a corresponding first matrix Q. 1,1 and the first matrix Q 3,1 The second dimension does not contain the first matrix Q. 2,1 Optionally, it can be defined that when a bit is 0, it indicates that the dimension corresponds to a first matrix, and when a bit is 1, it indicates that the dimension does not correspond to a first matrix. This application mainly uses the example of a bit being 1 indicating that the dimension corresponds to a first matrix for illustrative purposes. The length of the bitmap described above is M, where M is an integer greater than 0.

[0194] As another example, in the case of irregular regions, the mapping relationship between location information and the first matrix, and the way the newly added indication information indicates the number of first matrices or bitmaps corresponding to different location information, can be shown in Tables 7 and 8 below, respectively:

[0195] Table 7

[0196] Table 8

[0197] The bitmap in Table 8 has the same meaning as the bitmap in Table 6, so it will not be repeated here.

[0198] It should be noted that when the number of first matrices corresponding to different location information is partially the same and partially different, the parts with the same number can be merged and sent as one copy. For example, Table 9 mainly uses a regular grid as an example for illustration:

[0199] Table 9

[0200] For ease of understanding, the embodiments of this application are mainly illustrated by taking the example that the number of first matrices corresponding to each location information is the same, which is M.

[0201] In one possible implementation, the first information may include location information, and the location information included in the first information is the original location information, or the location information included in the first information is compressed location information obtained after compressing the original location information. Here, the original location information can be understood as uncompressed location information, meaning that the terminal can directly obtain the specific content of the location information based on the original location information. For compressed location information, the terminal cannot directly obtain the specific content of the location information based on the compressed location information; information processing is required before the specific content of the location information can be obtained.

[0202] For example, the original location information can be a location coordinate point or a location range. For example, when the location information is represented by a location coordinate point, the location coordinate point can be, for example, the coordinate point of the center of the sub-region, or the coordinate point of the centroid of the sub-region, etc., without limitation. The following describes the content of the compressed location information when the original location information is a location coordinate point (i.e., design (1)) and a location range (i.e., design (2)).

[0203] Design (1): When the original location information is a location coordinate point, the compressed location information includes one or more of the following: reference point coordinates, the difference between the location coordinate point and the reference point coordinates, or the difference between different location coordinate points. For ease of understanding, the reference point coordinates can be represented as (x... Ref y RefFor example, the reference point coordinates involved in the embodiments of this application can be a predefined specific coordinate point, or the reference point coordinates can be one of the position coordinate points. Optionally, when the reference point coordinates are one of the position coordinate points, the difference between the position coordinate point used as the reference point coordinates and the reference point coordinates can be empty (e.g., NULL), that is, not carried in the first information (or compressed position information), or, by default, the difference between the position coordinate point used as the reference point coordinates and the reference point coordinates is 0. Optionally, the reference point coordinates can also not be carried in the compressed position information, but are predefined, such as those predefined by the protocol.

[0204] As shown in Figure 7(a), taking the position coordinates including position coordinates 1 (x1, y1), 2 (x2, y2), 3 (x3, y3), 4 (x4, y4), and 5 (x5, y5) as an example, when the compressed position information includes the reference point coordinates and the difference between the position coordinates and the reference point coordinates, the compressed position information in the example of Figure 7(a) can include the reference point coordinates (x1, y1), 2 (x2, y2), 3 (x3, y3), 4 (x4, y4), and 5 (x5, y5). Ref y Ref The difference between the coordinates of point 1 and the coordinates of the reference point (x1 - x) Ref y1-y Ref The difference between the coordinates of point 2 and the coordinates of the reference point (x2 - x) Ref y2-y Ref The difference between the coordinates of position point 3 and the coordinates of the reference point (x3 - x) Ref y3-y Ref The difference between the coordinates of position point 4 and the coordinates of the reference point (x4 - x) Ref y4-y Ref The difference between the coordinates of position point 5 and the coordinates of the reference point (x5 - x) Ref y5-y Ref ).

[0205] Optionally, the compressed location information may not include the reference point coordinates (e.g., the reference point coordinates are predefined by the protocol), but may include the difference between the location coordinates and the reference point coordinates. Therefore, in the example in Figure 7(a) above, the compressed location information may only include the difference between the location coordinates 1 and the reference point coordinates (x1 - x). Ref y1-y Ref The difference between the coordinates of point 2 and the coordinates of the reference point (x2 - x) Ref y2-y Ref The difference between the coordinates of position point 3 and the coordinates of the reference point (x3 - x) Ref y3-y RefThe difference between the coordinates of position point 4 and the coordinates of the reference point (x4 - x) Ref y4-y Ref The difference between the coordinates of position point 5 and the coordinates of the reference point (x5 - x) Ref y5-y Ref ).

[0206] Optionally, when the compressed location information includes reference point coordinates, the difference between the location coordinates and the reference point coordinates, and the difference between different location coordinates, the compressed location information in the example in Figure 7(a) above may include reference point coordinates (x... Ref y Ref The difference between the coordinates of point 1 and the coordinates of the reference point (x1 - x) Ref y1-y Ref The differences between position coordinate point 2 and position coordinate point 1 are (x2-x1, y2-y1), the differences between position coordinate point 3 and position coordinate point 2 are (x3-x2, y3-y2), the differences between position coordinate point 4 and position coordinate point 3 are (x4-x3, y4-y3), and the differences between position coordinate point 5 and position coordinate point 4 are (x5-x4, y5-y4).

[0207] Optionally, when the reference point coordinates are one of the position coordinate points, for example, when the reference point coordinates are position coordinate point 1, the compressed position information in the example of Figure 7(a) above includes the difference values ​​between different position coordinate points, that is, the difference value between position coordinate point 2 and position coordinate point 1 (x2-x1, y2-y1), the difference value between position coordinate point 3 and position coordinate point 2 (x3-x2, y3-y2), the difference value between position coordinate point 4 and position coordinate point 3 (x4-x3, y4-y3), and the difference value between position coordinate point 5 and position coordinate point 4 (x5-x4, y5-y4).

[0208] For example, if the compressed location information only includes the coordinates of a reference point, assuming the coordinates are evenly distributed, then each coordinate point can be determined based on the reference point coordinates, combined with the number of coordinate points, the spacing between them, or their arrangement. The number of coordinate points, the spacing between them, or their arrangement can be predefined by the protocol. Optionally, these parameters are also included in the compressed location information.

[0209] Design (2): When the original location information is a location range, the compressed location information includes one or more of the following: reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices of the location range, or the correspondence between the location range and the vertices. Optionally, the reference point coordinates (x... Ref y Ref The reference point coordinates can also be a specific coordinate point predefined (e.g., protocol-predefined), or the reference point coordinates can be the coordinates of a vertex within a position range. Optionally, when the reference point coordinates are the coordinates of a vertex within a position range, the difference between the vertex coordinates used as reference point coordinates and the reference point coordinates can be empty (e.g., NULL), meaning it is not carried in the first information (or compressed position information), or, by default, the difference between the position range used as reference point coordinates and the reference point coordinates is 0. Optionally, the correspondence between position ranges and vertices can also be predefined, such as protocol-predefined.

[0210] As shown in Figure 7(b), taking the position range including position range 1, position range 2, position range 3, position range 4, and position range 5 as an example, position range 1 corresponds to vertex coordinates 1(x1, y1), vertex coordinates 2(x2, y2), vertex coordinates 3(x3, y3), vertex coordinates 8(x8, y8), and vertex coordinates 9(x9, y9); position range 2 corresponds to vertex coordinates 3(x3, y3), vertex coordinates 4(x4, y4), vertex coordinates 5(x5, y5), vertex coordinates 6(x6, y6), vertex coordinates 7(x7, y7), and vertex coordinates 8(x8, y8); position range 3 corresponds to vertex coordinates 7(x7, y7), vertex coordinates 8(x8, y8), vertex coordinates 9(x9, y9), and vertex coordinates 10(x1, y1), 2(x2, y2), 3(x3, y3), 8(x8, y7), and 9(x9, y9), and 10(x8, y9). 10 y 10 Position range 4 corresponds to vertex coordinates 6(x6, y6), vertex coordinates 7(x7, y7), and vertex coordinates 10(x6, y7). 10 y 10 ), vertex coordinates 11(x 11 y 11 Position range 5 corresponds to vertex coordinates 1(x1, y1), vertex coordinates 9(x9, y9), and vertex coordinates 10(x1, y1). 10 y 10 ), vertex coordinates 11(x 11 y 11 ), vertex coordinates 12(x 12 y 12 ), vertex coordinates 13(x 13 y 13 ), vertex coordinates 14(x 14 y 14 ).

[0211] For example, when the compressed location information includes reference point coordinates, the difference between the location range and the reference point coordinates, and the correspondence between the location range and the vertex, the compressed location information in the example in Figure 7(b) above can include reference point coordinates (x... Ref y Ref The difference between vertex coordinates 1 and reference point coordinates (x1 - x) Ref y1-y Ref The difference between vertex coordinates 1 and reference point coordinates (x1 - x) Ref y1-y Ref The difference between the vertex coordinates 2 and the reference point coordinates (x2 - x) Ref y2-y Ref The difference between vertex coordinates 3 and reference point coordinates (x3 - x) Ref y3-y Ref ), and so on, the difference (x) between vertex coordinates 14 and reference point coordinates 14 -x Ref y 14 -y Ref ), and the vertex coordinates corresponding to position range 1: 1, 2, 3, 8, 9; the vertex coordinates corresponding to position range 2: 3, 4, 5, 6, 7, 8; the vertex coordinates corresponding to position range 3: 7, 8, 9, 10; the vertex coordinates corresponding to position range 4: 6, 7, 10, 11; and the vertex coordinates corresponding to position range 5: 1, 9, 10, 11, 12, 13, 14.

[0212] For example, when the compressed location information includes reference point coordinates, the difference between vertex coordinates and reference point coordinates, the difference between different vertex coordinates, and the correspondence between location ranges and vertices, the compressed location information in the example in Figure 7(b) above can include reference point coordinates (x... Ref y Ref The difference between vertex coordinates 1 and reference point coordinates (x1 - x) Ref y1-y Ref The difference between vertex coordinates 2 and vertex coordinates 1 (x2-x1, y2-y1), the difference between vertex coordinates 3 and vertex coordinates 2 (x3-x2, y3-y2), and so on, the difference between vertex coordinates 14 and vertex coordinates 13 ... 14 -x 13 y 14 -y 13), and the vertex coordinates corresponding to position range 1: 1, 2, 3, 8, 9; the vertex coordinates corresponding to position range 2: 3, 4, 5, 6, 7, 8; the vertex coordinates corresponding to position range 3: 7, 8, 9, 10; the vertex coordinates corresponding to position range 4: 6, 7, 10, 11; and the vertex coordinates corresponding to position range 5: 1, 9, 10, 11, 12, 13, 14.

[0213] Optionally, when the reference point coordinates are one of the vertex coordinates, for example, when the reference point coordinates are vertex coordinate 1, the difference result in the compressed position information in the example of Figure 7(b) above is the difference value between different vertex coordinates, as shown in Figure 8. The compressed position information includes the reference point coordinates (x1, y1), the difference value between vertex coordinate 2 and vertex coordinate 1 (x2 - x1, y2 - y1), the difference value between vertex coordinate 3 and vertex coordinate 2 (x3 - x2, y3 - y2), and so on, the difference value between vertex coordinate 14 and vertex coordinate 13 (x1 - x2, y3 - y2), and so on. 14 -x 13 y 14 -y 13 The coordinates of the vertices corresponding to position range 1 (x1, y1) and position range 2 (x1, y1), and position range 3 (x1, y1), respectively, are provided. Alternatively, the compressed position information may not include the reference point coordinates (x1, y1) and the correspondence between position ranges and vertices, but may be predefined in the protocol.

[0214] In the examples above, the correspondence between position ranges and vertices is indicated by the set of vertex indices corresponding to the position range. Optionally, the correspondence between position ranges and vertices can also be indicated by a bitmap, where the length of the bitmap is the total number of vertices included in the entire region, and one bit in the bitmap corresponds to one vertex in the entire region. For example, when the value of a bit in the bitmap corresponding to a certain position range n is 1, it indicates that the position range n includes the vertex corresponding to that bit. Taking Figure 7(b) as an example, the bitmap of the vertex coordinates corresponding to position range 1 is 11100001100000, the bitmap of the vertex coordinates corresponding to position range 2 is 00111111000000, the bitmap of the vertex coordinates corresponding to position range 3 is 00000011110000, the bitmap of the vertex coordinates corresponding to position range 4 is 00000110011000, and the bitmap of the vertex coordinates corresponding to position range 5 is 10000000111111.

[0215] Optionally, the original location information can also be location indices. The correspondence between the location indices and the location information (which can be location coordinates or location ranges) can be predefined, such as by the protocol. For example, the original location information includes location index 1, location index 2, and location index 3. In one example, location index 1 corresponds to location coordinates 1 (x1, y1), location index 2 corresponds to location coordinates 2 (x2, y2), and location index 3 corresponds to location coordinates 3 (x3, y3). In another example, location index 1 corresponds to location range 1, location index 2 corresponds to location range 2, and location index 3 corresponds to location range 3. For the terminal, after obtaining the location index, it can determine the corresponding location coordinates or location range based on the location index.

[0216] In one possible implementation, the first information may further include information about a first matrix. This first matrix information can be either the original first matrix or compressed matrix information obtained by compressing the original first matrix. Here, the original first matrix can be understood as the uncompressed first matrix, meaning the terminal can directly obtain the specific content of the first matrix from the original first matrix. For compressed matrix information, the terminal cannot directly obtain the specific content of the first matrix from the compressed matrix information; information processing is required to obtain the specific content of the first matrix.

[0217] For example, the aforementioned original first matrix includes a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix. Optionally, the original first matrix can also be represented in the form of an orthogonal basis set. For ease of understanding, the following description will use the original first matrix as a row orthogonal matrix for illustrative purposes.

[0218] The compressed matrix information includes the position indication information of the first coefficient in the original first matrix, as well as the amplitude and phase values ​​corresponding to the first coefficient. Alternatively, the compressed matrix information includes the position indication information of the first coefficient in the original first matrix, as well as the real and imaginary parts of the first coefficient. The first coefficient is the coefficient in the matrix obtained by the Discrete Fourier Transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value; or, the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the Discrete Fourier Transform of the original first matrix in descending order of amplitude value, where N is a positive integer.

[0219] Please refer to Figure 9, which is a schematic diagram of the original first matrix provided in an embodiment of this application. As shown in Figure 9, the original first matrix is ​​a row orthogonal matrix, with the row orthogonal matrix Q corresponding to the m-th dimension (referred to as the m-th dimension) of the channel matrix H. m For example, Q m The size is Vm ×W m Where m can take values ​​of 1, 2, ..., M, where M is the dimension of the channel matrix H (in short, dimension). The above V... m The m-th dimension of the channel matrix H representing downlink channel information is the size of the dimension after dimensionality reduction. The aforementioned W... m W represents the size of the m-th dimension of the channel matrix H containing downlink channel information before dimensionality reduction. m >V m For example, taking the m-th dimension as the transmitting antenna, the size of the m-th dimension before dimensionality reduction is the number of transmitting antennas; further exemplarily, taking the m-th dimension as the subcarrier, the size of the m-th dimension before dimensionality reduction is the number of subcarriers. If the first information includes the original first matrix, then the first matrix corresponding to a certain location information needs to be transmitted... A complex number, where M is the number of first matrices corresponding to a certain positional information, I m =0 or I m =1, when I m When I = 0, it means that there is no need to multiply by a row orthogonal matrix for dimensionality reduction. m When = 1, it means that it needs to be multiplied by a row orthogonal matrix for dimensionality reduction.

[0220] Please refer to Figure 10, which is a schematic diagram of compressed matrix information obtained by compressing the original first matrix according to an embodiment of this application. As shown in Figure 10, the original first matrix is ​​used as the row orthogonal matrix Q corresponding to the m-th dimension. m For example, let Q be the row orthogonal matrix corresponding to the m-th dimension. m After performing the discrete Fourier transform, matrix Q' can be obtained. m Then, based on the transformation coefficients, coefficients with larger amplitude values ​​are selected and sent. Assume... The element q in the matrix kj =a kj +ib kj , Among them, the above q kj Let a represent a complex number, where a kj Let b be the real part of the complex number. kj Let be the imaginary part of the complex number, k represent the row index of the element in the matrix, and j represent the column index of the element in the matrix. In this example, k takes the values ​​1 and 2, and j takes the values ​​1, 2, and 3. For |q kj Sort them, for example, |q 11 |≥|q 21 |≥|q 23 |≥|q 12 |≥|q 22 |≥|q 13 |, then the first coefficient is q11 q 21 q 23 (Assuming half of the coefficients need to be sent, i.e., N=3), the compressed matrix information includes: ① the position indication information of the first coefficient in the original first matrix, for example... (In practice, it can be sent line by line, such as 100101) or index set {1, 4, 6} (counted in line priority); ② The amplitude value and phase value corresponding to the first coefficient, for example q 11 q 21 q 23 The amplitude and phase values, or q. 11 q 21 q 23 The real and imaginary parts of the value. For example, let the coefficient q... kj For example, where q kj =a kj +ib kj Then the coefficient q kj The corresponding amplitude value is The phase value is arctan(b) kj / a kj Or, the coefficient q kj The corresponding real part is a kj The imaginary part is b kj .

[0221] Alternatively, an example of the first information element (IE) is as follows:

[0222] In this context, RFMapInfo represents the first information, rfMapInformationInstances is used to carry multiple sets of information (the number of sets here is gridNum), each set of information contains a timestamp and matrix data (represented by a byte stream, which can be the original first matrix or compressed matrix information, agreed upon in advance by the sending and receiving ends); locationCoordinates and locationCoordinatesDiff can be selected to represent the original location information or the compressed location information respectively; polygonInfo indicates the correspondence between the location range and the vertices through an index.

[0223] Optionally, the first information involved in the embodiments of this application can be carried in a broadcast message or a multicast message, or it can be said that the first information is included in the broadcast / multicast message, or described as the first information being carried in the broadcast / multicast message. For example, the first information can be carried in a system information block (SIB), where the SIB can be an existing SIB or a newly added SIB. In the current protocol 38.331, an existing SIB can be SIB1, SIB2, ..., or SIB25. For ease of description, it is uniformly represented by SIB_N, where the first information (i.e., RFMapInfo) is carried in SIB_N in the following example:

[0224] For example, the first information can also be carried in RRC signaling, such as MBSBroadcastConfiguration signaling or MBSMulticastConfiguration signaling. Optionally, the way the first information is carried in MBSBroadcastConfiguration signaling is shown in the following example:

[0225] Optionally, the first information may be carried in the MBSMulticastConfiguration signaling in the following example:

[0226] S502. The terminal determines the first matrix corresponding to the terminal based on the terminal's location information and mapping relationship. The first matrix corresponding to the terminal is used to process downlink channel information.

[0227] In some feasible implementations, the terminal can match its own location information with the location information in the first information to determine the location coordinate point n closest to the terminal's location information, or to determine the location range n within which the terminal's location information falls. Therefore, the terminal can use the first matrix corresponding to the location coordinate point n or the location range n as the first matrix corresponding to the terminal.

[0228] For example, as shown in Figure 7(a), assume the location information of the terminal is (x UE y UE ), by calculating the terminal's location information (x) respectively UE y UEThe distances (e.g., Euclidean distances) between point 1 (x1, y1), point 2 (x2, y2), point 3 (x3, y3), point 4 (x4, y4), and point 5 (x5, y5) can be used to determine that point 2 (x2, y2) is the closest point to the terminal. Therefore, the first matrix corresponding to point 2 (x2, y2) can be determined as the first matrix corresponding to the terminal. For example, taking Table 2 as an example, there are M first matrices corresponding to the terminal, and these M first matrices are Q... 1,2 Q 2,2 ,…,Q M,2 .

[0229] As another example, as shown in Figure 7(b), assume the terminal's location information is (x UE y UE Since the location information of the terminal is located within location range 2, the first matrix corresponding to location range 2 can be determined as the first matrix corresponding to the terminal. For example, taking Table 2 as an example, there are M first matrices corresponding to the terminal, and these M first matrices are Q... 1,2 Q 2,2 ,…,Q M,2 .

[0230] Optionally, the downlink channel information in this application embodiment may be a channel matrix H or a precoding matrix. The location information of the terminal involved in this application embodiment may be obtained by the terminal itself through positioning, or the location information of the terminal may be located by the network device and informed by the network device. For example, the network device may send third information to the terminal, which is used to indicate the location information of the terminal.

[0231] In some feasible implementations, after the terminal obtains the first matrix corresponding to the terminal based on the terminal's location information and mapping relationship, the terminal can process the downlink channel information based on the first matrix (e.g., dimensionality reduction processing) to obtain the processed downlink channel information. For example, Figure 11 shows a flowchart illustrating the process of the terminal processing the downlink channel information based on the first matrix corresponding to the terminal. In the scenario shown in Figure 11(a), the terminal's location information can be provided to the terminal by the network device; in the scenario shown in Figure 11(b), the terminal's location information can be obtained by the terminal itself. Taking the terminal's location information as location information n (n = 1, 2, ..., N) as an example, in Figure 11, through the mapping relationship between the location information and the first matrix, it can be known that the M first matrices corresponding to the terminal's location information n are Q... 1,n Q 2,n ,…,Q M,nFor the terminal, it can perform dimensionality reduction on each dimension of the channel matrix H of the downlink channel information based on the M first matrices (that is, multiply each dimension of the channel matrix H by the corresponding first matrix Q in turn). m The conjugate transpose of the matrix (which can be used to reduce dimensions) yields the kernel matrix Σ=H×1Q. 1,n H ×2Q 2,n H …× M Q M,n H The size of the kernel matrix Σ is V1×V2×…×V M The size of the channel matrix H is W1×W2×…×W M The first matrix Q m,n The size is V m ×W m V m <W m The above × m This represents the sum of the m-th dimension of the channel matrix H and Q. m,n H Multiplication is performed, where m can take values ​​of 1, 2, ..., M, where M is a positive integer and represents the dimension of the channel matrix H. Optionally, when M > 2, the channel matrix H can also be called a tensor, in which case × m It is the product modulo m (mode-m).

[0232] As shown in Figure 11, after the terminal obtains the kernel matrix, it can further compress the coefficients in the kernel matrix. For example, the amplitude values ​​corresponding to each complex coefficient can be sorted, and coefficients with larger amplitude values ​​can be selected for transmission. The actual transmitted coefficient index information can be recorded through a bitmap or coefficient index set. Furthermore, coefficients with larger amplitude values ​​can be quantized with fixed bits (the specific quantization strategy can be predefined by the protocol or configured through RRC signaling) to obtain coefficient quantization information. Then, the kernel matrix compressed bitstream containing coefficient index information and coefficient quantization information (here, the kernel matrix compressed bitstream can be understood as the processed downlink channel information) is sent to the network device as feedback information. As shown in Figure 11(a), when the terminal's location information is provided by the network device, the terminal can send the kernel matrix compressed bitstream as feedback information to the network device. As shown in Figure 11(b), when the terminal's location information is obtained by the terminal itself, the terminal can send the kernel matrix compressed bitstream and the terminal's location information together as feedback information to the network device.

[0233] S503: The terminal sends the processed downlink channel information to the network device. Correspondingly, the network device receives the processed downlink channel information from the terminal.

[0234] In some feasible implementations, after the terminal processes the downlink channel information according to the first matrix corresponding to the terminal and obtains the processed downlink channel information, the terminal can send the processed downlink channel information to the network device. Correspondingly, the network device can determine the first matrix corresponding to the terminal according to the location information of the terminal obtained by the network device, and process the received processed downlink channel information (e.g., dimensionality upscaling) based on the first matrix corresponding to the terminal to obtain the reconstructed downlink channel information.

[0235] Optionally, when the terminal's location information is obtained by the terminal itself, the terminal, when providing feedback, can send second information to the network device in addition to the processed downlink channel information. This second information indicates the terminal's location information, or it indicates the first matrix corresponding to the terminal. Figure 12 shows a schematic diagram of the second information fed back by the terminal and the processed downlink channel information. When the second information indicates the terminal's location information, the network device can determine the first matrix corresponding to the terminal based on the terminal's location information and mapping relationship, and then process the processed downlink channel information based on the first matrix to obtain the reconstructed downlink channel information. When the second information indicates the first matrix corresponding to the terminal, the network device can directly process the processed downlink channel information based on the first matrix corresponding to the terminal to obtain the reconstructed downlink channel information. For example, the second information indicating the terminal's location information can be a direct indication, such as the second information including the terminal's location coordinates, or it can be an indirect indication, such as the second information including the index of the terminal's location coordinates. Similarly, the second information indicating the first matrix corresponding to the terminal can be a direct indication, such as the second information including the first matrix corresponding to the terminal, or it can be an indirect indication, such as the second information including the index of the first matrix corresponding to the terminal. For ease of understanding, the following text will mainly use the feedback information, including the second information and the processed downlink channel information, as an illustrative example.

[0236] For ease of understanding, please refer to Figure 13. Figure 13 is a schematic diagram of the network device according to an embodiment of this application reconstructing downlink channel information based on the first matrix corresponding to the terminal. As shown in Figure 13, the network device receives feedback information and can obtain the terminal's location information and the kernel matrix compressed bitstream carried in the feedback information. The network device performs position matching based on the terminal's location information and the location information in the mapping relationship to obtain M first matrices (i.e., Q) corresponding to the terminal. 1,n Q 2,n ,…,Q M,nFurthermore, the network device can perform dequantization (using the same quantization configuration as the encoding side) based on the coefficient quantization information in the kernel matrix compressed bitstream to obtain the reconstruction coefficients, and then fill the corresponding positions in the reconstruction kernel matrix with the coefficient index information (filling the remaining positions with 0). Then, based on the M first matrices, each dimension of the reconstruction kernel matrix Σ' is sequentially subjected to dimensionality increase processing (that is, each dimension of the reconstruction kernel matrix Σ' is sequentially multiplied by the corresponding first matrix Q). m,n (To achieve dimensionality increase operation), the reconstructed channel matrix H'=Σ×1Q is obtained. 1,n ×2Q 2,n …× M Q M,n Here, the reconstructed channel matrix H' is the reconstructed downlink channel information.

[0237] It should be noted that the encoding process of downlink channel information by the terminal and the decoding (or reconstruction) process of downlink channel information by the network device can be decoupled, that is, the encoder and decoder can be separated into different implementations.

[0238] In this embodiment, the network device sends a mapping relationship between location information and a first matrix, enabling the terminal to determine the first matrix corresponding to the terminal based on its own location information and the mapping relationship. The terminal then processes the downlink channel information based on the first matrix corresponding to the terminal and reports the processed downlink channel information to the network device. Compared with the current scheme that uses a fixed matrix to process downlink channel information, this application considers that the channel state may be different at different locations. Therefore, it configures different mapping relationships between location information and the first matrix, making the first matrix determined based on the terminal's location information more adaptable to actual needs. This helps to reduce the processing complexity and feedback overhead of channel information.

[0239] The embodiment shown in Figure 5 above mainly introduces the processing of downlink channel information. The processing of uplink channel information will be explained below with reference to Figure 14.

[0240] Please refer to Figure 14, which is another flowchart illustrating the communication method provided in an embodiment of this application. As shown in Figure 14, the communication method may include the following steps:

[0241] S1401, the network device sends first information to the terminal. Accordingly, the terminal receives the first information from the network device, which is used to indicate the mapping relationship between location information and the first matrix.

[0242] For an understanding of step S1401, please refer to the relevant description of step S501 in Figure 5 above, which will not be repeated here.

[0243] S1402, The network device sends the processed uplink channel information to the terminal. Correspondingly, the terminal receives the processed uplink channel information from the network device.

[0244] In some feasible implementations, the network device can determine the first matrix corresponding to the terminal based on the terminal's location information and mapping relationship, and then process the uplink channel information based on the first matrix corresponding to the terminal (e.g., dimensionality reduction processing) to obtain the processed uplink channel information, and send the processed uplink channel information to the terminal. The process of the network device processing the uplink channel information based on the first matrix corresponding to the terminal can be referred to the description of the terminal processing the downlink channel information based on the first matrix corresponding to the terminal in the embodiment shown in Figure 5 above, and will not be elaborated here. Optionally, the terminal's location information can be obtained by the network device locating the terminal, or it can be reported by the terminal to the network device, without limitation.

[0245] S1403. The terminal determines the first matrix corresponding to the terminal based on the terminal's location information and mapping relationship, and processes the processed uplink channel information based on the first matrix corresponding to the terminal to obtain the reconstructed uplink channel information.

[0246] The process by which the terminal obtains the first matrix corresponding to the terminal and processes the processed uplink channel information based on the first matrix corresponding to the terminal to obtain the reconstructed uplink channel information can be referred to the description of the network device obtaining the first matrix corresponding to the terminal and processing the processed downlink channel information based on the first matrix corresponding to the terminal in the embodiment shown in Figure 5 above, which will not be described in detail here.

[0247] In this embodiment, the network device sends a mapping relationship between location information and a first matrix, enabling the terminal to determine its corresponding first matrix based on its own location information and the mapping relationship. The terminal then processes the received uplink channel information according to the first matrix corresponding to the terminal to obtain the reconstructed uplink channel information. Compared with the current scheme that uses a fixed matrix to process uplink channel information, this application considers that the channel state may be different at different locations. Therefore, it configures different mapping relationships between location information and the first matrix, making the first matrix determined based on the terminal's location information more adaptable to actual needs. This helps to reduce the processing complexity and feedback overhead of channel information.

[0248] Optionally, the embodiments shown in Figures 5 and 14 above can also be applied to O-RAN scenarios. It should be understood that in O-RAN scenarios, the network devices involved in Figure 9 can be replaced by CU (e.g., CU-CP or CU-UP) or DU or RU, etc.

[0249] The communication device provided in this application will now be described in detail with reference to Figures 15 to 17.

[0250] It is understood that, in order to achieve the functions in the above embodiments, the communication device includes hardware structures and / or software modules corresponding to each function. Those skilled in the art should readily recognize that, based on the units and method steps described in conjunction with the embodiments disclosed in this application, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed by hardware or by computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.

[0251] Figures 15 to 17 are schematic diagrams illustrating possible communication devices provided in embodiments of this application. These communication devices can be used to implement the functions of terminals or network devices (e.g., base stations) in the above method embodiments, and thus also achieve the beneficial effects of the above method embodiments. In the embodiments of this application, the communication device can be one of the terminals 120a-120j shown in Figure 1, or it can be RAN nodes 110a or 110b shown in Figure 1. Optionally, it can also be a module (e.g., a chip) applied to a terminal or network device.

[0252] As shown in Figure 15, the communication device 1500 includes a processing unit 1510 and a transceiver unit 1520. The transceiver unit 1520 and the processing unit 1510 can be software, hardware, or a combination of both. Optionally, the communication device 1500 may further include a storage unit 1430 for storing device program code and / or data, not shown in Figure 15.

[0253] The transceiver unit 1520 can implement sending and / or receiving functions. Optionally, the transceiver unit 1520 can also be called a communication unit or an acquisition unit, etc. The transceiver unit 1520 may further include a receiving unit and / or a sending unit, wherein the receiving unit is used to implement the receiving function, and the sending unit is used to implement the sending function. Optionally, the transceiver unit 1520 can be used to receive information sent by other devices, and can also be used to send information to other devices.

[0254] The communication device 1500 is used to implement the function of the first communication device in the method embodiments shown in Figures 5 and 14. For example, the first communication device can be a terminal or a communication module in the terminal, or a circuit or chip in the terminal responsible for communication functions. Alternatively, the communication device 1500 is used to implement the function of the second communication device in the method embodiments shown in Figures 5 and 14. For example, the second communication device can be a network device, a module in the network device (e.g., a circuit, a chip, or a chip system), or a logic node, logic module, or software that can implement all or part of the functions of the network device.

[0255] When the communication device 1500 is used to implement the functions of the terminal in the method embodiment shown in FIG5: the transceiver unit 1520 is used to receive first information, the first information being used to indicate the mapping relationship between location information and a first matrix; the processing unit 1510 is used to determine the first matrix corresponding to the terminal based on the location information of the terminal and the mapping relationship, the first matrix corresponding to the terminal being used to process downlink channel information; the transceiver unit 1520 is used to send the processed downlink channel information.

[0256] In one possible implementation, the transceiver unit 1520 is further configured to: send second information, the second information being used to indicate the location information of the terminal, or the second information being used to indicate the first matrix corresponding to the terminal.

[0257] In one possible implementation, before transmitting the processed downlink channel information, the transceiver unit 1520 is further configured to: receive third information, the third information being used to indicate the location information of the terminal.

[0258] In one possible implementation, in the mapping relationship, any location information corresponds to one or more first matrices.

[0259] In one possible implementation, each location information corresponds to M first matrices, where M is an integer greater than 0.

[0260] In one possible implementation, the first information includes location information, which is the original location information, or the location information included in the first information is compressed location information obtained by compressing the original location information.

[0261] In one possible implementation, the original location information is a location coordinate point or a location range.

[0262] In one possible implementation, when the original location information is a location coordinate point, the compressed location information includes one or more of the following: reference point coordinates, the difference between the location coordinate point and the reference point coordinates, or the difference between different location coordinate points.

[0263] In one possible implementation, when the original location information is a location range, the compressed location information includes one or more of the following: reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices of the location range, or the correspondence between the location range and the vertices.

[0264] In one possible implementation, the first information includes information about a first matrix, wherein the information about the first matrix included in the first information is the original first matrix, or the information about the first matrix included in the first information is compressed matrix information obtained after compressing the original first matrix.

[0265] In one possible implementation, the original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

[0266] In one possible implementation, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, and the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, and the real part value and imaginary part value corresponding to the first coefficient; wherein the first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or, the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

[0267] In one possible implementation, the first information is carried in a broadcast message or a multicast message.

[0268] When the communication device 1500 is used to implement the functions of the terminal in the method embodiment shown in FIG14: the transceiver unit 1520 is used to receive first information, the first information being used to indicate the mapping relationship between location information and a first matrix, the first matrix being used to process uplink channel information; the transceiver unit 1520 is used to receive the processed uplink channel information; the processing unit 1510 is used to determine the first matrix corresponding to the terminal according to the location information of the terminal and the mapping relationship, and to process the processed uplink channel information based on the first matrix corresponding to the terminal to obtain reconstructed uplink channel information.

[0269] In one possible implementation, the transceiver unit 1520 is further configured to: send second information, the second information being used to indicate the location information of the terminal, or the second information being used to indicate the first matrix corresponding to the terminal.

[0270] In one possible implementation, before transmitting the processed downlink channel information, the transceiver unit 1520 is further configured to: receive third information, the third information being used to indicate the location information of the terminal.

[0271] In one possible implementation, in the mapping relationship, any location information corresponds to one or more first matrices.

[0272] In one possible implementation, each location information corresponds to M first matrices, where M is an integer greater than 0.

[0273] In one possible implementation, the first information includes location information, which is the original location information, or the location information included in the first information is compressed location information obtained by compressing the original location information.

[0274] In one possible implementation, the original location information is a location coordinate point or a location range.

[0275] In one possible implementation, when the original location information is a location coordinate point, the compressed location information includes one or more of the following: reference point coordinates, the difference between the location coordinate point and the reference point coordinates, or the difference between different location coordinate points.

[0276] In one possible implementation, when the original location information is a location range, the compressed location information includes one or more of the following: reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices of the location range, or the correspondence between the location range and the vertices.

[0277] In one possible implementation, the first information includes information about a first matrix, wherein the information about the first matrix included in the first information is the original first matrix, or the information about the first matrix included in the first information is compressed matrix information obtained after compressing the original first matrix.

[0278] In one possible implementation, the original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

[0279] In one possible implementation, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, and the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, and the real part value and imaginary part value corresponding to the first coefficient; wherein the first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or, the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

[0280] In one possible implementation, the first information is carried in a broadcast message or a multicast message.

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

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

[0283] When the communication device 1500 is used to implement the function of the network device in the method embodiment shown in FIG5: the transceiver unit 1520 is used to send first information, the first information is used to indicate the mapping relationship between location information and a first matrix, the first matrix is ​​used to process downlink channel information; the transceiver unit 1520 is used to receive the processed downlink channel information.

[0284] In one possible implementation, the transceiver unit 1520 is further configured to receive second information, which indicates the location information of the terminal, or the second information indicates the first matrix corresponding to the terminal; the processing unit 1510 is configured to process the processed downlink channel information based on the first matrix corresponding to the terminal to obtain reconstructed downlink channel information.

[0285] In one possible implementation, the transceiver unit 1520 is further configured to: send third information, the third information being used to indicate the location information of the terminal.

[0286] In one possible implementation, in the mapping relationship, any location information corresponds to one or more first matrices.

[0287] In one possible implementation, each location information corresponds to M first matrices, where M is an integer greater than 0.

[0288] In one possible implementation, the first information includes location information, which is the original location information, or the location information included in the first information is compressed location information obtained by compressing the original location information.

[0289] In one possible implementation, the original location information is a location coordinate point or a location range.

[0290] In one possible implementation, when the original location information is a location coordinate point, the compressed location information includes one or more of the following: reference point coordinates, the difference between the location coordinate point and the reference point coordinates, or the difference between different location coordinate points.

[0291] In one possible implementation, when the original location information is a location range, the compressed location information includes one or more of the following: reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices of the location range, or the correspondence between the location range and the vertices.

[0292] In one possible implementation, the first information includes information about a first matrix, wherein the information about the first matrix included in the first information is the original first matrix, or the information about the first matrix included in the first information is compressed matrix information obtained after compressing the original first matrix.

[0293] In one possible implementation, the original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

[0294] In one possible implementation, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, and the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, and the real part value and imaginary part value corresponding to the first coefficient; wherein the first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or, the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

[0295] In one possible implementation, the first information is carried in a broadcast message or a multicast message.

[0296] When the communication device 1500 is used to implement the functions of the network device in the method embodiment shown in FIG14:

[0297] The transceiver unit 1520 is used to transmit first information, which is used to indicate the mapping relationship between location information and a first matrix, and the first matrix is ​​used to process uplink channel information.

[0298] The transceiver unit 1520 is used to transmit the processed uplink channel information.

[0299] In one possible implementation, the transceiver unit 1520 is further configured to receive second information, which is used to indicate the location information of the terminal, or the second information is used to indicate the first matrix corresponding to the terminal; the processing unit 1510 is configured to process the uplink channel information based on the first matrix corresponding to the terminal to obtain the processed uplink channel information.

[0300] In one possible implementation, the transceiver unit 1520 is further configured to: send third information, the third information being used to indicate the location information of the terminal.

[0301] In one possible implementation, in the mapping relationship, any location information corresponds to one or more first matrices.

[0302] In one possible implementation, each location information corresponds to M first matrices, where M is an integer greater than 0.

[0303] In one possible implementation, the first information includes location information, which is the original location information, or the location information included in the first information is compressed location information obtained by compressing the original location information.

[0304] In one possible implementation, the original location information is a location coordinate point or a location range.

[0305] In one possible implementation, when the original location information is a location coordinate point, the compressed location information includes one or more of the following: reference point coordinates, the difference between the location coordinate point and the reference point coordinates, or the difference between different location coordinate points.

[0306] In one possible implementation, when the original location information is a location range, the compressed location information includes one or more of the following: reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices of the location range, or the correspondence between the location range and the vertices.

[0307] In one possible implementation, the first information includes information about a first matrix, wherein the information about the first matrix included in the first information is the original first matrix, or the information about the first matrix included in the first information is compressed matrix information obtained after compressing the original first matrix.

[0308] In one possible implementation, the original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

[0309] In one possible implementation, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, and the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, and the real part value and imaginary part value corresponding to the first coefficient; wherein the first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or, the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

[0310] In one possible implementation, the first information is carried in a broadcast message or a multicast message.

[0311] For a more detailed description of the processing unit 1510 and the transceiver unit 1520, please refer to the relevant descriptions in the method embodiments shown in Figures 5 and 14.

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

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

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

[0315] As shown in Figure 16, the communication device 1600 includes a processor 1610, and optionally an interface circuit 1620. The processor 1610 and the interface circuit 1620 are coupled to each other. It is understood that the interface circuit 1620 can be a transceiver or an input / output interface. Optionally, the communication device 1600 may also include a memory 1630 for storing computer programs or instructions executed by the processor 1610, or storing input data required by the processor 1610 to execute instructions, or storing data generated by the processor 1610 after executing computer programs or instructions.

[0316] When the communication device 1600 is used to implement the methods shown in FIG5 and FIG14, the processor 1610 is used to implement the functions of the processing unit 1510, and the interface circuit 1620 is used to implement the functions of the transceiver unit 1520.

[0317] When the aforementioned communication device is a chip applied to a terminal, the terminal chip implements the functions of the terminal in the above method embodiments. The terminal chip receives information sent to the terminal by the network device through other modules (such as an RF module or antenna) in the terminal; or, the terminal chip sends information to other modules (such as an RF module or antenna) in the terminal, which is information sent by the terminal to the network device.

[0318] When the aforementioned communication device is a module applied to a network device, the network device module implements the functions of the network device in the above method embodiments. The network device module receives information from other modules (such as radio frequency modules or antennas) within the network device; this information is sent by the terminal to the network device. Alternatively, the network device module sends information to other modules (such as radio frequency modules or antennas) within the network device; this information is sent by the network device to the terminal. Here, the network device module can be the baseband chip of the network device, or a CU, DU, or other module, or a device under an open radio access network (O-RAN) architecture, such as an open CU, open DU, etc.

[0319] As shown in Figure 17, the communication device includes a processor 1710, a memory 1720, and a transceiver 1730. The processor 1710 is mainly used for processing communication protocols and data; controlling terminal / network devices; executing software programs; and processing data from software programs. The memory 1720 can store computer program code, software programs, and data. The transceiver 1730 includes a transmitter 1731, a receiver 1732, radio frequency circuitry (not shown in Figure 17), and an antenna 1733.

[0320] The processor 1710 can also be called a processing unit, processing board, processing module, or processing device. The transceiver 1730 can also be called a transceiver unit, transceiver, or transceiver device.

[0321] Optionally, the device in transceiver 1730 used to implement the receiving function can be considered a receiving module, and the device in transceiver 1730 used to implement the transmitting function can be considered a transmitting module. That is, transceiver 1730 includes a receiver and / or a transmitter. A transceiver may also be called a transceiver unit, transceiver module, or transceiver circuit, etc. A receiver may also be called a receiver unit, receiving module, or receiving circuit, etc. A transmitter may also be called a transmitter, transmitting module, or transmitting circuit, etc.

[0322] Processor 1710 is used to execute terminal-side processing operations in the embodiments shown in Figures 5 and 14. Transceiver 1730 is used to execute terminal-side transmission and reception operations in the embodiments shown in Figures 5 and 14. Alternatively, processor 1710 is used to execute network-side processing operations in the embodiments shown in Figures 5 and 14. Transceiver 1730 is used to execute network-side transmission and reception operations in the embodiments shown in Figures 5 and 14.

[0323] When the communication device 1700 is a chip, the chip includes a processor and a transceiver. The transceiver can be an input / output circuit or a communication interface. The processor can be a processing module integrated on the chip, a microprocessor, or an integrated circuit. In the above method embodiments, the terminal's sending operation can be understood as the chip's output, and the terminal's receiving operation can be understood as the chip's input. Similarly, in the above method embodiments, the network device's sending operation can be understood as the chip's output, and the network device's receiving operation can be understood as the chip's input.

[0324] This application also provides a computer-readable storage medium storing a computer program or instructions for implementing the methods executed by a terminal or network device in the above method embodiments.

[0325] For example, when the computer program is executed by a computer, it enables the computer to implement the method executed by the terminal or network device in the above method embodiments.

[0326] This application also provides a computer program product containing a program or instructions, which, when executed by a computer, causes the computer to implement the method executed by a terminal or network device in the above method embodiments.

[0327] This application also provides a communication system, which includes the terminal and the network device described in the above embodiments. The terminal is used to perform some or all of the operations performed by the terminal in the above method embodiments, and the network device is used to perform some or all of the operations performed by the network device in the above method embodiments.

[0328] This application also provides a chip device, including a processor, for calling a computer program or computer instructions stored in the memory, so that the processor executes the method provided in the embodiments shown in FIG5 and FIG14 above.

[0329] In one possible implementation, the input of the chip device corresponds to the receiving operation in the embodiments shown in Figures 5 and 14, and the output of the chip device corresponds to the transmitting operation in the embodiments shown in Figures 5 and 14.

[0330] Optionally, the processor is coupled to the memory via an interface.

[0331] Optionally, the chip device may also include a memory in which computer programs or computer instructions are stored.

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

[0333] The method steps in the embodiments of this application can be implemented in hardware or in software instructions executable by a processor. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, CD-ROMs, or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. The storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. Alternatively, the ASIC can reside in a network device or terminal. The processor and storage medium can also exist as discrete components in a network device or terminal.

[0334] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed entirely or partially. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user equipment, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or non-volatile storage medium, or may include both types of storage media.

[0335] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of different embodiments are consistent and can be referenced by each other. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0336] It is understood that the various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers described above does not imply the order of execution; the execution order of each process should be determined by its function and internal logic.

Claims

1. A communication method, characterized in that, include: Receive first information, the first information being used to indicate a mapping relationship between location information and a first matrix; wherein, the mapping relationship is used to determine the first matrix corresponding to the terminal in combination with the terminal's location information, and the first matrix corresponding to the terminal is used to process downlink channel information; Send the processed downlink channel information.

2. The method according to claim 1, characterized in that, The method further includes: Send a second message, which indicates the location information of the terminal, or the second message indicates the first matrix corresponding to the terminal.

3. The method according to claim 1, characterized in that, Before transmitting the processed downlink channel information, the method further includes: Receive third information, which is used to indicate the location information of the terminal.

4. The method according to any one of claims 1-3, characterized in that, In the mapping relationship, any location information corresponds to one or more first matrices.

5. The method according to claim 4, characterized in that, Each location information corresponds to M first matrices, where M is an integer greater than 0.

6. The method according to any one of claims 1-5, characterized in that, The first information includes location information, which is either the original location information or compressed location information obtained by compressing the original location information.

7. The method according to claim 6, characterized in that, The original location information is the location coordinates or location range.

8. The method according to claim 7, characterized in that, When the original location information is a location coordinate point, the compressed location information includes one or more of the following: Reference point coordinates, the difference between the location coordinates and the reference point coordinates, or the difference between different location coordinates.

9. The method according to claim 7, characterized in that, When the original location information is a location range, the compressed location information includes one or more of the following: Reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices within the location range, or the correspondence between the location range and the vertices.

10. The method according to any one of claims 1-9, characterized in that, The first information includes information about a first matrix, which is either the original first matrix or a compressed matrix obtained by compressing the original first matrix.

11. The method according to claim 10, characterized in that, The original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

12. The method according to claim 10 or 11, characterized in that, The compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the real part value and imaginary part value corresponding to the first coefficient. The first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

13. The method according to any one of claims 1-12, characterized in that, The first information is carried in a broadcast message or a multicast message.

14. A communication method, characterized in that, include: Send first information, which is used to indicate the mapping relationship between location information and a first matrix; wherein, the mapping relationship is used to determine the first matrix corresponding to the terminal in combination with the terminal's location information, and the first matrix corresponding to the terminal is used to process downlink channel information; Receive the processed downlink channel information.

15. The method according to claim 14, characterized in that, The method further includes: Receive second information, the second information being used to indicate the location information of the terminal, or the second information being used to indicate the first matrix corresponding to the terminal; The processed downlink channel information is processed based on the first matrix corresponding to the terminal to obtain the reconstructed downlink channel information.

16. The method according to claim 14, characterized in that, The method further includes: Send a third message, which is used to indicate the location information of the terminal.

17. The method according to any one of claims 14-16, characterized in that, In the mapping relationship, any location information corresponds to one or more first matrices.

18. The method according to claim 17, characterized in that, Each location information corresponds to M first matrices, where M is an integer greater than 0.

19. The method according to any one of claims 14-18, characterized in that, The first information includes location information, which is either the original location information or compressed location information obtained by compressing the original location information.

20. The method according to claim 19, characterized in that, The original location information is the location coordinates or location range.

21. The method according to claim 20, characterized in that, When the original location information is a location coordinate point, the compressed location information includes one or more of the following: Reference point coordinates, the difference between the location coordinates and the reference point coordinates, or the difference between different location coordinates.

22. The method according to claim 20, characterized in that, When the original location information is a location range, the compressed location information includes one or more of the following: Reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices within the location range, or the correspondence between the location range and the vertices.

23. The method according to any one of claims 14-22, characterized in that, The first information includes information about a first matrix, which is either the original first matrix or a compressed matrix obtained by compressing the original first matrix.

24. The method according to claim 23, characterized in that, The original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

25. The method according to claim 23 or 24, characterized in that, The compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the real part value and imaginary part value corresponding to the first coefficient. The first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

26. The method according to any one of claims 14-25, characterized in that, The first information is carried in a broadcast message or a multicast message.

27. A communication method, characterized in that, include: The system receives first information and processed uplink channel information, wherein the first information is used to indicate the mapping relationship between location information and a first matrix; wherein the mapping relationship is used to determine the first matrix corresponding to the terminal in combination with the location information of the terminal, and the first matrix corresponding to the terminal is used to process the uplink channel information; The processed uplink channel information is processed based on the first matrix corresponding to the terminal to obtain the reconstructed uplink channel information.

28. The method according to claim 27, characterized in that, The method further includes: Send a second message, which indicates the location information of the terminal, or the second message indicates the first matrix corresponding to the terminal.

29. The method according to claim 27, characterized in that, Before the terminal processes the processed uplink channel information based on the first matrix corresponding to the terminal to obtain the reconstructed uplink channel information, the method further includes: Receive third information, which is used to indicate the location information of the terminal.

30. The method according to any one of claims 27-29, characterized in that, In the mapping relationship, any location information corresponds to one or more first matrices.

31. The method according to claim 30, characterized in that, Each location information corresponds to M first matrices, where M is an integer greater than 0.

32. The method according to any one of claims 27-31, characterized in that, The first information includes location information, which is either the original location information or compressed location information obtained by compressing the original location information.

33. The method according to claim 32, characterized in that, The original location information is the location coordinates or location range.

34. The method according to claim 33, characterized in that, When the original location information is a location coordinate point, the compressed location information includes one or more of the following: Reference point coordinates, the difference between the location coordinates and the reference point coordinates, or the difference between different location coordinates.

35. The method according to claim 33, characterized in that, When the original location information is a location range, the compressed location information includes one or more of the following: Reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices within the location range, or the correspondence between the location range and the vertices.

36. The method according to any one of claims 27-35, characterized in that, The first information includes information about a first matrix, which is either the original first matrix or a compressed matrix obtained by compressing the original first matrix.

37. The method according to claim 36, characterized in that, The original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

38. The method according to claim 36 or 37, characterized in that, The compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the real part value and imaginary part value corresponding to the first coefficient. The first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

39. The method according to any one of claims 27-38, characterized in that, The first information is carried in a broadcast message or a multicast message.

40. A communication method, characterized in that, include: Send first information, the first information being used to indicate the mapping relationship between location information and a first matrix; wherein, the mapping relationship is used to determine the first matrix corresponding to the terminal in combination with the terminal's location information, and the first matrix corresponding to the terminal is used to process uplink channel information; Send the processed uplink channel information.

41. The method according to claim 40, characterized in that, The method further includes: Receive second information, the second information being used to indicate the location information of the terminal, or the second information being used to indicate the first matrix corresponding to the terminal; The uplink channel information is processed based on the first matrix corresponding to the terminal to obtain the processed uplink channel information.

42. The method according to claim 40, characterized in that, The method further includes: Send a third message, which is used to indicate the location information of the terminal.

43. The method according to any one of claims 40-42, characterized in that, In the mapping relationship, any location information corresponds to one or more first matrices.

44. The method according to claim 43, characterized in that, Each location information corresponds to M first matrices, where M is an integer greater than 0.

45. The method according to any one of claims 40-44, characterized in that, The first information includes location information, which is either the original location information or compressed location information obtained by compressing the original location information.

46. ​​The method according to claim 45, characterized in that, The original location information is the location coordinates or location range.

47. The method according to claim 46, characterized in that, When the original location information is a location coordinate point, the compressed location information includes one or more of the following: Reference point coordinates, the difference between the location coordinates and the reference point coordinates, or the difference between different location coordinates.

48. The method according to claim 46, characterized in that, When the original location information is a location range, the compressed location information includes one or more of the following: Reference point coordinates, the difference between the vertex coordinates of the location range and the reference point coordinates, the difference between the coordinates of different vertices within the location range, or the correspondence between the location range and the vertices.

49. The method according to any one of claims 40-48, characterized in that, The first information includes information about a first matrix, which is either the original first matrix or a compressed matrix obtained by compressing the original first matrix.

50. The method according to claim 49, characterized in that, The original first matrix is ​​a row orthogonal matrix, a column orthogonal matrix, or an orthogonal basis matrix.

51. The method according to claim 49 or 50, characterized in that, The compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the amplitude value and phase value corresponding to the first coefficient; or, the compressed matrix information includes position indication information of the first coefficient in the original first matrix, as well as the real part value and imaginary part value corresponding to the first coefficient. The first coefficient is a coefficient in the matrix obtained by the discrete Fourier transform of the original first matrix whose corresponding amplitude value is greater than a preset amplitude value, or the first coefficient is the first N coefficients selected after sorting the coefficients in the matrix obtained by the discrete Fourier transform of the original first matrix in descending order of amplitude value, where N is an integer greater than 0.

52. The method according to any one of claims 40-51, characterized in that, The first information is carried in a broadcast message or a multicast message.

53. A communication device, characterized in that, It includes units or modules for implementing the method as described in any one of claims 1-13, or units or modules for implementing the method as described in any one of claims 14-26, or units or modules for implementing the method as described in any one of claims 27-39, or units or modules for implementing the method as described in any one of claims 40-52.

54. A communication device, characterized in that, The device includes a processor for executing computer programs or instructions to cause the communication device to implement the method as described in any one of claims 1-13, or to cause the communication device to implement the method as described in any one of claims 14-26, or to cause the communication device to implement the method as described in any one of claims 27-39, or to cause the communication device to implement the method as described in any one of claims 40-52.

55. A communication device, characterized in that, The device includes a processor for executing a computer program or instructions in a memory, such that the communication device implements the method as described in any one of claims 1-13, or implements the method as described in any one of claims 14-26, or implements the method as described in any one of claims 27-39, or implements the method as described in any one of claims 40-52.

56. A communication device, characterized in that, The device includes a processor and an interface circuit. The interface circuit is configured to receive signals from other communication devices besides the communication device and transmit them to the processor, or to send signals from the processor to other communication devices besides the communication device. The processor is configured to execute computer programs or instructions to cause the communication device to implement the method as described in any one of claims 1-13, or to cause the communication device to implement the method as described in any one of claims 14-26, or to cause the communication device to implement the method as described in any one of claims 27-39, or to cause the communication device to implement the method as described in any one of claims 40-52.

57. A communication device, characterized in that, The device includes a processor and a memory, wherein the processor is configured to invoke a computer program stored in the memory, causing the communication device to implement the method as described in any one of claims 1-13, or the processor is configured to implement the method as described in any one of claims 14-26, or the processor is configured to implement the method as described in any one of claims 27-39, or the processor is configured to implement the method as described in any one of claims 40-52.

58. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions that, when executed by a communication device, implement the method as described in any one of claims 1-13, or the method as described in any one of claims 14-26, or the method as described in any one of claims 27-39, or the method as described in any one of claims 40-52.

59. A computer program product, characterized in that, Includes computer program code that, when run on a computer, implements the method of any one of claims 1-13, or implements the method of any one of claims 14-26, or implements the method of any one of claims 27-39, or implements the method of any one of claims 40-52.