Communication method and apparatus

Abstract

The application provides a communication method and device, which are suitable for the field of communication. The method comprises the following steps: determining a first parameter according to first information, wherein the first information comprises at least one of the following: the number of bits to be encoded, the size of a transmission resource, a first code rate, or a decoding complexity, and the first parameter is used to indicate the code length of an RM code; and outputting a code word after RM encoding of the bits to be encoded based on the first parameter. The first parameter of the RM code is determined by considering the at least one item, so that the RM code meets / is suitable for the system requirement more, thereby improving the system performance, such as reducing the decoding complexity, improving the decoding performance and the like.

Description

Technical Field

[0001] This application relates to the field of communications, and particularly to communication methods and apparatus in the field of communications. Background Technology

[0002] In wireless communication, channel coding is one of the core technologies. Reed-Muller (RM) codes are one type of channel coding. Currently, in control channel coding, if the number of bits for control channel information is greater than or equal to 3 and less than or equal to 11, RM codes are used to encode the control information. For example, if the number of bits for information is greater than or equal to 3 and less than or equal to 11, the control information is encoded into a codeword of length 32 based on RM(5,1) codes.

[0003] However, for scenarios with 7 or more information bits, the encoding gain provided by the above encoding method is limited; for scenarios with 6 or fewer information bits, the decoding complexity of the decoding device is relatively high under the above encoding method. In summary, the system performance under the above encoding method needs to be improved. Summary of the Invention

[0004] This application provides a communication method and apparatus in order to improve system performance.

[0005] In a first aspect, this application provides a communication method, which can be executed by a first communication device. The first communication device can be a terminal / access network device, or a component (such as a processor, circuit, chip, chip system, etc.) configured in the terminal / access network device, or a logic module or software capable of realizing all or part of the functions of the terminal / access network device. This application does not limit the scope of the application.

[0006] For example, the method includes: determining a first parameter based on first information, wherein the first information includes at least one of the following: the number of bits to be encoded, the size of the transmission resource, a first code rate, or decoding complexity, wherein the first parameter is used to indicate the code length of the RM code; and outputting a codeword after RM encoding of the bits to be encoded based on the first parameter.

[0007] The first parameter mentioned above is used to indicate the code length of the RM code. Alternatively, it can be replaced with the first parameter mentioned above being used to determine the code length of the RM code. The first parameter mentioned above can also be called the code length parameter. This application does not limit this name.

[0008] In the above scheme, the first communication device can consider at least one of the following: the number of bits to be encoded, the size of the transmission resources, the first code rate, or the decoding complexity, to determine the code length parameter of the RM code, so that the RM code better meets / suits the requirements of the encoding system, thereby improving system performance, such as reducing decoding complexity and improving decoding performance.

[0009] Optionally, the above RM encoding is a first-order RM encoding.

[0010] In conjunction with the first aspect, in some possible implementations of the first aspect, when the first information includes the number of bits to be encoded, the first parameter is equal to k-1, where k represents the number of bits to be encoded.

[0011] By determining m by k, the encoding capability of the selected first-order RM code can be just right to meet the encoding requirements. In this way, error correction capability can be guaranteed, decoding complexity can be reduced, and system design can be simplified, resulting in better overall system performance.

[0012] In conjunction with the first aspect, in some possible implementations of the first aspect, when the aforementioned first information includes the size of the transmission resources, and N∈(2... M ,2 M+1 When N is used, the value range of the first parameter is [a, M+1], where N represents the size of the transmission resource and a is an integer greater than or equal to 1.

[0013] Optionally, the first parameter mentioned above is equal to M+1.

[0014] By using the first parameter m determined in the above manner for first-order RM encoding, the length of the encoded codeword is closer to the size of the transmission resource. This helps to reduce the complexity of rate matching and decoding, thereby improving the overall performance of the system.

[0015] In conjunction with the first aspect, in some possible implementations of the first aspect, when the first information includes the size of the transmission resource, the range to which the first parameter and the size of the transmission resource belong satisfy a first correspondence relationship, which is used to indicate the correspondence relationship between at least one first range and at least one first parameter, and the at least one first range is used to indicate the size range of the transmission resource.

[0016] The range of the size of the transmission resource corresponds to the first parameter. The size of the transmission resource can be indicated by the access network device, for example. In this way, the first communication device can flexibly select the first parameter m according to the size of the transmission resource.

[0017] In conjunction with the first aspect, in some possible implementations of the first aspect, when the first information is the first bit rate, the first parameter is equal to m, where m satisfies: the difference between the second bit rate after RM encoding based on m and the first bit rate satisfies the first threshold.

[0018] The first parameter is determined by considering the first bit rate, so that the encoded bit rate is closer to the first bit rate, thereby ensuring system performance.

[0019] In conjunction with the first aspect, in some possible implementations of the first aspect, when the first information includes decoding complexity, the first parameter and the decoding complexity satisfy a second correspondence, or the range to which the first parameter and the decoding complexity belong satisfies a second correspondence, the second correspondence being used to indicate the correspondence between at least one decoding complexity and at least one first parameter, or to indicate the correspondence between at least one second range and at least one first parameter, the at least one second range being used to indicate the range of decoding complexity.

[0020] By considering the decoding complexity, the first parameter is determined so that the decoding complexity of the decoder does not exceed its supported decoding complexity, which is beneficial to improving decoding performance.

[0021] In conjunction with the first aspect, in some possible implementations of the first aspect, when the aforementioned first information includes decoding complexity, the number of bits to be encoded, and the size of transmission resources, the decoding complexity, the number of bits to be encoded, the size of transmission resources, and the first parameter satisfy the third correspondence.

[0022] By comprehensively considering the decoding complexity, the number of bits to be encoded, and the size of the transmission resources, the first parameter can be determined, which helps to balance decoding complexity and decoding performance, thereby improving the overall performance of the system.

[0023] In conjunction with the first aspect, in some possible implementations of the first aspect, when the aforementioned first information includes decoding complexity, the number of bits to be encoded, and the first code rate, the decoding complexity, the number of bits to be encoded, the first code rate, and the first parameter satisfy the sixth correspondence relationship.

[0024] By comprehensively considering decoding complexity, the number of bits to be encoded, and the first code rate, the first parameter can be determined, which helps to balance decoding complexity and decoding performance, thereby improving the overall performance of the system.

[0025] In conjunction with the first aspect, in some possible implementations of the first aspect, when the aforementioned first information includes decoding complexity, the size of transmission resources, and the first code rate, the decoding complexity, the size of transmission resources, the first code rate, and the first parameter satisfy the seventh correspondence relationship.

[0026] By comprehensively considering decoding complexity, the size of transmission resources, and the first code rate, the first parameter can be determined, which helps to balance decoding complexity and decoding performance, thereby improving the overall performance of the system.

[0027] Optionally, the number of bits to be encoded, the size of the transmission resources, and the first code rate satisfy the fourth correspondence.

[0028] The number of bits to be encoded can be determined based on the size of the transmission resources and the first code rate, or the size of the transmission resources can be determined based on the first code rate and the number of bits to be encoded.

[0029] Optionally, the first code rate described above satisfies a fifth correspondence with at least one of the following: modulation and coding scheme (MCS) index, modulation order, or spectral efficiency.

[0030] The first code rate mentioned above can be determined based on at least one of the following: MCS index, modulation order, or spectral efficiency, and the fifth correspondence.

[0031] In conjunction with the first aspect, in some possible implementations of the first aspect, when the number of bits to be encoded is less than m+1, the codeword is obtained by RM encoding the bits to be encoded based on the first matrix. The first matrix is ​​obtained by freezing the first generator matrix. The first generator matrix is ​​the generator matrix of the first-order RM code corresponding to the first parameter being m. The number of frozen rows is m+1-k, where k represents the number of bits to be encoded.

[0032] Optionally, each frozen row in the first generating matrix described above includes the element 0.

[0033] In conjunction with the first aspect, in some possible implementations of the first aspect, when the number of bits to be encoded is greater than m+1, the codeword is obtained by RM encoding multiple segments based on the second generator matrix. The second generator matrix is ​​the generator matrix corresponding to at least one first-order RM code. The bits to be encoded include the multiple segments, and m represents the first parameter.

[0034] In conjunction with the first aspect, in some possible implementations of the first aspect, when the number of bits to be encoded is greater than m+1, the codeword is obtained by RM encoding the bits to be encoded based on the second matrix. The second matrix is ​​obtained by freezing the third generator matrix. The third generator matrix is ​​the generator matrix corresponding to the high-order RM code with the first parameter value of m, and the number of frozen rows is... k represents the number of bits to be encoded, and r represents the order of the higher-order RM code.

[0035] In conjunction with the first aspect, in some possible implementations of the first aspect, when the number of bits to be encoded is greater than m+1, the above codeword is obtained by RM encoding the bits to be encoded based on the third matrix. The third matrix is ​​obtained by extending the first generator matrix by km-1 rows. The first generator matrix is ​​the generator matrix of the first-order RM code corresponding to the first parameter being m, where k represents the number of bits to be encoded.

[0036] Secondly, this application provides a communication method that can be executed by a second communication device. The second communication device can be a terminal / access network device, a component configured in the terminal / access network device (such as a processor, circuit, chip, chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the terminal / access network device. This application does not limit the scope of the application.

[0037] For example, the method includes: determining a first parameter based on first information, the first information including at least one of the following: the number of bits to be encoded, the size of the transmission resource, a first code rate, or decoding complexity, wherein the first parameter is used to indicate the code length of the RM code; and decoding the sequence to be decoded based on the first parameter.

[0038] In conjunction with the second aspect, in some possible implementations of the second aspect, when the first information includes the number of bits to be encoded, the first parameter is equal to k-1, where k represents the number of bits to be encoded.

[0039] In conjunction with the second aspect, in some possible implementations of the second aspect, when the aforementioned first information includes the size of the transmission resources, and N∈(2... M ,2 M+1 When N is used, the value range of the first parameter is [a, M+1], where N represents the size of the transmission resource and a is an integer greater than or equal to 1.

[0040] Optionally, the first parameter mentioned above is equal to M+1.

[0041] In conjunction with the second aspect, in some possible implementations of the second aspect, when the first information includes the size of the transmission resource, the range to which the first parameter and the size of the transmission resource belong satisfy a first correspondence relationship, which is used to indicate the correspondence relationship between at least one first range and at least one first parameter, and the at least one first range is used to indicate the range of the size of the transmission resource.

[0042] In conjunction with the second aspect, in some possible implementations of the second aspect, when the first information is the first bit rate, the first parameter is equal to m, where m satisfies: the difference between the second bit rate after RM encoding based on m and the first bit rate satisfies the first threshold.

[0043] In conjunction with the second aspect, in some possible implementations of the second aspect, when the first information includes decoding complexity, the first parameter and the decoding complexity satisfy a second correspondence, or the range to which the first parameter and the decoding complexity belong satisfies a second correspondence. This second correspondence is used to indicate the correspondence between at least one decoding complexity and at least one first parameter, or to indicate the correspondence between at least one second range and at least one first parameter. The at least one second range is used to indicate the range of decoding complexity.

[0044] In conjunction with the second aspect, in some possible implementations of the second aspect, when the aforementioned first information includes decoding complexity, the number of bits to be encoded, and the size of transmission resources, the decoding complexity, the number of bits to be encoded, the size of transmission resources, and the first parameter satisfy the third correspondence.

[0045] In conjunction with the second aspect, in some possible implementations of the second aspect, when the aforementioned first information includes decoding complexity, the number of bits to be encoded, and the first code rate, the decoding complexity, the number of bits to be encoded, the first code rate, and the first parameter satisfy the sixth correspondence relationship.

[0046] In conjunction with the second aspect, in some possible implementations of the second aspect, when the aforementioned first information includes decoding complexity, the size of transmission resources, and the first code rate, the decoding complexity, the size of transmission resources, the first code rate, and the first parameter satisfy the seventh correspondence relationship.

[0047] Optionally, the number of bits to be encoded, the size of the transmission resources, and the first code rate satisfy the fourth correspondence.

[0048] Optionally, the first code rate described above satisfies a fifth correspondence with at least one of the following: MCS index, modulation order, or spectral efficiency.

[0049] It should be understood that the second aspect of this application corresponds to the technical solution of the first aspect of this application, and the beneficial effects achieved by each aspect and the corresponding feasible implementation are similar, and will not be repeated here.

[0050] Thirdly, this application provides a communication device capable of implementing the method described in the first aspect and any possible implementation thereof, or implementing the method described in the second aspect and any possible implementation thereof. The device includes corresponding modules for performing the above-described methods. The modules included in the device can be implemented in software and / or hardware.

[0051] Fourthly, this application provides a communication device comprising at least one processor, the at least one processor being configured to execute a computer program in a memory to implement the method described in the first aspect and any possible implementation thereof, or to implement the method described in the second aspect and any possible implementation thereof.

[0052] Optionally, the device further includes a communication interface, to which the processor is coupled. The communication interface is used to receive signals from other communication devices outside the device and transmit them to the processor, or to send signals from the processor to other communication devices outside the device. Exemplarily, the communication interface may be a transceiver, circuit, bus, module, pin, or other type of communication interface.

[0053] Optionally, the device further includes a memory, to which the processor is coupled. The memory stores program instructions and data. The memory is coupled to the processor, and when the processor executes the instructions stored in the memory, it can implement the methods described in the preceding aspects.

[0054] Fifthly, this application provides a computer-readable storage medium storing a computer program or instructions that, when executed, implement the method described in the first aspect and any possible implementation thereof, or implement the method described in the second aspect and any possible implementation thereof.

[0055] In a sixth aspect, this application provides a computer program product comprising instructions (or a computer program) that, when executed, implement the method described in the first aspect and any possible implementation thereof, or implement the method described in the second aspect and any possible implementation thereof.

[0056] In a seventh aspect, this application provides a chip system including at least one processor for supporting the implementation of the functions involved in the first aspect and any possible implementation of the first aspect, or supporting the implementation of the functions involved in the second aspect and any possible implementation of the second aspect, such as receiving or processing data involved in the above methods.

[0057] In one possible design, the chip system also includes a memory for storing program instructions and data, which may be located within or outside the processor.

[0058] In one possible design, the chip system further includes an interface circuit and / or a power supply circuit, wherein the interface circuit is used to transmit data and the power supply circuit is used to supply power to the chip system.

[0059] The chip system can consist of chips or include chips and other discrete components.

[0060] Eighthly, this application provides a communication system comprising a first communication device and a second communication device, wherein the first communication device is used to implement the method described in the first aspect and any possible implementation thereof, and the second communication device is used to implement the method described in the second aspect and any possible implementation thereof.

[0061] It should be understood that the third to eighth aspects of this application correspond to the technical solutions of the first and second aspects of this application, and the beneficial effects achieved by each aspect and the corresponding feasible implementation are similar, and will not be repeated here. Attached Figure Description

[0062] Figure 1 This is a schematic diagram of the architecture of a communication system applicable to the methods provided in the embodiments of this application;

[0063] Figure 2 This is a schematic diagram of a communication scenario applicable to the method provided in the embodiments of this application;

[0064] Figure 3 This is a schematic flowchart of the communication method provided in the embodiments of this application;

[0065] Figure 4 This is a schematic diagram of the generator matrix corresponding to the RM(3,2) code provided in the embodiments of this application;

[0066] Figure 5 This is a schematic block diagram of the communication device provided in the embodiments of this application;

[0067] Figure 6 This is a schematic block diagram of another communication device provided in the embodiments of this application;

[0068] Figure 7 This is a schematic block diagram of another communication device provided in the embodiments of this application;

[0069] Figure 8 This is a schematic block diagram of another communication device provided in the embodiments of this application;

[0070] Figure 9 This is a schematic diagram of the communication chip system architecture provided in the embodiments of this application. Detailed Implementation

[0071] To facilitate understanding of the technical solution provided in this application, the following points are made first:

[0072] First, in this application, the use of prefixes such as "first" and "second" is merely for the purpose of distinguishing and describing different things belonging to the same name category, and does not constrain the order, size, or quantity of things. For example, "first generation matrix," "second generation matrix," and "third generation matrix" are simply generation matrices corresponding to different RM codes, and there is no temporal order, size relationship, or priority relationship between them.

[0073] Second, in this application, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion.

[0074] For example, an apparatus, system, product, or device that includes a series of modules, units, or components is not necessarily limited to those explicitly listed, but may include other modules, units, or components not explicitly listed or inherent to such apparatus, system, product, or device. As another example, the first information includes at least one of the following: the number of bits to be encoded, the size of the transmission resource, the first code rate, or the decoding complexity. This application does not limit the first information to only including the explicitly listed parameters; the first information may also include other parameters not listed. As long as one or more parameters are considered in determining the code length parameter of the RM code, it should fall within the protection scope of this application.

[0075] Third, in this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates an "or" relationship between the preceding and following related objects, but it does not exclude the possibility of indicating an "and" relationship; the specific meaning can be understood in context. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of singular or plural items. For example, at least one of a, b, or c can mean: a, b, c; a and b; a and c; b and c; or a and b and c. Here, a, b, and c can be single or multiple.

[0076] Fourth, in this application, "when," "if," and "if" all refer to the fact that the device (such as a terminal or network device) will make corresponding processing under certain objective circumstances. They are not time limits, nor do they require the device (such as a terminal or network device) to make a judgment when it is implemented, nor do they mean that there are other limitations.

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

[0078] Sixth, in this application, "instruction" can include direct and indirect instructions, as well as explicit and implicit instructions. The information indicated by a certain piece of information is called the information to be instructed, such as one or more items indicated by the resource update message in the embodiments of this application. In specific implementation, there are many ways to indicate the information to be instructed, such as, but not limited to, directly indicating the information to be instructed, such as the information to be instructed itself or its index. It can also indirectly indicate the information to be instructed by indicating other information, where there is an association between the other information and the information to be instructed; or it can only indicate a part of the information to be instructed, while the other parts are known or pre-agreed upon. For example, the instruction can be implemented by using a pre-agreed (e.g., protocol predefined) arrangement of various information, thereby reducing the instruction overhead to a certain extent. This application does not limit the specific method of instruction. It is understood that for the sender of the instruction information, the instruction information can be used to indicate the information to be instructed, and for the receiver of the instruction information, the instruction information can be used to determine the information to be instructed.

[0079] Seventh, the tables in the embodiments of this application are merely examples. The values ​​of the information in each table are only examples and can be configured to other values; this application is not limited thereto. The tables do not limit the scope of protection of this application. For example, appropriate modifications and adjustments can be made based on the tables described above, such as splitting, merging, etc. Furthermore, the parameter names shown in the headings of each table can also use other names understandable to the communication device, and the values ​​or representations of the parameters can also be other values ​​or representations understandable to the communication device. Moreover, in the implementation of the above tables, other data structures can also be used, such as arrays, queues, containers, stacks, linear lists, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables, etc.

[0080] Furthermore, the tables in the embodiments of this application may be predefined or configured by the network device, and this application does not limit them. In addition, in this application, "predefined" can also be understood as: definition, pre-defined, stored, pre-stored, pre-negotiated, pre-configured, solidified, or pre-burned, etc.

[0081] Eighth, the technical solutions provided in this application can be applied to various communication systems, such as: Long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, sidelink communication systems, Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) communication systems, 5th Generation (5G) mobile communication systems, or new radio access technology (NR), or future communication systems.

[0082] The following will combine Figure 1 The system architecture to which this application applies is described exemplarily.

[0083] Figure 1 This is a schematic diagram of the architecture of a communication system applicable to the methods provided in the embodiments of this application. Figure 1 The application scenarios applicable to this application are illustrated using the communication system architecture shown as an example. Figure 1 A possible, non-limiting system schematic diagram is shown. For example... Figure 1 As shown, the communication system includes RAN 100 and core network (CN) 200. Optionally, the communication system also includes Internet 30. RAN 100 includes at least one access network device (such as... Figure 1 110a and 110b (collectively referred to as 110) and at least one terminal device (such as Figure 1 RAN 100, denoted as RAN 120a-120j, is collectively referred to as RAN 120. RAN 100 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment. Figure 1 (Not shown in the image). Terminal device 120 is connected to access network device 110 wirelessly. Access network device 110 is connected to core network 200 wirelessly or via wired connection. The core network device in core network 200 and access network device 110 in RAN 100 can be different physical devices, or they can be the same physical device integrating core network logical functions and wireless access network logical functions.

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

[0085] Understandable, Figure 1 This application only illustrates one possible communication system architecture that can be applied to an embodiment of the present application. In other possible scenarios, the communication system architecture may also include other devices.

[0086] In the aforementioned communication system, access network device 110 assists terminal devices in achieving wireless access. Multiple access network devices 110 in this communication system can be nodes of the same type or different types. In some scenarios, the roles of access network device 110 and terminal device 120 are relative, for example... Figure 1 Network element 120i can be a helicopter or a drone, and it can be configured as a mobile base station. For terminal devices 120j that access RAN 100 via network element 120i, network element 120i is a base station; however, for base station 110a, network element 120i is a terminal device. Access network device 110 and terminal device 120 are sometimes referred to as communication devices, for example... Figure 1 Network elements 110a and 110b can be understood as communication devices with base station functions, while network elements 120a-120j can be understood as communication devices with terminal functions.

[0087] In one possible scenario, access network equipment 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, a satellite, or an access point (AP) in a wireless fidelity (Wi-Fi) system, an integrated access and backhaul (IAB) node, or access network equipment in a mobile switching center non-terrestrial network (NTN) communication system; that is, it can be deployed on high-altitude platforms or satellites. Access network equipment can also be a macro base station (such as...). Figure 1 110a), micro base stations or indoor stations (such as Figure 1 Access network equipment can be 110b), relay nodes or donor nodes, or wireless controllers in CRAN scenarios. It can also function as a base station in device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, drone communication, or machine-to-machine (M2M) communication. Optionally, access network equipment can also be servers, wearable devices, vehicles, or in-vehicle equipment. For example, in vehicle-to-everything (V2X) technology, the access network equipment can be a roadside unit (RSU).

[0088] In another possible scenario, multiple access network devices collaborate to assist terminals in achieving wireless access, with each device performing a portion of the base station's functions. For example, access network devices can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs). CUs and DUs can be separate entities or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs). It is understood that access network devices can be CU nodes, DU nodes, or devices comprising both CU and DU nodes. Furthermore, CUs can be classified as access network devices within the RAN (RAN) or the CN (CN), without limitation.

[0089] In this embodiment, the form of the access network device is not limited. The device used to implement the function of the access network device can be the access network device itself; or it can be a device that supports the access network device in implementing the function, such as a chip system. The device can be installed in the access network device or used in conjunction with the access network device.

[0090] In this application, the terminal device may also be referred to as a terminal, user equipment (UE), mobile station (MS), mobile terminal (MT), etc., or a device used to provide voice or data connectivity to a user, or an Internet of Things (IoT) device. For example, terminal devices include handheld devices with wireless connectivity, vehicle-mounted devices, etc. Currently, terminal devices can include, for example: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices (such as smartwatches, smart bracelets, pedometers, smart glasses, etc.), in-vehicle devices (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), satellite terminals, virtual reality (VR) devices, augmented reality (AR) devices, smart point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (UE), reduced capability user equipment (REDCAP UE), wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity meters, etc.), smart robots, robotic arms, workshop equipment, wireless terminals in autonomous driving, wireless terminals in smart healthcare, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, and flying equipment (such as smart robots, hot air balloons, drones, airplanes), etc. The terminal can also be a vehicle device, such as a vehicle unit, vehicle module, vehicle chip, on-board unit (OBU), or telematics box (T-BOX). The terminal device can also be other devices with terminal functions. For example, the terminal device can also be a device that plays the role of a terminal in D2D communication.

[0091] This application does not limit the form of the terminal device. The device used to implement the terminal's functions can be a terminal device itself, or it can be a device that supports the terminal in implementing those functions, such as a chip system. This device can be installed in the terminal or used in conjunction with the terminal. In this application, the chip system can be composed of chips, or it can include chips and other discrete components.

[0092] Figure 2 This is a schematic diagram of a communication scenario applicable to the method provided in the embodiments of this application.

[0093] like Figure 2 As shown in a), the method provided in this application can be applied to point-to-point single-connection communication scenarios, where two communication devices can communicate directly through a single communication link. For example, an access network device and a terminal device can communicate directly through a single communication link. In one possible scenario, the access network device can act as the receiver, and the terminal device can act as the transmitter, with the terminal device directly sending signals to the access network device through the communication link; however, this should not constitute any limitation on this application. For instance, in another possible scenario, the access network device can act as the transmitter, and the terminal device can act as the receiver, with the access network device directly sending signals to the terminal device through the communication link.

[0094] like Figure 2 As shown in b), the method provided in this application can also be applied to multi-hop single-connection communication scenarios, where multiple relay devices are included between the source device and the target device, and the connection between each pair of adjacent devices is a single point-to-point connection. For example, the access network device and the terminal device communicate through multiple relay devices.

[0095] like Figure 2 As shown in c), the method provided in this application can also be applied to dual connectivity (DC) communication scenarios, where the terminal device can connect to two different access network devices (such as base stations) at the same time. The cell provided by the macro base station can be called the master cell group (MCG), and the corresponding base station can be called the master base station (abbreviated as master station). The cell provided by the small base station or micro base station can be called the secondary cell group (SCG), and the corresponding base station can be called the secondary base station (abbreviated as secondary station).

[0096] like Figure 2 As shown in d), the method provided in this application can also be applied to multi-hop, multi-connection communication scenarios. This architecture combines the features of multi-hop routing and multi-connection, with data transmitted through multiple relay devices and each device able to establish connections with multiple other devices simultaneously.

[0097] More generally, the communication scenarios to which the method provided in this application is applicable include, but are not limited to: signal transmission (including uplink and downlink transmission) between access network devices and terminal devices, signal transmission between access network devices and relay devices, signal transmission between relay devices and terminal devices, signal transmission between multiple access network devices and one terminal device, or signal transmission between multiple access network devices and multiple terminal devices.

[0098] It should be understood that Figure 2 The communication scenarios shown are merely examples and should not be construed as limiting the methods provided in this application.

[0099] To better understand the methods provided in the embodiments of this application, the relevant technologies of RM codes will be briefly explained below.

[0100] Binary RM codes contain multivariate polynomials in the binary field. The evaluation results are as follows. Consider a polynomial ring with m variables. For a polynomial and a binary vector Define Eval z (f)=f(z1,z2,…,z m Let f be the value of the polynomial f in the bivariate vector z. Define the evaluation vector of the polynomial f. That is, a coordinate of Eval(f) is the evaluation result of the polynomial f at a certain binary vector. Since The CCP has 2 m There are m-dimensional binary vectors, therefore, the evaluation vector Eval(f) has a total of 2... m Each dimension. For an RM code with parameters m and r, its codeword set can be defined as the set of evaluation vectors for all polynomials of order no higher than r, i.e.

[0101]

[0102] Here, deg(f) represents the order of the polynomial f. The parameter m can be called the code length parameter of the RM(m,r) code (or the first parameter of the RM code). The parameter m can be used to determine the code length; for example, the code length of the RM(m,r) code is equal to 2. m The parameter r can be called the order of the RM(m,r) code (or the second parameter of the RM code). The number of information bits k in the RM(m,r) code is equal to the number of m-ary binary monomials, i.e. in, Specifically, when r = 1,

[0103] Based on the definition of RM(m,r) codes above, the generator matrix (or encoding matrix) G of the RM(m,r) code can be determined. For example, for m=3 and r=2, the generator matrix of the RM(3,2) code is... A generator matrix can be used to encode an information bit sequence u into an encoded bit sequence x, for example, x = uG.

[0104] From the generator matrix G of the RM code, its inverse matrix G can be obtained. -1 Thus, for any valid RM codeword x∈RM(m,r), based on G -1The corresponding information bits u = xG can be obtained. -1 .

[0105] The above method for determining the generator matrix of an RM(m,r) code based on the definition of the RM(m,r) code is merely an example and should not be construed as limiting this application. For example, another method for determining the generator matrix of an RM(m,r) code is given below.

[0106] For example, based on the recursive properties of RM codes, the generator matrix of RM codes can be obtained. The generator matrix defined in this way can be called a recursive generator matrix, and this application does not limit its name. For any valid codeword x of RM(m,r), the codeword can be divided into a first half and a second half: x = (x1,x2), where x1,x2∈RM(m-1,r), and Suppose that the generating matrix of RM(m,r) is G. m,r When the information sequence is u, the corresponding generated RM codeword sequence is x = u·G m,r Based on the aforementioned recursive properties of RM codes, the generator matrix G can be... m,r Decomposed into the following form:

[0107]

[0108] Where 0 represents a matrix of all zeros, and its dimension is the same as G. m-1,r-1 They have the same dimensions.

[0109] Specifically, when r = 0, the RM code corresponds to a 1-bit repeat code, which means repeating 1 bit of information twice. m Therefore, its generating matrix is ​​1 row 2. m A matrix of all 1s in each column. When r = m, the RM code corresponds to a code with a code rate of 1, therefore its generator matrix is ​​a matrix of size 2. m The identity matrix.

[0110] Based on the above generating matrix G m,r By defining the decomposition method and the generator matrices of the two special RM codes mentioned above, the generator matrix of RM codes of arbitrary length can be obtained. For example, an RM(3,1) code can be composed of RM(2,0) and RM(2,1) codes; and an RM(2,1) code can be composed of RM(1,0) and RM(1,1). Therefore, the generator matrix of RM(3,1) is...

[0111]

[0112] For example, the basis of the RM code used in 5G NR is shown in Table 1. Each column in Table 1 represents a basis (which can also be viewed as a basis vector), using the input information bits u k With substrate M kMultiplying the data and then performing a bitwise XOR operation on the product of all information bits and their corresponding basis vectors yields the encoded codeword. Multiple basis vectors can form a basis matrix. The basis matrix corresponding to the RM code is determined by the parameters of the RM (such as m and r), where the number of columns in the basis matrix corresponds to the number of information bits, and the number of rows corresponds to the length of the codeword. In control channel coding, if the number of control channel information bits is greater than or equal to 3 and less than or equal to 11, the RM code is used to encode the control information. For example, when the number of information bits is greater than or equal to 3 and less than or equal to 11, the encoding device can extend the basis corresponding to RM(5,1) to encode the information bits, resulting in a 32-bit codeword. For instance, when the number of information bits is greater than 6, the encoding device can extend the basis corresponding to RM(5,1), such as extending columns 7 to 11, and then encode the information bits based on the extended matrix, resulting in a 32-bit codeword.

[0113] Table 1

[0114] <![CDATA[M0]]> <![CDATA[M1]]> <![CDATA[M2]]> <![CDATA[M3]]> <![CDATA[M4]]> <![CDATA[M5]]> <![CDATA[M6]]> <![CDATA[M7]]> <![CDATA[M8]]> <![CDATA[M9]]> <![CDATA[M 10 <!-- 10 -->]]> 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 0 1 0 0 1 0 1 1 1 1 0 1 1 0 0 0 0 1 0 1 1 1 1 1 0 0 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 1 0 0 1 0 1 1 1 0 1 1 1 0 1 0 0 1 1 1 0 1 0 0 1 1 1 0 1 1 1 1 1 0 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 0 0 0 1 1 0 1 0 0 1 1 1 0 0 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 0 1 0 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 1 0 0 0 1 1 1 0 1 0 0 0 0 0 1 1 1 0 0 0 1 0 0 1 1 0 1 1 1 1 0 1 0 0 0 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 0 0 0 1 1 1 0 0 1 1 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 0 0 1 0 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0

[0115] However, for scenarios with 7 or more information bits, the encoding gain provided by the above encoding method (i.e., the encoding method based on RM(5,1) code) is limited; for scenarios with 6 or fewer information bits, the decoding complexity of the decoding device is high under the above encoding method. In summary, the existing technology's fixed use of RM(5,1) code encoding method may affect system performance.

[0116] In view of this, this application provides a communication method in which the encoding device can determine the code length parameter (i.e., m) of the RM code by considering the requirements of the encoding system (such as the number of bits to be encoded, the size of the transmission resources, the first code rate, or the decoding complexity), so that the RM code better meets / suits the requirements of the encoding system, thereby improving system performance, such as reducing decoding complexity and improving decoding performance.

[0117] The communication method provided in this application will be described in detail below with reference to the accompanying drawings. The method is described below using the interaction between a first communication device and a second communication device as an example, and should not be construed as limiting this application in any way. The first communication device may also be replaced by components configured in the first communication device (such as processors, circuits, chips, chip systems, etc.), or by logic modules or software capable of implementing all or part of the functions of the first communication device. The second communication device may be replaced by components configured in the second communication device (such as processors, circuits, chips, chip systems, etc.), or by logic modules or software capable of implementing all or part of the functions of the second communication device. The first communication device may be, for example, an access network device or a terminal, and the second communication device may be, for example, an access network device or a terminal; this application does not limit this.

[0118] Figure 3 This is a schematic flowchart of the communication method 300 provided in the embodiments of this application. Figure 3 The method 300 shown includes steps 310, 320, 330, and 340. The steps in method 300 are described in detail below.

[0119] In step 310, the first communication device determines the first parameter based on the first information, which includes at least one of the following: the number of bits to be encoded, the size of the transmission resource, the first code rate, or the decoding complexity.

[0120] The aforementioned first communication device can be considered as an encoding end. The aforementioned first communication device can be a terminal device or an access network device, and this application does not limit the type of the first communication device.

[0121] The aforementioned first parameter can also be called the code length parameter, or the m-parameter of the RM code, etc. This application does not limit the name of the aforementioned first parameter. The aforementioned first parameter is used to indicate the code length of the RM code, or it can be replaced by the aforementioned first parameter being used to determine the code length of the RM code, such as the code length of the RM code = 2. m , where m represents the first parameter.

[0122] The number of bits to be encoded can also be regarded as the length of the sequence to be encoded.

[0123] The aforementioned transmission resources may be allocated by RAN equipment, for example. These transmission resources can be understood as physical resources used to carry data, such as time-domain resources, frequency-domain resources, and spatial-domain resources. The size of the aforementioned transmission resources can be understood as the length of the bit sequence that the transmission resource can carry, or the number of bits that the transmission resource can carry, or the amount of data that the transmission resource can carry. This application does not limit the way the size of the aforementioned transmission resources is represented.

[0124] The aforementioned first code rate may satisfy a fifth correspondence with at least one of the following: modulation and coding scheme (MCS) index, modulation order, or spectral efficiency. The first communication device may determine the first code rate based on the aforementioned fifth correspondence and at least one of the following: MCS index, modulation order, or spectral efficiency.

[0125] The aforementioned fifth correspondence can be represented, for example, by an MCS table, which can list different modulation orders, MCS indices, or spectral efficiencies and their corresponding code rates. Table 2 provides an example of an MCS table.

[0126] Table 2

[0127]

[0128] As shown in Table 2, when the MCS index is 0 or 1, the specific modulation scheme is determined by the q value. For example, when q = 1, the modulation scheme is π / 2-binary phase shift keying (BPSK) modulation, with a maximum code rate of 314 / 1024 = 0.307 and a corresponding spectral efficiency of 0.3066; when q = 2, the modulation scheme is quadrature phase shift keying (QPSK) modulation, with a maximum code rate of 240 / 1024 = 0.234 and a corresponding spectral efficiency of 0.2344. For example, the first communication device can determine the first code rate based on the MCS index, which may be indicated by the RAN device, for example. Alternatively, the first communication device can determine the first code rate based on the modulation order and spectral efficiency. These are not all listed here.

[0129] The first code rate corresponding to a codeword with a code length of 1024 is used as an example in Table 2 above, but this should not constitute any limitation on this application.

[0130] The aforementioned decoding complexity refers to the complexity of the decoding device (the second communication device described below) during the decoding process. Decoding complexity can affect system performance, and reducing decoding complexity can improve system performance. In this application, decoding complexity may refer, for example, to the complexity of the Fast Hadamard Transform (FHT) algorithm supported by the decoding device. This decoding complexity corresponds to processing power, where processing power may refer, for example, to the number of points of the FHT algorithm supported by the decoding device (i.e., the length of the supported input sequence). For example, the decoding complexity = nlog2n, where n represents the number of points of the FHT algorithm. For instance, if the decoding device supports a 1024-point FHT algorithm, then the decoding complexity supported by the decoding device = nlog2n = 1024 * log2(1024) = 1024 * 10 = 10240.

[0131] In this application, decoding complexity can also be replaced by the corresponding processing capability; that is, the first information mentioned above may include processing capability. This processing capability may also be referred to as the length of the supported input sequence, or the length of the supported decoding sequence, etc.

[0132] In uplink communication, the aforementioned decoding complexity may refer to the decoding complexity of the RAN device; in downlink communication, the aforementioned decoding complexity may refer to the decoding complexity of the terminal; in sidelink communication, the aforementioned decoding complexity may refer to the decoding complexity of the terminal, etc. This application does not limit the communication scenario.

[0133] It should be noted that, in the embodiments of this application, the unit of the size of the transmission resource may be, for example, bits; the unit of decoding complexity may be, for example, the number of operations; and the unit of processing power may be, for example, points per bit. It is understood that, for the sake of brevity, the units of the above parameters are not specified in the examples of this application.

[0134] The following will provide a detailed explanation of how the first communication device determines the first parameter based on the first information when the first information includes different parameters.

[0135] First, the aforementioned first information includes the number of bits to be encoded.

[0136] When the first information includes the number of bits to be encoded, the first communication device can determine the first parameter based on the number of bits to be encoded. For example, the first parameter is equal to k-1, where k represents the number of bits to be encoded. For instance, if the number of bits to be encoded is 10, the first communication device can determine the first parameter m = 10-1 = 9. Further, the first communication device can perform RM encoding on the bits to be encoded based on the generator matrix / basis matrix corresponding to the RM(9,1) code. As mentioned in the above introduction to RM codes, when r = 1, the number of information bits in the RM(m,r) code... By determining m by k, the encoding capability of the selected first-order RM code can be just right to meet the encoding requirements. In this way, error correction capability can be guaranteed, decoding complexity can be reduced, and system design can be simplified, resulting in better overall system performance.

[0137] Second, the first piece of information mentioned above includes the size of the aforementioned transmission resources.

[0138] When the first information includes the size of the transmission resource, the first communication device can determine the first parameter based on the size of the transmission resource.

[0139] One possible implementation is that when the size of the aforementioned transmission resources N∈(2^N / N), M ,2 M+1 When [the first parameter is specified], its value range is [a, M+1], where a is an integer greater than or equal to 1. a can be predefined, for example, a = 3. The size of the transmission resource can be predefined or indicated by the RAN device; this application does not limit this.

[0140] For example, if a = 3, the size of the above transmission resource is 999, 999 ∈ [512, 1024], that is, 999 ∈ (2 9 ,2 10 If the first parameter is [3, 10], then the range of the first parameter is [3, 10]. In other words, the first parameter is an integer between 3 and 10.

[0141] By using the first parameter m determined in the above manner for first-order RM encoding, the length of the encoded codeword is closer to the size of the transmission resource. This helps to reduce the complexity of rate matching and decoding, thereby improving the overall performance of the system.

[0142] Another possible implementation is that when the size of the above transmission resources N∈(2^N) M ,2 M+1 When [the first parameter m is specified], the first parameter m = M + 1. The size of the transmission resource can be predefined or indicated by the RAN device; this application does not limit this.

[0143] For example, the maximum length of the aforementioned transmission resource is 999, where 999 ∈ [512, 1024], that is, 999 ∈ (2 9 ,2 10 Therefore, the first parameter m is fixed at 10.

[0144] By using the first parameter m = M + 1, the length of the encoded codeword (e.g., the codeword obtained by first-order RM encoding based on m is 2) is made to be... M+1 It can make fuller use of transmission resources, increase the bit rate, and the longer bit length is conducive to improving the error correction capability of the encoding, so that the RM code has better error correction performance, thereby improving system performance.

[0145] Another possible implementation is that when the first information includes the size of the transmission resource, the range to which the first parameter and the size of the transmission resource belong satisfy a first correspondence. This first correspondence indicates the correspondence between at least one first range and at least one first parameter, where the at least one first range indicates the range of transmission resource sizes. In other words, the first communication device can flexibly select the first parameter m based on the size of the transmission resource.

[0146] The size of the aforementioned transmission resources can be predefined or indicated by the RAN device, and this application does not limit this. For example, the RAN device can send first indication information to the first communication device, which indicates the size of the transmission resources allocated to the first communication device. The first communication device can determine the first parameter based on the aforementioned first correspondence and the size of the transmission resources.

[0147] For example, the first correspondence mentioned above is shown in Table 3. When the size of the above transmission resources ∈ [2] 3 ,2 4 When the size of the above transmission resources ∈ [2], the first parameter m is 3; when ... 4 ,2 5 When ), the first parameter m is 4. They will not be listed here. Please refer to Table 3 for details.

[0148] Table 3

[0149] First range index First Scope First parameter 0 <![CDATA[[2 3 ,2 4 )]]> 3 1 <![CDATA[[2 4 ,2 5 )]]> 4 2 <![CDATA[[2 5 ,2 6 )]]> 5 3 <![CDATA[[2 6 ,2 7 )]]> 6 …… …… ……

[0150] It should be understood that the first correspondence shown in Table 3 is merely an example and should not constitute any limitation on this application. For example, the first correspondence can also be represented in other forms.

[0151] Additionally, Table 3 includes a column for the index of the first range. In this case, the RAN device can indicate the index corresponding to the size of the transmission resource to the first communication device. The first communication device can then determine the corresponding first parameter based on this index and Table 3. Indicating the index helps reduce signaling overhead. Alternatively, Table 3 may not include the column for the index of the first range; that is, Table 3 includes the second and third columns. In this case, the first communication device can directly determine the corresponding first parameter based on the range to which the size of the transmission resource belongs.

[0152] It should also be understood that Table 3 above can also be split into two tables. One table indicates the correspondence between the first range and its index, and the other table indicates the correspondence between the index of the first range and the first parameter. The first communication device can determine the index of the first range based on the range to which the size of the transmission resource belongs, and then determine the first parameter based on the index of the first range. In summary, this application does not limit the form of the first correspondence, as long as the corresponding first parameter can be determined based on the size of the transmission resource.

[0153] Furthermore, the equal sign for each first range in Table 3 above is taken to the left, but this should not constitute any limitation on this application. For example, the equal sign for the first range above can also be taken to the right, such as when the first range is (2 3 ,2 4 ].

[0154] III. The first piece of information mentioned above is the first bit rate.

[0155] When the first information is a first code rate, the first communication device can determine the first parameter based on the first code rate.

[0156] For example, the first parameter m satisfies the following: the difference between the second bitrate after RM encoding based on m and the first bitrate satisfies a first threshold. This first threshold can be predefined.

[0157] The second bitrate mentioned above could be, for example, the bitrate obtained by first-order RM encoding based on the aforementioned m, where the second bitrate = (m+1) / 2 mOne possible implementation is that the first communication device can iterate through the values ​​of m, ensuring that the difference between the second code rate and the first code rate after RM encoding based on m satisfies a first threshold, thereby using m as the first parameter. For example, a first code rate can correspond to a first threshold. The first communication device can iterate through the values ​​of m to determine the first parameter m of the RM code under the first code rate. For instance, when the first code rate is 0.188, the first threshold corresponding to this first code rate is 0.188 - 11 ÷ 1024 = 0.177 (where 11 is the number of information bits). The first communication device can iterate through the values ​​of m to determine the value of m when the first code rate is 0.188. As another example, when the first code rate is 0.245, the first threshold corresponding to this first code rate is 0.245 - 11 ÷ 1024 = 0.234. The first communication device can iterate through the values ​​of m to determine the value of m when the first code rate is 0.245. These are not all listed here.

[0158] The first code rate mentioned above can satisfy the fifth correspondence with at least one of the following: MCS index, modulation order, or spectral efficiency. For an explanation of the fifth correspondence mentioned above and the method by which the first communication device determines the first code rate, please refer to the above text, which will not be repeated here.

[0159] Fourth, the first piece of information mentioned above includes decoding complexity.

[0160] When the first information includes decoding complexity, the first communication device can determine the first parameter based on the decoding complexity.

[0161] One possible implementation is that the aforementioned first parameter and decoding complexity satisfy a second correspondence, or that the range to which the aforementioned first parameter and decoding complexity belong satisfies a second correspondence. This second correspondence indicates the correspondence between at least one decoding complexity and at least one first parameter, or it indicates the correspondence between at least one second range and at least one first parameter, where the at least one second range indicates the range of decoding complexity. The decoding complexity can be indicated by the decoding device to the encoding device. For example, the decoding device can send second indication information to the encoding device, which indicates the decoding complexity supported by the decoding device. The encoding device can determine the first parameter based on the decoding complexity and the aforementioned second correspondence. In this way, the encoding device can flexibly select the first parameter based on the decoding complexity.

[0162] For example, the second correspondence mentioned above is shown in Table 4. When the above decoding complexity ∈ [2 3 *3,2 4 When *4), the first parameter m is 3; when the above decoding complexity ∈ [2 4 *4,2 5When *5), the first parameter m is 4. These will not be listed here. Please refer to Table 4 for details.

[0163] Table 4

[0164]

[0165]

[0166] It should be understood that the second correspondence shown in Table 4 is merely an example and should not constitute any limitation on this application. For example, the second correspondence can also be represented in other forms.

[0167] Alternatively, Table 4 may not include the column for the index of the second range, or it may be split into two tables: one indicating the correspondence between the second range and its index, and the other indicating the correspondence between the index of the second range and the first parameter. The first communication device can determine the index of the second range based on the range of the decoding complexity, and then determine the first parameter based on the index of the second range. In summary, this application does not limit the form of the second correspondence, as long as the corresponding first parameter can be determined based on the decoding complexity.

[0168] Furthermore, the equal sign for each second range in Table 4 above is taken to the left, but this should not constitute any limitation on this application. For example, the equal sign for the second range above can also be taken to the right, such as when the first range is (2 3 *3,2 4 *4], the first parameter is 4.

[0169] The second correspondence mentioned above could also be a correspondence between decoding complexity and the first parameter, as shown in Table 5. When the above decoding complexity = 2... 3 When *3, the first parameter m is 3; when the above decoding complexity = 2 4 When *4 is used, the first parameter m is 4. These will not be listed here; please refer to Table 5 for details.

[0170] Table 5

[0171] Decoding complexity First parameter <![CDATA[2 3 *3]]> 3 <![CDATA[2 4 *4]]> 4 <![CDATA[2 5 *5]]> 5 <![CDATA[2 6 *6]]> 6 …… ……

[0172] As mentioned above, decoding complexity can also be replaced by processing power. Correspondingly, the second correspondence mentioned above can be a correspondence between processing power and the first parameter, or a correspondence between the range of processing power and the first parameter, as shown in Tables 6 and 7, which will not be elaborated here.

[0173] Table 6

[0174] Index of processing capacity Range of processing capabilities First parameter 0 <![CDATA[[2 3 ,2 4 )]]> 3 1 <![CDATA[[2 4 ,2 5 )]]> 4 2 <![CDATA[[2 5 ,2 6 )]]> 5 3 <![CDATA[[2 6 ,2 7 )]]> 6 …… …… ……

[0175] Table 7

[0176] Processing capacity First parameter <![CDATA[2 3 ]]> 3 <![CDATA[2 4 ]]> 4 <![CDATA[2 5 ]]> 5 <![CDATA[2 6 ]]> 6 …… ……

[0177] The first communication device determines the first parameter based on the decoding complexity. Another possible implementation is that the decoding complexity can be predefined, or the first and second communication devices have negotiated the decoding complexity. The decoding complexity can be fixed, and the first communication device can determine the first parameter based on the decoding complexity.

[0178] For example, the maximum decoding complexity supported by the second communication device is predefined as X, and the first communication device can determine the corresponding first parameter based on X. Alternatively, the maximum processing power supported by the second communication device is predefined as 1024, and the first communication device can determine the first parameter m based on this maximum processing power, such as m = log2(1024) = 10.

[0179] The preceding text describes in detail how the first communication device determines the implementation method of the first parameter based on a certain coding system requirement. The following text will describe how the first communication device determines the implementation method of the first parameter in combination with multiple coding system requirements, thereby achieving a balance between decoding complexity and decoding performance, and thus improving the overall performance of the system.

[0180] V. The first piece of information mentioned above includes decoding complexity, the number of bits to be encoded, and the size of transmission resources.

[0181] When the aforementioned first information includes decoding complexity, the number of bits to be encoded, and the size of transmission resources, the first communication device can determine the first parameter based on these three factors. It should be noted that decoding complexity can also be replaced by processing power; that is, when the aforementioned first information includes processing power, the number of bits to be encoded, and the size of transmission resources, the first communication device can determine the first parameter based on these three factors. The relationship between decoding complexity and processing power can be found above and will not be repeated here.

[0182] One possible implementation is that the decoding complexity, the number of bits to be encoded, the size of the transmission resources, and the first parameter satisfy a third correspondence. The first communication device can determine the corresponding first parameter based on the decoding complexity, the number of bits to be encoded, the size of the transmission resources, and the third correspondence.

[0183] For example, the third correspondence mentioned above is shown in Table 8. The decoding complexity is indicated by an index. When the index of the decoding complexity is 0 and the size of the transmission resource is [8, 16), the first parameter m = k-1; when the index of the decoding complexity is 1 and the size of the transmission resource is [8, 16), the first parameter m = k-1 or k. These are not listed individually here, but are detailed in Table 8. The first communication device can obtain the first parameter m by looking up the table based on the decoding complexity, the size of the transmission resource, and the number of bits to be encoded.

[0184] Table 8

[0185] Index of decoding complexity\first range <![CDATA[[2 3 ,2 4 )]]> <![CDATA[[2 4 ,2 5 )]]> …… <![CDATA[[2 9 ,2 10 )]]> …… 0 k-1 k-1 …… k-1 …… 1 {k-1,k} k …… k …… 2 {k-1,k+1} {k,k+1} …… k+1 …… 3 {k-1,k+2} {k,k+2} …… k+2 …… …… …… …… …… …… ……

[0186] It should be understood that Table 8 shows a range of transmission resource sizes, but this should not constitute any limitation on this application. For example, the range of transmission resource sizes in Table 8 can also be replaced with the actual size of the transmission resource, which is not a limitation of this application.

[0187] It should also be understood that the above method of obtaining the first parameter by looking up the table is merely an example and should not constitute any limitation on this application.

[0188] For example, the first communication device may also calculate and determine the first parameter based on the decoding complexity, the number of bits to be encoded, and the size of the transmission resources. For instance, assuming the index of the decoding complexity is c, when the size of the transmission resources N≥2 k-1+c When the first communication device determines the first parameter m = k-1 + c; when the size of the transmission resource N < 2 k-1+c In this case, the first communication device can encode based on RM(n,1) code, where n < k-1 + c. The first communication device can segment the bits to be encoded and encode each segment using RM(n,1) code. A detailed explanation of the segmentation and the method of encoding each segment using RM(n,1) code can be found below and will not be elaborated here. When the size of the transmission resource N < 2... k-1+c At the same time, the first communication device can also encode based on RM(k-1+c,1) code and punch holes up to length N.

[0189] In one possible implementation, the number of bits to be encoded, the size of the transmission resources, and the first code rate satisfy a fourth correspondence. The first communication device can determine the size of the transmission resources based on the number of bits to be encoded, the first code rate, and the fourth correspondence; or, the first communication device can determine the number of bits to be encoded based on the first code rate, the size of the transmission resources, and the fourth correspondence.

[0190] For example, the number of bits to be encoded, the size of the transmission resource, and the first code rate satisfy: First code rate = Number of bits to be encoded / Size of transmission resource.

[0191] In other words, the first communication device can determine the third item based on two of the following: the number of bits to be encoded, the size of the transmission resources, and the first code rate. Correspondingly, the aforementioned first information includes decoding complexity, the number of bits to be encoded, and the size of the transmission resources; alternatively, the aforementioned first information can include decoding complexity, the number of bits to be encoded, and the first code rate. The first communication device can determine the first parameter based on the decoding complexity, the number of bits to be encoded, and the first code rate. Alternatively, the aforementioned first information includes decoding complexity, the first code rate, and the size of the transmission resources. The first communication device can determine the first parameter based on the decoding complexity, the first code rate, and the size of the transmission resources. The following will explain these two cases in detail.

[0192] VI. The aforementioned first information includes decoding complexity, the number of bits to be encoded, and the first code rate. For example, the first code rate can be indicated by an MCS index.

[0193] One possible implementation is that the decoding complexity, the number of bits to be encoded, the MCS index, and the first parameter satisfy the sixth correspondence. The first communication device can determine the corresponding first parameter based on the decoding complexity, the number of bits to be encoded, the MCS index, and the sixth correspondence.

[0194] For example, the sixth correspondence mentioned above is shown in Table 9. The decoding complexity is indicated by the index. When the index of the decoding complexity is 0, the MCS index belongs to [MCS(k / 2 3 ),MCS(k / 2 4 When the first parameter m = k-1, and the decoding complexity index is 1, the MCS index belongs to [MCS(k / 2)]. 3 ),MCS(k / 2 4 When the first parameter m is k-1 or k, it will not be listed here, but is detailed in Table 9. The first communication device can look up the first parameter m in the table according to the decoding complexity, the MCS index and the number of bits to be encoded. Among them, MCS(k / N) represents the MCS index of the code rate in the MCS table whose difference from k / N satisfies the second threshold.

[0195] Table 9

[0196]

[0197] It should be understood that Table 9 shows the range of the MCS index, but this should not constitute any limitation on this application. For example, the range of the MCS index in Table 9 can also be replaced with the MCS index, and this application does not limit this.

[0198] It should also be understood that the above method of obtaining the first parameter by looking up the table is merely an example and should not constitute any limitation on this application.

[0199] For example, the first communication device can also calculate and determine the first parameter based on the decoding complexity, the number of bits to be encoded, and the first code rate. For instance, assuming the index of the decoding complexity is c, the first communication device can determine the size of the transmission resource based on the number of bits to be encoded and the first code rate. When the size of the transmission resource N≥2... k-1+c When the first communication device determines the first parameter m = k-1 + c; when the size of the transmission resource N < 2 k-1+c In this case, the first communication device can encode based on RM(n,1) code, where n < k-1 + c. The first communication device can segment the bits to be encoded and encode each segment using RM(n,1) code. A detailed explanation of the segmentation and the method of encoding each segment using RM(n,1) code can be found below and will not be elaborated here. When the size of the transmission resource N < 2... k-1+c At the same time, the first communication device can also encode based on RM(k-1+c,1) code and punch holes up to length N.

[0200] VII. The aforementioned first information includes decoding complexity, transmission resource size, and first code rate.

[0201] One possible implementation is that the decoding complexity, the size of the transmission resources, the first code rate, and the first parameter satisfy the seventh correspondence. The first communication device can determine the corresponding first parameter based on the decoding complexity, the size of the transmission resources, the first code rate, and the seventh correspondence.

[0202] For example, the seventh correspondence mentioned above is shown in Table 10. Decoding complexity / processing capability is indicated by an index, and the first code rate is represented by R. When the index of decoding complexity is 0 and the size of the transmission resource belongs to [8, 16), the first parameter... When the decoding complexity index is 1 and the size of the transmission resource belongs to [8, 16), the first parameter or The details are not listed here; please refer to Table 10. The first communication device can look up the first parameter m in the table based on the decoding complexity, the size of the transmission resources, and the first code rate. This indicates rounding up to the nearest integer.

[0203] Table 10

[0204]

[0205] It should be understood that Table 10 shows a range of transmission resource sizes, but this should not constitute any limitation on this application. For example, the range of transmission resource sizes in Table 8 can also be replaced with the actual size of the transmission resource, which is not a limitation of this application.

[0206] It should also be understood that the above method of obtaining the first parameter by looking up the table is merely an example and should not constitute any limitation on this application.

[0207] For example, the first communication device may also calculate and determine the first parameter based on the decoding complexity, the size of the transmission resources, and the first code rate. For instance, assuming the index of the decoding complexity is c, when the size of the transmission resources... At that time, the first communication device determines the first parameter m = k-1 + c; when the size of the transmission resource... At that time, the first communication device can encode based on RM(n,1) code, where, The first communication device can segment the bits to be encoded and encode each segment using RM(n,1) codes. A detailed explanation of the segmentation and the encoding method using RM(n,1) codes for each segment can be found below and will not be elaborated upon here. When the size of the transmission resources... At that time, the first communication device can also be based on The code is encoded and punched with holes up to length N.

[0208] In step 320, the first communication device outputs the codeword after RM encoding of the bits to be encoded based on the aforementioned first parameters. Correspondingly, the second communication device receives the sequence to be decoded.

[0209] For example, after determining the first parameter m, the first communication device can perform RM encoding on the bit to be encoded based on the first parameter m. For example, the RM encoding can be a first-order RM encoding, or the order r of the RM encoding is 1. That is, the first communication device can perform RM(m,1) encoding on the bit to be encoded, where m is determined based on the method described above.

[0210] Optionally, before outputting the encoded codeword, the first communication device may perform operations such as rate matching, interleaving, and modulation. Correspondingly, the second communication device may perform operations such as demodulation, deinterleaving, and rate matching to obtain the sequence to be decoded.

[0211] Understandably, the RM(m,1) code determined by the first communication device based on the above method may or may not meet the encoding requirements.

[0212] One possible scenario is that k = m + 1. In this case, the RM(m, 1) code just meets the encoding requirements, and the first communication device can encode the bits to be encoded based on the generator matrix corresponding to RM(m, 1).

[0213] Another possible scenario is that k < m + 1, in which case the RM(m, 1) code exceeds the encoding requirements. One possible encoding method is that the first communication device can perform RM encoding on the bits to be encoded based on a first matrix. The first matrix is ​​obtained by freezing the first generator matrix, which is the generator matrix corresponding to the RM(m, 1) code (such as the RM(10, 1) code, i.e., m = 10, where m can be determined based on the aforementioned first information). The number of frozen rows is m + 1 - k, where k represents the number of bits to be encoded. In other words, the codeword is obtained by performing RM encoding on the bits to be encoded based on the aforementioned first matrix.

[0214] For example, assuming k=3 and m=3, then k<m+1. In this case, the first communication device can freeze the m+1-k=3+1-3=1 row in the generator matrix corresponding to the RM(3,1) code. For example, the first communication device can freeze the last row of the generator matrix corresponding to the RM(3,1) code and perform RM encoding on the bits to be encoded based on the first to third rows.

[0215] Optionally, each frozen row in the first generator matrix includes an element 0. In other words, the frozen rows in the first generator matrix are not all rows containing only 1s. This helps increase the code distance, thereby improving performance.

[0216] Here, code distance refers to the distance between two codewords, which is the number of 1s in the sequence obtained by bitwise XORing the two codewords. For example, [1,0,1,0,1,0,1,0] and [0,1,0,1,0,1,0,1] are two codewords of RM(3,1) code, and the code distance is 2. 3 .

[0217] Optionally, a combination is defined as any pairwise combination of legal codewords. For example, [1,0,1,0,1,0,1,0] and [0,1,0,1,0,1,0,1], as well as [0,1,0,1,0,1,0,1] and [1,0,1,0,1,0,1,0], can be considered the same combination, and the code distance between legal codewords is 2. m The number of combinations is 2 m-1 A valid codeword is one that is encoded from information bits using the generator matrix of the RM code, or one that satisfies the parity check relationship of the RM code's parity check matrix H, such as H × cw = zero vector, where H represents the parity check matrix and cw represents the encoded codeword. The code distance between valid codewords is 2. m The number of combinations can also be understood as a code distance of 2. m The number of valid codewords, or in other words, 2 m-1 The code distance of a pair of valid codewords is 2. m. Each frozen row in the above first generator matrix includes element 0, and the code distance between it and the legal codeword is 2 m the number of combinations is 2 m-1 are equivalent. That is, by not freezing the rows where all elements are 1, the code distance between legal codewords can be made to be 2 m the number of combinations is 2 m-1 .

[0218] In another possible case, k>m+1. In this case, the RM(m,1) code cannot meet the encoding requirement. Under this circumstance, the first communication apparatus may perform RM encoding in any of the following manners.

[0219] Manner 1: The above encoded codeword is obtained by performing RM encoding on a plurality of segments respectively based on a second generator matrix, where the second generator matrix is a generator matrix corresponding to at least one first-order RM code, and the to-be-encoded bits include the plurality of segments. In other words, the first communication apparatus may perform RM encoding on the plurality of segments based on the generator matrix corresponding to the at least one first-order RM code to obtain the codeword.

[0220] Optionally, the plurality of segments may be crossed / partially overlapped. For example, if the to-be-encoded bits are 6 bits, the to-be-encoded bits may be divided into 3 segments. The first segment includes the first bit to the third bit, the second segment includes the second bit to the fifth bit, and the third segment includes the fourth bit to the sixth bit. For instance, the first segment may be RM-encoded based on the generator matrix corresponding to the RM(2,1) code, the second segment may be RM-encoded based on the generator matrix corresponding to the RM(3,1) code, and the third segment may be RM-encoded based on the generator matrix corresponding to the RM(2,1) code.

[0221] Optionally, the plurality of segments may also be non-crossed. In a possible implementation, the first communication apparatus performs uniform segmentation on the to-be-encoded bits, that is, the length of each segment in the plurality of segments may be the same. In another possible implementation, the first communication apparatus may perform non-uniform segmentation on the to-be-encoded bits, that is, at least two segments in the plurality of segments have different lengths.

[0222] For example, the first communication apparatus performs uniform segmentation on the to-be-encoded bits. In this case, the first communication apparatus may encode the plurality of segments based on n RM(m,1) codes, where, the number of information bits in each RM(m,1) code is k i , i: 1,…n, when k i <m+1, the number of rows p that need to be frozen i =m+1-k i, reference may be made specifically to the explanation for the case where k<m+1 in the above text.

[0223] Mode 2: The above codeword is obtained by performing RM encoding on the to-be-encoded bits based on a second matrix, the above second matrix is obtained by freezing a third generator matrix, the above third generator matrix is the generator matrix corresponding to the high-order RM code with the first parameter taking the value of m, and the number of frozen rows is k represents the number of to-be-encoded bits, and r represents the order of the above high-order RM code. That is to say, the first communication apparatus may perform RM encoding on the to-be-encoded bits based on the above second matrix. The above second matrix may be obtained by freezing the generator matrix corresponding to the RM(m, r) code (where m is determined based on first information, and r is greater than 1) rows.

[0224] For example, as shown in Figure 4 , the generator matrix corresponding to the RM(3,2) code is as shown in Figure 4 , assuming that the number of to-be-encoded bits k=5, the first communication apparatus may freeze the non-first-order rows in the generator matrix corresponding to the RM(3,2) code rows, so as to perform RM encoding on the to-be-encoded bits based on the first-order rows and the unfrozen rows in the non-first-order rows. The first-order rows refer to the first m+1 rows in the generator matrix corresponding to the RM(m,r) code, and the non-first-order rows refer to the other rows in the generator matrix corresponding to the RM(m,r) code except the first-order rows.

[0225] Mode 3: The above codeword is obtained by performing RM encoding on the to-be-encoded bits based on a third matrix, the above third matrix is obtained by extending k-m-1 rows on a first generator matrix, the above first generator matrix is the generator matrix of the first-order RM code corresponding to the case where the first parameter takes the value of m, and k represents the number of to-be-encoded bits. In other words, the first communication apparatus may perform RM encoding on the to-be-encoded bits based on the above third matrix to obtain an RM-encoded codeword. The above third matrix is obtained by extending k-m-1 rows on the generator matrix corresponding to the RM(m,1) code.

[0226] Optionally, after the first communication apparatus performs RM encoding on the to-be-encoded bits, if the length of the encoded sequence is greater than the size of a transmission resource, the first communication apparatus may perform rate matching. For example, the first communication apparatus may perform puncturing. For instance, the first communication apparatus may perform sequential puncturing (e.g., puncturing from front to back). For another example, the first communication apparatus may perform puncturing based on a puncturing pattern, and in the case of puncturing based on this puncturing pattern, the decoding performance is better than that of other puncturing manners. The above puncturing pattern may be predefined or configured by an RAN device, which is not limited in this application.

[0227] For example, corresponding to the above mode 2, the number of punctured bits of each first-order RM code is denoted as pi The total number of holes is P = N – n * 2 m Where N represents the size of the transmission resource, and n represents the number of RM codes. The punching method for each RM code can be sequential punching (e.g., punching from front to back). Alternatively, the punching method for each RM code can be based on a punching pattern, which results in better decoding performance.

[0228] In step 330, the second communication device determines the first parameter based on the aforementioned first information.

[0229] The second communication device can be considered as a decoding end for information. The second communication device can be a terminal device or an access network device, and this application does not limit the type of the second communication device.

[0230] The process by which the second communication device determines the first parameter based on the first information can be referred to the process by which the first communication device determines the first parameter, and will not be repeated here.

[0231] In step 340, the second communication device decodes the sequence to be decoded based on the first parameter mentioned above.

[0232] After determining the first parameter, the second communication device can decode the sequence to be decoded based on the first parameter. For example, the second communication device can determine the generator matrix corresponding to the RM code based on the first parameter, and decode the sequence to be decoded based on the inverse of the generator matrix. The process by which the second communication device determines the generator matrix is ​​similar to that of the first communication device; please refer to the encoding process of the first communication device described above, which will not be repeated here.

[0233] The communication method provided by the embodiments of this application has been described in detail above with reference to the accompanying drawings. It should be noted that the above embodiments can be combined to implement the combined solution. Optionally, some operations in the process of each method embodiment may be arbitrarily combined, and / or the order of some operations may be arbitrarily changed. Furthermore, the execution order between the steps of each process is merely exemplary and does not constitute a limitation on the execution order between steps; other execution orders are also possible. It is not intended to indicate that the execution order is the only possible order in which these operations can be performed. Those skilled in the art will conceive of various ways to reorder the operations described herein. Additionally, it should be noted that the process details involved in a certain embodiment of this document are similarly applicable to other embodiments, or different embodiments can be combined. The apparatus provided by the embodiments of this application will be described in detail below with reference to the accompanying drawings.

[0234] It should be understood that Figures 5 to 8The device shown can be used to implement the functions of the first or second communication device in the above method embodiments, and therefore can also achieve the beneficial effects of the above method embodiments. In the embodiments of this application, the device can be as follows: Figure 3 The first communication device in the method embodiment shown may also be a component (such as a processor, circuit, chip, chip system, etc.) configured in the first communication device, or it may be a logic module or software capable of implementing some or all of the functions of the first communication device; or, the device may be as follows: Figure 3 The second communication device in the method embodiment shown may also be a component (such as a processor, circuit, chip, chip system, etc.) configured in the second communication device, or a logic module or software capable of implementing some or all of the functions of the second communication device.

[0235] Figure 5 This is a schematic block diagram of the communication device 500 provided in the embodiments of this application.

[0236] like Figure 5 As shown, the device 500 includes a processing module 510 and a transceiver module 520. The device 500 can be used to implement the above-described... Figure 3 The functions of the first or second communication device in the method embodiments shown.

[0237] When the device 500 is used to achieve Figure 3 In the method embodiment shown, when the first communication device functions, the processing module 510 is used to determine the first parameter based on the first information, the first information including at least one of the following: the number of bits to be encoded, the size of the transmission resource, the first code rate, or the decoding complexity, the first parameter being used to indicate the code length of the RM code; the transceiver module 520 is used to output the codeword after RM encoding of the bits to be encoded based on the first parameter.

[0238] Optionally, the above RM encoding is a first-order RM encoding.

[0239] Optionally, when the first information includes the number of bits to be encoded, the first parameter is equal to k-1, where k represents the number of bits to be encoded.

[0240] Optionally, when the first information mentioned above includes the size of the transmission resources, and N∈(2^N) M ,2 M+1 When N is used, the value range of the first parameter is [a, M+1], where N represents the size of the transmission resource and a is an integer greater than or equal to 1.

[0241] Optionally, the first parameter mentioned above is equal to M+1.

[0242] Optionally, when the first information includes the size of the transmission resource, the range to which the first parameter and the size of the transmission resource belong satisfy a first correspondence relationship. This first correspondence relationship is used to indicate the correspondence between at least one first range and at least one first parameter, and the at least one first range is used to indicate the range of the size of the transmission resource.

[0243] Optionally, when the first information is the first bit rate, the first parameter is equal to m, where m satisfies the following: the difference between the second bit rate after RM encoding based on m and the first bit rate satisfies the first threshold.

[0244] Optionally, when the first information includes decoding complexity, the first parameter and the decoding complexity satisfy a second correspondence, or the range to which the first parameter and the decoding complexity belong satisfies a second correspondence. The second correspondence is used to indicate the correspondence between at least one decoding complexity and at least one first parameter, or to indicate the correspondence between at least one second range and at least one first parameter. The at least one second range is used to indicate the range of decoding complexity.

[0245] Optionally, when the first information includes the decoding complexity, the number of bits to be encoded, and the size of the transmission resources, the decoding complexity, the number of bits to be encoded, the size of the transmission resources, and the first parameter satisfy the third correspondence.

[0246] Optionally, when the aforementioned first information includes decoding complexity, the number of bits to be encoded, and the first code rate, the decoding complexity, the number of bits to be encoded, the first code rate, and the first parameter satisfy the sixth correspondence relationship.

[0247] Optionally, when the aforementioned first information includes decoding complexity, transmission resource size, and first code rate, the decoding complexity, transmission resource size, first code rate, and first parameter satisfy the seventh correspondence relationship.

[0248] Optionally, the number of bits to be encoded, the size of the transmission resources, and the first code rate satisfy the fourth correspondence.

[0249] Optionally, the first code rate described above satisfies a fifth correspondence with at least one of the following: MCS index, modulation order, or spectral efficiency.

[0250] Optionally, when the number of bits to be encoded is less than m+1, the above codeword is obtained by RM encoding of the bits to be encoded based on the first matrix. The first matrix is ​​obtained by freezing the first generator matrix. The first generator matrix is ​​the generator matrix of the first-order RM code corresponding to the first parameter value of m. The number of frozen rows is m+1-k, where k represents the number of bits to be encoded.

[0251] Optionally, each frozen row in the first generating matrix described above includes the element 0.

[0252] Optionally, when the number of bits to be encoded is greater than m+1, the codeword is obtained by RM encoding multiple segments based on the second generator matrix. The second generator matrix is ​​the generator matrix corresponding to at least one first-order RM code. The bits to be encoded include the multiple segments, and m represents the first parameter.

[0253] Optionally, when the number of bits to be encoded is greater than m+1, the above codeword is obtained by RM encoding the bits to be encoded based on the second matrix. The second matrix is ​​obtained by freezing the third generator matrix. The third generator matrix is ​​the generator matrix corresponding to the high-order RM code with the first parameter value of m, and the number of frozen rows is... k represents the number of bits to be encoded, and r represents the order of the aforementioned high-order RM code.

[0254] Optionally, when the number of bits to be encoded is greater than m+1, the above codeword is obtained by RM encoding of the bits to be encoded based on the third matrix. The third matrix is ​​obtained by extending the first generator matrix by km-1 rows. The first generator matrix is ​​the generator matrix of the first-order RM code corresponding to the first parameter value of m, where k represents the number of bits to be encoded.

[0255] When the device 500 is used to achieve Figure 3 In the method embodiment shown, when the second communication device functions, the transceiver module 520 is used to receive the sequence to be decoded; the processing module 510 is used to determine the first parameter according to the first information, the first information including at least one of the following: the number of bits to be encoded, the size of the transmission resource, the first code rate, or the decoding complexity, the first parameter being used to indicate the code length of the RM code; the processing module 510 is also used to decode the sequence to be decoded based on the first parameter.

[0256] Optionally, when the first information includes the number of bits to be encoded, the first parameter is equal to k-1, where k represents the number of bits to be encoded.

[0257] Optionally, when the first information mentioned above includes the size of the transmission resources, and N∈(2^N) M ,2 M+1 When N is used, the value range of the first parameter is [a, M+1], where N represents the size of the transmission resource and a is an integer greater than or equal to 1.

[0258] Optionally, the first parameter mentioned above is equal to M+1.

[0259] Optionally, when the first information includes the size of the transmission resource, the range to which the first parameter and the size of the transmission resource belong satisfy a first correspondence relationship. This first correspondence relationship is used to indicate the correspondence between at least one first range and at least one first parameter, and the at least one first range is used to indicate the range of the size of the transmission resource.

[0260] Optionally, when the first information is the first bit rate, the first parameter is equal to m, where m satisfies the following: the difference between the second bit rate after RM encoding based on m and the first bit rate satisfies the first threshold.

[0261] Optionally, when the first information includes decoding complexity, the first parameter and the decoding complexity satisfy a second correspondence, or the range to which the first parameter and the decoding complexity belong satisfies a second correspondence. The second correspondence is used to indicate the correspondence between at least one decoding complexity and at least one first parameter, or to indicate the correspondence between at least one second range and at least one first parameter. The at least one second range is used to indicate the range of decoding complexity.

[0262] Optionally, when the first information includes the decoding complexity, the number of bits to be encoded, and the size of the transmission resources, the decoding complexity, the number of bits to be encoded, the size of the transmission resources, and the first parameter satisfy the third correspondence.

[0263] Optionally, when the aforementioned first information includes decoding complexity, the number of bits to be encoded, and the first code rate, the decoding complexity, the number of bits to be encoded, the first code rate, and the first parameter satisfy the sixth correspondence relationship.

[0264] Optionally, when the aforementioned first information includes decoding complexity, transmission resource size, and first code rate, the decoding complexity, transmission resource size, first code rate, and first parameter satisfy the seventh correspondence relationship.

[0265] Optionally, the number of bits to be encoded, the size of the transmission resources, and the first code rate satisfy the fourth correspondence.

[0266] Optionally, the first code rate described above satisfies a fifth correspondence with at least one of the following: MCS index, modulation order, or spectral efficiency.

[0267] For a more detailed description of each of the above modules, please refer to [link / reference]. Figure 3 The relevant descriptions in the method embodiments shown are directly obtained and will not be repeated here.

[0268] It should be understood that the module division in the embodiments of this application is illustrative and only represents a logical functional division. In actual implementation, there may be other division methods. Furthermore, the functional modules in the various embodiments of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0269] Figure 6 and Figure 7 Another way of dividing modules is presented.

[0270] Figure 6 This is a schematic block diagram of another communication device 600 provided in an embodiment of this application. This communication device may be, for example, an encoder chip, such as an RM encoder chip. This communication device can be used to implement... Figure 3 The function of the first communication device in the method shown.

[0271] For example, the device 600 includes a computing module, a control module, and a storage module. The computing module can be used for calculating the cyclic redundancy check (CRC) of the transport block (TB), selecting the base graph (BG), segmenting code blocks, calculating the CRC of code blocks (CBs), performing RM encoding, and concatenating code blocks. For example, in... Figure 3 In the illustrated embodiment, the calculation module can be used to execute step 310, and the calculation module can also be used to perform RM encoding on the bits to be encoded based on the first parameter. The storage module can be used to store data, and the control module can be used to manage and coordinate the operations of other modules.

[0272] Optionally, the device 600 may also include an output module for outputting RM-encoded codewords.

[0273] Figure 7 This is a schematic block diagram of another communication device 700 provided in an embodiment of this application. This communication device may be, for example, a decoder chip, such as an RM decoder chip. This communication device can be used to implement... Figure 3 The function of the second communication device in the method shown.

[0274] Exemplarily, the device 700 includes a computing module, a control module, and a storage module. The computing module can be used for rate matching decomposition, hybrid automatic repeat request (HARQ) merging, RM decoding, and CB / TB CRC checksum decoding. For example, in... Figure 3 In the illustrated embodiment, the computing module can be used to execute steps 330 and 340. The storage module can be used to store data, and the control module can be used to manage and coordinate the operations of other modules. Optionally, the device 700 may further include an input module for inputting the sequence to be decoded.

[0275] Figure 8 This is a schematic block diagram of another communication device 800 provided in the embodiments of this application.

[0276] The device 800 can be a chip system, or it can be a device configured with a chip system to implement the methods described in the above-described method embodiments. In the embodiments of this application, the chip system can be composed of chips, or it can include chips and other discrete devices.

[0277] like Figure 8 As shown, the device 800 may include a processor 810, which can be used to execute computer programs or instructions stored in memory to achieve... Figure 3 The steps performed by the first communication device or the steps performed by the second communication device in the method embodiment shown. The processor 810 may be one or more processors.

[0278] Optionally, the device 800 further includes a communication interface 820. The communication interface 820 can be used to communicate with other devices via a transmission medium, thereby enabling the device 800 to communicate with other devices. The communication interface 820 may be, for example, a transceiver, interface, bus, circuit, or a device capable of transmitting and receiving functions. The processor 810 can utilize the communication interface 820 to input and output data and to implement... Figure 3 The method described in the corresponding embodiment. Specifically, the device 800 can be used to implement the functions of the first communication device or the second communication device in the above method embodiments.

[0279] Optionally, the device 800 further includes at least one memory 830 for storing program instructions and / or data. The memory 830 is coupled to the processor 810. The coupling in this embodiment is an indirect coupling or communication connection between devices, units, or modules, and can be electrical, mechanical, or other forms, used for information exchange between devices, units, or modules. The processor 810 may operate in conjunction with the memory 830. The processor 810 may execute program instructions stored in the memory 830.

[0280] In this application, the memory 830 can be integrated into the processor 810, or the processor 810 and the memory 830 can be set up separately; this application does not limit this.

[0281] It should be understood that the coupling in the embodiments of this application is an indirect coupling or communication connection between devices, units, or modules, which can be electrical, mechanical, or other forms, used for information interaction between devices, units, or modules. The processor 810 may operate in conjunction with the memory 830. The embodiments of this application do not limit the specific connection medium between the processor 810, the communication interface 820, and the memory 830. The embodiments of this application... Figure 8 The processor 810, communication interface 820, and memory 830 are connected via bus 840. Bus 840 is in Figure 8 The connections between other components are shown in bold lines only and are not intended to be limiting. The bus can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The bus can be divided into address bus, data bus, control bus, etc. For ease of illustration, Figure 8 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0282] Figure 9 This is a schematic diagram of the communication chip system architecture provided in the embodiments of this application.

[0283] like Figure 9 As shown, the communication chip system comprises two parts: downlink processing and uplink processing. Downlink processing includes encoding, modulation, layer mapping, precoding, framing, and inverse fast fourier transform (IFFT) of Layer 2 data, followed by final processing into an over-the-air signal via an intermediate frequency (IRF) module. Uplink processing involves processing the received signal via IRF to obtain baseband data, followed by deframing, equalization, de-mapping, demodulation, and decoding via fast fourier transform (FFT) to complete physical layer signal processing. The method provided in this application is primarily applicable to the encoding and decoding modules in the aforementioned communication system architecture.

[0284] This application also provides a computer program product, which includes a computer program (also referred to as code or instructions) that, when executed, can achieve... Figure 3 The steps performed by the first communication device or the steps performed by the second communication device in the method described in the illustrated embodiment.

[0285] This application also provides a computer-readable storage medium storing a computer program (also referred to as code or instructions). When the computer program is executed, it can achieve... Figure 3 The steps performed by the first communication device or the steps performed by the second communication device in the method described in the illustrated embodiment.

[0286] It should be understood that the processor in the embodiments of this application can be an integrated circuit chip with signal processing capabilities. In implementation, each step of the above method embodiments can be completed by the integrated logic circuitry in the processor's hardware or by instructions in software form. The processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly embodied in the execution of a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. The storage medium is located in memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above method.

[0287] It should also be understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0288] The terms "unit," "module," etc., used in this specification can be used to refer to computer-related entities, hardware, firmware, combinations of hardware and software, software, or software in execution. In the embodiments of this application, "unit" and "module" have the same meaning and can be used interchangeably.

[0289] Those skilled in the art will recognize that the various illustrative logical blocks and steps described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application. In the several embodiments provided in this application, it should be understood that the disclosed apparatus, devices, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for example, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the shown or discussed mutual couplings or direct couplings or communication connections may be through some interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms.

[0290] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0291] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0292] In the above embodiments, the functions of each functional unit can be implemented entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer instructions (programs). When the computer program instructions (programs) are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital video discs, DVDs), or semiconductor media (e.g., solid-state disks, SSDs), etc.

[0293] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the technology, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

[0294] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A communication method, characterized in that, include: Based on the first information, a first parameter is determined, wherein the first information includes at least one of the following: the number of bits to be encoded, the size of the transmission resource, the first code rate, or the decoding complexity, and the first parameter is used to indicate the code length of the Reed-Müller RM code. Based on the first parameter, output the codeword after RM encoding of the bit to be encoded.

2. The method as described in claim 1, characterized in that, The RM encoding is a first-order RM encoding.

3. The method as described in claim 1 or 2, characterized in that, When the number of bits to be encoded is less than m+1, the codeword is obtained by RM encoding the bits to be encoded based on a first matrix. The first matrix is ​​obtained by freezing a first generator matrix. The first generator matrix is ​​the generator matrix of the first-order RM code corresponding to the first parameter value of m. The number of frozen rows is m+1-k, where k represents the number of bits to be encoded.

4. The method as described in claim 3, characterized in that, Each frozen row in the first generated matrix includes the element 0.

5. The method according to any one of claims 1 to 4, characterized in that, When the number of bits to be encoded is greater than m+1, the codeword is obtained by performing RM encoding on multiple segments based on the second generator matrix. The second generator matrix is ​​the generator matrix corresponding to at least one first-order RM code. The bits to be encoded include the multiple segments, and m represents the first parameter.

6. The method according to any one of claims 1 to 4, characterized in that, When the number of bits to be encoded is greater than m+1, the codeword is obtained by RM encoding the bits based on a second matrix. The second matrix is ​​obtained by freezing a third generator matrix. The third generator matrix is ​​the generator matrix corresponding to the high-order RM code where the first parameter is m, and the number of frozen rows is... k represents the number of bits to be encoded, and r represents the order of the higher-order RM code.

7. The method according to any one of claims 1 to 4, characterized in that, When the number of bits to be encoded is greater than m+1, the codeword is obtained by RM encoding the bits to be encoded based on the third matrix. The third matrix is ​​obtained by extending the first generator matrix by km-1 rows. The first generator matrix is ​​the generator matrix of the first-order RM code corresponding to the first parameter value of m, and k represents the number of bits to be encoded.

8. A communication method, characterized in that, include: Based on the first information, a first parameter is determined, wherein the first information includes at least one of the following: the number of bits to be encoded, the size of the transmission resource, the first code rate, or the decoding complexity, and the first parameter is used to indicate the code length of the Reed-Müller RM code. Based on the first parameter, the sequence to be decoded is decoded.

9. The method according to any one of claims 1 to 8, characterized in that, When the first information includes the number of bits to be encoded, the first parameter is equal to k-1, where k represents the number of bits to be encoded.

10. The method according to any one of claims 1 to 8, characterized in that, When the first information includes the size of the transmission resource, and N∈(2 M ,2 M+1 When N is the size of the transmission resource, the value range of the first parameter is [a, M+1], where N represents the size of the transmission resource and a is an integer greater than or equal to 1.

11. The method as described in claim 10, characterized in that, The first parameter is equal to M+1.

12. The method according to any one of claims 1 to 8, characterized in that, When the first information includes the size of the transmission resource, the range to which the first parameter and the size of the transmission resource belong satisfy a first correspondence relationship. The first correspondence relationship is used to indicate the correspondence relationship between at least one first range and at least one first parameter, and the at least one first range is used to indicate the size range of the transmission resource.

13. The method according to any one of claims 1 to 8, characterized in that, When the first information is a first bitrate, the first parameter is equal to m, where m satisfies the following: the difference between the second bitrate after RM encoding based on m and the first bitrate satisfies a first threshold.

14. The method according to any one of claims 1 to 8, characterized in that, When the first information includes the decoding complexity, the first parameter and the decoding complexity satisfy a second correspondence, or the range to which the first parameter and the decoding complexity belong satisfies a second correspondence. The second correspondence is used to indicate the correspondence between at least one decoding complexity and at least one first parameter, or to indicate the correspondence between at least one second range and at least one first parameter. The at least one second range is used to indicate the range of decoding complexity.

15. The method according to any one of claims 1 to 8, characterized in that, When the first information includes the decoding complexity, the number of bits to be encoded, and the size of the transmission resource, the decoding complexity, the number of bits to be encoded, the size of the transmission resource, and the first parameter satisfy a third correspondence.

16. The method according to any one of claims 1 to 8, characterized in that, When the first information includes the decoding complexity, the number of bits to be encoded, and the first code rate, the decoding complexity, the number of bits to be encoded, the first code rate, and the first parameter satisfy the sixth correspondence relationship.

17. The method according to any one of claims 1 to 8, characterized in that, When the first information includes the decoding complexity, the size of the transmission resource, and the first code rate, the decoding complexity, the size of the transmission resource, the first code rate, and the first parameter satisfy the seventh correspondence relationship.

18. The method according to any one of claims 15 to 17, characterized in that, The number of bits to be encoded, the size of the transmission resources, and the first code rate satisfy a fourth correspondence.

19. The method as described in claim 18, characterized in that, The first code rate satisfies a fifth correspondence with at least one of the following: modulation and coding scheme MCS index, modulation order, or spectral efficiency.

20. A communication device, characterized in that, Includes modules for implementing the method as described in any one of claims 1 to 19.

21. A communication device, characterized in that, The device includes at least one processor, which can be used to execute a computer program in memory to enable the device to perform the method as described in any one of claims 1 to 19.

22. The apparatus as claimed in claim 21, characterized in that, The device also includes a memory for storing the computer program.

23. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions, which, when executed by a computer, implement the method as described in any one of claims 1 to 19.

24. A computer program product, characterized in that, The computer program product includes instructions that, when executed by a computer, implement the method as described in any one of claims 1 to 19.

Images