Communication method and device

Abstract

The invention discloses a communication method and device, relates to the technical field of communication, and can improve code spectrum and decoding performance when the position of a PC bit is determined. The method comprises the following steps: determining a second sequence comprising M positions except the position of a pre-freezing bit and the position of a rate matching bit in a first sequence according to the reliability corresponding to the first sequence with the length of N; and determining a first check bit position set and a second check bit position set according to a first position set comprising the most reliable (K + nPC) positions in the second sequence, performing polarization coding on the information bit sequence to obtain a coded bit sequence, and outputting one or more bits in the coded bit sequence. NPC is the number of check bits, the first check bit position set comprises the most reliable positions with the row weight equal to wmin in the first position set, the second check bit position set comprises the most unreliable positions in the first position set, and wmin is the minimum row weight corresponding to the most reliable K positions in the first position set.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a communication method and apparatus. Background Technology

[0002] 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 shortening 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 shortening bit does not need to be transmitted to the channel.

[0003] In PC-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 the 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. Each bit position is used as the position of the PC bit.

[0004] However, in the above encoding process, there may be a situation where, when a significant loss of reliability is required to improve the code spectrum, the minimum row overlap w among the most reliable K bit positions may be insufficient. min The number of corresponding bit positions cannot be supported. In larger cases, determining the position of the PC bit to improve code spectrum and decoding performance has become an urgent technical problem to be solved. Summary of the Invention

[0005] This application provides a communication method and apparatus that can improve code spectrum and decoding performance when determining the position of PC bits.

[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 the transmitting device itself, a component within the transmitting device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the transmitting device. The method includes: determining a second sequence of length M based on the reliability corresponding to a first sequence of length N; the second sequence includes positions in the first sequence excluding the positions of pre-frozen bits and rate-matching bits; determining a set of check bit positions based on a first set of positions in the second sequence; polar encoding the information bit sequence based on the set of check bit positions to obtain an encoded bit sequence; and outputting one or more bits of the encoded bit sequence. The first set of positions includes the most reliable (K+n) bits in the second sequence. PC There are ) positions, where K is the length of the information bit sequence, and n PC The number of parity bits is [number of] bits. The parity bit position set includes a first parity bit position set and a second parity bit position set. The first parity bit position set includes the row weights equal to w in the first position set. min The most reliable The second set of check bit positions includes the least reliable position from the first set of positions. One position, w min It represents the minimum row weight corresponding to the K most reliable positions in the first position set.

[0007] Based on the first aspect, the first set of check bit positions The positions are determined based on the first set of positions, which increases the selection range of the first set of check bit positions and ensures the minimum row overlap w among the most reliable K bit positions. min The number of corresponding bit positions can support In larger cases, improving code spectrum performance and decoding performance can better meet the error correction performance requirements of ultra-short code intervals, and can approach the ML decoding performance of LTE-RM codes under SCL8 decoding.

[0008] In one possible design, n PC Less than or equal to the difference between M and K.

[0009] Based on this possible design, n is increased. PC The range of values ​​can be selected to improve code spectrum performance and decoding performance, and can better meet the error correction performance requirements of ultra-short code intervals.

[0010] In a possible design, the set of information bit positions is determined according to the set of check bit positions; the set of information bit positions includes K positions in the first set of positions except the set of check bit positions; the check bit corresponding to each check bit position and the information bit corresponding to each information bit position are determined according to the shift register, to obtain the coded bit sequence.

[0011] Based on the possible design, the coded bit sequence can be determined based on the check equation corresponding to the uniform shift register, so that the code spectrum performance and decoding performance are improved.

[0012] In a possible design, the shift register is a three-tap shift register represented as 26 in decimal notation; or the shift register is a single-tap shift register represented as 16 in decimal notation.

[0013] Based on the possible design, multiple feasible schemes are provided for the design of the shift register.

[0014] In a possible design, The K and the length E after rate matching are determined.

[0015] Based on the possible design, the value of the can be determined according to block error rate traversal search, for different K and different E, in each scenario.

[0016] In a possible design, when the K is less than or equal to 6, or the difference between the length E after rate matching and the K is less than or equal to 7, The second set of check bit positions is empty when the is equal to 0.

[0017] Based on the possible design, by setting the value of the to 0 when the above condition is met, the code spectrum performance and decoding performance can be improved.

[0018] In a second aspect, a communication method is provided, which can be performed by a receiving end device. In the case where no special description is given, the "receiving end device" in the present application can refer to the receiving end device itself, or a component (for example, a processor, a chip, or a chip system) in the receiving end device, or a logic module or software capable of realizing all or part of the functions of the receiving end device. The method includes: receiving to-be-decoded information from a sending end device; the length of an information bit sequence corresponding to the to-be-decoded information is K; determining a second sequence with a length of M according to the reliability of a first sequence with a length of N; the second sequence includes positions in the first sequence except the positions of pre-frozen bits and the positions of rate matching bits; determining a set of check bit positions according to a first set of positions in the second sequence; and decoding the to-be-decoded information according to the set of check bit positions. The first set of positions includes the (K+n)th most reliable position in the second sequence.​​PC K is the length of the information bit sequence, n PC is the number of check bits, the check bit position set includes a first check bit position set and a second check bit position set, the first check bit position set includes the most reliable min positions in the first position set, the second check bit position set includes the least reliable positions in the first position set, w is the minimum row weight corresponding to the most reliable K positions in the first position set. min

[0019] Based on the second aspect, the positions of the first check bit position set are determined according to the first position set, which increases the selection range of the first check bit position set and ensures that the minimum row weight w min of the most reliable K bit positions corresponds to the number of bit positions that can support larger cases, improve the code spectrum performance and decoding performance, and better meet the requirements of the ultra-short code interval on error correction performance, and can approach the ML decoding performance of the LTE-RM code under SCL8 decoding.

[0020] In a possible design, n PC is less than or equal to the difference between M and K.

[0021] Based on this possible design, the selection range of the value of n PC is increased, which can improve the code spectrum performance and decoding performance and better meet the requirements of the ultra-short code interval on error correction performance.

[0022] In a possible design, the information bit position set is determined according to the check bit position set; wherein the information bit position set includes K positions in the first position set except the check bit position set; and the to-be-decoded information is decoded according to the check bit position set, the information bit position set, and the shift register.

[0023] Based on this possible design, the decoding can be performed based on the check equation corresponding to the unified shift register, which improves the code spectrum performance and decoding performance.

[0024] In a possible design, the shift register is a three-tap shift register represented as 26 in decimal; or the shift register is a single-tap shift register represented as 16 in decimal.

[0025] Based on this possible design, multiple feasible schemes are provided for the design of the shift register.

[0026] In a possible design, ​According to K and the length E after rate matching.

[0027] Based on the possible design, the values of K and E corresponding to different scenarios can be determined according to block error rate traversal search. The value of K.

[0028] In a possible design, when K is less than or equal to 6, or the difference between the length E after rate matching and K is less than or equal to 7, is equal to 0, and the second set of check bit positions is empty.

[0029] Based on the possible design, by setting the value of K that satisfies the above condition to 0, the code spectrum performance and decoding performance can be improved.

[0030] In a third aspect, an embodiment of the present application provides a communication apparatus, which can be applied to the sending device in the first aspect to implement the functions performed by the sending device. The communication apparatus can be the sending device, a chip or chip system or system on chip, etc. of the sending device. The communication apparatus can perform the functions performed by the sending device through hardware, or perform the functions through corresponding software. The hardware or software includes one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can perform the following transceiving operations independently, or in cooperation with the processing module. Similarly, the processing module can perform the following processing operations independently, or in cooperation with the transceiver module. No limitation is imposed.

[0031] For example, the processing module is configured to determine a second sequence with a length of M according to reliability of a first sequence with a length of N. The second sequence includes positions in the first sequence except for positions of pre-frozen bits and positions of rate matching bits. The processing module is further configured to determine a set of check bit positions according to a first set of positions in the second sequence. The processing module is further configured to perform polar encoding on an information bit sequence according to the set of check bit positions to obtain an encoded bit sequence. The transceiver module is configured to output one or more bits of the encoded bit sequence. The first set of positions includes K+n PC most reliable positions in the second sequence, K is a length of the information bit sequence, n PC is a number of check bits, the set of check bit positions includes a first set of check bit positions and a second set of check bit positions, the first set of check bit positions includes K min most reliable positions in the first set of positions with a row weight equal to w , and the second set of check bit positions includes K least reliable positions in the first set of positions, and w min ​The minimum row weight corresponding to the K most reliable positions in the first position set.

[0032] Optionally, the transceiver module and the processing module of the communication apparatus in the third aspect can also perform the corresponding functions in the first aspect or any possible design of the first aspect, and the specific implementation can be referred to the detailed description in the method examples. The beneficial effects achieved can also be referred to the foregoing related content.

[0033] In the fourth aspect, the embodiments of the present application provide a communication apparatus, which can be applied to the receiving end device in the second aspect to realize the functions performed by the receiving end device. The communication apparatus can be the receiving end device, a chip or a chip system or a system on chip, etc. of the receiving end device. The communication apparatus can perform the functions of the receiving end device through hardware, or perform the corresponding software through hardware. The hardware or software includes one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can complete the following transceiving operations independently, or in cooperation with the processing module. Similarly, the processing module can complete the following processing operations independently, or in cooperation with the transceiver module. No limitation is given.

[0034] For example, the transceiver module is configured to receive the to-be-decoded information from the sending end device. The length of the information bit sequence corresponding to the to-be-decoded information is K. The processing module is configured to determine a second sequence with a length of M according to the reliability of a first sequence with a length of N. The second sequence includes positions in the first sequence except for the positions of the pre-frozen bits and the positions of the rate matching bits. The processing module is further configured to determine a check bit position set according to a first position set in the second sequence, and decode the to-be-decoded information according to the check bit position set. The first position set includes the (K+n PC ) most reliable positions in the second sequence, K is the length of the information bit sequence, n PC is the number of check bits, the check bit position set includes a first check bit position set and a second check bit position set, the first check bit position set includes the min most reliable positions in the first position set with a row weight equal to w , and the second check bit position set includes the min most unreliable positions in the first position set. w

[0035] Optionally, the transceiver module and the processing module of the communication apparatus in the fourth aspect can also perform the corresponding functions in the second aspect or any possible design of the second aspect, and the specific descriptions can be referred to the detailed descriptions in the method examples, and the beneficial effects can also be referred to the foregoing descriptions.

[0036] In the fifth aspect, the embodiments of the present application provide a communication apparatus, which comprises one or more processors; and the one or more processors are configured to execute computer programs or instructions, and when the one or more processors execute the computer programs or instructions, the communication method in any one of the first aspect to the second aspect is executed.

[0037] In a possible design, the communication apparatus further comprises one or more memories coupled to the one or more processors, and the one or more memories are configured to store the computer programs or instructions. In a possible implementation, the memory is located outside the communication apparatus. In another possible implementation, the memory is located inside the communication apparatus. In the embodiments of the present application, the processor and the memory can also be integrated into one device, that is, the processor and the memory can also be integrated together. In a possible implementation, the communication apparatus further comprises a transceiver, and the transceiver is configured to receive information and / or send information.

[0038] In a possible design, the communication apparatus further comprises one or more communication interfaces coupled to the one or more processors, and the one or more communication interfaces are configured to communicate with other modules outside the communication apparatus.

[0039] In the sixth aspect, the embodiments of the present application provide a communication apparatus, which comprises an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; and the logic circuit is configured to execute the communication method in any one of the first aspect or the second aspect, process and / or generate information according to the information.

[0040] In the seventh aspect, the embodiments of the present application provide a computer readable storage medium, which stores computer instructions or programs, and when the computer instructions or programs are executed on a computer, the communication method in any one of the first aspect or the second aspect is executed.

[0041] In the eighth aspect, the embodiments of the present application provide a computer program product comprising computer instructions, and when the computer instructions are executed on a computer, the communication method in any one of the first aspect or the second aspect is executed.

[0042] In the ninth aspect, the embodiments of the present application provide a computer program, and when the computer program is executed on a computer, the communication method in any one of the first aspect or the second aspect is executed.

[0043] In a tenth aspect, an embodiment of the present application provides a chip, comprising: a processor, the processor being coupled with a memory, the memory being configured to store programs or instructions, when the programs or instructions are executed by the processor, causing the communication method as described in any one of the first aspect or the second aspect to be executed.

[0044] The technical effects brought by any one of the fifth aspect to the tenth aspect can refer to the technical effects brought by any one of the first aspect or the second aspect, which will not be repeated here.

[0045] In an eleventh aspect, an embodiment of the present application provides a communication system, which can comprise a communication apparatus for executing the communication method as described in the first aspect or any possible design of the first aspect, and a communication apparatus for executing the communication method as described in the second aspect or any possible design of the second aspect. BRIEF DESCRIPTION OF DRAWINGS

[0046] Figure 1 A decoding flowchart of an LTE-RM code provided by an embodiment of the present application;

[0047] Figure 2 A schematic diagram of a communication system provided by an embodiment of the present application;

[0048] Figure 3 A schematic diagram of encoding and decoding by a sending end device and a receiving end device provided by an embodiment of the present application;

[0049] Figure 4 A schematic diagram of a communication apparatus provided by an embodiment of the present application;

[0050] Figure 5 A flowchart of a communication method provided by an embodiment of the present application;

[0051] Figure 6 A schematic diagram of a set of check bit positions provided by an embodiment of the present application;

[0052] Figure 7 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0053] Figure 8 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0054] Figure 9 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0055] Figure 10 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0056] Figure 11 A schematic diagram of a sending end device provided for an embodiment of the present application;

[0057] Figure 12 A schematic diagram of a receiving end device provided for an embodiment of the present application;

[0058] Figure 13 A schematic diagram of a communication apparatus provided for an embodiment of the present application. DETAILED DESCRIPTION

[0059] Before describing embodiments of the present application, technical terms involved in the embodiments of the present application are described.

[0060] Long Term Evolution-Reed-Muller (LTE-RM) encoding: the sending end device can encode a sequence of ultra-short information bits of 3-11 bits in the following manner:

[0061] Step 1, encode a sequence of information bits c0, c1, …, cK-1 of length K to obtain a sequence of encoded bits d0, d1, …, dN-1 of length N. K-1 N-1 .

[0062] For example, K can be any value from 3-11, and N can be 32.

[0063] wherein, M i,k The value of i = 0, 1, 2, …, N-1.

[0064] Table 1

[0065]

[0066]

[0067] Step 2, rate match the sequence of encoded bits d0, d1, …, dN-1 of length N to obtain a sequence of rate matched bits f0, f1, …, fE-1 of length E. N-1 E-1 .

[0068] wherein E is the actual code length after rate matching, or described as the transmission code length after rate matching, or described as the rate matching length. E can be determined according to rate matching related information.

[0069] ​​When it is determined that E is not equal to the encoding length N (e.g., E is not equal to 32), the following rate matching method can be adopted: when E is less than N (e.g., E is less than 32), punch holes from back to front; when E is greater than N (e.g., E is greater than 32), repeat from front to back.

[0070] For example, the rate-matching sequence f0, f1, ..., f E-1 You can obtain it in the following ways:

[0071] for k=0to E-1

[0072] f k =d k mod N ;

[0073] end for

[0074] Step 3: Send the rate matching sequence f0, f1, ..., f E-1 .

[0075] LTE-RM decoding: The receiving device can refer to... Figure 1 The decoding flowchart shown illustrates the following method for decoding the encoded bit sequence of ultra-short information (3-11 bits):

[0076] Step 1: Perform a simple decision (such as a hard decision) on the received sequence, and then interleave the codewords (such as bipolar codewords) or soft bit information after the simple decision to obtain the processed received codewords.

[0077] The received sequence can be the rate-matching sequence mentioned above.

[0078] Optionally, if the codeword length after simple decision is not equal to N, high-order zeros can be added.

[0079] For example, if the codeword after simple decision is b0, b1, ..., b of length 20 19 Then, by padding with 12 zeros at the high bits, we can obtain a codeword of length N = 32: 0, ..., 0, b0, b1, ..., b 19 .

[0080] Step 2: Interleave the received codewords processed in Step 1 according to the mask vector.

[0081] The interleaving process is the same as the interleaving process in step 1 above.

[0082] For example, 128 mask vectors can be generated based on 7 basic mask sequences. These 128 mask vectors are then multiplied by the received codewords processed in step 1 (i.e., demasking is performed) to obtain 128 bipolar sequences of length 32.

[0083] Step 3, performing a fast Hadamard transform (FHT) on the bipolar sequence obtained in Step 2 and a 32-order Hadamard matrix to obtain a 128x32 correlation value matrix.

[0084] Step 4, finding the maximum absolute value from the correlation value matrix obtained in Step 3, so that the binary form of the row number corresponding to the maximum absolute value is the 2nd-6th bit of the information bit sequence, and the binary form of the column number is the 7th-13th bit of the information bit sequence.

[0085] Step 5, the 1st bit of the information bit sequence is determined according to the actual sign of the maximum absolute value, i.e., 0 when positive, and 1 when negative.

[0086] In the above steps 4 and 5, the 1st-13th bits are defined from the 1st bit of the information bit sequence, and it can be understood that the information bit sequence can also be defined from the 0th bit, i.e., the 1st-13th bits are replaced by the 0th-12th bits, respectively, without limitation.

[0087] However, the above LTE-RM decoding adopts FHT, and when the length of the information bit sequence is greater than 6 bits, the mask vector needs to be enumerated and demasked, resulting in a high complexity of the LTE-RM decoding scheme reaching the maximum likelihood (ML) decoding performance and a large power consumption. In addition, when the length E after rate matching is small, the number of puncturing is large, and a performance bad point occurs, affecting the decoding performance.

[0088] Parity check polar code (PC-Polar code): can include information bits, frozen bits, PC bits, and rate matching shortened bits.

[0089] Among them, a part of the frozen bits can be selected as PC bits, and the values of these PC bits are different from other frozen bits and are not fixed as 0, but are determined by PC equations according to the values of the information bits in front of the PC bits, so the PC bits can also be called dynamic frozen bits (i.e., the position comes from the frozen bits, but the value is not fixed as 0). The rate matching shortened bits do not need to be sent to the channel.

[0090] When performing PC-Polar code encoding, the position of the PC bit can be determined in a loss of reliability manner to improve the code spectrum. Specifically, the positions of K information bits corresponding to the minimum row weight w minfrom the minimum row weight w min of the K most reliable bit positions corresponding to the K most reliable bit positions PC , the positions of the remaining n PC bits can be selected from the (K+n PC ) most reliable bit positions least reliable bit positions as the positions of the PC bits.

[0091] However, in the above encoding process, there may be a case that when more reliability needs to be lost to improve the code spectrum, the number of bit positions corresponding to the minimum row weight w min of the K most reliable bit positions cannot support a larger case. In addition, the construction parameters and check equations of the PC-polar code in the new radio (NR) standard cannot meet the requirements of the ultra-short code interval on error correction performance, and cannot approach the decoding performance of the LTE-RM code.

[0092] Therefore, how to determine the positions of the PC bits to improve the code spectrum and decoding performance becomes a technical problem to be solved.

[0093] To solve the above technical problems, an embodiment of the present application provides a communication method, which comprises: determining a second sequence with a length of M according to the reliability corresponding to a first sequence with a length of N; the second sequence comprises positions in the first sequence except for the positions of frozen bits and rate matching bits; determining a check bit position set according to a first position set in the second sequence; polar encoding an information bit sequence according to the check bit position set to obtain an encoded bit sequence; and outputting one or more bits of the encoded bit sequence. Wherein, the first position set comprises (K+n PC ) most reliable positions in the second sequence, K is the length of the information bit sequence, n PC is the number of check bits, the check bit position set comprises a first check bit position set and a second check bit position set, the first check bit position set comprises (K-w min ) most reliable positions with a row weight equal to w in the first position set, the second check bit position set comprises (n ) least reliable positions in the first position set, and w min is the minimum row weight corresponding to the K most reliable positions in the first position set.

[0094] In the embodiment of the present application, the number of positions in the first check bit position set The K positions are determined according to the first position set, and the selection range of the first check bit position set is increased, so that the minimum row weight w in the most reliable K bit positions is ensured min The number of corresponding bit positions can support In the case of a larger number of bit positions, the code spectrum performance and decoding performance are improved, and the requirements of the super-short code interval on the error correction performance can be better met.

[0095] The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0096] The communication method provided by the embodiments of the present application can be used in any communication system, which can be a third generation partnership project (3GPP) communication system, for example, a long term evolution (LTE) system, and can also be a fifth generation (5G) mobile communication system, a system of mixed networking of LTE and 5G, an 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), a narrow band-internet of things (NB-IoT) system, a global system for mobile communications (GSM) system, an enhanced data rate for GSM evolution (EDGE) system, a wideband code division multiple access (WCDMA) system, a code division multiple access (CDMA) 2000 system, a time division-synchronization code division multiple access (TD-SCDMA) system, an enhanced mobile broadband (eMBB) system, an ultra-reliable and low-latency communication (URLLC) system, an enhanced machine-type communication (eMTC) system, and various types of next-generation communication systems such as a sixth generation (6G) mobile communication system, and can also be a non-terrestrial network (NTN) system (such as a satellite communication system), a non-3GPP communication system, and the like, without limitation.

[0097] The communication method provided by the embodiments of the present application can be applied to various communication scenarios, for example, can be applied to one or more of the following communication scenarios: encoding of a control channel, encoding of a data channel, etc., without limitation.

[0098] The communication system provided by the embodiments of the present application is described below taking a communication system as an example. Figure 2

[0099] Figure 2 A schematic diagram of a communication system provided by the embodiments of the present application is shown in FIG. 1, which can include at least one terminal device and at least one network device. Figure 2

[0100] Among them, Figure 2 The terminal device in the communication system can be located in the beam / cell coverage of the network device, and the network device can provide communication services for the terminal device. For example, the network device can encode downlink data by using channel coding, and transmit the data to the terminal device through the air interface after constellation modulation (i.e., the network device is the sending terminal device, and the terminal device is the receiving terminal device); the terminal device can also encode uplink data by using channel coding, and transmit the data to the network device through the air interface after constellation modulation (i.e., the terminal device is the sending terminal device, and the network device is the receiving terminal device). It can be understood that when the network device communicates with the network device, or the terminal device communicates with the terminal device, communication can also be based on channel coding, i.e., the sending terminal device and the receiving terminal device can both be network devices, or both be terminal devices, without limitation.

[0101] Figure 2 The terminal device in the communication system can be a device with wireless transceiving function or a chip or chip system that can be provided in the device, and can allow a user to access a network, and is a device for providing voice and / or data connectivity to a user. The terminal device can also be referred to as a user equipment (UE), a subscriber unit, a terminal, or a mobile station (MS) or a mobile terminal (MT), etc.

[0102] For example, Figure 2 ​​The terminal device in the foregoing embodiments can be a mobile phone, a tablet computer, or a computer with wireless transceiving function. The terminal device can also be a user station, a mobile station, a remote station, a remote terminal device, a mobile terminal device, a user terminal device, a wireless communication device, a user agent, a user equipment, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication function, a computing device, a processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in Internet of Things, a household appliance, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in remote medical treatment, a wireless terminal in smart power grid, a wireless terminal in smart city, a wireless terminal in smart home, a vehicle with vehicle-to-vehicle (V2V) communication capability, a smart connected vehicle, a drone with unmanned aerial vehicle-to-unmanned aerial vehicle (UAVto UAV, U2U) communication capability, a terminal device in future network, or a terminal device in future evolved public land mobile network (PLMN), and the like, without limitation.

[0103] wherein, Figure 2 The network device in the foregoing embodiments can be any device deployed in an access network and capable of wireless communication with a terminal device, can also be a chip or chip system that can be provided in the foregoing device, can also be a logic node or logic module or a function implemented in software, and is mainly responsible for functions such as wireless physical control function, 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 a device supporting wired access or a device supporting wireless access.

[0104] Exemplary network devices can be composed 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, continue evolution NodeBs (gNBs), transmission reception points (TRPs), evolved NodeBs (eNBs), radio network controllers (RNCs), NodeBs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home eNBs or home NBs, HNB), macro base stations, micro base stations, pico base stations, femto base stations, relay stations, balloon stations, drone stations, wireless backhaul nodes, baseband units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It can be understood that network devices can be ground-based devices or non-ground-based devices (e.g., satellites, drones, high-altitude communication devices, etc.). In addition, in communication systems using different wireless access technologies, the names of network devices with base station functions can be different, which is not limited in the present application.

[0105] In yet another example, network devices can include a BBU and a remote radio unit (RRU). The BBU and RRU can be placed in different locations, for example, the RRU is pulled away and placed in a high traffic area, and the BBU is placed in a central machine room. The BBU and RRU can also be placed in the same machine room. The BBU and RRU can also be different components under one rack.

[0106] In still another example, network devices can also be devices including a centralized unit (CU) node, or including a distributed unit (DU) node, or including a CU node and a DU node. For example, network devices can be divided into a CU and a DU from a logical function perspective, and the functions of part of the protocol layers are controlled by the CU, and the rest or all of the protocol layers are distributed in the DU and controlled by the CU. The CU and the DU can be separately arranged, or can be included in the same network element, such as a BBU. Furthermore, the centralized unit CU can also be divided into a control plane (CU-CP) and a user plane (CU-UP).

[0107] In yet another example, the network device can also be a device comprising a radio unit (RU), or a device comprising a CU, a DU and a RU. The RU can be comprised in a radio frequency device or radio frequency unit, e.g., in a RRU, an active antenna unit (AAU) or a remote radio head (RRH).

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

[0109] Based on the above description of the terminal device and the network device, optionally, the communication method provided by the embodiments of the present application can be implemented by the terminal device or the network device, or by components of the terminal device or the network device, etc., such as by an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), or software (such as program code in a memory), etc., without limitation.

[0110] Optionally, in the embodiments of the present application, the sending end device (also referred to as a signal source) and the receiving end device (also referred to as a signal sink) can use the following Figure 3 flow for encoding and decoding. The sending end device can be any of the terminal devices or network devices in the Figure 2 communication system shown in FIG. 1, and the receiving end device can also be any of the terminal devices or network devices in the Figure 2 communication system shown in FIG. 1.

[0111] The sending end device can source encode the bits generated by the sending end device to obtain a source bit stream, channel encode the source bit stream, modulate the channel encoded source bit stream, and send the modulated symbols to the receiving end device through a noisy channel. When the receiving end device receives the modulated symbols through the noisy channel, the receiving end device can demodulate the modulated symbols, channel decode the demodulated symbols, recover the source bit stream, and obtain the decoding result through source recovery.

[0112] In specific implementation, Figure 2 As shown in the embodiments, each of the terminal device and the network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 4 As shown in the embodiments, each of the terminal device and the network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 4 As shown in the embodiments, each of the terminal device and the network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 4 As shown in the embodiments, the communication apparatus 400 can be a terminal device or a chip or system on chip in the terminal device, or a network device or a chip or system on chip in the network device. As shown in the embodiments, the communication apparatus 400 includes a processor 401, a transceiver 402, and a communication line 403. Figure 4

[0113] Further, the communication apparatus 400 can further include a memory 404. The processor 401, the memory 404, and the transceiver 402 can be connected through the communication line 403.

[0114] The processor 401 can be a central processing unit (CPU), a general processor network processor (NP), a digital signal processing (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 401 can also be other devices with processing functions, such as a circuit, a device, or a software module, without limitation.

[0115] The transceiver 402 is configured to communicate with other devices or other communication networks. The other communication networks can be an Ethernet network, a radio access network (RAN), a wireless local area network (WLAN), or the like. The transceiver 402 can be a module, a circuit, a transceiver, or any device capable of communication.

[0116] The communication line 403 is configured to transmit information between components included in the communication apparatus 400.

[0117] ​The memory 404 is configured to store instructions. The instructions can be a computer program.

[0118] The memory 404 can be a read-only memory (ROM) or another type of static storage device that can store static information and / or instructions, or a random access memory (RAM), or another type of dynamic storage device that can store information and / or instructions, or an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM), or another type of optical storage, a magnetic disk storage or another type of magnetic storage device, or the like, without limitation.

[0119] It should be noted that the memory 404 can exist independently of the processor 401, or can be integrated with the processor 401. The memory 404 can be configured to store instructions or program codes or some data, etc. The memory 404 can be located in the communication apparatus 400, or can be located outside the communication apparatus 400, without limitation. The processor 401 is configured to execute the instructions stored in the memory 404, so as to implement the communication method provided by the embodiments described below.

[0120] In an example, the processor 401 can include one or more CPUs, such as the CPU0 and the CPU1 in the Figure 4 .

[0121] As an optional implementation, the communication apparatus 400 includes multiple processors, for example, in addition to the processor 401 in the Figure 4 , the communication apparatus 400 can further include a processor 407.

[0122] As an optional implementation, the communication apparatus 400 further includes an output device 405 and an input device 406. For example, the input device 406 is a keyboard, a mouse, a microphone, a joystick, or the like, and the output device 405 is a display screen, a speaker, or the like.

[0123] It should be noted that the communication apparatus 400 can be a desktop computer, a laptop computer, a network server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device having a similar structure as described in the Figure 4 . In addition, the constituent structures shown in the Figure 4 do not constitute limitation on the communication apparatus, except that Figure 4In addition to the components shown, the communication device can include other components or fewer components, or different arrangements of the components shown. While various aspects and embodiments of the communication device have been disclosed, other aspects and embodiments will be apparent to those of ordinary skill in the art from the disclosure herein. The various aspects and embodiments disclosed herein can be combined in different combinations, or eliminated from the embodiments.

[0124] In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices.

[0125] In addition, the actions, terms and the like involved between the embodiments of the present application can be mutually referred to and are not limited. The message name or parameter name in the message between the devices in the embodiments of the present application is only an example, and other names can also be used in the specific implementation, which is not limited.

[0126] The following describes the communication system shown in Figure 2 The following describes the communication system shown in Figure 5 The communication method provided by the embodiments of the present application is described, wherein the sending end device can be any terminal device or network device in the communication system shown in Figure 2 The receiving end device can also be any terminal device or network device in the communication system shown in Figure 2 The sending end device or the receiving end device described in the following embodiments can have the components shown in Figure 4 .

[0127] Figure 5 The flowchart of the communication method provided by the embodiments of the present application is shown in Figure 5 The method can include the following steps.

[0128] Step 501, the sending end device determines a second sequence with a length of M according to the reliability corresponding to a first sequence with a length of N.

[0129] Wherein, N is the mother code length of data transmission, and the second sequence includes positions in the first sequence except for the positions of pre-frozen bits and the positions of rate matching bits. N and M are positive integers.

[0130] For example, the sending end device can 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 and the code rate R = K / E and N DM are related. If E ≤ 9 / 8 × N DM and R < 9 / 16, N M = N DM / 2; otherwise, N M = N DM . N R is related to K and the minimum code rate R min , R min = 1 / 8. N max =1024.

[0131] The information bit sequence may include information bits, CRC bits, or the information bit sequence may include only information bits themselves. K may be the sum of the number of information bits and the number of CRC bits included in the information bit sequence. Alternatively, K may be the number of information bits included in the information bit sequence.

[0132] The transmitting device can determine the reliability of the first sequence based on the reliability sequence of length N, and then determine the second sequence of length M.

[0133] The reliability sequence can be used to indicate the reliability of each bit position in the sequence. The higher the reliability value, the more reliable the position corresponding to that reliability.

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

[0135] For example, taking the sending device determining N to be 32 as an example, the reliability sequence of length 32 can be the reliability sequence shown in Table 2 below, where, Indicates reliability. Bits representing reliability:

[0136] Table 2

[0137]

[0138]

[0139] It is understandable that Table 2 above is defined starting from bit 0, or it can be defined starting from bit 1. That is, the above 0, 1, ..., 31 can be replaced with 1, 2, ..., 32 respectively, without restriction.

[0140] Based on the above reliability sequence, the transmitting device can determine the position of the pre-frozen bit and the position of the rate matching bit in the first sequence according to the reliability corresponding to the first sequence of length N, and determine the positions in the first sequence other than the positions of the pre-frozen bit and the rate matching bit as the second sequence.

[0141] The position of the rate matching bit can be determined based on the rate matching method.

[0142] Exemplarily, the rate matching method can be determined according to the length E after rate matching and the length N of the mother code. For example, if E > N, the rate matching method is determined to be repetition, that is, after the transmitting device sends the mother code with length N, it sends (E - N) bits again (the (E - N) bits are the rate matching bits). If E < N, the transmitting device can determine whether to puncture from front to back or shorten from back to front according to the current code rate R = K / E. If R < 7 / 16, the rate matching is performed in the way of puncturing from front to back, that is, puncturing (N - E) bits from front to back (the (N - E) bits from front to back are the rate matching bits); otherwise, shortening (N - E) bits from back to front (the (N - E) bits from back to front are the rate matching bits).

[0143] Exemplarily, taking the length N of the first sequence as 32, the first sequence sorted in ascending order of reliability can be: {0 1 2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}. Assuming the positions of the rate matching bits and the pre-frozen bits are {0 1}, the second sequence can be {2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}.

[0144] Step 502: The transmitting device determines the set of check bit positions according to the first position set in the second sequence.

[0145] Among them, as Figure 6 shown, the first position set includes the (K + n PC ) most reliable positions in the second sequence, K is the length of the information bit sequence, and n PC is the number of check bits.

[0146] Optionally, n PC is less than or equal to the difference between M and K. For example, taking M equal to 30 and K equal to 11, n PC is less than or equal to 19.

[0147] Exemplarily, taking the second sequence as {2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31} as an example, assuming K is equal to 11, n PCIf the value is 19, then the set of the first position can be {2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}.

[0148] Among them, such as Figure 6 As shown, the parity bit position set includes a first parity bit position set and a second parity bit position set. The first parity bit position set includes the row weights equal to w in the first position set. min The most reliable The second set of check bit positions includes the least reliable position from the first set of positions. One position, w min It represents the minimum row weight corresponding to the K most reliable positions in the first position set.

[0149] Optional, The value can be any of the following: 0, 1, 2, 3, 4, 5, 6, 7, or 8.

[0150] For example, with K equal to 11, n PC If the first position set equals 19, taking {2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31} as an example, the row weight of {31} in this first position set is 32, the row weight of {15 23 27 29 30} is 16, the row weight of {7 11 19 13 14 21 26 25 22 28} is 8, and the row weight of {2 4 8 16 3 5 9 6 17 10 18 12 20 24} is 4. The most reliable K=11 positions in the first position set are {21 26 25 22 28 15 23 27}. If 29 30 31}, then the minimum row weight w corresponding to these 11 positions is... min It is 8. Assume... If the value is 6, then the row weight in the first position set is equal to w. min =8 is the most reliable The positions are {14 2126 25 22 28}, which is the set of positions for the first check bit. The least reliable position in the first set is... The positions are {2 4 8 16 3 5 9 6 17 10 18 12 20}, which is the set of positions for the second check bit.

[0151] It is understandable that, such as Figure 6 As shown, the K most reliable positions in the first position set can be considered as the second position set. When The row weight in the set less than or equal to the second position is equal to w min When the number of positions is specified, the first set of check bit positions is included in the second set of positions. The row weight in the set greater than the second position is equal to w min When determining the number of positions, some positions in the first set of check bits are included in the second set of positions, while others include positions not in the second set of positions.

[0152] For example, with K equal to 11, n PC Taking the first position set as {2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31} as an example, and the second position set as {21 26 25 22 28 15 23 27 29 30 31}, the minimum row weight w corresponding to these 11 positions is... min The value is 8, assuming If the value is 6, then the first set of check bit positions is {14 21 26 25 22 28}. {21 26 25 22 28} in the first set of check bit positions is included in the second set of positions, while {14} is not included in the second set of positions.

[0153] Step 503: The transmitting device performs polar coding on the information bit sequence according to the set of check bit positions to obtain the encoded bit sequence.

[0154] The transmitting device can determine the information bit position set based on the parity bit position set; and determine the parity bit corresponding to each parity bit position and the information bit corresponding to each information bit position based on the shift register, thus obtaining the encoded bit sequence.

[0155] The information bit location set may include K locations in the first location set other than the check bit location set.

[0156] For example, taking the first set of positions as {2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}, the first set of check bits as {14 21 26 25 22 28}, and the second set of check bits as {2 4 8 16 3 5 9 6 17 10 18 12 20}, the set of information bits can be {24 7 11 19 13 15 23 27 29 30 31}.

[0157] wherein the shift register can be a three-tap shift register denoted as 26 in decimal: g = D 4 + D 3 + D; or, the shift register can also be a single-tap shift register denoted as 16 in decimal: g = D 4 .

[0158] Exemplarily, taking the shift register g = D 4 + D 3 + D as an example, the sending-end device can determine the check bits corresponding to each check bit position and the information bits corresponding to each information bit position according to the following manner to obtain the coded bit sequence:

[0159]

[0160] Exemplarily, taking the shift register g = D 4 as an example, the sending-end device can determine the check bits corresponding to each check bit position and the information bits corresponding to each information bit position according to the following manner to obtain the coded bit sequence:

[0161]

[0162]

[0163] It can be understood that, since the value of a check bit can be determined based on the values of the information bits located in front of the check bit, the above check bit position set can be simplified based on the information bit position set, i.e., the check bit positions in front of which there are information bits are reserved in the check bit position set as valid check bit positions.

[0164] Exemplarily, taking the check bit position set as {2 4 8 16 3 5 9 6 17 10 18 12 20 14 21 26 25 22 28} and the information bit position set as {24 7 11 19 13 15 23 27 29 30 31} as an example, the valid check bit position set can include the following check bit positions in front of which there are information bits: {8 16 9 17 10 18 12 20 14 21 26 25 22 28}.

[0165] In step 504, the sending-end device outputs one or more bits of the coded bit sequence; correspondingly, the receiving-end device receives the to-be-decoded information from the sending-end device.

[0166] wherein the length of the information bit sequence corresponding to the to-be-decoded information is K.

[0167] In this process, one or more bits in the encoded bit sequence sent by the transmitting device to the receiving device may be affected by noise and other interference during transmission through the channel. The information to be decoded received by the receiving device is one or more bits in the encoded bit sequence that have been affected by noise and other interference.

[0168] Step 505: The receiving device determines the second sequence of length M based on the reliability corresponding to the first sequence of length N.

[0169] Step 506: The receiving device determines the set of check bit positions based on the first set of positions in the second sequence.

[0170] The method by which the receiving device determines the set of check bit positions based on steps 505 and 506 can be referred to the method by which the sending device determines the set of check bit positions based on steps 501 and 502, and will not be repeated here.

[0171] Step 507: The receiving device decodes the information to be decoded based on the set of check bit positions.

[0172] The receiving device can determine the information bit position set based on the parity bit position set; and decode the information to be decoded based on the parity bit position set, the information bit position set, and the shift register to obtain the decoding result.

[0173] Based on the above Figure 5 The method shown, the first set of check bit positions The positions are determined based on the first set of positions, which increases the selection range of the first set of check bit positions and ensures the minimum row overlap w among the most reliable K bit positions. min The number of corresponding bit positions can support In larger cases, improving code spectrum performance and decoding performance can better meet the error correction performance requirements of ultra-short code intervals. Under successive cancellation list 8 (SCL8) decoding, it can approach the ML decoding performance of LTE-RM codes.

[0174] In addition, based on the above... A description of the possible values ​​(e.g., any one of 0, 1, 2, 3, 4, 5, 6, 7, or 8), optional. The value of can be determined based on the length K of the information bit sequence and the length E after rate matching.

[0175] For example, the above-mentioned three-tap shift register, represented as 26 in decimal, can be used... Figure 5 The method shown, which iterates through the blocks based on their bit error rate, yields the results shown in Table 3 below. -1 indicates default, i.e. in the scenario corresponding to -1, No optimal value:

[0176] Table 3

[0177]

[0178]

[0179] Based on the optimal values shown in Table 3 above, as shown in Figure 7 , a performance comparison diagram of simulation effects of LTE-RM codes (curve 1) and Polar codes (curve 2) determined based on the method shown in Figure 5 is given under different code lengths and lengths after rate matching. The decoding mode corresponding to the LTE-RM code can be FHT decoding, and the decoding mode corresponding to the Polar code can be SCL8 decoding. The horizontal axis is the length E after rate matching, and the vertical axis is the signal noise ratio (SNR) required to reach a block error rate (BLER) of 0.01. From Figure 7 it can be seen that the Polar code based on the embodiments of the present application can greatly improve the decoding performance and can approach the ML decoding performance of the LTE-RM code under SCL8 decoding.

[0180] In another example, based on the single-tap shift register represented by the decimal 16 above, the method shown in Figure 5 is used to search according to the block error rate to obtain the optimal values shown in Table 4 below. No optimal value: No optimal value:

[0181] Table 4

[0182]

[0183]

[0184] Based on the optimal values shown in Table 4 above, as shown in Figure 8 , a performance comparison diagram of simulation effects of LTE-RM codes (curve 1) and Polar codes (curve 2) determined based on the method shown in Figure 5The diagram illustrates a performance comparison of the simulation results for the Polar code (curve 2) determined by the method shown. The decoding method for the LTE-RM code can be FHT decoding, and the decoding method for the Polar code can be SCL8 decoding. The horizontal axis represents the length E after rate matching, and the vertical axis represents the signal-to-noise ratio (SNR) required to achieve a block error rate (BLER) of 0.01. Figure 8 It can be seen that the Polar code based on the embodiments of this application can greatly improve the decoding performance, and can approach the ML decoding performance of LTE-RM code under SCL8 decoding.

[0185] It is understandable that in different scenarios corresponding to different K and different E, The optimal value may be different or the same in different scenarios. The optimal values ​​are decoupled, meaning that within a scenario... The optimal value will not affect the value in another scenario. The optimal value.

[0186] Optionally, when K is less than or equal to 6, or when the difference between the length E after rate matching and K is less than or equal to 7, the following can be done: When the value of is set to 0, the set of positions for the second check bit is empty.

[0187] For example, as shown in Table 3 above Based on the optimal value, when K is less than or equal to 6, or when the difference between the length E after rate matching and K is less than or equal to 7, When the value of is set to 0, the following table 5 is obtained: The optimal value, where -1 represents the default, that is, in the scenario corresponding to -1, There is no optimal value:

[0188] Table 5

[0189]

[0190]

[0191] Based on the above table 5 The possible values ​​of , such as Figure 9 As shown, the LTE-RM code (curve 1) and its length after rate matching are presented for different code lengths. Figure 5The diagram illustrates a performance comparison of the simulation results for the Polar code (curve 2) determined by the method shown. The decoding method for the LTE-RM code can be FHT decoding, and the decoding method for the Polar code can be SCL8 decoding. The horizontal axis represents the length E after rate matching, and the vertical axis represents the signal-to-noise ratio (SNR) required to achieve a block error rate (BLER) of 0.01. Figure 9 As can be seen from Table 5 The decoding performance curves of the Polar codes corresponding to the given values ​​are almost identical to those shown in Table 3. The decoding performance curves of the Polar codes corresponding to the values ​​of are the same, both being curve 2. Under SCL8 decoding, it can approximate the ML decoding performance of LTE-RM codes.

[0192] In another example, it can be shown in Table 4 above. Based on the optimal value, when K is less than or equal to 6, or when the difference between the length E after rate matching and K is less than or equal to 7, The value of is set to 0, resulting in the values ​​shown in Table 6 below. The optimal value, where -1 represents the default, that is, in the scenario corresponding to -1, There is no optimal value:

[0193] Table 6

[0194]

[0195]

[0196] Based on the above table 6 The possible values ​​of , such as Figure 10 As shown, the LTE-RM code (curve 1) and its length after rate matching are presented for different code lengths. Figure 5 The diagram illustrates a performance comparison of the simulation results for the Polar code (curve 2) determined by the method shown. The decoding method for the LTE-RM code can be FHT decoding, and the decoding method for the Polar code can be SCL8 decoding. The horizontal axis represents the length E after rate matching, and the vertical axis represents the signal-to-noise ratio (SNR) required to achieve a block error rate (BLER) of 0.01. Figure 10 As can be seen from Table 6 The decoding performance curves of the Polar codes corresponding to the given values ​​are almost identical to those shown in Table 4. The decoding performance curves of the Polar codes corresponding to the values ​​of are the same, both being curve 2. Under SCL8 decoding, it can approximate the ML decoding performance of LTE-RM codes.

[0197] It should be noted that each of the embodiments of the present application can be implemented independently or in combination, without limitation. If not specifically stated and there is no logical conflict, the terms and / or descriptions provided in different embodiments of the present application are consistent and can be mutually referred to. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0198] It can be understood that in the embodiments of the present application, the execution subject can execute part or all of the steps in the embodiments of the present application. These steps or operations are only examples, and the embodiments of the present application can also execute other operations or variations of various operations. In addition, each step can be executed in a different order as presented in the embodiments of the present application, and it is possible that not all operations in the embodiments of the present application are executed.

[0199] The above describes the scheme provided by the embodiments of the present application mainly from the perspective of interaction between devices. It can be understood that each device includes a hardware structure and / or software module corresponding to the execution of each function in order to achieve the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0200] The embodiments of the present application can divide the function modules of each device according to the above method examples. For example, each function module can be divided according to each function, or two or more functions can be integrated in one processing module. The above integrated module can be realized in the form of hardware or software function module. It should be noted that the division of modules in the embodiments of the present application is illustrative, and is only a logical function division. Actual implementation can have another division method.

[0201] In the case of dividing each function module according to each function, Figure 11 A sending end device 110 is shown, which can execute the above Figure 5 to Figure 10 The actions performed by the sending end device in the method shown above, all related contents of each step involved in the method embodiment can be referred to the function description of the corresponding function module, and the technical effects that can be obtained can be referred to the above method embodiment, which will not be described here.

[0202] The transmitting device 110 may include a transceiver module 1101 and a processing module 1102. Exemplarily, the transmitting device 110 may be a communication device, or a chip or other combination device or component having the aforementioned transmitting device functions. When the transmitting device 110 is a communication device, the transceiver module 1101 may be a transceiver, which may include an antenna and radio frequency circuits; the processing module 1102 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 110 is a component having the aforementioned transmitting device functions, the transceiver module 1101 may be a radio frequency unit; the processing module 1102 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 110 is a chip system, the transceiver module 1101 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1102 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 1101 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 1102 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0203] For example, transceiver module 1101 can be used to perform... Figure 5 to Figure 10 In the illustrated embodiment, all transmit and receive operations performed by the transmitting device, and / or other processes used to support the techniques described herein; processing module 1102 can be used to perform Figure 5 to Figure 10 The embodiments shown include all operations performed by the transmitting device other than the sending and receiving operations, and / or other processes used to support the techniques described herein.

[0204] Figure 12 A receiving device 120 is shown, which can perform the above-described... Figure 5 to Figure 10 The actions performed by the receiving device in the method shown, and all related content of each step involved in the above method embodiments, can be referenced from the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0205] The receiving end device 120 can include a transceiver module 1201 and a processing module 1202. For example, the receiving end device 120 can be a communication device, or a chip or other combination device or component applied in the communication device and having the functions of the receiving end device, etc. When the receiving end device 120 is a communication device, the transceiver module 1201 can be a transceiver, which can include an antenna and a radio frequency circuit, etc. The processing module 1202 can be a processor (or processing circuit), for example, a baseband processor, which can include one or more CPUs. When the receiving end device 120 is a component having the functions of the receiving end device, the transceiver module 1201 can be a radio frequency unit. The processing module 1202 can be a processor (or processing circuit), for example, a baseband processor. When the receiving end device 120 is a chip system, the transceiver module 1201 can be an input / output interface of a chip (for example, a baseband chip). The processing module 1202 can be a processor (or processing circuit) of the chip system, which can include one or more central processing units. It should be understood that the transceiver module 1201 in the embodiments of the present application can be implemented by a transceiver or a transceiver-related circuit component. The processing module 1202 can be implemented by a processor or a processor-related circuit component (or processing circuit).

[0206] For example, the transceiver module 1201 can be configured to perform all the transceiver operations performed by the receiving end device in the embodiments shown in the figures, and / or other processes for supporting the technologies described herein. Figure 5 to Figure 10 The processing module 1202 can be configured to perform all the operations performed by the receiving end device in the embodiments shown in the figures, and / or other processes for supporting the technologies described herein, except for the transceiver operations. Figure 5 to Figure 10 The processing module 1202 can be configured to perform all the operations performed by the receiving end device in the embodiments shown in the figures, and / or other processes for supporting the technologies described herein, except for the transceiver operations.

[0207] As another implementation manner, Figure 11 The transceiver module 1101 in the sending end device 110 can be replaced by a transceiver, which can integrate the functions of the transceiver module 1101. The processing module 1102 can be replaced by a processor, which can integrate the functions of the processing module 1102. Further, Figure 11 The sending end device 110 can further include a memory. Alternatively, Figure 12 The transceiver module 1201 in the receiving end device 120 can be replaced by a transceiver, which can integrate the functions of the transceiver module 1201. The processing module 1202 can be replaced by a processor, which can integrate the functions of the processing module 1202. Further, Figure 12 The receiving end device 120 can further include a memory.

[0208] Alternatively, when the processing module 1102 is replaced by a processor and the transceiver module 1101 is replaced by a transceiver, the sending end device 110 involved in the embodiments of the present application can also be Figure 13The communication device 130 is shown. Alternatively, when the processing module 1202 is replaced by a processor and the transceiver module 1201 is replaced by a transceiver, the receiving end device 120 related to the embodiments of the present application can also be a Figure 13 The communication device 130 is shown.

[0209] The processor can be a logic circuit 1301, and the transceiver can be an interface circuit 1302. Further, Figure 13 The communication device 130 can also include a memory 1303.

[0210] The embodiments of the present application also provide a computer program product, which can realize the functions of any of the above method embodiments when executed by a computer.

[0211] The embodiments of the present application also provide a computer program, which can realize the functions of any of the above method embodiments when executed by a computer.

[0212] The embodiments of the present application also provide a computer readable storage medium. All or part of the processes of the above method embodiments can be completed by a computer program instructing related hardware, which can be stored in the above computer readable storage medium. When the program is executed, the processes of the above method embodiments can be included. The computer readable storage medium can be an internal storage unit of the terminal (including the data sending end and / or the data receiving end) of any of the preceding embodiments, such as a hard disk or a memory of the terminal. The computer readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. Further, the computer readable storage medium can include both the internal storage unit and the external storage device of the terminal. The computer readable storage medium is used to store the above 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.

[0213] It should be noted that the terms "first" and "second" and the like in the specification, claims and drawings of the present application are used to distinguish different objects, and are not used to describe a specific order. "First", "second" are only for description purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Therefore, the features defined with "first", "second" can explicitly or implicitly include one or more features. In the description of the embodiments, unless otherwise specified, the meaning of "multiple" is two or more.

[0214] Furthermore, the term "comprising" and "including" and their variants are intended to be broad and not to exclude other features or steps. For example, a process, method, system, product or apparatus that comprises a list of steps or units is not necessarily limited to those steps or units which are recited but can include additional steps or units which are not expressly listed or which are inherent to such process, method, product or apparatus.

[0215] It should be understood that, in the present application, "at least one" means one or more. "Multiple" means two or more. "At least two" means two or three and more. "And / or", used to describe the relationship between the associated objects, means that there can be three relationships. For example, "A and / or B" can mean that there are three cases: only A, only B and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally represents that the associated objects before and after are in an "or" relationship. "At least one of the following" or similar expressions means any combination of these items, including any combination of single or multiple items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b and c can be single or multiple. "When" and "if" both mean that under certain objective circumstances, the corresponding processing will be done, not limited by time, and also does not require the implementation of the judgment action, nor means that there are other limitations.

[0216] In the embodiments of the present application, the words "exemplary" or "for example" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the exemplary or example embodiments are presented so as to best explain the concepts in the context of the embodiments.

[0217] In the present application, "sending information to (terminal device)" can be understood as the destination of the information is the terminal device. It can include direct or indirect sending of information to the terminal device. "Receiving information from (terminal device)" can be understood as the source of the information is the terminal device, which can include direct or indirect receiving of information from the terminal device. The information between the source and the destination of the information sending may be processed as necessary, such as format change, etc., but the destination can understand the valid information from the source.

[0218] Those skilled in the art can clearly understand the above-mentioned technical solutions from the description of the above-mentioned embodiments. For the convenience and brevity of description, only the division of the above-mentioned functional modules is taken as an example. In actual application, the above-mentioned functions can be completed by different functional modules according to the needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.

[0219] In several embodiments provided in the present application, it should be understood that the disclosed device and method can be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the modules or units is only a logical function division. In actual implementation, another division mode can be used. For example, multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units or components shown or discussed can be indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0220] The units described as separate components can or can not be physically separated, and the components shown as units can be one physical unit or multiple physical units, that is, they can be located in one place or distributed in multiple different places. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.

[0221] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0222] The integrated unit, if realized in the form of a software functional unit and sold or used as an independent product, can be stored in a readable storage medium. Based on this understanding, the technical solutions of the embodiments of the present application can be essentially embodied in the form of a software product, which is stored in a storage medium and includes a plurality of instructions for causing an apparatus (which can be a single-chip microcomputer, a chip, etc.) or a processor to execute all or part of the steps of the method described in the embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk, and various storage media that can store program codes.

Claims

1. A communication method characterized by comprising: The method comprises: determining a second sequence with a length of M according to reliabilities corresponding to a first sequence with a length of N; wherein the second sequence comprises positions in the first sequence other than positions of pre-frozen bits and positions of rate matching bits; According to a first position set in the second sequence, a check bit position set is determined; wherein the first position set includes K+n PC most reliable positions in the second sequence, K is a length of an information bit sequence, n PC is a number of check bits, the check bit position set includes a first check bit position set and a second check bit position set, the first check bit position set includes K min most reliable positions in the first position set with a row weight equal to w , the second check bit position set includes K least reliable positions in the first position set, and w min is a minimum row weight corresponding to K most reliable positions in the first position set. performing polar encoding on the information bit sequence according to the set of check bit positions to obtain an encoded bit sequence; outputting one or more bits of the encoded bit sequence.

2. The method of claim 1, wherein the n PC less than or equal to the difference between the M and the K.

3. The method according to claim 1 or 2, characterized in that, the performing polar encoding on the information bit sequence according to the set of check bit positions to obtain an encoded bit sequence comprises: determining a set of information bit positions according to the set of check bit positions; wherein the set of information bit positions comprises K positions in the first set of positions other than the set of check bit positions; determining, according to a shift register, a check bit corresponding to each check bit position and an information bit corresponding to each information bit position to obtain the encoded bit sequence.

4. The method of claim 3, wherein the shift register is a three-tap shift register represented as 26 in decimal; or the shift register is a single-tap shift register represented as 16 in decimal.

5. The method of any one of claims 1-4, wherein The Is determined according to the K and the length E after rate matching.

6. The method of any one of claims 1-5, wherein When the K is less than or equal to 6, or a difference between the length E after rate matching and the K is less than or equal to 7, the is equal to 0, and the second set of check bit positions is empty.

7. A communication method characterized by comprising: The method comprises: receiving to-be-decoded information from a sending end device; wherein a length of an information bit sequence corresponding to the to-be-decoded information is K; determining a second sequence with a length of M according to reliabilities corresponding to a first sequence with a length of N; wherein the second sequence comprises positions in the first sequence other than positions of pre-frozen bits and positions of rate matching bits; According to a first position set in the second sequence, a check bit position set is determined; wherein the first position set includes K+n PC most reliable positions in the second sequence, K is a length of an information bit sequence, n PC is a number of check bits, the check bit position set includes a first check bit position set and a second check bit position set, the first check bit position set includes K min most reliable positions in the first position set with a row weight equal to w , the second check bit position set includes K least reliable positions in the first position set, and w min is a minimum row weight corresponding to K most reliable positions in the first position set. performing decoding on the to-be-decoded information according to the set of check bit positions.

8. The method of claim 7, wherein, The method further comprises: the n PC less than or equal to the difference between the M and the K.

9. The method according to claim 7 or 8, characterized in that, the performing decoding on the to-be-decoded information according to the set of check bit positions comprises: determining a set of information bit positions according to the set of check bit positions; wherein the set of information bit positions comprises K positions in the first set of positions other than the set of check bit positions; performing decoding on the to-be-decoded information according to the set of check bit positions, the set of information bit positions, and a shift register.

10. The method of claim 9, wherein the shift register is a three-tap shift register represented as 26 in decimal; or the shift register is a single-tap shift register represented as 16 in decimal.

11. The method of any one of claims 7-10, wherein The Is determined according to the K and the length E after rate matching.

12. The method of any one of claims 7-11, wherein When the K is less than or equal to 6, or a difference between the length E after rate matching and the K is less than or equal to 7, the is equal to 0, and the second set of check bit positions is empty.

13. A communications device, characterized by the communication device comprises a processor; and the processor is configured to run a computer program or instructions so that the communication method of any one of claims 1-6 is performed, or so that the communication method of any one of claims 7-12 is performed.

14. A communications device, characterized by The communication device comprises an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; the logic circuit is configured to execute the communication method according to any one of claims 1-6, or execute the communication method according to any one of claims 7-12, and process and / or generate the information according to the information.

15. A computer readable storage medium, characterized in that, The computer readable storage medium stores computer instructions or programs, when the computer instructions or programs are run on a computer, the communication method according to any one of claims 1-6 is executed, or the communication method according to any one of claims 7-12 is executed.

16. A computer program product, characterised in that, The computer program product comprises computer instructions; when part or all of the computer instructions are run on a computer, the communication method according to any one of claims 1-6 is executed, or the communication method according to any one of claims 7-12 is executed.

Images