WO2026040904A1 - Procédé de communication basé sur un code polaire et appareil de communication - Google Patents

Procédé de communication basé sur un code polaire et appareil de communication

Info

Publication number
WO2026040904A1
WO2026040904A1 PCT/CN2025/114766 CN2025114766W WO2026040904A1 WO 2026040904 A1 WO2026040904 A1 WO 2026040904A1 CN 2025114766 W CN2025114766 W CN 2025114766W WO 2026040904 A1 WO2026040904 A1 WO 2026040904A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
number set
sequence number
bits
numbers
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
PCT/CN2025/114766
Other languages
English (en)
Chinese (zh)
Inventor
李源
童佳杰
张华滋
王献斌
秦康剑
刘可
王俊
沈祖康
童文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from CN202510653910.8A external-priority patent/CN121603157A/zh
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of WO2026040904A1 publication Critical patent/WO2026040904A1/fr
Pending legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received

Definitions

  • This application relates to the field of coding, and more specifically, to a communication method and communication device based on polar codes.
  • PC-Polar code parity check polar code
  • the mother code length of the PC-Polar code is N (where N is an integer power of 2), meaning the length of the bit sequence to be encoded is N, and the bit sequence includes K information bits and nPC PC bits.
  • the bits in the N bits of the bit sequence to be encoded that require rate matching need to be pre-frozen. Then, the K′ bits with the highest reliability from the remaining bits are selected to carry the K information bits and nPC PC bits.
  • rate-matching bits will cause the order of sub-channel reliability corresponding to the remaining bits to change compared with the reliability order under the mother code length.
  • the reliability of one or more of the K′ bits selected from the remaining bits may decrease, resulting in the selected K′ bits not being the K′ bits with the highest reliability under rate matching.
  • the performance of the constructed Polar code cannot reach the optimal performance, affecting the communication performance.
  • the embodiments of this application provide a communication method and communication device based on polar codes, which can improve communication quality.
  • a communication method is provided, which can be executed by a transmitting device.
  • the term "transmitting device” in this application can refer to the transmitting device itself (e.g., a network device, a terminal device), a component in the transmitting device (e.g., a processor, a chip, or a chip system), or a logic module or software that can implement all or part of the functions of the transmitting device.
  • the second sequence number set indicates the sequence numbers among the N polarization channels that need to be pre-frozen
  • the second candidate sequence number set indicates (K′-T) sequence numbers among the remaining sequence numbers of the N polarization channels excluding the second sequence number set and the first candidate sequence number set.
  • the (K′-T) bits corresponding to the (K′-T) sequence numbers in the bit sequence to be encoded are used to carry K information bits and the remaining (K′-T) bits among n PC PC bits excluding T bits.
  • the bit sequence to be encoded is determined based on the first candidate sequence number set and the second candidate sequence number set.
  • the bit sequence to be encoded is then polar-coded to obtain a codeword sequence.
  • bit A is used to carry bit A, which can be understood as bit A can be placed in the bit.
  • the second sequence number set in this application includes the first sequence number set and the third sequence number set.
  • the reliability decrease of the polarization channel corresponding to the sequence number indicated by the third sequence number set is greater than the reliability decrease of the polarization channel corresponding to the sequence number indicated by the fourth sequence number set.
  • the fourth sequence number set includes the remaining sequence numbers in the first reliability sequence excluding the third sequence number set.
  • T bits are selected in the first stage, and the remaining (K′-T) bits are selected in the second stage.
  • K′ bits i.e., information bits and check bits
  • K′ bits are determined to carry K information bits and n PC PC bits.
  • the bits corresponding to a relatively small set of sequence numbers can be pre-frozen in the first stage (e.g., the first set of sequence numbers includes the sequence numbers of the polarization channels corresponding to the rate-matching bits).
  • T bits are then determined based on the remaining sequence numbers in the first reliability sequence excluding the first set of sequence numbers, ensuring that the T bits determined by this scheme are consistent with the K′ bits determined for rate matching schemes in the background art. The most reliable T bits are closer to the data.
  • the bits corresponding to the second set of sequence numbers which has a relatively large number of sequence numbers, can be pre-frozen in the second stage (i.e., freezing the bits corresponding to the third set of sequence numbers after freezing the bits of the first set of sequence numbers).
  • the remaining (K′-T) bits are determined based on the remaining sequence numbers in the first reliability sequence excluding the second and first candidate sequence numbers.
  • a communication method is provided, which can be executed by a receiving device.
  • the term "receiving device” in this application can refer to the receiving device itself (e.g., a network device, a terminal device), a component in the receiving device (e.g., a processor, a chip, or a chip system), or a logic module or software that can implement all or part of the functions of the receiving device.
  • the second sequence number set indicates the sequence numbers among the N polarization channels that need to be pre-frozen.
  • the second sequence number set includes the first sequence number set and the third sequence number set.
  • the reliability decrease of the polarization channel corresponding to the sequence number indicated by the third sequence number set is greater than the reliability decrease of the polarization channel corresponding to the sequence number indicated by the fourth sequence number set.
  • the fourth sequence number set includes the remaining sequence numbers in the first reliability sequence excluding the third sequence number set.
  • the second candidate sequence number set indicates (K′-T) sequence numbers among the remaining sequence numbers in the N polarization channels excluding the second and first candidate sequence number sets.
  • the (K′-T) bits corresponding to the (K′-T) sequence numbers in the first bit sequence are used to carry K information bits and the remaining (K′-T) bits among n PC PC bits excluding T bits.
  • the received value sequence is then polar-coded according to the first and second candidate sequence number sets to obtain the first bit sequence.
  • the first sequence set is a rate-matching sequence set, which indicates bits used to indicate punching or shortening.
  • the second sequence set is the first of the rate-matching sequence set and the natural order sequence set.
  • E ⁇ 3 * N / 4 the second sequence set is the union of the first N/2 elements in the rate matching sequence set and the natural order sequence set.
  • the above technical solution is applicable to rate matching schemes that include sub-block interleaving and bit selection mode puncturing.
  • E ⁇ 3*N/4
  • the number of puncturing bits is relatively large.
  • the pre-freeze sequence number can be increased, that is, the pre-freeze bits in N bits can be increased, which can help select more reliable positions as information bits and parity bits, thereby improving the performance of polar codes.
  • T can be configured as a positive integer close to K'.
  • the first sequence number set includes a rate-matching sequence number set, which indicates bits used to indicate punching or shortening.
  • the second sequence set is determined based on a series of consecutive elements in the natural sequence set and the first sequence set, wherein the natural sequence set includes N distinct integers from 0 to N-1, and the N integers are sorted in ascending order.
  • the first sequence set is the first of the rate-matching sequence set and the natural order sequence set.
  • the union of n elements where the set of natural ordinal numbers consists of N distinct integers from 0 to N-1, and these N integers are sorted in ascending order; E is the length of the rate-matched codeword sequence, where E is a positive integer and 0 ⁇ E ⁇ N. This indicates rounding up.
  • the above technical solution is applicable to rate matching schemes that do not include sub-block interleaving and whose bit selection mode is puncturing.
  • the advantage of determining the first sequence number set is that: since puncturing causes the reliability of polarization channels with sequence numbers close to the punctured bit positions to decrease, it is necessary to pre-freeze polarization channels with smaller sequence numbers. Furthermore, when the code length is large, more pre-frozen bits can be set to improve performance.
  • the first sequence set is the first of the rate-matching sequence set and the natural order sequence set.
  • the union of n elements where the set of natural ordinal numbers consists of N distinct integers from 0 to N-1, and these N integers are sorted in ascending order; E is the length of the rate-matched codeword sequence, where E is a positive integer and 0 ⁇ E ⁇ N. This indicates rounding up.
  • N > 256 the first sequence set is the first set of the rate matching set and the natural order sequence set. The union of n elements.
  • the above technical solution is applicable to rate matching schemes that do not include sub-block interleaving and whose bit selection mode is puncturing.
  • the first set of indices is the set of rate matching indices; if E ⁇ 128, the first set of indices is the union of the set of rate matching indices, N/4, and N/2.
  • the above technical solution is applicable to rate matching schemes that do not include sub-block interleaving and whose bit selection mode is shortened.
  • the advantage of determining the pre-frozen sequence number set is that, under high code rate and long code, the N/4 and N/2 line weights are small, and the reliability drops significantly after rate matching, so they should be used as pre-frozen bits.
  • the first set of sequence numbers is the set of rate matching sequence numbers; if E > 128, the first set of sequence numbers is the union of the set of rate matching sequence numbers, N/4, and N/2.
  • the above technical solution is applicable to rate matching schemes that do not include sub-block interleaving and whose bit selection mode is shortened.
  • the advantage of determining the pre-frozen sequence number set is that when E>128 and is not the mother code length, the N/4 and N/2 line weights are small, and the reliability drops significantly after rate matching, so they should be used as pre-frozen bits.
  • the second set of ordinal numbers is the union of the first set of ordinal numbers and the first N/2 elements of the natural ordinal number set.
  • the above technical solution is applicable to rate matching schemes that do not include sub-block interleaving and whose bit selection mode is puncturing or shortening.
  • the advantage of determining the second sequence number set is that, since rate matching reduces the reliability of polarization channels with sequence numbers less than N/2, the N/2 elements before pre-freezing can select polarization channels with sequence numbers not less than N/2 as information bits and check bits, thereby improving decoding performance.
  • T is associated with one or more of K′, K, E, or N, where E is the length of the rate-matched codeword sequence, E is a positive integer, and 0 ⁇ E ⁇ N.
  • the above scheme allows for flexible configuration of the size of T, which helps in selecting reliable bits as information bits and check bits, thereby improving encoding and decoding performance and ultimately enhancing communication performance.
  • rate matching that includes sub-block interleaving has a smaller impact on reliability, and the difference between T and K′ can be smaller.
  • Rate matching that does not include sub-block interleaving i.e., natural order rate matching
  • rate matching that does not include sub-block interleaving has a larger impact on reliability, and the difference between T and K′ can be larger.
  • the above technical solution is applicable to rate matching schemes that do not include sub-block interleaving and whose bit selection mode is puncturing.
  • the advantage of determining the number of first candidate sequence number sets T is that when E/N is small, there are more puncturing bits, and the reliability sequence under sequential puncturing is greatly affected by reliability. Therefore, T is set to a small value.
  • T K′; otherwise, T is determined based on E/N.
  • the first threshold is 3/4.
  • the above technical solution is applicable to rate matching schemes that do not include sub-block interleaving and whose bit selection mode is shortened.
  • T is determined based on E/N, including: if E/N ⁇ 9/16, If E/N ⁇ 9/16 in, This indicates rounding up to the nearest integer.
  • T is determined based on E/N, including: if E/N ⁇ 9/16, If E/N ⁇ 9/16 in, This indicates rounding up to the nearest integer.
  • the T indices are the indices of the T most reliable polarization channels in the second reliability sequence, and the second reliability sequence includes all the indices remaining in the first reliability sequence except for the first indices set.
  • the (K′-T) indices are the indices of the most reliable (K′-T) polarization channels in the third reliability sequence, excluding the first candidate indices set.
  • the third reliability sequence includes all remaining indices in the first reliability sequence, excluding the second indices set.
  • a communication apparatus for performing the method provided by any of the above aspects or their implementations.
  • the apparatus may include units and/or modules for performing the method provided by any of the above aspects or their implementations, such as processing units and/or transceiver units.
  • the device is either a transmitting device or a receiving device.
  • the transceiver unit can be a transceiver, an input/output interface, or a communication interface; the processing unit can be at least one processor.
  • the transceiver is a transceiver circuit.
  • the input/output interface is an input/output circuit.
  • the device is a chip, chip system, or circuit used in a transmitting or receiving device.
  • the transceiver unit can be an input/output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip, chip system, or circuit;
  • the processing unit can be at least one processor, processing circuit, or logic circuit.
  • a communication device comprising: a memory for storing a program; and at least one processor for executing the computer program or instructions stored in the memory to perform the method provided in any of the foregoing aspects or their implementations.
  • the device is either a transmitting device or a receiving device.
  • the device is a chip, chip system, or circuit used in a transmitting or receiving device.
  • a communication device comprising: at least one processor and a communication interface, wherein the at least one processor is configured to obtain a computer program or instructions stored in a memory via the communication interface to execute the method provided in any of the foregoing aspects or their implementations.
  • the communication interface may be implemented in hardware or software.
  • the device further includes the memory.
  • a processor is provided for executing the methods provided in the above aspects.
  • the transmission and acquisition/reception operations involved in the processor can be understood as processor output and reception, input and other operations, or as transmission and reception operations performed by radio frequency circuits and antennas. This application does not limit them in this regard.
  • a computer-readable storage medium that stores program code for execution by a device, the program code including methods for performing any of the foregoing aspects or their implementations.
  • a chip comprising a processor and a communication interface.
  • the processor reads instructions stored in a memory through the communication interface and executes the methods provided in any of the above aspects or their implementations.
  • the communication interface can be implemented in hardware or software.
  • the chip also includes a memory that stores computer programs or instructions.
  • the processor is used to execute the computer programs or instructions stored in the memory.
  • the processor is used to perform the methods provided by any of the above aspects or their implementations.
  • this application does not limit the specific number of chips implementing the method. For example, it can be executed by one chip, or by two or more chips. Furthermore, when the number of chips implementing the method is two or more, the chip manufacturers are not limited; they can be from the same manufacturer or different manufacturers.
  • a communication system comprising at least one of the transmitting end device or receiving end device described above.
  • Figure 1 is a schematic diagram of the network architecture applicable to an embodiment of this application.
  • Figure 2 is a schematic diagram of the information transmission process.
  • Figure 3 is a schematic diagram of an 8 ⁇ 8 Polar code encoding.
  • Figure 4 is a schematic diagram of SC decoding.
  • Figures 5 to 8 are schematic flowcharts of a polar code-based encoding method.
  • Figure 9 is a schematic flowchart of a decoding method based on polar codes.
  • Figures 10 and 11 are schematic block diagrams of a communication device provided in an embodiment of this application.
  • the terms “for indicating” or “instruction” can include both direct and indirect indication, or in other words, “for indicating” or “instruction” 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.
  • the term “protocol” may refer to standard protocols in the field of communications, 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.
  • LTE Long Term Evolution
  • NR New Radio
  • the words “exemplary,” “for example,” “exemplarily,” “as another example,” etc. are used to indicate that something is an example, illustration, or description.
  • At least one of the following or similar expressions refer to any combination of these items, including any combination of single or plural items.
  • 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.
  • a, b, and c can be single or multiple.
  • 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.
  • the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.
  • the embodiments of this application can be applied to various communication systems, including but not limited to: 5th generation (5G) systems, LTE systems, long-term evolution-advanced (LTE-A) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, and future communication systems. Furthermore, they can also be applied to device-to-device (D2D) communication, vehicle-to-everything (V2X) 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. Furthermore, it can be extended to similar wireless communication systems, such as Wireless-Fidelity (WiFi), Worldwide Interoperability for Microwave Access (WIMAX), and communication systems related to the 3rd Generation Partnership Project (3GPP), without limitation.
  • 5G 5th generation
  • LTE-A long-term evolution-advanced
  • FDD frequency division duplex
  • the communication system applicable to embodiments of this application may include one or more transmitting devices and one or more receiving devices.
  • one of the transmitting device and the receiving device may be a terminal device, and the other may be a network device.
  • both the transmitting device and the receiving device may be terminal devices.
  • both the transmitting device and the receiving device may be network devices.
  • Figure 1 is a schematic diagram of a network architecture applicable to an embodiment of this application. As shown in Figure 1, the embodiments of this application can be applied to both uplink and downlink data transmission. Figure 1 only uses uplink or downlink data transmission between one network device and two terminal devices (such as terminal device 1 and terminal device 2) as an example. In uplink data transmission, the sending device is the terminal device and the receiving device is the network device; conversely, in downlink data transmission, the sending device is the network device and the receiving device is the terminal device. Furthermore, the applicability of the embodiments of this application in other communication scenarios is not limited; for example, they can also be applied to sidelink communication.
  • the terminal device in this application can also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, drone, wireless communication device, user agent, or user device, etc.
  • UE user equipment
  • MT mobile station
  • remote station remote terminal
  • mobile device user terminal
  • terminal drone
  • wireless communication device user agent, or user device, etc.
  • the terminal device in the embodiments of this application can be a device that provides voice and/or data connectivity to a user, and can be used to connect people, objects, and machines, such as a handheld device with wireless connectivity, vehicle-mounted device, etc.
  • the terminal devices in the embodiments of this application may be mobile phones, tablets, laptops, handheld computers, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, etc.
  • MIDs mobile internet devices
  • VR virtual reality
  • AR augmented reality
  • the network equipment in this application can be a device with wireless transceiver capabilities, which can be a device that provides wireless communication services. It is usually located on the network side, including but not limited to next-generation base stations (gNodeB, gNB) in 5G systems, base stations in sixth-generation mobile communication systems, base stations in future mobile communication systems, or access nodes in wireless fidelity (WiFi) systems, evolved node B (eNB), radio network controller (RNC), node B (NB), base station controller (BSC), home base station (e.g., home evolved NodeB or home Node B, HNB), base band unit (BBU), transmission reception point (TRP), transmitting point (TP), base transceiver station (BTS), satellites, drones, etc.
  • gNodeB next-generation base stations
  • gNodeB next-generation base stations
  • gNodeB next-generation base stations
  • gNodeB next-generation base stations
  • gNodeB next-generation base stations
  • gNodeB
  • network equipment may include centralized unit (CU) nodes, distributed unit (DU) nodes, RAN equipment including CU and DU nodes, RAN equipment including control plane CU nodes, user plane CU nodes, and DU nodes, or, in a cloud radio access network (CRAN) scenario, wireless controllers, relay stations, vehicle-mounted equipment, and wearable devices.
  • CU centralized unit
  • DU distributed unit
  • CRAN cloud radio access network
  • a base station may be a macro base station, micro base station, relay node, donor node, or a combination thereof.
  • a base station may also refer to a communication module, modem, or chip installed within the aforementioned equipment or apparatus.
  • a base station may also be a mobile switching center and equipment performing base station functions in D2D, V2X, and M2M communications, network-side equipment in future communication networks, or equipment performing base station functions in future communication systems.
  • a base station may support networks with the same or different access technologies, without limitation.
  • the means for implementing the functions of a terminal device or network device in this application can refer to the terminal device or network device itself, or it can refer to a means that enables the terminal device or network device to implement the functions, such as a chip system or chip, specifically a system-on-a-chip (SoC) or a modem.
  • SoC system-on-a-chip
  • This means can be installed in the terminal device or network device.
  • the chip system can be composed of chips, or it can include chips and other discrete devices.
  • high-throughput scenarios can be, for example, enhanced mobile broadband (eMBB) scenarios
  • high-reliability low-latency scenarios can be, for example, URLLC (ultra-reliable low-latency communication) scenarios
  • low-power scenarios can be, for example, M2M scenarios, MTC scenarios, or IoT scenarios.
  • Figure 2 is a schematic diagram of the information transmission process.
  • information is sent from the source and undergoes processing such as source coding, channel coding, modulation, air interface transmission, demodulation, channel decoding, and source recovery before reaching the destination, completing the transmission of information from the source to the destination.
  • the processing shown in the upper layer of Figure 2 (including source coding, channel coding, and modulation) is performed at the transmitting end device, while the processing shown in the lower layer (including demodulation, channel decoding, and source recovery) is performed at the receiving end device.
  • the embodiments of this application mainly involve the source coding, channel coding, channel decoding, and source recovery shown in Figure 2.
  • Polar codes are the first channel coding scheme that can be rigorously proven to "achieve" Shannon channel capacity. They possess advantages such as good error correction performance and low decoding complexity, and have been selected by 3GPP as the coding scheme for the control channel in 5G eMBB scenarios (uplink/downlink). The following is a brief introduction to the encoding, construction, and decoding process of Polar codes.
  • FIG 3 is a schematic diagram of an 8-bit Polar code encoding.
  • the encoding process includes several polarization kernel operations (the polarization kernel is indicated by a small dashed box).
  • the polarization kernel ANDs the two input bits... Multiplying them yields two output bits. It can be seen that the Polar code is constructed recursively.
  • An 8-length Polar code can be seen as a combination of two 4-length Polar codes (corresponding to the two larger dashed boxes in the diagram), and a 4-length Polar code can be seen as a combination of two 2-length Polar codes.
  • the N positions corresponding to the N bits to be encoded before Polar code encoding have different reliability levels.
  • the K positions with the highest reliability are used to place the K data bits from the bits to be encoded, and the remaining (NK) positions are used to place frozen bits, which are typically 0.
  • the positions carrying the K data bits can be called data bit positions
  • the positions carrying the frozen bits can be called frozen bit positions
  • the frozen bit positions are known at both the transmitting and receiving ends during actual transmission.
  • the 8 bits to be encoded are the leftmost u0 to u7 .
  • the bits to be encoded there are 4 information bits (i.e., u7 , u6 , u5 , u3 ).
  • the four information bits are placed in the positions with the highest reliability.
  • the remaining 4 positions are placed in the positions with the lowest reliability ( u4 , u2 , u1 , u0 ).
  • the rightmost 8 codeword bits 01010101 are obtained and denoted as c0 to c7.
  • the transmitting device sends c0 to c7 to channel W.
  • the Successive Cancellation Decoding (SC) algorithm can be used.
  • SC Successive Cancellation Decoding
  • the decoding result is determined directly by hard decision.
  • the log-likelihood ratio (LLR) of the information bits is calculated step by step. For an information bit, if LLR > 0, the bit is determined to be 0; if LLR ⁇ 0, the bit is determined to be 1. For frozen bits, the bit is set to 0 regardless of the LLR value.
  • Figure 4 is a schematic diagram of a simple SC decoding process.
  • the computation of an f node requires two LLR inputs to its right, and the computation of a g node requires two LLR inputs to its right and one "Partial Sum" input above it. It can be understood that the output term can only be calculated after the input terms are calculated.
  • the 8 nodes are calculated sequentially, and the order of the decoded bits obtained is 1 ⁇ 2 ⁇ 3 ⁇ 4.
  • This process is the SC decoding process. It has been proven that the longer the code length of a Polar code, the better the decoding performance.
  • the SCL algorithm is an extension of the SC algorithm. Instead of directly determining the decoding result through hard decision in the intermediate process, the SCL algorithm saves the decoding results corresponding to 0 and 1 as two branch decoding paths. Using the above method, if the SCL algorithm stores a total of List decoding paths and ultimately selects the correct path using the path metric (PM), the List paths can be sorted from smallest to largest PM.
  • PM path metric
  • the decoding path ranked higher in the list is more likely to be the correct codeword; that is, the path with the optimal PM (i.e., the first path, the path with the smallest PM) is output as the final codeword.
  • a PC-Polar code is proposed. Based on the PC bits in the PC-Polar code, the PM of SCL decoding can be corrected, increasing the probability that the correct decoding path is ranked higher.
  • the current decoded bit is a PC bit, the value at the current PC position needs to be calculated based on previous decoding results and the PC checksum.
  • the following describes a method for determining information bits and check bits without rate matching.
  • N is an integer power of 2
  • the bit sequence includes K information bits and nPC PC bits.
  • the remaining bits in the bit sequence besides the K information bits and nPC PC bits are frozen bits, where K and nPC are both positive integers.
  • CRC cyclic redundancy check
  • the rate matching bits in the N bits of the bit sequence to be encoded need to be pre-frozen.
  • rate matching will be introduced below.
  • the rate matching scheme for Polar codes in NR includes two steps: sub-block interleaving and bit selection.
  • the rate matching input codestream i.e., d0 , d1 , d2 , ..., dN -1
  • interleaving is performed according to the interleaving pattern shown in Table 1.
  • the resulting codeword sequence is y0 , y1 , y2 , ..., yN-1 .
  • the pseudocode for sub-block interleaving is shown below:
  • Bit selection involves choosing to discard or repeat some bits based on the relationship between the rate-matched input bitstream length N and the actual transmitted bitstream length E of the channel. There are three bit selection modes: puncture, shortening, and repetition.
  • E ⁇ N the repetition mode is used, which requires adding some repeated bits to the original bitstream
  • E ⁇ N the relationship between K/E needs to be compared. If K/E ⁇ 7/16, the punching mode is used, and the last E bits of the codeword sequence y0 , y1 , y2 , ..., yN -1 are directly extracted; if K/E>7/16, the shortening mode is used, and the first E bits of the codeword sequence y0 , y1 , y2 , ..., yN -1 are directly extracted.
  • this application provides a polar-based communication method that can effectively solve the above-mentioned technical problems.
  • the embodiments of the method proposed in this application are described below.
  • FIG. 5 is a schematic flowchart of a polar-based encoding method 500 provided in this application. The method includes the following steps.
  • sending device can refer to the sending device itself or a device that enables the sending device to perform this function.
  • sending device will be used uniformly below.
  • the sending device can be a terminal device or a network device.
  • the transmitting device determines the length N of the bit sequence to be encoded.
  • the bit sequence to be encoded includes K information bits and n PC PC bits, where N is the length of the mother code, and K and n PC are both positive integers.
  • N is the length of the mother code, that is, N is 2 to the power of n, and n is a positive integer.
  • N can be determined based on K and/or E, where E is the length of the codeword sequence after rate matching.
  • E is the length of the codeword sequence after rate matching.
  • N can also be called the length of the rate-matched input bitstream
  • E can also be called the length of the actual transmitted bitstream of the channel
  • E can also be called the target coding length; this application does not impose any restrictions on this.
  • the specific method for determining N will be illustrated with examples later and will not be elaborated here.
  • the transmitting device determines the first candidate sequence number set based on the first reliability sequence and the first sequence number set.
  • the first reliability sequence includes the indices of N polarization channels, which are arranged according to their reliability.
  • the first indices set indicates the indices that need to be pre-frozen among the N polarization channel indices of the first reliability sequence.
  • the first candidate indices set indicates the T indices remaining in the first reliability sequence excluding the first indices set.
  • the first reliability sequence can be arranged in order of reliability from low to high for the polarization sub-channels, or in order of reliability from high to low.
  • the first sequence number set can also be called the first pre-frozen sequence number set. It is understood that the first pre-frozen sequence number set and the first candidate sequence number set have no common elements.
  • the first sequence number set is the rate-matching sequence number set, or it can be understood that the first sequence number set and the rate-matching sequence number set are the same set, and the rate-matching sequence number set indicates the bits used to indicate punching or shortening.
  • the first sequence number set includes the rate matching sequence number set, and the rate matching sequence number set is a proper subset of the first sequence number set.
  • the transmitting device determines a first candidate sequence number set based on a first reliability sequence and a first sequence number set, including: the transmitting device determining a second reliability sequence based on the first reliability sequence and the first sequence number set, the second reliability sequence including all remaining sequence numbers in the first reliability sequence except for the first sequence number set; the transmitting device determining a first candidate sequence number set based on the second reliability sequence, the first candidate sequence number set including T sequence numbers in the second reliability sequence, the T sequence numbers being the sequence numbers of the T most reliable polarization channels in the second reliability sequence.
  • the transmitting device determines the second candidate sequence number set based on the first reliability sequence and the second sequence number set.
  • the second sequence number set is used to indicate the sequence numbers that need to be pre-frozen among the N polarization channels of the first reliability sequence.
  • the second candidate sequence number set is used to indicate the (K′-T) sequence numbers among the remaining sequence numbers of the N polarization channels excluding the second sequence number set and the first candidate sequence number set.
  • the (K′-T) bits corresponding to the (K′-T) sequence numbers in the bit sequence to be encoded are used to carry the remaining (K′-T) bits among the K information bits and n PC PC bits.
  • the second sequence number set includes the first sequence number set and the third sequence number set (i.e., the first sequence number set is a proper subset of the second sequence number set).
  • the reliability decrease of the polarization channel corresponding to the sequence number indicated by the third sequence number set is greater than the reliability decrease of the polarization channel corresponding to the sequence number indicated by the fourth sequence number set.
  • the fourth sequence number set is the set consisting of the remaining sequence numbers in the first reliability sequence excluding the third sequence number set.
  • the decrease in reliability of a polarization channel can be understood as the order of the corresponding index of the polarization channel shifting forward.
  • the magnitude of the decrease in reliability of a polarization channel can be understood as the number of bits that the corresponding index of the polarization channel shifts forward.
  • the polarization channels corresponding to these four indices in the first reliability sequence are sorted from low to high reliability as [41, 28, 42, 49].
  • the sorting of these four polarization channels from low to high reliability becomes [28, 41, 42, 49]. It can be seen that in this example, the order of the polarization channel with index 28 has shifted forward, so it can be considered that the reliability of the polarization channel with index 28 has decreased, and the decrease in reliability of the polarization channel with index 28 is 1.
  • the reliability degradation of a polarization channel corresponding to a set of indices can be determined by shifting the order of the indices of the polarization channels corresponding to that set forward by a certain number of bits.
  • the polarization channels corresponding to these five numbers in the first reliability sequence are sorted from low to high reliability as [38, 41, 28, 42, 49].
  • the polarization channels with numbers 28, 38, 41, 42, and 49 are sorted from low to high reliability as [28, 38, 41, 49, 42]. It can be seen that in this example, the order of the polarization channel with number 28 has shifted forward two positions, the order of the polarization channel with number 49 has shifted forward one position, and the order of the polarization channels with numbers 38, 41, and 42 has shifted backward one position.
  • sequence number 28 is the third sequence number set
  • sequences 38, 41, 42, and 49 are the fourth sequence number set
  • the minimum number of positions to shift forward in the third sequence number set is 2
  • the maximum number of positions to shift forward in the fourth sequence number set is 1
  • the reliability decrease of the polarization channel corresponding to the sequence number indicated by the third sequence number set is greater than the reliability decrease of the polarization channel corresponding to the sequence number indicated by the fourth sequence number set.
  • sequence number 28 is the third sequence number set
  • sequences 38, 41, 42, and 49 are the fourth sequence number set
  • the sum of the number of positions shifted forward in the third sequence number set is 2
  • the sum of the number of positions shifted forward in the fourth sequence number set is 1. Therefore, it can be considered that the reliability decrease of the polarization channel corresponding to the sequence number indicated by the third sequence number set is greater than the reliability decrease of the polarization channel corresponding to the sequence number indicated by the fourth sequence number set.
  • implementation method three if the order of S1 numbers in sequence number set #1 is shifted forward, and the sum of the number of positions shifted forward in S1 numbers is Q1, then the average number of positions shifted forward in S1 numbers is Q1/S1. Similarly, if the order of S2 numbers in sequence number set #2 is shifted forward, and the sum of the number of positions shifted forward in S2 numbers is Q2, then the average number of positions shifted forward in S2 numbers is Q2/S2. If Q1/S1 is greater than Q2/S2, then the reliability decrease of the polarization channel corresponding to the sequence number indicated by sequence number set #1 is considered greater than the reliability decrease of the polarization channel corresponding to the sequence number indicated by sequence number set #2, where S1, Q1, S2, and Q2 are natural numbers.
  • sequence number 28 is the third sequence number set, and sequences 38, 41, 42, and 49 are the fourth sequence number set, it can be seen that if the order of one sequence number (i.e., sequence number 28) in the third sequence number set is shifted forward, and the sum of the shifted positions is 2, then the average value of the third sequence number set is 2. If the order of one sequence number (i.e., sequence number 49) in the fourth sequence number set is shifted forward, and the sum of the shifted positions is 1, then the average value of the fourth sequence number set is 1.
  • the reliability decrease of the polarization channel corresponding to the sequence number indicated by the third sequence number set is greater than the reliability decrease of the polarization channel corresponding to the sequence number indicated by the fourth sequence number set.
  • the third sequence number set can be determined based on simulation results, or it can be determined based on historical experience data. This application does not limit the method for determining the third sequence number set.
  • rate matching reduces the reliability of polarization channels with sequence numbers less than N/2 in the first reliability sequence. Therefore, selecting more bits based on polarization channels with sequence numbers not less than N/2 helps to accurately select high-reliability bits as information bits and check bits.
  • the transmitting device can further freeze a third sequence number set based on freezing the first sequence number set.
  • This third sequence number set is the union of the first N/2 elements of the natural sequence number set [0, 1, 2, ..., N-1].
  • This natural sequence number set can be understood as including N distinct integers from 0 to N-1, and these N integers are sorted in ascending order.
  • the second sequence number set can also be called the second pre-frozen sequence number set, and the second pre-frozen sequence number set and the second candidate sequence number set have no common elements.
  • the T bits corresponding to the T indices in the first candidate sequence carry K information bits and T bits out of n PC PC bits in the bit sequence to be encoded.
  • the (K′-T) bits corresponding to the (K′-T) indices in the second candidate sequence carry the remaining (K′-T) bits out of the K information bits and n PC PC bits. That is, different bits need to be selected to carry the remaining (K′-T) bits. Therefore, any index in the second candidate sequence is different from any index in the first candidate sequence.
  • the transmitting device determines a second candidate sequence number set based on a first reliability sequence and a second sequence number set, including: the transmitting device determines a third reliability sequence based on the first reliability sequence and the second sequence number set, the third reliability sequence including all remaining sequence numbers in the first reliability sequence except for the second sequence number set; the transmitting device determines a second candidate sequence number set based on the third reliability sequence, the second candidate sequence number set including (K′-T) sequence numbers in the third reliability sequence, the (K′-T) sequence numbers being the sequence numbers of the (K′-T) most reliable polarization channels in the third reliability sequence excluding the first candidate sequence number set.
  • the transmitting device performs Polar encoding on the bit sequence to be encoded according to the first candidate sequence number set and the second candidate set to obtain the codeword sequence.
  • the transmitting device determines the first candidate sequence number set and the second candidate set, that is, it determines the K′ bits in the N bits of the bit sequence to be encoded, which are used to place K information bits and nPC PC bits. Then, the transmitting device places the K information bits and nPC PC bits in the corresponding K′ bits. After that, it places freeze bits in the remaining bits of the N bits of the bit sequence to be encoded, excluding the K′ bits. The freeze bits are generally 0, thus obtaining the bit sequence to be encoded.
  • the scheme shown in the above method 500 selects the bits used to carry information bits and PC bits in two stages. In the first stage, T bits are selected, and in the second stage, K-T bits are selected.
  • This method helps to accurately select the bits with the highest reliability to carry information bits and PC bits, which can improve encoding and decoding performance (such as error correction performance), and thus help to improve communication performance.
  • the transmitting device still needs to perform other operations such as rate matching on the codeword sequence, so the method also includes S550.
  • the transmitting device determines the symbol sequence based on the codeword sequence.
  • a symbol sequence can be a rate-matched sequence or a modulated sequence.
  • the transmitting device performs rate matching on the codeword sequence, and then modulates the rate-matched sequence to obtain the symbol sequence.
  • the modulation method can be QPSK (quaternary phase shift keying), which maps the modulated QPSK symbols onto physical resources for transmission.
  • the transmitter modulates the rate-matched codeword sequence, modulating bits 0 to 1 and bits 1 to -1 to obtain the symbol sequence to be transmitted.
  • the sequence before modulation is ⁇ 1,0,0,1,1,0 ⁇
  • the modulated sequence, symbol sequence #1 is ⁇ -1,1,1,-1,-1,1 ⁇ .
  • the transmitting device then maps the modulated symbol sequence onto physical resources and sends the symbol sequence to the receiving device. It can be understood that when the transmitting device is a chip, it can output the symbol sequence to other modules connected to it (such as an RF module or antenna), which then send the symbol sequence to the receiving device.
  • Figure 6 is a schematic flowchart of a polar-based encoding method 600 provided in an embodiment of this application. The method includes the following steps.
  • the transmitting device determines the length N of the bit sequence to be encoded.
  • the transmitting device can determine the length N of the bit sequence to be encoded based on K and E, where K is the length of the information bits to be encoded and E is the length of the codeword sequence after rate matching.
  • the transmitting device determines the bit selection mode and the set of rate matching sequence numbers Q in rate matching based on K, E and N.
  • the process of determining the rate matching sequence number set Q is exemplarily as follows: divide 0, 1, 2, ..., N-1 into 32 sub-blocks, and then perform sub-block interleaving to obtain the sequence number set corresponding to the interleaved polarization sub-channel sequence number.
  • This application does not limit the specific implementation method of sub-block interleaving.
  • the transmitting device selects (N-E) numbers from the set of numbers corresponding to the interleaved polarized sub-channel numbers from back to front as the rate matching number set Q; when the rate matching method is puncturing, the transmitting device selects (N-E) numbers from the set of numbers corresponding to the interleaved polarized sub-channel numbers from front to back as the rate matching number set Q.
  • the transmitting device based on the first reliability sequence
  • the first candidate sequence set is determined by the rate matching sequence set Q.
  • the rate matching sequence number set Q is a specific example of the first sequence number set in S520.
  • the following describes how to determine the first candidate sequence number set. The process will be illustrated with examples.
  • the transmitting device starts from the first reliability sequence Remove the rate matching sequence Q from the set to obtain the second reliability sequence Q1, the length of which is equal to E.
  • the rate matching sequence set Q [0, 1, 2, 3, 4, 5, 8, 9, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17]
  • the second reliability sequence Q1 [32, 18, 33, 20, 34, 24, 36, 40, 19, 48, 21, 35, 26, 37, 25, 22, 38, 41, 28, 42, 49, 44, 50, 52, 23, 56, 27, 39, 29, 43, 30, 45, 51, 46, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63].
  • the transmitting device determines the first candidate sequence number set based on the second reliability sequence Q1.
  • the first candidate sequence number set It is included in the second reliability sequence Q1, and That is, the first candidate sequence number set includes T sequences, and the T sequences correspond one-to-one with the T bits in the N bits of the bit sequence to be encoded.
  • T determines the first candidate sequence set.
  • the transmitting device determines the pre-frozen sequence number set.
  • pre-frozen sequence number set in this embodiment This is a specific example of the second set of sequence numbers in S530.
  • the sequence number set is pre-frozen when E ⁇ 3*N/4.
  • the first few in the set of indexes Q and the set of natural order indexes [0, 1, 2, ..., N-1] are...
  • the union of elements i.e., an example of the third-order set
  • the pre-frozen sequence set is the union of the rate-matched sequence set Q and the first N/2 elements (i.e., an example of the third sequence set) in the natural sequence set [0, 1, 2, ..., N-1].
  • the natural sequence set includes N different integers from 0 to N-1, and the N integers are sorted in ascending order.
  • the above determines the set of pre-freeze serial numbers.
  • the advantage of this is that when E ⁇ 3*N/4, the number of puncture bits is relatively large.
  • Increasing the pre-freeze sequence number that is, increasing the pre-freeze bits in N bits, can help select more reliable positions as information bits and check bits, thus improving the performance of polar codes.
  • the transmitting device bases on the first reliability sequence and pre-frozen sequence set Determine the second candidate sequence set
  • the transmitting device starts from the first reliability sequence Remove the pre-frozen sequence set
  • the third reliability sequence Q2 is obtained, and the length of Q2 is less than or equal to E.
  • the pre-frozen sequence set is the union of the rate-matching sequence set Q and the first N/2 elements of the natural order sequence set [0, 1, 2, ..., N-1].
  • the pre-frozen sequence set ...
  • the third reliability sequence Q2 [32, 33, 34, 36, 40, 48, 35, 37, 38, 41, 42, 49, 44, 50, 52, 56, 39, 43, 45, 51, 46, 53, 54, 57, 58, 60, 47, 55, 59, 61, 62, 63].
  • the transmitting device determines the second candidate sequence number set based on the third reliability sequence Q2.
  • the second candidate sequence number set It is included in the third reliability sequence Q2, and That is, the second candidate sequence number set includes (K′-T) sequence numbers, and the (K′-T) sequence numbers correspond one-to-one with the (K′-T) bits in the N bits of the bit sequence to be encoded.
  • the transmitting device continuously reads from the third reliability Q2, starting from the end and working backwards, the sets of numbers that do not belong to the first candidate sequence number set.
  • the transmitting device determines the fifth sequence number set based on the first candidate sequence number set and the second candidate sequence number set.
  • the fifth set of serial numbers is the union of the first set of candidate serial numbers and the second set of candidate serial numbers (i.e., ... ).
  • n PC 3 bits (i.e. the 3 positions with the lowest reliability) are used as check bits, and the remaining bits (39, 29, 43, 30, 45, 51, 46, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63) are used as information bits.
  • Q1 ⁇ Q2 represents the set containing all the indices in set Q2 that are contained in set Q1, and will not be elaborated on in subsequent texts.
  • the transmitting device determines the bit sequence to be encoded based on the fifth sequence number set.
  • the transmitting device places the K information bits and n PC PC bits into the corresponding K′ bits. Then, it places freeze bits (typically 0) in the remaining bits of the N bits of the bit sequence to be encoded, excluding the K′ bits, thus obtaining the bit sequence to be encoded.
  • the above scheme can support rate matching schemes for Polar codes in NR, that is, it is applicable to rate matching schemes that include sub-block interleaving.
  • K′ i.e., 22
  • K′ i.e., 22
  • K′ i.e., 22
  • the fifth index set is [23, 56, 27, 39, 29, 43, 30, 45, 51, 46, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63].
  • the final determined fifth index set is [52, 56, 27, 39, 29, 43, 30, 45, 51, 46, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63].
  • the difference between the two lies in the fact that the existing technology uses bit 23 as one of the K′ most reliable bits, while this application uses bit 52 as one of the K′ most reliable bits.
  • the reliability of bit 52 is actually higher than that of bit 23. Therefore, the method proposed in this application can accurately select the bits with high reliability as information bits and check bits to improve encoding and decoding performance (e.g., error correction performance), thereby improving communication performance.
  • FIG. 7 is a flowchart illustrating another polar-based encoding method 700 provided in an embodiment of this application. The method includes the following steps.
  • the transmitting device determines the length N of the bit sequence to be encoded.
  • S720 The transmitting device determines the bit selection mode and the set of rate matching sequence numbers Q in rate matching based on K, E, and N.
  • the transmitting device selects (N-E) numbers from the natural sequence number set [0, 1, 2, ..., N-1] from the end to the beginning as the rate matching number set Q; when the rate matching method is punching, the transmitting device selects (N-E) numbers from the natural sequence number set [0, 1, 2, ..., N-1] from the beginning to the end as the rate matching number set Q.
  • the process of determining the rate matching sequence number set Q is as follows: when the rate matching method is shortening, the transmitting device selects (N-E) sequence numbers from the natural sequence number set [0, 1, 2, ..., N-1] from the end to the beginning as the rate matching sequence number set Q; when the rate matching method is puncturing, the transmitting device selects (N-E) sequence numbers from the natural sequence number set [0, 1, 2, ..., N-1] from the beginning to the end as the rate matching sequence number set Q.
  • the rate matching method determined in S720 is used as a shortened version, and the method for determining the first candidate sequence number set and the second candidate sequence number set will be further described.
  • the transmitting device determines the first sequence number set.
  • the first sequence set Let Q be the set of rate matching numbers. If E ⁇ 128, the first set of numbers is the union of the sets of rate matching numbers Q, N/4, and N/2.
  • the above determines the set of pre-freeze serial numbers.
  • the advantage of this is that, under high code rate and long code conditions, the N/4 and N/2 line weights are small, and the reliability drops significantly after rate matching, so they should be used as pre-frozen bits.
  • the first set of sequence numbers is the set of rate matching sequence numbers; if E > 128, the first set of sequence numbers is the union of the set of rate matching sequence numbers, N/4, and N/2.
  • the above technical solution is applicable to rate matching schemes that do not include sub-block interleaving and whose bit selection mode is shortened.
  • the advantage of determining the pre-frozen sequence number set is that when E>128 and is not the mother code length, the N/4 and N/2 line weights are small, and the reliability drops significantly after rate matching, so they should be used as pre-frozen bits.
  • the transmitting device bases on the first reliability sequence and the first set of numbers Determine the first candidate sequence set
  • the transmitting device starts from the first reliability sequence Remove the first set of indices
  • the second reliability sequence Q1 is obtained, and the length of Q1 is equal to E.
  • the transmitting device determines the first candidate sequence number set based on the second reliability sequence Q1.
  • the first candidate sequence number set It is included in the second reliability sequence Q1, and That is, the first candidate sequence number set includes T sequences, and the T sequences correspond one-to-one with the T bits in the N bits of the bit sequence to be encoded.
  • T K′; otherwise, T is determined based on E/N.
  • the above determines the first candidate sequence set.
  • more Z values can be set.
  • two Z values can be set (i.e., Z0 and Z1 )
  • three Z values can be set (i.e., Z0 , Z1 , and Z2 ), or even more Z values.
  • it is a method of interval division. Setting two Z values means dividing into three intervals, setting three Z values means dividing into four intervals, and so on. All Z values are numbers between 0 and 1.
  • the transmitting device determines the second sequence number set.
  • the second set of ordinal numbers is the union of the first set of ordinal numbers and the first N/2 elements of the natural order ordinal number set [0, 1, 2, ..., N-1] (i.e., an example of the third set of ordinal numbers). Based on the above example, the first set of ordinal numbers... but
  • the above determines the second set of serial numbers.
  • the advantage of this is that, since the shortened mode improves the reliability of polarization channels with sequence numbers not less than N/2, the N/2 elements before pre-freezing can select polarization channels with sequence numbers not less than N/2 as information bits and check bits, thus improving decoding performance.
  • the transmitting device bases on the first reliability sequence Second set of numbers Determine the second candidate sequence set
  • the transmitting device starts from the first reliability sequence Remove the second set of numbers
  • the third reliability sequence Q2 is obtained, and the length of Q2 is less than or equal to E.
  • the transmitting device determines the second candidate sequence number set based on the third reliability sequence Q2.
  • the second candidate sequence number set It is included in the third reliability sequence Q2, and That is, the second candidate sequence number set includes (K′-T) sequence numbers, and the (K′-T) sequence numbers correspond one-to-one with the (K′-T) bits in the N bits of the bit sequence to be encoded.
  • the transmitting device continuously reads from the third reliability Q2, starting from the end and working backwards, the sets of numbers that do not belong to the first candidate sequence number set.
  • the transmitting device determines the fifth sequence number set based on the first candidate sequence number set and the second candidate sequence number set.
  • the fifth set of serial numbers is the union of the first set of candidate serial numbers and the second set of candidate serial numbers (i.e., ... ).
  • the transmitting device determines the bit sequence to be encoded based on the fifth sequence number set.
  • the transmitting device places the K information bits and n PC PC bits into the corresponding K′ bits. Then, it places freeze bits (typically 0) in the remaining bits of the N bits of the bit sequence to be encoded, excluding the K′ bits, thus obtaining the bit sequence to be encoded.
  • n PC 3 bits (i.e., the 3 positions with the lowest reliability) are used as check bits, and the remaining bits (34, 24, 36, 7, 11, 40, 19, 13, 14, 21, 35, 26, 37, 25, 22, 38, 41, 28, 15, 23, 27, 39, 29, 30, 31) are used as information bits.
  • the process of polar code encoding and rate matching of the bit sequence to be encoded is described above and will not be repeated here.
  • the above scheme selects information bits in two stages. Compared to the first reliability sequence, shortening the sequence improves the reliability of polarization channels with sequence numbers no less than N/2. Selecting more bits from these polarization channels helps to accurately select high-reliability bits as information bits and check bits.
  • the second stage After selecting T high-reliability polarization channel sequence numbers in the first stage (these polarization channels are less affected by rate matching), the second stage pre-freezes polarization channels with sequence numbers less than N/2. Then, based on the reliability of these polarization channels with sequence numbers no less than N/2, the remaining (K′-T) bits with slightly lower reliability can be selected, thereby improving encoding and decoding performance (e.g., error correction performance) and ultimately enhancing communication performance. Furthermore, this scheme supports rate matching schemes that do not require sub-block interleaving and use a shortened bit selection mode, making implementation simpler, reducing complexity, and ensuring stable performance.
  • FIG. 8 is a flowchart illustrating another polar-based encoding method 800 provided in an embodiment of this application. The method includes the following steps.
  • the transmitting device determines the length N of the bit sequence to be encoded.
  • the transmitting device determines the bit selection mode and the set of rate matching sequence numbers Q in rate matching based on K, E and N.
  • the transmitting device determines the first sequence number set.
  • the first sequence set is the first of the rate-matching sequence set and the natural order sequence set [0, 1, 2, ..., N-1].
  • the union of n elements if N ⁇ 256, the first sequence set is the first set of the rate matching set and the natural order sequence set [0, 1, 2, ..., N-1]. The union of n elements.
  • the advantage of determining the first sequence number set is that, since puncturing causes a decrease in the reliability of polarization channels with sequence numbers close to the punctured bit positions, it is necessary to pre-freeze polarization channels with smaller sequence numbers. Furthermore, when the code length is large, more pre-freezed bits can be set to improve performance.
  • the first sequence set is the first of the rate-matching sequence set and the natural order sequence set [0, 1, 2, ..., N-1].
  • the union of n elements if N > 256, the first sequence set is the first set of the rate matching set and the natural order sequence set [0, 1, 2, ..., N-1]. The union of n elements.
  • the above technical solution is applicable to rate matching schemes that do not include sub-block interleaving and whose bit selection mode is puncturing.
  • the transmitting device bases the first reliability sequence and the first set of numbers Determine the first candidate sequence set
  • the transmitting device starts from the first reliability sequence Remove the first set of indices
  • the second reliability sequence Q1 is obtained, and the length of Q1 is equal to E.
  • the first reliability sequence [55, 59, 61, 62, 63]
  • the second reliability sequence Q1 [32, 33, 34, 36, 40, 48, 35, 37, 38, 41, 28, 42, 49, 44, 50, 52, 56, 27, 39, 29, 43, 30, 45, 51, 46, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63].
  • the transmitting device determines the first candidate sequence number set based on the second reliability sequence Q1.
  • the first candidate sequence number set It is included in the second reliability sequence Q1, and That is, the first candidate sequence number set includes T sequences, and the T sequences correspond one-to-one with the T bits in the N bits of the bit sequence to be encoded.
  • T can be determined based on E/N.
  • T can be determined based on Table 3.
  • T determines the first candidate sequence set.
  • the transmitting device determines the second sequence number set.
  • the second set of ordinal numbers is the union of the first set of ordinal numbers and the first N/2 elements of the natural order ordinal number set [0, 1, 2, ..., N-1] (i.e., an example of the third set of ordinal numbers). Based on the above example, the first set of ordinal numbers... but
  • the above determines the second set of serial numbers.
  • the advantage of this is that, since punching reduces the reliability of polarization channels with sequence numbers less than N/2, the N/2 elements before pre-freezing can select polarization channels with sequence numbers not less than N/2 as information bits and check bits, thus improving decoding performance.
  • the transmitting device bases on the first reliability sequence Second set of numbers Determine the second candidate sequence set
  • the transmitting device starts from the first reliability sequence Remove the second set of numbers
  • the third reliability sequence Q2 is obtained, and the length of Q2 is less than or equal to E.
  • the third reliability sequence Q2 [32, 33, 34, 36, 40, 48, 35, 37, 38, 41, 42, 49, 44, 50, 52, 56, 39, 43, 45, 51, 46, 53, 54, 57, 58, 60, 47, 55, 59, 61, 62, 63].
  • the transmitting device determines the second candidate sequence number set based on the third reliability sequence Q2.
  • the second candidate sequence number set It is included in the third reliability sequence Q2, and That is, the second candidate sequence number set includes (K′-T) sequence numbers, and the (K′-T) sequence numbers correspond one-to-one with the (K′-T) bits in the N bits of the bit sequence to be encoded.
  • the transmitting device continuously reads from the third reliability Q2, starting from the end and working backwards, the sets of numbers that do not belong to the first candidate sequence number set.
  • the transmitting device determines the fifth sequence number set based on the first candidate sequence number set and the second candidate sequence number set.
  • the fifth set of serial numbers is the union of the first set of candidate serial numbers and the second set of candidate serial numbers (i.e., ... ).
  • the transmitting device determines the bit sequence to be encoded based on the fifth sequence number set.
  • the transmitting device places the K information bits and n PC PC bits into the corresponding K′ bits. Then, it places freeze bits (typically 0) in the remaining bits of the N bits of the bit sequence to be encoded, excluding the K′ bits, thus obtaining the bit sequence to be encoded.
  • n PC 3 bits (i.e. the 3 positions with the lowest reliability) are used as check bits, and the remaining bits (39, 43, 30, 45, 51, 46, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63) are used as information bits.
  • the above scheme selects information bits in two stages. Compared to the first reliability sequence, puncturing reduces the reliability of polarization channels with sequence numbers less than N/2. Selecting more bits from polarization channels with sequence numbers not less than N/2 helps to accurately select high-reliability bits as information bits and check bits. After selecting T high-reliability polarization channel sequence numbers in the first stage (these polarization channels are less affected by rate matching), the polarization channels with sequence numbers less than N/2 are pre-frozen again in the second stage. Then, based on the reliability of polarization channels with sequence numbers not less than N/2, the remaining (K′-T) bits with slightly lower reliability can be selected, thereby improving encoding and decoding performance (e.g., error correction performance), and ultimately enhancing communication performance. Furthermore, this scheme supports rate matching schemes that do not require sub-block interleaving and use puncturing as the bit selection mode, making implementation simpler, reducing complexity, and ensuring stable performance.
  • K′ i.e., 21
  • K′ i.e., 21
  • the final determined fifth sequence set is [50, 52, 56, 39, 43, 30, 45, 51, 46, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63].
  • the fifth sequence set obtained based on the existing technology is different from the fifth sequence set obtained based on this application.
  • the reliability of the bit corresponding to sequence number [50, 52] is actually higher than that of the bit corresponding to [27, 29]. Therefore, the method proposed in this application can accurately select the bit with high reliability as the information bit and the check bit to improve the encoding and decoding performance (e.g., error correction performance) and thus improve the communication performance.
  • Figure 9 is a schematic flowchart of a polar code-based decoding method 900 provided in this application, which includes the following steps.
  • method 900 can be executed by the receiving device.
  • receiving device can refer to the receiving device itself or a device that enables the receiving device to perform this function.
  • receiving device will be used uniformly below.
  • the receiving device can be a terminal device or a network device.
  • the receiving device acquires the received value sequence.
  • the received value sequence is used to decode to obtain a first bit sequence of length N, which includes K information bits and n PC PC bits, where K and n PC are both positive integers and N is the length of the mother code.
  • the receiving device knows the length N of the bit sequence to be decoded, the number of information bits K, and the number of PC bits nPC . Based on the known information and the received value sequence, the first bit sequence is finally obtained by decoding.
  • the symbol sequence may introduce channel noise signals during transmission
  • the symbol sequence sent by the transmitting device will reach the receiving device through the air interface.
  • the information received by the receiving device is referred to in this application as the received value sequence.
  • the received value sequence and the symbol sequence can be the same or different, without limitation.
  • the receiving device determines the first candidate sequence number set based on the first reliability sequence and the first sequence number set.
  • the first reliability sequence includes the indices of N polarization channels, which are arranged according to their reliability.
  • the first indices set indicates the indices that need to be pre-frozen among the N polarization channel indices of the first reliability sequence.
  • the first candidate indices set indicates the T indices remaining in the first reliability sequence excluding the first indices set.
  • the receiving device determines the second candidate sequence number set based on the first reliability sequence and the second sequence number set.
  • the second sequence number set is used to indicate the sequence numbers that need to be pre-frozen among the N polarization channels of the first reliability sequence.
  • the second candidate sequence number set is used to indicate the (K′-T) sequence numbers remaining among the N polarization channels excluding the second sequence number set.
  • the (K′-T) bits corresponding to the (K′-T) sequence numbers in the bit sequence to be encoded are used to carry the K information bits and the remaining (K′-T) bits excluding T bits among the n PC PC bits.
  • the receiving device performs polar code decoding on the received value sequence according to the first candidate sequence number set and the second candidate set to obtain the first bit sequence.
  • the receiving device determines the first candidate sequence number set and the second candidate set, that is, it determines the K′ bits in the N bits of the bit sequence to be decoded, which are used to place K information bits and nPC PC bits. Then, the receiving device places frozen bits (generally 0) in the remaining bits of the N bits of the bit sequence to be decoded, excluding the K′ bits. Based on polar codes, it decodes the K′ bits in the N bits of the bit sequence to be decoded that correspond to the fifth sequence number set (the fifth sequence number set is the union of the first and second candidate sequence number sets), thus obtaining the first bit sequence of length N.
  • the specific decoding process is described above and will not be repeated here.
  • sequence number sets in the examples given in this application are all exemplarily numbered starting from 0.
  • sequence number sets in this application can also be numbered starting from 1. That is, the sequence number sets in this application can be numbered starting from 1 or starting from 0. This application does not specifically limit this.
  • Those skilled in the art can understand the implementation method when the sequence number set is numbered starting from 1 based on the content disclosed in this application, and will not elaborate further.
  • the methods and operations implemented by the device can also be implemented by components of the device (such as chips or circuits), without limitation.
  • FIGS 10 and 11 are schematic diagrams of possible apparatus structures provided in embodiments of this application. These apparatuses can be used to implement the functions of the transmitting or receiving devices in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments.
  • Figure 10 is a schematic block diagram of a communication device 1000 provided in an embodiment of this application.
  • the device 1000 may include a communication unit 1010 and a processing unit 1020.
  • the communication unit 1010 can communicate with the outside world, and the processing unit 1020 is used for data processing.
  • the communication unit 1010 may also be referred to as a communication interface or a transceiver unit.
  • the device 1000 can implement the steps or processes corresponding to those performed by the transmitting device in the above method embodiments, wherein the processing unit 1020 is used to perform processing-related operations of the transmitting device in the above method embodiments, and the communication unit 1010 is used to perform transmission-related operations of the transmitting device in the above method embodiments.
  • the device 1000 can implement the steps or processes corresponding to those performed by the receiving device in the above method embodiments, wherein the communication unit 1010 is used to perform the receiving-related operations of the receiving device in the above method embodiments, and the processing unit 1020 is used to perform the processing-related operations of the receiving device in the above method embodiments.
  • the device 1000 here is embodied in the form of a functional unit.
  • the term "unit” here can refer to an application-specific integrated circuit (ASIC), electronic circuitry, a processor (e.g., a shared processor, a proprietary processor, or a group processor, etc.) and memory for executing one or more software or firmware programs, integrated logic circuitry, and/or other suitable components supporting the described functions.
  • ASIC application-specific integrated circuit
  • processor e.g., a shared processor, a proprietary processor, or a group processor, etc.
  • memory for executing one or more software or firmware programs, integrated logic circuitry, and/or other suitable components supporting the described functions.
  • the device 1000 may specifically be the transmitting end device in the above embodiments, used to execute the various processes and/or steps corresponding to the transmitting end device in the above method embodiments; or, the device 1000 may specifically be the receiving end device in the above embodiments, used to execute the various processes and/or steps corresponding to the receiving end device in the above method embodiments. To avoid repetition, further details are omitted here.
  • the apparatus 1000 of each of the above-described schemes has the function of implementing the corresponding steps performed by the transmitting device in the above-described method, or the apparatus 1000 of each of the above-described schemes has the function of implementing the corresponding steps performed by the receiving device in the above-described method.
  • the function can be implemented by hardware or by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above functions; for example, the communication unit can be replaced by a transceiver (e.g., the transmitting unit in the communication unit can be replaced by a transmitter, and the receiving unit in the communication unit can be replaced by a receiver), and other units, such as processing units, can be replaced by a processor, respectively executing the transmission and reception operations and related processing operations in each method embodiment.
  • the aforementioned communication unit can also be a transceiver circuit (e.g., it may include a receiving circuit and a transmitting circuit), and the processing unit can be a processing circuit.
  • the device in FIG10 can be the receiving end device or transmitting end device in the foregoing embodiments, or it can be a chip or a chip system, such as a system on chip (SoC).
  • the communication unit can be an input/output circuit or a communication interface; the processing unit is a processor, microprocessor, or integrated circuit integrated on the chip. No limitations are imposed here.
  • FIG 11 is a schematic block diagram of a communication device 1100 provided in an embodiment of this application.
  • the device 1100 includes a processor 1110 and a transceiver 1120.
  • the processor 1110 and the transceiver 1120 communicate with each other through an internal connection path.
  • the processor 1110 is used to execute instructions to control the transceiver 1120 to send and/or receive signals.
  • the device 1100 may further include a memory 1130, which communicates with the processor 1110 and the transceiver 1120 via an internal connection path.
  • the memory 1130 stores instructions, and the processor 1110 can execute the instructions stored in the memory 1130.
  • the device 1100 is used to implement the various processes and steps corresponding to the transmitting device in the above method embodiments. In another possible implementation, the device 1100 is used to implement the various processes and steps corresponding to the receiving device in the above method embodiments.
  • the memory 1130 may be integrated into the processor 1110.
  • device 1100 includes at least one processor with integrated memory, and other memory besides the memory integrated on the processor.
  • the device 1100 can specifically be the transmitting or receiving device in the above embodiments, or it can be a chip or a chip system.
  • the transceiver 1120 can be the transceiver circuit of the chip, which is not limited here.
  • the device 1100 can be used to execute the various steps and/or processes corresponding to the transmitting or receiving device in the above method embodiments.
  • the memory 1130 may include read-only memory and random access memory, and provide instructions and data to the processor.
  • the memory may include non-volatile random access memory.
  • the memory may also store device type information.
  • the processor 1110 may be used to execute instructions stored in the memory, and when the processor 1110 executes instructions stored in the memory, the processor 1110 is used to perform the various steps and/or processes of the method embodiments corresponding to the transmitting or receiving devices described above.
  • each step of the above method can be completed by integrated logic circuits in the processor's hardware or by instructions in software.
  • the steps of the method disclosed in the embodiments of this application can be directly implemented by a hardware processor, or by a combination of hardware and software modules in the processor.
  • the software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method. To avoid repetition, detailed descriptions are omitted here.
  • the processor in the embodiments of this application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiments can be completed by the integrated logic circuitry in the processor's hardware or by instructions in software form.
  • the processor can be a general-purpose processor, digital signal processing (DSP), ASIC, field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.
  • DSP digital signal processing
  • FPGA field-programmable gate array
  • the processor in the embodiments of this application can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application.
  • the general-purpose processor can be a microprocessor or any conventional processor.
  • the steps of the methods disclosed in the embodiments of this application can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor.
  • the software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above method.
  • the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory.
  • the volatile memory can be random access memory (RAM), which is used as an external cache.
  • RAM synchronous dynamic random access memory
  • SDRAM synchronous dynamic random access memory
  • DDR SDRAM double data rate synchronous dynamic random access memory
  • ESDRAM enhanced synchronous dynamic random access memory
  • SLDRAM synchronous linked dynamic random access memory
  • DR RAM direct rambus RAM
  • the memory in this embodiment may be integrated into the processor (e.g., 1110).
  • this application also provides a computer-readable storage medium storing computer instructions, which, when executed on a computer, cause the operations and/or processes performed by the sending or receiving device in the various method embodiments of this application to be executed.
  • This application also provides a computer program product, which includes computer program code or instructions.
  • the computer program code or instructions are run on a computer, the operations and/or processes performed by the sending end device or the receiving end device in the various method embodiments of this application are executed.
  • this application also provides a chip including a processor.
  • a memory for storing a computer program is provided independently of the chip, and the processor is used to execute the computer program stored in the memory, such that operations and/or processes performed by a transmitting or receiving device in any method embodiment are performed.
  • the chip may also include a communication interface.
  • the communication interface may be an input/output interface or an interface circuit, etc.
  • the chip may also include a memory.
  • this application also provides a communication system, including the transmitting end device and the receiving end device in the embodiments of this application.
  • memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.
  • the disclosed systems, devices, and methods can be implemented in other ways.
  • the device embodiments described above are merely illustrative; for example, the division of units is merely a logical functional division, and in actual implementation, there may be other division methods.
  • multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be through some interfaces; the indirect coupling or communication connection of devices or units may be electrical, mechanical, or other forms.
  • the units described as separate components may or may not be physically separate.
  • the components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
  • the functional units in the various embodiments of this application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium.
  • This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application.
  • the aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.
  • B corresponding to A means that B is associated with A, and B can be determined based on A.
  • determining B based on A does not mean that B is determined solely based on A; B can also be determined based on A and/or other information.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

L'invention concerne un procédé de communication basé sur un code polaire et un appareil de communication. Dans le procédé, un dispositif récepteur et un dispositif émetteur sélectionnent des positions de bits d'informations et des positions de bits PC en deux étapes, dans une première étape, T positions de bits étant sélectionnées pour transporter T bits à partir de K positions de bits d'informations et nPC positions de bits PC, et dans une seconde étape, (K + nPC - T) positions de bits étant sélectionnées pour transporter les (K + nPC - T) bits restants parmi les K positions de bits d'informations et les nPC positions de bits PC. Le procédé facilite une sélection précise pour des positions de bits, qui ont une fiabilité élevée, en tant que positions de bits d'informations et positions de bits de vérification, et peut améliorer les performances de codage et de décodage (par exemple, des performances de correction d'erreur), ce qui facilite une amélioration des performances de communication.
PCT/CN2025/114766 2024-08-20 2025-08-14 Procédé de communication basé sur un code polaire et appareil de communication Pending WO2026040904A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN202411150719.3 2024-08-20
CN202411150719 2024-08-20
CN202510653910.8 2025-05-20
CN202510653910.8A CN121603157A (zh) 2024-08-20 2025-05-20 基于极化码的通信方法和通信装置

Publications (1)

Publication Number Publication Date
WO2026040904A1 true WO2026040904A1 (fr) 2026-02-26

Family

ID=98865734

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2025/114766 Pending WO2026040904A1 (fr) 2024-08-20 2025-08-14 Procédé de communication basé sur un code polaire et appareil de communication

Country Status (1)

Country Link
WO (1) WO2026040904A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108880565A (zh) * 2017-05-12 2018-11-23 华为技术有限公司 极化码的编译码方法和通信设备
CN109327226A (zh) * 2017-08-04 2019-02-12 华为技术有限公司 极化码的编译码方法、装置及设备
CN114172617A (zh) * 2018-11-16 2022-03-11 华为技术有限公司 Polar码编码方法及装置
CN114614943A (zh) * 2020-12-03 2022-06-10 华为技术有限公司 一种极化码辅助比特的确定方法和装置
US20240137047A1 (en) * 2021-07-01 2024-04-25 Huawei Technologies Co., Ltd. Encoding and decoding method and apparatus

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108880565A (zh) * 2017-05-12 2018-11-23 华为技术有限公司 极化码的编译码方法和通信设备
CN109327226A (zh) * 2017-08-04 2019-02-12 华为技术有限公司 极化码的编译码方法、装置及设备
CN114172617A (zh) * 2018-11-16 2022-03-11 华为技术有限公司 Polar码编码方法及装置
CN114614943A (zh) * 2020-12-03 2022-06-10 华为技术有限公司 一种极化码辅助比特的确定方法和装置
US20240137047A1 (en) * 2021-07-01 2024-04-25 Huawei Technologies Co., Ltd. Encoding and decoding method and apparatus

Similar Documents

Publication Publication Date Title
US20240031058A1 (en) Encoding and modulation method, demodulation and decoding method, and apparatus
CN111385059B (zh) 极化编码调制的方法和装置
CN109245857A (zh) 信息传输的方法、发送端设备和接收端设备
WO2024124428A1 (fr) Procédé de codage, procédé de décodage et appareil
WO2026040904A1 (fr) Procédé de communication basé sur un code polaire et appareil de communication
CN121603157A (zh) 基于极化码的通信方法和通信装置
WO2025252033A1 (fr) Procédé de communication et appareil de communication
WO2025223321A1 (fr) Procédé de codage, procédé de décodage et appareil de communication
CN120017211A (zh) 极化码编码的方法和装置
WO2026026519A1 (fr) Procédés de communication et appareil de communication basés sur un code ldpc
WO2026007748A1 (fr) Procédé de segmentation et appareil de communication
CN120165696A (zh) 一种基于低密度奇偶校验码的通信方法和通信装置
WO2025237362A1 (fr) Procédé de communication et appareil de communication
CN121333323A (zh) 基于ldpc码的通信方法和通信装置
WO2025237385A1 (fr) Procédés de communication et appareil de communication basés sur un code ldpc
CN121333326A (zh) 通信方法和通信装置
WO2026066896A1 (fr) Procédé de communication à base de code ldpc et appareil de communication
WO2026032053A1 (fr) Procédé de communication à base de code ldpc et appareil de communication
WO2026021345A1 (fr) Procédé de codage et procédé de décodage de code polaire, appareil de codage et appareil de décodage
WO2026001883A1 (fr) Procédé de communication et appareil de communication
CN121000337A (zh) 通信方法及装置
WO2024124476A1 (fr) Procédé et appareil de codage concaténé, et procédé et appareil de décodage concaténé
WO2025167543A1 (fr) Procédé de communication à base de code ldpc et appareil de communication
WO2026056970A1 (fr) Procédé de codage et procédé de décodage basés sur un code sc-ldpc et appareil de communication
CN119921784A (zh) 一种基于ldpc码的通信方法和通信装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 25856073

Country of ref document: EP

Kind code of ref document: A1