Precoding matrix information transmission method and apparatus, and storage medium

Abstract

Provided in the embodiments of the present disclosure are a precoding matrix information transmission method and apparatus, and a storage medium. The method comprises: receiving configuration information sent by means of a second communication node; and on the basis of the configuration information, sending to the second communication node K fragments among L fragments of precoding matrix information, wherein L and K are both positive integers, and K is less than or equal to L. The present disclosure can be used in a wireless communication process.

Description

Transmission method, device and storage medium for precoding matrix information

[0001] This disclosure claims priority to Chinese patent application No. 202310919424.7, filed on July 24, 2023, the entire contents of which are incorporated herein by reference. Technical Field

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

[0003] When a base station sends data to a terminal, it precodes the data using a precoding matrix applied to the antenna to match the channel data is transmitted, improving data transmission performance. During the precoding process, the terminal needs to send precoding matrix information to the base station based on the measurement results of the measurement signal, so that the base station can recover the precoding matrix based on the precoding matrix information.

[0004] Summary of the Invention

[0005] On the one hand, a method for transmitting precoding matrix information is provided, including: receiving configuration information sent by a second communication node; and sending K fragments of L fragments of precoding matrix information to the second communication node according to the configuration information, where L and K are both positive integers, and K is less than or equal to L.

[0006] On the other hand, a method for transmitting precoding matrix information is provided, including: sending configuration information to a first communication node; receiving K fragments out of L fragments of precoding matrix information sent by the first communication node, where L and K are both positive integers, and K is less than or equal to L.

[0007] In yet another aspect, a device for transmitting precoding matrix information is provided, comprising: a communication unit and a processing unit. The communication unit is configured to receive configuration information sent by a second communication node; and the processing unit is configured to send K segments of L segments of precoding matrix information to the second communication node based on the configuration information, where L and K are both positive integers, and K is less than or equal to L.

[0008] In another aspect, a device for transmitting precoding matrix information is provided, comprising: a communication unit and a processing unit. The processing unit is configured to instruct the communication unit to send configuration information to a first communication node; the processing unit is further configured to instruct the communication unit to receive K segments of L segments of precoding matrix information sent by the first communication node, where L and K are both positive integers, and K is less than or equal to L.

[0009] On the other hand, a device for transmitting precoding matrix information is provided, comprising: a memory and a processor; the memory and the processor are coupled; the memory is used to store a computer program; and when the processor executes the computer program, the method for transmitting precoding matrix information according to any one of the above aspects or embodiments is implemented.

[0010] On the other hand, a computer-readable storage medium is provided, on which computer program instructions are stored. When the computer program instructions are executed by a processor, the method for transmitting precoding matrix information of any one of the above aspects or embodiments is implemented.

[0011] On the other hand, a computer program product is provided, which includes computer program instructions, and when the computer program instructions are executed by a processor, the method for transmitting precoding matrix information according to any one of the above aspects or embodiments is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] In order to more clearly illustrate the technical solutions in the present disclosure, the following briefly introduces the drawings required for use in some embodiments of the present disclosure. Obviously, the drawings described below are only drawings of some embodiments of the present disclosure. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0013] FIG1 is a system architecture diagram of a communication system according to some embodiments.

[0014] FIG2 is a schematic flow chart of a method for transmitting precoding matrix information according to some embodiments.

[0015] FIG3 is a schematic structural diagram of a transmission device for precoding matrix information applied to a first communication node according to some embodiments.

[0016] FIG4 is a schematic structural diagram of a transmission device for precoding matrix information applied to a second communication node according to some embodiments.

[0017] FIG5 is a schematic diagram of the hardware structure of a transmission device for precoding matrix information according to some embodiments. DETAILED DESCRIPTION

[0018] The following will clearly and completely describe the technical solutions of this disclosure in conjunction with the accompanying drawings. Obviously, the embodiments described are only part of the embodiments of this disclosure, not all of them. All other embodiments obtained by ordinary technicians in this field based on the embodiments of this disclosure without making any creative efforts shall fall within the scope of protection of this disclosure.

[0019] 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 in a concrete manner.

[0020] In the following, the terms "first," "second," etc. are used for descriptive purposes only and should not be understood to indicate or imply relative importance or implicitly specify the quantity of the technical features indicated. Therefore, a feature specified as "first," "second," etc. may explicitly or implicitly include one or more of the features.

[0021] In the description of this disclosure, unless otherwise specified, " / " means "or." For example, A / B can mean A or B. "And / or" herein is merely a description of an association relationship between associated objects, indicating that three possible relationships exist. For example, "A and / or B" can mean: only A, only B, and both A and B. Furthermore, "at least one" means one or more, and "a plurality" means two or more.

[0022] In related technologies, when a base station sends data to a terminal, it precodes the data using a precoding matrix to match the channel transmission data and improve data transmission performance.

[0023] The precoding process involves: the base station indicates reference signal resources to the terminal and sends a reference signal; the terminal measures the reference signal based on the reference signal resources indicated by the base station to determine the channel state information between the base station and the terminal; the terminal determines a precoding matrix based on the channel state information, and then preprocesses the precoding matrix to determine the precoding matrix information; the terminal reports the precoding matrix information to the base station. After receiving the precoding matrix information, the base station recovers the precoding matrix based on the precoding matrix information, encodes the data to be transmitted according to the precoding matrix, and transmits the encoded data to be transmitted through the transmit antenna.

[0024] When a terminal sends precoding matrix information to a base station, the resources used by the terminal to transmit the precoding matrix information may change. For example, the terminal may increase or decrease the resources used to transmit precoding matrix information over time. When the resources used to transmit precoding matrix information change, the amount of precoding matrix information that the terminal can transmit also changes. When transmission resources increase, the terminal can transmit more precoding matrix information; when transmission resources decrease, the amount of precoding matrix information that the terminal can transmit also decreases.

[0025] However, currently, once a terminal determines the precoding matrix information, the number of precoding matrix information is also determined. This means the terminal cannot flexibly adjust the amount of precoding matrix information transmitted to ensure the performance of the precoding matrix recovered from the transmitted precoding matrix information. Therefore, how to flexibly adjust the amount of precoding matrix information transmitted has become a pressing technical issue.

[0026] In order to solve the problems existing in the above-mentioned prior art, an embodiment of the present disclosure provides a method for transmitting precoding matrix information, wherein the second communication node sends configuration information to the first communication node. After receiving the configuration information, the first communication node sends K segments of the L segments of precoding matrix information to the second communication node according to the configuration information, where L and K are both positive integers, and K is less than or equal to L.

[0027] In this way, the first communication node does not need to transmit all the segments of the precoding matrix information; it only needs to select the required number of segments for transmission. When the number of resources used to transmit the precoding matrix information in the first communication node changes, the first communication node can flexibly adjust the number of precoding matrix information segments to transmit based on the change in the number of resources, solving the problem in the prior art where terminals cannot flexibly adjust the amount of precoding matrix information to transmit.

[0028] The method for transmitting precoding matrix information provided by the embodiment of the present disclosure can be applied to a communication system as shown in Figure 1 , which shows a schematic diagram of the architecture of a communication system provided by the embodiment of the present disclosure. As shown in Figure 1 , the communication system includes a first communication node 10 and a second communication node 20 .

[0029] In a wireless communication scenario, a first communication node and a second communication node communicate via a wireless channel. For example, the first communication node is a terminal and the second communication node is a base station, and the base station and the terminal communicate via a wireless channel. In another example, the first communication node is a terminal and the second communication node is a wireless router, and the wireless router and the terminal communicate via a wireless channel. In another example, the first communication node is a first base station and the second communication node is a second base station, and the first and second base stations communicate via a wireless channel. In another example, the first communication node is a first terminal and the second communication node is a second terminal, and the first and second terminals communicate via a wireless channel. In another example, the first communication node is a repeater and the second communication node is a base station, and the base station and the repeater communicate via a wireless channel. In another example, the first communication node is a terminal and the second communication node is a repeater, and the repeater and the terminal communicate via a wireless channel. In another example, the first communication node is a first repeater and the second communication node is a second repeater, and the first and second repeaters communicate via a wireless channel. In another example, the first communication node is a base station, the second communication node is a satellite, and the satellite and the base station communicate via a wireless channel. In another example, the first communication node is a satellite, the second communication node is a base station, and the base station and the satellite communicate via a wireless channel. In another example, the first communication node is a terminal, the second communication node is a satellite, and the satellite and the terminal communicate via a wireless channel. In another example, the first communication node is a satellite, the second communication node is a terminal, and the terminal and the satellite communicate via a wireless channel. In another example, the first communication node is a ground device, the second communication node is an aircraft, and the aircraft and the ground device communicate via a wireless channel. In another example, the first communication node is a first aircraft, the second communication node is a second aircraft, and the first and second aircraft communicate via a wireless channel.

[0030] In the embodiments of the present disclosure, the first communication node 10 is mainly used as a terminal and the second communication node 20 is used as a base station for description.

[0031] In some embodiments, the second communication node 20 is configured to provide wireless access services to multiple terminals. For example, a base station provides a service coverage area (also known as a cell). Terminals that enter this area can communicate with the base station via wireless signals to receive the wireless access services provided by the base station.

[0032] In some embodiments, the second communication node 20 can be a base station or an evolved base station (eNB or eNodeB) in long term evolution (LTE), long term evolution advanced (LTEA), a base station device in a 5G network, or a base station in a future communication system, etc. The base station can include various macro base stations, micro base stations, home base stations, wireless remote stations, reconfigurable intelligent surfaces (RIS), routers, wireless fidelity (WIFI) devices and other network side devices.

[0033] In some embodiments, the first communication node 10 can be a device with wireless transceiver capabilities, which can be deployed on land, including indoors or outdoors, handheld, wearable, or vehicle-mounted; it can also be deployed on the water (such as a ship, etc.); it can also be deployed in the air (for example, on an airplane, a balloon, and a satellite, etc.). The terminal can be a mobile phone, a tablet computer, a computer with wireless transceiver capabilities, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical care, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. The embodiments of the present disclosure do not limit the application scenarios. The terminal may sometimes also be referred to as a user, user equipment (UE), access terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal, mobile device, UE terminal, wireless communication device, UE agent or UE device, etc., but the embodiments of the present disclosure are not limited to this.

[0034] The embodiments of the present disclosure can be applied to downlink data transmission, uplink data transmission, and device-to-device data transmission. For downlink data transmission, the transmitting end is the base station, and the corresponding receiving end is the terminal. For uplink data transmission, the transmitting end is the terminal, and the corresponding receiving end is the base station. For device-to-device data transmission, the transmitting end is the terminal, and the corresponding receiving end is also the terminal. The transmitting end and the receiving end in the present disclosure can both include encoding devices and / or decoding devices, so that the information to be sent can be modulated and encoded, and the received encoded information can be demodulated and decoded, thereby realizing information transmission between the transmitting device and the receiving device. The embodiments of the present disclosure are not limited to this.

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

[0036] The application scenarios of the embodiments of the present disclosure are not limited. 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. It is known to those skilled in the art 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 also applicable to similar technical problems.

[0037] FIG2 shows a flow chart of a method for transmitting precoding matrix information provided by the present disclosure. As shown in FIG2 , the method for transmitting precoding matrix information includes the following steps 201 and 202 .

[0038] Step 201: The second communication node sends configuration information to the first communication node. Correspondingly, the first communication node receives the configuration information sent by the second communication node.

[0039] In some embodiments, the configuration information is used to indicate reference signal resources.

[0040] In some further embodiments, in addition to indicating the reference signal resource, the configuration information is further used to instruct the first communication node to report at least one of a precoding matrix and precoding matrix information.

[0041] Step 202: The first communication node sends K of the L precoding matrix information segments to the second communication node according to the configuration information. Correspondingly, the second communication node receives K of the L precoding matrix information segments sent by the first communication node.

[0042] L and K are both positive integers, and K is less than or equal to L.

[0043] As an exemplary implementation of step 202, the first communication node determines a reference signal resource based on the configuration information, measures the reference signal to obtain a measurement result, and determines a channel coefficient between the first communication node and the second communication node based on the measurement result. The first communication node determines a precoding matrix to be used for data transmission between the first communication node and the second communication node based on the channel coefficient, and processes the precoding matrix to determine precoding matrix information. The first communication node splits the precoding matrix information into L segments and selects K of the L segments to send to the second communication node.

[0044] In some embodiments, after the second communication node receives the precoding matrix information, the second communication node recovers the precoding matrix based on K of the L segments of the precoding matrix information and precodes the data based on the precoding matrix to obtain precoded data. The second communication node may then send the precoded data to the first communication node.

[0045] It is understandable that the reference signal sent by the second communication node to the first communication node is a downlink reference signal. For example, in the LTE system of the fourth generation wireless communication technology, the downlink reference signal used for channel state information reporting includes a cell-specific reference signal (CRS) and a channel state information reference signal (CSI-RS). For another example, in the new radio (NR) system of the fifth generation wireless communication technology, the downlink reference signal used for channel state information reporting includes a CSI-RS.

[0046] In an embodiment of the present disclosure, when a first communication node transmits precoding matrix information to a second communication node, it selects all or some of the L segments of the precoding matrix information for transmission. This eliminates the need for the first communication node to transmit all segments of the precoding matrix information; it only needs to select the required number of segments for transmission. When the number of resources used to transmit precoding matrix information in the first communication node changes, the first communication node can flexibly adjust the number of precoding matrix information segments transmitted based on the change in the number of resources, resolving the prior art issue of a terminal being unable to flexibly adjust the amount of precoding matrix information transmitted.

[0047] In an embodiment of the present disclosure, the first communication node may split the precoding matrix information into L segments and select K segments from the L segments for reporting. The following describes in detail the precoding matrix information, the L segments in the precoding matrix information, and the K segments in the L segments involved in the embodiment of the present disclosure:

[0048] 1. Precoding matrix information.

[0049] The precoding matrix information is precoding matrix information obtained after the first communication node processes the precoding matrix. The precoding matrix information is embodied in the form of bits, or in the form of elements represented by bit groups.

[0050] In some embodiments, a method for a first communication node to process precoding matrix information and determine the precoding matrix information includes: the first communication node determining the precoding matrix information by quantizing the precoding matrix information. The quantization method includes, but is not limited to, at least one of the following: scalar quantization, vector quantization, or codebook quantization. The specific methods of scalar quantization, vector quantization, or codebook quantization can be referenced in the prior art and are not further described here.

[0051] In some further embodiments, the method for the first communication node to process precoding matrix information and determine the precoding matrix information includes: the first communication node determining the precoding matrix information by encoding the precoding matrix information. The encoding method includes, but is not limited to, at least one of the following: compression encoding, encoding using a machine learning algorithm or a machine learning model. The specific methods for compression encoding and encoding using a machine learning algorithm or a machine learning model can be referenced in the prior art and are not further described here.

[0052] 2. L segments in the precoding matrix information.

[0053] In the embodiment of the present disclosure, one segment among the L segments includes one or more bits; or, one segment includes one or more elements, and one element corresponds to one bit group.

[0054] In some embodiments, the first communication node generates L segments of the precoding matrix information by performing quantization processing or encoding processing on the precoding matrix information.

[0055] The number of L fragments can be determined based on the maximum number of fragments obtained after quantization or encoding of the precoding matrix information, or determined by the number of fragments of the precoding matrix information registered by the first communication node to the second communication node, or can be determined by the number of fragments configured by the second communication node to the first communication node through configuration information. This disclosure does not limit this.

[0056] It should be noted that, in the embodiment of the present disclosure, the first communication node may determine L fragments in the following two ways.

[0057] Mode 1: The first communication node directly divides the precoding matrix information into L segments.

[0058] In mode 1, the rank of the precoding matrix is ​​R, and the value of R is an integer greater than 1.

[0059] The value of L may be an integer multiple of R, or the value of L may not be an integer multiple of R, which is not limited in this disclosure.

[0060] Mode 2: The first communication node determines L segments of the precoding matrix information according to the segments of each layer of the precoding matrix information.

[0061] As an exemplary implementation, the rank of the precoding matrix is ​​R, and accordingly, the number of layers of the precoding matrix is ​​also R. The first communication node determines the number of segments in each layer of the precoding matrix information, and determines the sum of the numbers of segments in all layers as L segments of the precoding matrix information.

[0062] For example, the number of segments of the first layer of the precoding matrix information parsed by the first communication node is L1; the number of segments of the second layer of the precoding matrix information is L2; ​​...; the number of segments of the Rth layer of the precoding matrix information is L R At this time, the first communication node determines that the number L of segments in the precoding matrix information satisfies: L=L1+L2+...+L R .

[0063] As an example, the rank of the precoding matrix is ​​1, that is, the number of layers of the precoding matrix is ​​1. The first communication node determines that the number of segments in the first layer of the precoding matrix information is L1. At this time, the first communication node can determine that the number of segments L in the precoding matrix information satisfies: L=L1.

[0064] In another example, the rank of the precoding matrix is ​​2, that is, the number of layers of the precoding matrix is ​​2. The first communication node determines that the number of segments in the first layer of the precoding matrix information is L1, and the number of segments in the second layer of the precoding matrix information is L2. In this case, the first communication node can determine that the number of segments L in the precoding matrix information satisfies the following: L = L1 + L2.

[0065] In another example, the rank of the precoding matrix is ​​3, that is, the number of layers of the precoding matrix is ​​3. The first communication node determines that the number of segments in the first layer of the precoding matrix information is L1, the number of segments in the second layer of the precoding matrix information is L2, and the number of segments in the third layer of the precoding matrix information is L3. In this case, the first communication node can determine that the number of segments L in the precoding matrix information satisfies the following: L = L1 + L2 + L3.

[0066] In another example, the rank of the precoding matrix is ​​4, that is, the number of layers of the precoding matrix is ​​4. The first communication node determines that the number of segments in the first layer of the precoding matrix information is L1, the number of segments in the second layer of the precoding matrix information is L2, the number of segments in the third layer of the precoding matrix information is L3, and the number of segments in the fourth layer of the precoding matrix information is L4. In this case, the first communication node determines that the number of segments L in the precoding matrix information satisfies the following: L = L1 + L2 + L3 + L4.

[0067] It should be noted that, in the embodiment of the present disclosure, a segment of one layer of precoding matrix information refers to a segment in the precoding matrix information corresponding to one layer of the precoding matrix.

[0068] It is understood that when the precoding matrix includes multiple layers, the number of segments in each layer of the precoding matrix information may be the same or different. This disclosure is not limited to this. The number of segments in each layer of the precoding matrix information is different means that the number of segments in the precoding matrix information corresponding to at least one layer is different from the number of segments in the precoding matrix information corresponding to one or more other layers.

[0069] 3. K segments out of L segments in the precoding matrix information.

[0070] Because the number of resources allocated by the first communication node for transmitting precoding matrix information varies, it may be impossible to transmit all of the precoding matrix information. Therefore, the first communication node can send K fragments out of the L fragments of the precoding matrix information. In this way, the first communication node can flexibly select the amount of precoding matrix information to transmit based on the number of transmission resources, avoiding situations where the transmission of precoding matrix information fails due to the amount of precoding matrix information being transmitted being greater than the amount of transmission resources that can be transmitted, or where the second communication node cannot accurately recover the precoding matrix due to insufficient transmission amount, and can also avoid situations where the transmission resources are wasted due to the amount of precoding matrix information being transmitted being less than the amount of transmission resources that can be transmitted.

[0071] In the embodiment of the present disclosure, exemplary implementation scenarios of the first communication node selecting K segments from L segments include the following scenarios 1 to 6. Scenario 1 to 6 will be described in detail below.

[0072] Scenario 1: The K segments are the first K segments in the order of arrangement of the L segments.

[0073] It is understandable that the K segments may also be the last K segments in the sequence of L segments, or K segments at any specified sequential position, which is not limited in the present disclosure.

[0074] The arrangement order of the L segments includes any one of the following: a mapping order of the L segments, a registration order of the L segments, and a configuration order of the L segments.

[0075] The mapping order of the L segments is the order in which the L segments are mapped to the information sequence corresponding to the precoding matrix information. The registration order of the L segments is the order in which the first communication node registers the L segments with the second communication node. The configuration order of the L segments is the order in which the second communication node configures the L segments.

[0076] The mapping order of the L segments, the registration order of the L segments, and the configuration order of the L segments are described in detail below in conjunction with exemplary segmentation scenarios.

[0077] Scene 1-1, mapping order of L fragments.

[0078] In some embodiments, the mapping order of the L segments can be determined by the following process: the first communication node splits the precoding matrix information into L segments and determines an information sequence for mapping the L segments. Thereafter, the first communication node maps each of the L segments to the information sequence. The order of each segment in the information sequence is the mapping order of the segment among the L segments.

[0079] In this scenario, the first communication node determines that the first K (or last K) segments in the mapping order among the L segments are the K segments that need to be reported to the second communication node.

[0080] Scenario 1-2, registration order of L clips.

[0081] In some embodiments, the registration order of the L segments can be determined by the following process: a first communication node pre-registers the L segments of precoding matrix information with a second communication node. The second communication node records the order of the L segments of precoding matrix information during registration. The first communication node determines the registration order of the L segments as the registration order of the L segments registered by the first communication node or the recording order of the L segments in the registration record information of the second communication node.

[0082] In this scenario, the first communication node determines that the first K (or last K) segments in the mapping order among the L segments are the K segments that need to be reported to the second communication node.

[0083] Scenarios 1-3, configuration order of L segments.

[0084] In some embodiments, the configuration order of the L fragments can be determined by the following process: the second communication node configures L fragments of precoding matrix information to the first communication node through configuration information, and the order of the L fragments in the configuration information is the configuration order of the L fragments.

[0085] In this scenario, the first communication node determines that the first K (or last K) segments in the configuration order among the L segments are the K segments that need to be reported to the second communication node.

[0086] It should be noted that the arrangement order of the L segments given in Scenario 1-1, Scenario 1-2, and Scenario 1-3 is the sorting method corresponding to the method in which the first communication node divides the precoding matrix information into L segments in the above-mentioned method 1.

[0087] It is understood that, in addition to the above arrangement order, the first communication node may also select K segments from the L segments and report them to the second communication node according to other orders. For example, the first communication node may select K segments with the highest reporting priority according to the priority order of each segment and report them to the second communication node.

[0088] Scenario 2: The K segments are K segments whose bit numbers meet the conditions among the L segments.

[0089] In this scenario, the first communication node determines K fragments from the L fragments according to the number of bits corresponding to each of the L fragments.

[0090] For example, the first communication node determines K segments from the L segments according to the number of bits corresponding to each of the L segments, including: the first communication node determines the first K segments with the smallest number of bits from the L segments.

[0091] Alternatively, the first communication node determines the first K segments having the largest number of bits from the L segments.

[0092] Alternatively, the first communication node determines K segments whose bit number is less than or equal to the first threshold from the L segments.

[0093] Alternatively, the first communication node determines K segments whose bit number is greater than or equal to the second threshold from the L segments.

[0094] Alternatively, the first communication node determines, from the L fragments, K fragments whose number of bits is greater than or equal to a third threshold and less than or equal to a fourth threshold.

[0095] Alternatively, the first communication node determines, from the L fragments, K fragments whose sum of bit numbers is less than or equal to a fifth threshold.

[0096] Alternatively, the first communication node determines, from the L fragments, K fragments whose sum of bit numbers is greater than or equal to a sixth threshold.

[0097] It is understandable that the sizes of the first threshold to the sixth threshold in the embodiment of the present disclosure can be set as needed, and the present disclosure does not limit this.

[0098] Scenario 3: The K segments include all or part of the segments corresponding to the Sth layer in the precoding matrix information. S is less than or equal to R, where R is the rank of the precoding matrix, and both S and R are positive integers.

[0099] As an example, the rank of the precoding matrix is ​​4, that is, the number of layers of the precoding matrix is ​​4.

[0100] The K segments include: all or part of the segments corresponding to the first layer in the precoding matrix information.

[0101] Alternatively, the K segments include: all or part of the segments corresponding to the second layer in the precoding matrix information.

[0102] Alternatively, the K segments include: all or part of the segments corresponding to the third layer in the precoding matrix information.

[0103] Alternatively, the K segments include: all or part of the segments corresponding to the 4th layer in the precoding matrix information.

[0104] In scenario 4, the K segments include all or part of the segments corresponding to the Q layers in the precoding matrix information. R is the rank of the precoding matrix. Q and R are both positive integers, and Q is less than or equal to R.

[0105] As an example, the rank of the precoding matrix is ​​4. The value of Q can be 1, 2, 3, 4, etc., without limitation.

[0106] When the value of Q is 4, the K segments include all or part of the segments in the precoding matrix information corresponding to each of the four layers of the precoding matrix.

[0107] When the value of Q is 3, the K segments include all or part of the segments in the precoding matrix information corresponding to three of the four layers of the precoding matrix. For example, the K segments may include all or part of the segments in the precoding matrix information corresponding to the first, second, and third layers of the precoding matrix. Alternatively, the K segments may include all or part of the segments in the precoding matrix information corresponding to the first, second, and fourth layers of the precoding matrix. Alternatively, the K segments may include all or part of the segments in the precoding matrix information corresponding to the first, third, and fourth layers of the precoding matrix. Alternatively, the K segments may include all or part of the segments in the precoding matrix information corresponding to the second, third, and fourth layers of the precoding matrix.

[0108] When the value of Q is 2, the K segments include all or part of the segments in the precoding matrix information corresponding to two of the four layers of the precoding matrix. For example, the K segments may include all or part of the segments in the precoding matrix information corresponding to the first and second layers of the precoding matrix. Alternatively, the K segments may include all or part of the segments in the precoding matrix information corresponding to the first and third layers of the precoding matrix. Alternatively, the K segments may include all or part of the segments in the precoding matrix information corresponding to the first and fourth layers of the precoding matrix. Alternatively, the K segments may include all or part of the segments in the precoding matrix information corresponding to the second and third layers of the precoding matrix. Alternatively, the K segments may include all or part of the segments in the precoding matrix information corresponding to the second and fourth layers of the precoding matrix. Alternatively, the K segments may include all or part of the segments in the precoding matrix information corresponding to the third and fourth layers of the precoding matrix.

[0109] When the value of Q is 1, the K segments include all or part of the segments in the precoding matrix information corresponding to one of the four layers of the precoding matrix. For example, the K segments may include all or part of the segments in the precoding matrix information corresponding to the first layer of the precoding matrix; or the K segments may include all or part of the segments in the precoding matrix information corresponding to the second layer of the precoding matrix; or the K segments may include all or part of the segments in the precoding matrix information corresponding to the third layer of the precoding matrix; or the K segments may include all or part of the segments in the precoding matrix information corresponding to the fourth layer of the precoding matrix.

[0110] In scenario 5, the K segments are K segments determined from the I-th segment corresponding to each layer in the precoding matrix information, where I is a positive integer.

[0111] In some embodiments, the first communication node may determine the first fragment corresponding to a layer based on an arrangement order of the fragments within the layer. The arrangement order of the fragments within the layer includes any one of the following: an index order of the fragments within the layer, a mapping order of the fragments within the layer, a registration order of the fragments within the layer, a configuration order of the fragments within the layer, and an order of the number of bits of the fragments within the layer.

[0112] Below, the index order of the fragments within the above layers, the mapping order of the fragments within the layers, the registration order of the fragments within the layers, the configuration order of the fragments within the layers, and the size order of the number of bits of the fragments within the layers are described in detail in combination with exemplary subdivision scenarios.

[0113] Scene 5-1. Index order of fragments within a layer.

[0114] In this scenario, the first communication node sorts the segments in each layer of the precoding matrix information in index order and selects a segment with index 1 from each layer, resulting in a total of R segments. The first communication node determines K segments from the R segments. In this case, K is a positive integer less than or equal to R.

[0115] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects the I-th segment with an index of 1 from the first layer of the precoding matrix information, selects the I-th segment with an index of 1 from the second layer, selects the I-th segment with an index of 1 from the third layer, and selects the I-th segment with an index of 1 from the fourth layer, thereby obtaining four segments. The first communication node selects all or part of the segments from the four segments as K segments.

[0116] Scene 5-2: Mapping order of fragments within a layer.

[0117] In some embodiments, the mapping order of segments within a layer is determined by the following process: the first communication node splits the precoding matrix information into L segments, with each layer including a corresponding number of segments. The first communication node then maps the segments of each layer to the information sequence. The order in which a segment is mapped to the information sequence within the layer to which it belongs is recorded as the mapping order of the segments within the layer of the segment.

[0118] After determining the mapping order of the segments within each segment layer, the first communication node selects segments with a mapping order of 1 from each layer of the precoding matrix information, resulting in a total of R segments. The first communication node determines K segments from the R segments. In this case, K is a positive integer less than or equal to R.

[0119] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects the I-th segment with a mapping order of 1 from the first layer of the precoding matrix information, selects the I-th segment with a mapping order of 1 from the second layer, selects the I-th segment with a mapping order of 1 from the third layer, and selects the I-th segment with a mapping order of 1 from the fourth layer, thereby obtaining four segments. The first communication node selects all or some of the segments from the four segments as K segments.

[0120] Scene 5-3: Registration order of fragments within a layer.

[0121] In some embodiments, the registration order of the fragments within a layer is determined in the following manner: the first communication node registers L fragments in the precoding matrix information to the second communication node. During the registration process, the first communication node will register the fragments in each layer in order, and the second communication node will record these fragments in the record information. The registration order of a fragment in the layer to which it belongs, or the order of registration record information in the layer to which a fragment belongs, is the registration order of the fragments in the layer of a fragment. For example, the registration order of each fragment in the jth layer is the registration order when the first communication node registers each fragment in the jth layer, or the record order of each fragment in the registration record information of the second communication node. j is a positive integer less than or equal to R.

[0122] After determining the registration order of the segments within each segment layer, the first communication node selects segments with a registration order of 1 from each layer of the precoding matrix information, resulting in a total of R segments. The first communication node determines K segments from the R segments. In this case, K is a positive integer less than or equal to R.

[0123] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects the I-th segment with a registration order of I from the first layer of the precoding matrix information, selects the I-th segment with a registration order of I from the second layer, selects the I-th segment with a registration order of I from the third layer, and selects the I-th segment with a registration order of I from the fourth layer, thereby obtaining four segments. The first communication node selects all or part of the segments from the four segments as K segments.

[0124] Scene 5-4: The order of arrangement of fragments within a layer.

[0125] In some embodiments, the order of configuration of segments within a layer is determined as follows: the second communication node configures L segments of precoding matrix information to the first communication node via configuration information, where the order of configuration of the segments within each layer is different. The order of configuration of a segment within its layer is the order of configuration of the segments within that layer. For example, the order of configuration of the segments within the jth layer is the order of the segments within the jth layer in the configuration information sent by the second communication node to the first communication node.

[0126] After determining the order of segments within each segment layer, the first communication node selects segments with an order of 1 from each layer of the precoding matrix information, resulting in a total of R segments. The first communication node then determines K segments from the R segments. Here, K is a positive integer less than or equal to R.

[0127] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects the I-th segment with a configuration order of I from the first layer of the precoding matrix information, selects the I-th segment with a configuration order of I from the second layer, selects the I-th segment with a configuration order of I from the third layer, and selects the I-th segment with a configuration order of I from the fourth layer, thereby obtaining four segments. The first communication node selects all or some of the segments from the four segments as K segments.

[0128] Scene 5-5: Order of bit numbers of segments within a layer.

[0129] In this scenario, the first communication node sorts the segments in each layer of the precoding matrix information by the number of bits, from largest to smallest (or alternatively, from smallest to largest, not limited in this disclosure), and selects the I-th segment with the number of bits sorted as I from each layer, obtaining a total of R segments. The first communication node determines K segments from the R segments. In this case, K is a positive integer less than or equal to R.

[0130] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects the I-th segment with the number of bits ranked as I from the first layer of the precoding matrix information, selects the I-th segment with the number of bits ranked as I from the second layer, selects the I-th segment with the number of bits ranked as I from the third layer, and selects the I-th segment with the number of bits ranked as I from the fourth layer, thereby obtaining four segments. The first communication node selects all or part of the segments from the four segments as K segments.

[0131] Scenario 6, the K segments are K segments determined from the 1st segment to the Ith segment corresponding to each of the Q layers in the precoding matrix information, Q is less than or equal to R, R is the rank of the precoding matrix, and I, Q and R are all positive integers.

[0132] In some embodiments, the first communication node may determine the first to first fragments corresponding to a layer based on an arrangement order of the fragments within the layer. The arrangement order of the fragments within the layer is any one of the following: an index order of the fragments within the layer, a mapping order of the fragments within the layer, a registration order of the fragments within the layer, a configuration order of the fragments within the layer, or an order of the number of bits of the fragments within the layer.

[0133] Below, the indexing order of the fragments within the layer, the mapping order of the fragments within the layer, the registration order of the fragments within the layer, the configuration order of the fragments within the layer, and the size order of the number of bits of the fragments within the layer are described in detail in combination with an exemplary segmentation scenario.

[0134] Scene 6-1. Index order of fragments within a layer.

[0135] In this scenario, the first communication node sorts the segments in each layer of the precoding matrix information in index order, and selects I segments with index order 1 to index order I from each layer, obtaining a total of I×R segments.

[0136] The first communication node determines K segments from the I×R segments, where K is a positive integer less than or equal to I×R.

[0137] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects I segments with index order 1 to index order I from the first layer of the precoding matrix information, selects I segments with index order 1 to index order I from the second layer, selects I segments with index order 1 to index order I from the third layer, and selects I segments with index order 1 to index order I from the fourth layer, resulting in 4×I segments. The first communication node selects all or part of the segments from the 4×I segments as K segments.

[0138] Scene 6-2: Mapping order of segments within a layer.

[0139] In this scenario, the first communication node selects I segments with a mapping order of 1 to a mapping order of I from each layer of the precoding matrix information, resulting in a total of I×R segments. The first communication node determines K segments from the I×R segments. K is a positive integer less than or equal to I×R.

[0140] The process of determining the mapping order of fragments within a layer can refer to the description in the above scenario 5-2 and will not be repeated here.

[0141] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects I segments with mapping order 1 to mapping order 1 from the first layer of the precoding matrix information, selects I segments with mapping order 1 to mapping order 1 from the second layer, selects I segments with mapping order 1 to mapping order 1 from the third layer, and selects I segments with mapping order 1 to mapping order 1 from the fourth layer, resulting in 4×I segments. The first communication node selects all or part of the segments from the 4×I segments as K segments.

[0142] Scene 6-3: Registration order of fragments within a layer.

[0143] In this scenario, the first communication node selects I segments with registration order 1 to I from each layer of the precoding matrix information, resulting in a total of I×R segments. The first communication node determines K segments from the I×R segments. K is a positive integer less than or equal to I×R.

[0144] The process of determining the registration order of fragments within a layer can refer to the description in the above scenario 5-3 and will not be repeated here.

[0145] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects I segments with registration order 1 to registration order I from the first layer of the precoding matrix information, selects I segments with order 1 to registration order I from the second layer, selects I segments with order 1 to registration order I from the third layer, and selects I segments with order 1 to registration order I from the fourth layer, resulting in 4×I segments. The first communication node selects all or part of the segments from the 4×I segments as K segments.

[0146] Scene 6-4: The order of arrangement of fragments within a layer.

[0147] In this scenario, the first communication node selects I segments with a configuration order of 1 to a configuration order of I from each layer of the precoding matrix information, resulting in a total of I×R segments. The first communication node determines K segments from the I×R segments. K is a positive integer less than or equal to I×R.

[0148] The process of determining the configuration order of the fragments within the layer can refer to the description in the above scenario 5-4 and will not be repeated here.

[0149] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects I segments with a configuration order of 1 to a configuration order of I from the first layer of the precoding matrix information, selects I segments with a configuration order of 1 to a configuration order of I from the second layer, selects I segments with a configuration order of 1 to a configuration order of I from the third layer, and selects I segments with a configuration order of 1 to a configuration order of I from the fourth layer, resulting in 4×I segments. The first communication node selects all or part of the segments from the 4×I segments as K segments.

[0150] Scene 6-5: Order of bit numbers of segments within a layer.

[0151] In this scenario, the first communication node sorts the segments in each layer of the precoding matrix information by bit number, and selects I segments from each layer with bit number sorted from 1 to I, resulting in a total of I×R segments. The first communication node determines K segments from the I×R segments, where K is a positive integer less than or equal to I×R.

[0152] The process of determining the bit quantity order of the fragments within the layer can refer to the description in the above scenario 5-5 and will not be repeated here.

[0153] As an example, the value of R is 4, that is, the rank of the precoding matrix is ​​4. The first communication node selects I segments with bit number rankings from 1 to 1 from the first layer of the precoding matrix information, selects I segments with bit number rankings from 1 to 1 from the second layer, selects I segments with bit number rankings from 1 to 1 from the third layer, and selects I segments with bit number rankings from 1 to 1 from the fourth layer, resulting in 4×I segments. The first communication node selects all or part of the segments from the 4×I segments as K segments.

[0154] In the case where the arrangement order associated with the L segments is the mapping order of the L segments, the mapping order of the L segments will be described in detail.

[0155] In some embodiments, the mapping order of the L segments is determined according to the layer index corresponding to each of the L segments and the segment index within the layer corresponding to each of the L segments.

[0156] As an embodiment, the fragment with a smaller layer index is located before the fragment with a larger layer index in the mapping order of L fragments; and, for two fragments with the same layer index, the fragment with a smaller fragment index is located before the fragment with a larger fragment index in the mapping order of L fragments.

[0157] In one embodiment, the first communication node maps the fragments in each layer of the precoding matrix information to the information sequence in sequence based on the size of the index of each layer of the precoding matrix information. When mapping the fragments in each layer, the first communication node maps the fragments in each layer to the information sequence in sequence according to the size of the index of the fragments in each layer.

[0158] As an example, the precoding matrix information has a total of 4 layers. The first communication node first obtains all the segments in the 1st layer with a layer index number of 1 and determines the index of each segment in the 1st layer, and maps all the segments in the 1st layer to the information sequence in ascending order of the segment index. Then, the first communication node obtains all the segments in the 2nd layer with a layer index number of 2 and determines the index of each segment in the 2nd layer, and maps all the segments in the 2nd layer to the information sequence in ascending order of the segment index. Thereafter, the first communication node obtains all the segments in the 3rd layer with a layer index number of 3 and determines the index of each segment in the 3rd layer, and maps all the segments in the 3rd layer to the information sequence in ascending order of the segment index. Finally, the first communication node obtains all the segments in the 4th layer with a layer index number of 4 and determines the index of each segment in the 4th layer, and maps all the segments in the 4th layer to the information sequence in ascending order of the segment index.

[0159] As another embodiment, the fragment with a smaller fragment index is located before the fragment with a larger fragment index in the mapping order of the L fragments. For two fragments with the same fragment index, the fragment with a smaller layer index is located before the fragment with a larger layer index in the mapping order of the L fragments.

[0160] In one embodiment, the first communication node selects the segment with the smallest index number from the unmapped segments in each layer based on the index order of each layer of the precoding matrix information and maps it to the information sequence until each segment of each layer of the precoding matrix information is mapped to the information sequence.

[0161] As an example, the precoding matrix information has a total of 4 layers. Each layer includes 3 fragments. The first communication node first maps the first fragment with a fragment index number of 1 in each layer, which may include: the first communication node obtains the first fragment with a fragment index number of 1 in the first layer with a layer index number of 1, and maps it to the information sequence; the first communication node obtains the first fragment with a fragment index number of 1 in the second layer with a layer index number of 2, and maps it to the information sequence; the first communication node obtains the first fragment with a fragment index number of 1 in the third layer with a layer index number of 3, and maps it to the information sequence; the first communication node obtains the first fragment with a fragment index number of 1 in the fourth layer with a layer index number of 4, and maps it to the information sequence.

[0162] Then, the first communication node maps the second fragment with fragment index number 2 in each layer, which may include: the first communication node obtains the second fragment with fragment index number 2 in the first layer with layer index number 1, and maps it to the information sequence; the first communication node obtains the second fragment with fragment index number 2 in the second layer with layer index number 2, and maps it to the information sequence; the first communication node obtains the second fragment with fragment index number 2 in the third layer with layer index number 3, and maps it to the information sequence; the first communication node obtains the second fragment with fragment index number 2 in the fourth layer with layer index number 4, and maps it to the information sequence.

[0163] Finally, the first communication node maps the third fragment with fragment index number 3 in each layer, which can include: the first communication node obtains the third fragment with fragment index number 3 in the first layer with layer index number 1, and maps it to the information sequence; the first communication node obtains the third fragment with fragment index number 3 in the second layer with layer index number 2, and maps it to the information sequence; the first communication node obtains the third fragment with fragment index number 3 in the third layer with layer index number 3, and maps it to the information sequence; the first communication node obtains the third fragment with fragment index number 3 in the fourth layer with layer index number 4, and maps it to the information sequence.

[0164] It should be noted that, when mapping the segments into the information sequence, the first communication node performs the mapping according to the order of positions in the information sequence, with the segments mapped earlier being placed first and the segments mapped later being placed later.

[0165] In some embodiments, the index of each layer is determined by the following method 1 or method 2.

[0166] Method 1: The layer index of a layer is positively correlated with the corresponding transmit power of the layer. That is, the greater the transmit power of a layer, the greater the layer index of the layer.

[0167] Mode 2: The layer index of a layer is negatively correlated with the transmit power corresponding to the layer. That is, the greater the transmit power corresponding to a layer, the smaller the layer index of the layer.

[0168] In some embodiments, the index of the segment within a layer may be determined by the following method 3 or method 4.

[0169] Mode 3: The fragment index of the fragment within the layer is determined according to the registration information sent by the first communication node to the second communication node.

[0170] Mode 4: The fragment index within the layer is determined according to the configuration information.

[0171] As an example, the first communication node determines the registration order of the segments within the layer based on the registration information. For example, segments with an earlier registration order have a smaller segment index within the layer. For another example, segments with an earlier registration order have a larger segment index within the layer.

[0172] As another example, the first communication node determines the configuration order of the segments within the layer based on the configuration information. For example, segments with an earlier configuration order have a smaller segment index within the layer. For another example, segments with an earlier configuration order have a larger segment index within the layer.

[0173] For understanding of the registration order, please refer to the description of the registration order in the aforementioned scenario 5-3 or scenario 6-3, which will not be repeated here.

[0174] For understanding of the configuration order, please refer to the description of the configuration order in the aforementioned scenario 5-4 or scenario 6-3, which will not be repeated here.

[0175] It is understood that the first communication node may also determine the fragment index of a fragment within a layer according to other methods, which are not limited in this disclosure. For example, the first communication node may determine the fragment index of a fragment within a layer according to the number of bits in the fragment, where the first communication node determines that the fragment with more bits has a smaller fragment index within the layer; or the first communication node determines that the fragment with more bits has a larger fragment index within the layer.

[0176] In the embodiment of the present disclosure, when the order of arrangement of the L segments is the mapping order of the L segments, the mapping order of the L segments needs to be synchronized between the first communication node and the second communication node. This allows the first communication node to sort the L segments according to the mapping order and select K segments from them. The second communication node can then use the same mapping order to restore K of the L segments and determine the precoding matrix information, thereby improving the consistency of the precoding matrix information between the first communication node and the second communication node.

[0177] The manner in which the mapping order of the L segments is synchronized between the first communication node and the second communication node may include at least one of the following synchronization manner 1, synchronization manner 2, and synchronization manner 3. Each of these will be described in detail below:

[0178] Synchronization mode 1: The mapping order of the L segments is configured by the second communication node to the first communication node.

[0179] The second communication node may configure the mapping order of the L segments by sending configuration information to the first communication node, or may configure the mapping order of the L segments to the first communication node by sending instruction information other than the configuration information. This disclosure does not limit this.

[0180] In an exemplary implementation, the second communication node may directly indicate the sequence number of each of the L segments to the first communication node; the first communication node determines the mapping order of the L segments through the sequence number of each segment.

[0181] Alternatively, the second communication node may indicate a permutation number to the first communication node, where each permutation number corresponds to a permutation order of the fragments; the first communication node uses the permutation order corresponding to the permutation number as the mapping order of the L fragments.

[0182] Alternatively, the second communication node may indicate a mapping method to the first communication node; the first communication node determines the mapping order of the L segments according to the mapping method indicated by the second communication node.

[0183] As an example, the mapping order in the embodiment of the present disclosure includes but is not limited to at least one of the following mapping modes 1 to 5:

[0184] Mapping method 1: The fragment with a smaller layer index is located before the fragment with a larger layer index in the mapping order of L fragments; and, for two fragments with the same layer index, the fragment with a smaller fragment index is located before the fragment with a larger fragment index in the mapping order of L fragments.

[0185] Mapping method 2: The fragment with a smaller fragment index is located before the fragment with a larger fragment index in the mapping order of L fragments; and, for two fragments with the same fragment index, the fragment with a smaller layer index is located before the fragment with a larger layer index in the mapping order of L fragments.

[0186] The implementation of mapping method 1 and mapping method 2 can refer to the mapping order of the L fragments in the previous article according to the layer index corresponding to each of the L fragments, and the content recorded in the determination of the fragment index corresponding to each of the L fragments in the layer, which will not be repeated here.

[0187] Mapping mode 3: The mapping order of the L segments is the order in which the number of bits of the segments is arranged from large to small.

[0188] Mapping mode 4: The mapping order of the L segments is the order in which the number of bits of the segments is arranged from small to large.

[0189] Mapping mode 5: The mapping order of the L segments is the order in which the L segments are arranged according to their registration order. For understanding of the registration order, please refer to the description of the registration order in the above scenario 5.3 or scenario 6.3, which will not be repeated here.

[0190] Synchronization mode 2: The mapping order of the L segments is indicated by the first communication node to the second communication node.

[0191] The first communication node may indicate the mapping order of the L segments to the second communication node while sending K segments of the L segments of the precoding matrix to the second communication node. That is, the indication information for indicating the mapping order of the L segments and the K segments of the L segments of the precoding matrix are carried in the same signaling message.

[0192] Alternatively, the second communication node may indicate the mapping order of the L segments to the second communication node at a time other than when K segments of the L segments of the precoding matrix are sent to the second communication node. That is, the indication information for indicating the mapping order of the L segments and the K segments of the L segments of the precoding matrix are carried in different signaling messages. This disclosure is not limited to this.

[0193] In one implementation, the first communication node may directly indicate the serial number of each of the L fragments to the second communication node; the second communication node determines the mapping order of the L fragments through the serial number of each fragment.

[0194] Alternatively, the first communication node may indicate a permutation number to the second communication node, where each permutation number corresponds to a permutation order of the fragments; the second communication node uses the permutation order corresponding to the permutation number as the mapping order of the L fragments.

[0195] Alternatively, the first communication node may indicate a mapping method to the second communication node; the second communication node determines the mapping order of the L segments according to the mapping method indicated by the first communication node.

[0196] For understanding of the mapping method, please refer to the description of mapping method 1 to mapping method 5 recorded in the above-mentioned synchronization method 1, which will not be repeated here.

[0197] Synchronization mode three: the first communication node and the second communication node synchronize some mapping sequences among the L mapping sequences.

[0198] In some embodiments, the mapping order of L fragments includes a first part mapping order and a second part mapping order; the first part mapping order is the mapping order of the first P fragments in the mapping order of the L fragments; the second part mapping order is the mapping order of the last LP fragments in the mapping order of the L fragments, P is a positive integer, and P is less than L.

[0199] In some embodiments, the first partial mapping order is configured by the second communication node for the first communication node, and the second partial mapping order is indicated by the first communication node to the second communication node.

[0200] The process of the second communication node configuring the first part of the mapping order for the first communication node can refer to the process of the second communication node configuring the mapping order of L fragments for the first communication node in the above-mentioned synchronization method 1, which will not be repeated here.

[0201] The process of the first communication node indicating the mapping order of the second part to the second communication node can refer to the process of the first communication node indicating the mapping order of L fragments to the second communication node in the above-mentioned synchronization method 2, which will not be repeated here.

[0202] In this way, the first communication node and the second communication node indicate to each other a partial mapping order of the mapping order of the L segments, and the first communication node and the second communication node can determine the complete mapping order of the L segments through the content indicated to each other.

[0203] In some embodiments, the first partial mapping order is determined by preconfiguration, and the second partial mapping order is indicated by the first communication node to the second communication node.

[0204] The first portion of the mapping order is determined by pre-configuration, which may be implemented as being predetermined by a protocol, and the first communication node and the second communication node both determine the first portion of the mapping order according to the protocol.

[0205] The process of the first communication node indicating the mapping order of the second part to the second communication node can refer to the process of the first communication node indicating the mapping order of L fragments to the second communication node in the above-mentioned synchronization method 2, which will not be repeated here.

[0206] In the disclosed embodiment, the segments in the first portion of the mapping order of the L segments are typically more important segments, and the order of this portion of the segments is typically more stable and less subject to change with channel conditions. By specifying this portion of the mapping order through a protocol, it is possible to ensure that when the first and second communication nodes perform precoding based on the segments in this portion of the mapping order, a certain level of transmission performance can be maintained. By predetermining the order of this portion of the segments through a protocol, configuration information overhead or signaling overhead for the second communication node can be reduced, and reporting overhead for the first communication node can also be reduced.

[0207] Information about changes in the channel state between the first communication node and the second communication node is typically represented by a fragment in the second portion of the mapping sequence, which changes rapidly with the channel state information. The first communication node indicating the second portion of the mapping sequence to the second communication node allows the first and second communication nodes to synchronize channel changes in real time, thereby improving transmission performance between the first and second communication nodes.

[0208] In some embodiments, the first portion of the mapping order is determined by preconfiguration, and the second portion of the mapping order is configured by the second communication node for the first communication node.

[0209] The first portion of the mapping order is determined by pre-configuration, which may be implemented as being predetermined by a protocol, and the first communication node and the second communication node both determine the first portion of the mapping order according to the protocol.

[0210] The process of the second communication node configuring the second part mapping order for the first communication node can refer to the process of the second communication node configuring the mapping order of L fragments for the first communication node in the above-mentioned synchronization method 1, which will not be repeated here.

[0211] In some embodiments, the first portion of the mapping order is indicated by configuration information, and the second portion of the mapping order is indicated by signaling different from the configuration information.

[0212] In the embodiment of the present disclosure, since the order of the fragments of the first part of the mapping order is usually more stable and changes less with the channel state. Therefore, the first part of the mapping is configured according to the configuration information sent by the second communication node to the first communication node. After the first communication node is configured according to the configuration information, it can feed back the same feedback information as before to the second communication node without sending additional feedback messages, which can save the feedback overhead of the first communication node. In addition, the first communication node can also control the mapping order of the first part according to the demand for the use of the fragments. The mapping order of the second part changes quickly with the channel and is indicated by a first signaling different from the configuration information. In this way, the mapping order of the second part can be synchronized faster, thereby better adapting to the channel changes between the first communication node and the second communication node and avoiding performance loss.

[0213] It is understandable that, in order to implement the above functions, the transmission device of the precoding matrix information includes hardware structures and / or software modules corresponding to the execution of each function. It should be readily apparent to those skilled in the art that, in conjunction with the algorithmic steps of the various examples described in the embodiments of the present disclosure, 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 hardware or in a 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.

[0214] The embodiments of the present disclosure can divide the functional modules of the transmission device of precoding matrix information according to the above-mentioned method embodiments. For example, each functional module can be divided according 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 illustrative and is only a logical functional division. In actual implementation, other division methods can be used. The following is an example of dividing each functional module according to each function.

[0215] Figure 3 is a schematic diagram of the structure of a device for transmitting precoding matrix information applied to a first communication node, provided in an embodiment of the present disclosure. The device for transmitting precoding matrix information can perform the first communication node-related method in the method for transmitting precoding matrix information provided in the above-mentioned method embodiment. As shown in Figure 3, the device for transmitting precoding matrix information includes a communication unit 301 and a processing unit 302.

[0216] The communication unit 301 is configured to receive configuration information sent by the second communication node.

[0217] The processing unit 302 is configured to send K segments of the L segments of precoding matrix information to the second communication node according to the configuration information, where L and K are both positive integers, and K is less than or equal to L.

[0218] In some embodiments, the K segments are the first K segments in the order in which the L segments are related.

[0219] In some embodiments, the arrangement order related to the L fragments includes any one of the following: the mapping order of the L fragments, the registration order of the L fragments, and the configuration order of the L fragments; wherein, the mapping order of the L fragments is the order in which the L fragments are mapped to the information sequence corresponding to the precoding matrix information; the registration order of the L fragments is the order in which the first communication node registers the L fragments to the second communication node; the configuration order of the L fragments is the order in which the L fragments are configured by the second communication node.

[0220] In some embodiments, the processing unit is further configured to: determine K fragments from the L fragments according to the number of bits corresponding to each of the L fragments.

[0221] In some embodiments, the K segments include: all or part of the segments corresponding to the Sth layer in the precoding matrix information, S is less than or equal to R, R is the rank of the precoding matrix, and both S and R are positive integers.

[0222] In some embodiments, the K segments include: all or part of the segments corresponding to Q layers in the precoding matrix information, where Q is less than or equal to R, R is the rank of the precoding matrix, and both Q and R are positive integers.

[0223] In some embodiments, the K segments are K segments determined from the I-th segment corresponding to each layer in the precoding matrix information, where I is a positive integer.

[0224] In some embodiments, the first fragment corresponding to a layer is determined based on an arrangement order of fragments within a layer; the arrangement order of fragments within a layer includes any one of the following:

[0225] The index order of the fragments within the layer,

[0226] The mapping order of fragments within a layer,

[0227] The order in which the fragments within the layer are registered,

[0228] The order in which the fragments are arranged within a layer, or,

[0229] The order of the number of bits of the segments within a layer.

[0230] In some embodiments, the K fragments are K fragments determined from the 1st fragment to the Ith fragment corresponding to each of the Q layers in the precoding matrix information, Q is less than or equal to R, R is the rank of the precoding matrix, and I, Q and R are all positive integers.

[0231] In some embodiments, based on the arrangement order of the fragments in a layer, the first to the first fragments corresponding to the layer are determined; the arrangement order of the fragments in the layer is any one of the following:

[0232] The index order of the fragments within the layer,

[0233] The mapping order of fragments within a layer,

[0234] The order in which the fragments within the layer are registered,

[0235] The order in which the fragments are arranged within a layer, or,

[0236] The order of the number of bits of the segments within a layer.

[0237] In some embodiments, the mapping order of the L segments is determined according to the layer index corresponding to each of the L segments and the segment index within the layer corresponding to each of the L segments.

[0238] In some embodiments, the fragment with a smaller layer index is located before the fragment with a larger layer index in the mapping order of the L fragments; and, for two fragments with the same layer index, the fragment with a smaller fragment index is located before the fragment with a larger fragment index in the mapping order of the L fragments.

[0239] In some embodiments, a fragment with a smaller fragment index precedes a fragment with a larger fragment index in the mapping order of the L fragments; and, for two fragments with the same fragment index, a fragment with a smaller layer index precedes the fragment with a larger layer index in the mapping order of the L fragments.

[0240] In some embodiments, the layer index of a layer satisfies a positive correlation with the transmit power corresponding to the layer.

[0241] In some embodiments, the layer index of a layer and the transmit power corresponding to the layer satisfy a negative correlation relationship.

[0242] In some embodiments, the segment index of the segment within the layer is determined based on registration information sent by the first communication node to the second communication node; or, the segment index of the segment within the layer is determined based on configuration information.

[0243] In some embodiments, the mapping order of the L segments is indicated by the second communication node to the first communication node.

[0244] In some embodiments, the mapping order of the L segments is indicated by the first communication node to the second communication node.

[0245] In some embodiments, the mapping order of L fragments includes a first part mapping order and a second part mapping order; wherein, the first part mapping order is the mapping order of the first P fragments in the mapping order of the L fragments; the second part mapping order is the mapping order of the last LP fragments in the mapping order of the L fragments, P is a positive integer, and P is less than L.

[0246] In some embodiments, the first partial mapping order is configured by the second communication node for the first communication node, and the second partial mapping order is indicated by the first communication node to the second communication node.

[0247] In some embodiments, the first partial mapping order is determined by preconfiguration, and the second partial mapping order is indicated by the first communication node to the second communication node.

[0248] In some embodiments, the first portion of the mapping order is determined by preconfiguration, and the second portion of the mapping order is configured by the second communication node for the first communication node.

[0249] In some embodiments, the first portion of the mapping order is indicated by configuration information, and the second portion of the mapping order is indicated by signaling different from the configuration information.

[0250] Figure 4 is a schematic diagram of the structure of a device for transmitting precoding matrix information applied to a second communication node, provided in an embodiment of the present disclosure. The device for transmitting precoding matrix information can perform the second communication node-related method in the method for transmitting precoding matrix information provided in the above method embodiment. As shown in Figure 4, the device for transmitting precoding matrix information includes a communication unit 401 and a processing unit 402.

[0251] The processing unit 402 is configured to instruct the communication unit 401 to send configuration information to the first communication node.

[0252] The processing unit 402 is further configured to instruct the communication unit 401 to receive K segments of the L segments of precoding matrix information sent by the first communication node, where L and K are both positive integers, and K is less than or equal to L.

[0253] In some embodiments, the K segments are the first K segments in the order in which the L segments are related.

[0254] In some embodiments, the arrangement order related to the L fragments includes any one of the following: the mapping order of the L fragments, the registration order of the L fragments, and the configuration order of the L fragments; wherein, the mapping order of the L fragments is the order in which the L fragments are mapped to the information sequence corresponding to the precoding matrix information; the registration order of the L fragments is the order in which the first communication node registers the L fragments to the second communication node; the configuration order of the L fragments is the order in which the L fragments are configured by the second communication node.

[0255] In some embodiments, the K segments are K segments in which the number of bits meets the requirement among the L segments.

[0256] In some embodiments, the K segments include: all or part of the segments corresponding to the Sth layer in the precoding matrix information, S is less than or equal to R, R is the rank of the precoding matrix, and both S and R are positive integers.

[0257] In some embodiments, the K segments include: all or part of the segments corresponding to Q layers in the precoding matrix information, where Q is less than or equal to R, R is the rank of the precoding matrix, and both Q and R are positive integers.

[0258] In some embodiments, the K segments are K segments determined from the I-th segment corresponding to each layer in the precoding matrix information, where I is a positive integer.

[0259] In some embodiments, the first fragment corresponding to a layer is determined based on an arrangement order of fragments within a layer; the arrangement order of fragments within a layer includes any one of the following:

[0260] The index order of the fragments within the layer,

[0261] The mapping order of fragments within a layer,

[0262] The order in which the fragments within the layer are registered,

[0263] The order in which the fragments are arranged within a layer, or,

[0264] The order of the number of bits of the segments within a layer.

[0265] In some embodiments, the K fragments are K fragments determined from the 1st fragment to the Ith fragment corresponding to each of the Q layers in the precoding matrix information, Q is less than or equal to R, R is the rank of the precoding matrix, and I, Q and R are all positive integers.

[0266] In some embodiments, based on the arrangement order of the fragments in a layer, the first to the first fragments corresponding to the layer are determined; the arrangement order of the fragments in the layer is any one of the following:

[0267] The index order of the fragments within the layer,

[0268] The mapping order of fragments within a layer,

[0269] The order in which the fragments within the layer are registered,

[0270] The order in which the fragments are arranged within a layer, or,

[0271] The order of the number of bits of the segments within a layer.

[0272] In some embodiments, the mapping order of the L segments is determined according to the layer index corresponding to each of the L segments and the segment index within the layer corresponding to each of the L segments.

[0273] In some embodiments, the fragment with a smaller layer index is located before the fragment with a larger layer index in the mapping order of the L fragments; and, for two fragments with the same layer index, the fragment with a smaller fragment index is located before the fragment with a larger fragment index in the mapping order of the L fragments.

[0274] In some embodiments, a fragment with a smaller fragment index precedes a fragment with a larger fragment index in the mapping order of the L fragments; and, for two fragments with the same fragment index, a fragment with a smaller layer index precedes the fragment with a larger layer index in the mapping order of the L fragments.

[0275] In some embodiments, the layer index of a layer satisfies a positive correlation with the transmit power corresponding to the layer.

[0276] In some embodiments, the layer index of a layer and the transmit power corresponding to the layer satisfy a negative correlation relationship.

[0277] In some embodiments, the segment index of the segment within the layer is determined based on registration information sent by the first communication node to the second communication node; or, the segment index of the segment within the layer is determined based on configuration information.

[0278] In some embodiments, the mapping order of the L segments is indicated by the second communication node to the first communication node.

[0279] In some embodiments, the mapping order of the L segments is indicated by the first communication node to the second communication node.

[0280] In some embodiments, the mapping order of L fragments includes a first part mapping order and a second part mapping order; wherein, the first part mapping order is the mapping order of the first P fragments in the mapping order of the L fragments; the second part mapping order is the mapping order of the last LP fragments in the mapping order of the L fragments, P is a positive integer, and P is less than L.

[0281] In some embodiments, the first partial mapping order is configured by the second communication node for the first communication node, and the second partial mapping order is indicated by the first communication node to the second communication node.

[0282] In some embodiments, the first partial mapping order is determined by preconfiguration, and the second partial mapping order is indicated by the first communication node to the second communication node.

[0283] In some embodiments, the first portion of the mapping order is determined by preconfiguration, and the second portion of the mapping order is configured by the second communication node for the first communication node.

[0284] In some embodiments, the first portion of the mapping order is indicated by configuration information, and the second portion of the mapping order is indicated by signaling different from the configuration information.

[0285] When the functions of the above-mentioned integrated modules are implemented in hardware, embodiments of the present disclosure provide another possible structure for the apparatus for transmitting precoding matrix information involved in the above-mentioned embodiments. As shown in Figure 5, the apparatus 50 for transmitting precoding matrix information includes: a processor 502 and a bus 504. According to some embodiments of the present disclosure, the apparatus for transmitting precoding matrix information may also include a memory 501; according to some embodiments of the present disclosure, the apparatus for transmitting precoding matrix information may also include a communication interface 503.

[0286] The processor 502 may be a logic block, module, or circuit that implements or executes the various examples described in conjunction with the embodiments of the present disclosure. The processor 502 may 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. The processor 502 may 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, etc.

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

[0288] The memory 501 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 that can be accessed by a computer, but is not limited thereto.

[0289] As a possible implementation, the memory 501 may exist independently of the processor 502. The memory 501 may be connected to the processor 502 via a bus 504 and used to store instructions or program codes. When the processor 502 calls and executes the instructions or program codes stored in the memory 501, the method for transmitting precoding matrix information provided in the embodiment of the present disclosure can be implemented.

[0290] In another possible implementation, the memory 501 may also be integrated with the processor 502 .

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

[0292] Some embodiments of the present disclosure provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium), which stores computer program instructions. When the computer program instructions are executed on a computer, the computer executes the method for transmitting precoding matrix information as described in any of the above embodiments.

[0293] Exemplarily, the computer-readable storage media may include, but are not limited to, magnetic storage devices (e.g., hard disks, floppy disks, or magnetic tapes), optical disks (e.g., compact disks (CDs), digital versatile disks (DVDs), etc.), smart cards, and flash memory devices (e.g., erasable programmable read-only memories (EPROMs), cards, sticks, or key drives, etc.). The various computer-readable storage media described in the present disclosure may represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and / or carrying instructions and / or data.

[0294] An embodiment of the present disclosure provides a computer program product comprising instructions. When the computer program product is run on a computer, the computer is enabled to execute the method for transmitting precoding matrix information as described in any one of the above embodiments.

[0295] 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 communication node, the method comprising: Receiving configuration information sent by the second communication node; According to the configuration information, K segments of the L segments of precoding matrix information are sent to the second communication node, where L and K are both positive integers, and K is less than or equal to L.

2. The method according to claim 1, wherein: The K segments are the first K segments in the arrangement order related to the L segments.

3. The method according to claim 2, wherein: The arrangement order related to the L fragments includes any one of the following items: a mapping order of the L fragments, a registration order of the L fragments, and a configuration order of the L fragments; wherein the mapping order of the L fragments is the order in which the L fragments are mapped to the information sequence corresponding to the precoding matrix information; the registration order of the L fragments is the order in which the first communication node registers the L fragments to the second communication node; and the configuration order of the L fragments is the order in which the L fragments are configured by the second communication node.

4. The method according to claim 1, further comprising: The K fragments are determined from the L fragments according to the number of bits corresponding to each of the L fragments.

5. The method according to claim 1, wherein: The K segments include: all or part of the segments corresponding to the Sth layer in the precoding matrix information, S is less than or equal to R, R is the rank of the precoding matrix, and S and R are both positive integers.

6. The method according to claim 1, wherein: The K fragments include: all or part of the fragments corresponding to Q layers in the precoding matrix information, Q is less than or equal to R, R is the rank of the precoding matrix, and Q and R are both positive integers.

7. The method according to claim 1, wherein: The K segments are K segments determined from the I-th segment corresponding to each layer in the precoding matrix information, where I is a positive integer.

8. The method according to claim 7, before sending the K fragments, the method further comprises: Based on an arrangement order of fragments in a layer, determining an Ith fragment corresponding to the layer; wherein the arrangement order of the fragments in the layer includes any one of the following: the index order of the fragments within the layer, the mapping order of the fragments within the layer, The order in which the fragments within the layer are registered, the order in which the fragments within the layer are arranged, or, The order of the number of bits of the fragments within the layer.

9. The method according to claim 1, wherein: The K fragments are K fragments determined from the 1st fragment to the Ith fragment corresponding to each of the Q layers in the precoding matrix information, Q is less than or equal to R, R is the rank of the precoding matrix, and I, Q and R are all positive integers.

10. The method according to claim 9, before sending the K fragments, the method further comprises: Based on the arrangement order of the fragments in a layer, the first fragment to the Ith fragment corresponding to the layer are determined; wherein the arrangement order of the fragments in the layer is any one of the following: the index order of the fragments within the layer, the mapping order of the fragments within the layer, The order in which the fragments within the layer are registered, the order in which the fragments within the layer are arranged, or, The order of the number of bits of the fragments within the layer.

11. The method according to claim 3, wherein: The mapping order of the L segments is determined according to the layer index corresponding to each of the L segments and the segment index in the layer corresponding to each of the L segments.

12. The method according to claim 11, wherein: The fragment with a smaller layer index is located before the fragment with a larger layer index in the mapping order of the L fragments; and, for two fragments with the same layer index, the fragment with a smaller fragment index is located before the fragment with a larger fragment index in the mapping order of the L fragments.

13. The method according to claim 11, wherein: The fragment with a smaller fragment index is located before the fragment with a larger fragment index in the mapping order of the L fragments; and, for two fragments with the same fragment index, the fragment with a smaller layer index is located before the fragment with a larger layer index in the mapping order of the L fragments.

14. The method according to claim 11, wherein: The layer index of a layer satisfies a positive correlation with the transmission power corresponding to the layer.

15. The method according to claim 11, wherein: The layer index of a layer and the transmission power corresponding to the layer satisfy a negative correlation relationship.

16. The method according to claim 11, wherein: The fragment index of a fragment among the L fragments within the layer is determined according to the registration information sent by the first communication node to the second communication node; or, the fragment index of a fragment among the L fragments within the layer is determined according to the configuration information.

17. The method according to claim 3, wherein: The mapping order of the L fragments is indicated by the second communication node to the first communication node.

18. The method according to claim 3, wherein: The mapping order of the L fragments is indicated by the first communication node to the second communication node.

19. The method according to claim 3, wherein: The mapping order of the L fragments includes a first part mapping order and a second part mapping order; wherein, the first part mapping order is the mapping order of the first P fragments in the mapping order of the L fragments; the second part mapping order is the mapping order of the last LP fragments in the mapping order of the L fragments, P is a positive integer, and P is less than L.

20. The method according to claim 19, wherein: The first part mapping order is configured by the second communication node for the first communication node, and the second part mapping order is indicated by the first communication node to the second communication node.

21. The method according to claim 19, wherein: The first part mapping order is determined by preconfiguration, and the second part mapping order is indicated by the first communication node to the second communication node.

22. The method according to claim 19, wherein: The first part mapping order is determined by pre-configuration, and the second part mapping order is configured by the second communication node for the first communication node.

23. The method according to claim 19, wherein: The first part mapping order is indicated by the configuration information, and the second part mapping order is indicated by signaling different from the configuration information.

24. A method for transmitting precoding matrix information, applied to a second communication node, the method comprising: Sending configuration information to the first communication node; Receive K fragments out of L fragments of precoding matrix information sent by the first communication node, where L and K are both positive integers, and K is less than or equal to L.

25. The method according to claim 24, wherein: The K segments are the first K segments in the arrangement order related to the L segments.

26. The method according to claim 25, wherein: The arrangement order related to the L fragments includes any one of the following items: a mapping order of the L fragments, a registration order of the L fragments, and a configuration order of the L fragments; wherein the mapping order of the L fragments is the order in which the L fragments are mapped to the information sequence corresponding to the precoding matrix information; the registration order of the L fragments is the order in which the first communication node registers the L fragments to the second communication node; and the configuration order of the L fragments is the order in which the L fragments are configured by the second communication node.

27. The method according to claim 24, wherein: The K fragments are K fragments whose bit numbers meet the requirement among the L fragments.

28. The method of claim 24, wherein: The K fragments include: all or part of the fragments corresponding to the Sth layer in the precoding matrix information, S is less than or equal to R, R is the rank of the precoding matrix, and S and R are both positive integers.

29. A transmission device for precoding matrix information, comprising: Memory and processor; Memory and processor coupling; 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-28 is performed.

30. A computer-readable storage medium, wherein: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a computer, the computer is enabled to perform the method according to any one of claims 1 to 28.

Images