Communication method and apparatus

Abstract

A communication method and apparatus, relating to the technical field of communications, and capable of determining the position of a PC bit, so as to improve the code spectrum and decoding performance of a polar code, thereby improving the communication performance. The method comprises: a sending end apparatus performs polar encoding on an information bit sequence having a length of K on the basis of a check bit position set, so as to obtain and output an encoded bit sequence. The check bit position set comprises equation (I) positions among N positions that are in one-to-one correspondence with the equation (I) positions among E positions; the E positions are positions among the N positions other than rate matching bit positions; equation (I) is less than or equal to nPC; the equation (I) positions among the E positions are equation (I) positions having the smallest row weight in a first bit position set; the first bit position set comprises most reliable equation (II) positions among the E positions; the row weights corresponding to the positions in the first bit position set are row weights after rate matching, N denotes the mother code length, and E denotes the length after rate matching.

Description

Communication methods and devices

[0001] This application claims priority to Chinese patent application No. 202510199517.6, filed with the State Intellectual Property Office of China on February 21, 2025, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to communication methods and apparatus. Background Technology

[0003] In communication systems, parity-check polar codes (PC-Polar codes) can be used for encoding. In this encoding method, PC-Polar codes can include information bits, freeze bits, PC bits, and rate matching bits. The value of the PC bit can be determined based on the value of the information bit preceding it according to the PC equation. The rate matching bit does not need to be transmitted to the channel.

[0004] Among these challenges, determining the position of the PC bit to improve code spectrum and decoding performance has become an urgent problem to be solved. Summary of the Invention

[0005] This application provides a communication method and apparatus that can determine the position of the PC bit to improve the code spectrum and decoding performance of polar codes, thereby improving communication performance.

[0006] Firstly, this application provides a communication method that can be executed by a transmitting device. Unless otherwise specified, "transmitting device" in this application can refer to a transmitting equipment, a component within the transmitting device (e.g., a processor, a circuit or chip responsible for encoding functions (such as a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip containing a modem core, or a system-in-package (SIP) chip, etc.), or a logic module or software capable of implementing all or part of the functions of the transmitting device). The method includes: the transmitting device performing polar encoding on an information bit sequence of length K according to a set of check bit positions to obtain an encoded bit sequence; and outputting one or more bits of the encoded bit sequence. The set of check bit positions includes N positions... One position, N positions The positions and E positions Each position corresponds one-to-one, and the E positions are the positions other than the rate matching bit positions among the N positions; Less than or equal to n PC n PC N is the number of check bits; N is the mother code length; E is the length after rate matching; and E positions are... The position is the position with the smallest row weight in the set of the first bit positions. The first bit position set includes the most reliable of the E positions. The row weight corresponding to the position in the first bit position set is the row weight after rate matching.

[0007] Based on the first aspect, the transmitting device can select the most reliable location from E locations. Determine the position with the smallest row weight. N positions are used to determine the set of check bit positions based on the correspondence between the N and E positions, so as to achieve polar coding of the information bit sequence. On the one hand, the row weight corresponding to the positions in the first set of bit positions can be the row weight after rate matching, which can make the set of check bit positions include... The position represents the position with the smallest line weight in the rate-matched polar code. This position can reduce line weight loss, thereby improving the spectral performance of rate-matched polar codes and also improving decoding performance; on the other hand, compared to w min (w min The position is determined from the position corresponding to the minimum row weight in the first sequence below. Of the E positions, this application can directly determine the most reliable one. The position with the smallest row weight This position can help avoid appearing as much as possible. Greater than w min This allows us to determine the number of corresponding positions, simplifying the implementation and reducing its complexity.

[0008] One possible implementation is that the transmitting device determines the information bit position set based on the check bit position set; wherein, the information bit position set includes the positions in the second bit position set excluding the check bit position set, and the second bit position set includes the most reliable (K+n) positions in the first sequence. PC The first sequence comprises N positions, excluding the pre-frozen bit positions and the rate-matching bit positions, from the reliability sequence of length N.

[0009] Based on this possible implementation, the set of information bit positions can be determined, making the positions in the set of information bit positions more reliable, which can improve decoding performance and thus improve communication reliability; at the same time, it can also improve decoding performance.

[0010] Secondly, this application provides a communication method that can be executed by a receiving device. Unless otherwise specified, "receiving device" in this application can refer to a receiving equipment, a component within the receiving device (e.g., a processor, a circuit or chip responsible for encoding functions (such as a modem chip, also known as a baseband chip, or a system-on-a-chip or system-in-package chip containing a modem core, etc.), or a logic module or software capable of implementing all or part of the functions of the receiving device). The method includes: the receiving device receiving information to be decoded from a transmitting device; wherein the length of the information bit sequence corresponding to the information to be decoded is K; and decoding the information to be decoded according to a set of check bit positions to obtain a decoding result. The set of check bit positions includes N positions... One position, N positions The positions and E positions Each position corresponds one-to-one, and the E positions are the positions other than the rate matching bit positions among the N positions; Less than or equal to n PC n PC N is the number of check bits; N is the mother code length; E is the length after rate matching; and E positions are... The position is the position with the smallest row weight in the set of the first bit positions. The first bit position set includes the most reliable of the E positions. The row weight corresponding to the position in the first bit position set is the row weight after rate matching.

[0011] Based on the second aspect, the receiving device can select the most reliable location from E positions. Determine the position with the smallest row weight. The first set of bit positions is used to determine the set of check bit positions based on the correspondence between N and E positions, in order to decode the information to be decoded. On one hand, the row weight corresponding to the positions in the first set of bit positions can be the row weight after rate matching, which allows the set of check bit positions to include... The position represents the position with the smallest line weight in the rate-matched polar code. This position can reduce line weight loss, thereby improving the spectral performance of rate-matched polar codes and also improving decoding performance; on the other hand, compared to w min (w min The position corresponding to the minimum row weight in the first sequence mentioned above is determined from the position. Of the E positions, this application can directly determine the most reliable one. The position with the smallest row weight This position can help avoid appearing as much as possible. Greater than w min This allows us to determine the number of corresponding positions, simplifying the implementation and reducing its complexity.

[0012] One possible implementation is that the receiving device determines the information bit position set based on the check bit position set; wherein, the information bit position set includes positions in a second bit position set excluding the check bit position set, and the second bit position set includes the most reliable (K+n) positions in the first sequence. PC The first sequence comprises N positions, excluding the pre-frozen bit positions and the rate-matching bit positions, from the reliability sequence of length N.

[0013] Based on this possible implementation, the set of information bit positions can be determined, making the positions in the set of information bit positions more reliable, which can improve decoding performance and thus improve communication reliability; at the same time, it can also improve decoding performance.

[0014] Combining the first and second aspects, one possible implementation is in E positions. The position is the most reliable among the positions with the smallest row weight in the first bit position set. One position; or, of E positions The position with the largest index among the positions with the smallest row weight in the set of positions where the first bit position is located. One position.

[0015] Based on this possible implementation, for E positions The position is the most reliable among the positions with the smallest row weight in the first bit position set. By identifying E positions as check bits, positions with higher reliability can be designated, improving communication reliability and decoding performance. The position with the largest index among the positions with the smallest row weight in the set of positions where the first bit position is located. By identifying the position with the larger sequence number as the parity bit position, the parity bit can verify the information bit with the larger sequence number, thereby improving the parity bit's verification capability, reducing the bit error rate, and ultimately enhancing communication reliability.

[0016] Combining the first and second aspects, one possible implementation is... Less than n PC The set of check bit positions also includes the second set of bit positions excluding the N positions. The least reliable location outside of these locations There are 10 positions; the second set of bit positions includes the most reliable (K+n) positions in the first sequence. PCThe first sequence comprises N positions, excluding the pre-frozen bit positions and the rate-matching bit positions, from the reliability sequence of length N.

[0017] Based on this possible implementation, it is possible to make the set of check bit positions... Positions with lower reliability can be used to place information bit sequences in positions with higher reliability, thereby reducing the bit error rate and improving communication reliability.

[0018] Thirdly, embodiments of this application provide a communication device that can be applied to the transmitting end device described in the first aspect to realize the functions performed by the transmitting end device. This communication device can be a transmitting device, a chip or chip system or system-on-a-chip of the transmitting end device, etc. The communication device can execute the functions performed by the transmitting end device through hardware, or it can execute corresponding software through hardware. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations, or it can cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations, or it can cooperate with the transceiver module to complete the following processing operations, without limitation.

[0019] For example, the processing module is used to polarize the information bit sequence of length K according to the set of check bit positions to obtain the encoded bit sequence; the transceiver module is used to output one or more bits of the encoded bit sequence.

[0020] The set of check bit positions includes N positions. One position, N positions The positions and E positions Each position corresponds one-to-one, and the E positions are the positions other than the rate matching bit positions among the N positions; Less than or equal to n PC n PC N is the number of check bits; N is the mother code length; E is the length after rate matching; and E positions are... The position is the position with the smallest row weight in the set of the first bit positions. The first bit position set includes the most reliable of the E positions. The row weight corresponding to the position in the first bit position set is the row weight after rate matching.

[0021] Optionally, the transceiver module and processing module of the communication device in the third aspect may also perform the corresponding functions in the first aspect or any possible design of the first aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0022] Fourthly, embodiments of this application provide a communication device that can be applied to the receiving device described in the second aspect to achieve the functions performed by the receiving device. This communication device can be a receiving device, a chip or chip system or system-on-a-chip within the receiving device, etc. The communication device can execute the functions performed by the receiving device through hardware or through corresponding software. The hardware or software includes one or more modules corresponding to the functions described above. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations or cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations or cooperate with the transceiver module to complete the following processing operations, without limitation.

[0023] For example, the transceiver module is used to receive information to be decoded from the transmitting device; wherein the length of the information bit sequence corresponding to the information to be decoded is K; the processing module is used to decode the information to be decoded according to the set of check bit positions to obtain the decoding result.

[0024] The set of check bit positions includes N positions. One position, N positions The positions and E positions Each position corresponds one-to-one, and the E positions are the positions other than the rate matching bit positions among the N positions; Less than or equal to n PC n PC N is the number of check bits; N is the mother code length; E is the length after rate matching; and E positions are... The position is the position with the smallest row weight in the set of the first bit positions. The first bit position set includes the most reliable of the E positions. The row weight corresponding to the position in the first bit position set is the row weight after rate matching.

[0025] Optionally, the transceiver module and processing module of the communication device in the fourth aspect may also perform the corresponding functions in the second aspect or any possible design of the second aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0026] Fifthly, embodiments of this application provide a communication device, which includes one or more processors; the one or more processors are configured to run computer programs or instructions, such that when the one or more processors execute the computer instructions or instructions, the communication method described in any one of the first to second aspects is performed.

[0027] In one possible design, the communication device further includes one or more memories coupled to one or more processors, the memories used to store the aforementioned computer programs or instructions. In one possible implementation, the memories are located outside the communication device. In another possible implementation, the memories are located inside the communication device. In embodiments of this application, the processor and memory may also be integrated into a single device, i.e., the processor and memory may be integrated together. In one possible implementation, the communication device further includes a transceiver for receiving and / or transmitting information.

[0028] In one possible design, the communication device further includes one or more communication interfaces coupled to one or more processors, and the communication interfaces are used to communicate with other modules outside the communication device.

[0029] In a sixth aspect, embodiments of this application provide a communication device, which includes an interface circuit and a logic circuit; the interface circuit is used for inputting and / or outputting information; the logic circuit is used for executing the communication method as described in either the first or second aspect, processing and / or generating information based on the information.

[0030] In a seventh aspect, embodiments of this application provide a computer-readable storage medium storing computer instructions or programs that, when executed on a computer, cause the communication method described in either the first or second aspect to be performed.

[0031] Eighthly, embodiments of this application provide a computer program product containing computer instructions that, when run on a computer, causes the communication method described in either the first or second aspect to be executed.

[0032] Ninthly, embodiments of this application provide a computer program that, when run on a computer, causes the communication method described in either the first or second aspect to be executed.

[0033] In a tenth aspect, embodiments of this application provide a chip, including: a processor coupled to a memory, the memory being used to store programs or instructions, wherein when the program or instructions are executed by the processor, a communication method as described in either the first or second aspect is executed.

[0034] The technical effects of any of the design methods in aspects three through ten are similar to those in aspects one and two above, and will not be elaborated upon further.

[0035] Eleventhly, embodiments of this application provide a communication system that may include communication means for performing the communication as described in the first aspect or any possible design of the first aspect, and communication means for performing the communication as described in the second aspect or any possible design of the second aspect. Attached Figure Description

[0036] Figure 1 is a schematic diagram of a polar code encoding provided in an embodiment of this application;

[0037] Figure 2 is a schematic diagram of a polar code decoding method provided in an embodiment of this application;

[0038] Figure 3 is a schematic diagram of a polarization coupling process provided in an embodiment of this application;

[0039] Figure 4 is a schematic diagram of another polarization coupling process provided in an embodiment of this application;

[0040] Figure 5 is a schematic diagram of the reliability of a polarization core provided in an embodiment of this application;

[0041] Figure 6 is a schematic diagram of a communication system provided in an embodiment of this application;

[0042] Figure 7 is a schematic diagram of encoding and decoding performed by a transmitting end device and a receiving end device according to an embodiment of this application;

[0043] Figure 8 is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0044] Figure 9 is a flowchart illustrating a communication method provided in an embodiment of this application;

[0045] Figure 10 is a schematic diagram of a matrix corresponding to a polarization nucleus provided in an embodiment of this application;

[0046] Figure 11 is a schematic diagram of the matrix corresponding to another polarization nucleus provided in an embodiment of this application;

[0047] Figure 12 is a schematic diagram of a transmitting device provided in an embodiment of this application;

[0048] Figure 13 is a schematic diagram of a receiving device provided in an embodiment of this application;

[0049] Figure 14 is a schematic diagram of another communication device provided in an embodiment of this application;

[0050] Figure 15 is a schematic diagram of the structure of another communication device provided in an embodiment of this application. Detailed Implementation

[0051] Before describing the embodiments of this application, the technical terms involved in the embodiments of this application will be described.

[0052] Polar codes: Polar codes are the first coding scheme that can be rigorously proven to "achieve" the Shannon channel capacity. They have the advantages of good decoding performance and low complexity. Currently, they have been selected by the third generation partnership project (3GPP) standard as the control channel coding scheme for the fifth generation (5G) enhanced mobile broadband (eMBB) scenario.

[0053] Figure 1 below shows a schematic diagram of an 8-bit polar code encoding, also known as a factor graph. The polar code encoding process can include several polar kernel operations. The polar kernel is used to combine two input bits with a matrix. Multiplying them yields two output bits. It can be seen that in the recursive construction process of polar codes, a polar code of length 8 can be considered as a result of coupling two polar codes of length 4, and correspondingly, a polar code of length 4 can be considered as a result of coupling two polar codes of length 2.

[0054] For example, when the input sequence (input from the left) is “00000011”, the output sequence (output from the right) can be “01010101”.

[0055] It is understandable that a polar code of length N can be seen as a result of coupling two polar codes of length N / 2, and a polar code of length N / 2 can be seen as a result of coupling two polar codes of length N / 4.

[0056] Where N is a positive integer.

[0057] The polar code construction process is used to determine the information bit positions and frozen bit positions. The reliability of each subchannel (one subchannel corresponds to one position) can be ranked, and the K positions with the highest reliability are set as information bit positions, while the remaining NK positions are set as frozen bit positions. As shown in Figure 1, taking the construction of a polar code with N=8 and K=4 as an example, assuming the zeroth position is the starting position, the third, fifth, sixth, and seventh positions have the highest reliability, and thus these positions can be designated as information bit positions, with the remaining positions as frozen bit positions; or assuming the first position is the starting position, the fourth, sixth, seventh, and eighth positions have the highest reliability, and thus these positions can be designated as information bit positions, with the remaining positions as frozen bit positions.

[0058] Where K is a positive integer.

[0059] In practice, polar codes can be constructed offline using reliability sequences or obtained online using methods such as Gaussian approximation; this application does not limit this to any particular method.

[0060] In this application, unless otherwise specified, the starting position of the polar code is the zeroth position. This application is also applicable to scenarios where the starting position of the polar code is the first position.

[0061] The receiving device can decode the encoded polar code using a Successive Cancellation (SC) decoding algorithm. During SC decoding, the bit value of the information bit is determined by progressively calculating the log likelihood ratio (LLR) of the information bits. For example, if LLR > 0, the bit value of the information bit can be determined to be 0; if LLR < 0, the bit value of the information bit can be determined to be 1. Furthermore, for frozen bits, the frozen bit is set to 0 regardless of its LLR value.

[0062] For example, the SC decoding process can be illustrated in Figure 2, which includes eight computation nodes: four f nodes and four g nodes. The computation of an f node requires two LLR terms to be input to its right, and the computation of a g node requires two LLR terms to be input to its right and one "partial sum" term to be input above it. The output can only be calculated after all input terms have been calculated. The receiving device can receive the signal from the right side of Figure 2. The received signal passes through the eight computation nodes sequentially to obtain the polar code decoding, i.e., the decoding order is: ①→②→③→④.

[0063] The encoding matrix of a polar code: The encoding matrix of a polar code can be represented as follows (that is, G) N G2 is the nth power of the Kronecker product, where... n = log₂N).

[0064] in, This means that the element in the first row and first column of G2 is 1, the element in the first row and second column is 0, the element in the second row and first column is 1, and the element in the second row and second column is 1. That is, G2 contains 4 elements, each of which is either 0 or 1.

[0065] It is understood that all elements in the matrix in this application are either "0" or "1". For example, for an N-row N-column matrix, there will be N×N elements, and each element is either 0 or 1. For the sake of convenience, no spaces are left between columns without affecting the understanding of the scheme.

[0066] For example, taking an information bit sequence of length K as an example, the information bit sequence can be mapped onto a first sequence of length N (such as u). The first sequence can be encoded using a polar code encoding matrix, and the encoded information bit sequence can be represented as d = uG. N .

[0067] Polarization nucleus: G N It can also be described as a polarization nucleus of length N, G N This can be achieved by coupling two polarization kernels of length N / 2. For example, with N = 32, a polarization kernel of length 32 can be obtained by coupling two polarization kernels of length 16, and a polarization kernel of length 16 can be obtained by coupling two polarization kernels of length 8, as shown in Figure 3. Furthermore, a polarization kernel of length N can be used to implement SC decoding through Nlog2N fg operations.

[0068] For example, Figure 4 below illustrates the coupling process of a polarization nucleus of length N. In the portion corresponding to each polarization nucleus, the left side represents the matrix corresponding to the polarization nucleus, and the right side represents the factor graph corresponding to the polarization nucleus. As shown in Figure 4(a), taking N=4 as an example, there are two polarization nuclei G2 of length 2. The matrix corresponding to G2 can be... The factor graph corresponding to G2 can be shown in Figure 4(a). Two polarization nuclei of length 2 can be coupled before polarization (as shown in the dashed box in Figure 4(a)) to obtain a polarization nucleus of length 4 (i.e., G4). Alternatively, as shown in Figure 4(b), taking N as 2 as an example, there are two polarization nuclei G1 of length 1. The matrix corresponding to G1 can be [1]. The factor graph corresponding to G1 can be shown in Figure 4(b). Two polarization nuclei of length 1 can be coupled before polarization (as shown in the dashed box in Figure 4(b)).

[0069] Optionally, the polarization kernel mentioned above can be an Arikan polarization kernel or a non-regular polarization kernel. The Arikan polarization kernel can be determined based on N, while the non-regular polarization kernel can be determined based on N, K, or the channel state. In other words, compared to the construction of the Arikan polarization kernel, the construction of the non-regular polarization kernel is more complex, resulting in higher computational complexity for reliability and line weight.

[0070] A polarization nucleus of length N can be obtained by extending a polarization nucleus of length less than N. For example, a polarization nucleus of length 8 can be obtained by extending a polarization nucleus of length 5.

[0071] For example, taking N=5 and K=2, an Arikan polarization kernel of length 5 can be shown in Figure 5(a), and a non-regular polarization kernel of length 5 can be shown in Figure 5(b). The numbers in Figure 5 represent the reliability of each sub-channel (one horizontal line in Figure 5 corresponds to one sub-channel). The two positions with the highest reliability can be set as information bit positions, such as the 3rd and 4th positions. In Figure 5(a), the reliability of the 3rd sub-channel (i.e., 15.55) is less than that of the 3rd sub-channel in Figure 5(b) (i.e., 21.42). Therefore, the decoding performance of the information bit sequence encoded by the non-regular polarization kernel of length N is better than that of the information bit sequence encoded by the Arikan polarization kernel of length N.

[0072] The matrix corresponding to (a) in Figure 5 can be: The matrix corresponding to (b) in Figure 5 can be:

[0073] It is understandable that the transmitting device can use a non-regular polarization kernel of length N to encode the information bit sequence. Since the sub-channel corresponding to the position where the information bits are placed has high reliability, the reliability of communication can be improved, thereby improving the decoding performance.

[0074] When performing parity-check polar code encoding, the positions of the PC bits can be determined using a lossy reliability approach to improve the code spectrum. Specifically, the minimum row weight w corresponding to the positions of K information bits can be determined. min From the most reliable K bit positions, the minimum row overlap w min From the corresponding set of bit positions, select the most reliable one. Each bit position is used as the position of the PC bit, according to the predefined number of PC bits n in the communication protocol. PC The remaining The position of each PC bit can be determined from the most reliable (K+n) PC From ) bit positions, select the least reliable one. The position of each bit is used as the position of the PC bit. Additionally, if w min The number of positions included in the corresponding bit position set is less than (e.g. w) min The corresponding set of bit positions includes a positions, and a is less than 1. ), can w min The bit position in the corresponding bit position set is used as the position of the PC bit, and thus it can be obtained from 2w min Choose the most reliable one from the corresponding set of bit positions. Each bit position is used as the position of the PC bit.

[0075] However, the above w min The determination is based on the line weight of the polar code before rate matching (i.e., w). min Encoding and rate matching based on the positions of the PC bits (determined by the row weights of the encoding matrix of length N) will lead to a decrease in decoding performance.

[0076] Therefore, how to better determine the position of the PC bit in order to improve the code spectrum and decoding performance has become an urgent problem to be solved.

[0077] This application provides a communication method, which includes: a transmitting device performing polar coding on an information bit sequence of length K according to a set of check bit positions to obtain an encoded bit sequence; and outputting one or more bits of the encoded bit sequence. The set of check bit positions includes N positions. One position, N positions The positions and E positions Each position corresponds one-to-one, and the E positions are the positions other than the rate matching bit positions among the N positions; Less than or equal to n PC n PC N is the number of check bits; N is the mother code length; E is the length after rate matching; and E positions are... The position is the position with the smallest row weight in the set of the first bit positions. The first bit position set includes the most reliable of the E positions. The row weight corresponding to the position in the first bit position set is the row weight after rate matching.

[0078] In this embodiment of the application, the transmitting device can select the most reliable location from E locations. Determine the position with the smallest row weight. N positions are used to determine the set of check bit positions based on the correspondence between the N and E positions, so as to achieve polar coding of the information bit sequence. On the one hand, the row weight corresponding to the positions in the first set of bit positions can be the row weight after rate matching, which can make the set of check bit positions include... The position represents the position with the smallest line weight in the rate-matched polar code. This position can reduce line weight loss, thereby improving the spectral performance of rate-matched polar codes and also improving decoding performance; on the other hand, compared to w min (w min The position corresponding to the minimum row weight at the position in the first sequence is determined. Of the E positions, this application can directly determine the most reliable one. The position with the smallest row weight This position can help avoid appearing as much as possible. Greater than w min This allows us to determine the number of corresponding positions, simplifying the implementation and reducing its complexity.

[0079] The first sequence includes positions in the reliability sequence of length N, excluding the pre-frozen bit positions and the rate matching bit positions.

[0080] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0081] The communication method provided in this application can be used in any communication system, such as a 3GPP communication system, for example, a long term evolution (LTE) system, or a 5G mobile communication system, a hybrid LTE and 5G network system, a new radio (NR) system, an NR vehicle-to-everything (V2X) system, a device-to-device (D2D) communication system, a machine-to-machine (M2M) communication system, an Internet of Things (IoT) system, a narrow band Internet of Things (NB-IoT) system, eMBB, ultra-reliable and low-latency communication (URLLC), enhanced machine-type communication (eMTC), and various types of future communication systems. It can also be a non-terrestrial network (NTN) system (such as a satellite communication system), a non-3GPP communication system, etc., without limitation.

[0082] The communication method provided in this application can be applied to various communication scenarios. For example, it can be applied to one or more of the following communication scenarios: coding of control channels, coding of data channels, etc., without limitation.

[0083] The communication system provided in the embodiments of this application will be described below with reference to Figure 1.

[0084] Figure 6 is a schematic diagram of a communication system provided in an embodiment of this application. As shown in Figure 6, the communication system may include at least one terminal device and at least one network device.

[0085] In Figure 6, the terminal device can be located within the beam / cell coverage area of ​​the network device, and the network device can provide communication services to the terminal device. For example, the network device can use channel coding to encode downlink data and then transmit it to the terminal device via air interface after constellation modulation (i.e., the network device is the transmitting end device, and the terminal device is the receiving end device); the terminal device can also use channel coding to encode uplink data and then transmit it to the network device via air interface after constellation modulation (i.e., the terminal device is the transmitting end device, and the network device is the receiving end device). It is understood that when network devices communicate with each other, or when terminal devices communicate with each other, communication can also be based on channel coding; that is, the transmitting end device and the receiving end device can both be network devices or both be terminal devices, without restriction.

[0086] The terminal device can be a device with wireless transceiver capabilities or a chip or chip system that can be installed on the device. It allows users to access the network and is used to provide voice and / or data connectivity to users. The terminal device can also be called user equipment (UE), subscriber unit, terminal, mobile station (MS), or mobile terminal (MT), etc., or any device used to provide voice or data connectivity to users, and can also be an Internet of Things (IoT) device. For example, terminal devices include handheld devices with wireless connectivity, vehicle-mounted devices, etc.

[0087] For example, terminal devices can be mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices (such as smartwatches, smart bracelets, pedometers, smart glasses, etc.), in-vehicle equipment (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), satellite terminals, virtual reality (VR) devices, augmented reality (AR) devices, smart point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (UE), reduced capability user equipment (REDCAP UE), wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity meters, etc.), smart robots, robotic arms, workshop equipment, wireless terminals in autonomous driving, wireless terminals in telemedicine, and smart grids. Wireless terminals can be used in various applications, including wireless terminals in grids, transportation safety, smart cities, smart homes, and flying equipment (e.g., intelligent robots, hot air balloons, drones, airplanes). Terminal devices can also be vehicle-mounted devices, such as complete vehicle units, vehicle-mounted modules, vehicle-mounted chips, on-board units (OBUs) or telematics boxes (T-BOXs), vehicles with vehicle-to-vehicle (V2V) communication capabilities, intelligent connected vehicles, drones with UAV-to-UAV (U2U) communication capabilities, terminal devices in future networks, or terminal devices in future evolved public land mobile networks (PLMNs). Terminal devices can also be other devices with terminal functions; for example, a terminal device can also be a device that performs terminal functions in D2D communication, without limitation.

[0088] It is understood that the embodiments of this application do not limit the device form of the terminal. The device used to implement the functions of the terminal device can be the terminal device itself; it can also be a device that supports the terminal device in implementing the functions, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In the embodiments of this application, the chip system can be composed of chips or can include chips and other discrete devices. All or part of the functions of the terminal device in this application can also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (e.g., a cloud platform).

[0089] In Figure 6, the network device can be any device deployed in the access network capable of wireless communication with terminal devices. It can also be a chip or chip system that can be configured within such a device, a logical node or module, or a function implemented in software. Its main responsibilities include air interface-side wireless physical control, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network device can be either a wired access device or a wireless access device.

[0090] For example, a network device can consist of one or more access network (AN) / radio access network (RAN) nodes. AN / RAN nodes can be various types of base stations, such as: satellite base stations, evolved Node Bs (gNBs), transmission reception points (TRPs), evolved Node Bs (eNBs), radio network controllers (RNCs), Node Bs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved Node Bs, or home Node Bs (HNBs), macro base stations, micro base stations, pico base stations, small cells, relay stations, balloon stations, drone stations, wireless backhaul nodes, base band units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It is understood that network devices can be terrestrial devices or non-terrestrial devices (such as satellites, drones, high-altitude communication equipment, etc.). Furthermore, in communication systems employing different wireless access technologies, the names of network devices with base station functions may differ, and this application does not impose any restrictions on this.

[0091] In another example, the network equipment may include a BBU and a remote radio unit (RRU). The BBU and RRU can be located in different places; for example, the RRU can be moved remotely to a high-traffic area, while the BBU is located in the central equipment room. The BBU and RRU can also be located in the same equipment room. The BBU and RRU can also be different components under the same rack.

[0092] In another example, the network device can be a device that includes centralized unit (CU) nodes, distributed unit (DU) nodes, or both CU and DU nodes. For instance, the network device can be logically divided into CUs and DUs, with some protocol layer functions centrally controlled by the CU, and the remaining partial or complete protocol layer functions distributed in the DU, which is centrally controlled by the CU. The CU and DU can be separate entities or included in the same network element, such as a BBU. Furthermore, the centralized unit (CU) can be further divided into a control plane (CU-CP) and a user plane (CU-UP).

[0093] In another example, the network device may also be a device that includes a radio unit (RU), or a device that includes a CU, a DU, and a RU. The RU may be included in a radio frequency device or radio frequency unit, such as an RRU, an active antenna unit (AAU), or a remote radio head (RRH).

[0094] It is understood that CU (or CU-CP and CU-UP), DU, or RU may have different names in different systems, but those skilled in the art will understand their meaning. For example, in an open radio access network (O-RAN) system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules.

[0095] Based on the above description of the terminal device and network device, optionally, the communication method provided in the embodiments of this application can be implemented by the aforementioned terminal device or network device, or by components of the terminal device or network device, such as by application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or software (such as program code in memory) deployed in the terminal device or network device, without limitation.

[0096] Optionally, in this embodiment, the transmitting device (or source) and the receiving device (or sink) can encode and decode using the process shown in Figure 7 below. The transmitting device can be any terminal device or network device in the communication system shown in Figure 6, and the receiving device can also be any terminal device or network device in the communication system shown in Figure 6.

[0097] The transmitting device can perform source coding on its own generated bits to obtain a source bit stream, then perform channel coding on the source bit stream, and finally modulate it before transmitting the modulated symbols to the receiving device through a noisy channel. When the receiving device receives the modulated symbols through the noisy channel, it can demodulate them, then perform channel decoding to recover the source bit stream, and finally perform source decoding to obtain the decoding result.

[0098] In specific implementation, as shown in Figure 6, each terminal device and network device can adopt the composition structure shown in Figure 8, or include the components shown in Figure 8. Figure 8 is a schematic diagram of the composition of a communication device 800 provided in an embodiment of this application. The communication device 800 can be a terminal device or a chip or system-on-a-chip in a terminal device; it can also be a network device or a chip or system-on-a-chip in a network device. As shown in Figure 8, the communication device 800 includes a processor 801, a transceiver 802, and a communication line 803.

[0099] Optionally, the communication device 800 may also include a memory 804. The processor 801, memory 804, and transceiver 802 can be connected via a communication line 803.

[0100] The processor 801 is one or more of the following: a central processing unit (CPU), an application-specific integrated circuit (ASIC), a network processor (NP), a digital signal processor (DSP), a microprocessor unit (MPU), a microcontroller unit (MCU), a graphics processing unit (GPU), a microprocessor, a microcontroller, a programmable logic device (PLD), an artificial intelligence processor (AI processor), or a neural processing unit (NPU). The processor 801 can also be other devices with processing capabilities, such as circuits, devices, or software modules, without limitation.

[0101] Transceiver 802 is used to communicate with other devices or other communication networks. These other communication networks can be Ethernet, radio access network (RAN), wireless local area network (WLAN), etc. Transceiver 802 can be a module, circuit, transceiver, or any device capable of enabling communication.

[0102] Communication line 803 is used to transmit information between the components included in communication device 800.

[0103] The memory 804 is used to store instructions. These instructions can be computer programs.

[0104] The memory 804 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions. It can also be a cache, random access memory (RAM), or other type of dynamic storage device that can store information and / or instructions. It can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM), or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, universal optical discs, Blu-ray discs, etc.), magnetic disk storage media, or other magnetic storage devices, etc., without limitation.

[0105] The memory 804 can exist independently of the processor 801 or be integrated with the processor 801. The memory 804 can be used to store instructions, program code, or some data. The memory 804 can be located inside or outside the communication device 800, without limitation. The processor 801 is used to execute the instructions stored in the memory 804 to implement the communication method provided in the following embodiments of this application.

[0106] In one example, processor 801 may include one or more CPUs, such as CPU0 and CPU1 in Figure 8.

[0107] As an optional implementation, the communication device 800 may include multiple processors, for example, in addition to the processor 801 in FIG8, it may also include a processor 807.

[0108] As an optional implementation, the communication device 800 also includes an output device 805 and an input device 806. For example, the input device 806 is a device such as a keyboard, mouse, microphone, or joystick, and the output device 805 is a device such as a display screen or speaker.

[0109] The communication device 800 can be a desktop computer, a portable computer, a web server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device with a similar structure to that shown in Figure 8. Furthermore, the composition shown in Figure 8 does not constitute a limitation on the communication device. In addition to the components shown in Figure 8, the communication device may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0110] In this embodiment of the application, the chip system may be composed of chips or may include chips and other discrete devices.

[0111] Furthermore, the actions, terms, etc., involved in the various embodiments of this application can be referenced interchangeably without limitation. The message names or parameter names in the messages exchanged between the various devices in the embodiments of this application are merely examples, and other names may be used in specific implementations without limitation.

[0112] The communication method provided in the embodiments of this application will be described below with reference to the communication system shown in Figure 6 and Figure 9. The transmitting device can be any terminal device or network device in the communication system shown in Figure 6, and the receiving device can also be any terminal device or network device in the communication system shown in Figure 6. The transmitting or receiving device described in the following embodiments may include the components shown in Figure 7.

[0113] Figure 9 is a flowchart of a communication method provided in an embodiment of this application. As shown in Figure 9, the method may include:

[0114] Step 901: The transmitting device performs polar coding on the information bit sequence of length K according to the set of check bit positions to obtain the coded bit sequence.

[0115] The set of check bit positions includes N positions. There are 16 positions. N is the length of the master code for data transmission (or can be described as the master code length), and N is a positive integer. For example, N can be 16; or N can be 32; or N can be 1024.

[0116] Here, the N positions can be understood as the 0th, 1st, ..., N-1th positions in a sequence of length N (such as a master code, a encoded bit sequence, or a polar code) used to carry bits (such as information bits or check bits).

[0117] In this application, the position numbers can be sorted starting from 0. For example, the position number of the 0th position out of N positions can be 0, the position number of the 1st position can be 1, ..., and the position number of the (N-1)th position can be N-1. This application is also applicable to scenarios where the position numbers are sorted starting from 1. For example, the position number of the 1st position out of N positions can be 1, the position number of the 2nd position can be 2, ..., and the position number of the Nth position can be N, without restriction.

[0118] in, greater than or equal to 0 and less than or equal to n PC an integer, n PC n is the number of parity bits. PC It is a positive integer. That is to say, Less than or equal to n PC .

[0119] In one example, with n PC Taking 30 as an example, It can be 20; or, It can be 30.

[0120] In another example, with n PC Taking 1 as an example, It can be 1.

[0121] Optional, in equal to n PC In this case, the set of check bit positions can include N positions. One location; in Less than n PC In this case, the set of check bit positions can include a first subset of check bit positions and a second subset of check bit positions. The first subset of check bit positions can include N positions. The second subset of check bit positions can include positions from the N positions other than the first subset of check bit positions. There are N positions. The subset of the second check bit positions can be determined based on a reliability sequence of length N. The specific determination method can be found in the description of the subset of the second check bit positions below, and will not be repeated here.

[0122] In this application, the reliability sequence is used to indicate the reliability of each bit position in the sequence. The smaller the index of each bit position in the reliability sequence, the lower the reliability of that bit position. Similarly, the larger the index of each bit position in the reliability sequence, the higher the reliability of that bit position.

[0123] Optionally, the reliability sequence can be predefined by the protocol. For example, the sending device can select a reliability sequence of length N from one or more predefined reliability sequences.

[0124] For example, taking N=16, the 16 positions arranged in ascending order can be {0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15}, and the reliability sequence of length 16 can be {0 1 2 3 4 6 10 5 7 11 8 12 14 9 13 15}. Among these, the reliability corresponding to position 0 is the lowest, and the reliability corresponding to position 15 is the highest.

[0125] Among the N positions The positions and E positions Each position corresponds one-to-one with the others, and the E positions are the positions other than the rate matching bit positions among the N positions.

[0126] Among them, E is the length after rate matching, and E is a positive integer. Exemplarily, the transmitting end device may determine the mother code length N = max(min([N M , N R , N max ), 32) according to the length K of the information bit sequence and the length E after rate matching. N M is related to the code rate R = K / E and N DM . If E ≤ 9 / 8 × N DM and R < 9 / 16, then N M = N DM / 2; otherwise, N M = N DM . N R is related to K and the lowest code rate R min . R min = 1 / 8. N max = 1024. is rounding up. K is a positive integer.

[0127] Among them, the information bit sequence may include information bits and CRC bits. At this time, K may be the sum of the number of information bits and the number of CRC bits included in the information bit sequence. Or the information bit sequence may include only the information bits themselves. At this time, K may be the number of information bits included in the information bit sequence. <​​​​​​​For example, taking the rate-matching bit positions in N positions as positions 0 and 1, the E positions can be positions 2, 3, ..., N-1 out of the N positions. That is, positions 2, 3, ..., N-1 out of the N positions can be described as positions 0, 1, ..., E-1 out of the E positions. Assume... It is 1, and in E positions If the first position is the first of E positions, then among the N positions... The position can be the 3rd position out of N positions (that is, the 1st position out of E positions corresponds to the 3rd position out of N positions). Or, assume... It is 2, and in E positions If the first and third positions out of E positions are given, then the N positions... The position can be the 3rd and 5th positions out of N positions (that is, the 1st position out of E positions corresponds to the 3rd position out of N positions, and the 3rd position out of E positions corresponds to the 5th position out of N positions).

[0131] It is understandable that the transmitting device can determine one of the E positions. Given N positions, determine one of them. This allows us to determine the positions of the check bits in a mother code of length N (equivalent to the positions included in the aforementioned set of check bit positions), thereby enabling polar coding of the information bit sequence.

[0132] Among them, in E positions The position is the position with the smallest row weight in the set of the first bit positions. One position.

[0133] The first bit position set includes the most reliable of the E positions. There are E positions. For example, with E = 15, the E positions can be sorted from lowest to highest reliability as follows: {0 1 2 3 5 9 4 6 10 7 11 13 8 12 14}. Assuming K = 8, If the value is 1, the first bit position set can include the most reliable of the E positions. The set of positions, i.e., the first bit position, can be {4 6 10 7 11 13 8 12 14}.

[0134] In this application, the row weight corresponding to each of the E positions can be understood as the row weight (i.e., the number of non-zero elements in each row of the matrix) of a polarization kernel of length E (such as an Arikan polarization kernel or a non-regular polarization kernel). For example, the row weight corresponding to the e-th position of the E positions can be the row weight of the e-th row of the matrix of a polarization kernel of length E, where e = 0, 1, ..., E-1.

[0135] The row weight corresponding to each of the E positions can also be understood as the row weight after rate matching (i.e., the E positions are the positions other than the rate matching bit positions among the N positions); similarly, the row weight corresponding to the positions in the first bit position set is the row weight after rate matching.

[0136] In addition, the row weight corresponding to each of the N positions can be understood as the row weight before rate matching.

[0137] For example, let E be 15. Taking the first bit position set as {4 6 10 7 11 13 8 12 14} as an example, the matrix corresponding to the polarization kernel of length E can be shown in Figure 10. Then, the row weight of {6 10 7 11 12 14} is 4, the row weight of {4} is 5, and the row weight of {8 13} is 8. The E positions... The position can be the one with the smallest row weight in the set of the first bit positions. One position, that is, one of the E positions. The position can be any one of the 6th, 7th, 10th, 11th, 12th, and 14th positions out of E positions. For example, in E positions... The position can be the 14th position out of E positions.

[0138] In this application, the matrix corresponding to a polarization kernel of length E is a square matrix of length E rows and length E; similarly, the matrix corresponding to a polarization kernel of length N is a square matrix of length N rows and length N columns.

[0139] Among them, the row weight is the smallest in the first bit position set. The position can be understood as, if the set of the first bit positions contains... The row weight at each position is minimized and equal, in Greater than or equal to In this case, it can be obtained from this Determined from each position The position with the smallest row weight in the first bit position set. One location; in Less than In this case, the row positions corresponding to the positions in the first bit position set can be arranged in ascending order to determine the first position. The position with the smallest row weight in the first bit position set. There are 10 positions. Then, the position with the smallest row weight in the first bit position set is... The row weights corresponding to any two positions in the set of first bit positions can be the same, or the row weights of the two positions in the set of first bit positions can be the smallest. The row weights corresponding to any two positions in the set of first bit positions can be different, or the row weight with the smallest row weight in the set of first bit positions can be different. There are no restrictions on the number of rows where at least two of the positions correspond to the same row weight.

[0140] For example, taking N as 16 and E as 15, assume that the E positions are the 1st to the 15th positions out of the N positions, and that the E positions... If the position is the 14th position out of E positions, then the position out of N positions... The position can be the 15th position out of N positions, that is, the set of check bit positions can be {15}.

[0141] Based on the set of check bit positions determined above, the transmitting device can determine the check bit corresponding to each check bit position (the check bit position can be included in the set of check bit positions) according to the preset check relationship, and obtain the encoded bit sequence according to the information bit corresponding to each information bit position.

[0142] The information bit position can be included in the information bit position set.

[0143] Optionally, the transmitting device can determine the information bit position set based on the check bit position set.

[0144] The information bit position set may include positions in the second bit position set other than the check bit position set.

[0145] The second set of bit positions can include the most reliable (K+n) bits in the first sequence. PC ) positions.

[0146] The first sequence can include positions other than the pre-frozen bit position and the rate matching bit position in a reliability sequence of length N. For example, with N=16, the reliability sequence can be {0 1 2 3 4 6 10 5 7 11 8 12 14 9 13 15}. Assuming that the pre-frozen bit position and the rate matching bit position in the reliability sequence are {0}, then the first sequence can be {1 2 3 4 6 10 5 7 11 8 12 14 9 13 15}.

[0147] For example, taking the first sequence as {1 2 3 4 6 10 5 7 11 8 12 14 9 13 15}, and the set of check bit positions as {15}, assuming K is 8 and... The second bit position set can be {5 7 11 8 12 14 9 13 15}, and the information bit position set can include positions other than {15} in the second bit position set, that is, the information bit position set can be {5 7 11 8 12 14 9 13}.

[0148] For example, taking the 7-interval check as an example, the check equation can be u 15 =u8, meaning that the parity bit at position 15 out of N positions can be used to check the information bit at position 8 out of N positions. It can also be described as follows: the parity bit at position 14 out of E positions can be used to check the information bit at position 7 out of E positions, where position 15 out of N positions corresponds to position 14 out of E positions, and position 8 out of N positions corresponds to position 7 out of E positions.

[0149] Step 902: The transmitting device outputs one or more bits of the encoded bit sequence; correspondingly, the receiving device receives the decoding information from the transmitting device.

[0150] Optionally, the transmitting device can perform rate matching on the encoded bit sequence to obtain a rate-matched sequence.

[0151] Optionally, the transmitting device can modulate the rate-matched bit sequence to obtain a modulated symbol sequence; or, the transmitting device can interleave the rate-matched bit sequence to obtain an interleaved bit sequence, and then modulate the interleaved bit sequence to obtain a modulated symbol sequence.

[0152] It is understandable that the modulation symbol sequence sent by the transmitting device to the receiving device may be affected by noise and other interference when transmitted through the channel. The demodulated information received by the receiving device is a modulation symbol sequence affected by noise and other interference.

[0153] The length of the information bit sequence corresponding to the information to be decoded is K.

[0154] Step 903: The receiving device decodes the information to be decoded according to the set of check bit positions to obtain the decoding result.

[0155] Optionally, if the transmitting device interleaves the rate-matched bit sequence, the receiving device can deinterleave the information to be decoded to obtain a deinterleaved bit sequence, and then de-rate-match the deinterleaved bit sequence to obtain a de-rate-matched bit sequence; otherwise, the receiving device can de-rate-match the information to be decoded to obtain a de-rate-matched bit sequence.

[0156] Optionally, the receiving device can decode the rate-matching bit sequence based on the set of check bit positions to obtain the decoding result.

[0157] The method by which the receiving device determines the set of check bit positions in this application can be found in the method by which the sending device determines the set of check bit positions in this application, and will not be repeated here.

[0158] It is understandable that the set of check bit positions determined by the transmitting device is consistent with the set of check bit positions determined by the receiving device.

[0159] The receiving device can determine the information bit position set based on the check bit position set; and decode the information to be decoded based on the information bit position set and the check bit position set to obtain the decoding result.

[0160] The method by which the receiving device determines the set of information bit positions can be referred to the method by which the sending device determines the set of information bit positions in this application, and will not be repeated here.

[0161] It is understandable that the set of information bit positions determined by the transmitting device is consistent with the set of information bit positions determined by the receiving device.

[0162] Based on the communication method shown in Figure 9, the transmitting device can select the most reliable location from E locations. Determine the position with the smallest row weight. N positions are used to determine the set of check bit positions based on the correspondence between the N and E positions, so as to achieve polar coding of the information bit sequence. On the one hand, the row weight corresponding to the positions in the first set of bit positions can be the row weight after rate matching, which can make the set of check bit positions include... The position represents the position with the smallest line weight in the rate-matched polar code. This position can reduce line weight loss, thereby improving the spectral performance of rate-matched polar codes and also improving decoding performance; on the other hand, compared to wmin (w min The position corresponding to the minimum row weight in the first sequence mentioned above is determined from the position. Of the E positions, this application can directly determine the most reliable one. The position with the smallest row weight This position can help avoid appearing as much as possible. Greater than w min This allows us to determine the number of corresponding positions, simplifying the implementation and reducing its complexity.

[0163] Based on the communication method shown in Figure 9, optionally, among the E locations The position can be the one with the smallest row weight in the set of the first bit positions. The sending device can arrange the row elements corresponding to the positions in the first bit position set in ascending order to determine the positions at the beginning. The positions are among the E positions. There are E positions. Among these, the first set of bit positions may contain multiple positions corresponding to the same row weight. If the number of positions corresponding to the same row weight is greater than the actual required number, the E positions can be determined based on their reliability or sequence number. This application provides two possible implementations: [Number of positions].

[0164] In the first possible implementation, among the E positions The position can be the most reliable one among the positions with the smallest line weight in the first bit position set. Specifically, the transmitting device can arrange the row weights corresponding to the positions in the first bit position set in ascending order. For positions with the same row weight, they can be arranged in descending order of reliability, thus determining the positions at the beginning. The positions are among the E positions. One position.

[0165] For example, let E be 15. Taking the first bit position set as {4 6 10 7 11 13 8 12 14} as an example, the row weight of {6 10 7 11 12 14} is 4, the row weight of {4} is 5, and the row weight of {8 13} is 8. The positions in the first bit position set can be arranged as {14 12 11 7 10 6 4 13 8}. The E positions... The position can be the first position in {14 12 11 7 10 6 4 13 8}, which is {14}.

[0166] Based on the first possible implementation, the position with higher reliability can be determined as the parity bit position, which can improve the reliability of communication and at the same time improve decoding performance.

[0167] In the second possible implementation, among the E positions The position can be the position with the largest index among the positions with the smallest row weight in the set of first bit positions. Specifically, the transmitting device can arrange the row weights corresponding to the positions in the first bit position set in ascending order. For positions with the same row weight, they can be arranged in descending order of their position numbers, thus determining which position comes first. The positions are among the E positions. One position.

[0168] For example, let E be 15. Taking the first bit position set as {4 6 10 7 11 13 8 12 14} as an example, the row weight of {6 10 7 11 12 14} is 4, the row weight of {4} is 5, and the row weight of {8 13} is 8. The positions in the first bit position set can be arranged as {14 12 11 10 7 6 4 13 8}. The E positions... The position can be the first one in {14 12 11 10 7 6 4 13 8}, which is {14}.

[0169] Based on the second possible implementation, the position with the larger sequence number can be determined as the parity bit position. This allows the parity bit to verify the information bit with the larger sequence number, thereby improving the parity bit's verification capability, reducing the bit error rate, and thus improving the reliability of communication.

[0170] It is understandable that, based on the E positions determined by the two possible implementations mentioned above... The positions may be the same or different. For example, taking the position with the smallest row weight in the first bit position set as {6 10 7}, based on the first possible implementation, it is possible to determine the E positions. The positions can be {7}, and based on the second possible implementation, the positions of E can be determined. The position can be {10}.

[0171] Based on the description of the above communication method, this application provides two possible embodiments for determining E locations. In different embodiments, E and The values ​​are different:

[0172] In the first possible embodiment, taking E as 15 as an example, the E positions can be sorted in ascending order of reliability as follows: {0 1 2 3 5 9 4 6 10 7 11 13 8 12 14}. Assuming K is 8, If the value is 1, the first bit position set can be the most reliable among E positions. The set of positions, i.e., the first bit positions, can be {4 6 10 7 11 13 8 12 14}; furthermore, the E positions... The position can be the one with the smallest row weight in the set of the first bit positions. There are 15 positions. Among them, the matrix corresponding to the polarization kernel of length 15 can be shown in Figure 10, where the row weight of {6 10 7 11 12 14} is 4, the row weight of {4} is 5, and the row weight of {8 13} is 8.

[0173] In the first example, among the E positions The position can be the most reliable one among the positions with the smallest line weight in the first bit position set. The position is {14}.

[0174] In the second example, among the E positions The position can be the position with the largest index among the positions with the smallest row weight in the set of first bit positions. The position is {14}.

[0175] For example, a verification equation u can be used. 14 =u7 enables the verification of the information bit sequence, that is, the information bit in the 7th position of the E positions can be verified by the check bit in the 14th position of the E positions.

[0176] This application provides a possible simulation design, where N is 16. Taking E as 15 and K as 8 as an example, the transmitting device can perform polar coding on multiple first information bit sequences based on the parity bit position set 0 to obtain multiple first coded bit sequences 0; wherein, the parity bit position set 0 can be based on the E positions determined in the first possible embodiment. The positions are determined (i.e., the E positions include the positions in the N positions excluding the check bit positions, and the E positions are determined by...). One position and N positions Each position corresponds one-to-one.

[0177] The transmitting device can perform polar coding on multiple first information bit sequences based on the parity bit position set 1 to obtain multiple first coded bit sequences 1; wherein, the parity bit position set 1 may include the row weight w in the second bit position set.min The most reliable position The second set of bit positions can include the most reliable (K+n) bits in a reliability sequence of length 16. PC ) = 9 positions, w min It is the minimum row weight corresponding to the position other than the pre-frozen bit position and the rate matching bit position in the reliability sequence of length 16.

[0178] In other words, the set of check bit positions 0 is determined based on the row weight after rate matching, and the set of check bit positions 1 is determined based on the row weight before rate matching.

[0179] In this context, the length of each of the multiple first information bit sequences can be 8. For example, first information bit sequence 0 can be 00000000, first information bit sequence 1 can be 00000001, first information bit sequence 2 can be 00000010, first information bit sequence 3 can be 00000011, and so on.

[0180] The minimum code weight corresponding to multiple first coded bit sequences 0 can be 4, the minimum code weight corresponding to multiple first coded bit sequences 1 can be 4, and the number of first coded bit sequences corresponding to a code weight of 4 (or can be understood as the minimum code weight) is shown in Table 1:

[0181] Table 1

[0182] As shown in Table 1, the number of 0 bits in the first encoded bit sequence corresponding to a code weight of 4 (i.e., 18) is less than the number of 1 bits in the first encoded bit sequence corresponding to a code weight of 4 (i.e., 36). By polar coding multiple first information bit sequences based on the parity bit position set 00, the transmitting device can reduce the number of 0 bits in the first encoded bit sequence corresponding to the minimum code weight. In other words, by polar coding the information bit sequences based on the parity bit position set determined in the first possible embodiment, the transmitting device can improve the spectral performance of the polar code, thereby improving communication performance.

[0183] In the second possible embodiment, taking E as 20 as an example, the E positions can be sorted in ascending order of reliability as follows: {0 1 2 3 5 6 10 4 7 11 12 15 8 9 13 14 16 17 18 19}. Assuming K is 10, If the value is 2, then the first bit position set can include the most reliable of the E positions. The set of positions, i.e., the first bit positions, can be {7 11 12 15 8 9 13 14 16 17 18 19}. Furthermore, the E positions... The position can be the one with the smallest row weight in the set of the first bit positions. There are 10 positions. Among them, the matrix corresponding to the polarization kernel of length 20 can be shown in Figure 11. The row weight of {11 12 15 8 14 13} is 4, the row weight of {7} is 6, and the row weight of {9 16 17 18 19} is 8.

[0184] In the first example, among the E positions The position can be the most reliable one among the positions with the smallest line weight in the first bit position set. The positions are {14 13}.

[0185] For example, a verification equation u can be used. 14 =u8,u 13 =u 11 To achieve verification of the information bit sequence, the information bit at position 8 out of E can be verified using the check bit at position 14 out of E, and the information bit at position 11 out of E can be verified using the check bit at position 13 out of E.

[0186] In the second example, among the E positions The position can be the position with the largest index among the positions with the smallest row weight in the set of first bit positions. The positions are {14 15}.

[0187] For example, a verification equation u can be used. 14 =u8,u 15 =u 11 To achieve verification of the information bit sequence, the information bit at position 8 out of E can be verified using the check bit at position 14 out of E, and the information bit at position 11 out of E can be verified using the check bit at position 15 out of E.

[0188] This application provides a possible simulation design, where N is 32. Taking E as 20 and K as 10 as an example, the transmitting device can perform polar coding on multiple second information bit sequences based on the check bit position set 0 to obtain multiple second coded bit sequences 0; wherein, the check bit position set 0 can be determined from the E positions in the first example of the second possible embodiment. The positions are determined (i.e., the E positions include the positions in the N positions excluding the check bit positions, and the E positions are determined by...). One position and N positions Each position corresponds one-to-one.

[0189] The transmitting device can perform polar coding on multiple second information bit sequences based on the parity bit position set 1 to obtain multiple second coded bit sequences 1; wherein, the parity bit position set 1 can be determined from E positions in the second example of the second possible embodiment. The positions are determined (i.e., the E positions include the positions in the N positions excluding the check bit positions, and the E positions are determined by...). One position and N positions Each position corresponds one-to-one.

[0190] The transmitting device can perform polar coding on multiple second information bit sequences based on the parity bit position set 2 to obtain multiple second coded bit sequences 2; wherein, the parity bit position set 2 may include the second bit position set with line weight w. min The most reliable position The second set of bit positions can include the most reliable (K+n) bits in a reliability sequence of length 32. PC ) = 12 positions, w min It is the minimum row weight corresponding to the position in the reliability sequence other than the pre-frozen bit position and the rate matching bit position.

[0191] In other words, the parity bit position set 0 and parity bit position set 1 are determined based on the row weight after rate matching, while the parity bit position set 2 is determined based on the row weight before rate matching.

[0192] The length of each of the multiple second information bit sequences can be 10. For example, second information bit sequence 0 can be 0000000000, second information bit sequence 1 can be 0000000001, second information bit sequence 2 can be 0000000010, second information bit sequence 3 can be 0000000011, ...

[0193] The minimum code weight corresponding to multiple second-coded bit sequences 0 can be 4, the minimum code weight corresponding to multiple second-coded bit sequences 1 can be 4, the minimum code weight corresponding to multiple second-coded bit sequences 2 can be 4, and the number of second-coded bit sequences corresponding to a code weight of 4 (or can be understood as the minimum code weight) is shown in Table 2.

[0194] Table 2

[0195] As shown in Table 2, the number of second coded bit sequences 0 (i.e., 17) corresponding to a code weight of 4 is less than the number of second coded bit sequences 2 (i.e., 36) corresponding to a code weight of 4. Similarly, the number of second coded bit sequences 1 (i.e., 14) corresponding to a code weight of 4 is less than the number of second coded bit sequences 2 (i.e., 36) corresponding to a code weight of 4. By polar coding the information bit sequence based on the parity bit position set 0 (or parity bit position set 1), the transmitting device can reduce the number of second coded bit sequences 0 (or second coded bit sequences 1) corresponding to the minimum code weight. In other words, by polar coding the information bit sequence based on the parity bit position set determined in the second possible embodiment, the transmitting device can improve the code spectrum performance of the polar code, thereby improving communication performance.

[0196] Optional, in Less than n PC In this case, the check bit position set may also include the second bit position set excluding... The least reliable location outside of these locations There are N positions. That is, the set of check bit positions can include a first subset of check bit positions and a second subset of check bit positions. The first subset of check bit positions can include N positions. There are N positions (the specific method for determining these positions can be found in the above description of N positions). The description of each position is omitted here. The second set of check bits may include the least reliable position in the second set of bit positions other than the first set of check bit positions. One position.

[0197] The second bit position set can be referred to the description of the second bit position set above, and will not be repeated here.

[0198] For example, with N = 16 and K = 7, For 1, n PC Taking 2 as an example, assuming the first set of check bit positions is {15} and the second set of bit positions is {5 7 11 8 12 14 9 13 15}, then the second set of check bit positions can include the least reliable one in {5 7 11 8 12 14 9 13 15}. The set of check bits can be {5}, meaning the subset of the second check bits can be {5 15}.

[0199] It is understandable that the information bit position set may include positions in the second check bit position set other than those in the check bit position set. For example, if the second bit position set is {5 7 11 8 12 14 9 13 15} and the check bit position set is {5 15}, the information bit position set may be {7 11 8 12 14 9 13}.

[0200] This application provides a possible simulation design, where N is 1024, K is 380, and n... PC It is 30 (i.e., K+n) PC =410), Taking a value of 20 and E as 600, assuming the rate matching method is puncturing, the transmitting device can polarize-encode multiple third information bit sequences according to the parity bit position set 0, resulting in multiple third encoded bit sequences 0. The parity bit position set 0 can include a first parity bit position subset 00 and a second parity bit position subset 01. The first parity bit position subset 00 can be determined based on the line weight after rate matching; that is, the first parity bit position subset 00 can include 1024 positions. 1024 positions, and among them 1 position and 600 positions Each of the 600 positions corresponds one-to-one. The positions can be the first set of bit positions (the first set of bit positions can include the most reliable of the E positions). The most reliable position among all positions (those with the smallest weight) For example, the first check bit position subset 10 can be {960 928 912 904 864 900 848 898 840 816 736 897 836 808 720 834 992 976 968 964}; the second check bit position subset 01 can include the least reliable position in the second bit position set 0 other than the first check bit position subset 00. The second bit position set 0 can include the most reliable (K+n) positions in the reliability sequence of length 1024, excluding the pre-frozen bit positions and rate-matching bit positions. PC = 410 positions.

[0201] The transmitting device can perform polar coding on multiple third information bit sequences according to the parity bit position set 1 to obtain multiple third coded bit sequences 1; wherein, the parity bit position set 1 may include a first parity bit position subset 10 and a second parity bit position subset 11, and the first parity bit position subset 10 may be determined according to the line weight before rate matching, that is, the first parity bit position subset 10 may include the most reliable position with the minimum line weight in the second bit position set 1. For example, the first parity bit position subset 10 can be {928 912 904 864 900 848 898 840 816 736 897 836 486 808 720 476 834 485 960 500}; the second parity bit position subset 11 can include the least reliable position in the second bit position set 1 other than the first parity bit position subset 10. The second set of bit positions 1 can include the most reliable (K+n) positions in a reliability sequence of length 1024, excluding pre-frozen bit positions and rate-matching bit positions. PC = 410 positions.

[0202] The length of each of the multiple third information bit sequences can be 380.

[0203] In the first parity bit position subset 10, the number of positions with a row weight of 8 is 18, the number of positions with a row weight of 9 is 1, and the number of positions with a row weight of 10 is 1. In the first parity bit position subset 11, the number of positions with a row weight of 8 is 15, the number of positions with a row weight of 9 is 1, and the number of positions with a row weight of 18 is 4. That is, the number of positions with the smallest row weight in the first parity bit position subset 10 is greater than the number of positions with the smallest row weight in the first parity bit position subset 11, which can reduce the loss of row weight in the parity bit position set 0. In other words, the transmitting device can improve the spectral performance and decoding performance of the polar code by performing polar coding on the third information bit sequence based on the parity bit position set 0.

[0204] In addition, among multiple third-coded bit sequences 0, the number of third-coded bit sequences 0 with a code weight less than or equal to 16 is relatively small, while among multiple third-coded bit sequences 1, the number of third-coded bit sequences 0 with a code weight less than or equal to 16 is relatively large, as detailed in Table 3:

[0205] Table 3

[0206] As shown in Table 3, for the same code weight, the number of 1s in the third coded bit sequence is greater than or equal to the number of 0s in the third coded bit sequence. For example, taking a code weight of 11, the number of 1s in the third coded bit sequence with a code weight of 11 can be 3, and the number of 0s in the third coded bit sequence with a code weight of 11 can be 0. That is, among multiple third coded bit sequences of 0, the number of 0s in the lower code weight third coded bit sequences is relatively small. The transmitting device can improve the spectral performance and decoding performance of the polar code by performing polar coding on the information bit sequence based on the parity bit position set 0. Correspondingly, the transmitting device can improve the spectral performance and decoding performance of the polar code by determining the parity bit position set based on the communication method provided in this application and performing polar coding on the information bit sequence according to the parity bit position set.

[0207] The various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict of logic, the terminology and / or descriptions between the different embodiments provided in this application are consistent and can be referenced mutually. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0208] It is understood that in the embodiments of this application, the executing entity may perform some or all of the steps in the embodiments of this application. These steps or operations are merely examples, and the embodiments of this application may also perform other operations or variations thereof. Furthermore, the various steps may be executed in different orders as presented in the embodiments of this application, and it is not necessarily necessary to execute all the operations in the embodiments of this application.

[0209] The foregoing primarily describes the solutions provided in this application from the perspective of device-to-device interaction. It is understood that each device, in order to achieve the aforementioned functions, includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art will readily recognize that, based on the algorithmic steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0210] This application embodiment can divide each device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. The module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0211] Figure 12 shows a transmitting device 120 when each functional module is divided according to its corresponding function. The transmitting device 120 can perform the actions performed by the transmitting device in the method shown in Figure 9. All relevant content of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiment, and will not be repeated here.

[0212] The transmitting device 120 may include a transceiver module 1201 and a processing module 1202. Exemplarily, the transmitting device 120 may be a communication device, or a chip or other combination device or component having the aforementioned transmitting device functions applied in a communication device. When the transmitting device 120 is a communication device, the transceiver module 1201 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1202 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 120 is a combination device or component having the aforementioned transmitting device functions, the transceiver module 1201 may be a radio frequency unit; the processing module 1202 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 120 is a chip system, the transceiver module 1201 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1202 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 1201 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 1202 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0213] For example, the transceiver module 1201 can be used to perform all the transceiver operations performed by the transmitting device in the embodiment shown in FIG9, and / or to support other processes of the technology described herein; the processing module 1202 can be used to perform all operations other than the transceiver operations performed by the transmitting device in the embodiment shown in FIG9, and / or to support other processes of the technology described herein.

[0214] Figure 13 shows a receiving device 130, which can perform the actions performed by the receiving device in the method shown in Figure 9 above. All relevant content of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module, and the technical effects that can be obtained can be referred to the above method embodiment, which will not be repeated here.

[0215] The receiving device 130 may include a transceiver module 1301 and a processing module 1302. Exemplarily, the receiving device 130 may be a communication device, or a chip or other combination device or component having the aforementioned receiving device functions applied in a communication device. When the receiving device 130 is a communication device, the transceiver module 1301 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1302 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the receiving device 130 is a combination device or component having the aforementioned receiving device functions, the transceiver module 1301 may be a radio frequency unit; the processing module 1302 may be a processor (or processing circuit), such as a baseband processor. When the receiving device 130 is a chip system, the transceiver module 1301 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1302 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. The transceiver module 1301 in this embodiment can be implemented by a transceiver or transceiver-related circuit components; the processing module 1302 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0216] For example, the transceiver module 1301 can be used to perform all the transceiver operations performed by the receiving device in the embodiment shown in FIG9, and / or to support other processes of the technology described herein; the processing module 1302 can be used to perform all operations other than the transceiver operations performed by the receiving device in the embodiment shown in FIG9, and / or to support other processes of the technology described herein.

[0217] As another possible implementation, the transceiver module 1201 in Figure 12 can be replaced by a transceiver unit that integrates the functions of the transceiver module 1201; the processing module 1202 can be replaced by a processor that integrates the functions of the processing module 1202. Furthermore, the transmitting end device 120 shown in Figure 12 may also include a memory. Alternatively, the transceiver module 1301 in Figure 13 can be replaced by a transceiver unit that integrates the functions of the transceiver module 1301; the processing module 1302 can be replaced by a processor that integrates the functions of the processing module 1302. Furthermore, the receiving end device 130 shown in Figure 13 may also include a memory.

[0218] Alternatively, when the processing module 1202 is replaced by a processor and the transceiver module 1201 is replaced by a transceiver, the transmitting end device 120 involved in the embodiments of this application can also be the communication device 140 shown in FIG. 14. Or, when the processing module 1302 is replaced by a processor and the transceiver module 1301 is replaced by a transceiver, the receiving end device 130 involved in the embodiments of this application can also be the communication device 140 shown in FIG. 14.

[0219] The processor can be logic circuit 1401, and the transceiver can be interface circuit 1402. Furthermore, the communication device 140 shown in FIG. 14 may also include a memory 1403. The memory 1403 may exist independently of the processor or be integrated with the processor. The memory 1403 can be used to store instructions, program code, or some data, such as one or more of a base matrix, a list of expansion factors, a list of translation values, or a cyclic shift matrix, or other data used to implement the method shown in FIG. 9. The memory 1403 may be located inside or outside the communication device 140, without limitation.

[0220] This application also provides a communication device, as shown in FIG15. This communication device can be applied to the method shown in any of the embodiments in FIG9. As shown in FIG15, the communication device includes a processing module and a transceiver module. The processing module may be one or more processors, and the transceiver module may be a transceiver or a communication interface. This communication device can be used to implement the sending or receiving device involved in any of the above method embodiments, or to implement the functions of the device involved in any of the above method embodiments. The device or device function may be a network component in a hardware device, a software function running on dedicated hardware, or a virtualization function instantiated on a platform (e.g., a cloud platform). Optionally, the communication device may further include a storage module for storing the program code and data of the communication device.

[0221] In one example, the communication device functions as a transmitting device or is a chip applied within a transmitting device, and executes the steps performed by the transmitting device in the above method embodiments. The transceiver module is used to specifically execute the transmitting and / or receiving actions performed by the transmitting device in any embodiment of FIG9, for example, supporting the transmitting device in performing other processes of the technology described herein. The processing module can be used to support the communication device in performing the processing actions in the above method embodiments, for example, supporting the transmitting device in performing other processes of the technology described herein.

[0222] To achieve the above functions, the chip of this application may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art will readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0223] In one possible implementation, when the transmitting or receiving device is a chip, the transceiver module can be a communication interface, pins, or circuits. The communication interface can be used to input data to be processed to the processor and can output the processor's processing results. Specifically, the communication interface can be a general purpose input / output (GPIO) interface, which can connect to multiple peripheral devices (such as LCD displays, cameras, radio frequency (RF) modules, antennas, etc.). The communication interface is connected to the processor via a bus.

[0224] The processing module can be a processor, which can execute computer execution instructions stored in the storage module to cause the chip to perform the methods involved in any of the embodiments shown in FIG9. Further, the processor may include a controller, an arithmetic logic unit (ALU), and registers. For example, the controller is mainly responsible for instruction decoding and issuing control signals for the operations corresponding to the instructions. The ALU is mainly responsible for performing fixed-point or floating-point arithmetic operations, shift operations, and logical operations, and can also perform address operations and conversions. The registers are mainly responsible for storing register operands and intermediate operation results temporarily stored during instruction execution. In specific implementations, the processor's hardware architecture can be an ASIC architecture, a microprocessor without interlocked piped stages architecture (MIPS) architecture, an advanced reduced instruction set machine (RISC) machine (ARM) architecture, or a network processor (NP) architecture, etc. The processor can be single-core or multi-core. The storage module can be an internal storage module of the chip, such as registers or caches. The storage module can also be an external storage module, such as ROM or other types of static storage devices that can store static information and instructions, RAM, etc.

[0225] This application also provides a computer program product that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0226] This application also provides a computer program that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0227] This application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the terminal. Further, the computer-readable storage medium can include both the terminal's internal storage unit and external storage devices. The computer-readable storage medium is used to store the computer program and other programs and data required by the terminal. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0228] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. "First" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first" and "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "a plurality of" means two or more.

[0229] Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0230] It is understood that in this application, "at least one (item)" refers to one or more. "More than one" refers to two or more. "At least two (items)" refers to two or three or more. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple. Both "...when" and "if" indicate that a corresponding action will be taken under certain objective circumstances. They are not time limits, nor do they require a judgment action at the time of implementation, nor do they imply any other limitations.

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

[0232] In this application, "sending information to...(terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from...(terminal device)" can be understood as the source of the information being the terminal device, and can include receiving information directly or indirectly from the terminal device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source.

[0233] Through the above description of the implementation methods, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0234] In the several embodiments provided in this application, the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual couplings, direct couplings, or communication connections may be through some interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms.

[0235] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0236] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0237] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of this application embodiment, or all or part of the technical solution, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor 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.

Claims

1. A communication method, characterized in that, include: Based on the set of check bit positions, polar coding is performed on the information bit sequence of length K to obtain the encoded bit sequence. Output one or more bits of the encoded bit sequence; The set of check bit positions includes N positions. N positions, of the N positions The positions and E positions Each position corresponds one-to-one with the others, and the E positions are the positions among the N positions excluding the rate matching bit positions; Less than or equal to n PC The n PC The number of check bits; N is the mother code length; E is the length after rate matching; Of the E positions The position is the position with the smallest row weight in the set of the first bit positions. The first set of bit positions includes the most reliable of the E positions. There are 10 positions, and the row weight corresponding to the position in the first set of bit positions is the row weight after rate matching.

2. A communication method, characterized in that, include: Receive information to be decoded; wherein the length of the information bit sequence corresponding to the information to be decoded is K; The information to be decoded is decoded according to the set of check bit positions to obtain the decoding result; The set of check bit positions includes N positions. N positions, of the N positions The positions and E positions Each position corresponds one-to-one with the others, and the E positions are the positions among the N positions excluding the rate matching bit positions; Less than or equal to n PC The n PC The number of check bits; N is the mother code length; E is the length after rate matching; Of the E positions The position is the position with the smallest row weight in the set of the first bit positions. The first set of bit positions includes the most reliable of the E positions. There are 10 positions, and the row weight corresponding to the position in the first set of bit positions is the row weight after rate matching.

3. The method according to claim 1 or 2, characterized in that, Of the E positions The position is the most reliable among the positions with the smallest row weight in the first set of bit positions. One position; or Of the E positions The position is the position with the largest index among the positions with the smallest row weight in the first set of bit positions. One position.

4. The method according to any one of claims 1-3, characterized in that, The Less than n PC , The set of check bit positions also includes, in the second set of bit positions, excluding the N positions. The least reliable location outside of these locations There are 1,000 positions; wherein, the second set of bit positions includes the most reliable (K+n) positions in the first sequence. PC The first sequence includes N positions in a reliability sequence excluding the pre-frozen bit positions and the rate matching bit positions.

5. The method according to any one of claims 1-4, characterized in that, The method further includes: Based on the set of check bit positions, a set of information bit positions is determined; wherein, the set of information bit positions includes positions in a second set of bit positions other than those in the set of check bit positions, and the second set of bit positions includes the most reliable (K+n) positions in the first sequence. PC The first sequence includes N positions in a reliability sequence excluding the pre-frozen bit positions and the rate matching bit positions.

6. A communication device, characterized in that, The communication device includes a module or unit for performing the communication method as described in any one of claims 1, 3-5; or, the communication device includes a module or unit for performing the communication method as described in any one of claims 2-5.

7. A communication device, characterized in that, The communication device includes a processor; the processor is configured to run a computer program or instructions that cause the communication method as described in any one of claims 1, 3-5 to be executed, or cause the communication method as described in any one of claims 2-5 to be executed.

8. A communication device, characterized in that, The communication device includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method as described in any one of claims 1, 3-5, or to execute the communication method as described in any one of claims 2-5, and to process and / or generate the information based on the information.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the communication method as described in any one of claims 1, 3-5 to be executed, or cause the communication method as described in any one of claims 2-5 to be executed.

10. A computer program product, characterized in that, The computer program product includes computer instructions; when some or all of the computer instructions are executed on a computer, they cause the communication method as described in any one of claims 1, 3-5 to be executed, or cause the communication method as described in any one of claims 2-5 to be executed.

11. A communication system, characterized in that, It includes a communication device for performing the communication method as described in any one of claims 1, 3-5, and a communication device for performing the communication method as described in any one of claims 2-5.

Images