Communication method and communication apparatus
By setting preset values for some bits in the RM code, the decoding complexity is reduced while maintaining decoding performance, thus solving the problem of high decoding complexity of RM codes and expanding their application range in communication systems.
Patent Information
- Application Number
- PCT/CN2026/093905
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2025-05-09
- Filing Date
- 2026-04-29
- Publication Date
- 2026-11-12
AI Technical Summary
The existing Reid-Muller (RM) code has high decoding complexity, which affects its application in communication systems.
By setting some bits to preset values during the encoding process and having these bit values known at the receiving end, the codeword space is reduced, the decoding complexity is lowered, and the decoding performance remains unchanged.
While ensuring decoding performance, the decoding complexity of RM codes has been reduced, and their applicability has been expanded.
Smart Images

Figure CN2026093905_12112026_PF_FP_ABST
Abstract
Description
Communication methods and communication devices
[0001] This application claims priority to Chinese Patent Application No. 202510603870.6, filed on May 9, 2025, entitled "Communication Method and Communication Device", the entire contents of which are incorporated herein by reference. Technical Field
[0002] This application relates to the field of wireless communication technology, and more specifically, to a communication method and a communication device. Background Technology
[0003] Communication systems typically employ channel coding to improve data transmission reliability and ensure communication quality. Reed-Muller (RM) codes are a commonly used channel coding scheme. RM codes are linear block codes characterized by recursive construction and efficient decoding algorithms. Furthermore, RM codes possess the property of self-isomorphic permutation, meaning that swapping the bits of an RM code still results in an RM code. Currently, the high decoding complexity of RM codes hinders their application in communication systems. Summary of the Invention
[0004] Embodiments of this application provide a communication method and a communication device to reduce decoding complexity.
[0005] Firstly, embodiments of this application provide a communication method, which can be executed by a first communication device. Unless otherwise specified, the "first communication device" in this application can refer to a communication device (e.g., a network device, a terminal device, an encoding device, etc.), a component used in the communication device (e.g., a circuit, a processor, a chip, or a chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. The component used in the communication device can be a component within the communication device, or it can be independent of the communication device but coupled to it.
[0006] The method includes: acquiring a first bit sequence to be encoded; encoding the first bit sequence according to a first matrix to obtain an encoded second bit sequence, wherein one or more first bits of the second bit sequence are valued at a first preset value; and sending a third bit sequence according to the second bit sequence.
[0007] Based on the above method, some bits in the encoded second bit sequence can be set to a first preset value (or a fixed value). This is equivalent to the receiver knowing the values of these bits, thus reducing the codeword space and consequently lowering the decoding complexity. Furthermore, when this method is applied to RM codes, the second bit sequence remains an RM code. Since the automorphism group of the second bit sequence is identical to that of the original RM code, the decoding performance remains unchanged. In other words, this method can reduce decoding complexity while maintaining decoding performance.
[0008] In conjunction with the first aspect, in some implementations, the position of the one or more first bits in the second bit sequence is a preset position.
[0009] In conjunction with the first aspect or any implementation thereof, in some other implementations, the first bit sequence includes information bits and padding bits, the value of which is related to the following information: the position index of the one or more first bits in the second bit sequence, the number of the one or more first bits, and the first preset value. For example, when this method is applied to RM codes, the number of information bits is less than the sequence length supported by RM encoding, and the length of the first bit sequence obtained by padding the information bits is the sequence length supported by RM encoding.
[0010] Based on the above implementation, by limiting the values of the padding bits in the bit sequence to be encoded, one or more bits in the encoded bit sequence can be set to preset values. Correspondingly, the received sequence to be decoded at the receiving end also includes one or more preset values. This implementation can transfer the information of the padding bits to the codeword field. This increases the number of permutation forms of the received sequence without adding unknown bits, making it more suitable for decoding algorithms based on permutations of the received sequence. Furthermore, when this method is applied to RM codes, padding the information bits ensures that the length of the first bit sequence after padding is equal to the length of the sequence supported by RM encoding, thus expanding the applicability of RM codes.
[0011] In conjunction with the first aspect or any implementation thereof, in some other implementations, the value of the padding bit is related to the following information: the value of the information bit, first information, and second information. The first information includes the number of padding bits and / or the number of information bits, and the second information includes the position index of the padding bit in the first bit sequence and / or the position index of the information bit in the first bit sequence.
[0012] In conjunction with the first aspect or any of its implementations, in some other implementations, the value of the padding bits is related to the generating matrix.
[0013] In conjunction with the first aspect or any implementation thereof, in some other implementations, the value of the padding bit satisfies:
[0014] Among them, u pad Let u be the padding bit and u be the information bit. The index of the position of the padding bit in the first bit sequence. This is the index of the position of the information bit in the first bit sequence. The position index of the one or more first bits in the second bit sequence. For the generating matrix OK, List, For the generating matrix OK, List, For a length of K pad,1 A sequence of elements f, K pad,1 The number of padding bits in the first bit sequence is denoted by f, and f is the first preset value.
[0015] In conjunction with the first aspect or any of its implementations, in some other implementations, the generator matrix is the generator matrix of RM codes.
[0016] In conjunction with the first aspect or any of its implementations, in some other implementations, the first bit sequence is obtained based on the position index of the information bit in the first bit sequence and / or the position index of the padding bit in the first bit sequence.
[0017] In conjunction with the first aspect or any implementation thereof, in some other implementations, obtaining the first bit sequence to be encoded includes: obtaining a fourth bit sequence; interleaving the fourth bit sequence to obtain the first bit sequence; wherein, the fourth bit sequence (u, u pad )satisfy:
[0018] Among them, u pad Let u be the padding bit and u be the information bit, and G1 satisfy... b1 satisfies I is the identity matrix. The index of the position of the padding bit in the first bit sequence. This is the index of the position of the information bit in the first bit sequence. The position index of the one or more first bits in the second bit sequence. For generating matrices OK, List, For the generating matrix OK, List, For a length of K pad,1 A sequence of elements f, where f is the first preset value, and K pad,1 The number of padding bits in the first bit sequence.
[0019] In conjunction with the first aspect or any implementation thereof, in some other implementations, the first bit sequence satisfy:
[0020] Where ∏ is (K1+K pad,1 )×(K1+K pad,1 The matrix is K1, where K is the number of information bits in the first bit sequence. pad,1 The number of padding bits in the first bit sequence, where each row of ∏ includes one 1 and K1+K. pad,1 -1 zero, each column includes one 1 and K1+K pad,1 -1 zeros, the index in ∏ is The indexed column 1 is located at the last K of ∏. pad,1 In the row, the index of ∏ is The index of column 1 in ∏ is located in the first K1 rows, (u,u pad )satisfy:
[0021] Among them, u pad Let u be the padding bit and u be the information bit, and G1 satisfy... b1 satisfies I is the identity matrix. The index of the position of the padding bit in the first bit sequence. This is the index of the position of the information bit in the first bit sequence. The position index of the one or more first bits in the second bit sequence. For generating matrices OK, List, For the generating matrix OK, List, For a length of K pad,1 A sequence of elements f, where f is the first preset value.
[0022] In conjunction with the first aspect or any implementation thereof, in some other implementations, the first bit sequence includes K1 information bits and K... pad,1 The method further includes: obtaining a fifth bit sequence to be encoded, the fifth bit sequence comprising K2 information bits and K... pad,2 The fifth bit sequence is encoded according to the second matrix to obtain the encoded sixth bit sequence, wherein one or more of the second bits of the sixth bit sequence are set to a second preset value; the seventh bit sequence is sent according to the sixth bit sequence; wherein, K pad,1 >K pad,2 The K pad,1 The position index of the padding bits in the first bit sequence includes the K pad,2 The position index of the padding bit in the fifth bit sequence, and / or, the position index of the one or more first bits in the second bit sequence includes the position index of the one or more second bits in the sixth bit sequence.
[0023] In the above implementation, for different padding quantities, the corresponding padding bit position indices have a nested structure, and / or, the corresponding bit position indices with preset values have a nested structure. Using a nested structure helps reduce storage space usage.
[0024] In conjunction with the first aspect or any implementation thereof, in some other implementations, the third bit sequence does not include the one or more first bits.
[0025] After encoding, one or more of the first bits in the second bit sequence are assigned a first preset value. The second communication device knows the information of these bits, so these bits do not need to be transmitted. That is, when selecting bits from the second bit sequence to map to air interface resources, these bits can be skipped. This helps to improve the utilization rate of air interface resources.
[0026] In conjunction with the first aspect or any implementation thereof, in some other implementations, sending the third bit sequence according to the second bit sequence includes: sending bits in the second bit sequence whose position index is an index in a first index table, wherein the first index table does not include the position index of the one or more first bits in the second bit sequence. This implementation offers high transmission flexibility.
[0027] In conjunction with the first aspect or any of its implementations, in some other implementations, the first index table includes duplicate indexes.
[0028] For example, the number of times an element is repeated can be greater than 2.
[0029] Based on this implementation method, the bits to be repeatedly transmitted can be flexibly specified, improving the flexibility of transmission.
[0030] In conjunction with the first aspect or any implementation thereof, in some other implementations, the step of sending the third bit sequence according to the second bit sequence includes: cyclically sending the bits in the second bit sequence, and skipping the sending of bits in the second bit sequence whose position index is an index in a second index table, the second index table including the position indices of the one or more first bits in the second bit sequence. This implementation is simple to implement in hardware.
[0031] Secondly, embodiments of this application provide a communication method, which can be executed by a second communication device. Unless otherwise specified, the "second communication device" in this application can refer to a communication device (e.g., a network device, a terminal, a decoding device, etc.), a component used in the communication device (e.g., a circuit, a processor, a chip, or a chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. The component used in the communication device can be a component within the communication device, or it can be independent of the communication device but coupled to it.
[0032] The method includes: acquiring a first received sequence; obtaining a second received sequence to be decoded based on the first received sequence, the second received sequence including one or more third preset values; and decoding the second received sequence according to a first matrix to obtain a decoded first bit sequence.
[0033] Based on the above method, some positions in the second received sequence to be decoded can be set to a third preset value (or fixed value), meaning the second communication device knows the values of these positions. This reduces the codeword space and thus lowers the decoding complexity. Furthermore, when this method is applied to RM codes, the second received sequence remains an RM code. Since the automorphism group of the second received sequence is consistent with the automorphism group of the original RM code, the decoding performance remains unchanged. In other words, this method can reduce decoding complexity while maintaining decoding performance.
[0034] In conjunction with the second aspect, in some implementations, the position of the one or more third preset values in the second receiving sequence is a preset position.
[0035] In conjunction with the second aspect or any of its implementations, in some other implementations, the first bit sequence includes information bits and padding bits, the value of which is related to the following information: the position index of the one or more first bits in the second received sequence, the number of the one or more first bits, and a first preset value, which is related to the third preset value.
[0036] For example, when this method is applied to RM codes, the number of information bits is less than the sequence length supported by RM encoding, and the length of the first bit sequence obtained by padding the information bits is the sequence length supported by RM encoding.
[0037] Based on the above implementation, by limiting the values of the padding bits in the bit sequence to be encoded, one or more bits in the encoded bit sequence can be set to preset values. Correspondingly, the received sequence to be decoded at the receiving end also includes one or more preset values. This implementation can transfer the information of the padding bits to the codeword field. This increases the number of permutation forms of the received sequence without adding unknown bits, making it more suitable for decoding algorithms based on permutations of the received sequence. Furthermore, when this method is applied to RM codes, padding the information bits ensures that the length of the first bit sequence after padding is equal to the length of the sequence supported by RM encoding, thus expanding the applicability of RM codes.
[0038] In conjunction with the second aspect or any implementation thereof, in some other implementations, the value of the padding bit is related to the following information: the value of the information bit, first information, and second information. The first information includes the number of padding bits and / or the number of information bits, and the second information includes the position index of the padding bit in the first bit sequence and / or the position index of the information bit in the first bit sequence.
[0039] In conjunction with the second aspect or any of its implementations, in some other implementations, the value of the padding bits is related to the generating matrix.
[0040] In conjunction with the second aspect or any of its implementations, in some other implementations, the value of the padding bit satisfies:
[0041] Among them, u pad Let u be the padding bit and u be the information bit. The index of the position of the padding bit in the first bit sequence. This is the index of the position of the information bit in the first bit sequence. The position index of the one or more third preset values in the second received sequence. For the generating matrix OK, List, For the generating matrix OK, List, For a length of K pad,1A sequence of elements f, K pad,1 The number of padding bits in the first bit sequence is denoted by f, and f is the first preset value.
[0042] In conjunction with the second aspect or any of its implementations, in some other implementations, the generator matrix is the generator matrix of RM codes.
[0043] In conjunction with the second aspect or any of its implementations, in some other implementations, the first bit sequence includes K1 information bits and K... pad,1 The method further includes: obtaining a third received sequence; obtaining a fourth received sequence to be decoded based on the third received sequence, the fourth received sequence including one or more fourth preset values; decoding the fourth received sequence according to a second matrix to obtain a decoded fifth bit sequence, the fifth bit sequence including K2 information bits and K... pad,2 K padding bits; where K pad,1 >K pad,2 The K pad,1 The position index of the padding bits in the first bit sequence includes the K pad,2 The position index of the padding bit in the fifth bit sequence, and / or, the position index of the one or more third preset values in the second received sequence includes the position index of the one or more fourth preset values in the fourth received sequence.
[0044] In the above implementation, for different padding quantities, the corresponding padding bit position indices have a nested structure, and / or, the corresponding bit position indices with preset values have a nested structure. Using a nested structure helps reduce storage space usage.
[0045] In conjunction with the second aspect or any of its implementations, in some other implementations, the first receiving sequence does not include information at the positions corresponding to the one or more third preset values.
[0046] The second communication device already knows information (i.e., the third preset values) at locations corresponding to one or more third preset values, therefore this information at these locations does not need to be transmitted. This helps to improve the utilization rate of air interface resources.
[0047] In conjunction with the second aspect or any of its implementations, in some other implementations, obtaining the second received sequence to be decoded based on the first received sequence includes: obtaining the second received sequence to be decoded based on the first received sequence and a first index table, wherein the first index table does not include the position index of the one or more third preset values in the second received sequence, and the value of the position in the second received sequence that does not belong to an index in the first index table is the third preset value. This implementation offers high transmission flexibility.
[0048] In conjunction with the second aspect or any of its implementations, in some other implementations, the first index table includes duplicate indexes.
[0049] For example, the number of times an element is repeated can be greater than 2.
[0050] Based on this implementation method, the bits to be repeatedly transmitted can be flexibly specified, improving the flexibility of transmission.
[0051] In conjunction with the second aspect or any of its implementations, in some other implementations, obtaining the second received sequence to be decoded based on the first received sequence includes: obtaining the second received sequence to be decoded based on the first received sequence and a second index table, wherein the second index table includes the position index of the one or more third preset values in the second received sequence, and the value of the position in the second received sequence belonging to the index in the second index table is the third preset value. This implementation method is simple to implement in hardware.
[0052] Thirdly, embodiments of this application provide a communication device that has the function of implementing the method described in any of the above aspects or any of its implementations. For example, the communication device includes modules, units, or means corresponding to the operations involved in the method described in any of the above aspects or any of its implementations. These modules, units, or means can be implemented by software, hardware, or a combination of software and hardware.
[0053] Fourthly, embodiments of this application provide a communication device including an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory stores part or all of the necessary computer programs, code, or instructions for implementing the functions described in any of the above aspects or any of their implementations. The one or more processors can execute the computer programs, code, or instructions, causing the communication device to implement the methods described in any of the above aspects or any of their implementations when executed. The interface circuit is used to implement the communication functions within the communication device and / or the communication functions between the communication device and other devices or components.
[0054] In one possible design, the processor is used to communicate with other devices or components through the interface circuit.
[0055] In one possible design, the communication device may also include the memory.
[0056] The aforementioned communication device may be a terminal, or a communication module in a terminal, or a chip in a terminal that is responsible for communication functions, such as a modem chip or a SoC or SIP chip containing a modem module.
[0057] The aforementioned communication device may also be a network device, a module in a network device (such as a circuit, processor, chip or chip system, etc.), or a logical node, logical module or software that can implement all or part of the network device.
[0058] Fifthly, embodiments of this application provide a communication system including at least one of the first communication device or the second communication device described above.
[0059] Sixthly, embodiments of this application provide a computer-readable storage medium storing computer-readable instructions, programs, or code, which, when read and executed by a computer, cause the computer to perform any of the above aspects or any implementation thereof.
[0060] Seventhly, embodiments of this application provide a computer program product that, when read and executed by a computer, causes the computer to perform the methods in any of the above aspects or any of their implementations.
[0061] Eighthly, embodiments of this application provide a computer program that, when run on a computer, causes the method provided in any of the above aspects or any of the implementations to be executed.
[0062] Ninthly, embodiments of this application provide a chip or chip system, including an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory is used to store part or all of a computer program, code, or instructions necessary for implementing the functions involved in the methods described in any of the above aspects or any of their implementations. The one or more processors are executable to the computer program, code, or instructions, causing the communication device to implement the methods described in any of the above aspects or any of their implementations when the computer program, code, or instructions are executed. The interface circuit is used to implement communication functions within the communication device and / or communication functions between the communication device and other devices or components.
[0063] In one possible design, the processor is used to communicate with other devices or components through the interface circuit.
[0064] In one possible design, the chip or chip system may also include the memory. Attached Figure Description
[0065] Figure 1 is a schematic diagram of a network architecture applicable to embodiments of this application.
[0066] Figure 2 is a schematic diagram of an open access network architecture applicable to embodiments of this application.
[0067] Figure 3 is a schematic diagram of a communication scenario applicable to embodiments of this application.
[0068] Figure 4 is a schematic architecture diagram of a mobile communication chip system applicable to embodiments of this application.
[0069] Figure 5 is a schematic flowchart of the communication method 500 provided in this application.
[0070] Figure 6 is an example of RM code applying an embodiment of this application.
[0071] Figure 7 is a schematic diagram of the rate matching method of loop skipping.
[0072] Figure 8 is a schematic diagram of a device provided in an embodiment of this application.
[0073] Figure 9 is another structural schematic diagram of the device provided in an embodiment of this application.
[0074] Figure 10 is a schematic architecture diagram of an encoder chip applicable to embodiments of this application.
[0075] Figure 11 is a schematic architecture diagram of a decoder chip applicable to embodiments of this application.
[0076] Figure 12 is a schematic diagram of a chip system provided in an embodiment of this application. Detailed Implementation
[0077] Before introducing the embodiments of this application, the following description is provided.
[0078] The terms "for indicating" or "instruction" can include both direct and indirect indication, or they can be explicit and / or implicit. The various numerical designations such as "first," "second," etc., are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application, such as distinguishing different messages or different information. "Predefined" can be implemented by pre-storing corresponding codes, tables, or other methods that can be used to indicate relevant information in the device; this application does not limit the specific implementation method. The "protocol" involved can refer to standard protocols in the field of communication, such as the Long Term Evolution (LTE) protocol, the New Radio (NR) protocol, and related protocols applied to future communication systems; this application does not limit this. The words "exemplary," "for example," "exemplarily," "as another example," etc., are used to indicate that something is an example, illustration, or description. Any embodiment or design described as an "example" in this application should not be construed as being better or more advantageous than other embodiments or designs. The terms "comprising," "including," "having," and variations thereof all mean "including but not limited to," unless otherwise specifically emphasized. "A plurality" 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 that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, and c can mean: a, or, b, or, c, or, a and b, or, a and c, or, b and c, or, a, b, and c. Here, a, b, and c can be single or multiple. Descriptions involving network element A sending messages, information, or data to network element B, and network element B receiving messages, information, or data from network element A, aim to specify which network element the message, information, or data is to be sent to, without specifying whether they are sent directly or indirectly through other network elements. Descriptions such as “when…”, “under…”, “if”, and “if” all indicate that the device will take corresponding actions under certain objective circumstances. They do not limit the time, nor do they require the device to make a judgment action when implementing it, nor do they imply any other limitations.
[0079] Furthermore, the network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.
[0080] The following describes a communication system to which embodiments of this application can be applied.
[0081] The embodiments of this application can be applied to various communication systems, including but not limited to: 5th generation (5G) systems or NR systems, LTE systems, Long Term Evolution-Advanced (LTE-A) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, etc. They can also be applied to future communication systems. Furthermore, they can be applied to device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, long term evolution-vehicle (LTE-V) communication, long term evolution-machine (LTE-M) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), Internet of Things (IoT) communication systems, narrowband Internet of Things (NB-IoT) systems, or other communication systems. The embodiments of this application can also be applied to non-terrestrial network (NTN) systems such as reconfigurable intelligent surface (RIS) communication systems, satellite communication systems, high altitude platform station (HAPS) communication, and unmanned aerial vehicles (UAVs), for example, integrated communication and navigation (IcaN) systems, global navigation satellite systems (GNSS), and ultra-dense low-Earth orbit satellite communication systems.Furthermore, it can be extended to similar wireless communication systems, such as wireless local area networks (WLAN), wireless-fidelity (WiFi), worldwide interoperability for microwave access (WIMAX), and other communication systems related to the 3rd generation partnership project (3GPP).
[0082] The communication system applicable to embodiments of this application may include one or more transmitting devices and one or more receiving devices. Optionally, one of the transmitting device and the receiving device may be a terminal, and the other may be a network device. Optionally, both the transmitting device and the receiving device may be terminals. Optionally, both the transmitting device and the receiving device may be network devices.
[0083] In this application, the transmitting device can be understood as a device that transmits data or information, and may also be called an encoding device. The receiving device can be understood as a device that receives data or information, and may also be called a decoding device.
[0084] For example, Figure 1 shows a schematic diagram of a network architecture to which embodiments of this application may be applied.
[0085] Figure 1 illustrates a possible, non-limiting system diagram. As shown in Figure 1, the communication system 10 includes a radio access network (RAN) 100 and a core network (CN) 200. RAN 100 includes at least one RAN node (110a and 110b in Figure 1, collectively referred to as 110) and at least one terminal (120a-120j in Figure 1, collectively referred to as 120). RAN 100 may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in Figure 1). Terminal 120 is wirelessly connected to RAN node 110. RAN node 110 is wirelessly or wired connected to core network 200. The core network equipment in core network 200 and RAN node 110 in RAN 100 can be different physical devices, or they can be the same physical device integrating core network logical functions and radio access network logical functions.
[0086] RAN 100 can be a 3GPP-related cellular system, such as a 4G, 5G mobile communication system, or a future-oriented evolution system. RAN 100 can also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. RAN 100 can also be a communication system that integrates two or more of the above systems.
[0087] RAN node 110, sometimes referred to as access network equipment, RAN entity, or access node, constitutes part of the communication system and assists terminals in achieving wireless access. Multiple RAN nodes 110 in communication system 10 can be of the same type or different types. In some scenarios, the roles of RAN node 110 and terminal 120 are relative. For example, network element 120i in Figure 1 can be a helicopter or drone, which can be configured as a mobile base station. For terminals 120j accessing RAN 100 through network element 120i, network element 120i is a base station; however, for base station 110a, network element 120i is a terminal. RAN node 110 and terminal 120 are sometimes both referred to as communication devices. For example, network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functions, and network elements 120a-120j can be understood as communication devices with terminal functions. RAN nodes can be RAN nodes in terrestrial networks or RAN nodes in NTN systems such as satellites, HAPS, and drones.
[0088] In one possible scenario, the RAN node can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmit / receive point (TRP), a next-generation NodeB (gNB), a base station in a future mobile communication system, or an access node in a WiFi system. The RAN node can be a macro base station (as shown in Figure 1, 110a), a micro base station or indoor station (as shown in Figure 1, 110b), a relay node or donor node, or a radio controller in a CRAN scenario. Optionally, the RAN node can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). All or part of the functions of the RAN node in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (e.g., a cloud platform). The RAN node can also be equipped with communication modules, circuits, or chips that perform corresponding communication functions. The RAN node can also be configured with program instructions for performing corresponding communication functions, as well as corresponding program instructions. The RAN node in this application can also be a logical node, logical module, or software capable of implementing all or part of the RAN node's functions.
[0089] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, with each RAN node performing a portion of the base station's functions. For example, RAN nodes can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs), etc. 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 frequency equipment or radio frequency units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).
[0090] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.
[0091] For ease of understanding, the O-RAN architecture of an embodiment of this application is briefly described with reference to Figure 2. As can be seen from Figure 2, the O-RAN architecture includes: a first network unit, a second network unit, a third network unit, an O-eNB, an O-CU-CP, an O-CU-UP, an O-DU, an O-RU, and an O-cloud.
[0092] The network elements (also called nodes) in Figure 2 can be interconnected. For example, the first network unit connects to the O-cloud via the O2 interface; the first network unit connects to the third network unit, O-eNB, O-CU-CP, O-CU-UP, O-DU, and O-RU via the O1 interface; the first network unit connects to the O-RU via the open fronthaul management plane (M-Plane) interface; the O-DU connects to the O-RU via the open fronthaul M-Plane interface and the open fronthaul control / user / synchronization plane (C / U / S-Plane) interface; the third network unit connects to the O-eNB, O-CU-CP, O-CU-UP, and O-DU via the E2 interface; the O-CU-CP connects to the O-DU via the F1-c interface; the O-CU-UP connects to the O-DU via the F1-u interface; and the O-CU-CP connects to the O-CU-UP via the E1 interface. For a detailed description of the interfaces shown in Figure 2, please refer to existing standards; further details are omitted here.
[0093] One possible example is that the first network unit could be a service management and orchestration framework (SMO), or a network unit with similar functionality to an SMO; there is no limitation on which one.
[0094] One possible example is that the second network element can be a Non-RT RIC, or a network element with similar functionality to a Non-RT RIC; there is no limitation on this.
[0095] One possible example is that the third network unit could be a Near-RT RIC, or a network unit with similar functionality to a Near-RT RIC; there is no limitation on this.
[0096] O-RAN aims to achieve an intelligent and open access network. A key feature of the O-RAN architecture is the separation of hardware and software, enabling the virtualization of network functions and the standardization of hardware. Furthermore, O-RAN can incorporate artificial intelligence (AI).
[0097] In the embodiments of this application, the access network device may also be simply referred to as a network device.
[0098] A terminal is a device or module that connects to the aforementioned communication system and possesses corresponding communication functions. Terminals can also be called terminal equipment, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as D2D, V2X, MTC, IoT, virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, and smart cities. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, wearable device, vehicle device (such as a complete vehicle device, vehicle module, vehicle chip, on-board unit (OBU) or telematics box (T-BOX)), flight equipment (e.g., drone, helicopter, airplane, hot air balloon), ship, robot, robotic arm, smart home device, transportation vehicle with wireless communication capabilities, communication module, smart point of sale (POS) machine, customer-premises equipment (CPE), light user equipment (light UE), reduced capability user equipment (REDCAP UE), vehicle-mounted equipment (e.g., car, bicycle, electric vehicle, airplane, ship, train, high-speed rail, etc.), satellite terminal, etc. The embodiments of this application do not limit the device form of the terminal. The terminal typically contains a communication module, circuit, or chip that performs the corresponding communication function. The terminal can also be configured with program instructions for performing the corresponding communication function.
[0099] The embodiments of this application can be applied to various mobile communication scenarios, such as multi-hop or multi-relay transmission between network devices and terminal devices, dual connectivity (DC) or multiple connectivity between multiple network devices and terminal devices, etc.
[0100] Figure 3 is a schematic diagram of a communication scenario applicable to embodiments of this application.
[0101] Figure 3(a) shows a point-to-point single connection between a network device and a terminal device; Figure 3(b) shows a multi-hop single connection between a network device and a terminal device; Figure 3(c) shows a DC dual connection between a network device and a terminal device; and Figure 3(d) shows a multi-hop multi-connection between a network device and a terminal device.
[0102] Figure 3 is exemplary and does not limit the network architecture applicable to this application. Any network architecture in a cellular network where one device charges other devices is applicable to this application. Communication scenarios applicable to this application include, but are not limited to: network devices charging terminal devices, network devices charging network devices, network devices charging relays, relay network devices charging terminal devices, multiple network devices charging one terminal device, multiple network devices charging multiple terminal devices, and any scenario where one or more devices charge one or more other devices.
[0103] Unless otherwise specified, the means for implementing the functions of a terminal or network device in this application can refer to the terminal or network device itself, or it can refer to a means that enables the terminal or network device to implement the function, such as a system-on-a-chip (SoC) or a chip, specifically a SoC or a modem. This means can be installed in the terminal or network device. In the embodiments of this application, the SoC can be composed of chips, or it can include chips and other discrete devices.
[0104] Figure 4 is a schematic architecture diagram of a mobile communication chip system applicable to embodiments of this application.
[0105] As shown in Figure 4, the mobile communication chip system is divided into downlink processing and uplink processing. In downlink processing, layer 2 (L2) data is encoded, modulated, layer mapped, precoded, framed, and subjected to inverse fast Fourier transform (IFFT), and finally processed into an over-the-air signal by the mid-RF module. In uplink processing, the received signal is processed by the mid-RF module to obtain baseband data, and physical layer signal processing is completed through fast Fourier transform (FFT), deframing, equalization, de-mapping, demodulation, and decoding. The embodiments of this application are applied to the encoding and decoding modules in the mobile communication chip system architecture and are important components of the baseband processing system. Exemplarily, the encoding module can be an encoder chip, and the decoding module can be a decoder chip.
[0106] This document uses a 5G system as an example to illustrate specific solution details in some embodiments. It is understood that when this solution is used in other communication systems, such as LTE systems or future communication systems, the messages, channels, or information in the solution can be replaced with messages, channels, or information in other communication systems that can achieve the corresponding functions, and this application does not limit this.
[0107] The technical solutions provided in the embodiments of this application can be applied to channel coding / decoding between communication devices. Channel coding / decoding between communication devices can include: channel coding / decoding between network devices and terminal devices, channel coding / decoding between network devices, and channel coding / decoding between terminal devices. The term channel coding can also be referred to as coding, network coding, source-channel joint coding, etc., and the term channel decoding can also be referred to as decoding, network decoding, source-channel joint decoding, etc. The coding structures applicable to the embodiments of this application include, but are not limited to: concatenated codes, layered codes, coupled codes, outer codes, sliding window codes, product codes, or ladder codes. The term coding structure can also be referred to as code type, code design, etc.
[0108] To facilitate understanding of the embodiments of this application, several concepts or terms involved in the embodiments of this application will be briefly explained.
[0109] The concepts and terms described below are based on those specified in the agreement, but do not imply that the embodiments of this application can only be applied to existing systems. The concepts and terms involved in the embodiments of this application can be applied to future systems. Furthermore, the specific names of the concepts or terms (e.g., concepts or terms related to functional descriptions) may be adjusted as future systems develop.
[0110] 1. Channel coding
[0111] Channel coding and decoding is one of the core technologies in the field of wireless communication. The complete process of channel coding includes one or more of the following: adding cyclic redundancy check (CRC) codes, code block segmentation, error correction coding, rate adaptation, code block concatenation, data interleaving, and data scrambling. Among these, error correction coding is a particularly crucial part. The purpose of error correction coding is to ensure that the receiving device can automatically correct errors that occur during data transmission with as little redundancy overhead as possible. At the same bit error rate, the smaller the overhead required, the higher the coding efficiency. Traditional channel coding and decoding generally includes linear block codes (such as Hamming codes, Gray codes, BCH (Bose–Chaudhuri–Hocquenghem) codes, Reed-Solomon (RS) codes, etc.), convolutional codes, and concatenated codes. These codes have their own different characteristics and performance, and are suitable for different scenarios.
[0112] In third-generation (3G) and fourth-generation (4G) mobile communication systems, Turbo codes, as a coding and decoding technology defined by the 3GPP standard, belong to convolutional codes and have excellent performance, approaching the limits of Shannon theory. In the 5G era, data transmission rates are orders of magnitude higher than in 4G. For Turbo codes, their serial-processing-based decoders struggle to effectively support such high-speed data transmission. Simultaneously, the 5G era has seen the emergence of richer service application scenarios and new requirements for channel coding. For example, massive machine-type communication (mMTC) scenarios require smaller data packets, while ultra-reliable low-latency communications (URLLC) scenarios have very high requirements for encoding and decoding latency and low bit error rate. Therefore, based on the key channel coding requirements of the three major 5G application scenarios, the 5G standard ultimately adopted low-density parity-check codes (LDPC) and polar codes. Compared to traditional linear block codes and convolutional codes, these two types of codes have superior performance and can approach the limits of Shannon theory very closely. However, they also have their own characteristics in terms of applicable scenarios and the complexity of the codec.
[0113] For future mobile communication networks, real-time high-data-rate applications such as extended reality (XR), mixed reality (MR), and immersive services have emerged. These emerging services place higher demands on the peak throughput and area efficiency of encoding and decoding, with peak rates even requiring terabits per second (Tbps), while simultaneously requiring further reductions in decoder power consumption. LDPC codes and Polar codes cannot meet these requirements. Therefore, technological breakthroughs are needed in two main directions: high-throughput low-power encoding and decoding, and high-reliability encoding and decoding. This can be achieved through new coding designs and low-complexity decoding designs to reach the goals of future mobile communication standards.
[0114] 2. RM code
[0115] Rectangular-Minimum (RM) codes are among the oldest, simplest, and most unique error-correcting codes. Proposed by scholar Deemuller in 1954, they are over 70 years old. Due to their unique and rich structural characteristics, RM codes have attracted extensive research from scholars in wireless communication, computer science, cryptography, and discrete mathematics. Modeling and characterization of RM codes have encompassed various approaches, including finite geometry, polynomial rings, and Boolean functions.
[0116] This section first introduces a method for defining RM codes based on polynomial rings.
[0117] 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 binary vector z. Based on this, the evaluation vector of the polynomial f can be defined. 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., an RM(m,r) code can be represented as:
[0118] Here, deg(f) represents the order of the polynomial f. Without ambiguity, the parameter m can be called the code length parameter of the RM(m,r) code (or the first parameter of the RM code), and the parameter r can be called the order of the RM(m,r) code (or the second parameter of the RM code). According to the above definitions, the number of information bits k in the RM(m,r) code is the number of m-ary binary monomials, which can be expressed as: in This represents the number of combinations. Furthermore, the generator matrix of the RM(m,r) code can be obtained from the evaluation vector of the monomial. For example, for m=3 and r=2, the generator matrix of the corresponding RM code can be expressed as:
[0119] From the generator matrix G of the RM code, its inverse matrix G can be obtained. -1 Therefore, for any valid RM codeword x∈RM(m,r), G can be used. -1 Obtain its corresponding information bit u = xG -1 .
[0120] The following introduces another way to define RM codes.
[0121] The recursive generator matrix of RM codes is another way to define RM code generator matrices, which utilizes the recursive property of RM codes. For any valid codeword x in an RM(m,r) code, this codeword can be divided into a first half and a second half, for example, it can be represented as: x = (x1, x2). Then x1, x2 ∈ RM(m-1, r), and Suppose the generator matrix of the RM(m,r) code is represented as G. m,r Alternatively, G(m,r), when the information sequence is u, the corresponding generated RM codeword sequence is x = u· Gm,r Based on the aforementioned recursive properties of RM codes, the generator matrix G can be... m,r Decomposed into the following form:
[0122] Among them, G m,r In this context, 0 generally refers to a matrix consisting entirely of zeros, and its dimension is the same as G. m-1,r-1 The sizes are the same. For some special m and r, which are special code types, their generator matrices can be easily obtained. For example, based on the recursive property, G can be... m,r It can be decomposed into a matrix that includes the following two special cases:
[0123] 1) When r = 0, the RM code corresponds to a 1-bit repeat code, which means that the 1-bit information bit is repeated twice. m Therefore, the generator matrix corresponding to the RM code with r=0 is 1 row and 2 columns. m A matrix of all 1s in each column;
[0124] 2) When r = m, the RM code corresponds to a code rate of 1. Therefore, the generator matrix corresponding to this RM code with r = m is of size 2. m The identity matrix.
[0125] Based on the two generator matrices of RM codes described above and the recursive definition of generator matrices, the generator matrix of any RM code can be obtained. For example, for the RM(3,1) code, it is known that the RM(3,1) code can be constructed from RM(2,0) codes and RM(2,1) codes; while the RM(2,1) code can be constructed from RM(1,0) codes and RM(1,1) codes. Therefore, the generator matrix of RM(3,1) can be expressed as:
[0126] Generally, the RM code generation matrix defined in the above manner is also called a recursive generation matrix.
[0127] RM codes have many characteristics that are helpful for their decoding algorithms. The characteristics of RM codes will be briefly introduced below.
[0128] 1) Automorphic permutation property of R-codes
[0129] For a valid codeword x in an RM(m,r) code, its 2 m The bits of a codeword can be represented by an m-dimensional binary vector z = (z1, ..., z2). m Use ) as the index. For any binary full-rank matrix and vectors Define coordinate transformation That is, the bit at position z of codeword x is placed in Position, so that we can get a new length of 2 m The code
[0130] 2) Decomposition properties of RM codes
[0131] For any valid codeword x of an RM(m,r) code (or any of its automorphic permutation codewords) (See the aforementioned properties), this codeword can be divided into a first half and a second half: x = (x1, x2). At this point, x1, x2 ∈ RM(m-1, r), and (for automorphic permutation codewords) ).
[0132] 3) Projection properties of RM codes
[0133] definition Let be an s-dimensional subspace of an m-dimensional binary vector space, denoted as . It is a subspace The set of all cosets, i.e. Special There are 2 in the middle m-s A coset. Define an RM codeword y in a subspace. The projection of the subspace is but
[0134] 3. RM code decoding algorithm
[0135] Decoding algorithms for RM codes can include fast hadamard transform (FHT) decoding, single parity check (SPC) decoding, Dumer decoding, and automorphism ensemble decoding (AED).
[0136] 1) FHT decoding
[0137] The FHT decoding algorithm is primarily designed for efficient decoding of first-order RM codes. For example, for an RM(m,1) code, the length of its information bits can be represented as m+1. If a maximum likelihood estimation (ML) decoding algorithm is used, it would require enumerating 2... m+1 Given m+1 different information bit sequences, each sequence is RM-encoded. For each encoded sequence, the likelihood is calculated based on the log-likelihood ratio (LLR) of each received bit, and all 2^m bits are used. m+1 The codeword with the highest likelihood value among the candidate information bit sequences is used as the decoding result. Even without considering encoding complexity, this method requires a certain number of floating-point additions. (That is, the complexity is approximately the square of the code length).
[0138] The FHT decoding algorithm utilizes the inherent characteristics of RM codes to accelerate the calculation of LLR in the aforementioned process. For a codeword sequence... Its likelihood can be expressed as Where L z This refers to the bit received by the LLR at coordinate z. Since the FHT decoding algorithm is designed for first-order RM codes, the codeword bits of its RM code can be represented as... Therefore, maximizing the likelihood is equivalent to finding the information bits {u0,…,u m} makes maximize.
[0139] For binary variables Can be defined If all of them Arranged into vectors It is essentially L z The Hadamard transform of the first-order RM code can be solved quickly using the FHT algorithm, thus completing the ML decoding of the first-order RM code.
[0140] 2) SPC decoding
[0141] The SPC decoding algorithm is primarily a high-efficiency decoding algorithm for m-1 order RM codes. In fact, RM(m, m-1) codes are essentially SPC codes. SPC codes have only one parity bit, and after adding the parity bit, the XOR result of all codeword bits is 0. The decoding method for SPC codes is relatively simple: first, perform a hard decision on each bit based on the LLR value. If the number of 1s after the hard decision is even, the hard decision result is used as the decoding result; otherwise, flip the hard decision bit with the smallest absolute LLR value and output it. Its overall computational complexity is O(n log n).
[0142] 3) Dumer decoding
[0143] Dumer decoding is a classic RM code decoding algorithm. It cleverly utilizes the decomposition and order reduction property of RM codes, solving the RM code through a serial recursive approach. For example, suppose the receiving device (e.g., a second communication device) receives an LLR sequence L0,…,L… n Corresponding to RM(m, r) code, where n = 2 m This refers to the code length or the length of the received LLR sequence. From the decomposition and order reduction property of RM codes, we know that for an RM codeword y∈RM(m,r)=(y l ,y r ), where y l It's the first half of the code, y r This is the second half of the code. Among them, y l ∈RM(m-1, r), The Dumer decoding algorithm utilizes this property for decoding, first processing the first half L of the received sequence. l and the second half L r Element-by-element merging yields the merged LLR sequence:
[0144] in, This represents the merging method for LLR fields, such as tanh merging, which can be represented as:
[0145] L c =sign(L l )·sign(Lr )·min(|L l |,|L r |)
[0146] Here, sign(·) represents the sign operation. The merged sequence L c Corresponding to RM(m-1, r-1) codes, the decoded result y can be obtained by aligning and performing a reduction in order. c Next, we will use y c The first half and the second half of the received sequence are merged a second time:
[0147] L d =L l +(1-2·y c )·L r
[0148] Among them, L d For the corresponding RM(m-1, r) code, it can be decoded by reducing its order. The above decoding process can be recursively repeated until some special RM nodes are reached. For example, RM(s, 1) can be decoded using the FHT algorithm, while RM(s, 0), RM(s, s), and RM(s, s-1) can be solved efficiently using the maximum likelihood decoding algorithm.
[0149] 4) AED decoding
[0150] As introduced in the aforementioned properties of RM codes, RM codes have rich automorphic permutation properties, and the AED decoding algorithm utilizes this characteristic of RM codes.
[0151] The AED decoding algorithm is summarized as follows: For the received codeword LLR sequence L = (L0, ..., L... n-1 First, p permutations π1, ..., π are used. p The LLR sequence is permuted to obtain p permuted LLR sequences: L (1) =π1(L),…,L (p) =π p (L); Next, for each permuted LLR sequence, the decoder DEC(·) is used to decode it to obtain the corresponding decoding result. in It is the permutation function π i The inverse function of the algorithm restores the original bit order of the decoding result based on the permuted LLR sequence; after obtaining the decoding result for each permutation, the likelihood index can be used. To measure their quality, the one with the highest likelihood index will be selected as the final decoding result.
[0152] The decoder DEC(·) used for a given permutation includes one or more of the following algorithms: Fast Hadamard Transform, Dumer decoding algorithm, Dumer recursive list decoding algorithm, recursive projection aggregation (RPA) decoding algorithm, Sidel'nikov-Pershakov algorithm, Sakkour algorithm, maximum likelihood decoding, etc. Furthermore, the decoder used for different permutations may be the same or different.
[0153] The relevant terms used in the embodiments of this application have been described above, and will not be explained further below.
[0154] Given that existing Restricted Metrics (RM) codes only support a fixed set of values for m and r, the length of the supported information bit sequence is determined by m. This means that the supported information bit sequences are limited to a fixed set of values, and different RM codes have different values for m, resulting in significant differences in the supported information bit sequence lengths. In practical transmission scenarios, the length of information bits is flexible, and RM codes cannot flexibly support encoding information sequences of different lengths. One solution is to pad the input information bit sequence so that the length of the padded bit sequence is the length of the sequence that the RM code supports. This method allows RM codes to support more flexible information bit sequence lengths. However, this method reduces the automorphism group of the padded RM code, leading to poor decoding performance.
[0155] This application provides a communication method and a communication device to reduce decoding complexity.
[0156] The communication method provided in this application is described in detail below.
[0157] Figure 5 is a schematic flowchart of the communication method 500 provided in this application.
[0158] Understandably, method 500 can be executed by a first communication device and a second communication device. Unless otherwise specified, the "first communication device" in this application can refer to a communication device (e.g., a network device, a terminal device, an encoding device, etc.), a component used in that communication device (e.g., a circuit, a processor, a chip, or a chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. Similarly, the "second communication device" in this application can refer to a communication device (e.g., a network device, a terminal device, a decoding device, etc.), a component used in that communication device (e.g., a circuit, a processor, a chip, or a chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. The component used in the communication device can be a component within the communication device, or it can be independent of the communication device but coupled to it.
[0159] Method 500 may include at least a portion of the following.
[0160] Step 501: The first communication device acquires the first bit sequence to be encoded.
[0161] The embodiments of this application do not limit the implementation method of the first communication device acquiring the first bit sequence.
[0162] For example, the first communication device can perform source encoding on the source symbols to obtain a first bit sequence.
[0163] For example, the first communication device can perform source encoding on the source symbols to obtain an information bit sequence, and then perform padding on the information bit sequence to obtain a first bit sequence.
[0164] For example, the first communication device may receive a first bit sequence from another communication device.
[0165] Step 502: The first communication device encodes the first bit sequence according to the first matrix to obtain the encoded second bit sequence.
[0166] In this second bit sequence, one or more of the first bits take the value of a first preset value. In other words, the first bit sequence ensures that one or more bits of the encoded second bit sequence take the value of the first preset value; that is, the first bit sequence can make one or more bits of the encoded second bit sequence take the value of the first preset value. The first bit can also be called a fixed bit. The second bit sequence can be a codeword bit sequence.
[0167] For example, the first preset value can be defined by a protocol, determined through signaling negotiation between the first and second communication devices, or pre-configured in the first communication device, without limitation. The first preset value can also be described as a first numerical value, a first value, or a first fixed value, etc. When the second bit sequence includes multiple first bits (that is, multiple bits in the second bit sequence are the first preset value, or one or more first bits are multiple first bits), the first preset values corresponding to different first bits can be the same or different. For example, the second bit sequence includes 3 first bits, and the first preset values corresponding to the 3 first bits are all 0 (that is, the values of the 3 first bits are fixed to 0), or, the first preset values corresponding to the 3 first bits are all 1 (that is, the values of the 3 first bits are fixed to 1), or, the first preset value corresponding to some of the 3 first bits is 0 (that is, the values of some of the 3 first bits are fixed to 0) and the first preset value corresponding to the remaining bits is 1 (that is, the values of the remaining bits of the 3 first bits are fixed to 1).
[0168] For example, the position of one or more first bits in the second bit sequence is a preset position. The preset position can be defined by a protocol, determined by signaling negotiation between the first and second communication devices, or pre-configured in the first communication device; there is no limitation. For example, the preset position can be represented by an index sequence, an index set, or an index table, with each index corresponding to a position in the second bit sequence.
[0169] The embodiments of this application do not limit the implementation of the first bit sequence.
[0170] Method 1
[0171] In Method 1, the first bit sequence includes information bits and padding bits, which together cause one or more first bits of the encoded second bit sequence to take the value of a first preset value. There can be one or more information bits. There can be one or more padding bits.
[0172] For example, the length of the first bit sequence is the sum of the number of information bits and the number of padding bits. When this method is applied to RM codes, the number of information bits may not be the sequence length supported by RM encoding, and the length of the first bit sequence after padding the information bits is the sequence length supported by RM encoding.
[0173] The embodiments of this application do not limit the method of determining the value of the padding bits.
[0174] In some implementations, the value of the padding bit is related to the following information: 1) the position index of one or more first bits in the second bit sequence; 2) the number of one or more first bits; and 3) a first preset value.
[0175] Example 1, the values of the padding bits satisfy:
[0176] That is, the values of the padding bits satisfy:
[0177] in, For the second bit sequence, u pad Where u is the padding bit, I is the information bit, and u is the identity matrix. The position index of the padding bit in the first bit sequence (i.e., the padding bit index). This is the position index of the information bit in the first bit sequence (i.e., the information bit index). Let G be the index of one or more first bits in the second bit sequence, and let G be the generator matrix. For generating matrices OK, List, For generating matrices OK, List, For a length of K pad,1 A sequence of elements f, where f is the first preset value, and ∏ is (K1+K). pad,1 )×(K1+K pad,1 The interleaving matrix, where K1 is the number of information bits in the first bit sequence, and K... pad,1 The number of padding bits in the first bit sequence is given. Each row of ∏ consists of one 1 and K1+K. pad,1 -1 zero, each column includes one 1 and K1+K pad,1 -1 zeros, the index in ∏ is The indexed column 1 is located at the last K of ∏. pad,1 In the row, the index of ∏ is The index 1 of column ∏ is located in the first K1 rows of ∏.
[0178] In Example 1, the first communication device (transmitter) can store matrix G1, vector b1, and matrix ∏. Having matrix G1, vector b1, and matrix ∏ is sufficient to fill (or encode) the input information bit sequence (i.e., u) to obtain the first bit sequence to be encoded. During the process of obtaining the first bit sequence, the first communication device is unaware of this process. And a generator matrix G. Subsequently, the first communication device can encode the first bit sequence according to the first matrix to obtain the second bit sequence. In Example 1, the first matrix can be the generator matrix G.
[0179] In some implementations, the value of the padding bits is also related to the following information: 1) the value of the information bits; 2) first information; and 3) second information. The first information includes the number of padding bits and / or the number of information bits. When the first information includes either the number of padding bits or the number of information bits, the other number can be determined by combining it with the length of the sequence to be encoded (i.e., the second bit sequence). The second information includes the position index of the padding bits in the first bit sequence and / or the position index of the information bits in the first bit sequence. Similarly, when the first information includes either the position index of the padding bits in the first bit sequence or the position index of the information bits in the first bit sequence, the other position index can be determined by combining it with the length of the sequence to be encoded (i.e., the second bit sequence). Position indices can also be called position indices, indices, position index sequences, index sequences, position index sets, or index sets, etc.
[0180] It should be noted that the number of information bits can also be indirectly obtained through the values of the information bits.
[0181] Example 2, the values of the padding bits satisfy:
[0182] That is, the values of the padding bits satisfy:
[0183] Among them, u pad U represents the padding bits, and u represents the information bits. The position index of the padding bit in the first bit sequence (i.e., the padding bit index). This is the position index of the information bit in the first bit sequence (i.e., the information bit index). Let G be the index of one or more first bits in the second bit sequence, and let G be the generator matrix. For generating matrices OK, List, For generating matrices OK, List, For a length of K pad,1 A sequence of elements f, where f is the first preset value, and K. pad,1 This represents the number of fill bits in the first bit sequence.
[0184] In Example 2, the first communication device (transmitter) can store matrix G2 and vector b2. Having matrix G2 and vector b2 is sufficient to obtain the filler bits based on the input information bit sequence (i.e., u). During the process of obtaining the first bit sequence, the first communication device is unaware of the generation of matrix G. Subsequently, the first communication device can... and A first bit sequence to be encoded is obtained. Subsequently, the first communication device encodes the first bit sequence according to a first matrix to obtain a second bit sequence. In Example 2, the first matrix can be a generator matrix G. The first communication device... and The method for obtaining the first bit sequence to be encoded will be described in detail below.
[0185] Example 3: The values of the padding bits satisfy Formula 2. In Example 3, for the first communication device (transmitter), matrix G1, vector b1, and... and / or f and G. Once the information bit sequence (i.e., u) is obtained, the sequence (u, u) can be obtained based on G1 and b1, combined with formula 2 above. pad ), sequence (u,u pad The elements included in the sequence (u,u) are the same as those included in the first bit sequence. pad The order of the elements in the first bit sequence may differ from the order of the elements in the second bit sequence. Subsequently, the first communication device can... and / or For sequence (u,u) pad Perform an interleaving operation so that u pad Sort to On the index, u is sorted to The first communication device obtains the first bit sequence to be encoded by indexing the first bit sequence. During the process of obtaining the first bit sequence, the first communication device is unaware of the generator matrix G. Subsequently, the first communication device encodes the first bit sequence according to the first matrix to obtain the second bit sequence. In Example 3, the first matrix can be the generator matrix G.
[0186] In other words, the first communication device can first acquire the fourth bit sequence (u,u) pad Then, for the fourth bit sequence (u,u) pad The first bit sequence is obtained by interleaving the second bit sequence (u,u) with the third bit sequence (u,u) pad The fourth bit sequence (u, u) contains the same elements as the first bit sequence. pad The order of the elements in the first bit sequence may differ from the order of the elements in the second bit sequence.
[0187] In some implementations, the values of the padding bits are also related to the generator matrix.
[0188] Example 4, the values of the padding bits satisfy:
[0189] That is, the values of the padding bits satisfy:
[0190] Among them, u pad U represents the padding bits, and u represents the information bits. The position index of the padding bit in the first bit sequence (i.e., the padding bit index). This is the position index of the information bit in the first bit sequence (i.e., the information bit index). Let G be the index of one or more first bits in the second bit sequence, and let G be the generator matrix. For generating matrices OK, List, For generating matrices OK, List, For a length of K pad,1 A sequence of elements f, where f is the first preset value, and K. pad,1 This represents the number of fill bits in the first bit sequence.
[0191] In Example 4, for the first communication device (the sender), it is possible to store... f and G. Once the information bit sequence (i.e., u) is obtained, the padding bits (or padding bit sequence) can be obtained based on this information and according to Formula 6 above. Subsequently, the first communication device can... and A first bit sequence to be encoded is obtained. Subsequently, the first communication device encodes the first bit sequence according to the first matrix to obtain a second bit sequence. In Example 4, the first matrix can be a generator matrix G.
[0192] In method 1 above, the first communication device obtains a first bit sequence to be encoded by adding appropriate padding bits to the information bit sequence. The added padding bits can make one or more first bits of the second bit sequence obtained by encoding the first bit sequence take the value of a first preset value. In method 1 above, the encoding process of the first bit sequence using a generator matrix can adopt an existing encoding method. The encoding process of the first bit sequence using a generator matrix can refer to: the first bit sequence to be encoded... The process of encoding using the generator matrix G to obtain the second bit sequence c is as follows:
[0193] Method 2
[0194] In Method 2, the first bit sequence is an information bit sequence. The information bit sequence may include one or more information bits.
[0195] Method 2 provides an encoding method that encodes a first bit sequence (i.e., an information bit sequence) and the value of one or more first bits in the second bit sequence of the resulting encoded second bit sequence is a first preset value.
[0196] By concatenating the processes corresponding to Formula 1 and Formula 2 with the subsequent coding process, we can obtain a unified Formula 7, as follows:
[0197] in:
[0198] in, For the first bit sequence, u pad Where u is the padding bit, I is the information bit, and u is the identity matrix. The position index of the padding bit in the first bit sequence (i.e., the padding bit index). This is the position index of the information bit in the first bit sequence (i.e., the information bit index). Let G be the index of one or more first bits in the second bit sequence, and let G be the generator matrix. For generating matrices OK, List, For generating matrices OK, List, For a length of K pad,1 A sequence of elements f, where f is the first preset value, and ∏ is (K1+K). pad,1 )×(K1+K pad,1 The interleaving matrix, where K1 is the number of information bits in the first bit sequence, and K... pad,1 The number of padding bits in the first bit sequence is given. Each row of ∏ consists of one 1 and K1+K. pad,1 -1 zero, each column includes one 1 and K1+K pad,1 -1 zeros, the index in ∏ is The indexed column 1 is located at the last K of ∏. pad,1 In the row, the index of ∏ is The index 1 of column ∏ is located in the first K1 rows of ∏.
[0199] In method 2, the first communication device (transmitter) can store the matrix G required for encoding. A and vector b A Once the information bit sequence (i.e., u) is obtained, it can be determined according to matrix G. A and vector b AThe first bit sequence is encoded to obtain the second bit sequence. In method 2, the first matrix can be matrix G. A .
[0200] In the above embodiments, Length and The lengths can be the same or different.
[0201] The first communication device is described below according to... and The method of obtaining the first bit sequence to be encoded is described.
[0202] Assume the first bit sequence includes K1 information bits and K... pad,1 One padding bit, that is Includes K1 location indices, Including K pad,1 Location index.
[0203] In some implementations, the first communication device can reserve K1+K. pad,1 Cache size; first based on Write K1 information bits sequentially into the corresponding positions in the buffer: Then according to K pad,1 Each padding bit is written sequentially to the corresponding location in the cache.
[0204] In some other implementations, the first communication device can reserve K1+K. pad,1 Cache size; based on and Sequentially combine K1 information bits and K pad,1 Each padding bit is written to the corresponding location in the cache. Among them, according to... and Sequentially combine K1 information bits and K pad,1 The padding bits are written to the corresponding positions in the buffer, which can be done by: traversing from the beginning of the information bit sequence u, setting the counter cnt to 0; incrementing the counter by 1 for each element in u that is traversed; and incrementing the counter cnt whenever the value of the counter cnt is at a certain position. At that time, u pad One bit is inserted into the u sequence at the position corresponding to cnt, and the counter cnt is incremented by 1. This process is repeated until the counter cnt reaches K1+K. pad,1 .
[0205] For example, the pseudocode for the above implementation can be as follows:
[0206] The embodiments of this application can be applied to various encoding methods that have limitations on the length of the input information bit sequence, including but not limited to LDPC codes, polar codes, or RM codes. In encoding methods with limitations on the length of the input information bit sequence, the method of the embodiments of this application can refer to: setting some bits in the encoded second bit sequence to a first preset value (or a fixed value); further, padding the information bits to make the length of the padded first bit sequence equal to the sequence length supported by the corresponding encoding method; a more detailed description can be found in other parts of this document.
[0207] The generator matrix mentioned above refers to the generator matrix under the corresponding encoding method. Taking RM as an example, the generator matrix can be G(r,m), which can be the generator matrix of the RM code defined by a polynomial, or it can be the recursive generator matrix of the RM code, without restriction. Understandably, the name of the generator matrix may be different in different encoding methods; the generator matrix can also be called the check matrix, encoding matrix, decoding matrix, etc.
[0208] All the above formulas are based on Formula 4, that is The resulting transformation will be described below using RM code as an example, in conjunction with Figure 6, for Formula 4.
[0209] Figure 6 is an example of RM code applying an embodiment of this application.
[0210] The padding operation in Figure 6 is performed on the original information bit sequence of length K, u = (u1, ..., u2). k The length is K after padding. r,m The padded bit sequence to be encoded (That is, the first bit sequence), where K r,m It is the number of information bits (i.e., the information bit length) that the RM(m,r) code can support encoding.
[0211] Among them, for the bit sequence to be encoded K r,m Index {1,…,K} r,m This can be split into two non-overlapping sets: the set of bit position indices. and the set of position indices of information bits and in, The position index in the code indicates the location where the original K-bit information bits are placed, therefore The size is The location index in the middle indicates the position used to place K. padpadding bits
[0212] By introducing K pad K padding bits are used to ensure that the K bits in the codeword bit sequence (i.e., the second bit sequence) obtained after RM encoding are equal to K bits. pad The value of each codeword bit is fixed as f, K pad The index of the position of each codeword bit in the codeword bit sequence is: Therefore, it can be deduced that the values of the padding bits satisfy the following:
[0213] in, This refers to extracting from the generator matrix G(r,m) of the RM(m,r) code. The indexed rows and The submatrix formed by the indexed columns. This refers to extracting from the generator matrix G(r,m) of the RM(m,r) code. The indexed rows and The submatrix formed by the indexed columns.
[0214] when hour, It is a square array.
[0215] formula Essentially, it contains two things:
[0216] 1) Filling bits u pad The calculation method is as follows:
[0217] 2) For u pad It can be calculated. The submatrix is invertible.
[0218] formula Limited as well as The selection.
[0219] Step 503: The first communication device sends a third bit sequence according to the second bit sequence.
[0220] The third bit sequence can be part or all of the second bit sequence.
[0221] For example, the third bit sequence can be the second bit sequence.
[0222] For example, the third bit sequence may not include one or more first bits from the second bit sequence. For instance, the third bit sequence may be some or all of the bits from the second bit sequence except for one or more first bits. After encoding, the values of one or more first bits in the second bit sequence are set to a first preset value. The second communication device knows the information of these bits, so these bits do not need to be transmitted; that is, when selecting bits from the second bit sequence to map to air interface resources, these bits can be skipped. This helps improve the utilization rate of air interface resources.
[0223] The following describes the rate matching method where the third bit sequence does not include one or more first bits from the second bit sequence.
[0224] Method A: Rate matching method for selecting bits in the second bit sequence based on a first index table. Specifically, the first communication device can transmit bits in the second bit sequence whose position index belongs to an index in the first index table, wherein the first index table does not include the position index of one or more first bits in the second bit sequence, or the first index table includes the position indexes of bits in the second bit sequence other than one or more first bits.
[0225] For example, the first communication device and the second communication device (the transmitting and receiving ends) maintain a transmission index table T1. T1 includes the indexes of the bits to be transmitted during the transmission process, but does not include the bits in the current scenario. The index in, that is, for any Optionally, the transmission index table T1 may contain repeated elements (i.e., indices). Optionally, the number of repetitions of an element may be greater than 2. Assuming the encoded second bit sequence is c, and the air interface resources support the transmission of d bits, then each time a bit with index T[i], i = 1, ..., d is selected from c to form the bit sequence to be transmitted.
[0226] Method B: Rate matching method with cyclic skipping. Specifically, the first communication device cyclically transmits bits in the second bit sequence and skips bits in the second bit sequence whose position index belongs to an index in a second index table, wherein the second index table includes one or more position indices of the first bit in the second bit sequence. For example, the second index table can be an index set.
[0227] For example, suppose the encoded second bit sequence is c, and the air interface resources support the transmission of d bits. As shown in Figure 7, the first communication device can start transmitting from the beginning of c, skipping each bit that is indexed to a bit with a first preset value. If the length of the bit sequence to be transmitted after indexing to the last bit of c is less than d, the first communication device can return to the beginning of c and continue indexing until a bit sequence of length d is formed.
[0228] For example, the pseudocode description of method B can be as follows:
[0229] Step 504: The second communication device acquires the first received sequence.
[0230] The first received sequence corresponds to the third bit sequence. It is understood that, due to the possibility of noise being introduced during signal transmission, the first received sequence received by the second communication device may differ from the third bit sequence sent by the first communication device.
[0231] For example, the first received sequence is a soft value sequence.
[0232] Step 505: The second communication device obtains the second receiving sequence to be decoded based on the first receiving sequence.
[0233] The second received sequence includes one or more third preset values; in other words, one or more positions in the second received sequence take the value of a third preset value. The second received sequence corresponds to the second bit sequence, and the number and position of one or more third preset values in the second received sequence are the same as the number and position of one or more first bits in the second bit sequence.
[0234] The third preset value is related to the first preset value. For example, the third preset value is ∞, and the sign is adjusted accordingly depending on the first preset value. For example, the first preset value is 1, and the third preset value is +∞. Or, for example, the first preset value is 0, and the third preset value is -∞.
[0235] For example, the second received sequence is a soft value sequence.
[0236] The process on the second communication device side is essentially the reverse of the process on the first communication device side. The process by which the second communication device obtains the second received sequence to be decoded based on the first received sequence is the reverse process of rate matching, that is, the process of de-rate matching.
[0237] The process of rate matching can be as follows: The second communication device first constructs a sequence buffer to be decoded, the length of which is the length of the second received sequence, and sets the position index to... The index position is filled with a third preset value, and then, based on the first received sequence, the values of the remaining positions in the sequence buffer to be decoded are constructed to obtain the second received sequence. For example, if RM code is used, the length of the sequence buffer to be decoded is 2m.
[0238] The method by which the second communication device performs rate matching corresponds to the method by which the first communication device performs rate matching.
[0239] When the first communication device uses mode A, the second communication device obtains a second received sequence to be decoded based on the first received sequence and the first index table. The first index table does not include one or more third preset values in the position index of the second received sequence. Values in the second received sequence at positions not indexed in the first index table are the third preset values. For example, the second communication device sequentially merges the values in the first received sequence with the values in the sequence buffer to be decoded at positions indexed in the first index table, and sets the values in the sequence buffer not indexed in the first index table to the third preset values. A description of the first index table can be found in step 503.
[0240] When the first communication device uses mode B, the second communication device obtains the second received sequence to be decoded based on the first received sequence and the second index table. The second index table includes one or more third preset values representing the positions in the second received sequence. The values in the second received sequence corresponding to the indexes in the second index table are the third preset values. For example, the second communication device sets the values in the sequence buffer that are indexed by the second index table to the third preset values. Then, starting from the head of the sequence buffer and the head of the first received sequence, it takes one value from the first received sequence each time and merges it with the corresponding value in the sequence buffer, skipping the positions in the sequence buffer that are indexed by the second index table. This process is repeated until the entire first received sequence has been processed. A description of the second index table can be found in step 503.
[0241] Step 506: The second communication device decodes the second received sequence according to the first matrix to obtain the decoded first bit sequence.
[0242] The process by which the second communication device decodes the second received sequence according to the first matrix is the reverse process of the first communication device encoding the first bit sequence according to the first matrix. The descriptions of the first matrix and the first bit sequence can be found above, and the relationship between the first matrix, the second received sequence, and the first bit sequence can be found in the relationship between the first matrix, the second bit sequence, and the first bit sequence.
[0243] The embodiments of this application do not limit the decoding algorithm used by the second communication device. For example, when the embodiments of this application are applied to RM codes, the decoding algorithm may be a Fast Hadamard Transform, Dumer decoding algorithm, Dumer recursive list decoding algorithm, RPA decoding algorithm, Sidel'nikov-Pershakov algorithm, Sakkour algorithm, maximum likelihood decoding, AED decoding algorithm, etc. As another example, when the embodiments of this application are applied to LDPC codes, the decoding algorithm may be a min-sum (MS) decoding algorithm, belief propagation (BP) decoding algorithm, etc.
[0244] Thus, based on method 500, some bits in the encoded bit sequence can be set to preset values (or fixed values). This is equivalent to the receiver knowing the values of these bits, thereby reducing the codeword space and thus lowering the decoding complexity. Furthermore, when this method is applied to RM codes, the second bit sequence remains an RM code. Since the automorphism group of the second bit sequence is consistent with that of the original RM code, the decoding performance remains unchanged. In other words, this method can reduce decoding complexity while maintaining decoding performance. In addition, method 500 can limit the values of padding bits in the bit sequence to be encoded, ensuring that one or more bits in the encoded bit sequence are set to preset values. Correspondingly, the received sequence to be decoded at the receiver also includes one or more preset values. This increases the number of permutation forms of the received sequence without adding unknown bits. Therefore, method 500 is more compatible with decoding algorithms that rely on permutations of the received sequence (such as AED-type decoding algorithms).
[0245] In other embodiments of this application, for different padding quantities, the corresponding padding bit position indices have a nested structure, and / or, the corresponding bit position indices with preset values have a nested structure. Using a nested structure helps reduce storage space usage. For example, when the padding quantity is K... pad,1 At that time, the position index of the corresponding padding bit and the position index of the corresponding bit with a preset value are respectively and When the fill quantity is K pad,2 At that time, the position index of the corresponding padding bit and the position index of the corresponding bit with a preset value are respectively and When K pad,1 >K pad,2 hour, and / or
[0246] In this case, method 500 may further include: the first communication device acquiring a fifth bit sequence to be encoded, the fifth bit sequence comprising K2 information bits and K... pad,2 A first communication device encodes the fifth bit sequence according to a second matrix to obtain an encoded sixth bit sequence, wherein one or more second bits of the sixth bit sequence are set to a second preset value; the first communication device transmits a seventh bit sequence according to the sixth bit sequence; the second communication device acquires a third received sequence; the second communication device obtains a fourth received sequence to be decoded according to the third received sequence, the fourth received sequence including one or more fourth preset values; the second communication device decodes the fourth received sequence according to the second matrix to obtain a decoded fifth bit sequence. Wherein, K pad,1 >K pad,2 K pad,1 The position index of the padding bits in the first bit sequence includes K. pad,2 The position index of the padding bit in the fifth bit sequence, and / or, the position index of one or more first bits in the second bit sequence includes the position index of one or more second bits in the sixth bit sequence. Exemplarily, each position index here may refer to an index sequence, an index set, etc. Detailed descriptions of the steps performed by the first communication device can be found in steps 501 to 503, and detailed descriptions of the steps performed by the second communication device can be found in steps 504 to 506.
[0247] The second preset value can be the same as or different from the first preset value. The third preset value can be the same as or different from the fourth preset value. The second matrix can be the same as or different from the first matrix.
[0248] The various embodiments, examples, and implementations of this application can be implemented independently or in combination, and are not limited thereto.
[0249] The method embodiments provided by this application have been described in detail above with reference to Figures 1 to 7. The device embodiments of this application will be described below with reference to Figures 8 to 12.
[0250] It is understood that, in order to achieve the functions in the above embodiments, the devices in Figures 8 to 12 include hardware structures and / or software modules corresponding to each function. These devices can be used to implement the functions of the first communication device or the second communication device in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. Those skilled in the art will readily recognize that, based on the units and method steps of the various examples described in conjunction with the embodiments disclosed in this application, this application can be implemented in hardware or a combination of hardware and computer software.
[0251] Figure 8 is a schematic diagram of a device provided in an embodiment of this application.
[0252] In this application embodiment, the first communication device or the second communication device can be divided into functional units according to the above method example. For example, each function can be divided into different functional units, or two or more functions can be integrated into one unit. Each function can be implemented in hardware or in the form of software functional modules. The division shown in Figure 8 is illustrative and is only one logical functional division. In actual implementation, there may be other division methods.
[0253] As shown in Figure 8, the device 10 includes a transceiver unit 11 and a processing unit 12.
[0254] When device 10 is used to implement the function of the first communication device in the above method embodiments, transceiver unit 11 is used to execute the transceiver steps of the first communication device, such as step 503, and processing unit 12 is used to execute the processing steps of the first communication device, such as steps 501 and 502. When device 10 is used to implement the function of the second communication device in the above method embodiments, transceiver unit 11 is used to execute the transceiver steps of the second communication device, such as steps 503 or 504, and processing unit 12 is used to execute the processing steps of the second communication device, such as steps 505 and 506.
[0255] Optionally, the device 10 also includes a storage unit 13 for storing instructions and / or data.
[0256] When the first communication device or the second communication device does not perform the transmitting and receiving steps or the processing steps, the device 10 may also not include the transmitting and receiving unit 11 or the processing unit 12.
[0257] For a more detailed description of the transceiver unit 11 and the processing unit 12 described above, please refer to the relevant descriptions in the above method embodiments, which will not be repeated here. Figure 9 is another structural schematic diagram of the device provided in an embodiment of this application.
[0258] The device 20 includes a processing circuit 21. The processing circuit 21 is coupled to a memory 23, which stores instructions. When the device 20 is used to implement the method described above, the processing circuit 21 executes the instructions in the memory 23 to implement the function of the processing unit 12 described above.
[0259] Optionally, the device 20 further includes a memory 23 for implementing the functions of the aforementioned memory unit 13.
[0260] Optionally, the device 20 further includes a transceiver circuit 22. The transceiver circuit can be referred to as a communication interface. The processing circuit 21 and the transceiver circuit 22 are coupled to each other. It is understood that the transceiver circuit 22 can be a transceiver or an input / output interface. When the device 20 is used to implement the method described above, the processing circuit 21 executes instructions to implement the function of the processing unit 12, and the transceiver circuit 22 implements the function of the transceiver unit 11.
[0261] Optionally, device 20 can be a first communication device or a second communication device, and correspondingly, the transceiver circuit can be a transceiver.
[0262] Optionally, device 20 can be a chip used in the first communication device or the second communication device, and correspondingly, the transceiver circuit can be an input / output interface.
[0263] For example, when device 20 is a chip applied to a first communication device or a second communication device, the chip implements the functions of the first communication device or the second communication device in the above method embodiments. The chip receives information from other modules (such as radio frequency modules or antennas) in the first communication device or the second communication device, which is sent to the first communication device or the second communication device by other devices; or, the chip sends information to other modules (such as radio frequency modules or antennas) in the first communication device or the second communication device, which is sent to other devices by the first communication device or the second communication device.
[0264] Figure 10 is a schematic architecture diagram of an encoder chip applicable to embodiments of this application.
[0265] The encoder chip architecture, as shown in Figure 10, consists of three main components: a computing unit, a control unit, and a storage unit. These three components are coupled together. The computing unit is responsible for processing the encoder's logical operations, the storage unit is responsible for storing the data generated during the computing process, and the control unit is responsible for scheduling and controlling the computing unit and storage resources. The encoder chip can perform corresponding encoding according to the method provided in the embodiments of this application.
[0266] Taking RM encoding as an example, the computing unit of the encoder chip may include a padding module, an RM encoding module, and a rate matching module.
[0267] The filling module is used to perform the filling operation in the method embodiment, such as step 501. Exemplarily, the filling module reads from the storage unit... After reading the parameters f and the generator matrix G(r,m), the input information bit sequence is padded according to the method described in method 500 to obtain the padded first bit sequence to be encoded.
[0268] The RM encoding module is used to perform the encoding operation in the method embodiment, such as step 502. Exemplarily, the RM encoding module reads the generator matrix G(r,m) from the storage unit and performs RM encoding on the first bit sequence to be encoded input from the padding module to obtain the encoded second bit sequence. One or more of the first bits in the second bit sequence take the value of a first preset value.
[0269] The rate matching module is used to perform the rate matching operation in the method embodiment, such as the rate matching operation in step 503. For example, the rate matching module reads a first index table or a second index table from the storage unit, and then selects bits based on the first index table or the second index table to form a third bit sequence to be transmitted.
[0270] The padding module is optional; for example, it can be integrated into the RM encoding module.
[0271] For a more detailed description of the operations performed by each module, please refer to the relevant descriptions in the above method embodiments, which will not be repeated here.
[0272] Figure 11 is a schematic architecture diagram of a decoder chip applicable to embodiments of this application.
[0273] The decoder chip architecture, as shown in Figure 11, consists of three main components: a computing unit, a control unit, and a storage unit. These three components are coupled together. The computing unit is responsible for handling the decoder's logical operations, the storage unit is responsible for storing data generated during the computation process, and the control unit is responsible for scheduling and controlling the computing unit and storage resources. The decoder chip can perform corresponding decoding according to the method provided in the embodiments of this application.
[0274] Taking RM decoding as an example, the computing unit of the encoder chip may include a rate matching module and an RM decoding module.
[0275] The rate matching module is used to perform the rate matching operation in the method embodiment, such as the rate matching operation in step 505. Exemplarily, the rate matching module reads f and the first index table from the storage unit, and then constructs the second receive sequence to be decoded based on f and the first index table. Exemplarily, the rate matching module reads f and the second index table from the storage unit, and then constructs the second receive sequence to be decoded based on f and the second index table.
[0276] The RM decoding module is used to perform the decoding operation in the method embodiment, such as step 506. Exemplarily, the RM encoding module decodes the second received sequence to be decoded output by the de-rate matching module to obtain the decoded first bit sequence.
[0277] For a more detailed description of the operations performed by each module, please refer to the relevant descriptions in the above method embodiments, which will not be repeated here.
[0278] The encoders and / or decoders in Figures 10 and 11 can be implemented in hardware or software. When high throughput is required, a hardware accelerator (HAC) can be used.
[0279] Figure 12 is a schematic diagram of a chip system provided in an embodiment of this application. The chip system 30 (or may also be called a processing system) includes logic circuitry 31 and an input / output interface 32.
[0280] The logic circuit 31 can be a processing circuit in the chip system 30. The logic circuit 31 can be coupled to a memory unit, calling instructions from the memory unit, enabling the chip system 30 to implement the methods and functions of the embodiments of this application. The input / output interface 32 can be an input / output circuit in the chip system 30, outputting processed information from the chip system 30, or inputting data or signaling information to be processed into the chip system 30 for processing.
[0281] As an alternative, the chip system 30 may also include a memory unit.
[0282] As one option, the chip system 30 is used to implement the operations performed by the first communication device or the second communication device in the various method embodiments described above.
[0283] For example, logic circuit 31 is used to implement processing-related operations performed by the first communication device or the second communication device in the above method embodiments; input / output interface 32 is used to implement sending and / or receiving-related operations performed by the first communication device or the second communication device in the above method embodiments.
[0284] This application also provides a communication device including a processing circuit coupled to a memory for storing computer programs or instructions and / or data. The processing circuit is used to execute the computer programs or instructions stored in the memory, or to read the data stored in the memory, to perform the methods in the above-described method embodiments. Optionally, the processing circuit may be one or more. Optionally, the communication device includes a memory. Optionally, the memory may be one or more. Optionally, the memory may be integrated with the processing circuit, or may be separately disposed.
[0285] This application also provides a chip including a processing circuit coupled to a memory. The memory stores computer programs or instructions, and the processing circuit executes the computer programs or instructions stored in the memory to implement the methods executed by the first or second communication device in the above-described method embodiments. The memory may be located within the chip or independently of the chip, and is not limited thereto.
[0286] This application also provides a computer-readable storage medium having stored thereon computer instructions for implementing the methods executed by the first communication device or the second communication device in the above-described method embodiments.
[0287] This application also provides a computer program product comprising instructions that, when executed by a computer, implement the methods performed by the first communication device or the second communication device in the above-described method embodiments.
[0288] This application also provides a computer program that, when executed by a computer, implements the methods performed by the first communication device or the second communication device in the above-described method embodiments.
[0289] This application also provides a communication system, which includes at least one of the first communication device or the second communication device in the above embodiments.
[0290] The explanations and beneficial effects of the relevant contents in any of the devices provided above can be found in the corresponding method embodiments provided above, and will not be repeated here.
[0291] It is understood that the processing circuit in the embodiments of this application may be a processor or a circuit in a processor for performing processing operations. The processor may include one or more of the following: a central processing unit (CPU), a digital signal processor (DSP), a microprocessor unit (MPU), a microcontroller unit (MCU), a graphics processing unit (GPU), a field programmable gate array (FPGA), an artificial intelligence processor (AI processor), or a neural processing unit (NPU).
[0292] The aforementioned memory may include one or more of the following storage media: random access memory (RAM), static random access memory (SRAM), dynamic random access memory (DRAM), phase-change memory (PCM), resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), cache, register, read-only memory (ROM), flash memory, erasable programmable read-only memory (EPROM), hard disk, etc. In one example, computer program instructions for executing the above embodiments may be stored in non-volatile memory, such as the aforementioned memory 23 or at least a portion of the storage cells (e.g., one or more of ROM, flash memory, EPROM, or hard disk).
[0293] The method steps in the embodiments of this application can be implemented in hardware or by a processor executing software instructions. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, compact disc read-only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an application-specific integrated circuit (ASIC). Furthermore, the ASIC can reside in a first communication device or a second communication device. Alternatively, the processor and storage medium can exist as discrete components in the first or second communication device.
[0294] In the above embodiments, implementation can be achieved 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 programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed entirely or partially. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user equipment, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium 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 medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive.
[0295] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of different embodiments are consistent and can be referenced by each other. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship.
[0296] Unless otherwise stated, all technical and scientific terms used in the embodiments of this application have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used in this application is for the purpose of describing specific embodiments and is not intended to limit the scope of this application. The above examples are merely illustrative and are intended to help those skilled in the art understand the embodiments of this application, and are not intended to limit the embodiments to the specific numerical values or scenarios exemplified. Those skilled in the art can obviously make various equivalent modifications or variations based on the examples given above, and such modifications and variations also fall within the scope of the embodiments of this application.
Claims
1. A communication method, characterized in that, The method includes: Obtain the first bit sequence to be encoded; The first bit sequence is encoded according to the first matrix to obtain the encoded second bit sequence, wherein one or more of the first bits of the second bit sequence are valued at a first preset value. Based on the second bit sequence, the third bit sequence is sent.
2. The method according to claim 1, characterized in that, The position of one or more first bits in the second bit sequence is a preset position.
3. The method according to claim 1 or 2, characterized in that, The first bit sequence includes information bits and padding bits, and the value of the padding bits is related to the following information: The position index of one or more first bits in the second bit sequence, the number of one or more first bits, and the first preset value.
4. The method according to claim 3, characterized in that, The value of the padding bits is also related to the following information: The values of the information bits, the first information, and the second information; The first information includes the number of padding bits and / or the number of information bits, and the second information includes the position index of the padding bits in the first bit sequence and / or the position index of the information bits in the first bit sequence.
5. The method according to claim 4, characterized in that, The value of the padding bits is also related to the generating matrix.
6. The method according to claim 5, characterized in that, The values of the padding bits satisfy the following: Among them, u pad Let u be the padding bit and u be the information bit. The index of the position of the padding bit in the first bit sequence. This is the index of the position of the information bit in the first bit sequence. The position index of the one or more first bits in the second bit sequence. For the generating matrix OK, List, For the generating matrix OK, List, For a length of K pad,1 A sequence of elements f, K pad,1 The number of padding bits in the first bit sequence is denoted by f, and f is the first preset value.
7. The method according to claim 5 or 6, characterized in that, The generator matrix is the generator matrix of the Reid-Muller RM code.
8. The method according to any one of claims 3 to 7, characterized in that, The first bit sequence is obtained based on the position index of the information bit in the first bit sequence and / or the position index of the padding bit in the first bit sequence.
9. The method according to any one of claims 3 to 7, characterized in that, The process of obtaining the first bit sequence to be encoded includes: Obtain the fourth bit sequence; interleave the fourth bit sequence to obtain the first bit sequence; wherein, the fourth bit sequence (u, u) pad )satisfy: Among them, u pad Let u be the padding bit and u be the information bit, and G1 satisfy... b1 satisfies I is the identity matrix. The index of the position of the padding bit in the first bit sequence. This is the index of the position of the information bit in the first bit sequence. The position index of the one or more first bits in the second bit sequence. For generating matrices OK, List, For the generating matrix OK, List, For a length of K pad,1 A sequence of elements f, where f is the first preset value, and K pad,1 The number of padding bits in the first bit sequence; or, Obtain the first bit sequence, the first bit sequence satisfy: Where ∏ is (K1+K pad,1 )×(K1+K pad,1 The matrix is K1, where K is the number of information bits in the first bit sequence. pad,1 The number of padding bits in the first bit sequence, where each row of ∏ includes one 1 and K1+K. pad,1 -1 zero, each column includes one 1 and K1+K pad,1 -1 zeros, the index in ∏ is The indexed column 1 is located at the last K of ∏. pad,1 In the row, the index of ∏ is The index of column 1 in ∏ is located in the first K1 rows, (u,u pad )satisfy: Among them, u pad Let u be the padding bit and u be the information bit, and G1 satisfy... b1 satisfies I is the identity matrix. The index of the position of the padding bit in the first bit sequence. This is the index of the position of the information bit in the first bit sequence. The position index of the one or more first bits in the second bit sequence. For generating matrices OK, List, For the generating matrix OK, List, For a length of K pad,1 A sequence of elements f, where f is the first preset value.
10. The method according to any one of claims 1 to 9, characterized in that, The first bit sequence includes K1 information bits and K pad,1 One padding bit; The method further includes: Obtain the fifth bit sequence to be encoded, the fifth bit sequence comprising K2 information bits and K... pad,2 One padding bit; The fifth bit sequence is encoded according to the second matrix to obtain the encoded sixth bit sequence, wherein one or more second bits of the sixth bit sequence are taken as a second preset value; Based on the sixth bit sequence, the seventh bit sequence is sent; Among them, K pad,1 >K pad,2 The K pad,1 The position index of the padding bits in the first bit sequence includes the K pad,2 The position index of the padding bit in the fifth bit sequence, and / or, the position index of the one or more first bits in the second bit sequence includes the position index of the one or more second bits in the sixth bit sequence.
11. The method according to any one of claims 1 to 10, characterized in that, The third bit sequence does not include the one or more first bits.
12. The method according to claim 11, characterized in that, The step of sending the third bit sequence according to the second bit sequence includes: Send the bit in the second bit sequence whose position index is an index in the first index table, wherein the first index table does not include the position index of the one or more first bits in the second bit sequence.
13. The method according to claim 11, characterized in that, The step of sending the third bit sequence according to the second bit sequence includes: The bits in the second bit sequence are sent cyclically, and bits whose position index in the second bit sequence is an index in a second index table are skipped. The second index table includes the position index of the one or more first bits in the second bit sequence.
14. A communication method, characterized in that, The method includes: Obtain the first received sequence; Based on the first received sequence, a second received sequence to be decoded is obtained, wherein the second received sequence includes one or more third preset values; The second received sequence is decoded according to the first matrix to obtain the decoded first bit sequence.
15. The method according to claim 14, characterized in that, The position of the one or more third preset values in the second receiving sequence is a preset position.
16. The method according to claim 14 or 15, characterized in that, The first bit sequence includes information bits and padding bits, and the value of the padding bits is related to the following information: The position index of one or more first bits in the second received sequence, the number of one or more first bits, and a first preset value, the first preset value being related to the third preset value.
17. The method according to claim 16, characterized in that, The value of the padding bits is also related to the following information: The values of the information bits, the first information, and the second information; The first information includes the number of padding bits and / or the number of information bits, and the second information includes the position index of the padding bits in the first bit sequence and / or the position index of the information bits in the first bit sequence.
18. The method according to claim 17, characterized in that, The value of the padding bits is also related to the generating matrix.
19. The method according to claim 18, characterized in that, The values of the padding bits satisfy the following: Among them, u pad Let u be the padding bit and u be the information bit. The index of the position of the padding bit in the first bit sequence. This is the index of the position of the information bit in the first bit sequence. The position index of the one or more third preset values in the second received sequence. For the generating matrix OK, List, For the generating matrix OK, List, For a length of K pad,1 A sequence of elements f, K pad,1 The number of padding bits in the first bit sequence is denoted by f, and f is the first preset value.
20. The method according to claim 18 or 19, characterized in that, The generator matrix is the generator matrix of the Reid-Muller RM code.
21. The method according to any one of claims 14 to 20, characterized in that, The first bit sequence includes K1 information bits and K pad,1 One padding bit; The method further includes: Obtain the third received sequence; Based on the third received sequence, a fourth received sequence to be decoded is obtained, wherein the fourth received sequence includes one or more fourth preset values; The fourth received sequence is decoded according to the second matrix to obtain the decoded fifth bit sequence, which includes K2 information bits and K... pad,2 One padding bit; Among them, K pad,1 >K pad,2 The K pad,1 The position index of the padding bits in the first bit sequence includes the K pad,2 The position index of the padding bit in the fifth bit sequence, and / or, the position index of the one or more third preset values in the second received sequence includes the position index of the one or more fourth preset values in the fourth received sequence.
22. The method according to any one of claims 14 to 21, characterized in that, The step of obtaining the second received sequence to be decoded based on the first received sequence includes: Based on the first received sequence and the first index table, a second received sequence to be decoded is obtained. The first index table does not include the position index of the one or more third preset values in the second received sequence. The value of the position in the second received sequence that does not belong to the index in the first index table is the third preset value.
23. The method according to any one of claims 14 to 21, characterized in that, The step of obtaining the second received sequence to be decoded based on the first received sequence includes: Based on the first received sequence and the second index table, a second received sequence to be decoded is obtained. The second index table includes the position index of one or more third preset values in the second received sequence, and the value of the position in the second received sequence that belongs to the index in the second index table is the third preset value.
24. A communication device, characterized in that, Includes modules or units for performing the method as described in any one of claims 1 to 23.
25. A communication device, characterized in that, Includes at least one processor; The at least one processor is configured to implement the method as described in any one of claims 1 to 23 by means of logic circuits and / or by executing computer programs, code, or instructions.
26. The communication device according to claim 25, characterized in that, The communication device further includes an interface circuit for receiving signals and transmitting them to the processor or outputting signals from the at least one processor.
27. The communication device according to claim 25 or 26, characterized in that, The communication device further includes a memory for storing the computer program, the code, or the instructions.
28. A computer-readable storage medium, characterized in that, The storage medium stores computer programs, code, or instructions, which, when executed by a communication device, implement the method as described in any one of claims 1 to 23.
29. A computer program product, characterized in that, It includes a computer program, code, or instructions that, when the computer program, the code, or the instructions are executed, implement the method as described in any one of claims 1 to 23.
