Communication method and device

Abstract

The embodiment of the invention provides a communication method and device. The decoding end determines a first coding matrix; the first coding matrix is determined according to at least one received first signal and / or at least one acquired interference signal between a first time for determining the first coding matrix and a second time for determining the second coding matrix, the first signal comprises the interference signal, and the second coding matrix is a coding matrix determined before the first coding matrix. And the decoding end sends first information to the coding end, wherein the first information is used for indicating the first coding matrix. And the encoding end encodes a signal to be sent to the decoding end based on the first encoding matrix. According to the method, the decoding end determines the coding matrix once every a period of time and determines the coding matrix based on the interference signal, the coding matrix adopted by the coding end is variable and changes along with the interference of the surrounding environment, and compared with coding by using a factory fixed coding matrix, the decoding end can estimate the interference signal more accurately, and the coding efficiency is improved. And communication quality is improved.

Description

Communication method and device Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a communication method and device. Background Art

[0002] Interference is one of the main factors limiting the quality of wireless communications. The transmitter encodes the signal to be sent to the receiver using a coding matrix before transmitting it. The receiver removes the interference signal from the received signal and decodes the signal after the interference is removed using the decoding matrix corresponding to the coding matrix. The closer the estimated interference signal is to the actual interference signal, the closer the decoded signal is to the signal to be sent to the receiver, and the better the communication quality. The design of the coding matrix affects the accuracy of the interference signal estimation to a certain extent, and the coding matrix plays a key role in the quality of communication.

[0003] In current technology, for any communication scenario, the coding matrix used by the transmitter is fixed at the factory. However, changes in the surrounding environment will cause the interference signal to change accordingly. If the transmitter uses the factory-fixed coding matrix for encoding, the interference signal estimated by the receiver will be inaccurate, thus affecting the communication quality.

[0004] Summary of the Invention

[0005] The embodiments of the present application provide a communication method and apparatus for enabling a decoding end to more accurately estimate an interference signal and improve communication quality.

[0006] In a first aspect, an embodiment of the present application provides a communication method, which can be executed by a decoding end, or by other devices including decoding end functions, or by a chip system (or chip) or other functional module, which can implement the functions of the decoding end, and the chip system or functional module is, for example, provided in the decoding end. The method includes:

[0007] The decoding end determines a first coding matrix; the first coding matrix is ​​determined based on at least one first signal received and / or at least one interference signal acquired between a first time when the first coding matrix is ​​determined and a second time when a second coding matrix is ​​determined, wherein the first signal includes an interference signal, and the second coding matrix is ​​a coding matrix determined before the first coding matrix. The decoding end sends first information to the encoding end, where the first information is used to indicate the first coding matrix; the first coding matrix is ​​used by the encoding end to encode a signal to be sent to the decoding end based on the first coding matrix.

[0008] In this first aspect, the decoding end determines the coding matrix once every period of time, and determines the coding matrix based on the interference signal. The coding matrix used by the encoding end is variable and changes with the interference of the surrounding environment. Compared with using a factory-fixed coding matrix for encoding, the decoding end can more accurately estimate the interference signal and improve the communication quality.

[0009] In an optional embodiment, before the decoding end sends the first information to the encoding end, it also includes: the decoding end determines that a first condition is satisfied, and the first condition includes one or more of the following: determining that at least one interference signal based on which the first coding matrix is ​​based has changed compared to at least one interference signal based on which the second coding matrix is ​​based; determining that a periodic time point in a preset coding matrix sending period has been reached.

[0010] In this embodiment, after the interference signal changes, the encoding end and the decoding end communicate based on the coding matrix previously determined by the interference signal, which will cause the interference signal estimated by the decoding end to have a large error relative to the actual interference signal. In this case, the decoding end re-determines the coding matrix, and the encoding end and the decoding end communicate based on the new coding matrix, so that the interference signal estimated by the decoding end is closer to the actual interference signal. Alternatively, the decoding end periodically determines a new coding matrix and sends it to the encoding end for encoding, rather than having the encoding end use a fixed coding matrix for encoding. This allows the decoding end to more accurately estimate the interference signal and improve communication quality.

[0011] In an optional implementation, the elements in the first encoding matrix are complex numbers and / or real numbers.

[0012] In this embodiment, the encoding end and the decoding end are suitable for a scenario of simulated coded communication.

[0013] In an optional implementation, the at least one interference signal is determined according to signals respectively sent by K coding ends on the same resource, where K is an integer greater than or equal to 2.

[0014] In this embodiment, the encoding end and the decoding end are suitable for a communication scenario of air aggregation.

[0015] In an optional embodiment, the decoding end determines a first coding matrix, including: receiving at least one first signal between the first time and the second time; wherein the first signal is determined based on the signals sent by the K coding ends on the same resource, and each of the first signals includes the corresponding interference signal; removing the corresponding interference signal from the at least one first signal to obtain at least one second signal; decoding the at least one second signal based on the decoding matrix corresponding to the second coding matrix to obtain at least one third signal; determining the first coding matrix based on the principle of minimizing the error between the first reference value and the second reference value; wherein the first reference value is obtained based on the signals to be sent to the decoding end in the K coding ends corresponding to the at least one first signal, and the second reference value is obtained based on the at least one third signal.

[0016] In this embodiment, the first coding matrix is ​​determined based on the principle of minimizing the error between the first reference value and the second reference value. When the encoding end and the decoding end communicate based on the first coding matrix, the interference signal estimated by the decoding end can be closer to the actual interference signal.

[0017] In an optional embodiment, it also includes: the decoding end sends a transmission threshold vector to at least one of the K encoding ends respectively; wherein the transmission threshold vectors sent to the at least one encoding end are not exactly the same, and the transmission threshold vector includes N elements, N is an integer greater than or equal to 1, and N is the number of subcarriers that the encoding end can occupy to send a signal to the decoding end, and each element of the N elements is used to determine whether the encoding end sends a signal or not on the subcarrier corresponding to the element.

[0018] In an optional embodiment, before the decoding end sends the transmission threshold vector to at least one of the K encoding ends respectively, it also includes: determining that a second condition is satisfied, where the second condition includes one or more of the following: receiving a request for obtaining the transmission threshold vector from the at least one encoding end; and determining that a periodic time point in a preset transmission threshold vector sending period has been reached.

[0019] In this embodiment, the decoding end periodically determines a new transmission threshold vector and sends it to the encoding end, or determines a new transmission threshold vector after receiving a request and sends it to the encoding end, rather than allowing the encoding end to send signals with reference to a fixed transmission threshold vector. This allows the encoding end to send signals on more subcarriers, thereby improving communication quality.

[0020] In an optional embodiment, for any coding end, the nth element of the N elements in the transmission threshold vector sent to the coding end is determined based on the channel state information corresponding to the K coding ends when they occupy the N subcarriers and the transmission power threshold preset for the coding end, and n traverses any positive integer from 1 to N.

[0021] In this embodiment, the decoding end determines a transmission threshold vector at regular intervals and determines the transmission threshold vector based on channel state information. The transmission threshold vector referenced by the encoding end when sending a signal changes and changes with the channel state information of the surrounding environment. Compared with using a fixed transmission threshold vector to decide whether to send a signal, the encoding end can send signals on more subcarriers, thereby improving communication quality.

[0022] In a second aspect, an embodiment of the present application provides a communication method, which can be performed by an encoding end, or by other devices including the functions of the encoding end, or by a chip system (or, chip) or other functional module, which can implement the functions of the encoding end, and the chip system or functional module is, for example, provided in the encoding end. The method includes:

[0023] Receive first information from a decoding end, where the first information indicates a first coding matrix; wherein the first coding matrix is ​​determined by the decoding end based on at least one first signal received and / or at least one interference signal obtained between a first time of determining the first coding matrix and a second time of determining a second coding matrix, the first signal including the interference signal; and the second coding matrix is ​​a coding matrix determined before the first coding matrix. Then, encode and transmit a signal to be sent to the decoding end based on the first coding matrix.

[0024] In the second aspect, the decoding end determines the coding matrix once every period of time, and determines the coding matrix based on the interference signal. The coding matrix used by the encoding end is variable and changes with the interference of the surrounding environment. Compared with using a factory-fixed coding matrix for encoding, the decoding end can more accurately estimate the interference signal and improve the communication quality.

[0025] In an optional implementation, the elements in the first encoding matrix are complex numbers and / or real numbers.

[0026] In this embodiment, the encoding end and the decoding end are suitable for a scenario of simulated coded communication.

[0027] In an optional embodiment, it also includes: the encoding end receives a transmission threshold vector from the decoding end; wherein the transmission threshold vector includes N elements, N is an integer greater than or equal to 1, and N is the number of subcarriers that the encoding end can occupy to send signals to the decoding end, and each element of the N elements is used to determine whether the encoding end sends a signal or not on the subcarrier corresponding to the element; based on each element in the transmission threshold vector, the encoding end sends the encoded signal on the corresponding subcarrier allowed to send the signal.

[0028] In an optional implementation, before the encoding end receives the transmission threshold vector from the decoding end, the encoding end determines that the transmission power of the encoding end is greater than a set power threshold, and sends a request to the decoding end to obtain the transmission threshold vector.

[0029] In this embodiment, after receiving the request, the decoding end determines a new transmission threshold vector and sends it to the encoding end, instead of requiring the encoding end to send signals with reference to a fixed transmission threshold vector. This allows the encoding end to send signals on more subcarriers, thereby improving communication quality.

[0030] In a third aspect, an embodiment of the present application provides a communication method, which can be executed by a decoding end, or by other devices including decoding end functions, or by a chip system (or chip) or other functional module, which can implement the functions of the decoding end, and the chip system or functional module is, for example, provided in the decoding end. The method includes:

[0031] Determine a transmission threshold vector; send the transmission threshold vector to at least one of the K encoding ends respectively; wherein the transmission threshold vectors sent to the at least one encoding end are not completely the same, K is an integer greater than or equal to 1, the transmission threshold vector includes N elements, N is an integer greater than or equal to 1, N is the number of subcarriers that can be occupied by the encoding end to send a signal to the decoding end, and each element of the N elements is used to determine whether the encoding end sends a signal or not on the subcarrier corresponding to the element.

[0032] In an optional embodiment, before sending the transmission threshold vector to the encoding end, it also includes: determining that one or more of the following are satisfied: receiving a request for obtaining the transmission threshold vector from the at least one encoding end; and determining that a periodic time point in a preset transmission threshold vector sending period has been reached.

[0033] In this embodiment, the decoding end periodically determines a new transmission threshold vector and sends it to the encoding end, or determines a new transmission threshold vector after receiving a request and sends it to the encoding end, rather than allowing the encoding end to send signals with reference to a fixed transmission threshold vector. This allows the encoding end to send signals on more subcarriers, thereby improving communication quality.

[0034] In an optional embodiment, for any coding end, the value of the nth element of the N elements in the transmission threshold vector sent to the coding end is determined based on the channel state information corresponding to the K coding ends when they respectively occupy the N subcarriers and the transmission power threshold preset for the coding end, and n traverses any positive integer from 1 to N.

[0035] In this embodiment, the decoding end determines a transmission threshold vector at regular intervals and determines the transmission threshold vector based on channel state information. The transmission threshold vector referenced by the encoding end when sending a signal changes and changes with the channel state information of the surrounding environment. Compared with using a fixed transmission threshold vector to decide whether to send a signal, the encoding end can send signals on more subcarriers, thereby improving communication quality.

[0036] In a fourth aspect, an embodiment of the present application provides a communication method, which can be executed by an encoding end, or by other devices including encoding end functions, or by a chip system (or chip) or other functional module, which can implement the functions of the encoding end, and the chip system or functional module is, for example, provided in the encoding end. The method includes:

[0037] Receive a transmission threshold vector from a decoding end; wherein the transmission threshold vector includes N elements, where N is an integer greater than or equal to 1, and N is the number of subcarriers that can be occupied by the encoding end to send a signal to the decoding end; based on each element in the transmission threshold vector, determine whether to send a signal on the subcarrier corresponding to the element.

[0038] In an optional implementation, before receiving the transmission threshold vector from the decoding end, it is determined that the transmission power of the encoding end is greater than a set transmission power threshold, and a request for obtaining the transmission threshold vector is sent to the decoding end.

[0039] In this embodiment, the encoding end determines whether to request a new transmission threshold vector based on the transmission power. After receiving the request, the decoding end determines the new transmission threshold vector and sends it to the encoding end, rather than requiring the encoding end to refer to a fixed transmission threshold vector to send signals. This allows the encoding end to send signals on more subcarriers, thereby improving communication quality.

[0040] In a fifth aspect, a communication device is provided. The communication device may be the decoding end described in the first or third aspect. The communication device has the functions of the decoding end described above. The communication device may be, for example, a decoding end, or a larger device including a decoding end, or a functional module in the decoding end, such as a baseband device or a chip system. In one optional implementation, the communication device includes a baseband device and a radio frequency device. In another optional implementation, the communication device includes a processing unit (sometimes also referred to as a processing module) and a transceiver unit (sometimes also referred to as a transceiver module). The transceiver unit is capable of performing both transmitting and receiving functions. When the transceiver unit performs the transmitting function, it may be referred to as a transmitting unit (sometimes also referred to as a transmitting module); when the transceiver unit performs the receiving function, it may be referred to as a receiving unit (sometimes also referred to as a receiving module). The transmitting unit and the receiving unit may be the same functional module, which is referred to as a transceiver unit and is capable of performing both transmitting and receiving functions; alternatively, the transmitting unit and the receiving unit may be different functional modules, with the transceiver unit being a general term for these functional modules.

[0041] In an optional embodiment, the communication device also includes a storage unit (sometimes also referred to as a storage module), and the processing unit is used to couple with the storage unit and execute the program or instructions in the storage unit, enabling the communication device to perform the functions of the decoding end described in the first or third aspect above.

[0042] In a sixth aspect, a communication device is provided. The communication device may be the encoding end described in the second or fourth aspect. The communication device has the functions of the encoding end. The communication device may be, for example, an encoding end, or a larger device including an encoding end, or a functional module in the encoding end, such as a baseband device or a chip system. In one optional implementation, the communication device includes a baseband device and a radio frequency device. In another optional implementation, the communication device includes a processing unit (sometimes also referred to as a processing module) and a transceiver unit (sometimes also referred to as a transceiver module). The transceiver unit is capable of performing both transmitting and receiving functions. When the transceiver unit performs the transmitting function, it may be referred to as a transmitting unit (sometimes also referred to as a transmitting module); when the transceiver unit performs the receiving function, it may be referred to as a receiving unit (sometimes also referred to as a receiving module). The transmitting unit and the receiving unit may be the same functional module, which is referred to as a transceiver unit and is capable of performing both transmitting and receiving functions; alternatively, the transmitting unit and the receiving unit may be different functional modules, with the transceiver unit being a general term for these functional modules.

[0043] In an optional embodiment, the communication device also includes a storage unit (sometimes also referred to as a storage module), and the processing unit is used to couple with the storage unit and execute the program or instructions in the storage unit, enabling the communication device to perform the functions of the encoding end described in the second aspect or the fourth aspect above.

[0044] In a seventh aspect, a communication device is provided. The communication device may be a decoding end, or a chip or chip system used in a decoding end. The communication device includes a communication interface and a processor, and optionally, a memory. The memory is used to store a computer program. The processor is coupled to the memory and the communication interface. When the processor reads the computer program or instructions, the communication device executes the method performed by the decoding end in the above aspects.

[0045] In an eighth aspect, a communication device is provided. The communication device may be an encoding end, or a chip or chip system used in an encoding end. The communication device includes a communication interface and a processor, and optionally, a memory. The memory is used to store a computer program. The processor is coupled to the memory and the communication interface. When the processor reads the computer program or instructions, the communication device executes the method performed by the encoding end in the above aspects.

[0046] In a ninth aspect, a communication system is provided, comprising an encoding end and a decoding end, wherein the decoding end is configured to execute the methods described in the aforementioned aspects and the decoding end is configured to execute the methods described in the aforementioned aspects. For example, the decoding end may be implemented by the communication device described in the seventh aspect, and the encoding end may be implemented by the communication device described in the eighth aspect.

[0047] In a tenth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium is used to store computer programs or instructions, which, when executed, enable the methods described in the above aspects to be implemented.

[0048] According to an eleventh aspect, a computer program product comprising instructions is provided, which enables the methods described in the above aspects to be implemented when the computer program product is run on the computer.

[0049] In the twelfth aspect, a chip system is provided, comprising a processor and an interface, wherein the processor is used to call and execute instructions from the interface so that the chip system implements the above-mentioned methods. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] FIG1 is a schematic diagram of the architecture of a communication system provided by the present application;

[0051] FIG2 is a flow chart of a coding and decoding method provided by the present application;

[0052] FIG3 is a flow chart of a communication method provided by the present application;

[0053] FIG4 is a flow chart of a communication method provided by the present application;

[0054] FIG5 is a flow chart of a communication method provided by the present application;

[0055] FIG6 is a structural diagram of a communication device provided by the present application;

[0056] FIG7 is a structural diagram of a communication device provided in this application. DETAILED DESCRIPTION

[0057] Figure 1 is a schematic diagram of the architecture of a communication system used in an embodiment of the present application. The communication system 1000 shown in Figure 1 includes a wireless access network 100 and a core network 200. Optionally, the communication system 1000 also includes the Internet 300. The wireless access network 100 may include at least one network device (such as 110a and 110b in Figure 1) and may also include at least one terminal device (such as 120a-120j in Figure 1). The terminal device is wirelessly connected to the network device, and the network device is wirelessly or wiredly connected to the core network. The core network device and the network device may be independent and distinct physical devices, or the core network device's functions and the network device's logical functions may be integrated into the same physical device, or a single physical device may integrate some of the core network device's functions and some of the network device's functions. Terminal devices and network devices may be interconnected via wired or wireless connections. Figure 1 is merely a schematic diagram. The communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in Figure 1.

[0058] A network device is an access device that connects a terminal device to a communication system via wired or wireless means. A network device can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a fifth-generation (5G) mobile communication system, a next-generation base station in a sixth-generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a wireless fidelity (WiFi) system. It can also be a module or unit that performs some of the functions of a base station, such as a centralized unit (CU) or a distributed unit (DU). The CU here completes the functions of the radio resource control protocol and the packet data convergence protocol (PDCP) of the base station, and can also complete the function of the service data adaptation protocol (SDAP); the DU completes the functions of the radio link control layer and the medium access control (MAC) layer of the base station, and can also complete the functions of part of the physical layer or all of the physical layer. For the specific description of the above-mentioned protocol layers, please refer to the relevant technical specifications of the 3rd Generation Partnership Project (3GPP). The network device can be a macro base station (such as 110a in Figure 1), a micro base station or an indoor station (such as 110b in Figure 1), a relay node or a donor node, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the network device.

[0059] A terminal device is a device with wireless transceiver capabilities that can send signals to or receive signals from a network device. Terminal devices include but are not limited to terminal devices, terminals, user equipment (UE), mobile stations, mobile terminals, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, etc. The terminal device can specifically be a mobile phone, tablet computer, computer with wireless transceiver capabilities, wearable device, vehicle, aircraft, ship, robot, robotic arm, smart home device, etc. The embodiments of this application do not limit the specific technology and specific device form adopted by the terminal device.

[0060] Network devices and terminal devices can be fixed or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; they can also be deployed on aircraft, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of network devices and terminal devices.

[0061] The roles of network devices and terminal devices can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile network device. To terminal devices 120j accessing the wireless access network 100 via 120i, terminal device 120i is a network device. However, to network device 110a, 120i is a terminal device, meaning that communication between 110a and 120i occurs via a wireless air interface protocol. Of course, communication between 110a and 120i can also occur via an interface protocol between network devices. In this case, 120i is also a network device relative to 110a. Therefore, both network devices and terminal devices can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be referred to as communication devices with network device functionality, while 120a-120j in Figure 1 can be referred to as communication devices with terminal device functionality.

[0062] Network devices and terminal devices, network devices and network devices, and terminal devices and terminal devices can communicate through authorized spectrum, unauthorized spectrum, or both; can communicate through spectrum below 6 gigahertz (GHz), spectrum above 6 GHz, or spectrum below 6 GHz and spectrum above 6 GHz simultaneously. The embodiments of the present application do not limit the spectrum resources used for wireless communications.

[0063] In the embodiments of the present application, the functions of the network device may also be performed by a module (such as a chip) in the network device, or by a control subsystem that includes the network device functions. The control subsystem that includes the network device functions here may be a control center in the above-mentioned application scenarios such as smart grid, industrial control, smart transportation, and smart city. The functions of the terminal device may also be performed by a module (such as a chip or a modem) in the terminal device, or by a device that includes the terminal device functions.

[0064] In this application, a network device sends downlink signals or downlink information to a terminal device, and the downlink information is carried on a downlink channel. A terminal device sends uplink signals or uplink information to a network device, and the uplink information is carried on an uplink channel. To communicate with a network device, a terminal device needs to establish a wireless connection with a cell controlled by the network device. The cell with which a terminal device has established a wireless connection is called the serving cell of the terminal device.

[0065] Below, some terms or concepts in the embodiments of the present application are explained to facilitate understanding by those skilled in the art.

[0066] 1) In mathematics, a manifold is a space that partially exhibits the properties of Euclidean space, and the properties of the entire space can be described by the local properties of Euclidean space. Manifolds can be of arbitrary dimensions, smooth, piecewise smooth, or continuous, and finite or infinite dimensional. Manifolds can be studied using geometric and topological methods and possess a rich variety of properties and structures, including curvature, tangent space, tangent vectors, and the Riemannian metric.

[0067] 2) Probability distribution is a law that describes the probability of different possible outcomes in some experiments in the form of a mathematical function. Every random variable has a certain distribution. In this application, the random variable is the interference signal.

[0068] In a communication system, multiple terminal devices may be connected to the same network device, or they may be connected to different network devices. For example, in the communication system shown in Figure 1, terminal devices 120g and 120f are connected to network device 110b, and terminal devices 120a, 120b, 120c, and 120i are connected to network device 110a. When multiple terminal devices communicate with their respective connected network devices, if they send signals to their respective connected network devices using the same or similar resources, the multiple terminal devices may interfere with each other. In the communication system shown in Figure 1, if the terminal devices 120g and 120f send signals to the network device 110b on the same or similar resources, the terminal device 120g and the terminal device 120f will interfere with each other; if the terminal device 120g and the terminal device 120a send signals to the network devices 110a and 110b they are connected to on the same or similar resources, and if the network devices 110a and 110b are located close to each other, the terminal device 120g and the terminal device 120a will also interfere with each other.

[0069] In a communication system, the communicating parties transmit signals through encoding and decoding. Figure 2 illustrates a communication process using the encoder and decoder as examples. In one example, the encoder is a terminal device, and the decoder is another terminal device. In another example, the encoder is a terminal device, and the decoder is a network device. In another example, the encoder is a network device, and the decoder is a terminal device.

[0070] The encoder encodes signal x1, to be sent to the decoder, according to the coding matrix, generating signal u1. The encoder then sends signal u1 to the decoder. Due to channel interference, the decoder receives a signal other than signal u1. Instead, the decoder receives signal y, which includes the interference signal. The decoder estimates the interference signal within signal y and then removes the estimated interference signal from signal y to obtain signal u1. The closer the estimated interference signal is to the actual interference signal, the closer signals u2 and u1 are, and the closer signals x2 and x1 are, the better the communication quality between the encoder and decoder.

[0071] It can be seen that the design of the coding matrix affects the accuracy of estimating the interference signal to a certain extent. In view of this, in an embodiment of the present application, it is proposed that the decoding end determines the coding matrix once every period of time, and determines the coding matrix based on the interference signal. In this way, the coding matrix used by the encoding end is variable and changes with the interference of the surrounding environment. Compared with using a factory-fixed coding matrix for encoding, the decoding end can estimate the interference signal more accurately and improve the communication quality.

[0072] The technical solution provided in the embodiment of the present application can be applied to any application scenario in which communication is performed by encoding and decoding. For example, the method can be applied to the fourth generation mobile communication technology (the 4th generation, 4G) system (also known as the long term evolution (long term evolution, LTE) system), the 5G system (also known as the new radio (new radio, NR) system), or can also be applied to the next generation mobile communication system or other similar communication systems (such as the sixth generation mobile communication technology (the 6th generation, 6G) system), etc., without specific limitation. In addition, the technical solution provided in the embodiment of the present application can be applied to device-to-device (D2D) scenarios, such as NR-D2D scenarios, etc., or can be applied to V2X scenarios, such as NR-V2X scenarios, etc. For example, it can be used in the fields of intelligent driving, assisted driving, or intelligent connected vehicles. For another example, the technical solution provided in the embodiment of the present application can also be applied to factory manufacturing scenarios, etc.

[0073] In order to better describe the embodiments of the present application, the following describes the methods provided by the embodiments of the present application in conjunction with the accompanying drawings. Unless otherwise specified, the steps indicated by dotted lines in the accompanying drawings corresponding to the various embodiments of the present application are all optional steps.

[0074] The methods provided in each embodiment of the present application can be applied to the network architecture shown in Figures 1 and 2 or other network architectures. The encoding end involved in each embodiment of the present application can be a terminal device or a network device. The decoding end involved in each embodiment of the present application can be a terminal device or a network device. When applied to Figure 1, for example, the encoding end is 120i, or 120a, or 120b, or 120c, etc., and the decoding end is 110a; for another example, the encoding end is 120h or 120g, and the decoding end is 120f.

[0075] It should be noted that: in each embodiment of the present application, it is assumed that the encoding end encodes the signal to be sent to the decoding end and then sends it, the signal received by the decoding end is called the first signal, the signal after the decoding end removes the interference signal from the first signal is called the second signal, and the signal after the decoding end decodes the second signal based on the decoding matrix is ​​called the third signal.

[0076] FIG3 is a flow chart of a communication method provided in an embodiment of the present application.

[0077] The decoding end determines the coding matrix once at a certain interval. FIG3 illustrates the process in which the decoding end determines the coding matrix at any one time and sends it to the encoding end, and the encoding end encodes the signal based on the received latest coding matrix and sends it to the decoding end as an example.

[0078] Step 301: The decoding end determines a first coding matrix.

[0079] The first coding matrix can be determined based on at least one first signal received and / or at least one interference signal obtained between a first time and a second time, wherein the first time is a time for determining the first coding matrix, the second time is a time for determining the second coding matrix, the first signal includes an interference signal, and the second coding matrix is ​​a coding matrix determined before the first coding matrix, that is, the second time is earlier than the first time.

[0080] The at least one interference signal acquired by the decoding end between the first time and the second time may be at least one first signal received between the first time and the second time.

[0081] In one example, the second coding matrix may be the coding matrix most recently determined before the decoding end determines the first coding matrix; in another example, the second coding matrix may also be the coding matrix determined any time before the decoding end determines the first coding matrix.

[0082] In one possible implementation, between a first time and a second time, a decoding end may receive one or more first signals, and the decoding end may estimate an interference signal from the one or more first signals. In another possible implementation, between the first time and the second time, if the decoding end does not receive the first signal, the decoding end may receive an interference signal. Thus, the interference signal obtained by the decoding end between the first time and the second time can be an interference signal estimated from the first signal and / or one or more interference signals directly received between the first time and the second time.

[0083] When determining the first coding matrix, the decoding end may refer to all first signals received between the first time and the second time, or part of the first signals, or one first signal among all first signals, or all interference signals, or part of the interference signals, or one interference signal among all interference signals. For example, between the first time and the second time, the decoding end obtains 1000 interference signals. When determining the first coding matrix, the 1000 interference signals may be referred to, or 500 interference signals may be referred to. These 500 interference signals may be interference signals that conform to a certain rule among the 1000 interference signals, or may be interference signals that are later in time.

[0084] In one example, the elements in the coding matrix (eg, the first coding matrix, the second coding matrix) determined by the decoding end may be 0 and / or 1. In this example, the coding end and the decoding end are applicable to a scenario of digital coding communication.

[0085] In another example, the elements in the coding matrix (eg, the first coding matrix, the second coding matrix) determined by the decoding end may be real numbers and / or complex numbers. In this example, the coding end and the decoding end are suitable for a scenario of analog coded communication.

[0086] Step 302: The decoding end sends first information to the encoding end, and correspondingly, the encoding end receives the first information from the encoding end.

[0087] The first information is used to indicate the first coding matrix, and the first coding matrix is ​​used by the encoding end to encode the signal to be sent to the decoding end based on the first coding matrix.

[0088] Examples of the first information indicating the first encoding matrix include the following:

[0089] In one example, the first information includes a number corresponding to the first coding matrix. Indicating the first coding matrix by the number is simple and clear. The amount of information in the first information is small, which is beneficial to channel utilization.

[0090] In another example, the first information includes specific values ​​of elements in the first coding matrix.

[0091] In another example, the first information includes a change in the first decoding end relative to an element in the second coding matrix. In this way, if the coding end already knows the second coding matrix, the latest first coding matrix can be determined based on the change in the first decoding end relative to an element in the second coding matrix indicated by the first information. This also helps reduce the amount of information in the first information and improves channel utilization.

[0092] The decoding end can determine the coding matrix at any time. The decoding end can also indicate the coding matrix to the encoding end at any time. After determining the coding matrix, the decoding end can indicate it to the encoding end immediately, with a delay, or not at all. Furthermore, the decoding end can save the coding matrix and use it during retransmissions, eliminating the need to determine the coding matrix again during retransmissions and reducing computational complexity.

[0093] The following describes various possible triggering conditions for the decoder to determine the first encoding matrix:

[0094] Condition a1: at least one interference signal based on which the first coding matrix is ​​determined is changed compared to at least one interference signal based on which the second coding matrix is ​​determined.

[0095] The change in the interference signal can be understood as a change in the statistical characteristics of the interference signal, which include but are not limited to the clustering and sparsity of the interference signal on the subcarriers. For example, there is channel interference on subcarriers 1-3, no channel interference on subcarriers 4-20, and channel interference on subcarriers 21-25. Channel interference is concentrated on multiple adjacent subcarriers, for example, on subcarriers 1-3, or on subcarriers 21-25, reflecting the clustering of the interference signal on the subcarriers. The subcarriers between the channel interferences are far apart, for example, they are separated by subcarriers 4 to 20, reflecting the sparsity of the interference signal on the subcarriers.

[0096] Interference signals vary, including the following examples:

[0097] In one possible example, the distance between the first probability distribution and the second probability distribution is greater than a set threshold, the first probability distribution is the probability distribution obeyed by the at least one interference signal based on which the decoding end determines the second coding matrix, and the second probability distribution is the probability distribution obeyed by the at least one interference signal based on which the decoding end determines the second coding matrix. Exemplarily, the probability distribution obeyed by the interference signal can be understood as the probability of the value of the interference signal, for example, the probability that the interference signal takes a value of 0.1 is 10%, the probability that the interference signal takes a value of 0.2 is 11%, and so on.

[0098] In another possible example, at least one interference signal based on the first coding matrix is ​​input into a model to simulate a first value; at least one interference signal based on the second coding matrix is ​​input into the model to simulate a second value; and the absolute value of the difference between the first value and the second value is greater than a set threshold.

[0099] After the interference signal changes, the encoder and decoder communicate based on the coding matrix determined by the previous interference signal, which will cause the interference signal estimated by the decoder to have a large error relative to the actual interference signal. In this case, the decoder re-determines the coding matrix, and the encoder and decoder communicate based on the new coding matrix, which can make the interference signal estimated by the decoder closer to the actual interference signal.

[0100] Condition a2: It is determined that a period time point in a preset coding matrix determination period has been reached.

[0101] The decoding end can pre-set a coding matrix determination period. The decoding end periodically determines the coding matrix based on the stored period information. For example, the period is in milliseconds, such as 100 milliseconds or 500 milliseconds. When the decoding end determines that any time point within the preset coding matrix determination period has been reached, it determines a new coding matrix. The decoding end periodically determines a new coding matrix and sends it to the encoding end for encoding, rather than requiring the encoding end to use a fixed coding matrix for encoding. This allows the decoding end to more accurately estimate interference signals and improve communication quality.

[0102] The following describes various possible triggering conditions for the decoder to send the first information to the encoder:

[0103] Condition b1: The at least one interference signal based on which the first coding matrix is ​​determined is different from the at least one interference signal based on which the second coding matrix is ​​determined. For the relevant content of condition b1, reference may be made to the relevant content of condition a1 described above and will not be repeated here.

[0104] Condition b2: Determine that a period time point in a preset coding matrix sending period has arrived.

[0105] The decoding end can pre-set a coding matrix transmission period. The decoding end periodically transmits the coding matrix based on the stored period information. For example, the period is in milliseconds, such as 50 milliseconds or 150 milliseconds. When the decoding end determines that any time point within the preset coding matrix transmission period has been reached, it indicates the coding matrix to the decoding end. The decoding end periodically indicates a new coding matrix to the encoding end, rather than requiring the encoding end to use a fixed coding matrix for encoding. This allows the decoding end to more accurately estimate interference signals and improve communication quality.

[0106] Step 303: The encoding end encodes the signal to be sent to the decoding end based on the first encoding matrix.

[0107] Step 304: The encoding end sends the encoded signal to the decoding end.

[0108] When the encoding end sends the encoded signal to the decoding end, the encoded signal may also be subjected to one or more processing steps such as power amplification, modulation, and scrambling.

[0109] The decoding end determines the coding matrix at regular intervals and determines the coding matrix based on the interference signal. The coding matrix used by the encoding end when transmitting the signal is variable and changes with the interference of the surrounding environment. Compared with the encoding end using a factory-fixed coding matrix for encoding, the decoding end can more accurately estimate the interference signal and improve communication quality.

[0110] The embodiments of the present application can be applied to scenarios where a decoder communicates with a single encoder, or to scenarios where a decoder communicates with multiple encoders, for example, in an over-the-air aggregation scenario. Assume that the decoder communicates with K encoders, where K is an integer greater than or equal to 1.

[0111] When K is an integer greater than or equal to 2, in step 302: a possible example of the decoding end sending the first information to the encoding end is that the decoding end sends the first information to K encoding ends respectively, and the first coding matrix indicated by the decoding end to the K encoding ends is the same, that is, the K encoding ends use the same coding matrix to communicate with the decoding end.

[0112] When K is an integer greater than or equal to 2, in step 304, one possible example of the encoding end transmitting the encoded signal to the decoding end is that the K encoding ends each transmit the encoded signal to the encoding end over the same resource. Optionally, in step 301, the at least one interference signal used to determine the first coding matrix is ​​determined by the decoding end based on the signals transmitted by the K encoding ends each over the same resource. Similarly, the at least one interference signal used to determine the second coding matrix is ​​also determined based on the signals transmitted by the K encoding ends each over the same resource.

[0113] The same resources can be understood as the same time domain resources and / or the same frequency domain resources. The time domain resources can be time slots, subframes, symbols, etc., and the frequency domain resources can be N subcarriers, where N is an integer greater than or equal to 1.

[0114] Taking the kth encoding end sending a signal to the decoding end on N subcarriers as an example, the encoding end sending the encoded signal to the decoding end in step 304 is described in detail, and the value of k traverses any positive integer from 1 to K.

[0115] The kth encoder sends the encoded signal to the decoder based on the channel state information corresponding to each of the N subcarriers and the transmission threshold corresponding to each of the N subcarriers (the transmission threshold can also be replaced by a puncturing threshold). For example, the kth encoder determines whether to transmit or not transmit a signal on the nth subcarrier based on the channel state information corresponding to the nth subcarrier and the transmission threshold, where n can be any positive integer from 1 to N. The channel state information and transmission threshold can be sent by the decoder to the encoder.

[0116] Assume that the channel state information corresponding to the kth coding end occupying N subcarriers is h k , h k =[h k，1 , h k，2 ,…,h k，N ], h k，1 Indicates the channel state information corresponding to when the kth coding end occupies the first subcarrier, hk，N Indicates the channel state information corresponding to the kth coding end occupying the Nth subcarrier. Optionally, the channel state information value is a plural number. For the same coding end, the channel state information corresponding to different subcarriers may be different or the same. For the same subcarrier, the channel state information corresponding to different coding ends may be different or the same.

[0117] The transmission thresholds corresponding to N subcarriers are collectively referred to as the transmission threshold vector ζ k ,ζ k =[ζ k，1 ,ζ k，2 ,…,ζ k，N ], the transmission threshold vector includes N elements, where N is an integer greater than or equal to 1, and N is the number of subcarriers that the encoding end can occupy to send signals to the decoding end. For each subcarrier, the encoding end may or may not send a signal on the subcarrier. Each element in the N elements is used to determine whether the encoding end sends a signal or not on the subcarrier corresponding to the element. k，1 represents the transmission threshold corresponding to when the kth coding end occupies the first subcarrier, ζ k，N , represents the transmission threshold corresponding to when the kth code end occupies the Nth subcarrier. Optionally, the transmission threshold is a plural number. For the same code end, the transmission thresholds corresponding to different subcarriers may be different or the same. For the same subcarrier, the transmission thresholds corresponding to different code ends may be different or the same.

[0118] The following describes an example in which the kth coding end determines whether to transmit a signal or not on the nth subcarrier based on the channel state information corresponding to the nth subcarrier and the transmission threshold:

[0119] For example, when |h k，n | 2 <ζ k，n When , the kth encoding end does not transmit a signal on the nth subcarrier; the channel condition of the nth subcarrier is poor, and the decoding end cannot receive the signal due to signal fading, or the signal at the receiving end cannot be correctly parsed, so the encoding end does not send a signal on the nth subcarrier, which can save power consumption of the encoding end.

[0120] For example, when |h k，n | 2 ≥ζ k，n When , the kth coding end transmits a signal on the nth subcarrier. The signal transmitted by the coding end on the nth subcarrier is determined based on a signal obtained by the kth coding end encoding the signal to be sent to the decoding end based on the first coding matrix.

[0121] The following describes the process of transmitting signals on the nth subcarrier at the encoding end:

[0122] Assume that the signal to be sent to the decoding end from the kth encoding end is x k , x k The signal on N subcarriers is included, x k Written in matrix form as X k , X k The k-th encoding end encodes the signal to be sent to the decoding end based on the first encoding matrix, and the signal is u k , written in matrix form as U k , U k There are N elements in it.

[0123] In one example, the first coding matrix includes G1 and G2. Written in matrix form: U k =G1X k G2;

[0124] If the kth coding end transmits a signal on the nth subcarrier, the transmitted signal is signal The signal Based on the signal u k，n OK, u k，n is the signal u k The signal on the nth subcarrier in k The nth element in . This process can be understood as amplifying the power of the encoded signal before transmission. kn After power amplification, it becomes a signal

[0125] In one example, Among them, h k，n is the channel state information corresponding to when the kth coding end occupies the nth subcarrier, P u is a constant greater than 0, P u Based on the preset transmit power threshold P in the kth encoding end k，0 The transmit power thresholds preset in different encoding terminals may be the same or different.

[0126] K encoding ends send signals to the decoding end respectively on the same time-frequency resources. The decoding end receives an overall signal from the K encoding ends. The signals of the K encoding ends are inseparable.

[0127] The decoding end receives a first signal, assuming the first signal is y, and the first signal y is written in vector form as Y, where the vector Y includes N elements, representing signals received on N subcarriers respectively.

[0128] The decoding end removes the estimated interference signal from the first signal to obtain the second signal. Assume that the estimated interference signal is The second signal is but

[0129] The decoding end uses a decoding matrix corresponding to the encoding matrix used by the encoding end during encoding to decode the second signal to obtain a third signal.

[0130] Set, the third signal is In one example, in, G1 and G2 are encoding matrices and decoding matrices, that is, the encoding matrix and the decoding matrix are the same. H represents the conjugate transpose of the matrix, and -1 represents the inverse of the matrix.

[0131] The third signal It can be understood as the signal to be sent to the decoding end from the K encoding ends estimated by the decoding end (i.e., from x1 to x K ) or the sum or average or other combination of values, that is, or ∑ k x k The process of decoding the second signal using the decoding matrix to obtain the third signal at the decoding end can be understood as the process of signal reconstruction at the decoding end.

[0132] As shown in FIG4 , a flow chart of communication between a decoding end and K encoding ends is introduced.

[0133] The first encoder collects signal b1, pre-processes signal b1 to obtain signal x1 to be sent to the decoder, and encodes signal x1 based on the encoding matrix to obtain signal u1. For example, a product code encoder is used for encoding. For example, the encoding matrix includes G1 and G2. The encoding end is based on the transmission threshold vector ζ k Determine the subcarrier of the transmission signal, and then based on the channel state information h k Amplify the power of signal u1 to obtain signal Sending a signal Signal The signal is transmitted on the nth subcarrier The value of n is some or all positive integers from 1 to N.

[0134] The second encoder collects signal b2, pre-processes signal b2 to obtain signal x2 to be sent to the decoder, and encodes signal x2 based on the encoding matrix to obtain signal u2. For example, a product code encoder is used for encoding. For example, the encoding matrix includes G1 and G2. The encoding end is based on the transmission threshold vector ζ k Determine the subcarrier of the transmission signal, and then based on the channel state information h k The signal on the subcarrier is power amplified, and the signal u2 is power amplified to obtain the signal Sending a signal Signal The signal is transmitted on the nth subcarrier The value of n is some or all positive integers from 1 to N.

[0135] Similarly, the kth encoding end collects signal b k For signal b k After preprocessing, the signal x to be sent to the decoding end is obtained k , encode the signal based on the encoding matrix and obtain the signal u k For example, a product code encoder is used for encoding, for example, the encoding matrix includes G1 and G2, The encoding end is based on the transmission threshold vector ζ k Determine the subcarrier of the transmission signal, and then based on the channel state information h k For signal u k Power amplification to obtain signal Sending a signal Signal The signal is transmitted on the nth subcarrier The value of n is some or all positive integers from 1 to N.

[0136] The signals of the K encoding ends are waveform superpositioned and transmitted simultaneously over the same resource block. They pass through a channel with burse sparse impulsive interference, where there is channel noise and channel interference. The decoding end receives the first signal Remove the estimated interference signal from the first signal y Get the second signal Then, the decoding matrix is ​​used to decode the second signal to obtain the third signal in,

[0137] The following describes how to estimate the interference signal at the decoding end The process:

[0138] Step 1: The decoding end processes the received first signal y using a parity-check matrix to obtain observation data / matrix.

[0139] The check matrix is ​​orthogonal to the encoding matrix.

[0140] Setting, received signal Written in matrix form as Among them, the signal Written in matrix form as The interference signal e is written in matrix form as E, and the channel noise w is written in matrix form as W. e represents the real interference signal, Represents the interference signal estimated by the decoding end. X is from x1 to x K The sum, average or other combination of values.

[0141] The design requirement of the check matrix is ​​to satisfy the following: the check matrix multiplied by its corresponding encoding matrix is ​​0, that is, F1G1=0, F2G2=0.

[0142] In one example, the check matrix includes F1 and F2, G1 and F1 are orthogonal, G2 and F2 are orthogonal, and the measurement matrix includes V c and V r , V c =F1Y=F1E+F1W, V r =F2Y T =F2E T +F2W T .

[0143] Step 2: Estimate the interference signal based on the observed data / matrix and the pre-established interference model

[0144] For example, based on the observed data / matrix and the pre-established interference model, the variational Bayesian inference algorithm or related variants are used to estimate the interference signal.

[0145] The pre-established interference model may be any existing interference model. In order to estimate the interference signal more accurately and make the estimated interference signal closer to the real interference signal, the embodiment of the present application proposes a hierarchical modeling approach.

[0146] The interference signal of the present application is burst interference, which has sparsity and clustering. For example, there is channel interference on subcarriers 1-3, no channel interference on subcarriers 4-20, and channel interference on subcarriers 21-25. Channel interference is concentrated on multiple adjacent subcarriers, for example, on subcarriers 1-3, or on subcarriers 21-25, reflecting clustering. The subcarriers between channel interference are far apart, for example, they are separated by subcarriers 4 to 20, reflecting sparsity.

[0147] In one possible implementation, the model established based on the hierarchical modeling approach is:

[0148] The model is a probability model, where p represents the probability and e represents the interference signal; λ represents the inverse variance vector, and the length of λ is N (i.e., the number of subcarriers that the encoder can occupy when sending signals to the decoder), λ = [λ1, λ2, ..., λ n ]; s represents the support set vector of the interference signal, s=[s1,s2,…,s n ], the elements in vector s are either 0 or 1; p 10 and p 01 They represent the transition probability respectively, β0 is a parameter of the gamma distribution, and β0 can be understood as the average power of the interference signal on the subcarriers (less than or equal to N) of the signal transmitted by the encoding end (that is, it is identified to a certain extent). Represents the modeling of the prior distribution of the interference signal; represents the modeling of the inverse variance λ in the prior distribution; p(s; p 10 , p 01 ) represents the modeling of the burst sparsity of the interference signal. The vertical bars in e|λ and λ|s represent conditional probabilities. The comma in p(e, λ, s; ξ) connects the two events before and after, indicating the relationship with , and the probability of the two events before and after the comma occurring simultaneously. The semicolon represents the parameters to be estimated. The parameters to be estimated in this model include: ξ, β0, p 10 , p 01 , where ξ={β0,p 10 , p 01}.

[0149] The prior distribution of the interference signal is modeled as a multivariate complex Gaussian distribution, and each element generated according to the prior distribution of the interference signal (the element can be understood as the prior value of the interference signal) is uncorrelated. For example, in represents complex Gaussian distribution, diag(λ) -1 Represents the inverse matrix of the diagonal matrix determined by the vector (λ). The diagonal matrix determined by the vector (λ) means placing the N elements in the vector (λ) on the diagonal of an N*N matrix, that is, obtaining a diagonal matrix.

[0150] Each element in the inverse variance λ of the prior distribution is modeled as a mixture of gamma distributions, for example, where Gamma(·,·) represents the gamma distribution, s n is the nth element in the support set vector s; α0=1; β0∈ξ, β0 is a parameter that needs to be estimated / learned, and β0 can be understood as the average power of the interference signal on the subcarriers (less than or equal to N) of the signal transmitted by the encoding end (i.e., identified to a certain extent).

[0151] The interference support set vector s includes N elements, where the nth element is used to represent the state of the interference signal corresponding to the nth subcarrier, and the value of n is any positive integer from 1 to N. If there is interference on the nth subcarrier, the nth element is 1, and if there is no interference on the nth subcarrier, the nth element is 0. The burst sparsity of the interference signal is modeled by a Markov chain. For example,

[0152] The transition probability is:

[0153] The initial distribution is:

[0154] in, p 01 ∈ξ,p 10 ∈ξ,p 10 and p 01 is the parameter that needs to be estimated / learned, p 10 and p 01 represent the transition probabilities respectively.

[0155] s n-1 Indicates the state of the interference signal corresponding to the n-1th subcarrier, s n Indicates the state of the interference signal corresponding to the n-1th subcarrier.

[0156] The above formula means: n-1 When s is 0 or 1, nis the probability of interference or no interference (or taking the value of 1 or 0).

[0157] The following describes the principles for determining the encoding matrix at the decoding end:

[0158] When the decoding end determines the coding matrix, the goal is to minimize the distortion from the encoding end to the receiving end.

[0159] In one possible example, the coding matrix is ​​determined based on the principle of minimizing the error between the reference value a and the reference value b, wherein the reference value a is obtained based on the signal to be sent to the decoding end among the K encoding ends; and the reference value b is obtained based on the third signal decoded by the decoding end.

[0160] For example, the reference value a is the signal to be sent to the decoding end from the K encoding ends (ie, x1 to x K ), the reference value b is the third signal obtained by decoding at the decoding end.

[0161] For example, the error is the mean-squared error (MSE). The MSE is a measure of the difference between the predicted value and the true value. The closer the MSE is to 0, the smaller the difference between the predicted and true values. The true value is the reference value a, and the predicted value is the reference value b.

[0162] For another example, the error is the absolute value of the difference between the reference value a and the reference value b.

[0163] When determining the encoding matrix, the decoder also determines the parity check matrix. The parity check matrix is ​​orthogonal to the encoding matrix. For example, G1 and F1 are orthogonal, and G2 and F2 are orthogonal. The principles for determining the parity check matrix are the same as those for determining the decoding matrix.

[0164] Determining the encoding matrices G1 and G2 and the check matrices F1 and F2 is an optimization problem. A mathematical representation is as follows:

[0165] Subject to the constraints: Λ = {G1, F1, G2, F2,}.

[0166] D represents the total number of training samples, and the value of d is any positive integer from 1 to D. The encoding matrix is ​​on a manifold, for example, G1 is on a manifold, G2 is also on a manifold, M1 represents the dimension of the manifold where G1 is located, and M2 represents the dimension of the manifold where G2 is located.

[0167] By solving the above optimization problem, the encoding matrices G1 and G2 and the check matrices F1 and F2 can be determined.

[0168] If the encoding matrix is ​​a real matrix, then the transpose of the encoding matrix*the encoding matrix is ​​an identity matrix, for example, For a unit array, is a unit matrix. If the encoding matrix is ​​a complex matrix, then the conjugate transpose of the encoding matrix*encoding matrix is ​​a unit matrix, for example, For a unit array, Based on this requirement, the speed of determining the encoding matrix (such as G1 and G2) is faster and less complex.

[0169] In conjunction with the principles for determining the coding matrix described above, and the first coding matrix described in step 301, determined based on at least one first signal received and / or at least one interference signal acquired between a first time for determining the first coding matrix and a second time for determining the second coding matrix, the first signal includes the interference signal, and the second coding matrix is ​​a coding matrix determined before the first coding matrix. The following describes a possible principle for determining the first coding matrix at the decoding end in step 301:

[0170] The decoding end receives at least one first signal between a first time and a second time, each first signal including a corresponding interference signal. The first signal is determined based on signals transmitted by the K encoding ends on the same resource. The at least one first signal is the at least one first signal received between the first time of determining the first coding matrix and the second time of determining the second coding matrix described in step 301; or the at least one first signal corresponds one-to-one with at least one interference signal obtained between the first time of determining the first coding matrix and the second time of determining the second coding matrix described in step 301. The decoding end removes the corresponding interference signal from the at least one first signal to obtain at least one second signal. The decoding end decodes the at least one second signal based on a decoding matrix corresponding to the second coding matrix to obtain at least one third signal. The decoding end determines the first coding matrix based on the principle of minimizing the error between a first reference value and a second reference value, wherein the first reference value is obtained based on signals to be transmitted to the decoding end from the K encoding ends corresponding to the at least one first signal received by the decoding end between the first time and the second time; and the second reference value is obtained based on the at least one third signal.

[0171] For example, the signals to be sent to the decoding end from the K encoding ends corresponding to any first signal are x1 to x K For any first signal corresponding to the K encoding ends to be sent to the decoding end (ie, x1 to x K) calculates the average value, and then sums the average values ​​corresponding to at least one first signal to obtain a first reference value, and the second reference value is the sum of at least one third signal.

[0172] For example, the first reference value is the average value of the signals to be sent to the decoding end from the K encoding ends corresponding to at least one first signal, and the second reference value is the average value of at least one third signal. In any signal transmission, the signals to be sent to the decoding end from the K encoding ends are respectively x1 to x K , the decoding end obtains a third signal. Taking 10 signal transmissions as an example, the first reference value is x1 to x in the 10 signal transmissions. K The second reference value is the average value of 10 third signals.

[0173] Step 304 describes the following: Based on the channel state information corresponding to each of the N subcarriers and the transmission threshold corresponding to each of the N subcarriers (the transmission threshold can also be replaced by a puncturing threshold), the encoded signal is sent to the decoder. The transmission threshold corresponding to each of the N subcarriers used by the encoder is sent by the decoder to the encoder. The transmission threshold corresponding to the N subcarriers is collectively referred to as the transmission threshold vector ζ k ,ζ k =[ζ k，1 ,ζ k，2 ,…,ζ k，N ].

[0174] In one possible example, the decoding end determines a transmission threshold vector at regular intervals and sends the latest determined transmission threshold vector to the encoding end. The encoding end sends the encoded signal to the decoding end based on the received latest transmission threshold vector.

[0175] The transmission threshold vector includes N elements, where N is an integer greater than or equal to 1, and N is the number of subcarriers that the encoder can occupy to send signals to the decoder. For each subcarrier, the encoder may or may not send a signal on the subcarrier.

[0176] When the decoder sends the transmission threshold vector to the encoder, the decoder may send the transmission threshold vector to at least one of the K encoders, respectively, wherein the transmission threshold vectors sent to the at least one encoder are not completely the same. Accordingly, the encoder receives the transmission threshold vector from the decoder.

[0177] The decoding end can determine the transmission threshold vector at any time. The decoding end can also send the transmission threshold vector to the encoding end at any time. After determining the transmission threshold vector, the decoding end can send it to the encoding end immediately, with a delay, or without indicating it to the encoding end. Furthermore, the decoding end can save the transmission threshold vector and use it during retransmissions, eliminating the need to determine the transmission threshold vector again during retransmissions and reducing computational complexity.

[0178] The following describes various possible triggering conditions for the decoder to determine the transmission threshold vector:

[0179] Condition c1: It is determined that a period time point in a preset transmission threshold vector determination period has been reached.

[0180] The decoding end can pre-set a transmission threshold vector determination period (this period is generally set to the coherence time). The decoding end periodically determines the transmission threshold vector based on the stored period information. For example, the period is in milliseconds, such as 200 milliseconds, 300 milliseconds, etc. When the decoding end determines that any time point within the preset transmission threshold vector determination period has been reached, it determines a new transmission threshold vector. The decoding end periodically determines the new transmission threshold vector and sends it to the encoding end, rather than requiring the encoding end to refer to a fixed transmission threshold vector to transmit signals. This allows the encoding end to transmit signals on more subcarriers, improving communication quality.

[0181] When the decoding end determines that condition c1 is satisfied, the transmission threshold vectors may be re-determined for all or part of the K encoding ends. The transmission threshold vectors re-determined for all or part of the K encoding ends are not completely the same.

[0182] Condition c2: A request for obtaining a transmission threshold vector is received from the encoder.

[0183] For example, the kth coding end determines that its own transmission power is greater than the preset transmission power threshold P k，0, sends a request for obtaining a transmission threshold vector to the decoding end. In one example, after the decoding end receives the request for obtaining a transmission threshold vector from the k-th encoding end, it redetermines the transmission threshold vector for the k-th encoding end, and sends the redetermined transmission threshold vector for the k-th encoding end to the k-th encoding end. In another example, after the decoding end receives the request for obtaining a transmission threshold vector from the k-th encoding end, it redetermines the transmission threshold vector for K encoding ends, sends the redetermined transmission threshold vector for the k-th encoding end to the k-th encoding end, or sends the redetermined transmission threshold vector for the corresponding encoding end to some or all of the K encoding ends. When the decoding end determines that condition c2 is met, the decoding end redetermines the transmission threshold vector for the encoding end that sent the request for obtaining the transmission threshold vector, and may also redetermine the transmission threshold vector for all encoding ends. The decoding end may send the re-determined transmission threshold vector for the kth encoding end only to the kth encoding end, or may send the re-determined transmission threshold vector for each encoding end to all encoding ends. Alternatively, if the transmission threshold vector determined this time does not change much for a certain encoding end compared to the transmission threshold vector determined last time, it may not be necessary to send it to the encoding end.

[0184] For example, the kth coding end determines its own transmit power based on the current channel state information and the transmission threshold vector.

[0185] For example, the kth coding end determines the transmit power of the nth subcarrier based on the channel state information corresponding to the nth subcarrier; after determining the transmit power of N subcarriers, the kth coding end can determine the average value of the transmit power of N subcarriers, which is the transmit power of the kth coding end itself. For example, the transmit power of the nth subcarrier is the signal transmitted on the nth subcarrier. The square of, for example The square of h k，n It is the channel state information when the k-th coding end occupies the n-th subcarrier.

[0186] The following describes various possible triggering conditions for the decoder to send the transmission threshold vector to the encoder:

[0187] Condition d1: determining that a time point in a preset transmission threshold vector sending cycle is reached.

[0188] The decoding end may pre-set a transmission threshold vector transmission period (this period is generally set to the coherence time). The decoding end periodically sends the transmission threshold vector based on the stored period information. For example, the period is in milliseconds, such as 500 milliseconds, 30 milliseconds, etc. When the decoding end determines that any period time point in the preset transmission threshold vector transmission period has been reached, it sends a new transmission threshold vector to the encoding end.

[0189] When the decoding end determines that condition d1 is satisfied, the decoding end may send a new transmission threshold vector to all or some of the K encoding ends. The transmission threshold vectors of the signals sent to all or some of the K encoding ends are not completely the same.

[0190] Condition d2: A request for obtaining a transmission threshold vector is received from the encoder. For details about condition d2, refer to the details about condition c2 described above and will not be repeated here.

[0191] The following describes how the decoder determines the transmission threshold vector for the kth encoder:

[0192] The transmission threshold vector determined by the decoding end for the kth encoding end is based on the preset transmission power threshold for the kth encoding end (ie, the preset transmission power threshold P in the kth encoding end). k，0 ) and the channel state information corresponding to the K coding ends when they respectively occupy the N subcarriers. That is, the value of the nth element of the N elements in the transmission threshold vector is based on the channel state information corresponding to the K coding ends when they respectively occupy the N subcarriers and the preset transmission power threshold P in the kth coding end. k，0 The value of n is determined by traversing any positive integer from 1 to N. The transmit power thresholds preset in different encoding ends may be the same or different.

[0193] In a possible example, the transmission threshold vector determined by the decoding end for the kth encoding end is based on the preset transmission power threshold P in the kth encoding end. k，0 The channel state information corresponding to the K coding ends respectively occupying the N subcarriers measured most recently is determined.

[0194] The decoding end determines the transmission threshold vector at regular intervals and determines the transmission threshold vector based on the channel state information. The transmission threshold vector referenced by the encoding end when sending a signal is variable and changes with the channel state information of the surrounding environment. Compared with using a fixed transmission threshold vector to decide whether to send a signal, the encoding end can send signals on more subcarriers, thereby improving communication quality.

[0195] The principle for determining the transmission threshold vector at the decoding end is to maximize the probability of the coding end sending a signal on each subcarrier, or in other words, to maximize the number of coding ends sending signals on each subcarrier.

[0196] Determining the transmission threshold vector is an optimization problem, which can be expressed mathematically as follows:

[0197] Among them, a k，n represents the probability that the kth coding end sends a signal on the nth subcarrier, a0 represents the ratio of the number of coding ends that send signals on the nth subcarrier (the number is less than or equal to K) to K, and Ka0 represents the number of coding ends that send signals on the nth subcarrier (the number is less than or equal to K); the inequality in the above formula indicates that the transmission power of the kth coding end does not exceed the preset transmission power threshold P in the kth coding end. k，0 .

[0198] By solving the above optimization problem, the decoding end can determine the transmission threshold vector corresponding to each encoding end.

[0199] As shown in Figure 5, the communication diagram between the decoding end and the encoding end is introduced:

[0200] The decoding end estimates the interference signal And remove the estimated interference signal from the received signal y After that, decode it and get the decoded signal The decoding end periodically and / or event-triggeredly determines the coding matrix and indicates the new coding matrix G1, G2 to each coding end; the decoding end periodically and / or event-triggeredly determines the transmission threshold vector ζ k And send it to the encoding end; the decoding end also sends channel state information h to the encoding end k .

[0201] The encoding end receives the channel state information h from the decoding end k , encoding matrix and transmission threshold vector ζ k The encoder encodes the signal to be sent to the decoder based on the encoding matrix and sends it to the decoder; optionally, the encoder also decides whether to send a request to the decoder to obtain a transmission threshold vector.

[0202] It is understood that in order to implement the functions in the above embodiments, the encoding end and the decoding end include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily appreciate that, in conjunction with the units and method steps of the various examples described in the embodiments disclosed in this application, this application 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 manner driven by computer software depends on the specific application scenario and design constraints of the technical solution.

[0203] Figures 6 and 7 are schematic diagrams of the structures of possible communication devices provided in embodiments of the present application. These communication devices can be used to implement the functions of the decoding end or the encoding end in the above-mentioned method embodiments, thereby also achieving the beneficial effects possessed by the above-mentioned method embodiments. In the embodiments of the present application, the communication device can be one of the terminals 120a-120j as shown in Figure 1, or it can be the base station 110a or 110b as shown in Figure 1, or it can be a module (such as a chip) applied to the decoding end or the encoding end.

[0204] As shown in Figure 6, the communication device 600 includes a processing unit 610 and a transceiver unit 620. The communication device 600 is used to implement the functions of the decoding end or the encoding end in the method embodiments shown in Figures 3, 4 and 5 above.

[0205] When the communication device 600 is used to implement the function of the decoding end in the method embodiment shown in Figure 3: the transceiver unit 620 is used to send the first information and receive the signal from the encoding end; the processing unit 610 is used to determine the first coding matrix and generate the first information.

[0206] When the communication device 600 is used to implement the functions of the encoding end in the method embodiment shown in Figure 3: the transceiver unit 620 is used to receive the first information and send the encoded signal to the decoding end; the processing unit 610 is used to parse the first coding matrix from the first information and encode the signal to be sent to the decoding end based on the first coding matrix.

[0207] A more detailed description of the processing unit 610 and the transceiver unit 620 can be directly obtained by referring to the relevant description in the method embodiment shown in Figure 3, and will not be repeated here.

[0208] As shown in Figure 7, communication device 700 includes a processor 710 and an interface circuit 720. Processor 710 and interface circuit 720 are coupled to each other. It will be appreciated that interface circuit 720 may be a transceiver or an input / output interface. Optionally, communication device 700 may further include a memory 730 for storing instructions executed by processor 710, input data required by processor 710 to execute instructions, or data generated after processor 710 executes instructions.

[0209] The communication device 700 is used to implement the functions of the decoding end or the encoding end in the method embodiments shown in FIG. 3 , FIG. 4 and FIG. 5 .

[0210] When the communication device 700 is used to implement the method shown in FIG. 3 , the processor 710 is used to implement the functions of the processing unit 610 , and the interface circuit 720 is used to implement the functions of the transceiver unit 620 .

[0211] When the communication device is a chip used in a decoder, the decoder chip implements the functions of the decoder in the above method embodiments. The decoder chip receives information from other modules in the decoder (e.g., a radio frequency module or antenna), which is sent from the encoder to the decoder; or the decoder chip sends information to other modules in the decoder (e.g., a radio frequency module or antenna), which is sent from the decoder to the encoder.

[0212] When the above-mentioned communication device is a module applied to the encoding end, the encoding end module implements the functions of the encoding end in the above-mentioned method embodiment. The encoding end module receives information from other modules in the encoding end (such as a radio frequency module or an antenna), and the information is sent from the decoding end to the encoding end; or, the encoding end module sends information to other modules in the encoding end (such as a radio frequency module or an antenna), and the information is sent from the encoding end to the decoding end. The encoding end module here can be the baseband chip of the encoding end, or it can be a DU or other module. The DU here can be a DU under the open radio access network (O-RAN) architecture.

[0213] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0214] The present application also provides a computer-readable storage medium storing a computer program, which, when executed by a computer, enables the computer to perform the above-mentioned communication method. In other words, the computer program includes instructions for implementing the above-mentioned communication.

[0215] An embodiment of the present application further provides a computer program product, including: computer program code, which, when executed on a computer, enables the computer to execute the communication method provided above.

[0216] An embodiment of the present application further provides a communication system, which includes: a decoding end and an encoding end for executing the above-mentioned communication method.

[0217] The method steps in the embodiments of the present application can be implemented by hardware or by a processor executing software instructions. The software instructions can be composed of corresponding software modules, and the software modules can be stored in a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an erasable programmable read-only memory, an electrically erasable programmable read-only memory, a register, a hard disk, a mobile hard disk, a CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in a base station or a terminal. Of course, the processor and the storage medium can also exist in a base station or a terminal as discrete components.

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

[0219] In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0220] In the embodiments of the present application, the number of nouns, unless otherwise specified, means "singular noun or plural noun", that is, "one or more". "At least one" means one or more, and "plural" means two or more. "And / or" describes the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A or B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. For example, A / B means: A or B. "At least one of the following items" or "one or more of them" and other similar expressions refer to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b, or c, or one or more of a, b, or c, means: a, b, c, a and b, a and c, b and c, or a and b and c. Each of a, b, and c can be single or multiple.

[0221] The ordinal numbers "first" and "second" mentioned in the embodiments of this application are used to distinguish multiple objects and are not used to limit the size, content, order, timing, priority, or importance of multiple objects. Moreover, such names do not indicate differences in the content, sender / receiver, transmission order, size, application scenario, priority, or importance of the two pieces of information. In addition, the numbering of the steps in the various embodiments introduced in this application is only for distinguishing different steps and is not used to define the order of the steps.

Claims

1. A communication method, characterized in that: Applied to the decoding end, including: Determine a first coding matrix; the first coding matrix is ​​determined according to at least one first signal received between a first time for determining the first coding matrix and a second time for determining the second coding matrix and / or at least one interference signal acquired, the first signal includes an interference signal, and the second coding matrix is ​​a coding matrix determined before the first coding matrix; First information is sent to an encoding end, where the first information is used to indicate the first encoding matrix; wherein the first encoding matrix is ​​used by the encoding end to encode a signal to be sent to the decoding end based on the first encoding matrix.

2. The method according to claim 1, characterized in that Before sending the first information to the encoding end, the method further includes: Determine that a first condition is met, where the first condition includes one or more of the following: At least one interference signal based on which the first coding matrix is ​​determined changes compared to at least one interference signal based on which the second coding matrix is ​​determined; It is determined that a period time point in a preset coding matrix sending period has arrived.

3. The method according to claim 1 or 2, characterized in that The elements in the first encoding matrix are complex numbers and / or real numbers.

4. The method according to any one of claims 1 to 3, characterized in that: The at least one interference signal is determined according to signals respectively sent by K coding ends on the same resource, where K is an integer greater than or equal to 2.

5. The method according to claim 4, characterized in that The determining of the first encoding matrix comprises: receiving at least one first signal between the first time and the second time, each of the first signals including the corresponding interference signal; wherein the first signal is determined according to the signals respectively sent by the K encoding ends on the same resource; Removing the corresponding interference signal from the at least one first signal respectively to obtain at least one second signal; Based on a decoding matrix corresponding to the second encoding matrix, respectively decode the at least one second signal to obtain at least one third signal; The first coding matrix is ​​determined based on the principle of minimizing the error between the first reference value and the second reference value; wherein the first reference value is obtained according to the signals to be sent to the decoding end among the K encoding ends corresponding to the at least one first signal, and the second reference value is obtained based on the at least one third signal.

6. The method according to claim 4 or 5, characterized in that Also includes: A transmission threshold vector is sent to at least one of the K encoding ends respectively; wherein the transmission threshold vectors sent to the at least one encoding end respectively are not completely the same, and the transmission threshold vector includes N elements, where N is an integer greater than or equal to 1, and N is the number of subcarriers that can be occupied by the encoding end to send signals to the decoding end, and each element of the N elements is used to determine whether the encoding end sends a signal or not on the subcarrier corresponding to the element.

7. The method according to claim 6, characterized in that Before sending the transmission threshold vector to at least one of the K encoding ends respectively, the method further includes: Determine that a second condition is met, where the second condition includes one or more of the following: receiving a request for obtaining a transmission threshold vector from the at least one encoding end; A period time point in a vector sending period at which a preset transmission threshold is reached is determined.

8. The method according to claim 6 or 7, characterized in that For any coding end, the nth element of the N elements in the transmission threshold vector sent to the coding end is determined based on the channel state information corresponding to the K coding ends when they occupy N subcarriers and the transmission power threshold preset for the coding end, and n traverses any positive integer from 1 to N.

9. A communication method, characterized in that: Applied to the encoding end, including: receiving first information from a decoding end, where the first information is used to indicate a first coding matrix; wherein the first coding matrix is ​​determined by the decoding end according to at least one first signal received between a first time for determining the first coding matrix and a second time for determining a second coding matrix and / or at least one interference signal acquired, the first signal includes an interference signal, and the second coding matrix is ​​a coding matrix determined before the first coding matrix; The signal to be sent to the decoding end is encoded based on the first encoding matrix and sent.

10. The method according to claim 9, characterized in that The elements in the first encoding matrix are complex numbers and / or real numbers.

11. The method according to claim 9 or 10, characterized in that Also includes: receiving a transmission threshold vector from the decoding end; wherein the transmission threshold vector includes N elements, wherein N is an integer greater than or equal to 1, wherein N is the number of subcarriers that the encoding end can occupy when sending a signal to the decoding end, and wherein the N elements Each element in the elements is used to determine whether the encoding end sends a signal or not sends a signal on the subcarrier corresponding to the element; Sending the encoded signal to the decoding end includes: Based on each element in the transmission threshold vector, the encoded signal is transmitted on the corresponding subcarrier that is allowed to transmit the signal.

12. The method according to claim 11, characterized in that Before receiving the transmission threshold vector from the decoding end, the method further includes: It is determined that the transmission power of the encoding end is greater than a set power threshold, and a request for obtaining the transmission threshold vector is sent to the decoding end.

13. A communication method, characterized in that: Applied to the decoding end, including: determining a transmission threshold vector; A transmission threshold vector is sent to at least one of the K encoding ends respectively; wherein K is an integer greater than or equal to 1, and the transmission threshold vectors sent to the at least one encoding end are not completely the same, and the transmission threshold vector includes N elements, N is an integer greater than or equal to 1, and N is the number of subcarriers that can be occupied by the encoding end to send a signal to the decoding end, and each element of the N elements is used to determine whether the encoding end sends a signal or not on the subcarrier corresponding to the element.

14. The method according to claim 13, characterized in that Before sending the transmission threshold vector to the encoder, the following steps are also included: receiving a request for obtaining a transmission threshold vector from the at least one encoding end; or A period time point in a vector sending period at which a preset transmission threshold is reached is determined.

15. The method according to claim 13 or 14, characterized in that For any coding end, the nth element of the N elements in the transmission threshold vector sent to the coding end is determined based on the channel state information corresponding to the K coding ends when they occupy N subcarriers and the transmission power threshold preset for the coding end, and n traverses any positive integer from 1 to N.

16. A communication method, characterized in that: Applied to the encoding end, including: Receive a transmission threshold vector from a decoding end; wherein the transmission threshold vector includes N elements, N is an integer greater than or equal to 1, N is the number of subcarriers that can be occupied by the encoding end to send a signal to the decoding end, and each element of the N elements is used to determine whether the encoding end sends a signal or not on a subcarrier corresponding to the element; Based on each element in the transmission threshold vector, a signal is transmitted or not transmitted on a corresponding subcarrier where the signal is allowed to be transmitted.

17. The method according to claim 16, characterized in that Before receiving the transmission threshold vector from the decoding end, it also includes: It is determined that the transmission power of the encoding end is greater than a set transmission power threshold, and a request for obtaining a transmission threshold vector is sent to the decoding end.

18. A communication device, characterized in that: Comprising means for performing the method as claimed in any one of claims 1 to 17.

19. A communication device, characterized in that: It includes a processor and an interface circuit, wherein the interface circuit is used to receive signals from other communication devices outside the communication device and transmit them to the processor or send signals from the processor to other communication devices outside the communication device, and the processor is used to implement the method as described in any one of claims 1 to 17 through a logic circuit or executing code instructions.

20. A computer-readable storage medium, characterized in that: The storage medium stores a computer program or an instruction, and when the computer program or the instruction is executed by the communication device, the method according to any one of claims 1 to 17 is implemented.

Images