Communication method, and apparatus

Abstract

Provided in the present application are a communication method, and an apparatus. A coding end divides an information block to be sent into C information blocks, and separately codes same; and a decoding end separately decodes the C code blocks, C being determined on the basis of a decoding complexity upper limit value supported by the decoding end. The decoding complexity upper limit value supported by the decoding end can determine the decoding accuracy of the decoding end; when decoding a certain code block, if the complexity does not exceed the decoding complexity upper limit value, the decoding end can decode the code block correctly; and if the complexity exceeds the decoding complexity upper limit value, the decoding accuracy decreases. The decoding complexity for decoding each code block among the C code blocks does not exceed the decoding complexity upper limit value, thereby improving the decoding accuracy of data transmitted this time.

Description

Communication method and apparatus

[0001] Cross-reference to Related Applications

[0002] This application claims priority to the Chinese Patent Application No. 202410848599.8, filed on June 26, 2024, and entitled "A Communication Method and Apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0003] The present application relates to the field of communication technology, and in particular to a communication method and apparatus. BACKGROUND

[0004] In the field of communication technology, the reliability of data transmission is crucial. When there is data to be transmitted, the sending end (such as a terminal device, a base station, etc.) encodes and modulates the data to be transmitted and sends it out. The receiving end (such as a terminal device, a base station, etc.) receives the modulated signal and performs demodulation and decoding to recover the data to be transmitted. When decoding, the length of the code block affects the accuracy of the decoding. When the code block to be decoded is too long, the decoding complexity of the code block increases, the decoding accuracy decreases, and the transmission reliability deteriorates. SUMMARY

[0005] Embodiments of the present application provide a communication method and apparatus for improving decoding accuracy.

[0006] In a first aspect, the present application provides a communication method, which can be executed by an encoding end, or by other devices including the function of the encoding end, or by a chip system (which can also be replaced by a chip) or other functional modules, which can realize the function of the encoding end, such as being arranged in the encoding end. The encoding end can be a network device or a terminal device. The method comprises: generating a first message and sending the first message; the first message comprises C code blocks, C is determined according to the upper limit value of decoding complexity supported by the decoding end, the decoding complexity of decoding each code block in the C code blocks does not exceed the upper limit value of decoding complexity, and C is an integer greater than or equal to 1.

[0007] In this embodiment, the upper limit of the decoding complexity supported by the decoding end can determine the decoding accuracy of the decoding end. If the complexity of the decoding end when decoding a certain code block does not exceed the upper limit of the decoding complexity, the code block can be decoded correctly. If the complexity exceeds the upper limit of the decoding complexity, the decoding accuracy decreases (not necessarily decoding error). The number of segments C is determined based on the upper limit of the decoding complexity supported by the decoding end. The decoding complexity of decoding each of the C code blocks does not exceed the upper limit of the decoding complexity, which can improve the decoding accuracy of the data transmitted this time.

[0008] In a possible implementation, when the decoding end adopts a random noise guessing decoding (GRAND) method for decoding, the C is specifically determined according to the upper limit of the decoding complexity, the length of the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND method; the C code blocks are obtained by dividing the first information block into C second information blocks and encoding each second information block.

[0009] In this implementation, the number of segments C is determined according to the upper limit of the decoding complexity and the maximum flipping order, which can make the determined number of segments C more accurate.

[0010] In a possible implementation, when the decoding end adopts a random noise guessing decoding (GRAND) method for decoding, the C is specifically determined according to the upper limit of the decoding complexity, the length of the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND method; the C code blocks are obtained by dividing the first information block into C second information blocks and encoding each second information block.

[0011] In this implementation, the number of segments C is determined according to the upper limit of the decoding complexity and the maximum flipping order, which can make the determined number of segments C more accurate.

[0012] In a possible implementation, the upper limit of the decoding complexity includes an upper limit of the number of test error patterns.

[0013] In a possible implementation, the C is determined according to the upper limit of the first decoding length supported by the decoding end and the length of the first information block to be transmitted; the upper limit of the first decoding length is determined based on the upper limit of the decoding complexity; and the C code blocks are obtained by dividing the first information block into C second information blocks and encoding each second information block.

[0014] In this implementation, the number of segments C is determined according to the first coding length upper limit value, and the process is simple.

[0015] In a possible implementation, the C is determined according to a second coding length upper limit value supported by the decoding end and an encoding bit length of a transmission resource carrying the first information block, a total length of the C code blocks is the encoding bit length of the transmission resource, the second coding length upper limit value is determined based on the coding complexity upper limit value, and the C code blocks are obtained by dividing the first information block into C second information blocks and encoding each second information block.

[0016] In this implementation, the number of segments C is determined according to the first coding length upper limit value, and the process is simple.

[0017] In a possible implementation, the length of the first information block is M, the M is an integer greater than or equal to 1, C*F is less than M, the length of C-1 second information blocks in the C second information blocks is F, and the length of one second information block is M-F*(C-1).

[0018] In this implementation, the remaining bits are placed in one second information block, and only the length of the one second information block is increased. If the lengths of all the code blocks are the same, only the code rate (code rate is the length of payload bits / code length) of one code block is increased, and the code rates of the remaining C-1 code blocks are not increased, which can improve the block error rate (block error rate, BLER) performance of the code block level (CB).

[0019] In a possible implementation, the length of the first information block is M, the M is an integer greater than or equal to 1, C*F is less than M, the length of C-h second information blocks in the C second information blocks is F, and the length of h second information blocks is F+1, the h is an integer greater than 1.

[0020] In this implementation, the remaining bits are placed in multiple second information blocks, and the lengths of the multiple second information blocks are increased. If the lengths of all the code blocks are the same, the code rate jitter on each code block can be smoothed, and the code rate of a certain code block is prevented from suddenly increasing, thereby improving the BLER performance of the transport block level.

[0021] In a possible implementation, the encoding end can also receive a first indication, and the first indication is used to indicate the C. In this implementation, the C is determined by the decoding end and informed to the encoding end, and the workload of the encoding end can be simplified.

[0022] In a possible implementation, when the decoding end adopts the GRAND decoding mode using random noise guess, the encoding end can further receive a second indication, the second indication being used to indicate the decoding complexity upper limit value and the maximum flipping order corresponding to the GRAND mode; the encoding end determines the C according to the decoding complexity upper limit value, the length of the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND mode, or the encoding end determines the C according to the decoding complexity upper limit value, the length of the encoding bits of the transmission resource carrying the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND mode.

[0023] In a possible implementation, the determination manner of the C includes: performing the following operation in a loop until the complexity of decoding any code block in the C code blocks does not exceed the decoding complexity upper limit value, and taking the last obtained C as the final C:

[0024] obtaining C code blocks, the C code blocks being obtained based on the C and the first length, the first length being the length of the first information block to be transmitted or the length of the encoding bits corresponding to the transmission resource; determining, based on the maximum flipping order, whether the complexity of decoding any code block in the C code blocks does not exceed the decoding complexity upper limit value; if not, obtaining an updated C based on the manner of C plus 1.

[0025] In this implementation, the iterative manner is adopted to gradually approach the decoding complexity upper limit value, so that the determined C is more accurate, which can meet the requirement of decoding complexity and will not cause loss of encoding gain due to too short of each segment.

[0026] In a second aspect, the present application provides a communication method, which can be executed by a decoding end, or by other devices including the function of the decoding end, or by a chip system (which can also be replaced by a chip) or other functional modules, which can realize the function of the decoding end, for example, is arranged in the decoding end. The decoding end can be a network device or a terminal device. The method includes: receiving a first message; the first message includes C code blocks; decoding each code block in the C code blocks; the C is determined according to the decoding complexity upper limit value supported by the decoding end, the decoding complexity of decoding each code block in the C code blocks does not exceed the decoding complexity upper limit value, and the C is an integer greater than or equal to 1.

[0027] In this embodiment, the upper limit of decoding complexity supported by the decoding end can determine the decoding accuracy of the decoding end; if the decoding complexity does not exceed the upper limit of decoding complexity when the decoding end decodes a certain code block, the code block can be decoded correctly; if the decoding complexity exceeds the upper limit of decoding complexity, the decoding accuracy decreases (not necessarily decoding error). The number C of segments is determined based on the upper limit of decoding complexity supported by the decoding end, and the decoding complexity of decoding each code block in the C code blocks does not exceed the upper limit of decoding complexity, which can improve the decoding accuracy of the data transmitted this time.

[0028] In a possible implementation, when the decoding end decodes each code block in the C code blocks, specifically, the decoding end can decode each code block in the C code blocks by using a random noise guessing decoding GRAND method; wherein the C is specifically determined according to the upper limit of decoding complexity, the length of the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND method; or the C is specifically determined according to the upper limit of decoding complexity, the encoding bit length of the transmission resource carrying the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND method, and the total length of the C code blocks is the encoding bit length of the transmission resource.

[0029] In a possible implementation, the upper limit of decoding complexity includes an upper limit of the number of test error patterns.

[0030] In a possible implementation, the C is determined according to the upper limit of the first decoding length supported by the decoding end and the length of the first information block to be transmitted by the encoding end; and the upper limit of the first decoding length is determined based on the upper limit of decoding complexity.

[0031] In a possible implementation, the C is determined according to the upper limit of the second decoding length supported by the decoding end and the encoding bit length of the transmission resource carrying the first information block to be transmitted; the upper limit of the second decoding length is determined based on the upper limit of decoding complexity; and the total length of the C code blocks is the encoding bit length of the transmission resource.

[0032] In a possible implementation, the decoding end can also send a first indication, and the first indication is used to indicate the C.

[0033] In a possible implementation, the decoding end can also send a second indication, and the second indication is used to indicate the upper limit of decoding complexity and the maximum flipping order corresponding to the GRAND method.

[0034] For example, the upper limit of decoding complexity and the maximum flipping order corresponding to the GRAND method can be used to determine the C.

[0035] In a possible implementation, the determination manner of C includes: performing the following operation in a loop until the complexity of decoding any code block in the C code blocks does not exceed the decoding complexity upper limit value, and taking the last obtained C as the final C:

[0036] obtaining C code blocks, the C code blocks being obtained based on the C and information of a first length; the first length being a length of the first information block to be transmitted or a length of code bits corresponding to the transmission resource; determining, based on the maximum flipping order, whether the complexity of decoding any code block in the C code blocks does not exceed the decoding complexity upper limit value; and if not, obtaining an updated C based on a manner of C plus 1.

[0037] The technical effects of the various implementations in the second aspect can refer to the technical effects of the various implementations in the first aspect, which will not be repeated.

[0038] In a third aspect, a communication apparatus is provided. The communication apparatus can be the encoding end in the first aspect. The communication apparatus has the functions of the encoding end. The communication apparatus is, for example, a functional module in the encoding end, such as a baseband device or a chip system. Alternatively, the communication apparatus can be the decoding end in the second aspect. The communication apparatus has the functions of the decoding end. The communication apparatus is, for example, a functional module in the decoding end, such as a baseband device or a chip system.

[0039] In an optional implementation, the communication apparatus includes a baseband device and a radio frequency device. In another optional implementation, the communication apparatus includes a processing unit (also referred to as a processing module) and a transceiver unit (also referred to as a transceiver module). The transceiver unit can implement a sending function and a receiving function. When the transceiver unit implements the sending function, it can be referred to as a sending unit (also referred to as a sending module). When the transceiver unit implements the receiving function, it can be referred to as a receiving unit (also referred to as a receiving module). The sending unit and the receiving unit can be the same functional module, which is referred to as a transceiver unit and can implement the sending function and the receiving function. Alternatively, the sending unit and the receiving unit can be different functional modules, and the transceiver unit refers to these functional modules in general.

[0040] In a possible implementation, the communication apparatus further includes a storage unit (also referred to as a storage module). The processing unit is coupled to the storage unit and executes programs or instructions in the storage unit, so that the communication apparatus can implement the functions of the encoding end in the first aspect or the functions of the decoding end in the second aspect.

[0041] In a fourth aspect, a communication apparatus is provided, which comprises an interface circuit and a processor, and optionally, a memory. The memory is configured to store a computer program, and the processor is coupled to the memory and the interface circuit. When the processor reads the computer program or instructions, the communication apparatus is enabled to perform the method performed by the encoding end in the first aspect or the method performed by the decoding end in the second aspect. Exemplarily, the interface circuit is configured to receive a signal from another communication apparatus outside the communication apparatus and transmit the signal to the processor or send a signal from the processor to another communication apparatus outside the communication apparatus, and the processor is configured to implement the method performed by the encoding end in the first aspect or the method performed by the decoding end in the second aspect by means of logic circuit or execution of code instructions.

[0042] In a possible implementation, the communication apparatus is a chip or a chip system. The chip system can be composed of a chip or can comprise a chip and other discrete devices.

[0043] In a fifth aspect, a communication apparatus is provided, which comprises a processor and optionally, a memory. The processor and the memory are coupled. The memory is configured to store a computer program or instructions. The processor is configured to execute part or all of the computer program or instructions in the memory, which when executed, is configured to implement the functions of the encoding end in the first aspect or the functions of the decoding end in the second aspect.

[0044] In a possible implementation, the apparatus can further comprise a transceiver. The transceiver is configured to transmit a signal processed by the processor or receive a signal input to the processor. The transceiver can perform the transmitting action or the receiving action performed by the encoding end in the first aspect or the decoding end in the second aspect.

[0045] In a possible implementation, the processing unit in the third aspect can be implemented by means of the processor, the storage unit in the third aspect can be implemented by means of the memory, and the transceiving unit in the third aspect can be implemented by means of the transceiver.

[0046] In a possible implementation, the communication apparatus is a chip or a chip system.

[0047] In a sixth aspect, a computer readable storage medium is provided, which is configured to store a computer program or instructions, which when executed, enables the method in the first aspect or the second aspect to be implemented.

[0048] In a seventh aspect, a computer program product including instructions, which when executed on a computer, cause the method of the first aspect or the second aspect to be implemented.

[0049] In an eighth aspect, a communication system is provided, including the encoder of the first aspect and the decoder of the second aspect. For example, the encoder and the decoder can be implemented by the communication apparatus of the third aspect, or the fourth aspect, or the fifth aspect.

[0050] The technical effects achieved by any one of the second aspect to the eighth aspect can be described with reference to the technical effects achieved by the first aspect and any possible implementation manner thereof, and the repeated parts will not be discussed. BRIEF DESCRIPTION OF DRAWINGS

[0051] FIG. 1 is a schematic diagram of a communication system architecture according to an embodiment of the present application;

[0052] FIG. 2 is a schematic diagram of a data processing flow according to an embodiment of the present application;

[0053] FIG. 3 is a schematic diagram of a communication method according to an embodiment of the present application;

[0054] FIG. 4a is a schematic diagram of a communication method according to an embodiment of the present application;

[0055] FIG. 4b is a schematic diagram of a segmented transmission according to an embodiment of the present application;

[0056] FIG. 4c is a schematic diagram of a segmented encoding according to an embodiment of the present application;

[0057] FIG. 5 is a schematic diagram of a communication method according to an embodiment of the present application;

[0058] FIG. 6 is a schematic diagram of a segmented decoding performance according to an embodiment of the present application;

[0059] FIG. 7 is a schematic diagram of a segmented decoding complexity according to an embodiment of the present application;

[0060] FIG. 8 is a structural diagram of a communication apparatus according to an embodiment of the present application;

[0061] FIG. 9 is a structural diagram of a communication apparatus according to an embodiment of the present application. DETAILED DESCRIPTION

[0062] The technical solutions of the present application can be applied to various wireless communication systems, which can include but are not limited to the 4th generation (4G) system (also known as the long term evolution (LTE) system), the 5th generation (5G) system (also known as the new radio (NR) system), or can also be applied to future mobile communication systems, etc., and the specific application is not limited.

[0063] In addition, the technical solutions provided by the embodiments of the present application can be applied to device-to-device (D2D) scenarios, such as NR-D2D scenarios, etc., or can be applied to vehicle-to-everything (V2X) communication scenarios, such as NR-V2X scenarios, etc. For example, it can be used in the fields of intelligent driving, auxiliary driving, or intelligent networked vehicles, etc. For another example, the technical solutions provided by the embodiments of the present application can also be applied to factory manufacturing scenarios, etc.

[0064] In addition, the technical solutions provided by the embodiments of the present application can be applied to scenarios including but not limited to: ground cellular communication, non-terrestrial network (NTN), satellite communication, high altitude platform station (HAPS) communication, integrated access and backhaul (IAB) communication, reconfigurable intelligent surface (RIS) communication, etc.

[0065] FIG. 1 is a schematic diagram of an architecture of a communication system to which embodiments of the present application are applied. The communication system 1000 shown in FIG. 1 includes a radio access network 100 and a core network 200. Optionally, the communication system 1000 further includes an Internet 300. The radio access network 100 can include at least one network device (e.g., 110a and 110b in FIG. 1) and at least one terminal device (e.g., 120a-120j in FIG. 1). The terminal device is connected to the network device in a wireless manner, and the network device is connected to the core network 200 in a wireless or wired manner. The core network device and the network device can be independent and different physical devices, or can be a same physical device in which the functions of the core network device and the logical functions of the network device are integrated, or can be a physical device in which the functions of part of the core network device and part of the network device are integrated. The terminal device and the terminal device, and the network device and the network device can be connected to each other in a wired or wireless manner. FIG. 1 is only a schematic diagram, and the communication system can further include other network devices, such as a wireless relay device and a wireless backhaul device, which are not shown in FIG. 1.

[0066] The radio access network 100 can be a 3rd generation partnership project (3GPP) related cellular system, for example, a 4G, 5G, or future mobile communication system, or a WiFi system. The radio access network 100 can also be an open radio access network (open RAN, O-RAN or ORAN), a cloud radio access network (CRAN). The radio access network 100 can also be a communication system in which two or more of the above systems are integrated.

[0067] The network device is a node in a radio access network (RAN), and can also be referred to as an access network device, and can also be referred to as a RAN node (or device). The network device is used to help the terminal device to realize wireless access. The multiple network devices in the communication system 1000 can be nodes of the same type or nodes of different types.

[0068] In a possible scenario, the network device can be a base station, an evolved NodeB (eNodeB), a transmitting and receiving point (TRP), a transmitting point (TP), a next generation NodeB (gNB), a base station in a future mobile communication system, an access node in a WiFi system, an access point (AP) in a satellite, an integrated access and backhaul (IAB) node, a network device in a mobile switching center (MSC) non-terrestrial network (NTN) communication system, i.e., can be deployed on a high-altitude platform or a satellite, etc. The network device can be a macro base station (e.g., 110a in FIG. 1), a micro base station or an indoor station (e.g., 110b in FIG. 1), a relay node or a donor node, or a wireless controller in a CRAN scenario. The network device can also be a device assuming a base station function in device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, unmanned aircraft communication, or machine communication. Alternatively, the network device can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, the access network device in V2X technology can be a road side unit (RSU).

[0069] In another possible scenario, a plurality of network devices cooperate to assist a terminal device to implement wireless access, and different network devices respectively implement part of the functions of a base station. For example, the network device can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be separately configured, or can be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, such as a remote radio unit (RRU), an active antenna processing unit (AAU), or a remote radio head (RRH). It can be understood that the network device can be a CU node, or a DU node, or a device including a CU node and a DU node. In addition, the CU can be divided into a network device in a radio access network (RAN), or the CU can be divided into a network device in a core network (CN), which is not limited here.

[0070] In different systems, the CU (or CU-CP and CU-UP), DU or RU can also have different names, but those skilled in the art can understand their meanings. For example, in the ORAN system, the CU can also be referred to as O-CU (open CU), the DU can also be referred to as O-DU, the CU-CP can also be referred to as O-CU-CP, the CU-UP can also be referred to as O-CU-UP, and the RU can also be referred to as O-RU. For the convenience of description, the CU, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any one of the CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0071] The terminal device is a device with wireless transceiving function, which can send signals to the network device or receive signals from the network device. The terminal device includes, but is not limited to, a terminal apparatus, a terminal, a user equipment (UE), a mobile station, a mobile terminal, etc. The terminal device can be widely applied to various scenarios, such as device-to-device (D2D), vehicle-to-anything (V2X) communication, machine-type communication (MTC), internet of things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, remote medical treatment, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. The terminal device can specifically be a mobile phone, a tablet computer, a computer with wireless transceiving function, a wearable device, a vehicle, an airplane, a ship, a robot, a mechanical arm, a smart home device, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal device.

[0072] The network device and the terminal device can be fixed in position or movable. The network device and the terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; can also be deployed on the water surface; can also be deployed on an airplane, a balloon and a man-made satellite. The embodiments of the present application do not limit the application scenarios of the network device and the terminal device.

[0073] The roles of the network device and the terminal device can be relative. For example, the helicopter or the drone 120i in FIG. 1 can be configured as a mobile network device, and for those terminal devices 120j that access the wireless access network 100 through 120i, the terminal device 120i is a network device; but for the network device 110a, 120i is a terminal device, that is, 110a communicates with 120i through a wireless air interface protocol. Of course, 110a and 120i can also communicate through an interface protocol between network devices and network devices, and in this case, 120i is also a network device relative to 110a. Therefore, the network device and the terminal device can be collectively referred to as a communication apparatus, and 110a and 110b in FIG. 1 can be referred to as a communication apparatus with a network device function, and 120a-120j in FIG. 1 can be referred to as a communication apparatus with a terminal device function.

[0074] The network device and the terminal device, the network device and the network device, and the terminal device and the terminal device can communicate through an authorized frequency spectrum, can communicate through an unlicensed frequency spectrum, and can simultaneously communicate through an authorized frequency spectrum and an unlicensed frequency spectrum; can communicate through a frequency spectrum below 6 gigahertz (GHz), can communicate through a frequency spectrum above 6 GHz, and can simultaneously use a frequency spectrum below 6 GHz and a frequency spectrum above 6 GHz. The embodiments of the present application do not limit the frequency spectrum resources used for wireless communication.

[0075] In the embodiments of the present application, the functions of the network device can also be performed by a module (such as a chip) in the network device, or can be performed by a control subsystem containing network device functions. The control subsystem containing network device functions herein can be a control center in the above-mentioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities. The functions of the terminal device can also be performed by a module (such as a chip or a modem) in the terminal device, or can be performed by a device containing terminal device functions.

[0076] In the present application, the base station sends a downlink signal or downlink information to the terminal, and the downlink information is carried on a downlink channel; the terminal sends an uplink signal or uplink information to the base station, and the uplink information is carried on an uplink channel. In order to communicate with the base station, the terminal needs to establish a wireless connection on a cell controlled by the base station. The cell that establishes a wireless connection with the terminal is called the service cell of the terminal. When the terminal communicates with the service cell, it will also be interfered by signals from neighboring cells.

[0077] As shown in FIG. 2, a communication method flow diagram is introduced. The encoding end encodes the information block to be transmitted, and obtains coded bits. After the encoding operation, the information bits to be transmitted are encrypted, and check bits are added, improving the transmission security. The encoding end modulates the bits, and obtains modulation symbols. The encoding end maps the modulation symbols to the frequency domain resources (i.e., subcarrier mapping), and sends them out. After the channel transmission, the decoding end receives the signal, which is affected by noise and / or interference compared with the signal sent by the encoding end. The decoding end performs frequency domain demapping on the received signal, and demodulates the data signal based on the channel estimation result, and obtains the demodulated signal. The decoding end further performs channel decoding on the demodulated signal, and obtains the information block.

[0078] One decoding mode is guessing random additive noise decoding (GRAND), and the decoding process is introduced as follows.

[0079] It is assumed that the vector corresponding to the demodulated signal is The check matrix is H, and the maximum flipping stage is r.

[0080] 1. The check matrix H is used to check If the result of is all 0, the check is passed, and the decoding ends; if the result of is not all 0, the check fails.

[0081] 2. If the check fails, the value of a position in is flipped (for example, from 0 to 1, or from 1 to 0), and is obtained. The check matrix H is used to check If the check is passed, the decoding ends; if the check fails, the value of another position in is flipped, and the check is performed, and the process is repeated until the check is passed.

[0082] 3. If all the positions of are flipped once, and the check still fails, the values of any two positions of are flipped, and is obtained. The check matrix H is used to check If the check is passed, the decoding ends; if the check fails, the values of the other two positions of are flipped, and the check is performed, and the process is repeated until the check is passed.

[0083] 4. If all two positions of are tried and the check fails, flip any three positions of If all three positions of are tried and the check fails, flip any four positions of and so on until the number of flipped positions reaches r.

[0084] In the above process, the GRAND decoding method finds the codeword closest to the demodulated signal as the decoding result by trying to flip one, two, three positions of the elements, and this decoding method only needs a check matrix and can be applied to any encoding method.

[0085] Another possible implementation of the GRAND decoding method is as follows:

[0086] Let the demodulated signal correspond to the vector The vector corresponding to the information block to be transmitted The encoding matrix is G, and the maximum flipping stage is r.

[0087] 1. Encode to obtain a0, where Calculate the difference between a0 and to obtain the difference number x, and record a0 as the decoding result.

[0088] 2. Flip the value of the first position in and encode the flipped vector to obtain a1. Calculate the difference between a1 and to obtain the difference number x'. If x' is less than x, update the decoding result from a0 to a1 and the difference number from x to x'. If x' is not less than x, keep the current decoding result and difference number unchanged.

[0089] 3. Flip the value of the second position in and encode the flipped vector to obtain a new encoding result a2. Calculate the difference between a2 and to obtain a new difference number. If the new difference number is less than the currently saved difference number, determine the new encoding result as the final decoding result and the new difference number as the final difference number. If the new difference number is not less than the currently saved difference number, keep the current decoding result and difference number unchanged.

[0090] 4. Flip the values of the third, fourth, and so on until the last position in and repeat the process of step 3 above.

[0091] 5. Flip the value of any two positions in the result of step 4, and repeat the process of step 3 until the combination of any two positions is completed.

[0092] 6. Flip the value of any three positions in the result of step 5, and repeat the process of step 3 until the combination of any three positions is completed.

[0093] By analogy, until the combination of any r positions is completed, the final decoding result is obtained.

[0094] In the above process, the Grand decoding method finds the code word closest to the encoded signal as the decoding result by constantly trying to flip the elements of 1, 2, and 3 positions. This decoding method only needs an encoding matrix to decode and can be applied to any encoding method. Grand decoding does not use code structure and has no long code gain. When the code length increases under the premise of constant flip order, the complexity of encoding and decoding increases by a combination number level, and the decoding accuracy decreases.

[0095] Therefore, the present application proposes a communication method of segmenting the information block to be transmitted and / or the received code block, which can reduce the decoding complexity and improve the decoding accuracy.

[0096] The method provided by each embodiment of the present application can be applied to the network architecture shown in FIG. 1 or other network architectures. For example, the encoding end involved in each embodiment of the present application can be a terminal device in FIG. 1, for example, 120a, 120b, 120c, and 120i in FIG. 1, and the decoding end involved in each embodiment of the present application can be a network device in FIG. 1, for example, 110a in FIG. 1. For example, the encoding end involved in each embodiment of the present application can be a network device in FIG. 1, for example, 110b in FIG. 1, and the decoding end involved in each embodiment of the present application can be a terminal device in FIG. 1, for example, 120f and 120g in FIG. 1.

[0097] In order to better introduce the embodiments of the present application, the method provided by the embodiments of the present application will be introduced below in combination with the drawings. In the corresponding drawings of each embodiment of the present application, the steps represented by the dashed lines in the following are optional steps.

[0098] FIG. 3 is a flowchart of a communication method provided by an embodiment of the present application, including the following steps:

[0099] Step 300: The encoding end generates a first message.

[0100] ​​The first message includes C code blocks, and C is an integer greater than or equal to 1. The value of C is determined according to the upper limit of the decoding complexity supported by the decoding end. The decoding complexity of each code block in the C code blocks does not exceed the upper limit of the decoding complexity. In a special case, the decoding complexity of a small number of code blocks in the C code blocks may exceed the upper limit of the decoding complexity, where the small number can be one, or two, or three, or no more than a set threshold, for example, the threshold is 1 / 3, 1 / 4, 1 / 5, 1 / 10, etc. of C.

[0101] The upper limit of the decoding complexity can be represented by the number of test error patterns (TEP). For example, the upper limit of the number of TEPs is 3000, 5000, etc.

[0102] Step 301: The encoding end sends the first message, and the decoding end receives the first message accordingly.

[0103] Step 302: The decoding end decodes each code block in the C code blocks.

[0104] For example, the decoding end uses the random noise guessing decoding GRAND method to decode. When the maximum flip order is set to τ (τ is an integer greater than or equal to 1), the complexity of decoding a code block with a length of M (M is an integer greater than or equal to 1) can be represented as That is, at most TEP need to be tested. For example, when the maximum flip order is τ = 3 and M = 106, For example, when the maximum flip order is 3 and M = 128,

[0105] As shown in FIG. 4a, a communication method flowchart is introduced.

[0106] Step 400: The encoding end generates a first information block to be transmitted.

[0107] Step 401: The encoding end obtains a segmentation number C, which is related to the length of the first information block.

[0108] Step 402: The encoding end divides the first information block to be transmitted into C second information blocks.

[0109] After obtaining C and generating the first information block, the encoding end can determine the length of the block based on the length K of the first information block (i.e., the number of bits contained in the first information block is K) and C, and then divide the first information block according to the length of the block to obtain C second information blocks.

[0110] The segmentation method and the length of the second information block are introduced as follows:

[0111] If K / C can be divided, the length of the block Kc is K / C. That is, C*Kc=K, and the length of any of the second information blocks is Kc. For example, K=104, C=4, and Kc=26.

[0112] If K / C cannot be divided, the result of K / C can be rounded, for example, rounded up (that is, ) or rounded down (that is, ) or rounded to the nearest integer, to obtain the length of the block Kc.

[0113] For example, K=106, C=4, and Kc=26. Because 106-4*26=2, the first information block is divided according to the length of each block being 26, and there are still 2 bits remaining. The processing method of the remaining bits is as follows:

[0114] Method a1: The remaining bits can be placed in one second information block. For example, C*Kc is less than K, the length of C-1 second information blocks of the C second information blocks is Kc, and the length of one second information block is K-Kc*(C-1). In the above example, the length of 3 second information blocks is 26, and the length of 1 information block is 28. The remaining bits are placed in one second information block, so only one second information block has an increased length, and if the lengths of all code blocks are the same, only the code rate (the length of the payload bits / code length) of one code block is increased, and the code rate of the remaining C-1 code blocks is not improved, which can improve the bit error rate BLER performance of the code block level (CB).

[0115] Method a2: The remaining bits can be placed in a corresponding number of second information blocks, one remaining bit in each second information block. For example, C*Kc is less than K, there are h remaining bits (K-C*Kc=h), the length of C-h second information blocks of the C second information blocks is Kc, and the length of h second information blocks is Kc+1, where h is an integer greater than 1. In the above example, the length of 2 second information blocks is 26, and the length of 2 information blocks is 27. The remaining bits are evenly placed in multiple second information blocks, so the lengths of multiple second information blocks are increased, and if the lengths of all code blocks are the same, the code rate jitter on each code block can be smoothed, avoiding a sudden increase in the code rate of a certain code block, thereby improving the BLER performance of the transport block level.

[0116] Method a3: the remaining bits can be placed in at least one second information block. For example, C*Kc is less than K, and the remaining h bits (K-C*Kc=h), some second information blocks of the C second information blocks have a length of Kc, some second information blocks have a length of Kc+1, some second information blocks have a length of Kc+2, and further optionally, some second information blocks have a length of Kc+3, Kc+4, or even longer.

[0117] For another example, K=102, C=4, and Kc=26. Since 102-4*26=-2, the first information block is divided according to the length of each block of 26, and the length of the first information block is not enough, with a difference of 2 bits. The processing method of this case is as follows:

[0118] Method b1: C-1 second information blocks have a length of the calculated length Kc, and one second information block has a length less than the calculated length Kc. For example, C*Kc is greater than K, and C-1 second information blocks of the C second information blocks have a length of Kc, and one second information block has a length of K-Kc*C. In the above example, it can be obtained that 3 second information blocks have a length of 26, and 1 second information block has a length of 24.

[0119] Method b2: most second information blocks have a length of the calculated length Kc, and a small number of second information blocks have a length less than the calculated length Kc. For example, C*Kc is greater than K, and there are h bits (C*Kc-K=h), C-h second information blocks of the C second information blocks have a length of Kc, and h second information blocks have a length of Kc-1, and h is an integer greater than 1. In the above example, it can be obtained that 2 second information blocks have a length of 26, and 2 information blocks have a length of 25.

[0120] Method b3: padding is performed on the second information block, which can be 0 or 1, and all second information blocks have the same length. For example, C*Kc is greater than K, and any second information block includes Kc bits, and at least one second information block includes at least one bit in the first information block and a padding bit.

[0121] Method b4: repeated partitioning is performed, and all second information blocks have the same length. For example, C*Kc is greater than K, and any second information block includes Kc bits, and at least two second information blocks include repeated bits. For example, one second information block corresponds to bits 1-26 in the first information block, and another information block corresponds to bits 26-51 in the first information block.

[0122] Step 403: the encoding end encodes each second information block of the C second information blocks to obtain C code blocks.

[0123] For example, the length of the first information block is K, the length of the encoding bits corresponding to the transmission resource carrying the first information block is N, if no segmentation coding is performed, the coding matrix G is K rows and N columns (N is greater than K), and the length of the code block obtained by coding the first information block by using the coding matrix G is N. In the scenario of performing segmentation coding, the segmentation number is C, and based on the length K of the first information block and the segmentation number C, the length of the second information block can be determined as Kc, for example, Based on the length N and the segmentation number C, the length of the code block can be determined as Nc, for example, Then the second information block is coded by using a coding matrix Gc of smaller dimension, Gc is a coding matrix of Kc rows and Nc columns, and the length of each of the C code blocks is Nc. The total length of the C code blocks is the length of the encoding bits corresponding to the transmission resource.

[0124] In data transmission, the network device can schedule a transmission resource for transmitting data to the terminal device. In the embodiment of the present application, the network device can schedule a transmission resource for transmitting the first information block to the terminal device, and the number of the transmission resource for transmitting the first information block is the number of modulated symbols of the first information block, for example, the length of the encoding bits of the first information block to be transmitted after coding is 128, the modulation order is 2, the length of the modulated symbols of the encoding bits of length 128 is 64, the transmission resource carrying the first information block includes 64 resource elements (REs), and the length of the encoding bits corresponding to the 64 REs is 128.

[0125] In addition, considering whether the length of the first information block can be evenly divided by C, if it can be evenly divided, the lengths of the C second information blocks can be the same; if it cannot be evenly divided, the lengths of the C second information blocks can be different. Optionally, whether the lengths of the C second information blocks are the same or not, the lengths of the C code blocks are the same. Of course, the lengths of the C code blocks can be inconsistent. For the second information blocks of the same length, the number of rows and the number of columns of the coding matrix corresponding to different second information blocks are the same respectively, but the elements in the coding matrix can be the same or different.

[0126] Step 404: The encoding end generates a first message based on concatenating the C code blocks.

[0127] Step 405: The encoding end sends the first message, and correspondingly, the decoding end receives the first message.

[0128] As shown in FIG. 4b, a schematic diagram of segmented transmission is introduced, the first information block is divided into C second information blocks, different second information blocks are coded by using respective corresponding coding matrices to obtain code blocks, and the C code blocks are concatenated in order and mapped to time-frequency domain resources for transmission.

[0129] Step 406: the decoding end acquires the number of segments C.

[0130] The order of steps 406 and 405 is not limited.

[0131] Step 407: the decoding end divides the payload of the first message into C code blocks.

[0132] The payload refers to the part corresponding to the C code blocks, and does not include the message header.

[0133] Step 408: the decoding end decodes each of the C code blocks to obtain C third information blocks.

[0134] For example, the decoding is performed in the GRAND manner.

[0135] Step 409: the decoding end concatenates the C third information blocks to obtain the data sent by the encoding end to the decoding end.

[0136] In addition, if the decoding is correct in step 406, the third information block is the same as the second information block, and if the decoding is incorrect, the third information block is different from the second information block, and retransmission may be performed subsequently, which is not limited in the present application. In addition, the modulation, demodulation, resource mapping, resource demapping, etc. in the data transmission process can refer to the existing technologies, and will not be described in detail here.

[0137] As shown in FIG. 4c, a schematic diagram of segmented encoding is introduced, for example, encoding is performed in the BCH code or extended BCH (eBCH) code, the abscissa is the number N of code words included in the code block after encoding, and the ordinate is the number K of bit sequences to be encoded. In this example, the number K of bit sequences to be encoded (i.e. the length of the first information block) is 106, and the number N of code words included in the code block after encoding is 128. In this example, the bit sequences to be encoded are divided into 4 segments for encoding respectively, and the length Kc of each segment information block is 26, and the length Nc of the code block after encoding of each segment information block is 32. When the decoding end performs decoding in the GRAND manner with a maximum flipping order of 3, the decoding complexity of the decoding end for decoding the code block with a length of 106 is 198592. If the code block with a length of 106 is divided into 4 segments, each with a length of 26, the decoding complexity of the decoding end for decoding the code block with a length of 26 is The total decoding complexity of the 4 code blocks is After segmentation processing, the decoding complexity of a single code block is greatly reduced, and the total decoding complexity of multiple code blocks is also reduced. In this example, after the bit sequence with a length of 106 is divided into 4 segments of bit sequences with a length of 26, there are still 2 bits left. In order to facilitate description, the remaining 2 bits are simplified in this example. In actual application, the processing manner of the remaining bits can refer to the manners a1, a2 and a3 introduced in step 402.

[0138] In this embodiment, the upper limit value of the decoding complexity supported by the decoding end can determine the decoding accuracy of the decoding end. If the decoding complexity of the decoding end when decoding a certain code block does not exceed the upper limit value of the decoding complexity, the code block can be decoded correctly. If the decoding complexity exceeds the upper limit value of the decoding complexity, the decoding accuracy decreases (which does not mean decoding error). The number of segments C is determined based on the upper limit value of the decoding complexity supported by the decoding end. The decoding complexity of decoding most or even all of the C code blocks does not exceed the upper limit value of the decoding complexity, which can improve the decoding accuracy of the data transmitted this time.

[0139] In step 300 described above, the value of C is determined according to the upper limit value of the decoding complexity supported by the decoding end. The following describes multiple examples of determining C. The numbers (1, 2, 3,...) in the following examples are only for aspect description, and the numbers do not represent the priority and importance of the examples.

[0140] Example 1: The C is determined according to the upper limit value of the decoding complexity, the length K of the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND manner.

[0141] When the decoding end decodes in the GRAND manner, the maximum flipping order can be set in advance. The maximum flipping order is the number of positions of maximum allowed continuous flipping, for example, the maximum flipping order is 1, or 2, or 3, or 4, or 5, etc.

[0142] One way of determining the number of segments X according to the upper limit value of the decoding complexity, the length K of the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND manner is as follows: repeatedly perform the following operations until the decoding complexity of any code block in the X segments of code blocks does not exceed the upper limit value of the decoding complexity, and finally obtain X as the final X:

[0143] X segments of code blocks are obtained, which are divided based on the X of the first length information; the first length is the length of the first information block to be transmitted or the length of the encoded bits corresponding to the transmission resource;

[0144] Based on the maximum flipping order, determine whether the complexity of decoding any code block in the X-segmented code block does not exceed the decoding complexity upper limit value;

[0145] If no, update X based on X+1.

[0146] Optionally, when updating X, it can be incremented by 1, or by 2 or other numerical values.

[0147] The X is the minimum segment number that satisfies that the code block does not exceed the decoding complexity upper limit value. The C can be equal to or greater than X, for example, C=X+1, or C=X+2. If the segment number C exceeds X when segmenting the first information block, the length of each code block obtained by encoding can be shorter, and the decoding complexity can be lower.

[0148] As shown in FIG. 5, a flowchart of a communication method is introduced.

[0149] Step 500: Set the following parameters: length K, maximum flipping order, initial segment number X=1, decoding complexity upper limit value.

[0150] Step 501: Based on the length K and the segment number X, determine the second length. For example, the second length is K / X, or the second length is the integer of K / X, for example, the upward integer, the downward integer, or the rounding integer.

[0151] Step 502: Determine the complexity of decoding the code block of the second length under the maximum flipping order.

[0152] Step 503: Determine whether the complexity exceeds the decoding complexity upper limit value; if yes, execute step 504; if no, execute step 505.

[0153] Step 504: Update the segment number X by 1, and execute step 501.

[0154] Step 505: Output the segment number X.

[0155] Next, taking the maximum flipping order τ=3, K=106, and the decoding complexity upper limit value of 3000 TEP as an example, a pseudo code for determining the segment number X is introduced:

[0156] 1) Initialize the decoding complexity without segmentation (i.e. the number of TEPs required when not segmented), which is exemplarily as follows:

[0157] 2) Gradually increase the segment number X until the decoding complexity of a single code block does not exceed the decoding complexity upper limit value, which is exemplarily as follows:

[0158] By executing the above pseudo code, X=4 can be obtained; that is, the K=106 bits / codeword are divided into 4 segments for encoding and decoding based on random noise guessing, which meets the requirement that a single code block does not exceed the upper limit of decoding complexity value.

[0159] If the above K=106 is replaced by K=128, X=6 can be obtained; that is, the K=128 bits / codeword are divided into 6 segments for encoding and decoding based on random noise guessing, which meets the requirement that a single code block does not exceed the upper limit of decoding complexity value.

[0160] In this implementation mode, an iterative approach is used to gradually approach the upper limit of decoding complexity value, so that the determined C is more accurate, which can meet the requirement of decoding complexity and will not cause loss of coding gain due to too short segments.

[0161] In this example 1, the way of obtaining C at the decoding end and the encoding end includes the following:

[0162] Mode 1.1: The decoding end and the encoding end each determine C.

[0163] The decoding end is provided with the upper limit of decoding complexity value and the maximum flipping order corresponding to the GRAND mode, and the decoding end can send indication information to the encoding end, the indication information being used to indicate the upper limit of decoding complexity value and the maximum flipping order corresponding to the GRAND mode; correspondingly, the encoding end receives the indication information; and then, the encoding end determines C according to the upper limit of decoding complexity value, the length K of the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND mode.

[0164] The encoding end can indicate the length K of the first information block to be transmitted to the decoding end, and the decoding end can determine C according to the upper limit of decoding complexity value, the length K of the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND mode.

[0165] Mode 1.2: The decoding end determines C and informs the encoding end of C.

[0166] For example, the encoding end indicates the length K of the first information block to be transmitted to the decoding end. After learning the length of the first information block, the decoding end determines C according to the upper limit of decoding complexity value, the length K of the first information block to be transmitted, and the maximum flipping order corresponding to the GRAND mode. The decoding end sends indication information to the encoding end, the indication information being used to indicate C; correspondingly, the encoding end receives the indication information and then learns C.

[0167] For another example, the decoding end traverses multiple lengths, determines the C corresponding to each length according to the coding complexity upper limit value and the maximum flipping order corresponding to the GRAND mode, and after sorting and counting, indicates the length and the C corresponding to each other to the device in communication with the decoding end (including the encoding end in the device in communication with the decoding end), so that the encoding end can obtain the C corresponding to different lengths, wherein the different lengths include the length K of the first information block.

[0168] The decoding end determines the C and informs the encoding end, which can simplify the workload of the encoding end.

[0169] Mode 1.3: The encoding end determines the C and informs the decoding end.

[0170] The decoding end is provided with the coding complexity upper limit value and the maximum flipping order corresponding to the GRAND mode, and the decoding end can send indication information to the encoding end, the indication information being used to indicate the coding complexity upper limit value and the maximum flipping order corresponding to the GRAND mode; correspondingly, the encoding end receives the indication information; further, the encoding end determines the C according to the coding complexity upper limit value, the length K of the first information block to be transmitted and the maximum flipping order corresponding to the GRAND mode. The encoding end sends indication information to the decoding end, the indication information being used to indicate the C; correspondingly, the decoding end receives the indication information and further obtains the C. The indication information can be carried in the first message or in other messages other than the first message.

[0171] The encoding end determines the C and informs the decoding end, which can simplify the workload of the decoding end.

[0172] Example 2: The C is determined according to the coding complexity upper limit value, the encoding bit length N corresponding to the transmission resource carrying the first information block to be transmitted and the maximum flipping order corresponding to the GRAND mode.

[0173] The way of determining the segmentation number X according to the coding complexity upper limit value, the length N and the maximum flipping order corresponding to the GRAND mode can refer to the way of determining the segmentation number X according to the coding complexity upper limit value, the length K of the first information block to be transmitted and the maximum flipping order corresponding to the GRAND mode introduced in Example 1, which is only that the length K is replaced by the length N.

[0174] The coding complexity can be calculated based on K, and the decoding end performs flipping at the K information bit positions when decoding. The coding complexity can also be calculated based on the length N, and the decoding end performs flipping at the N code word bit positions when decoding.

[0175] In this example 2, the way of obtaining the C by the decoding end and the encoding end includes the following several ways:

[0176] Manner 2.1: The decoding end and the encoding end each determine C.

[0177] The decoding end is provided with a decoding complexity upper limit value and a maximum flipping order corresponding to the GRAND manner, and the decoding end can send indication information to the encoding end, the indication information being used to indicate the decoding complexity upper limit value and the maximum flipping order corresponding to the GRAND manner; correspondingly, the encoding end receives the indication information; further, the encoding end determines C according to the decoding complexity upper limit value, the length N, and the maximum flipping order corresponding to the GRAND manner.

[0178] The encoding end can send the length of the first information block to be transmitted to the decoding end, and the decoding end can determine C according to the decoding complexity upper limit value, the length N, and the maximum flipping order corresponding to the GRAND manner.

[0179] In data transmission, the network device can schedule a resource for transmitting data to the terminal device, in the embodiment of the present application, the network device can schedule a transmission resource for transmitting the first information block to the terminal device, and the terminal device, after learning the transmission resource for transmitting the first information block, can learn the length N of the encoding bits corresponding to the transmission resource. If the encoding end is the terminal device and the decoding end is the network device, the network device knows the length N, and the encoding end can not need to indicate the length N to the decoding end.

[0180] Manner 2.2: The decoding end determines C and informs the encoding end of C.

[0181] For example, the encoding end sends the length N to the decoding end. After learning the length N, the decoding end determines C according to the decoding complexity upper limit value, the length N, and the maximum flipping order corresponding to the GRAND manner. The decoding end sends indication information to the encoding end, the indication information being used to indicate C; correspondingly, the encoding end receives the indication information and further learns C. If the encoding end is the terminal device and the decoding end is the network device, the network device knows the length N, and the encoding end can not need to indicate the length N to the decoding end.

[0182] For another example, the decoding end traverses a plurality of lengths, determines C corresponding to each length according to the decoding complexity upper limit value and the maximum flipping order corresponding to the GRAND manner, and after sorting and counting, indicates the lengths and C corresponding to each other to a device (including the encoding end) in communication with the decoding end, and the encoding end can learn C corresponding to different lengths, wherein the different lengths include the length of the first information block.

[0183] The decoding end determines C and informs the encoding end, which can simplify the workload of the encoding end.

[0184] Manner 2.3: The encoding end determines C and informs the decoding end of C.

[0185] The decoding end is provided with a decoding complexity upper limit value and a maximum flipping order corresponding to the GRAND mode, and the decoding end can send indication information to the encoding end, the indication information being used to indicate the decoding complexity upper limit value and the maximum flipping order corresponding to the GRAND mode. Correspondingly, the encoding end receives the indication information, and then the encoding end determines C according to the decoding complexity upper limit value, the length N and the maximum flipping order corresponding to the GRAND mode. The encoding end sends indication information to the decoding end, the indication information being used to indicate the C. Correspondingly, the decoding end receives the indication information and then learns the C. The indication information can be carried in the first message or in other messages other than the first message.

[0186] The encoding end determines C and informs the decoding end, which can simplify the workload of the decoding end.

[0187] Example 3: The C is determined according to a first decoding length upper limit value supported by the decoding end and the length K of the first information block to be transmitted, and the first decoding length upper limit value is determined based on the decoding complexity upper limit value.

[0188] For example, the first decoding length upper limit value is 28, or 32, or 34.

[0189] Optionally, the complexity of decoding the code block of the first decoding length upper limit value does not exceed the decoding complexity upper limit value. For example, the length of the payload part (i.e. the part of the code block excluding the check bits) of each code block in the C code blocks does not exceed the first decoding length upper limit value. In a special case, it is not excluded that the length of the payload part of a small number of code blocks in the C code blocks exceeds the first decoding length upper limit value, wherein the small number can be one, or two, or three, or does not exceed a set threshold, for example, the threshold is 1 / 3, 1 / 4, 1 / 5, 1 / 10, etc. of C.

[0190] The following introduces a plurality of ways of determining the segmentation number S according to the first decoding length upper limit value Kc and the length K: for example, S = K / Kc, or S is the integer part of K / Kc, which can be the upper integer part (i.e. ) or the lower integer part (i.e. ) or the rounding integer part. For example, K = 106 and Kc = 26, then S = 4; for example, K = 102 and Kc = 26, then S = 4. The C can be equal to or greater than S, for example, C = S + 1 or C = S + 2. If the segmentation number C exceeds S when the first information block is segmented, the length of each code block will be shorter and the decoding complexity will be lower.

[0191] In this example 3, the way in which the decoding end and the encoding end obtain C includes the following:

[0192] Manner 3.1: The coding end and the encoding end each determine C.

[0193] The first coding length upper limit value is set in the coding end, and the coding end can send indication information to the encoding end, the indication information being used to indicate the first coding length upper limit value; correspondingly, the encoding end receives the indication information, and the encoding end can learn the first coding length upper limit value based on the indication information; further, the encoding end can determine C according to the first coding length upper limit value and the length K of the first information block to be transmitted.

[0194] The encoding end can indicate the length K of the first information block to be transmitted to the coding end, and the coding end can determine C according to the first coding length upper limit value and the length K of the first information block to be transmitted.

[0195] Manner 3.2: The coding end determines C and informs the encoding end of C.

[0196] For example, the encoding end indicates the length K of the first information block to be transmitted to the coding end. After learning the length K of the first information block, the coding end determines C according to the first coding length upper limit value and the length K of the first information block to be transmitted. The coding end sends indication information to the encoding end, the indication information being used to indicate C; correspondingly, the encoding end receives the indication information and further learns C.

[0197] For another example, the coding end traverses a plurality of lengths, determines C corresponding to each length according to the first coding length upper limit value, and after sorting and counting, indicates the lengths and C corresponding to each other to a device in communication with the coding end (the device in communication with the coding end including the encoding end), and the encoding end can learn C corresponding to different lengths, wherein the different lengths include the length K of the first information block.

[0198] The coding end determines C and informs the encoding end, which can simplify the workload of the encoding end.

[0199] Manner 3.3: The encoding end determines C and informs the coding end.

[0200] The first coding length upper limit value is set in the coding end, and the coding end can send indication information to the encoding end, the indication information being used to indicate the first coding length upper limit value; correspondingly, the encoding end receives the indication information; further, the encoding end determines C according to the first coding length upper limit value and the length K of the first information block to be transmitted. The encoding end sends indication information to the coding end, the indication information being used to indicate C; correspondingly, the coding end receives the indication information and further learns C. The indication information can be carried in the first message or in other messages other than the first message.

[0201] The encoding end determines C and informs the coding end, which can simplify the workload of the coding end.

[0202] If the first coding length upper limit value is informed to the encoding end by the decoding end (for example, mode 3.1 and mode 3.3), the encoding end can divide the first information block based on the first coding length upper limit value to obtain C second information blocks.

[0203] If C is informed to the encoding end by the decoding end (for example, mode 3.2), the encoding end can determine the length of the segment based on the length K of the first information block and C, divide the first information block based on the length of the segment to obtain C second information blocks, wherein the length of the segment is equal to the first coding length upper limit value.

[0204] In example 4, the C is determined according to a second coding length upper limit value supported by the decoding end and an encoding bit length N corresponding to a transmission resource carrying the first information block to be transmitted; and the second coding length upper limit value is determined based on the coding complexity upper limit value.

[0205] For example, the second coding length upper limit value is 32, or 34, or 36.

[0206] Optionally, the complexity of coding the second coding length upper limit value is not more than the coding complexity upper limit value. For example, the length of each of the C code blocks is not more than the second coding length upper limit value. In a special case, it is not excluded that the length of a small number of code blocks in the C code blocks exceeds the second coding length upper limit value, wherein the small number can be one, or two, or three, or not more than a set threshold, for example, the threshold is 1 / 3, 1 / 4, 1 / 5, 1 / 10, etc. of C.

[0207] Optionally, the second coding length upper limit value is greater than the first coding length upper limit value.

[0208] The following introduces a plurality of modes for determining the number of segments S according to the second coding length upper limit value Nc and the length N: for example, S=N / Nc, or S is the integer part of N / Nc, which can be the upper integer part (i.e. ) or the lower integer part (i.e. ). For example, N=128, Nc=21, then S=6; for example, N=128, Nc=32, then S=4. The C can be equal to or greater than S, for example, C=S+1, or C=S+2. If the number of segments C exceeds S when the first information block is segmented, the length of each code block will be shorter and the coding complexity will be lower.

[0209] In this example 4, the mode of obtaining C by the decoding end and the encoding end includes the following modes:

[0210] Mode 4.1: the decoding end and the encoding end each determine C.

[0211] The second decoding length upper limit value is set in the decoding end, and the decoding end can send indication information to the encoding end, where the indication information is used to indicate the second decoding length upper limit value. Correspondingly, the encoding end receives the indication information, and the encoding end can obtain the second decoding length upper limit value based on the indication information. Then, the encoding end can determine C according to the second decoding length upper limit value and the length K.

[0212] The encoding end can indicate the length K to the decoding end, and the decoding end can determine C according to the second decoding length upper limit value and the length K. If the encoding end is a terminal device and the decoding end is a network device, the network device knows the length N, and the encoding end can not need to indicate the length N to the decoding end.

[0213] Method 4.2: The decoding end determines C and informs the encoding end of C.

[0214] Reference can be made to the method 3.2 in the example 3, and the length K of the first information block is replaced by the length N, and the first decoding length upper limit value is replaced by the second decoding length upper limit value.

[0215] Method 4.3: The encoding end determines C and informs the decoding end of C.

[0216] Reference can be made to the method 3.3 in the example 3, and the length K of the first information block is replaced by the length N, and the first decoding length upper limit value is replaced by the second decoding length upper limit value.

[0217] If the decoding end informs the encoding end of the second decoding length upper limit value (for example, the method 4.1 and the method 4.3), the encoding end can divide the first information block based on the second decoding length upper limit value to obtain C second information blocks. Optionally, the length of the segmentation can be determined without determining C in advance, because the first decoding length upper limit value can be equal to the length of the segmentation.

[0218] The above describes various methods for determining the number of segments C. If the length K is used to determine the number of segments C (for example, the methods in the example 1 and the example 3), the decoding end can flip the code word of the payload position of each code block in the C code blocks when the GRAND method is used to decode (for example, the step 408). If the length N is used to determine the number of segments C (for example, the methods in the example 2 and the example 4), the decoding end can flip the code word of all positions of each code block in the C code blocks when the GRAND method is used to decode (for example, the step 408).

[0219] In the above-mentioned examples 1-4, the encoding end and the decoding end interact a lot of parameters, for example, the decoding end sends the maximum flipping order, the first decoding length upper limit value, the second decoding length upper limit value, and the decoding complexity upper limit value to the encoding end. These parameters can be used to determine the segment number C, or can not be limited to only determining the segment number C.

[0220] Figure 6 introduces a segmented decoding complexity diagram. The horizontal axis is the symbol signal-to-noise ratio EsNo, and the vertical axis is the complexity, i.e., the number of test error patterns TEP. It can be seen that the more the number of codewords to be decoded, the higher the decoding complexity. In the case of BCH encoding, the length of the information bits to be transmitted is 106, the length after encoding is 128, and the maximum flipping order is 3. If no segmentation is performed, the complexity is 198592. When segmented into 4 segments for encoding and decoding, the decoding complexity of a code block is 2952, and the total decoding complexity of 4 code blocks is 11808. By comparison in Figure 6, it can be seen that when segmented into 4 segments, the decoding complexity of a single code block is greatly reduced, and the total complexity of 4 code blocks is also greatly reduced.

[0221] Figure 7 introduces a segmented decoding performance diagram. The horizontal axis is the symbol signal-to-noise ratio EsNo, and the vertical axis is the bit error rate BLER. It can be found that at the same bit error rate, the signal-to-noise ratio of segmented decoding is lower. For example, in the case of BCH encoding, the length of the information bits to be transmitted is 106, the length after encoding is 128, and the maximum flipping order is 3. At a bit error rate of 10%, compared with no segmentation, the signal-to-noise ratio has a gain of about 0.5dB when segmented into 4 segments.

[0222] The GRAND decoding mode does not utilize long code gain, so instead of flipping in a longer range, it is better to segment the long code into multiple small codes and flip in a smaller range, which reduces the complexity while also achieving better error correction performance.

[0223] It can be understood that, in order to realize the functions in the above-mentioned embodiments, the encoding end and the decoding end include corresponding hardware structures and / or software modules for executing various functions. Those skilled in the art should easily realize that, in combination with the units and method steps of the examples described in the embodiments disclosed in the present application, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in hardware or computer software driven hardware depends on the specific application scenario and design constraints of the technical solution.

[0224] Figures 8 and 9 are structural schematic diagrams of possible communication devices provided by the embodiments of the present application. These communication devices can be used to realize the functions of the encoding end or the decoding end in the above-mentioned method embodiments, and thus can also realize the beneficial effects possessed by the above-mentioned method embodiments.

[0225] As shown in FIG. 8, the communication apparatus 800 includes a processing unit 810 and a transceiver unit 820.

[0226] For example, the communication apparatus 800 is configured to implement the functions of the encoding end and the decoding end in the method embodiments shown in FIG. 3, FIG. 4a and FIG. 5. The transceiver unit 820 is configured to perform the receiving action and the sending action performed by the encoding end and the decoding end in the method embodiments. The processing unit 810 is configured to perform the actions performed by the encoding end and the decoding end in the method embodiments, except for the sending action and the receiving action.

[0227] For example, when the communication apparatus 800 is configured to implement the functions of the encoding end in the method embodiment shown in FIG. 4a, the transceiver unit 820 is configured to send the first message. The processing unit 810 is configured to perform at least one of the steps 400 to 404.

[0228] For example, when the communication apparatus 800 is configured to implement the functions of the decoding end in the method embodiment shown in FIG. 4a, the transceiver unit 820 is configured to receive the first message. The processing unit 810 is configured to perform at least one of the steps 406 to 409.

[0229] The detailed description of the processing unit 810 and the transceiver unit 820 can be directly obtained by referring to the related description in the method embodiments shown in FIG. 3, FIG. 4a and FIG. 5, which will not be repeated here. The processing unit 810 can be implemented by a processor, and the transceiver unit 820 can be implemented by a transceiver.

[0230] As shown in FIG. 9, the communication apparatus 900 includes a processor 910 and an interface circuit 920. The processor 910 and the interface circuit 920 are coupled with each other. It can be understood that the interface circuit 920 can be a transceiver or an input / output interface. Optionally, the communication apparatus 900 can further include a memory 930, configured to store the instructions executed by the processor 910, or store the input data required by the processor 910 to execute the instructions, or store the data generated after the processor 910 executes the instructions. Sometimes, the interface circuit 920 can also be understood as a part of the processor 910, and at this time, the communication apparatus 900 includes the processor 910.

[0231] When the communication apparatus 900 is configured to implement the method shown in FIG. 3, FIG. 4a and FIG. 5, the processor 910 is configured to implement the functions of the processing unit 810, and the interface circuit 920 is configured to implement the functions of the transceiver unit 820.

[0232] When the communication apparatus is a chip applied to a terminal device, the terminal device chip implements the functions of the terminal device in the method embodiments. The terminal device chip receives information from a network device, which can be understood as the information being received by other modules (such as a radio frequency module or an antenna) in the terminal device first, and then being sent to the terminal device chip by the modules. The terminal device chip sends information to the network device, which can be understood as the information being sent to other modules (such as a radio frequency module or an antenna) in the terminal device first, and then being sent to the network device by the modules.

[0233] When the communication apparatus is a chip applied to a network device, the network device chip implements the functions of the network device in the method embodiments. The network device chip receives information from a terminal device, which can be understood as the information being received by other modules (such as a radio frequency module or an antenna) in the network device first, and then being sent to the network device chip by the modules. The network device chip sends information to the terminal device, which can be understood as the information being sent to other modules (such as a radio frequency module or an antenna) in the network device first, and then being sent to the terminal device by the modules. The network device module here can be a baseband chip of the network device, or a DU or other module, and the DU here can be a DU under the O-RAN architecture.

[0234] In this application, entity A sending information to entity B can be A sending directly to B, or A sending indirectly to B through other entities. Similarly, entity B receiving information from entity A can be entity B receiving the information sent by entity A directly, or entity B receiving the information sent by entity A indirectly through other entities. The entities A and B here can be network devices or terminal devices, or modules inside a network device or modules inside a terminal device. The sending and receiving of information can be the information interaction between a network device and a terminal device, or the information interaction between two network devices, such as the information interaction between a CU and a DU; or the sending and receiving of information can be the information interaction between different modules in one device, such as the information interaction between a terminal device chip and other modules in the terminal device, or the information interaction between a network device chip and other modules in the network device.

[0235] It can be understood that the processor in the embodiments of the present application can be a central processing unit (CPU), and can also 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 can be a microprocessor or any conventional processor.

[0236] The embodiment of the present application further provides a computer readable storage medium, which stores a computer program. When the computer program is executed by a computer, the computer program can make the computer execute the communication method.

[0237] The embodiment of the present application further provides a computer program product, which comprises computer program code. When the computer program code is executed on a computer, the computer program code can make the computer execute the communication method provided in the embodiment of the present application.

[0238] The embodiment of the present application further provides a communication system, which comprises an encoding end and a decoding end for executing the communication method.

[0239] The method steps in the embodiment of the present application can be realized by a hardware mode or a mode of executing software instructions by a processor. 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 compact disc read-only memory (CD-ROM) (also referred to as a read-only optical disc) 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 as discrete components in the base station or the terminal.

[0240] In the above embodiments, all or part of the embodiments can be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or part of the embodiments can 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 programs or instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments are performed. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a first control plane network element, user equipment or other programmable apparatus. The computer programs or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another computer-readable storage medium, for example, the computer programs or instructions can be transferred from one website, computer, server or data center to another website, computer, server or data center through a wired or wireless manner. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center and the like integrated with one or more available media. The available medium can be a magnetic medium, for example, a floppy disk, a hard disk, a magnetic tape; or an optical medium, for example, a digital video disc; or a semiconductor medium, for example, a solid state disk. The computer-readable storage medium can be a volatile or non-volatile storage medium, or can include both volatile and non-volatile storage media.

[0241] In various embodiments of the present application, the terms and / or descriptions of different embodiments are consistent and can be referred to each other if there is no special description and logical conflict, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0242] 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 "multiple" means two or more. "And / or" describes the association relationship of the associated objects, which means that there can be three relationships, for example, A and / or B, which can represent the following cases: A exists alone, A and B exist together, and B exists alone. The character " / " generally represents that the associated objects before and after it are in an "or" relationship. For example, A / B means A or B. "At least one of the following" or "one or more of the following" and the like means any combination of these items, including any combination of single item or multiple items. For example, at least one of a, b and (or) c, or one or more of a, b and (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.

[0243] The terms "first", "second", and the like in the embodiments of the present application are used to distinguish a plurality of objects, and are not used to limit the size, content, order, time sequence, priority, or importance of the plurality of objects. Moreover, such names do not represent the difference in the content, the sending / receiving end, the sending order, the size, the application scenario, the priority, or the importance, and the like included in the two pieces of information. In addition, the numbering of the steps in each embodiment introduced in the present application is only for distinguishing different steps, and is not used to limit the order between the steps.

Claims

1. A communication method, characterized in that, Applied to the encoding end; including: Generate a first message; the first message includes C code blocks, where C is determined according to the upper limit of decoding complexity supported by the decoder, and the decoding complexity of decoding each of the C code blocks does not exceed the upper limit of decoding complexity, where C is an integer greater than or equal to 1; Send the first message.

2. The method as described in claim 1, characterized in that, When the decoding end uses the random noise guessing decoding GRAND method for decoding: The C is specifically determined based on the upper limit of decoding complexity, the length of the first information block to be transmitted, and the maximum flip order corresponding to the GRAND method; or, the C is specifically determined based on the upper limit of decoding complexity, the length of the encoded bits corresponding to the transmission resource carrying the first information block to be transmitted, and the maximum flip order corresponding to the GRAND method, wherein the total length of the C code blocks is the length of the encoded bits corresponding to the transmission resource; the C code blocks are obtained by dividing the first information block into C second information blocks and encoding each second information block.

3. The method as described in claim 2, characterized in that, The upper limit of the decoding complexity includes the upper limit of the number of test error patterns.

4. The method as described in claim 1, characterized in that, The C is determined based on the upper limit of the first decoding length supported by the decoding end and the length of the first information block to be transmitted; the upper limit of the first decoding length is determined based on the upper limit of the decoding complexity; the C code blocks are obtained by dividing the first information block into C second information blocks and encoding each second information block.

5. The method as described in claim 1, characterized in that, The C is determined based on the upper limit of the second decoding length supported by the decoding end and the length of the encoded bits corresponding to the transmission resource carrying the first information block to be transmitted. The total length of the C code blocks is the length of the encoded bits corresponding to the transmission resource. The upper limit of the second decoding length is determined based on the upper limit of the decoding complexity. The C code blocks are obtained by dividing the first information block into C second information blocks and encoding each second information block.

6. The method according to any one of claims 2-5, characterized in that, The length of the first information block is M, where M is an integer greater than or equal to 1; wherein: C*F is less than M, where the length of C-1 of the C second information blocks is F, and the length of one second information block is MF*(C-1); or, C*F is less than M, where the length of Ch second information blocks in the C second information blocks is F, and the length of h second information blocks is F+1, where h is an integer greater than 1.

7. The method according to any one of claims 1-6, characterized in that, Also includes: Receive a first instruction, which is used to instruct the C.

8. The method according to any one of claims 1-7, characterized in that, When the decoding end uses the random noise guessing decoding GRAND method for decoding, it also includes: Receive a second instruction, which indicates the upper limit of the decoding complexity and the maximum flip order corresponding to the GRAND method.

9. The method as described in claim 2 or 3, characterized in that, The methods for determining C include: The following operation is repeated until the complexity of decoding any code block in segment C does not exceed the upper limit of the decoding complexity. Then, the final C is taken as the final C: Obtain a C-segment code block, which is obtained by dividing information of a first length based on the C-pair; the first length is the length of the first information block to be transmitted or the coded bit length corresponding to the transmission resource. Based on the maximum flip order, determine whether the decoding complexity of any code block in the C-segment code block does not exceed the upper limit of the decoding complexity. If not, then the updated C is obtained by adding 1 to C.

10. A communication method, characterized in that, Applied to the decoding end; including: Receive a first message; the first message includes C code blocks, where C is determined according to the upper limit of decoding complexity supported by the decoder, and the decoding complexity of decoding each of the C code blocks does not exceed the upper limit of decoding complexity, where C is an integer greater than or equal to 1; Decode each of the C code blocks.

11. The method as described in claim 10, characterized in that, The decoding process for each of the C code blocks includes: Each of the C code blocks is decoded using the random noise guessing decoding GRAND method; Wherein, C is specifically determined based on the upper limit of decoding complexity, the length of the first information block to be transmitted, and the maximum flip order corresponding to the GRAND method; or, C is specifically determined based on the upper limit of decoding complexity, the length of the encoded bits corresponding to the transmission resource carrying the first information block to be transmitted, and the maximum flip order corresponding to the GRAND method, and the total length of the C code blocks is the length of the encoded bits of the transmission resource.

12. The method as described in claim 11, characterized in that, The upper limit of the decoding complexity includes the upper limit of the number of test error patterns.

13. The method as described in claim 10, characterized in that, The C is determined based on the upper limit of the first decoding length supported by the decoding end and the length of the first information block to be transmitted by the encoding end; the upper limit of the first decoding length is determined based on the upper limit of the decoding complexity.

14. The method as described in claim 10, characterized in that, The C is determined based on the upper limit of the second decoding length supported by the decoding end and the length of the encoded bits corresponding to the transmission resource carrying the first information block to be transmitted; the upper limit of the second decoding length is determined based on the upper limit of the decoding complexity; the total length of the C code blocks is the length of the encoded bits corresponding to the transmission resource.

15. The method according to any one of claims 10-14, characterized in that, Also includes: Send a first instruction, which is used to instruct the C.

16. The method according to any one of claims 10-14, characterized in that, Also includes: Send a second instruction, which indicates the upper limit of the decoding complexity and the maximum flip order corresponding to the GRAND method.

17. The method as described in claim 11 or 12, characterized in that, The methods for determining C include: The following operation is repeated until the complexity of decoding any code block in segment C does not exceed the upper limit of the decoding complexity. Then, the final C is taken as the final C: Obtain a C-segment code block, which is obtained by dividing information of a first length based on the C-pair; the first length is the length of the first information block to be transmitted or the coded bit length corresponding to the transmission resource. Based on the maximum flip order, determine whether the decoding complexity of any code block in the C-segment code block does not exceed the upper limit of the decoding complexity. If not, then the updated C is obtained by adding 1 to C.

18. A communication device, characterized in that, It includes modules for performing the method as described in any one of claims 1-9, or modules for performing the method as described in any one of claims 10-17.

19. A communication device, characterized in that, Includes a processor, which is coupled to a memory; The processor is configured to execute some or all of the computer programs or instructions in the memory, and when the some or all of the computer programs or instructions are executed, to implement the method as described in any one of claims 1-9, or to implement the method as described in any one of claims 10-17.

20. A communication device, characterized in that, Including processor and memory; The memory is used to store computer programs or instructions; The processor is configured to execute some or all of the computer programs or instructions in the memory, and when the some or all of the computer programs or instructions are executed, to implement the method as described in any one of claims 1-9, or to implement the method as described in any one of claims 10-17.

21. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions, which, when executed by a communication device, implement the method as described in any one of claims 1-9, or the method as described in any one of claims 10-17.

22. A computer program product, characterized in that, The computer program product includes: computer instructions that, when executed on a computer, cause the method as described in any one of claims 1-9 to be implemented, or cause the method as described in any one of claims 10-17 to be implemented.

Images