Precoding matrix information transmission and reception methods, apparatus, and storage medium

Abstract

Embodiments of the present disclosure provide precoding matrix information transmission and reception methods, an apparatus, and a storage medium. The method comprises: a first node receiving first configuration information, wherein the first configuration information is used for indicating K time points, and K is a positive integer greater than 1; selecting M time points from the K time points; and transmitting channel state information on the basis of the M time points, wherein the channel state information comprises precoding matrix information of the M time points, and M is a positive integer less than K.

Description

Method for sending and receiving precoding matrix information, device and storage medium

[0001] This disclosure claims priority to Chinese patent application No. 202410171499.6, filed on February 6, 2024, the entire contents of which are incorporated herein by reference. Technical Field

[0002] The present disclosure relates to the field of communication technology, and in particular to a method for sending and receiving precoding matrix information, a device, and a storage medium. Background Art

[0003] Multi-antenna systems are an important technology in the communications field, with multi-antenna technology at its core. Multi-antenna technology improves data transmission performance by applying a precoding matrix that matches the channel state to multiple antennas. Multi-antenna technology is a core physical layer technology for fourth-generation mobile communication technology (4G) and fifth-generation mobile communication technology (5G). It significantly improves the system's spectral efficiency and enhances the user experience at the edge through methods such as spatial division multiplexing, beamforming, and multi-user multiple-input multiple-output (MU-MIMO). Multi-antenna technology will also be a core physical layer technology for the future sixth-generation mobile communication technology (6G). In multi-antenna systems, the precoding matrix is ​​a key concept. The precoding matrix preprocesses the transmitted signal at the transmitter, optimizing the power, rate, and even transmission direction of each data stream to achieve better performance.

[0004] Summary of the Invention

[0005] The present disclosure provides a method for sending and receiving precoding matrix information, an apparatus, and a storage medium.

[0006] In a first aspect, the present disclosure provides a method for transmitting precoding matrix information, the method being applied to a first node, the method comprising:

[0007] Receive first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1;

[0008] Select M time points from K time points;

[0009] Channel state information is sent based on M time points; wherein the channel state information includes precoding matrix information at M time points, and M is a positive integer less than K.

[0010] In a second aspect, the present disclosure provides a method for receiving precoding matrix information, the method being applied to a second node, the method comprising:

[0011] Sending first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1;

[0012] Receive channel state information; wherein the channel state information includes precoding matrix information of M time points selected by the first node from K time points, where M is a positive integer less than K.

[0013] In a third aspect, the present disclosure provides a communication device, the communication device comprising:

[0014] A receiving module, configured to receive first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1;

[0015] A processing module, configured to select M time points from K time points;

[0016] The sending module is used to send channel state information based on M time points; wherein the channel state information includes precoding matrix information at M time points, and M is a positive integer less than K.

[0017] In a fourth aspect, the present disclosure provides another communication device, the communication device comprising:

[0018] A sending module, configured to send first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1;

[0019] A receiving module is used to receive channel state information; wherein the channel state information includes precoding matrix information of M time points selected by the first node from K time points, where M is a positive integer less than K.

[0020] In a fifth aspect, the present disclosure further provides a communication device, comprising: a memory and a processor; the memory and the processor are coupled; the memory is used to store instructions executable by the processor; and when the processor executes the instructions, it performs any method provided in the first aspect or the second aspect.

[0021] In a sixth aspect, the present disclosure provides a computer program product comprising computer instructions, which, when executed on a computer, enables the computer to execute any one of the methods provided in the first or second aspect above. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The accompanying drawings are used to provide a further understanding of the technical solution of the present disclosure and constitute a part of the specification. Together with the embodiments of the present disclosure, they are used to explain the technical solution of the present disclosure and do not constitute a limitation to the technical solution of the present disclosure.

[0023] FIG1 is a schematic diagram of the architecture of a communication system provided by an embodiment of the present disclosure.

[0024] FIG2 is a schematic flow chart of a method for sending precoding matrix information provided by an embodiment of the present disclosure.

[0025] FIG3 is a schematic flow chart of a method for receiving precoding matrix information provided by an embodiment of the present disclosure.

[0026] FIG4 is a schematic diagram showing the composition of a communication device provided in an embodiment of the present disclosure.

[0027] FIG5 is a schematic diagram showing the composition of another communication device provided by an embodiment of the present disclosure.

[0028] FIG6 is a schematic structural diagram of a communication device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0029] The following will be combined with the accompanying drawings in the embodiments of the present disclosure to clearly and completely describe the technical solutions in the embodiments of the present disclosure. Obviously, the embodiments described are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments of the present disclosure, all other embodiments obtained by ordinary technicians in this field without making any creative efforts are within the scope of protection of the present disclosure.

[0030] In the description of the present disclosure, unless otherwise specified, “ / ” means “or”. For example, A / B can mean A or B. “And / or” in this article is merely a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can mean: only A, only B, and A and B. In addition, “at least one” means one or more, and “a plurality” means two or more. Words such as “first” and “second” do not limit the quantity and execution order, and words such as “first” and “second” do not necessarily limit them to be different.

[0031] It should be noted that in this disclosure, words such as "exemplarily" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described in this disclosure as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplarily" or "for example" is intended to present the relevant concepts by way of example.

[0032] Multi-antenna technology improves data transmission performance by applying a precoding matrix that matches the channel state to multiple antennas. Multi-antenna technology is a core physical layer technology for 4G and 5G. It significantly improves system spectrum efficiency and enhances the user experience at the edge through methods such as spatial division multiplexing, beamforming, and MU-MIMO. Multi-antenna technology will also be a core physical layer technology for future 6G.

[0033] In some embodiments, a base station transmits a reference signal, and a terminal measures the reference signal to determine precoding matrix information from the base station to the terminal, and reports the precoding matrix information to the base station. The base station then receives the precoding matrix information reported by the terminal. Furthermore, the base station can determine a data transmission strategy based on the precoding matrix represented by the received precoding matrix information and transmit data, thereby improving data transmission efficiency. Therefore, it can be seen that the accuracy of the precoding matrix represented by the precoding matrix information affects the base station's transmission strategy, and thus affects the efficiency and success rate of data transmission.

[0034] Furthermore, the base station's data transmission time lags behind the reference signal's transmission time. Due to the time-varying nature of the channel state, the channel state at the time of data transmission changes relative to the channel state at the time of reference signal transmission. This means that the channel state at the time of data transmission is different from the channel state at the time of reference signal transmission. Consequently, the transmission strategy formulated by the base station based on the precoding matrix information corresponding to the channel state at the time of reference signal transmission no longer matches the channel state at the time of data transmission, potentially reducing the efficiency and success rate of data transmission. Predicting precoding matrix information for future times based on reference signals received at historical or current times can reduce the delay between data transmitted by the base station and the precoding matrix information used. Furthermore, because data transmission may be required or may be required for a period of time in the future, the terminal is required to predict the precoding matrix for a period of time in the future and report the precoding matrix information for that period of time to the base station. This reduces the delay between data transmitted by the base station and the precoding matrix information used, thereby improving the base station's data transmission performance during the future period.

[0035] However, the resource overhead associated with reporting the predicted precoding matrix information for a specific period of time is currently significant. This depletes resources available for terminals to transmit data, other signals, or signaling to the base station, thereby reducing the performance of these transmissions. Furthermore, the high resource overhead associated with reporting the predicted precoding matrix information for a specific period of time also increases terminal energy consumption.

[0036] Therefore, how to design a mechanism to transmit the predicted precoding matrix information over a period of time to reduce the resource overhead of transmitting the predicted precoding matrix information and improve the accuracy of the precoding matrix information is an urgent problem to be solved in current wireless communication technology, including future 6G wireless communication technology.

[0037] In view of this, the present disclosure provides a method for sending precoding matrix information, the method comprising: a first node receives first configuration information, wherein the first configuration information is used to indicate K time points, where K is a positive integer greater than 1. The first node selects M time points from the K time points, and sends channel state information based on the M time points. The channel state information includes precoding matrix information at M time points, where M is a positive integer less than K. In this way, by feeding back precoding matrix information at M time points that are smaller than K, the resource overhead for feedback can be reduced. In addition, selecting appropriate M time points for feedback can also improve the accuracy of the precoding matrix of the K time points fed back.

[0038] Accordingly, the present disclosure provides a method for receiving precoding matrix information, the method comprising: a second node sending first configuration information, the first configuration information being used to indicate K time points, where K is a positive integer greater than 1. The second node receives channel state information; the channel state information includes precoding matrix information for M time points selected by the first node from the K time points, where M is a positive integer less than K.

[0039] The method provided by the embodiments of the present disclosure can be applied to various communication systems. For example, the communication system can be a long-term evolution system, a 5G communication system, a Wi-Fi system, a communication system related to the third generation partnership project (3GPP), a future evolution communication system (such as a sixth generation (6G) communication system, etc.), or a system integrating multiple systems, etc., without limitation. The method provided by the embodiment of the present disclosure is described below using the communication system 100 shown in Figure 1 as an example. Figure 1 is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided by the present disclosure.

[0040] Figure 1 is a schematic diagram of the architecture of a communication system provided by an embodiment of the present disclosure. As shown in Figure 1, the communication system 100 may include one or more first nodes 11 and one or more second nodes 12. The second nodes 12 may be communicatively connected to the one or more first nodes 11.

[0041] In some embodiments, in communication system 100, first node 11 and second node 12 communicate via a wireless channel. For example, first node 11 is a terminal device, second node 12 is a network device, and the network device and the terminal device communicate via a wireless channel. For another example, first node 11 is a terminal device, second node 12 is a wireless router, and the wireless router and the terminal device communicate via a wireless channel.

[0042] Network equipment can be used to implement functions such as resource scheduling, wireless resource management, and wireless access control of terminal devices. For example, it can be an evolution nodeB (eNB), a next-generation nodeB (gNB), a transmission receive point (TRP), a transmission point (TP), and some other access nodes. Depending on the size of the service coverage area provided, base stations can be divided into macro base stations for providing macro cells, micro base stations for providing micro cells (Pico cells), and femto base stations for providing femto cells. With the continuous evolution of wireless communication technology, future base stations may also adopt other names.

[0043] Terminal devices may also be referred to as terminals, user equipment (UE), mobile stations, mobile terminals, etc. For example, terminal devices may be mobile phones, tablet computers, computers with wireless transceiver functions, virtual reality terminals, augmented reality terminals, wireless terminals used in industrial control, wireless terminals used in unmanned driving, wireless terminals used in remote surgery, wireless terminals used in transportation safety, wireless terminals used in smart cities, wireless terminals used in smart homes, etc. The embodiments of the present disclosure do not limit the specific device form factor used by the terminal.

[0044] For example, the first node 11 is a first base station, the second node 12 is a second base station, and the first base station and the second base station communicate via a wireless channel. For another example, the first node 11 is a first terminal, the second node 12 is a second terminal, and the first terminal and the second terminal communicate via a wireless channel. For another example, the first node 11 is a repeater, the second node 12 is a base station, and the base station and the repeater communicate via a wireless channel. For another example, the first node 11 is a terminal, the second node 12 is a repeater, and the repeater and the terminal communicate via a wireless channel. For another example, the first node 11 is a first repeater, the second node 12 is a second repeater, and the first repeater and the second repeater communicate via a wireless channel. For another example, the first node 11 is a base station, the second node 12 is a satellite, and the satellite and the base station communicate via a wireless channel. For another example, the first node 11 is a satellite, the second node 12 is a base station, and the base station and the satellite communicate via a wireless channel. For another example, the first node 11 is a terminal, the second node 12 is a satellite, and the satellite and the terminal communicate via a wireless channel. For another example, the first node 11 is a satellite, the second node 12 is a terminal, and the terminal and the satellite communicate via a wireless channel. For another example, the first node 11 is a ground device, the second node 12 is an aircraft, and the aircraft and the ground device communicate via a wireless channel. For another example, the first node 11 is a first aircraft, the second node 12 is a second aircraft, and the first and second aircraft communicate via a wireless channel.

[0045] It should be noted that Figure 1 is only an exemplary framework diagram. The number of devices or nodes included in Figure 1 and the names of each device are not restricted. In addition to the functional nodes shown in Figure 1, the communication system may also include other nodes or devices, such as core network devices.

[0046] The system architecture and business scenarios described in the embodiments of the present disclosure are intended to more clearly illustrate the technical solutions of the embodiments of the present disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of the present disclosure. Those skilled in the art will appreciate that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of the present disclosure are equally applicable to similar technical problems.

[0047] The following describes the embodiments of the present disclosure with reference to the accompanying drawings.

[0048] As shown in FIG2 , the present disclosure provides a method for transmitting precoding matrix information, which is applied to a first node and includes the following steps:

[0049] S101. Receive first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1.

[0050] Exemplarily, the time point may be a time point expressed in various measurement methods. For example, the time point is a time slot, that is, the first configuration information is used to indicate K time slots. For another example, the time point is an orthogonal frequency division multiplexing (OFDM) symbol, that is, the first configuration information is used to indicate K OFDM symbols. For another example, the time point is a subframe, that is, the first configuration information is used to indicate K subframes. For another example, the time point is a radio frame, that is, the first configuration information is used to indicate K radio frames. For another example, the time point is milliseconds, that is, the first configuration information is used to indicate K milliseconds.

[0051] In some embodiments, the K time points may refer to K moments or K time periods. The K time points are used to reflect the time corresponding to the precoding matrix or precoding matrix information, that is, the time corresponding to the precoding matrix or precoding matrix information. Thus, the precoding matrix or precoding matrix information can be determined based on the channel states at the K time points.

[0052] A precoding matrix can be understood as the weights applied to antenna ports, or as a vector or matrix composed of these weights. The precoding matrix preprocesses the signal before transmission to improve transmission efficiency and reliability. Furthermore, by applying a precoding matrix tailored to the channel conditions at multiple antenna ports, multi-antenna technology is implemented, improving data transmission performance. Essentially, the precoding matrix performs a series of linear transformations on the transmitted signal at the transmitter to offset channel interference and noise.

[0053] In addition, the first node may receive first configuration information sent by the second node. In addition, the first configuration information indicates K time points, so that the first node can select M time points from the K time points.

[0054] Exemplarily, the first configuration information indicates that the K time points include at least the following possible implementations:

[0055] Implementation method 1: The first configuration information includes K time points.

[0056] For example, the first configuration information may list K time points. For example, the K time points are K time slots, and the K time slots are respectively the n0th time slot, the n1th time slot, ..., the nth time slot, and the nth time slot. K-1 For example, the K time slots are respectively the n0th symbol, the n1th symbol, ..., the nth symbol K-1 Symbols, etc. Similarly, the K time points may also be K OFDM symbols, K OFDM subframes, etc., which are not listed one by one.

[0057] It should be noted that the first configuration information can directly list each of the K time points, which can improve the flexibility of indicating the K time points, so that the K time points that may correspond to the precoding matrix to be obtained can be accurately indicated based on actual needs. This can also avoid introducing unnecessary other time points, thereby avoiding increasing the overhead of the first communication node's feedback precoding matrix.

[0058] Implementation method 2: The first configuration information includes a time offset value of each of the K time points relative to a reference time point.

[0059] Exemplarily, the first configuration information may include the offset time lengths of the K time points relative to the reference time point, so that the K time points can be determined based on the offset time lengths and the reference time point. For example, the offset time lengths of the K time points included in the first configuration information relative to the reference time point may be n0 time slots, n1 time slots, ..., n K-1 For another example, the first configuration information lists K time points with respect to the first reference time point, and the offset time lengths are: n0 period, n1 period, ..., n K-1 Similarly, the offset time length of the K time points relative to the first reference time point may also be K OFDM symbols, K OFDM subframes, etc., which are not listed here one by one.

[0060] It should be noted that the first configuration information lists the offset time lengths of K time points relative to the first reference time point, which can improve the flexibility of indicating the K time points. For example, the offset time length of a certain time point can be adjusted individually to personalize the time point, and the reference time point can be adjusted to adjust the positions of the K time points as a whole, so that the K time points are within the range of interest, thereby avoiding the introduction of uninteresting time points and saving the overhead of the feedback precoding matrix.

[0061] Implementation method 3: The first configuration information indicates the first time point among the K time points, and the time offset values ​​of the remaining time points relative to the first time point.

[0062] Exemplarily, the first configuration information may indicate the first time point in the time sequence, and the offset time lengths of the remaining time points in the K time points relative to the first time point.

[0063] It should be noted that the value range of the offset time length of the remaining time points relative to the first time point is smaller than the value range of the remaining time points, so the resource overhead of the configuration information indicating the offset time length of the remaining time points relative to the first time point will be reduced.

[0064] In some embodiments, indicating a first time point among the K time points includes: indicating an event that occurs at the first time point.

[0065] In this way, the first time point can be indicated by indicating the event occurring at the first time point, which is conducive to focusing the K time points within the time range related to the indicated event, thereby obtaining the interested precoding matrix information related to the indicated event.

[0066] Exemplarily, indicating the first time point among the K time points includes any of the following: indicating an event, where the first time point has a preset time offset value from the time point at which the event occurs.

[0067] In one example, the event occurring at the first time point may be indicated.

[0068] For example, the event occurring at the first time point includes transmitting an acknowledgment (ACK) corresponding to physical downlink shared channel (PDSCH) data. For example, if PDSCH data is transmitted in the nth time slot and an acknowledgment corresponding to the PDSCH data is transmitted in the n+kth time slot, the n+kth time slot may be the first time point.

[0069] For another example, an event occurring at a first time point includes transmitting PDSCH data corresponding to an acknowledgment character (ACK). For example, if PDSCH data is transmitted in the nth time slot and an acknowledgment character corresponding to the PDSCH data is transmitted in the n+kth time slot, then the nth time slot may be the first time point.

[0070] Since the correct PDSCH data transmission corresponds to the channel state at a time point at which the PDSCH data transmission is correct, the K time points at which the precoding matrix information needs to be obtained can be determined based on the time point at which the PDSCH data transmission is correct. In this way, the performance of the PDSCH data transmission can be improved and the resource overhead of transmitting the precoding matrix information can be reduced.

[0071] For another example, an event occurring at a first time point includes transmitting a negative acknowledgment (NACK) character corresponding to PDSCH data. For example, PDSCH data is transmitted at the nth time slot, and a negative acknowledgment character corresponding to the PDSCH data is transmitted at the n+kth time slot. The n+kth time slot may be the first time point.

[0072] For another example, an event occurring at a first time point includes transmitting PDSCH data corresponding to a negative acknowledgement character (NACK). For example, PDSCH data is transmitted at the nth time slot, and a negative acknowledgement character corresponding to the PDSCH data is transmitted at the n+kth time slot. The nth time slot may be the first time point.

[0073] Since incorrect PDSCH data transmission corresponds to a channel state at a time point when PDSCH data transmission is incorrect, the K time points at which precoding matrix information needs to be obtained can be determined based on the time point when PDSCH data transmission is incorrect. In this way, the performance of PDSCH data transmission can be improved and the resource overhead of transmitting precoding matrix information can be reduced.

[0074] For another example, an event occurring at a first time point is a beam failure. For example, a beam failure or failure occurs at an nth time slot, and the nth time slot may be the first time point.

[0075] Since beam failure corresponds to the channel state at the time point when the beam failure occurs, the K time points at which the precoding matrix information needs to be obtained can be determined based on the time point when the beam failure occurs. In this way, the performance of PDSCH data transmission can be improved and the resource overhead of transmitting precoding matrix information can be reduced.

[0076] For another example, an event occurring at a first time point includes generating a beam establishment. For example, the beam establishment occurs at an nth time slot, and the nth time slot may be the first time point.

[0077] Since beam establishment corresponds to a channel state at a time point when beam establishment is generated, the K time points at which precoding matrix information needs to be obtained can be determined based on the time point when beam establishment is generated. In this way, the performance of PDSCH data transmission can be improved and the resource overhead of transmitting precoding matrix information can be reduced.

[0078] In another example, it may be indicated that the first time point has a preset time offset value from the time point at which the event occurs.

[0079] Exemplarily, the first configuration information indicates a first time point in a time sequence, including indicating an event, wherein the first time point has a predetermined time offset length from a time point at which the event occurs.

[0080] For example, the event includes transmitting an acknowledgment character (ACK) corresponding to PDSCH data. For example, if PDSCH data is transmitted in the nth time slot and an acknowledgment character corresponding to the PDSCH data is transmitted in the n+kth time slot, the n+kth time slot is the time point at which the event occurs. Thus, the time offset between the first time point and the n+kth time slot can be indicated.

[0081] For another example, the event includes the transmission of PDSCH data corresponding to an acknowledgment character (ACK). For example, if PDSCH data is transmitted in the nth time slot and an acknowledgment character corresponding to the PDSCH data is transmitted in the n+kth time slot, the nth time slot is the time point at which the event occurs. Thus, the time offset between the first time point and the nth time slot can be indicated.

[0082] Since the correct PDSCH data transmission corresponds to the channel state at a time point when the PDSCH data transmission is correct, the K time points at which the precoding matrix information needs to be obtained can be determined based on the time point when the PDSCH data transmission is correct, so as to improve the performance of the PDSCH data transmission and reduce the resource overhead of transmitting the precoding matrix information.

[0083] For another example, the event includes transmitting a negative acknowledgement (NACK) character corresponding to PDSCH data. For example, PDSCH data is transmitted in the nth time slot, and a negative acknowledgement character corresponding to the PDSCH data is transmitted in the n+kth time slot. The n+kth time slot is the time point at which the event occurs. Thus, the time offset value from the first time point to the n+kth time slot can be indicated.

[0084] For another example, the event includes the transmission of PDSCH data corresponding to a negative acknowledgement (NACK) character. For example, if PDSCH data is transmitted in the nth time slot and a negative acknowledgement character corresponding to the PDSCH data is transmitted in the n+kth time slot, the nth time slot is the time point at which the event occurred. Thus, the time offset between the first time point and the nth time slot can be indicated.

[0085] Since incorrect PDSCH data transmission corresponds to a channel state at a time point when the PDSCH data transmission is incorrect, the K time points at which the precoding matrix information needs to be obtained can be determined based on the time point when the PDSCH data transmission is incorrect, so as to improve the performance of PDSCH data transmission and reduce the resource overhead of transmitting the precoding matrix information.

[0086] For example, the event includes a beam failure. For example, if a beam failure or failure occurs in the nth time slot, the nth time slot is the time point at which the event occurs. Thus, the time offset value from the first time point to the nth time slot can be indicated.

[0087] Since beam failure corresponds to the channel state at the time point when the beam failure occurs, the K time points at which the precoding matrix information needs to be obtained can be determined based on the time point when the beam failure occurs, so as to improve the performance of PDSCH data transmission and reduce the resource overhead of transmitting the precoding matrix information.

[0088] For another example, the event includes generating a beam setup. For example, if the beam setup occurs in the nth time slot, the nth time slot is the time point at which the event occurs. Thus, the time offset value from the first time point to the nth time slot can be indicated.

[0089] It should be noted that since the first time point is offset by a predetermined time length from the time point at which the event occurs, beam establishment corresponds to a channel state at the time point at which beam establishment is generated. Therefore, the K time points at which precoding matrix information needs to be acquired can be determined based on the time point at which beam establishment is generated, thereby improving PDSCH data transmission performance and reducing resource overhead for transmitting precoding matrix information.

[0090] Implementation method 4: The first configuration information is used to indicate K time points, including: indicating the time offset value of the first time point among the K time points relative to the reference time point, and the time offset values ​​of the remaining time points relative to the first time point.

[0091] Exemplarily, the first configuration information indicates the offset time length of the first time point in the time sequence relative to the reference time point, and the offset time lengths of the remaining time points relative to the first time point.

[0092] Since the range of values ​​of the first time point is larger than the range of values ​​of the offset time length of the first time point relative to the reference time point, the resource overhead of indicating the first time point can be reduced by indicating the offset time length of the first time point in the time sequence relative to the reference time point.

[0093] In some embodiments, the first configuration information is further used to indicate a reference time point.

[0094] Exemplarily, the first configuration information is further used to indicate a reference time point, including: indicating an event occurring at the reference time point. In some embodiments, the event includes any of the following:

[0095] transmitting an acknowledgment indication corresponding to data on a physical shared channel;

[0096] Transmitting and confirming data of a physical shared channel corresponding to the indication;

[0097] transmitting a negative indication corresponding to data on a physical shared channel;

[0098] transmitting data of a physical shared channel corresponding to the negative indication;

[0099] Beam failure;

[0100] Beam establishment.

[0101] That is, the reference time point can be indicated by indicating the event occurring at the reference time point, thereby facilitating focusing the K time points within a time range related to the indicated event, thereby obtaining the precoding matrix information of interest related to the indicated event.

[0102] For example, an event occurring at a reference time point includes transmitting an acknowledgment character (ACK) corresponding to PDSCH data. For example, if PDSCH data is transmitted in the nth time slot, an acknowledgment character corresponding to the PDSCH data is transmitted in the n+kth time slot, and the n+kth time slot is the reference time point.

[0103] For another example, an event occurring at a reference time point includes transmitting PDSCH data corresponding to an ACK character. For example, if PDSCH data is transmitted in the nth time slot and an ACK character corresponding to the PDSCH data is transmitted in the n+kth time slot, the nth time slot is the reference time point.

[0104] Since the correct PDSCH data transmission corresponds to the channel state at a time point when the PDSCH data transmission is correct, the K time points at which the precoding matrix information needs to be obtained can be determined based on the time point when the PDSCH data transmission is correct, so as to improve the performance of the PDSCH data transmission and reduce the resource overhead of transmitting the precoding matrix information.

[0105] For another example, an event occurring at a reference time point includes transmitting a negative acknowledgement (NACK) character corresponding to PDSCH data. For example, if PDSCH data is transmitted in the nth time slot and a negative acknowledgement character corresponding to the PDSCH data is transmitted in the n+kth time slot, the n+kth time slot is the reference time point.

[0106] For another example, an event occurring at a reference time point includes the transmission of PDSCH data corresponding to a negative acknowledgement character (NACK). For example, if PDSCH data is transmitted in the nth time slot and a negative acknowledgement character corresponding to the PDSCH data is transmitted in the n+kth time slot, the nth time slot is the reference time point.

[0107] Since incorrect PDSCH data transmission corresponds to a channel state at a time point when the PDSCH data transmission is incorrect, the K time points at which the precoding matrix information needs to be obtained can be determined based on the time point when the PDSCH data transmission is incorrect, so as to improve the performance of PDSCH data transmission and reduce the resource overhead of transmitting the precoding matrix information.

[0108] For another example, an event occurring at a reference time point includes a beam failure. For example, a beam failure or failure occurs at the nth time slot, and the nth time slot is the reference time point.

[0109] The occurrence of beam failure corresponds to the channel state at the time point when the beam failure occurs. Therefore, the K time points at which the precoding matrix information needs to be obtained can be determined based on the time point when the beam failure occurs, so as to improve the performance of PDSCH data transmission and reduce the resource overhead of transmitting the precoding matrix information.

[0110] For another example, an event occurring at a reference time point includes generating a beam setup. For example, if the beam setup occurs at the nth time slot, the nth time slot is the reference time point.

[0111] Since beam establishment corresponds to a channel state at a time point when beam establishment is generated, the K time points at which precoding matrix information needs to be obtained can be determined based on the time point when beam establishment is generated, so as to improve the performance of PDSCH data transmission and reduce the resource overhead of transmitting precoding matrix information.

[0112] Implementation method 5: The first configuration information is used to indicate K time points, including: a time offset value of the first time point among the K time points relative to a reference time point, and time offset values ​​of two adjacent time points among the K time points.

[0113] Exemplarily, the first configuration information indicates the offset time length of the first time point in the time sequence relative to the reference time point, and the offset time length between adjacent time points, thereby indicating K time points.

[0114] For example, the K time points may be, in chronological order, the first time point, the second time point, ..., the Kth time point. Thus, the first configuration information may respectively indicate the offset time length of the first time point relative to the reference time point, the offset time length of the second time point relative to the first time point, the offset time length of the third time point relative to the second time point, ..., the offset time length of the Kth time point relative to the K-1th time point.

[0115] In this way, since the value of the offset time length of the Kth time point relative to the K-1th time point is smaller than the value of the offset time length of the Kth time point relative to the 1st time point, or the value of the offset time length of the Kth time point relative to the K-1th time point is smaller than the value of the offset time length of the Kth time point relative to the reference time point, using the offset time length of the Kth time point relative to the K-1th time point to indicate the Kth time point can save resource overhead.

[0116] In some embodiments, the reference time point may be indicated by the first configuration information, another configuration information different from the first configuration information, or a signaling instruction. Furthermore, an event may be directly indicated to indicate the reference time point, with the time point at which the event occurs serving as the reference time point. Alternatively, an event may be indicated, with a time point that is offset from the time point at which the event occurs serving as the reference time point. Alternatively, the reference time point may be predetermined by a protocol.

[0117] In some embodiments, the offset time lengths between adjacent time points may also be indicated according to the order of the K time points.

[0118] Exemplarily, the first configuration information may indicate the offset time length of the first time point relative to the reference time point and the offset time length between adjacent time points in various orders.

[0119] For example, the indication order can be to indicate the offset time length between adjacent time points in the order of K time points, for example: the offset time length of the first time point relative to the reference time point, the offset time length of the second time point relative to the first time point, the offset time length of the third time point relative to the second time point,..., the offset time length of the Kth time point relative to the K-1th time point.

[0120] For another example, the indication order can also be the offset time length of the Kth time point relative to the K-1th time point, the offset time length of the K-1th time point relative to the K-2th time point,..., the offset time length of the 2nd time point relative to the 1st time point, and the offset time length of the 1st time point relative to the reference time point.

[0121] In this way, the offset time lengths between adjacent time points are indicated in the order of the K time points. The first communication node can calculate the corresponding time point after receiving the offset time length of one time point, without having to wait for all offset time lengths to be received. This reduces system complexity.

[0122] Implementation method 6: The first configuration information is used to indicate K time points, including: time offset values ​​of other time points among the K time points except the first time point relative to the reference time point.

[0123] Exemplarily, the first configuration information indicates the offset time length of the remaining time points except the first time point in the time sequence relative to the first time point, the first signaling indicates the first time point, or the first signaling indicates the offset time length of the first time point relative to the reference time point.

[0124] In some embodiments, the first time point is indicated by a first signaling; or, the event occurring at the first time point is a predefined event.

[0125] It should be noted that the first configuration information can be used to indicate the offset time lengths of the remaining time points relative to the first time point except the first time point, so that the relative positions of the K time points in the time dimension can be controlled by the first configuration information.

[0126] In addition, the first signaling indicates the first time point, or the first signaling indicates the offset time length of the first time point relative to the reference time point, so that the first signaling can control the overall position of the K time points in the time dimension. Signaling is highly timely and carries a small amount of load. Using signaling to indicate the first time point, or the first signaling to indicate the offset time length of the first time point relative to the reference time point, can achieve the goal of dynamically indicating K time points with a small amount of signaling load, thereby timely and accurately obtaining the required precoding matrix information for the K time points, and avoiding unnecessarily increasing the number of time points and thus increasing the resource overhead of transmitting the precoding matrix information.

[0127] Implementation method 7: The first configuration information is used to indicate K time points, including: time offset values ​​of other time points among the K time points except the first time point relative to the first time point.

[0128] Exemplarily, the first configuration information may indicate the offset time length of the remaining time points except the first time point relative to the first time point in the time sequence, or the first configuration information may indicate the offset time length between adjacent time points of K time points in the time sequence.

[0129] In some embodiments, the first time point is indicated by a first signaling; or, the event occurring at the first time point is a predefined event.

[0130] For example, the event occurring at the first time point is predetermined by the protocol. For another example, the event occurring at the first time point is reported in advance by the first communication node to the second communication node. For another example, the event occurring at the first time point is indicated in advance by the second communication node to the first communication node.

[0131] Implementation method 8: The first configuration information is used to indicate K time points, including: a time offset value between two adjacent time points among the K time points.

[0132] Exemplarily, the first configuration information indicates the offset time length between adjacent time points of K time points in a time sequence, the first signaling indicates the first time point, or the first signaling indicates the offset time length of the first time point relative to the reference time point.

[0133] In some embodiments, the first time point is indicated by a first signaling; or, the event occurring at the first time point is a predefined event.

[0134] It should be noted that the first configuration information may be used to indicate the offset time length between adjacent K time points in the time sequence, so that the first configuration information controls the relative positions of the K time points in the time dimension.

[0135] In addition, by indicating the first time point through first signaling, or indicating the time length of the offset of the first time point relative to a reference time point through first signaling, the first signaling can control the overall position of the K time points in the time dimension. Signaling is highly timely and carries a small amount of load. By using signaling to indicate the first time point, or indicating the time length of the offset of the first time point relative to a reference time point through first signaling, it is possible to dynamically indicate K time points with a small amount of signaling load, thereby obtaining the required precoding matrix information for the K time points in a timely and accurate manner, avoiding unnecessarily increasing the number of time points and thus increasing the resource overhead of transmitting the precoding matrix information.

[0136] In a possible implementation, the first configuration information provided in the present disclosure may also be used to indicate the value of M.

[0137] Exemplarily, the first node receives first configuration information from the second node, where the first configuration information further indicates a value of M. Alternatively, the first node receives second configuration information from the second node, where the second configuration information indicates a value of M. Alternatively, the first node receives first signaling, where the first signaling indicates a value of M. In other words, the first node may receive indication information from the second node, where the indication information indicates a value of M.

[0138] In some embodiments, the first configuration information includes a first parameter.

[0139] In one example, the value of M is determined according to the values ​​of the first parameter and K.

[0140] Exemplarily, the value of M can be determined based on the product of the value of K and the first parameter. For example, the value of M is the product of the value of K and the first parameter. For another example, the value of M is a function of the product of the value of K and the first parameter.

[0141] Thus, under the same first parameter value, the value of M can vary with the value of K. Therefore, a larger range of M values ​​can be determined using a smaller range of first parameter values, while ensuring that the precoding matrix at M time points accurately reflects the precoding matrix at K time points. Furthermore, the resource overhead of indicating the smaller range of first parameter values ​​is low, making it possible to achieve a larger range of M values ​​with a smaller resource overhead. Furthermore, the precoding matrix at M time points can also accurately reflect the precoding matrix at K time points.

[0142] In another example, the value of K is determined according to the first parameter.

[0143] Exemplarily, the candidate value of K is determined according to the value of the first parameter. That is, the value of K in the first configuration information can be selected from the candidate values ​​of K, wherein the candidate value of K is determined according to the value of the first parameter.

[0144] In this way, the value of K in the first configuration information can be selected from candidate values ​​of K, thereby avoiding the system from processing too many values ​​of K and reducing system complexity. Furthermore, the candidate values ​​of K are determined based on the value of the first parameter so that the candidate values ​​of K can reflect the time-domain correlation of the precoding matrix, avoiding the feedback of too many precoding matrices, thereby saving feedback resource overhead. Furthermore, the feedback of too few precoding matrices can be avoided, thereby ensuring the accuracy of the precoding matrices obtained at the K time points.

[0145] In another example, the first parameter is determined according to the value of K.

[0146] Exemplarily, the candidate value of the first parameter is determined according to the value of K. That is, the value of the first parameter in the first configuration information can be selected from the candidate values ​​of the first parameter.

[0147] In this way, the number of values ​​that the first parameter can take can be reduced, thereby reducing the complexity of the system and saving the overhead of indicating the first parameter.

[0148] Furthermore, the candidate value of the first parameter is determined based on the value of K, so that the candidate value of the first parameter can feedback the time-domain correlation of the precoding matrix, avoiding feedback of too many precoding matrices, thereby saving feedback resource overhead. Furthermore, feedback of too few precoding matrices can be avoided, thereby ensuring the accuracy of the precoding matrices obtained at the K time points.

[0149] In another example, the values ​​of the first parameter and K are a first value combination, and the first value combination is determined from multiple candidate value combinations, each candidate value combination is used to indicate a set of candidate values ​​of the first parameter and candidate values ​​of K.

[0150] Exemplarily, a combination of K candidate values ​​and candidate values ​​of the first parameter is predefined, and the configuration information is selected from the candidate values ​​of the combination.

[0151] In this way, the precoding matrices at M time points can be reasonably utilized to obtain the precoding matrices at K time points based on the correlation of the precoding matrices in the time domain, and the accuracy of the precoding matrices at K time points can be guaranteed. It also avoids feeding back too many precoding matrices, thereby saving feedback resource overhead.

[0152] S102: Select M time points from K time points.

[0153] In a possible implementation, the first node may first determine the value of M.

[0154] Exemplarily, the first node may determine the value of M. Thus, the first node may determine a more appropriate value of M based on its understanding of the channel state, thereby avoiding feeding back precoding matrices for too many time points, while also ensuring that the second node can obtain sufficiently accurate precoding matrices for K time points through the precoding matrices for M time points.

[0155] In some embodiments, the value of M is determined from a plurality of candidate values ​​of M indicated by the second node.

[0156] Exemplarily, the second node indicates the candidate value of M through the first configuration information. Alternatively, the second node indicates the candidate value of M through further configuration information different from the first configuration information.

[0157] In some embodiments, the value of M is determined based on the value of K.

[0158] Exemplarily, the candidate value of M is determined according to the value of K, and the first node selects the value of M from the candidate values ​​of M determined according to the value of K. Furthermore, the first node may also report the determined value of M to the second node, so that the second node can receive the reported information of the M precoding matrices.

[0159] In a possible implementation, the value of M is determined according to the number of reference signal resources or the time interval between reference signal resources.

[0160] Exemplarily, the first node may further receive second configuration information from the second node, where the second configuration information indicates reference signal resources, and the value of M is determined according to the number of reference signal resources or the time interval between reference signal resources.

[0161] For example, if the number of resources corresponding to the reference signal is P1, the value of M may be Q1. If the number of resources corresponding to the reference signal is P2, the value of M may be Q2. P1, P2, Q1, and Q2 are positive integers, and Q1 and Q2 are less than K.

[0162] For another example, the ratio of the number of reference signal resources to K is R. If R is greater than 1, the value of M is Q1. If R is less than 1, the value of M is Q2.

[0163] For another example, the ratio of the number of reference signal resources to K is R. Correspondingly, when R is greater than 1, the value of M is less than K / 2. Correspondingly, when R is less than 1, the value of M is greater than K / 2. Correspondingly, when R is equal to 1, the value of M is equal to K / 2.

[0164] For another example, when the time interval between reference signal resources is P1 time units, the value of M is Q1. When the time interval between reference signal resources is P2 time units, the value of M is Q2. P1, P2, Q1, and Q2 are positive integers, and Q1 and Q2 are less than K.

[0165] For another example, the ratio of the time interval between reference signal resources to K is R. Correspondingly, when R is greater than 1, the value of M is Q1. Correspondingly, when R is less than 1, the value of M is Q2.

[0166] For another example, the ratio of the time interval between reference signal resources to K is R. Correspondingly, when R is greater than 1, the value of M is less than K / 2. Correspondingly, when R is less than 1, the value of M is greater than K / 2. Correspondingly, when R is equal to 1, the value of M is equal to K / 2.

[0167] In addition, the first parameter may also be determined according to the interval and the quantity.

[0168] For example, the ratio of the number of reference signal resources to K is R, and the ratio of the time interval of the reference signal resources to the interval between two adjacent time points in the K time points is S. The first coefficient is the product of R and S. Alternatively, the first coefficient is the product of R and S multiplied by another coefficient. For another example, the first coefficient is the ratio of R to S; or the first coefficient is a function of the ratio of R to S.

[0169] In some embodiments, the first configuration information is used to indicate K time points, including: the first configuration information is used to indicate the second parameter and time point information. The value of K is determined according to the number of reference signal resources and the second parameter.

[0170] In some embodiments, the first configuration information is further used to indicate a third parameter; wherein the value of M is determined according to the number of reference signal resources and the third parameter.

[0171] In some embodiments, the value of M may also be determined according to the numerical relationship between the first time interval and the second time interval of the reference signal resource and the value of K.

[0172] In some embodiments, the value of M may also be determined based on the time interval between the M time points.

[0173] In some embodiments, the value of M may also be determined based on the number of reference signal resources and the value of K.

[0174] In some embodiments, the M time points satisfy at least one of the following:

[0175] The M time points include the first time point among the K time points:

[0176] The M time points include the last time point among the K time points:

[0177] The M time points are indicated by the second node in the K time points;

[0178] M time points are determined by the first node;

[0179] D time points among the M times are indicated by the second node, and E time points among the M times are determined by the first node;

[0180] F time points among the M time points are preset, and E time points among the M time points are determined by the first node.

[0181] Exemplarily, the first node may divide K time points into M groups, select a time point from each group, and the precoding matrices of the time points in the same group may be derived from each other. That is, the precoding matrix of another time point in the same group may be derived based on the precoding matrix of one time point in the group. In some embodiments, the precoding matrices of the time points in the same group may be the same, so that the precoding matrices of other time points in the same group may be determined based on the precoding matrix of one time point in the group.

[0182] Exemplarily, K time points may be divided into M groups, one time point is selected from each group, and a total of M time points are selected from all groups.

[0183] For example, if K = 10, the corresponding time points include {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, which can be divided into M = 3 groups. In the first group, {0, 6, 8}, time 6 is selected as one of the M time points. In the second group, {1, 2, 5, 9}, time 1 is selected as one of the M time points. In the third group, {3, 4, 7}, time 4 is selected as one of the M time points.

[0184] Exemplarily, K time points may be divided into D groups, each group selects at least one time point, and all groups select a total of M time points.

[0185] For example, if K = 10, the corresponding time points {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} are divided into D = 3 groups. In the first group, {0, 6, 8}, time point 6 is selected as one of the M time points. In the second group, {1, 2, 5, 9}, time points 1 and 9 are selected as one of the M time points. In the third group, {3, 4, 7}, time point 3 is selected as one of the M time points. In other words, a total of M = 4 time points are selected.

[0186] S103: Send channel state information based on M time points.

[0187] The channel state information includes precoding matrix information at M time points, where M is a positive integer less than K.

[0188] It should be noted that the first configuration information indicates K time points, and the first node can select M time points from the K time points and feedback the precoding matrix information corresponding to the M time points. K and M are positive integers, and M is less than K. In other words, the first configuration information indicates K time points, which means that the second node needs to know the precoding matrix or precoding matrix information at these K time points. However, feedback of the precoding matrix information at K time points by the first node consumes a lot of resource overhead. Feedback of the precoding matrix information at M time points smaller than K can reduce the resource overhead used for feedback.

[0189] Since the channel is time-varying and temporally correlated, the second node may need to obtain channel prediction values ​​within a longer time range, such as K time points. The channel may change slowly or quickly within this time range. It may also change quickly in some time periods and slowly in other time periods. It is also possible that the channel is simple but changes dramatically, or it is possible that the channel is complex but changes slowly. The precoding matrix is ​​determined based on the channel and needs to match the channel, so it also has the same temporal variation characteristics. Based on the temporal variation characteristics of the precoding matrix, the first node selects M time points from the K time points indicated by the first configuration information, and feeds back the precoding matrix or precoding matrix information at these M time points.

[0190] Accordingly, the second node can obtain the precoding matrices at time points other than the M time points based on the received precoding matrices or precoding matrix information at the M time points and the temporal correlation of the precoding matrices, thereby achieving the goal of obtaining the precoding matrices or precoding matrix information at K time points with a smaller feedback resource.

[0191] Furthermore, due to the temporal variation characteristics of the precoding matrix, the effect of obtaining a precoding matrix at K time points from M different precoding matrices at K time points may vary. For example, if the M time points are appropriately positioned among the K time points, they can be used to reflect the temporal variation pattern of the precoding matrix at K time points, and a highly accurate precoding matrix for K time points can be obtained from the M time points. However, if the M time points are inappropriately positioned among the K time points and cannot reflect the temporal variation pattern of the precoding matrix at K time points, then precoding matrices for other time points beyond M time points cannot be obtained from the precoding matrices at M time points. Alternatively, if the M time points are inappropriately positioned among the K time points and cannot fully reflect the temporal variation pattern of the precoding matrix at K time points, the accuracy of the precoding matrix for K time points obtained from the precoding matrices at M time points will be compromised. The extent of this accuracy loss is related to the extent to which the temporal variation pattern of the precoding matrix at K time points is reflected by the precoding matrices at M time points. The first node selects M time points from K time points, and can determine the appropriate positions of the M time points among the K time points, so that the precoding matrix of the selected M time points reflects the temporal variation pattern of the precoding matrix of the K time points, thereby enabling the second node to obtain a highly accurate precoding matrix or precoding matrix information at the K time points with relatively small feedback resources. In this way, the feedback resource overhead of obtaining the precoding matrix at the K time points can be reduced, and the accuracy of the obtained precoding matrix at the K time points can be improved.

[0192] Alternatively, the second node improves the accuracy of the precoding matrix at time points other than the M time points based on the received high-accuracy precoding matrix or precoding matrix information at the M time points and the temporal correlation of the precoding matrix, thereby obtaining the high-accuracy precoding matrix or precoding matrix information at K time points with less feedback resources. Due to the temporal variation characteristics of the precoding matrix, the effect of improving the precoding matrix at time points other than the M time points among the K time points using different precoding matrices at the M time points at the K time points varies.

[0193] For example, assuming that the positions of M time points among K time points are appropriate and can reflect the temporal variation pattern of the precoding matrix at K time points, the accuracy of the precoding matrix at time points other than M time points among the K time points can be improved by the precoding matrix at M time points. assuming that the positions of M time points among K time points are inappropriate and cannot reflect the temporal variation pattern of the precoding matrix at K time points, the accuracy of the precoding matrix at time points other than M time points cannot be improved by the precoding matrix at M time points; or assuming that the positions of M time points among K time points are inappropriate and cannot fully reflect the temporal variation pattern of the precoding matrix at K time points, the accuracy of the precoding matrix at K time points improved by the precoding matrix at M time points will be lost, and the magnitude of the accuracy loss is related to the degree to which the temporal variation pattern of the precoding matrix at K time points is reflected by the precoding matrix at M time points. The first node selects M time points from K time points, and can determine the appropriate positions of the M time points among the K time points, so that the precoding matrix of the selected M time points reflects the temporal variation pattern of the precoding matrix of the K time points, thereby enabling the second node to obtain a highly accurate precoding matrix or precoding matrix information at the K time points with relatively small feedback resources; this not only reduces the feedback resource overhead of obtaining the precoding matrix at the K time points, but also improves the accuracy of the obtained precoding matrix at the K time points.

[0194] Alternatively, the second node improves the accuracy of the precoding matrix at these M time points based on the low-accuracy precoding matrix or precoding matrix information received at these M time points and the temporal correlation of the precoding matrix; thereby achieving the goal of obtaining a high-accuracy precoding matrix or precoding matrix information at K time points with smaller feedback resources. The precoding matrix information represents the precoding matrix. The first node selects M time points from the K time points. The M time points are not located at critical positions and do not reflect the temporal variation pattern of the precoding matrix at the K time points. For example, these M time points are not located at the fluctuating positions or peaks and valleys where the elements in the precoding matrix change over time; feedback of the precoding matrix at these M time points with less resource overhead can reduce feedback resource overhead.

[0195] Accordingly, the second node improves the precoding matrix at these M time points based on the received low-accuracy precoding matrices at M time points and the high-accuracy precoding matrices at other time points, utilizing the temporal correlation of the precoding matrices at K time points, thereby improving the accuracy of the precoding matrix at these M time points. Assuming that these M time points are located at critical locations and use relatively few resources for feedback, the accuracy of the precoding matrix at these M time points is difficult to improve using the precoding matrices at other time points.

[0196] In a possible implementation, the channel state information does not include precoding matrix information of N time points other than M time points among the K time points, where N is equal to the difference between K and M.

[0197] In another possible implementation, the channel state information also includes precoding matrix information of N time points other than M time points among the K time points, the precoding matrix information of the M time points is generated in a first manner, and the precoding matrix information of the N time points is generated in a second manner, where N is equal to the difference between K and M.

[0198] The feedback resource overhead corresponding to the first mode is not equal to the feedback resource overhead corresponding to the second mode.

[0199] Exemplarily, the first node selects M time points from the K time points, feeds back the precoding matrix information corresponding to the M time points in a first manner, and feeds back the precoding matrix information corresponding to the remaining time points in other manners (for example, the second manner), and the feedback resource overhead of the other manners is not equal to the feedback resource overhead of the first manner.

[0200] In one example, the second method and the first method use different codebook types.

[0201] For example, in the first approach, a vector in the precoding matrix is ​​composed of a single basis vector. In the second approach, a vector in the precoding matrix is ​​composed of a linear combination of multiple basis vectors. Alternatively, in the first approach, a vector in the precoding matrix is ​​composed of a linear combination of multiple basis vectors; in the second approach, a vector in the precoding matrix is ​​composed of a single basis vector.

[0202] In another example, the number of elements in the codebook set used in the first manner is different from the number of elements in the codebook set used in the second manner.

[0203] The number of elements in the codebook set used in the first manner is less than the number of elements in the codebook set used in the second manner. Alternatively, the number of elements in the codebook set used in the first manner is greater than the number of elements in the codebook set used in the second manner.

[0204] In another example, the vector in the precoding matrix is ​​formed by a linear combination of multiple basic vectors, and the number of basic vectors included in the combination in the first manner is different from the number of basic vectors included in the combination in the second manner.

[0205] For example, a vector in a precoding matrix is ​​formed by a linear combination of multiple basis vectors, wherein the number of basis vectors included in the combination in the first manner is greater than the number of basis vectors included in the combination in the second manner. Alternatively, the number of basis vectors included in the combination in the first manner is less than the number of basis vectors included in the combination in the second manner.

[0206] In this way, it is possible to avoid reporting the precoding matrix or precoding matrix information at all K time points in a maximum overhead manner, thereby reducing the resource overhead of the second communication node in obtaining the precoding matrix at K time points.

[0207] It should be noted that, due to the temporal characteristics of the precoding matrix, at some points in time, the precoding matrix complexity is high, requiring more resource overhead for feedback to enable the second node to obtain a highly accurate precoding matrix. However, at other points in time, the precoding matrix complexity is low, requiring less resource overhead for feedback to enable the second node to obtain a highly accurate precoding matrix.

[0208] Therefore, the first node selects M time points from the K time points, feeds back the precoding matrices for the selected M time points in a first manner, and feeds back the precoding matrices for the remaining KM time points in a second manner. The resource overhead of the first manner is greater than the resource overhead of the second manner. This avoids feeding back the precoding matrices for the remaining KM time points in a manner with high resource overhead, thereby saving feedback resource overhead. Alternatively, the resource overhead of the first manner is less than the resource overhead of the second manner. This avoids feeding back the precoding matrices for the M time points in a manner with high resource overhead, thereby saving feedback resource overhead.

[0209] Furthermore, due to the temporal variations of the precoding matrix, at certain critical time points, the corresponding precoding matrix can reflect the temporal variation patterns of the precoding matrix at K time points. At certain non-critical time points, the corresponding precoding matrix cannot reflect, or only reflects less of, the temporal variation patterns of the precoding matrix at K time points. Therefore, at time points corresponding to critical locations, the precoding matrix can be fed back with higher resource overhead. However, at time points in non-critical locations, the precoding matrix can be fed back with lower resource overhead. This reduces the overall resource overhead used for feedback and improves the accuracy of the precoding matrix obtained by the second node.

[0210] In some embodiments, the feedback resource overhead of the precoding matrix information generated in the first manner is greater than the feedback resource overhead of the precoding matrix information generated in the second manner.

[0211] For example, in a first manner, a vector in a precoding matrix is ​​formed by a linear combination of multiple basic vectors; in a second manner, a vector in a precoding matrix is ​​formed by a single basic vector.

[0212] For another example, the number of elements in the codebook set used in the first manner is greater than the number of elements in the codebook set used in the second manner.

[0213] For another example, a vector in the precoding matrix is ​​formed by a linear combination of multiple basic vectors, wherein the number of basic vectors included in the combination in the first manner is greater than the number of basic vectors included in the combination in the second manner.

[0214] In addition, the value of M is smaller than the value of N.

[0215] That is, the first node selects M time points from the K time points, feeds back the precoding matrix information corresponding to the M time points in a first manner, and feeds back the precoding matrix information corresponding to the remaining time points in a second manner. The resource overhead of feeding back the precoding matrix information corresponding to the M time points in the first manner is greater than the overhead of feeding back the precoding matrix information corresponding to the remaining time points in the second manner, and M is less than or equal to KM=N.

[0216] It should be noted that M is less than N, and the resource overhead of the first method of feeding back the precoding matrix information corresponding to the M time points is greater than the resource overhead of the second method of feeding back the precoding matrix information corresponding to the remaining time points. In this way, the corresponding precoding matrix information can be fed back in a feedback method with less overhead and higher accuracy at fewer time points, thereby achieving the effect of saving resource overhead and improving the accuracy of the fed-back precoding matrix.

[0217] In one example, M time points can be selected based on the complexity of the precoding matrix. Alternatively, M time points can be selected based on whether the time points are at critical locations. If M is less than or equal to N, this can further reduce resource overhead for feedback.

[0218] M is less than or equal to N=KM. For example, M is uK, where uK represents the product of u and K, and u is a real number less than or equal to 1 / 2. For another example, M is the rounded value of the product of u and K, and u is a real number less than or equal to 1 / 2. For another example, M is K / 8, or a rounded value of K / 8; for another example, M is K / 4, or a rounded value of K / 4.

[0219] In some embodiments, the feedback resource overhead of the precoding matrix information generated in the first manner is less than the feedback resource overhead of the precoding matrix information generated in the second manner.

[0220] Exemplarily, the first node selects M time points from K time points, feeds back precoding matrix information corresponding to the M time points in a first manner, and feeds back precoding matrix information corresponding to the remaining time points in a second manner. Furthermore, the resource overhead of feeding back the precoding matrix information corresponding to the M time points in the first manner is less than the overhead of feeding back the precoding matrix information corresponding to the remaining time points in the second manner.

[0221] For example, in a first manner, a vector in a precoding matrix is ​​composed of a single basic vector; in a second manner, a vector in a precoding matrix is ​​composed of a linear combination of multiple basic vectors.

[0222] For another example, the number of elements in the codebook set used in the first manner is less than the number of elements in the codebook set used in the second manner.

[0223] For another example, a vector in the precoding matrix is ​​formed by a linear combination of multiple basic vectors, wherein the number of basic vectors included in the combination in the first manner is less than the number of basic vectors included in the combination in the second manner.

[0224] In addition, the value of M is greater than the value of N.

[0225] That is, the first node selects M time points from K time points, feeds back the precoding matrix information corresponding to the M time points in a first manner, and feeds back the precoding matrix information corresponding to the remaining time points in a second manner. The resource overhead of feeding back the precoding matrix information corresponding to the M time points in the first manner is less than the overhead of feeding back the precoding matrix information corresponding to the remaining time points in the second manner, and M is greater than KM=N.

[0226] It should be noted that, since M is greater than N, and the resource overhead of the first method of feeding back the precoding matrix information corresponding to M time points is less than the resource overhead of the second method of feeding back the precoding matrix information corresponding to the remaining time points, it is possible to select more time points to feed back the corresponding precoding matrix information in a less-overhead feedback method, thereby achieving the effect of saving resource overhead while ensuring the accuracy of the fed-back precoding matrix.

[0227] In one example, M time points can be selected based on the complexity of the precoding matrix. Alternatively, M time points can be selected based on whether the time points are at critical locations. Furthermore, M being greater than or equal to KM can further reduce resource overhead for feedback.

[0228] M is greater than or equal to KM=N. For example, M is uK, where uK represents the product of u and K, and u is a real number greater than or equal to 1 / 2. For another example, M is the rounded value of the product of u and K, and u is a real number greater than or equal to 1 / 2. For another example, M is 5K / 8, or a rounded value of 5K / 8; for another example, M is 3K / 4, or a rounded value of 3K / 4.

[0229] In some embodiments, the first node encodes the precoding matrix to be fed back and feeds back the encoded precoding matrix information. Accordingly, the second node receives the encoded precoding matrix information and can recover the precoding matrix based on the encoded precoding matrix information. The degree of similarity between the recovered precoding matrix and the precoding matrix transmitted by the first node represents the accuracy of the precoding matrix obtained by the second node.

[0230] In addition, one way to measure the accuracy of the obtained precoding matrix is ​​to determine it based on the error between the precoding matrix recovered by the second node and the precoding matrix to be transmitted by the first node. Another way to measure the accuracy of the obtained precoding matrix is ​​to determine it based on the cosine similarity between the precoding matrix recovered by the second node and the precoding matrix to be transmitted by the first node.

[0231] Based on the technical solution provided by the present disclosure, the first node can determine M time points based on the K time points indicated by the first configuration information from the second node, and feedback the precoding matrix information corresponding to the M time points, where M is less than K. In this way, by feeding back the precoding matrix information at M time points less than K, the resource overhead for feedback can be reduced. In addition, selecting the appropriate M time points for feedback can also improve the accuracy of the precoding matrix for the K time points fed back.

[0232] In some embodiments, as shown in FIG3 , the present disclosure further provides a method for receiving precoding matrix information, which is applied to a second node and includes the following steps:

[0233] S201. Send first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1.

[0234] In some embodiments, the first configuration information includes K time points.

[0235] In some embodiments, the first configuration information includes a time offset value of each of the K time points relative to a reference time point.

[0236] In some embodiments, the first configuration information is used to indicate K time points, including: indicating a first time point among the K time points, and time offset values ​​of the remaining time points relative to the first time point.

[0237] In some embodiments, indicating a first time point among the K time points includes: indicating an event that occurs at the first time point.

[0238] In some embodiments, indicating the first time point among the K time points includes any of the following: indicating an event, where the first time point has a preset time offset value from the time point at which the event occurs.

[0239] In some embodiments, the first configuration information is used to indicate K time points, including: indicating a time offset value of a first time point relative to a reference time point among the K time points, and time offset values ​​of the remaining time points relative to the first time point.

[0240] In some embodiments, the first configuration information is further used to indicate a reference time point.

[0241] In some embodiments, the first configuration information is further used to indicate a reference time point, including: indicating an event occurring at the reference time point.

[0242] In some embodiments, the event includes any of the following:

[0243] transmitting an acknowledgment indication corresponding to data on a physical shared channel;

[0244] Transmitting and confirming data of a physical shared channel corresponding to the indication;

[0245] transmitting a negative indication corresponding to data on a physical shared channel;

[0246] transmitting data of a physical shared channel corresponding to the negative indication;

[0247] Beam failure;

[0248] Beam establishment.

[0249] In some embodiments, the first configuration information is used to indicate K time points, including: a time offset value of a first time point among the K time points relative to a reference time point, and time offset values ​​of two adjacent time points among the K time points.

[0250] In some embodiments, the first configuration information is used to indicate K time points, including: time offset values ​​of other time points except the first time point among the K time points relative to the reference time point.

[0251] In some embodiments, the first configuration information is used to indicate K time points, including: time offset values ​​of other time points among the K time points except the first time point relative to the first time point.

[0252] In some embodiments, the first configuration information is used to indicate K time points, including: a time offset value between two adjacent time points among the K time points.

[0253] In some embodiments, the first time point is indicated by a first signaling; or, the event occurring at the first time point is a predefined event.

[0254] In some embodiments, the first configuration information is also used to indicate the value of M.

[0255] In some embodiments, the first configuration information includes a first parameter; the value of M is determined according to the values ​​of the first parameter and K.

[0256] In some embodiments, the value of K is determined according to the first parameter.

[0257] In some embodiments, the first parameter is determined according to the value of K.

[0258] In some embodiments, the values ​​of the first parameter and K are a first value combination, and the first value combination is determined from multiple candidate value combinations, each candidate value combination is used to indicate a set of candidate values ​​of the first parameter and candidate values ​​of K.

[0259] S202: Receive channel state information. The channel state information includes precoding matrix information of M time points selected by the first node from K time points, where M is a positive integer smaller than K.

[0260] In some embodiments, the first node may determine a value of M, and then determine M time points from the K time points.

[0261] In some embodiments, the value of M is determined from a plurality of candidate values ​​of M indicated by the second node.

[0262] In some embodiments, the value of M is determined based on the value of K.

[0263] In some embodiments, the value of M is determined according to the number of reference signal resources or the time interval between reference signal resources.

[0264] In one example, the second node may also send second configuration information to the first node, and accordingly, the first node may also receive second configuration information from the second node, where the second configuration information indicates reference signal resources, and the value of M is determined based on the number of reference signal resources or the time interval between reference signal resources.

[0265] In some embodiments, the first configuration information is used to indicate K time points, including: the first configuration information is used to indicate the second parameter and time point information; wherein the value of K is determined according to the number of reference signal resources and the second parameter.

[0266] In some embodiments, the first configuration information is further used to indicate a third parameter; wherein the value of M is determined according to the number of reference signal resources and the third parameter.

[0267] In some embodiments, the value of M is determined based on the numerical relationship between the first time interval and the second time interval of the reference signal resource and the value of K.

[0268] In some embodiments, the value of M is determined based on the time intervals between the M time points.

[0269] In some embodiments, the value of M is determined based on the number of reference signal resources and the value of K.

[0270] In some embodiments, the M time points satisfy at least one of the following:

[0271] The M time points include the first time point among the K time points:

[0272] The M time points include the last time point among the K time points:

[0273] The M time points are indicated by the second node in the K time points;

[0274] M time points are determined by the first node;

[0275] D time points among the M times are indicated by the second node, and E time points among the M times are determined by the first node;

[0276] F time points among the M time points are preset, and E time points among the M time points are determined by the first node.

[0277] In some embodiments, the channel state information does not include precoding matrix information of N time points other than M time points among the K time points, where N is equal to the difference between K and M.

[0278] In some embodiments, the channel state information also includes precoding matrix information of N time points other than M time points among the K time points, the precoding matrix information of the M time points is generated in a first manner, and the precoding matrix information of the N time points is generated in a second manner, where N is equal to the difference between K and M; wherein the feedback resource overhead corresponding to the first manner is not equal to the feedback resource overhead corresponding to the second manner.

[0279] In some embodiments, the feedback resource overhead of the precoding matrix information generated in the first manner is greater than the feedback resource overhead of the precoding matrix information generated in the second manner. In some embodiments, the value of M is less than the value of N.

[0280] In some embodiments, the feedback resource overhead of the precoding matrix information generated in the first manner is less than the feedback resource overhead of the precoding matrix information generated in the second manner. In some embodiments, the value of M is greater than the value of N.

[0281] In some embodiments, the second node receives the encoded precoding matrix information and can restore the precoding matrix determined by the first node according to the encoded precoding matrix information.

[0282] In addition, for the detailed description of step S201 - step S202 , reference can be made to the related description of the above-mentioned step S101 - step S103 , which will not be repeated here.

[0283] Based on the technical solution provided by the present disclosure, receiving precoding matrix information at M time points smaller than K can reduce resource overhead for feedback.

[0284] The above mainly introduces the solution provided by the present disclosure from the perspective of the interaction between various communication nodes. It is understandable that each node, such as a device or equipment, includes a hardware structure and / or software module corresponding to the execution of each function in order to realize the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in a hardware or computer software driven hardware manner depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present disclosure.

[0285] The embodiments of the present disclosure can divide the functional modules of the communication device according to the above-mentioned method embodiments. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one functional module. The above-mentioned integrated modules can be implemented in the form of hardware or software. It should be noted that the division of modules in the embodiments of the present disclosure is schematic and is only a logical functional division. In actual implementation, there may be other division methods. The following is an example of dividing each functional module corresponding to each function.

[0286] FIG4 is a schematic diagram showing the composition of a communication device provided by an embodiment of the present disclosure, wherein the communication device is applied to a first node. As shown in FIG4 , the communication device 40 includes a receiving module 401 , a processing module 402 , and a sending module 403 .

[0287] A receiving module 401 is configured to receive first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1;

[0288] Processing module 402, configured to select M time points from K time points;

[0289] The sending module 403 is configured to send channel state information based on M time points; wherein the channel state information includes precoding matrix information at M time points, where M is a positive integer less than K.

[0290] In some embodiments, the channel state information does not include precoding matrix information of N time points other than M time points among the K time points, where N is equal to the difference between K and M.

[0291] In some embodiments, the channel state information also includes precoding matrix information of N time points other than M time points among the K time points, the precoding matrix information of the M time points is generated in a first manner, and the precoding matrix information of the N time points is generated in a second manner, where N is equal to the difference between K and M; wherein the feedback resource overhead corresponding to the first manner is not equal to the feedback resource overhead corresponding to the second manner.

[0292] In some embodiments, the feedback resource overhead of the precoding matrix information generated in the first manner is greater than the feedback resource overhead of the precoding matrix information generated in the second manner.

[0293] In some embodiments, the value of M is smaller than the value of N.

[0294] In some embodiments, the feedback resource overhead of the precoding matrix information generated in the first manner is less than the feedback resource overhead of the precoding matrix information generated in the second manner.

[0295] In some embodiments, the value of M is greater than the value of N.

[0296] In some embodiments, the first configuration information includes K time points.

[0297] In some embodiments, the first configuration information includes a time offset value of each of the K time points relative to a reference time point.

[0298] In some embodiments, the first configuration information is used to indicate K time points, including: indicating a first time point among the K time points, and time offset values ​​of the remaining time points relative to the first time point.

[0299] In some embodiments, indicating the first time point among the K time points includes: indicating an event that occurs at the first time point.

[0300] In some embodiments, the above indication of the first time point among the K time points includes any of the following: indicating an event, and the first time point has a preset time offset value from the time point when the event occurs.

[0301] In some embodiments, the first configuration information is used to indicate K time points, including: indicating a time offset value of a first time point relative to a reference time point among the K time points, and time offset values ​​of the remaining time points relative to the first time point.

[0302] In some embodiments, the first configuration information is further used to indicate a reference time point.

[0303] In some embodiments, the first configuration information is further used to indicate a reference time point, including: indicating an event occurring at the reference time point.

[0304] In some embodiments, the event includes any of the following:

[0305] transmitting an acknowledgment indication corresponding to data on a physical shared channel;

[0306] Transmitting and confirming data of a physical shared channel corresponding to the indication;

[0307] transmitting a negative indication corresponding to data on a physical shared channel;

[0308] transmitting data of a physical shared channel corresponding to the negative indication;

[0309] Beam failure;

[0310] Beam establishment.

[0311] In some embodiments, the first configuration information is used to indicate K time points, including: a time offset value of a first time point among the K time points relative to a reference time point, and time offset values ​​of two adjacent time points among the K time points.

[0312] In some embodiments, the first configuration information is used to indicate K time points, including: time offset values ​​of other time points except the first time point among the K time points relative to the reference time point.

[0313] In some embodiments, the first configuration information is used to indicate K time points, including: time offset values ​​of other time points among the K time points except the first time point relative to the first time point.

[0314] In some embodiments, the first configuration information is used to indicate K time points, including: a time offset value between two adjacent time points among the K time points.

[0315] In some embodiments, the first time point is indicated by a first signaling; or, the event occurring at the first time point is a predefined event.

[0316] In some embodiments, the first configuration information is also used to indicate the value of M.

[0317] In some embodiments, the first configuration information includes a first parameter; the value of M is determined according to the values ​​of the first parameter and K.

[0318] In some embodiments, the value of K is determined according to the first parameter.

[0319] In some embodiments, the first parameter is determined according to the value of K.

[0320] In some embodiments, the values ​​of the first parameter and K are a first value combination, and the first value combination is determined from multiple candidate value combinations, each candidate value combination is used to indicate a set of candidate values ​​of the first parameter and candidate values ​​of K.

[0321] In some embodiments, the processing module 402 is further configured to determine a value of M.

[0322] In some embodiments, the value of M is determined from a plurality of candidate values ​​of M indicated by the second node.

[0323] In some embodiments, the value of M is determined based on the value of K.

[0324] In some embodiments, the value of M is determined according to the number of reference signal resources or the time interval between reference signal resources.

[0325] In some embodiments, the first configuration information is used to indicate K time points, including: the first configuration information is used to indicate the second parameter and time point information; wherein the value of K is determined according to the number of reference signal resources and the second parameter.

[0326] In some embodiments, the first configuration information is further used to indicate a third parameter; wherein the value of M is determined according to the number of reference signal resources and the third parameter.

[0327] In some embodiments, the value of M is determined based on the numerical relationship between the first time interval and the second time interval of the reference signal resource and the value of K.

[0328] In some embodiments, the value of M is determined based on the time intervals between the M time points.

[0329] In some embodiments, the value of M is determined based on the number of reference signal resources and the value of K.

[0330] In some embodiments, the M time points satisfy at least one of the following:

[0331] The M time points include the first time point among the K time points:

[0332] The M time points include the last time point among the K time points:

[0333] The M time points are indicated by the second node in the K time points;

[0334] M time points are determined by the first node;

[0335] D time points among the M times are indicated by the second node, and E time points among the M times are determined by the first node;

[0336] F time points among the M time points are preset, and E time points among the M time points are determined by the first node.

[0337] For a more detailed description of the above-mentioned receiving module 401, processing module 402 and sending module 403, as well as a more detailed description of each technical feature therein and a description of the beneficial effects, etc., please refer to the above-mentioned corresponding method embodiment part and will not be repeated here.

[0338] FIG5 is a schematic diagram showing the composition of a communication device provided by an embodiment of the present disclosure. As shown in FIG5 , the communication device 50 includes a sending module 501 and a receiving module 502 .

[0339] A sending module 501 is configured to send first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1;

[0340] The receiving module 502 is configured to receive channel state information; wherein the channel state information includes precoding matrix information of M time points selected by the first node from K time points, where M is a positive integer less than K.

[0341] In some embodiments, the channel state information does not include precoding matrix information of N time points other than M time points among the K time points, where N is equal to the difference between K and M.

[0342] In some embodiments, the channel state information also includes precoding matrix information of N time points other than M time points among the K time points, the precoding matrix information of the M time points is generated in a first manner, and the precoding matrix information of the N time points is generated in a second manner, where N is equal to the difference between K and M; wherein the feedback resource overhead corresponding to the first manner is not equal to the feedback resource overhead corresponding to the second manner.

[0343] In some embodiments, the feedback resource overhead of the precoding matrix information generated in the first manner is greater than the feedback resource overhead of the precoding matrix information generated in the second manner. In some embodiments, the value of M is less than the value of N.

[0344] In some embodiments, the feedback resource overhead of the precoding matrix information generated in the first manner is less than the feedback resource overhead of the precoding matrix information generated in the second manner. In some embodiments, the value of M is greater than the value of N.

[0345] In some embodiments, the second node receives the encoded precoding matrix information and can restore the precoding matrix determined by the first node according to the encoded precoding matrix information.

[0346] In some embodiments, the first configuration information includes K time points.

[0347] In some embodiments, the first configuration information includes a time offset value of each of the K time points relative to a reference time point.

[0348] In some embodiments, the first configuration information is used to indicate K time points, including: indicating a first time point among the K time points, and time offset values ​​of the remaining time points relative to the first time point.

[0349] In some embodiments, indicating a first time point among the K time points includes: indicating an event that occurs at the first time point.

[0350] In some embodiments, indicating the first time point among the K time points includes any of the following: indicating an event, where the first time point has a preset time offset value from the time point at which the event occurs.

[0351] In some embodiments, the first configuration information is used to indicate K time points, including: indicating a time offset value of a first time point relative to a reference time point among the K time points, and time offset values ​​of the remaining time points relative to the first time point.

[0352] In some embodiments, the first configuration information is further used to indicate a reference time point.

[0353] In some embodiments, the first configuration information is further used to indicate a reference time point, including: indicating an event occurring at the reference time point.

[0354] In some embodiments, the event includes any of the following:

[0355] transmitting an acknowledgment indication corresponding to data on a physical shared channel;

[0356] Transmitting and confirming data of a physical shared channel corresponding to the indication;

[0357] transmitting a negative indication corresponding to data on a physical shared channel;

[0358] transmitting data of a physical shared channel corresponding to the negative indication;

[0359] Beam failure;

[0360] Beam establishment.

[0361] In some embodiments, the first configuration information is used to indicate K time points, including: a time offset value of a first time point among the K time points relative to a reference time point, and time offset values ​​of two adjacent time points among the K time points.

[0362] In some embodiments, the first configuration information is used to indicate K time points, including: time offset values ​​of other time points except the first time point among the K time points relative to the reference time point.

[0363] In some embodiments, the first configuration information is used to indicate K time points, including: time offset values ​​of other time points among the K time points except the first time point relative to the first time point.

[0364] In some embodiments, the first configuration information is used to indicate K time points, including: a time offset value between two adjacent time points among the K time points.

[0365] In some embodiments, the first time point is indicated by a first signaling; or, the event occurring at the first time point is a predefined event.

[0366] In some embodiments, the first configuration information is also used to indicate the value of M.

[0367] In some embodiments, the first configuration information includes a first parameter; the value of M is determined according to the values ​​of the first parameter and K.

[0368] In some embodiments, the value of K is determined according to the first parameter.

[0369] In some embodiments, the first parameter is determined according to the value of K.

[0370] In some embodiments, the values ​​of the first parameter and K are a first value combination, and the first value combination is determined from multiple candidate value combinations, each candidate value combination is used to indicate a set of candidate values ​​of the first parameter and candidate values ​​of K.

[0371] In some embodiments, the first node may determine a value of M, and then determine M time points among the K time points.

[0372] In some embodiments, the value of M is determined from a plurality of candidate values ​​of M indicated by the second node.

[0373] In some embodiments, the value of M is determined based on the value of K.

[0374] In some embodiments, the value of M is determined according to the number of reference signal resources or the time interval between reference signal resources.

[0375] In one example, the second node may also send second configuration information to the first node, and accordingly, the first node may also receive second configuration information from the second node, where the second configuration information indicates reference signal resources, and the value of M is determined based on the number of reference signal resources or the time interval between reference signal resources.

[0376] In some embodiments, the first configuration information is used to indicate K time points, including: the first configuration information is used to indicate the second parameter and time point information; wherein the value of K is determined according to the number of reference signal resources and the second parameter.

[0377] In some embodiments, the first configuration information is further used to indicate a third parameter; wherein the value of M is determined according to the number of reference signal resources and the third parameter.

[0378] In some embodiments, the value of M is determined based on the numerical relationship between the first time interval and the second time interval of the reference signal resource and the value of K.

[0379] In some embodiments, the value of M is determined based on the time intervals between the M time points.

[0380] In some embodiments, the value of M is determined based on the number of reference signal resources and the value of K.

[0381] In some embodiments, the M time points satisfy at least one of the following:

[0382] The M time points include the first time point among the K time points:

[0383] The M time points include the last time point among the K time points:

[0384] The M time points are indicated by the second node in the K time points;

[0385] M time points are determined by the first node;

[0386] D time points among the M times are indicated by the second node, and E time points among the M times are determined by the first node;

[0387] F time points among the M time points are preset, and E time points among the M time points are determined by the first node.

[0388] For a more detailed description of the sending module 501 and the receiving module 502, as well as a more detailed description of each technical feature and a description of the beneficial effects, etc., please refer to the corresponding method embodiment section above and will not be repeated here.

[0389] It should be noted that the modules in FIG4 or FIG5 may also be referred to as units. For example, the processing module may be referred to as a processing unit. In addition, in the embodiments shown in FIG4 or FIG5 , the names of the modules may not be those shown in the figures. For example, the sending module or the receiving module may also be referred to as a communication module.

[0390] If the various units in Figure 4 or Figure 5 are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present disclosure is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the various embodiments of the present disclosure. The storage medium for storing computer software products includes: various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0391] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, the embodiment of the present disclosure provides a schematic diagram of the structure of a communication device. As shown in Figure 6, the communication device 60 includes: a processor 602, a communication interface 603, and a bus 604. In some embodiments, the communication device 60 may also include a memory 601.

[0392] Processor 602 can implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the present disclosure. Processor 602 can be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof, and can implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the present disclosure. Processor 602 can also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0393] The communication interface 603 is used to connect to other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0394] The memory 601 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0395] As a possible implementation, the memory 601 can exist independently of the processor 602. The memory 601 can be connected to the processor 602 via a bus 604 to store instructions or program codes. When the processor 602 calls and executes the instructions or program codes stored in the memory 601, the method provided by the embodiment of the present disclosure can be implemented.

[0396] In another possible implementation, the memory 601 may also be integrated with the processor 602 .

[0397] Bus 604 can be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 604 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG6 shows only one thick line, but this does not mean that there is only one bus or only one type of bus.

[0398] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be distributed and completed by different functional modules as needed, that is, the internal structure of the equipment or device is divided into different functional modules to complete all or part of the functions described above.

[0399] The embodiments of the present disclosure also provide a computer-readable storage medium (for example, including a non-transitory computer-readable storage medium). All or part of the processes in the above-mentioned method embodiments can be completed by computer instructions to instruct the relevant hardware, and the program can be stored in the above-mentioned computer-readable storage medium. When the program is executed, it can include the processes of the above-mentioned method embodiments. The computer-readable storage medium can be an internal storage unit or memory of any of the aforementioned embodiments. The above-mentioned computer-readable storage medium can also be an external storage device of the above-mentioned device or apparatus, such as a plug-in hard disk, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. equipped on the above-mentioned device or apparatus. Furthermore, the above-mentioned computer-readable storage medium can also include both the internal storage unit and the external storage device of the above-mentioned device or apparatus. The above-mentioned computer-readable storage medium is used to store the above-mentioned computer program and other programs and data required by the above-mentioned device or apparatus. The above-mentioned computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0400] An embodiment of the present disclosure further provides a computer program product, which includes a computer program. When the computer program product is run on a computer, the computer is enabled to execute any one of the methods provided in the above embodiments.

[0401] Although the present disclosure is described herein in conjunction with various embodiments, in the process of implementing the disclosure for which protection is sought, those skilled in the art may understand and implement other variations of the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "one" or "an" does not exclude multiple components. A single processor or other unit may implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

[0402] Although the present disclosure has been described in conjunction with example features and embodiments thereof, it will be apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present disclosure. Accordingly, this specification and the drawings are merely illustrative of the present disclosure as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present disclosure. It will be apparent that those skilled in the art may make various modifications and variations to the present disclosure without departing from the spirit and scope of the present disclosure. Thus, the present disclosure is intended to encompass such modifications and variations as would fall within the scope of the claims of the present disclosure and their equivalents.

[0403] The above is only a specific embodiment of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Any changes or replacements within the technical scope disclosed in the present disclosure should be included in the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.

Claims

1. A method for transmitting precoding matrix information, applied to a first node, the method comprising: Receive first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1; Select M time points from the K time points; Channel state information is sent based on the M time points; wherein the channel state information includes precoding matrix information of the M time points, and M is a positive integer less than K.

2. The method according to claim 1, wherein The channel state information does not include precoding matrix information of other N time points among the K time points except the M time points, where N is equal to the difference between K and M.

3. The method according to claim 1, wherein The channel state information also includes precoding matrix information of N time points other than the M time points among the K time points, where the precoding matrix information of the M time points is generated in a first manner, and the precoding matrix information of the N time points is generated in a second manner, where N is equal to the difference between K and M; wherein the feedback resource overhead corresponding to the first manner is not equal to the feedback resource overhead corresponding to the second manner.

4. The method according to claim 3, wherein: The feedback resource overhead of the precoding matrix information generated in the first manner is greater than the feedback resource overhead of the precoding matrix information generated in the second manner.

5. The method according to claim 4, wherein The value of M is smaller than the value of N.

6. The method according to claim 3, wherein: The feedback resource overhead of the precoding matrix information generated in the first manner is less than the feedback resource overhead of the precoding matrix information generated in the second manner.

7. The method according to claim 6, wherein: The value of M is greater than the value of N.

8. The method according to claim 1, wherein The first configuration information includes the K time points.

9. The method according to claim 1, wherein The first configuration information includes a time offset value of each of the K time points relative to a reference time point.

10. The method according to claim 1, wherein The first configuration information is used to indicate the K time points, including: indicating a first time point among the K time points, and time offset values of the remaining time points relative to the first time point.

11. The method according to claim 10, wherein: The indicating a first time point among the K time points includes indicating an event occurring at the first time point.

12. The method according to claim 10, wherein: The indicating of the first time point among the K time points includes any one of the following: indicating an event, wherein the first time point has a preset time offset value from the time point when the event occurs.

13. The method according to claim 1, wherein The first configuration information is used to indicate the K time points, including: indicating a time offset value of a first time point among the K time points relative to a reference time point, and time offset values of the remaining time points relative to the first time point.

14. The method according to claim 13, wherein The first configuration information is further used to indicate the reference time point.

15. The method according to claim 14, wherein The first configuration information is further used to indicate the reference time point, including: indicating an event occurring at the reference time point.

16. The method according to any one of claims 11, 12 or 15, wherein: The events include any of the following: transmitting an acknowledgment indication corresponding to data on a physical shared channel; Transmitting and confirming data of a physical shared channel corresponding to the indication; transmitting a negative indication corresponding to data on a physical shared channel; transmitting data of a physical shared channel corresponding to the negative indication; Beam failure; Beam establishment.

17. The method according to claim 1, wherein The first configuration information is used to indicate the K time points, including: a time offset value of a first time point among the K time points relative to a reference time point, and time offset values of two adjacent time points among the K time points.

18. The method according to claim 1, wherein The first configuration information is used to indicate the K time points, including: time offset values of other time points among the K time points except the first time point relative to the reference time point.

19. The method according to claim 1, wherein The first configuration information is used to indicate the K time points, including: time offset values of other time points among the K time points except the first time point relative to the first time point.

20. The method according to claim 1, wherein The first configuration information is used to indicate the K time points, including: a time offset value between two adjacent time points among the K time points.

21. The method according to any one of claims 18 to 20, wherein: The first time point among the K time points is indicated by a first signaling; or, the event occurring at the first time point among the K time points is a predefined event.

22. The method according to claim 1, wherein The first configuration information is also used to indicate the value of M.

23. The method according to claim 22, wherein The first configuration information includes a first parameter; the value of M is determined according to the values of the first parameter and K.

24. The method according to claim 22, wherein The first configuration information includes a first parameter; the value of K is determined according to the first parameter.

25. The method according to claim 22, wherein The first configuration information includes a first parameter; the first parameter is determined according to the value of K.

26. The method according to claim 22, wherein The first configuration information includes a first parameter; the value of the first parameter and the value of K is a first value combination, the first value combination is determined from multiple candidate value combinations, and each candidate value combination in the multiple candidate value combinations is used to indicate a set of candidate values of the first parameter and candidate values of K.

27. The method of claim 1, further comprising: The first node determines the value of M.

28. The method according to claim 27, wherein The value of M is determined from a plurality of candidate values of M indicated by the second node.

29. The method according to claim 27, wherein The value of M is determined based on the value of K.

30. The method of claim 1, wherein The value of M is determined according to the number of reference signal resources or the time interval between reference signal resources.

31. The method according to claim 30, wherein The first configuration information is used to indicate the K time points, including: the first configuration information is used to indicate a second parameter and time point information; wherein the value of K is determined according to the number of the reference signal resources and the second parameter.

32. The method according to claim 30, wherein The first configuration information is further used to indicate a third parameter; wherein the value of M is determined according to the number of the reference signal resources and the third parameter.

33. The method according to claim 30, wherein The value of M is determined according to the numerical relationship between the first time interval and the second time interval of the reference signal resource and the value of K.

34. The method of claim 1, wherein The value of M is determined based on the time intervals between the M time points.

35. The method of claim 1, wherein The value of M is determined based on the number of reference signal resources and the value of K.

36. The method of claim 1, wherein The M time points satisfy at least one of the following: The M time points include the first time point among the K time points: The M time points include the last time point among the K time points: The M time points are indicated by the second node among the K time points; The M time points are determined by the first node; D time points among the M time points are indicated by the second node, and E time points among the M time points are determined by the first node; F time points among the M time points are preset, and E time points among the M time points are determined by the first node.

37. A method for receiving a precoding matrix, applied to a second node, the method comprising: Sending first configuration information, where the first configuration information is used to indicate K time points, where K is a positive integer greater than 1; Receive channel state information; wherein the channel state information includes precoding matrix information of M time points selected by the first node from the K time points, where M is a positive integer less than K.

38. The method of claim 37, wherein: The channel state information does not include precoding matrix information of other N time points among the K time points except the M time points, where N is equal to the difference between K and M.

39. The method according to claim 37, wherein The channel state information also includes precoding matrix information of N time points other than the M time points among the K time points, the precoding matrix information of the M time points is generated in a first manner, and the precoding matrix information of the N time points is generated in another manner, where N is equal to the difference between K and M; wherein the feedback resource overhead corresponding to the first manner is not equal to the feedback resource overhead corresponding to the other manner.

40. The method of claim 37, wherein The first configuration information is used to indicate the K time points, including: indicating a first time point among the K time points, and time offset values of the remaining time points relative to the first time point.

41. A communication device comprising: memory and processor; The memory is coupled to the processor; The memory is used to store instructions executable by the processor; When the processor executes the instructions, the method according to any one of claims 1 to 40 is performed.

42. A computer-readable storage medium, wherein: The computer-readable storage medium stores computer instructions, which, when executed on a communication device, enable the communication device to perform the method according to any one of claims 1 to 40.

Images