CODING METHOD AND APPARATUS

TECHNICAL FIELD

This application relates to the field of wireless communication technologies, and in particular, to a coding method and an apparatus.

BACKGROUND

In the field of communication technologies, a communication device (for example, a terminal device or a base station) may perform channel coding by using a polar code. Currently, polar coding gradually becomes a mainstream coding scheme. A sending device may perform polar code encoding on information bits. The sending device punctures or shortens encoded bits, modulates the bits, and sends the bits to a receiving device through channel transmission. The receiving device may perform polar code decoding on received codewords.

However, polar codes used in an existing system are non-systematic codes, and cannot support coding and retransmission in JSCC.

SUMMARY

This application provides a coding method and an apparatus, to effectively use a probability distribution feature of to-be-coded source bits, and improve transmission performance.

According to a first aspect, an encoding method is provided. The method may be performed by a sending device, or may be performed by a chip having a function similar to that of a sending device. It may be understood that the sending device may be a network device or a terminal device. In the method, the sending device may determine a mother code in a k^thtransmission based on a length of to-be-transmitted bits in the k^thtransmission. k is an integer greater than or equal to 2. The sending device may perform systematic polar encoding on to-be-coded bits in the k^thtransmission based on the mother code, to obtain the to-be-transmitted bits. The sending device may send the to-be-transmitted bits. In a possible case, when the length of the to-be-transmitted bits in the k^thtransmission is greater than a length of non-transmitted bits in a (k-1)^thtransmission, a location index set that is of the to-be-transmitted bits and that is in the mother code in the k^thtransmission is determined based on a location index set src_kthat is of source bits in the k^thtransmission and that is in the mother code in the k^thtransmission, a location index set frz′_k-1, that is of frozen bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission, and a location index set frz_kthat is of frozen bits in the k^thtransmission and that is in the mother code in the k^thtransmission. In another possible case, when the length of the to-be-transmitted bits in the k^thtransmission is less than or equal to a length of non-transmitted bits in a (k-1)^thtransmission, a location index set that is of the to-be-transmitted bits and that is in the mother code in the k^thtransmission is determined based on a location index set R′_k-1that is of the non-transmitted bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission.

Based on the solution, bits in a retransmission phase are encoded through systematic polar encoding, so that a probability distribution feature of to-be-coded source bits is effectively used, and retransmission performance is improved.

In a possible implementation, when the length of the to-be-transmitted bits in the k^thtransmission is less than or equal to the length of the non-transmitted bits in the (k-1)^thtransmission, elements in the location index set that is of the to-be-transmitted bits and that is in the mother code in the k^thtransmission include elements in R′_k-1.

Based on the solution, when the length of the to-be-transmitted bits in the k^thtransmission is less than or equal to the length of the non-transmitted bits in the (k-1)^thtransmission, it may be considered that a quantity of non-transmitted bits in the (k-1)^thtransmission can meet a requirement of a quantity of to-be-retransmitted bits in the k^thtransmission. Therefore, coding complexity can be reduced without changing a length of the mother code.

In a possible implementation, the sending device may determine a location index set that is of first bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission. The first bits include source bits, cyclic redundancy check CRC bits, and frozen bits. The sending device performs rate matching on the mother code in the k^thtransmission, to obtain a location index set R_kthat is of non-transmitted bits in the k^thtransmission and that is in the mother code in the k^thtransmission. The sending device determines the location index set src_kthat is of the source bits in the k^thtransmission and that is in the mother code in the k^thtransmission based on a location index set src′_k-1that is of the source bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission, R′_k-1, the mother code in the k^thtransmission, a mother code in the (k-1)^thtransmission, and R_k.

Based on the solution, the sending device can determine the location index set src_kthat is of the source bits in the k^thtransmission and that is in the mother code in the k^thtransmission, so that the sending device can determine locations of the to-be-transmitted bits in the mother code in the k^thtransmission.

In a possible implementation, elements included in the location index set that is of the first bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission are a sum of location indexes that are of the first bits in the (k-1)^thtransmission and that are in the mother code in the (k-1)^thtransmission and a length of the mother code in the (k-1)^thtransmission.

In an example, the location index set that is of the source bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission is src′_k-1=src_k-1+N_m,k-1. A location index set that is of PC bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission is pc′_k-1=pc_k-1+N_m,k-1, a location index set that is of the frozen bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission is frz′_k-1=frz_k-1+N_m,k-1, the location index set that is of the non-transmitted bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission is R′_k-1=R_k-1+N_m,k-1, and a location index set that is of the CRC bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission is chk′_k-1=chk_k-1+N_m,k-1.

In another example, src′_k-1=src_k-1+N_m,k/2, pc,_k-1=pc_k-1+N_m,k/2·frz′_k-1=frz_k-1+N_m,k/2, R′_k-1=R_k-1+N_m,k/2, and chk′_k-1=chk_k-1+N_m,k/2.

Based on the solution, the sending device can update the location indexes that are of the first bits in the (k-1)^thtransmission and that are in the mother code in the k^thtransmission, so that the first bits in the (k-1)^thtransmission occupy location indexes with higher bit reliability.

In a possible implementation, the sending device determines a first union set of a location index set in the mother code in the (k-1)^thtransmission, src′_k-1, and the location index set R′_k-1that is of the non-transmitted bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission. The sending device determines a first difference set between the first union set and R_k. The sending device sorts location indexes in the first difference set in descending order of bit reliability. The sending device selects top-ranked N_Slocation indexes as src_k. Optionally, the sending device selects top-ranked location indexes that satisfy G_k(Δsrc_k, frz′_k-1)=o as src_k. G_krepresents a polar matrix of a polar code whose length is N_m,k, and Δsrc_k=src_k/src′_k-1.

Based on the solution, the sending device can select N_Smost reliable location indexes as src_k.

In a possible implementation, the sending device uses a difference set between src′_k-1and src_kas a location index set Δpc_kof target parity check PC bits in the k^thtransmission. The sending device uses a union set of a location index set pc′_k-1, that is of PC bits in a first transmission to the (k-1)^thtransmission and that is in the mother code in the k^thtransmission and Δpc_kas a location index set pc_kof PC bits in the first transmission to the k^thtransmission. The sending device uses a difference set between a location index set in the mother code in the k^thtransmission and pc_k, src_k, R_k, and a location index set chk_kof CRC bits in the k^thtransmission as frz_k. Location indexes of the to-be-transmitted bits include elements in Δpc_kand in a difference set between frz_kand frz′_k-1.

Based on the solution, the sending device can determine locations of the to-be-transmitted bits in the mother code in the k^thtransmission, to send the to-be-transmitted bits.

In a possible implementation, the sending device determines a second union set of a location index set in the mother code in the (k-1)^thtransmission and R′_k-1. The sending device determines a second difference set between the second union set and R_k. The sending device sorts location indexes in the second difference set in descending order of bit reliability. The sending device selects top-ranked N_PClocation indexes as a location index set Δsrc_kof target source bits in the k^thtransmission. The sending device selects lower-ranked N_PClocation indexes in src′_k-1as a location index set Δpc_kof target PC bits in the k^thtransmission. The sending device determines a difference set between src′_k-1and Δpc_k. The sending device uses a union set of Δsrc_kand the difference set between src′_k-1and Δpc_kas src_k. Optionally, the sending device may select top-ranked N_PClocation indexes that satisfy G_k(Δsrc_k, frz′_k-1)=o as Δsrc_k.

Based on the solution, the sending device can select N_PCmost reliable location indexes as location indexes that are of source bits newly added in the k^thtransmission and that are in the mother code.

In a possible implementation, the sending device uses a difference set between a location index set in the mother code in the k^thtransmission and pc_k, src_k, R_k, and a location index set chk_kof CRC bits in the k^thtransmission as frz_k. Location indexes of the to-be-transmitted bits include elements in Δpc_kand in a difference set between frz_kand frz′_k-1.

Based on the solution, the sending device can determine locations of the to-be-transmitted bits in the mother code in the k^thtransmission, to send the to-be-transmitted bits.

In a possible implementation, the rate matching includes shortening or puncturing.

Based on the solution, the sending device can determine the non-transmitted bits in a shortening or puncturing manner, and further determine the location index set that is of the non-transmitted bits and that is in the mother code in the k^thtransmission.

In a possible implementation, a value of a bit corresponding to an element in Δsrc_kis the same as a value of a bit corresponding to an element in Δpc_k.

Based on the solution, the sending device can perform one-to-one check on bits corresponding to elements in Δsrc_kand bits corresponding to elements in Δpc_k. According to a second aspect, a decoding method is provided. The method may be performed by a receiving device, or may be performed by a chip having a function similar to that of a receiving device. It may be understood that the receiving device may be a network device or a terminal device. In the method, the receiving device receives to-be-transmitted bits in a k^thtransmission from a sending device. The receiving device may decode the to-be-transmitted bits. In a possible case, when a length of the to-be-transmitted bits in the k^thtransmission is greater than a length of non-transmitted bits in a (k-1)^thtransmission, a location index set that is of the to-be-transmitted bits and that is in a mother code in the k^thtransmission is determined based on a location index set src_kthat is of source bits in the k^thtransmission and that is in the mother code in the k^thtransmission, a location index set frz′_k-1that is of frozen bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission, and a location index set frz_kthat is of frozen bits in the k^thtransmission and that is in the mother code in the k^thtransmission. In another possible case, when a length of the to-be-transmitted bits in the k^thtransmission is less than or equal to a length of non-transmitted bits in a (k-1)^thtransmission, a location index set that is of the to-be-transmitted bits and that is in a mother code in the k^thtransmission is determined based on a location index set R′_k-1that is of the non-transmitted bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission.

In a possible implementation, the location index set src_kthat is of the source bits in the k^thtransmission and that is in the mother code in the k^thtransmission is determined based on a location index set src′_k-1that is of the source bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission, R′_k-1, the mother code in the k^thtransmission, a mother code in the (k-1)^thtransmission, and R_k.

In a possible implementation, elements included in a location index set that is of first bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission are a sum of location indexes that are of the first bits in the (k-1)^thtransmission and that are in the mother code in the (k-1)^thtransmission and a length of the mother code in the (k-1)^thtransmission. The first bits include source bits, cyclic redundancy check CRC bits, and frozen bits.

In a possible implementation, the location index set src_kthat is of the source bits in the k^thtransmission and that is in the mother code in the k^thtransmission is top-ranked N_Slocation indexes in a first difference set. The first difference set is a difference set between a first union set and R_k, and the first union set is a union set of a location index set in the mother code in the (k-1)^thtransmission, src′_k-1, and the location index set R′_k-1, that is of the non-transmitted bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission.

In a possible implementation, location indexes of the to-be-transmitted bits include elements in Δpc_kand in a difference set between frz_kand frz′_k-1, frz_kis determined based on a difference set between a location index set in the mother code in the k^thtransmission and a location index set pc_kof PC bits in a first transmission to the k^thtransmission, src_k, R_k, and a location index set chk_kof CRC bits in the k^thtransmission. pc_kis determined based on a difference set between src′_k-1and src_kand a location index set pc′_k-1that is of PC bits in the first transmission to the (k-1)^thtransmission and that is in the mother code in the k^thtransmission.

In a possible implementation, src_kis determined based on a union set of a difference set between src′_k-1and a location index set Δpc_kof target PC bits in the k^thtransmission and a location index set Δsrc_kof target source bits in the k^thtransmission. Δpc_kincludes lower-ranked N_PClocation indexes in src′_k-1, Δsrc_kincludes top-ranked N_PClocation indexes in a second difference set. The second difference set is a difference set between a second union set and R_k. The second union set is a union set of the location index set in the mother code in the (k-1)^thtransmission and R′_k-1.

In a possible implementation, the rate matching includes shortening or puncturing.

In a possible implementation, a value of a bit corresponding to an element in Δsrc_kis the same as a value of a bit corresponding to an element in Δpc_k.

According to a third aspect, an embodiment of this application provides a communication apparatus. The apparatus may be a sending device, or may be a chip or a module used in a sending device. The apparatus has a function of implementing any implementation method of the first aspect. The function may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or the software includes one or more modules or units corresponding to the function.

According to a fourth aspect, an embodiment of this application provides a communication apparatus. The apparatus may be a receiving device, or may be a chip or a module used in a receiving device. The apparatus has a function of implementing any implementation method of the second aspect. The function may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or the software includes one or more modules or units corresponding to the function.

According to a fifth aspect, this application provides a communication apparatus, including a processor, where the processor is coupled to a memory, the memory is configured to store a computer program or instructions, and the processor is configured to execute the computer program or the instructions, to perform the implementation methods in the first aspect and the second aspect. The memory may be located inside or outside the apparatus. There is one or more processors.

According to a sixth aspect, this application provides a communication apparatus, including: a processor and an interface circuit, where the interface circuit is configured to communicate with another apparatus, and the processor is configured to perform the implementation methods in the first aspect and the second aspect.

According to a seventh aspect, a communication apparatus is provided. The apparatus includes a logic circuit and an input/output interface.

In a design, the logic circuit is configured to determine a mother code in a k^thtransmission based on a length of to-be-transmitted bits in the k^thtransmission, and perform systematic polar encoding on to-be-coded bits in the k^thtransmission based on the mother code, to obtain the to-be-transmitted bits. The input/output interface is configured to output the to-be-transmitted bits.

In a design, the input/output interface is configured to input to-be-transmitted bits in a k^thtransmission from a sending device. The logic circuit is configured to decode the to-be-transmitted bits.

According to an eighth aspect, this application provides a communication system, including: a communication apparatus configured to perform the implementation method in the first aspect, and a communication apparatus configured to perform the implementation method in the second aspect.

According to a ninth aspect, this application further provides a chip system, including: a processor, configured to implement the implementation methods in the first aspect and the second aspect.

According to a tenth aspect, this application further provides a computing program product, including computer-executable instructions. When the computer-executable instructions are run on a computer, the implementation methods in the first aspect and the second aspect are implemented.

According to an eleventh aspect, this application further provides a computer-readable storage medium. The computer-readable storage medium stores a computer program or instructions. When the computer program or the instructions are run on a computer, the implementation methods in the first aspect and the second aspect are implemented.

For technical effects that can be achieved in the second aspect to the eleventh aspect, refer to technical effects that can be achieved in each design in the first aspect. Details are not described herein again.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of a communication system according to an embodiment of this application;

FIG. 2A shows a polar-based JSCC solution according to an embodiment of this application;

FIG. 2B shows a polar-based retransmission solution according to an embodiment of this application;

FIG. 3 is a diagram of an architecture of an encoding method according to an embodiment of this application;

FIG. 4 is an example flowchart of an encoding method according to an embodiment of this application;

FIG. 5A is a diagram of location indexes of source bits and CRC bits according to an embodiment of this application;

FIG. 5B is a diagram of encoding in a retransmission phase according to an embodiment of this application;

FIG. 6 is a diagram of encoding in a retransmission phase according to an embodiment of this application;

FIG. 7 is a diagram of a decoding manner according to an embodiment of this application;

FIG. 8 is a diagram of a communication apparatus according to an embodiment of this application;

FIG. 9 is a diagram of a communication apparatus according to an embodiment of this application;

FIG. 10 is a diagram of a communication apparatus according to an embodiment of this application; and

FIG. 11 is a diagram of a communication apparatus according to an embodiment of this application.

DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS

The technical solutions provided in embodiments of this application are explained and described below with reference to the accompanying drawings.

Embodiments of this application may be applied to a plurality of fields in which polar coding is used, for example, the data storage field, the optical network communication field, and the wireless communication field. The wireless communication field may include but is not limited to a 5G communication system, a future communication system (for example, a 6G communication system), a satellite communication system, a narrowband-internet of things (NB-IoT) system, a global system for mobile communications (GSM), an enhanced data rates for GSM evolution (EDGE) system, a wideband code division multiple access (WCDMA) system, a code division multiple access 2000 (CDMA2000) system, a time division-synchronous code division multiple access (TD-SCDMA) system, a long term evolution (LTE) system, and three major application scenarios of a 5G mobile communication system: eMBB, ultra-reliable low-latency communication (URLLC), and massive machine-type communications (mMTC).

With reference to FIG. 1, the following describes a communication system to which an encoding method and a decoding method provided in embodiments of this application are applicable. Refer to FIG. 1. The communication system 100 includes a sending device 101 and a receiving device 102. The sending device 101 may be a network device or a terminal device, and the receiving device 102 may be a network device or a terminal device. Optionally, when the sending device 101 is a network device, the receiving device 102 may be a terminal device. When the receiving device 102 is a network device, the sending device 101 may be a terminal device.

The sending device 101 may include an encoder. The sending device 101 may perform systematic polar encoding on source bits via the encoder, and output an encoded codeword. The encoded codeword may be transmitted on a channel to the receiving device 102 after being rate matched, interleaved, and modulated. The receiving device 102 may include a decoder. The receiving device 102 may receive and demodulate a signal from the sending device 101. The receiving device 102 may decode the received signal via the decoder.

The terminal device in this application includes a device that provides a voice and/or data connectivity for a user. The terminal device includes a device that provides a voice for the user, includes a device that provides data connectivity for the user, or includes a device that provides a voice and data connectivity for the user. For example, the terminal device may include a handheld device having a wireless connection function or a processing device connected to a wireless modem. The terminal device may include user equipment (UE), a wireless terminal device, a mobile terminal device, a device-to-device (D2D) communication terminal device, a vehicle-to-everything (V2X) terminal device, a machine-to-machine/machine-type communications (M2M/MTC) terminal device, an internet of things (IoT) terminal device, a subscriber unit, a subscriber station, a mobile station, a remote station, an access point (AP), a remote terminal device, an access terminal device, a user terminal device, a user agent, a user device, a satellite, an unmanned aerial vehicle, a balloon, an aircraft, or the like. For example, the terminal device may include a mobile phone (or referred to as a “cellular” phone), a computer having a mobile terminal device, or a portable, pocket-sized, hand-held, or a computer-embedded mobile apparatus. For example, it may be a device such as a personal communication service (PCS) phone, a cordless telephone set, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, or a personal digital assistant (PDA). The terminal device may alternatively include a limited device, for example, a device with relatively low power consumption, a device with a limited storage capability, or a device with a limited computing capability. For example, the terminal device includes an information sensing device such as a barcode, radio frequency identification (RFID), a sensor, a global positioning system (GPS), or a laser scanner. By way of example, and not limitation, in embodiments of this application, the terminal device may alternatively be a wearable device. The wearable device may also be referred to as a wearable intelligent device, an intelligent wearable device, or the like, and is a general term for wearable devices developed by intelligently designing everyday wearing by applying a wearable technology. If the various terminal devices described above are located in a vehicle (for example, placed in the vehicle or installed in the vehicle), the terminal devices may be all considered as vehicle-mounted terminal devices. For example, the vehicle-mounted terminal devices are also referred to as on-board units (OBU).

The network device in this application includes, for example, an access network (AN) device, such as a base station (for example, an access point), and may be a device that is in an access network and that communicates with a wireless terminal device over an air interface through one or more cells. Alternatively, the network device is, for example, a road side unit (RSU) in a vehicle-to-everything (V2X) technology. The network device may include an evolved NodeB (NodeB or eNB or e-NodeB) in a long term evolution (LTE) or long term evolution-advanced (LTE-A) system, or may include a next generation NodeB (gNB) in an evolved packet core (EPC), a 5th generation mobile communication technology (5G), a new radio (NR) system (also referred to as an NR system for short), or may include a central unit (CU) and a distributed unit (DU) in a cloud access network (Cloud RAN) system, a satellite, an unmanned aerial vehicle, a balloon, an aircraft, or the like. This is not limited in embodiments of this application.

Based on a separate source and channel coding (SSCC) solution, an existing communication system using a cellular communication technology, a wireless communication technology (Wi-Fi), or the like first performs source coding or compression processing on to-be-sent source data, performs channel coding on compressed data, and adds redundancy, to improve reliability of information transmission. The source coding is usually completed at an application layer, and the channel coding is usually completed at a physical layer. Traditional source coding, such as source coding for pictures, videos, voices, and texts, is not error-resistant. Therefore, channel coding needs to be performed at the physical layer in combination with a mechanism such as retransmission, so that a receiving end completes error-free recovery of bits transmitted at the physical layer. For the physical layer, channel coding and transmission are mainly performed on bit streams obtained through conventional source coding. It is assumed that ideal source coding has been completed at an upper layer, and an approximately equal sequence is obtained. Generally, only a lossless transmission mode is supported. However, in actual application, some data that is not fully compressed, for example, control information from a link layer or the physical layer, to-be-fed-back channel state information, and some upper-layer application data, may be processed at the physical layer.

To make full use of source redundancy at the physical layer and improve transmission performance, joint source and channel coding (JSCC) is a solution that can implement both source compression and channel protection. Compared with SSCC, JSCC has significant performance gains in short code scenarios. Moreover, JSCC can support more possible transmission modes, such as lossy transmission. In addition, JSCC can flexibly control distortion of reconstructed data at the receiving end, and can adapt to different application requirements.

FIG. 2A describes a systematic polar code-based JSCC solution. In this procedure, a transmitting end may perform systematic polar encoding on to-be-coded bits. To implement a specific compression function, the transmitting end performs a puncturing operation on system bits in encoded bits. In other words, the transmitting end may send only check bits. The transmitting end modulates punctured bits, and sends the punctured bits to a receiving end through a channel. The receiving end may obtain the check bits through demodulation. The receiving end may perform systematic polar decoding based on the check bits and probability distribution information of the to-be-coded bits. The probability distribution information of the to-be-coded bits may be determined by the receiving end in a preset manner. A manner in which the receiving end obtains the probability distribution information of the to-be-coded bits is not limited in this application.

It can be seen from FIG. 2A that, in the systematic polar code-based JSCC solution, only a transmission mode during initial transmission is provided, and there is no corresponding retransmission design. To switch between a lossy transmission mode and a lossless transmission mode more effectively, retransmission is also an important scenario for JSCC.

FIG. 2B describes a polar code-based retransmission solution. It can be seen from FIG. 2B that, in an initial transmission phase, a transmitting end may perform polar code encoding on information bits and frozen bits. The transmitting end punctures and modulates encoded bits, and sends the bits to a receiving end through a channel. In a retransmission phase, the transmitting end may sort bit reliability based on an extended mother code. In the extended mother code, there are non-transmitted bits in the initial transmission phase. Bits whose bit reliability ranks top in the bits may be used to transmit information bits with lower bit reliability in the initial transmission phase. The information bits with lower bit reliability may be used as PC bits for one-to-one check. It can be seen from FIG. 2B that, the one-to-one check may be understood as that the PC bits are compared with corresponding information bits with lower bit reliability in the initial transmission phase, so that values of the PC bits and values of the corresponding information bits are the same. The transmitting end may perform polar code encoding on the one-to-one checked bits. The transmitting end may puncture and modulate the bits on which the polar code encoding is performed, and sends the bits to the receiving end through the channel. The receiving end may perform joint decoding based on the one-to-one checked PC bits and the bits received in the initial transmission phase.

In the procedure shown in FIG. 2B, the polar code-based retransmission solution is described. However, polar codes are non-systematic codes, and cannot support coding and retransmission in JSCC.

In view of this, an embodiment of this application provides an encoding method. In the method, bits in a retransmission phase are encoded through systematic polar encoding, so that a probability distribution feature of to-be-coded source bits is effectively used, and retransmission performance is improved.

FIG. 3 is a diagram of an architecture of an encoding method according to an embodiment of this application. A system architecture to which the encoding method provided in this embodiment of this application is applied is shown in FIG. 3. A sending device may select an encoding mode and a parameter based on sparseness of physical layer (PHY) data. When determining that the to-be-transmitted PHY data is sparse, the sending device may select a JSCC mode for encoding, to effectively use redundant information in the PHY data and improve overall transmission performance. The PHY data being sparse may be considered as that a probability distribution p0 of 0 or a probability distribution p1 of 1 is far away from 0.5, for example, less than 0.3 or greater than 0.7. The sending device may add CRC to a transport block (TB) of the PHY data, split, in the selected JSCC mode, the TB with the CRC added into code blocks (CBs), and add CRC to the split CBs. The sending device may perform physical layer coding and rate matching on the CBs with the CRC added. The sending device may perform the physical layer coding in the JSCC mode. The sending device may splice the CBs obtained through the rate matching, scramble the spliced CBs, perform modulation, layer mapping, antenna mapping, and resource mapping on the scrambled CBs, and send the CBs to a receiving device. Optionally, the sending device may add hybrid automatic repeat request (HARQ) information to the CBs with the CRC added, and perform the physical layer coding and the rate matching based on the information.

FIG. 4 is an example flowchart of an encoding method according to an embodiment of this application. The method may include the following operations.

S401: A sending device determines a mother code in a k^thtransmission based on a length of to-be-transmitted bits in the k^thtransmission.

k may be an integer greater than or equal to 1. For example, k may be equal to 1, 2, or 3. Optionally, k may be an integer greater than or equal to 2. It may be understood that k needs to be less than a predefined or preset maximum quantity of transmissions.

In an example, it may be considered that k being 1 indicates an initial transmission phase. In the initial transmission phase, the sending device may set the length N_cof the to-be-transmitted bits and a length N_sof source bits. In this case, the sending device may determine that a length of bits obtained through rate matching is N_k=N_s+N_c. The sending device may obtain a length N_m,k=2^[log²^(N^k^)] of a mother code M₁in the initial transmission phase based on N_k, where [·] represents a rounding up operation. In the formula, the subscript k is equal to 1.

In another example, it may be considered that k being an integer greater than or equal to 2 indicates a retransmission phase. In the retransmission phase, the sending device may set the length N_RT,kof the to-be-transmitted bits. In the retransmission phase, the to-be-transmitted bits may also be referred to as to-be-retransmitted bits. To distinguish between an initial transmission phase and the retransmission phase, the to-be-transmitted bits are referred to as to-be-retransmitted bits below. A length of bits in the k^thtransmission before the rate matching is Σ=_i=2^kN_RT,k+N_c. It may be understood that in different retransmission phases, N_RT,kmay be the same or may be different. Whether N_RT,kis the same may be negotiated by the sending device and the receiving device, or may be predefined in a protocol, or may be indicated by the sending device to the receiving device. The sending device may determine that a length of bits obtained through rate matching is N_k=N_s+N_c+Σ_i=2^kNR_RT,k. For example, when k=2, the length of the bits obtained through the rate matching is N_k=N_s+N_c+N_RT,2. The sending device may obtain a length N_m,k=2^[log²^(N^k^)] of a mother code M_kin the k^thtransmission based on N_k.

S402: The sending device performs systematic polar encoding on to-be-coded bits in the k^thtransmission based on the mother code, to obtain the to-be-transmitted bits.

It should be noted that, in the initial transmission phase and the retransmission phase, processes in which the sending device performs systematic polar encoding on the to-be-coded bits in the k^thtransmission are different. The following separately describes Case 1 and Case 2.

Case 1: Initial Transmission Phase.

In a possible implementation, the sending device may determine locations that are of the to-be-coded bits in the k^thtransmission and that are in the mother code M₁in the first transmission. The to-be-coded bits in the k^thtransmission may include non-transmitted bits, source bits, CRC bits, and frozen bits.

In an example, the sending device performs rate matching on the mother code M₁, to determine a location index set R₁that is of non-transmitted bits in the first transmission and that is in the mother code M₁in the first transmission. For example, the sending device may puncture or shorten the mother code M₁. It may be understood that a rate matching manner of the sending device is not limited in this embodiment of this application. For example, the sending device may puncture the mother code M₁in a sequential puncturing manner or a bit-reversal puncturing manner. For another example, the sending device may shorten the mother code M₁in a sequential shortening manner or a bit-reversal shortening manner.

The non-transmitted bits may be understood as bits that are punctured or shortened after the sending device performs the rate matching on the mother code M₁. For example, the non-transmitted bits may include punctured bits shown in FIG. 2B. The sending device may determine, through the rate matching, the location index set R₁that is of the non-transmitted bits and that is in the mother code M₁in the first transmission. For example, it can be seen from FIG. 2B that the location index set R₁that is of the non-transmitted bits and that is in the mother code M₁in the first transmission may include a location index set of the punctured bits.

Optionally, the sending device may set elements in the location index set R₁that is of the non-transmitted bits and that is in the mother code M₁in the first transmission as frozen bits. Such frozen bits are non-sent frozen bits. In other words, the sending device may set bit values of bits corresponding to the elements in R₁to 0.

In another example, refer to FIG. 5A. In the initial transmission phase, the sending device may determine, from the mother code M₁in the first transmission, a location index set src₁of source bits and a location index set chk₁of CRC bits. The location index set src₁of the source bits precedes the location index set chk₁of the CRC bits. FIG. 5A is used as an example. Elements in the location index set chk₁of the CRC bits occupy rear location indexes in the mother code M₁. For example, a start location index of the bits in the mother code M₁is 0, a quantity of CRC bits is 4, and the length of the to-be-coded bits is 32. It may be considered that the elements in the location index set chk₁of the CRC bits include a location index 31, a location index 30, a location index 29, and a location index 28. However, location indexes included in elements in the location index set src₁of the source bits start from a location index 27, and a quantity of elements included in the location index set src₁of the source bits is the same as a quantity of source bits.

An example in which a start index of the location indexes in FIG. 5A is 0 is used as an example. It may be understood that the start index of the location indexes may alternatively be 1. This is not limited in this application.

In still another example, the sending device may determine, from the mother code M₁, a location index set frz₁of frozen bits. It should be noted that such frozen bits are to-be-sent frozen bits that do not include the foregoing non-transmitted bits that are set to the frozen bits “o”. It can be seen from FIG. 5A that elements in the location index set frz₁of the to-be-sent frozen bits include location indexes of bits other than the elements included in a location index set R₁of the non-transmitted bits, a location index set chk₁of the CRC bits, and a location index set src₁of the source bits.

In another possible implementation, the sending device may encode the to-be-coded bits based on the foregoing determined location index set. The sending device may assign the to-be-coded bits to corresponding location indexes one by one based on location indexes that are of the to-be-coded bits and that are in the mother code M₁. For example, the sending device may assign the source bits to bits corresponding to elements included in src₁. Refer to FIG. 5B. In an encoding process, the sending device may convert the to-be-transmitted bits into a to-be-sent N_m,1-dimensional row vector. As shown in FIG. 5B, x₁is the to-be-sent N_m,1-dimensional row vector, and x₁(a) represents bits corresponding to a set a in the vector x₁. For example, x₁(src₁) represents source bits in the vector x₁. u₁shown in FIG. 5B is a N_m,1-dimensional row vector, and is an intermediate quantity in a systematic polar encoding process. u₁(a) represents bits corresponding to a set a in the vector u₁. For example, u₁(src₁) represents an intermediate quantity corresponding to locations of source bits in the vector u₁, and element locations in the vector x₁(src₁) are in one-to-one correspondence with element locations in the vector u₁(src₁).

It should be noted that the sending device may perform CRC check. x₁(chk₁)=check(x₁(src₁)) (corresponding to {circle around (1)} in FIG. 5B). It can be seen from FIG. 5B that the CRC check may be performed on x₁(chk₁) by using elements in x₁(src₁), and check represents a check function. It should be noted that a CRC check manner is not limited in this embodiment of this application.

After the CRC check, the sending device may perform preprocessing transformation on the vector x₁to obtain u₁. During the preprocessing transformation, u₁(info₁)=[x₁(info₁)−u₁(frz₁+R₁)*G₁(frz₁+R₁, info₁)]*G₁(info₁)⁻¹(corresponding to {circle around (2)} in FIG. 5B).

u₁(frz₁+R₁) indicates preset values of frozen bits, for example, all the values are o. info₁=src₁+chk₁, indicating an information bit set, and corresponding to a system bit of a systematic polar code. The set operation “+” indicates calculating a union set. G₁represents a polar matrix of a polar code whose length is N_m,1, G₁(a, b) represents a row of a set a corresponding to the polar matrix G₁and a column of a set b corresponding to the polar matrix G₁, and G₁(a) represents the row and a column of the set a corresponding to the polar matrix G₁.

After the preprocessing transformation, the sending device may perform polarization transformation (corresponding to {circle around (3)} in FIG. 5B) on the vector u₁, to obtain encoded frozen bits. During the polarization transformation, x₁(frz₁+R₁)=u₁(info₁)*G₁(info_k, frz₁+R₁)+u₁(frz₁+R₁)*G₁(frz₁+R₁).

After {circle around (1)} to {circle around (3)}, the sending device completes encoding of the to-be-coded bits. The sending device may send the encoded bits to the receiving device based on a rate matching result. The sending device punctures the source bits based on a compression configuration.

Case 2: Retransmission Phase.

In a possible implementation, in the retransmission phase, the length N_m,kof the mother code M_kin the k^thtransmission may be the same as or different from a length N_m,k-1of a mother code M_k-1in a (k-1)^thtransmission.

In a possible implementation, when the length N_RT,kof the to-be-retransmitted bits in the k^thtransmission is greater than a length of non-transmitted bits in the (k-1)^thtransmission, the length N_m,kof the mother code M_kin the k^thtransmission is different from the length N_m,k-1of the mother code M_k-1, in the (k-1)^thtransmission. The sending device may determine locations that are of the to-be-coded bits and that are in the mother code M_kin the k^thtransmission. The to-be-coded bits may include non-transmitted bits, source bits, CRC bits, and frozen bits. Optionally, the to-be-coded bits in the retransmission phase may further include PC bits.

Based on the solution, when the length of the to-be-retransmitted bits N_RT,kin the k^thtransmission is greater than the length of the non-transmitted bits in the (k-1)^thtransmission, it may be considered that a quantity of non-transmitted bits in the (k-1)^thtransmission does not meet a requirement of a quantity of to-be-retransmitted bits in the k^thtransmission. Therefore, the length of the mother code is changed, so that the sending device performs an encoding operation.

In an example, the sending device may determine a location index set that is of first bits in the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission. The first bits include non-transmitted bits, source bits, CRC bits, and frozen bits. In a possible case, elements included in the location index set that is of the first bits in the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission are a sum of location indexes that are of the first bits in the (k-1)^thtransmission and that are in the mother code M_k-1in the (k-1)^thtransmission and a length N_m,k-1of the mother code M_k-1in the (k-1)^thtransmission. For example, a location index set that is of source bits in the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission is src′_k-1=src_k-1+N_m,k-1. A location index set that is of PC bits in the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission is pc′_k-1=pc_k-1+N_m,k-1, a location index set that is of frozen bits in the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission is frz′_k-1=frz_k-1+N_m,k-1, a location index set that is of the non-transmitted bits in the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission is R′_k-1=R_k-1+N_m,k-1, and a location index set that is of CRC bits in the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission is chk′_k-1=chk_k-1+N_m,k-1.

In another possible case, because the length N_m,kof the mother code M_kin the k^thtransmission is twice the length N_m,k-1of the mother code M_k-1in the (k-1)^thtransmission, it may be considered that a half of the length N_m,kof the mother code M_kin the k^thtransmission is the length N_m,k-1of the mother code M_k-1in the (k-1)^thtransmission. Therefore, elements included in the location index set that is of the first bits in the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission are a sum of location indexes that are of the first bits in the (k-1)^thtransmission and that are in the mother code M_k-1in the (k-1)^thtransmission and the half of the length N_m,kof the mother code M_kin the k^thtransmission. For example, src′_k-1=src_k-1+N_m,k/2·pc_k-1=pc_k-1+N_m,k/2, frz′_k-1=frz_k-1+N_m,k/2, R′_k-1=R_k-1+N_m,k/2, and chk′_k-1=chk_k-1+N_m,k/2.

It may be understood that, in the formula, a_k-1may be considered as a location index set that is of the set a and that is in the mother code M_k-1in the (k-1)^thtransmission. For example, R_k-1is a location index set that is of the non-transmitted bits and that is in the mother code M_k-1in the (k-1)^thtransmission.

It should be noted that when k=2, pc_k-1and pc′_k-1are empty sets.

In another example, the sending device may perform rate matching on the mother code M_kin the k^thtransmission, to obtain a location index set R_kthat is of non-transmitted bits in the k^thtransmission and that is in the mother code M_kin the k^thtransmission. For example, the sending device may puncture or shorten the mother code M_k. Puncturing is used as an example. The sending device calculates, based on N_m,kand N_k, a length N_m,k−N_kof bits that currently need to be punctured. In this case, the sending device may obtain, based on a currently selected puncturing scheme and tx_k-1=src′_k-1+pc′_k-1+frz′_k-1+chk′_k-1, the location index set R_k=f_punc(N_m,k-N_k+n)/tx_k-1of the non-transmitted bits in the k^thtransmission, where n is a non-negative integer satisfying |R_k|=N_m,k−N_k, f_punc(m) represents a function for obtaining m puncturing location sets, and |·| represents an operation for calculating a quantity of elements in the set.

Shortening is used as an example. R_k=f_short(N_m,k-N_k+n)/tx_k-1, and f_short(m) represents a function for obtaining m shortening location sets.

In still another example, the sending device may determine src_kbased on src′_k-1, R′_k-1, N_m,k, and R_k. It may be understood that manners of determining src_kby the sending device include Manner 1 and Manner 2, which are separately described below.

Manner 1: The sending device may select N_Smost reliable location indexes from a set [Δ+src′_k-1+R′_k-1)/R_k] as src_k. Δ={1, 2, . . . , N_m,k/2} is a location index set newly added to the mother code in the k^thtransmission. It may be understood that Δ is determined based on a location index set that is of the mother code in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission.

The sending device may determine src_kin the set. [Δ+src′_k-1+R′_k-1)/R_k]. “/” may represent a difference set operation of the set. For example, the sending device may sort location indexes included in the set [Δ+src′_k-1+R′_k-1)/R_k] in descending order of bit reliability. The sending device may select top-ranked N_Slocation indexes that satisfy G_k(Δsrc_k, frz′_k-1)=o as src_k. G_krepresents a polar matrix of a polar code whose length is N_m,k, and Δsrc_k=src_k/src′_k-1.

It should be noted that the sorting in descending order of bit reliability in Manner 1 is merely an example. The sending device may alternatively sort the location indexes included in the set in ascending order of bit reliability. This is not limited in this application. When the sending device sorts the location indexes included in the set [Δ+src′_k-1+R′_k-1)/R_k] in ascending order of bit reliability, the sending device may select lower-ranked N_Slocation indexes that satisfy G_k(Δsrc_k, frz′_k-1)=o as src_k, where Δsrc_k=src_k/src′_k-1.

Based on the solution, the sending device can select N_Smost reliable location indexes from the set as [(Δ+src′_k-1+R′_k-1)/R_k] as src_k, so that performance of the k^thtransmission can be improved, and a decoding success rate can be improved.

Optionally, the sending device may determine pc_kbased on src_k. For example, the sending device may obtain target PC bits, referred to as Δpc_k, where Δpc_k=src′_k-1/src_k. The sending device may combine a location index set pc′_k-1that is of PC bits in the first transmission to the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission with the location index set Δpc_kof the target PC bits in the k^thtransmission, to obtain the location index set pc_kthat is of the PC bits and that is in the mother code M_k. In other words, pc_k=pc′_k-1+Δpc_k. Optionally, bits corresponding to elements included in Δpc_kare used for one-to-one check with bits corresponding to elements included in Δsrc_k.

It may be understood that the location index set of the PC bits in the first transmission is an empty set. pc′_k-1may be considered as the location index set that is of the PC bits in the (k-1)^thtransmission and that is in the mother code M_k. Because the PC bits in the (k-1)^thtransmission also include PC bits in the first transmission to a (k-2)^thtransmission, pc′_k-1may also be considered as the location index set that is of the PC bits in the first transmission to the (k-1)^thtransmission and that is in the mother code M_kin the k^thtransmission.

Based on the solution, the sending device can determine pc_kbased on src_k, so that the sending device can perform PC check on newly added source bits based on the PC bits.

Manner 2: The sending device may determine src_kin a set [Δ+R′_k-1)/R_k].

The sending device may determine a preset quantity N_PCof PC bits. The sending device may select, from the set [Δ+R′_k-1)/R_k], N_PCmost reliable location indexes satisfying G_k(Δsrc_k, frz′_k-1)=o as location indexes Δsrc_kof newly added source bits in the k^thtransmission. For example, the sending device may sort elements in the set in descending order of bit reliability. The sending device may select N_PClocation indexes that rank higher and that satisfy G_k(Δsrc_k, frz′_k-1)=o as Δsrc_k.

It should be noted that the sending device sorts elements in the set [Δ+R′_k-1)/R_k] in descending order of bit reliability is merely shown as an example. Alternatively, the sending device may sort the elements in the set [Δ+R′_k-1)/R_k] in ascending order of bit reliability. Details are not described herein again.

The sending device may select N_PCmost unreliable location indexes from src′_k-1as a location index set Δpc_kof target PC bits. In this case, src_k=src′_k-1/Δpc_k+Δsrc_k, where pC_k=Δpc_k+pc′_k-1. It may be understood that bits corresponding to elements included in Δpc_kare used for one-to-one check with bits corresponding to elements included in Δsrc_k.

Based on Manner 2, the sending device can determine the location indexes of the source bits and the PC bits in the k^thtransmission.

In a possible case, the sending device may determine a location index set frz_kthat is of the frozen bits and that is in the mother code M_kin the k^thtransmission. frz_k={1, 2, . . . , N_m,k}/(src_k+pc_k+R_k+chk_k).

In a possible implementation, the sending device may encode the to-be-coded bits based on the foregoing determined location index set. The sending device may assign the to-be-coded bits to the corresponding location indexes. Refer to FIG. 6. In an encoding process, the sending device may convert the to-be-transmitted bits into a to-be-sent N_m,k-dimensional row vector. As shown in FIG. 6, x_kis the to-be-sent N_m,k-dimensional row vector, and x_k(a) represents bits corresponding to a set a in the vector x_k. u_kshown in FIG. 6 is a N_m,k-dimensional row vector, and is an intermediate quantity in a systematic polar encoding process. u_k(a) represents bits corresponding to a corresponding set a in the vector u_k.

It should be noted that the sending device may perform CRC check. x_k(chk_k)=check(x_k(src_k)) (corresponding to {circle around (1)} in FIG. 6). A CRC check manner is not limited in this embodiment of this application.

After the CRC check, the sending device may perform one-to-one check, in other words, one-to-one PC check x_k(Δpc_k)=x_k(Δsrc_k) (corresponding to {circle around (2)} in FIG. 6), on PC bits and source bits in the vector X_k. The formula may be understood as: comparing, in a one-to-one manner based on the determined location index set Δpc_kof the target PC bits and the location index set Δsrc_kof the newly added source bits and in a sequence of elements in Δpc_kand Δsrc_k, bit values corresponding to the elements included in Δpc_kwith bit values corresponding to the elements included in Δsrc_k, so that values of the checked bits are the same in a one-to-one manner.

After the one-to-one check, the sending device may perform preprocessing transformation on the vector x_kto obtain u_k. During the preprocessing transformation, u_k(info_k)=[x_k(info_k)−u_k(frz_k+R_k)*G_k(frz_k+R_k, info_k)]*G_k(info_k)⁻¹(corresponding to {circle around (3)} in FIG. 6). u_k(frz_k+R_k) indicates preset values of frozen bits, for example, all the values are o. info_k=src_k+chk_k, indicating an information bit set, and corresponding to a system bit of a systematic polar code.

After the preprocessing transformation, the sending device may perform polarization transformation (corresponding to {circle around (4)} in FIG. 6) on the vector u_k. During the polarization transformation, x_k(frz_k+R_k)=u_k(info_k)*G_k(info_k, frz_k+R_k)+u_k(frz_k+R_k)*G_k(frz_k+R_k).

It should be noted that, due to a property of a systematic code, it can be ensured that neither the source bits nor the CRC bits that have been sent in the initial transmission phase and that are in the vector x_kchange. In other words, x_k(src_1,k)=x₁(src₁) and x_k(chk_1,k)=x₁(chk₁). src_1,kand chk_1,krespectively represent location index sets that are of the source bits and the CRC bits in the initial transmission phase and that are in the k^thtransmission.

In addition, the part of frozen bits that have been sent in the initial transmission phase in the vector x_kdoes not change, that is, the vector x_k(frz_1,k)=x₁(frz₁). frz_1,krepresents a location index set of the frozen bits that have been sent in the initial transmission phase and that is in the k^thtransmission.

After {circle around (1)} to {circle around (4)}, the sending device can complete encoding of the to-be-coded bits in the retransmission phase, and the sending device may send the encoded to-be-transmitted bits to the receiving device based on a rate matching result. The sending device punctures the source bits based on a compression configuration.

In another possible implementation, when the length N_RT,kof the to-be-retransmitted bits in the k^thtransmission is less than or equal to a length of non-transmitted bits in the (k-1)^thtransmission, the length N_m,kof the mother code M_kin the k^thtransmission is the same as the length N_m,k-1of the mother code M_k-1, in the (k-1)^thtransmission. Locations of to-be-transmitted bits in the mother code M_kin the k^thtransmission are the same as locations of to-be-transmitted bits in the mother code M_k-1in the (k-1)^thtransmission. The sending device may encode the to-be-coded bits in the manner shown in FIG. 5B. Details are not described herein again.

Optionally, when the length N_RT,kof the to-be-retransmitted bits in the k^thtransmission is less than or equal to the length of the non-transmitted bits in the (k-1)^thtransmission, the sending device may alternatively determine the locations of the to-be-transmitted bits in the k^thtransmission in the manner of determining the locations of the to-be-transmitted bits in the mother code M_kwhen the length N_RT,kof the to-be-retransmitted bits in the k^thtransmission is greater than the length of the non-transmitted bits in the (k-1)^thtransmission. Details are not described herein again.

Based on the solution, when the length of the to-be-retransmitted bits N_RT,kin the k^thtransmission is less than or equal to the length of the non-transmitted bits in the (k-1)^thtransmission, it may be considered that a quantity of non-transmitted bits in the (k-1)^thtransmission can meet a requirement of a quantity of to-be-retransmitted bits in the k^thtransmission. Therefore, coding complexity can be reduced without changing the length of the mother code.

S403: The sending device sends the to-be-transmitted bits.

Correspondingly, the receiving device receives the to-be-transmitted bits.

In a possible case, the to-be-transmitted bits in the initial transmission phase may include other bits than the non-transmitted bits and the punctured source bits. It can be seen from FIG. 5B that the to-be-transmitted bits in the initial transmission phase may include the frozen bits and the CRC bits. In other words, the sending device may send the encoded frozen bits and the encoded CRC bits to the receiving device.

In another possible case, the to-be-transmitted bits in the retransmission phase vary with the length of the mother code. In an example, the to-be-transmitted bits may be bits with highest reliability in the non-transmitted bits in the (k-1)^thtransmission. For example, the non-transmitted bits in the (k-1)^thtransmission may be punctured bits or shortened bits. The sending device may sort the non-transmitted bits in descending order of bit reliability, and select N_RT,kbits whose reliability ranks higher as the to-be-transmitted bits. It may be understood that the sending device may sort the non-transmitted bits in ascending order of bit reliability. Details are not described herein again.

In another example, location indexes of the to-be-transmitted bits may be determined based on Δpc_k, frz_k, and frz′_k-1. For example, a location index set of the to-be-transmitted bits includes elements in Δpc_kand frz_k/frz′_k-1. In other words, the to-be-transmitted bits include bits corresponding to the elements in Δpc_kand frz_k/frz′_k-1.

The following separately describes a puncturing-based systematic polar encoding method and a shortening-based systematic polar encoding method by using Example 1 and Example 2.

Example 1: Puncturing-Based Systematic Polar Encoding Method

The following uses an example in which initial transmission is performed by using a code (14, 10). A code length is 14, 10 information bits include eight source bits and two CRC bits, and a length of frozen bits is 4. All the eight source bits are punctured, and six bits are actually sent, including two CRC bits and four frozen bits. A length of a mother code corresponding to the code is 16, and a length for puncturing is 2. Assuming that the sending device performs bit-reversal puncturing, R₁={1, 9}. It is assumed that a bit reliability order of location indexes that are of the remaining bits and that are in the mother code in the initial transmission phase in ascending order is 2, 3, 5, 4, 6, 7, 10, 11, 13, 8, 12, 14, 15, and 16. The sending device obtains that src₁={6, 7, 8, 10, 11, 12, 13, 14}, chk₁={15, 16}, and frz₁={2, 3, 4, 5} based on the bit reliability order.

In a first retransmission, that is, k=2, it is assumed that a quantity of retransmitted bits is N_RT,2=8. In this case, in the first retransmission, the length N_m,2of the mother code is 32. The length for puncturing is 10. The sending device determines location index sets that are of source bits, non-transmitted bits, CRC bits, and frozen bits in the initial transmission phase and that are in the mother code in the first retransmission. R′₁={17, 25}, where src′₁={22, 23, 24, 26, 27, 28, 29, 30}, chk′₁={31, 32}, frz′₁={18, 19, 20, 21}, and pc′₁={ }. The sending device may determine a newly added location index set Δ={1, 2, . . . , 16} of the mother code. In this way, the sending device may determine a location index set tx₁={18, 19, . . . , 24, 26, 27, . . . , 32} that is of bits sent in the initial transmission phase and that is in the mother code in the first retransmission.

The sending device performs bit-reversal puncturing, to obtain a puncturing location index set {1, 3, 5, 9, 13, 17, 19, 21, 25, 29}. 19, 21, and 29 have been present in tx₁. The sending device may determine that R₂=f_punc(10+5)/tx₁={1, 3, 5, 7, 9, 11, 13, 15, 17, 25}.

The sending device may determine a set [(Δ+src′₁+R′₁)/R₂]={2, 4, 6, 8, 10, 12, 14, 16, 22, 23, 24, 26, 27, 28, 29, 30}. The sending device sorts the elements in the set in ascending order of bit reliability, and a sorting result is 2, 4, 6, 10, 8, 12, 14, 22, 23, 26, 27, 29, 16, 24, 28, 30. The sending device selects eight most reliable elements from the result as a location index set src₂={16, 23, 24, 26, 27, 28, 29, 30} of the source bits. The sending device may determine that pc₂=src′₁/src₂={22}, and Δsrc₂=src₂/src′₁={16}.

The sending device may determine that frz₂={1, 2, . . . , 32}/(src₂+pc₂+R₂+chk₂)={2, 4, 6, 8, 10, 12, 14, 18, 19, 20, 21}. The sending device encodes to-be-coded bits, and sends the to-be-transmitted bits. Location indexes of the to-be-transmitted bits include pc₂={22} and frz₂/frz′₁={2, 4, 6, 8, 10, 12, 14}.

Example 2: Shortening-Based Systematic Polar Encoding Method

The following uses an example in which initial transmission is performed by using a code (14, 10). A code length is 14, 10 information bits include eight source bits and two CRC bits, and a length of frozen bits is 4. It is assumed that all the eight source bits are punctured, and six bits are actually sent, including two CRC bits and four frozen bits. A length of a mother code corresponding to the code is 16, and a length for shortening is 2. If the sending device performs bit-reversal shortening, R₁={8, 16}. It is assumed that a bit reliability order of location indexes that are of the remaining bits and that are in the mother code in the initial transmission phase in ascending order is 1, 2, 3, 5, 9, 4, 6, 7, 10, 11, 13, 12, 14, 15. The sending device obtains that src₁={4, 6, 7, 9, 10, 11, 12, 13}, chk₁={14, 15}, and frz₁={1, 2, 3, 5} based on the bit reliability order.

In a first retransmission, that is, k=2, it is assumed that a quantity of retransmitted bits is N_RT,2=8. In this case, in the first retransmission, the length N_m,2of the mother code is 32. The length for puncturing is 10. The sending device determines location index sets that are of source bits, non-transmitted bits, CRC bits, and frozen bits in the initial transmission phase and that are in the mother code in the first retransmission. src′₁={20, 22, 23, 25, 26, 27, 28, 29}, frz′₁={17, 18, 19, 21}, R′₁={24, 32}, chk′₁={30, 31}, and pc′₁={ }. The sending device may determine a newly added location index set Δ={1, 2, . . . , 16} of the mother code. In this way, the sending device may determine a location index set tx₁={17, 18, . . . , 23, 25, 26, . . . , 31} that is of bits sent in the initial transmission phase and that is in the mother code in the first retransmission.

The sending device performs bit-reversal shortening, to obtain a shortening set {14, 30, 4, 20, 12, 28, 8, 24, 16, 32}. 20, 28, and 30 have been present in tx₁. The sending device may determine that R₂=f_short(10+5)/tx₁={2, 4, 6, 8, 10, 12, 14, 16, 24, 32}.

The sending device may determine a set [(Δ+src′₁+R′₁)/R₂]={1, 3, 5, 7, 9, 11, 13, 15, 20, 22, 23, 25, 26, 27, 28, 29}. The sending device sorts the elements in the set [(Δ+src′₁+R′₁)/R₂] in ascending order of bit reliability, and a sorting result is 1, 3, 5, 9, 7, 11, 13, 25, 20, 15, 22, 23, 26, 27, 29, 28. The sending device selects eight most reliable elements from the result as a location index set src₂={15, 20, 22, 23, 26, 27, 28, 29} of the source bits. The sending device may determine that pc₂=src′₁/src₂={25}, and Δsrc₂=src₂/src′₁={15}.

The sending device may determine that frz₂={1, 2, . . . , 32}/(src₂+pc₂+R₂+chk₂)={1, 3, 5, 7, 9, 11, 13, 17, 18, 19, 21}. The sending device encodes to-be-coded bits, and sends the to-be-transmitted bits. Location indexes of the to-be-transmitted bits include pc₂={25} and frz₂/frz′₁={1, 3, 5, 7, 9, 11, 13}.

Optionally, the embodiment shown in FIG. 4 may further include the following S404.

S404: The receiving device performs systematic polar decoding on the to-be-transmitted bits in the k^thtransmission.

In a possible implementation, the receiving device may decode the received to-be-transmitted bits. In a possible case, in the initial transmission phase, all the source bits are punctured, and soft information (LLR)=log(p₀/p₁) of the source bits is obtained. log(p₀/p₁) is prior information of a probability distribution. LLRs of the frozen bits and the CRC bits are obtained through demodulation. For other punctured bits than the source bits, LLR=o, and for shortened bits, LLR=∞. The sending device may input corresponding LLRs in the to-be-transmitted bits to a decoder, to decode the to-be-transmitted bits. In another possible case, in the retransmission phase, for the source bits, LLR=log(p₀/p₁). For the PC bits LLR=LLR_ch+log(p₀/p₁). LLR_chis soft information obtained through demodulation, and log(p₀/p₁) is prior information of a probability distribution. LLRs of the frozen bits and the CRC bits are obtained through demodulation. For other punctured bits than the source bits, LLR=o, and for shortened bits, LLR=o or ∞. It should be noted that a value of the LLR of the shortened bits is determined based on a polarization relationship. The sending device may input corresponding LLRs in the to-be-transmitted bits to a decoder, to decode the to-be-transmitted bits.

In another possible implementation, in a shortening mode, locations of the shortened bits after retransmission may not be regular enough. As a result, LLRs corresponding to locations of some shortened bits cannot be determined in the initialization phase, and can be reset to w only after decoding is performed at specific locations. It is assumed that a code (7, 5) is obtained after the initial transmission and the first retransmission, and a length of a mother code corresponding to the code is 8, including three source bits, two CRC bits, two sent frozen bits, and one shortened frozen bit. Refer to FIG. 7. The sending device may initialize LLRs of the bits before decoding. The source bits are initialized by using probability distribution information, and both the CRC bits and the sent frozen bits are initialized by using LLR_chobtained through demodulation. Because a polarized shortened bit is obtained by performing an exclusive OR operation on the shortened bit and a source bit at a location 8, a value of the shortened bit is uncertain. Therefore, the LLR of the shortened bit is initialized to o. As the decoding is performed, when the decoding is performed on a bit at a location directly connected to the shortened bit, that is, the source bit at the location 8, the LLR of the shortened bit may be uniquely determined by a preset value of the shortened bit. It is assumed that the value of the shortened bit is 0. Therefore, the shortening bit may be directly set to ∞ or a large value.

It should be noted that, a main difference between a source-aware CC mode and the JSCC mode is that the source bits are not compressed during encoding, and only partial probability distribution information is used during decoding, improving decoding performance. In other words, initialization of the LLR of the source bits during decoding includes two parts: demodulation information during reception and the probability distribution information. For the source bits, LLR=LLR_ch+log(p₀/p₁). When p₁=p₀=0.5 or the receiving device does not send the probability distribution information of the data, the source-aware CC mode may directly fall back to channel coding with systematic polar codes used. When the to-be-transmitted bits sent in the k^thretransmission phase are selected, newly added source bits whose reliability ranks higher are directly sent, and source bits with low bit reliability that are sent in the (k-1)^thtransmission phase are directly used as newly added PC bits.

The following uses an example in which initial transmission is performed by using a code (14, 10). A code length is 14, 10 information bits include eight source bits and two CRC bits, a length of frozen bits is 4, and 14 bits are actually sent. A length of a mother code corresponding to the code is 16, and a length for puncturing is 2. Assuming that the sending device performs bit-reversal puncturing, R₁={1, 9}. It is assumed that a bit reliability order of location indexes that are of the remaining bits and that are in the mother code in the initial transmission phase in ascending order is 2, 3, 5, 4, 6, 7, 10, 11, 13, 8, 12, 4, 15, 16. The sending device obtains that src₁={6, 7, 8, 10, 11, 12, 13, 14}, chk₁={15, 16}, and frz₁={2, 3, 4, 5} based on the bit reliability order.

In a first retransmission, that is, k=2, it is assumed that a quantity of retransmitted bits is N_RT,2=8. In this case, in the first retransmission, the length of the mother code is 32. The length for puncturing is 10. The sending device determines location index sets that are of source bits, non-transmitted bits, CRC bits, and frozen bits in the initial transmission phase and that are in the mother code in the first retransmission. src′₁={22, 23, 24, 26, 27, 28, 29, 30}, frz′₁={18, 19, 20, 21}, R′₁={17, 25}, chk′₁={31, 32}, and pc′1={ }. The sending device may determine a newly added location index set Δ={1, 2, . . . , 16} of the mother code. In this way, the sending device may determine a location index set tx₁={18, 19, . . . , 24, 26, 27, . . . , 32} that is of bits sent in the initial transmission phase and that is in the mother code in the first retransmission.

The sending device may determine a set [(Δ+src′₁+R′₁)/R₂]={2, 4, 6, 8, 10, 12, 14, 16, 22, 23, 24, 26, 27, 28, 29, 30}. The sending device sorts the elements in the set [(Δ+src′₁+R′₁)/R₂] in ascending order of bit reliability, and a sorting result is 2, 4, 6, 10, 8, 12, 14, 22, 23, 26, 27, 29, 16, 24, 28, 30. The sending device selects eight most reliable elements from the result as a location index set src₂={16, 23, 24, 26, 27, 28, 29, 30} of the source bits. The sending device may determine that pc₂=src′₁/src₂={22}, and Δsrc₂=src₂/src′₁={16}.

The sending device may determine that frz₂={1, 2, . . . , 32}/(src₂+pc₂+R₂+chk₂)={2, 4, 6, 8, 10, 12, 14, 18, 19, 20, 21}. The sending device encodes to-be-coded bits, and sends the to-be-transmitted bits. Location indexes of the to-be-transmitted bits include Δsrc₂={16} and frz₂/frz′₁={2, 4, 6, 8, 10, 12, 4}.

Based on the concept of the foregoing embodiments, refer to FIG. 8. An embodiment of this application provides a communication apparatus 800. The apparatus 800 includes a processing unit 801 and a transceiver unit 802. The apparatus 800 may be a sending device, a device used in a sending device, or an apparatus that can support a sending device in performing an encoding method. Alternatively, the apparatus 800 may be a receiving device, a device used in a receiving device, or an apparatus that can support a receiving device in performing an encoding method.

The transceiver unit may also be referred to as a transceiver module, a transceiver, a transceiver machine, a transceiver apparatus, or the like. The processing unit may also be referred to as a processor, a processing board, a processing unit, a processing apparatus, or the like. Optionally, a component that is in the transceiver unit and that is configured to implement a receiving function may be considered as a receiving unit. It should be understood that the transceiver unit is configured to perform a sending operation and a receiving operation on a sending device side or a receiving device side in the foregoing method embodiments, and a component that is in the transceiver unit and that is configured to implement a sending function is considered as a sending unit. In other words, the transceiver unit includes a receiving unit and a sending unit. When the apparatus 800 is used in a sending device, the sending unit included in the transceiver unit 802 of the apparatus 800 is configured to perform a sending operation on the sending device side, for example, send to-be-transmitted bits. The sending unit may send the to-be-transmitted bits to a receiving device. When the apparatus 800 is used in a receiving device, the receiving unit included in the transceiver unit 802 of the apparatus 800 is configured to perform a receiving operation on the receiving device side, for example, receive to-be-transmitted bits. The receiving unit may receive the to-be-transmitted bits from a sending device.

In addition, it should be noted that, if the apparatus is implemented by using a chip/chip circuit, the transceiver unit may be an input/output circuit and/or a communication interface, and perform an input operation (corresponding to the foregoing receiving operation) and an output operation (corresponding to the foregoing sending operation); and the processing unit is an integrated processor, a microprocessor, or an integrated circuit.

The following describes in detail an implementation in which the apparatus 800 is used in a sending device or a receiving device.

For example, operations performed by the units of the apparatus 800 when the apparatus 800 is used in the sending device are described in detail.

The processing unit 801 is configured to determine a mother code in a k^thtransmission based on a length of to-be-transmitted bits in the k^thtransmission. k is an integer greater than or equal to 2. The processing unit 801 is further configured to perform systematic polar encoding on to-be-coded bits to obtain the to-be-transmitted bits. The transceiver unit 802 is configured to send the to-be-transmitted bits. When the length of the to-be-transmitted bits in the k^thtransmission is greater than a length of non-transmitted bits in a (k-1)^thtransmission, a location index set that is of the to-be-transmitted bits and that is in the mother code in the k^thtransmission is determined based on a location index set src_kthat is of source bits in the k^thtransmission and that is in the mother code in the k^thtransmission, a location index set frz′_k-1that is of frozen bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission, and a location index set frz_kthat is of frozen bits in the k^thtransmission and that is in the mother code in the k^thtransmission. When the length of the to-be-transmitted bits in the k^thtransmission is less than or equal to a length of non-transmitted bits in a (k-1)^thtransmission, a location index set that is of the to-be-transmitted bits and that is in the mother code in the k^thtransmission is determined based on a location index set R′_k-1, that is of the non-transmitted bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission.

In a design, when the length of the to-be-transmitted bits in the k^thtransmission is less than or equal to the length of the non-transmitted bits in the (k-1)^thtransmission, elements in the location index set that is of the to-be-transmitted bits and that is in the mother code in the k^thtransmission include elements in R′_k-1.

In a design, the processing unit 801 is further configured to: determine a location index set that is of first bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission, where the first bits include source bits, cyclic redundancy check CRC bits, and frozen bits; perform rate matching on the mother code in the k^thtransmission, to obtain a location index set R_kthat is of non-transmitted bits in the k^thtransmission and that is in the mother code in the k^thtransmission; and determine the location index set src_kthat is of the source bits in the k^thtransmission and that is in the mother code in the k^thtransmission based on a location index set src′_k-1that is of the source bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission, R′_k-1, the mother code in the k^thtransmission, a mother code in the (k-1)^thtransmission, and R_k.

In a design, elements included in the location index set that is of the first bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission are a sum of location indexes that are of the first bits in the (k-1)^thtransmission and that are in the mother code in the (k-1)^thtransmission and a length of the mother code in the (k-1)^thtransmission.

In a design, when determining src_kbased on src′_k-1, R′_k-1, the mother code in the k^thtransmission, the mother code in the (k-1)^thtransmission, and R_k, the processing unit 801 is configured to: determine a first union set of a location index set in the mother code in the (k-1)^thtransmission, src′_k-1and the location index set R′_k-1that is of the non-transmitted bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission; determine a first difference set between the first union set and R_k; sort location indexes in the first difference set in descending order of bit reliability; and select top-ranked N_Slocation indexes as src_k.

In a design, the processing unit 801 is further configured to: use a difference set between src′_k-1and src_kas a location index set Δpc_kof target parity check PC bits in the k^thtransmission; use a union set of a location index set pc′_k-1that is of PC bits in a first transmission to the (k-1)^thtransmission and that is in the mother code in the k^thtransmission and Δpc_kas a location index set pc_kof PC bits in the first transmission to the k^thtransmission; and use a difference set between a location index set in the mother code in the k^thtransmission and pc_k, src_k, R_k, and a location index set chk_kof CRC bits in the k^thtransmission as frz_k, where location indexes of the to-be-transmitted bits include elements in Δpc_kand in a difference set between frz_kand frz′_k-1.

In a design, when determining src_kbased on src′_k-1, R′_k-1, the mother code in the k^thtransmission, the mother code in the (k-1)^thtransmission, and R_k, the processing unit 801 is configured to: determine a second union set of a location index set in the mother code in the (k−1)^thtransmission and R′_k-1; determine a second difference set between the second union set and R_k; sort location indexes in the second difference set in descending order of bit reliability; select top-ranked N_PClocation indexes as a location index set Δsrc_kof target source bits in the k^thtransmission; select lower-ranked N_PClocation indexes in src′_k-1as a location index set Δpc_kof target PC bits in the k^thtransmission; determine a difference set between src′_k-1and Δpc_k; and use a union set of Δsrc_kand the difference set between src′_k-1and Δpc_kas src_k.

In a design, the processing unit 801 is further configured to: use a union set of a location index set pc′_k-1, that is of PC bits in a first transmission to the (k-1)^thtransmission and that is in the mother code in the k^thtransmission and Δpc_kas a location index set pc_kof PC bits in the first transmission to the k^thtransmission; and use a difference set between a location index set in the mother code in the k^thtransmission and pc_k, src_k, R_k, and a location index set chk_kof CRC bits in the k^thtransmission as frz_k, where location indexes of the to-be-transmitted bits include elements in Δpc_kand in a difference set between frz_kand frz′_k-1.

In a design, the rate matching includes shortening or puncturing.

In a design, a value of a bit corresponding to an element in Δsrc_kis the same as a value of a bit corresponding to an element in Δpc_k.

For example, operations performed by the units of the apparatus 800 when the apparatus 800 is used in the receiving device are described in detail.

The transceiver unit 802 is configured to receive to-be-transmitted bits in a k^thtransmission from the sending device. The processing unit 801 is configured to decode to-be-transmitted bits. In a possible case, when a length of the to-be-transmitted bits in the k^thtransmission is greater than a length of non-transmitted bits in a (k-1)^thtransmission, a location index set that is of the to-be-transmitted bits and that is in a mother code in the k^thtransmission is determined based on a location index set src_kthat is of source bits in the k^thtransmission and that is in the mother code in the k^thtransmission, a location index set frz′_k-1, that is of frozen bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission, and a location index set frz_kthat is of frozen bits in the k^thtransmission and that is in the mother code in the k^thtransmission. In another possible case, when a length of the to-be-transmitted bits in the k^thtransmission is less than or equal to a length of non-transmitted bits in a (k-1)^thtransmission, a location index set that is of the to-be-transmitted bits and that is in a mother code in the k^thtransmission is determined based on a location index set R′_k-1, that is of the non-transmitted bits in the (k-1)^thtransmission and that is in the mother code in the k^thtransmission.

In a possible implementation, src_kis determined based on a union set of a difference set between src′_k-1and a location index set Δpc_kof target PC bits in the k^thtransmission and a location index set Δsrc_kof target source bits in the k^thtransmission. Δpc_kincludes lower-ranked N_PClocation indexes in src′_k-1. Δsrc_kincludes top-ranked N_PClocation indexes in a second difference set. The second difference set is a difference set between a second union set and R_k. The second union set is a union set of the location index set in the mother code in the (k-1)^thtransmission and R′_k-1.

In a possible implementation, location indexes of the to-be-transmitted bits include elements in Δpc_kand in a difference set between frz_kand frz′_k-1. frz_kis determined based on a difference set between a location index set in the mother code in the k^thtransmission and pc_k, src_k, R_k, and a location index set chk_kof CRC bits in the k^thtransmission.

In a possible implementation, the rate matching includes shortening or puncturing.

In a possible implementation, a value of a bit corresponding to an element in Δsrc_kis the same as a value of a bit corresponding to an element in Δpc_k.

Based on the concept of the foregoing embodiments, as shown in FIG. 9, an embodiment of this application provides a communication apparatus 900. The communication apparatus 90o includes a processor 910. Optionally, the communication apparatus 900 may further include a memory 920, configured to store instructions executed by the processor 910, or store input data required by the processor 910 to run the instructions, or store data generated after the processor 910 runs the instructions. The processor 910 can implement, by using the instructions stored in the memory 920, the method shown in the foregoing method embodiments.

Based on the concept of the foregoing embodiments, as shown in FIG. 10, an embodiment of this application provides a communication apparatus 1000. The communication apparatus 1000 may be a chip or a chip system. Optionally, in this embodiment of this application, the chip system may include a chip, or may include a chip and another discrete component.

The communication apparatus 1000 may include at least one processor 1010. The processor 1010 is coupled to a memory. Optionally, the memory may be located inside or outside the apparatus. For example, the communication apparatus 1000 may further include at least one memory 1020. The memory 1020 stores a necessary computer program, configuration information, a computer program or instructions, and/or data for implementing any one of the foregoing embodiments. The processor 1010 may execute the computer program stored in the memory 1020, to complete the method in any one of the foregoing embodiments.

The coupling in this embodiment of this application may be an indirect coupling or a communication connection between apparatuses, units, or modules in an electrical form, a mechanical form, or another form, and is used for information exchange between the apparatuses, the units, or the modules. The processor 1010 and the memory 1020 may operate cooperatively. In embodiments of this application, a specific connection medium among the transceiver 1030, the processor 1010, and the memory 1020 is not limited.

The communication apparatus 1000 may further include a transceiver 1030, and the communication apparatus 1000 may perform information exchange with another device by using the transceiver 1030. The transceiver 1030 may be a circuit, a bus, a transceiver, or any other apparatus that can be configured to exchange information, or is referred to as a signal transceiver unit. As shown in FIG. 10, the transceiver 1030 includes a transmitter 1031, a receiver 1032, and an antenna 1033. In addition, when the communication apparatus 1000 is a chip type apparatus or circuit, the transceiver in the communication apparatus 1000 may alternatively be an input/output circuit and/or a communication interface, and may input data (or is referred to as receiving data) and output data (or is referred to as sending data). The processor is an integrated processor, a microprocessor, or an integrated circuit, and the processor may determine output data based on input data.

In a possible implementation, the communication apparatus 1000 may be used in a sending device. The communication apparatus 1000 may be a sending device, or may be an apparatus that can support a sending device in implementing functions of the sending device in any one of the foregoing embodiments. The memory 1020 stores a necessary computer program, a computer program or instructions, and/or data for implementing the functions of the sending device in any one of the foregoing embodiments. The processor 1010 may execute the computer program stored in the memory 1020, to complete the method performed by the sending device in any one of the foregoing embodiments. When the communication apparatus 1000 is used in a sending device, the transmitter 1031 in the communication apparatus 1000 may be configured to send to-be-transmitted bits through the antenna 1033.

In another possible implementation, the communication apparatus 1000 may be used in a receiving device. The communication apparatus 1000 may be a receiving device, or may be an apparatus that can support a receiving device in implementing functions of the receiving device in any one of the foregoing embodiments. The memory 1020 stores a necessary computer program, a computer program or instructions, and/or data for the implementing functions of the receiving device in any one of the foregoing embodiments. The processor 1010 may execute the computer program stored in the memory 1020, to complete the method performed by the receiving device in any one of the foregoing embodiments. When the communication apparatus 1000 is used in a receiving device, the receiver 1032 in the communication apparatus 1000 may be configured to receive to-be-transmitted bits through the antenna 1033.

The communication apparatus 1000 provided in this embodiment may be used in the sending device to complete the method performed by the sending device, or may be used in the receiving device to complete the method performed by the receiving device. Therefore, for technical effects that can be achieved by this embodiment, refer to the foregoing method embodiments. Details are not described herein again.

In this embodiment of this application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array, or another programmable logic device, a discrete gate, a transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logical block diagrams disclosed in embodiments of this application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed with reference to embodiments of this application may be directly performed by a hardware processor, or may be performed by using a combination of hardware in the processor and a software module.

In embodiments of this application, the memory may be a non-volatile memory, for example, a hard disk drive (HDD) or a solid-state drive (SSD), or may be a volatile memory, for example, a random access memory (RAM). Alternatively, the memory may be any other medium that can be configured to carry or store expected program code in a form of an instruction or a data structure and that can be accessed by a computer, but is not limited thereto. The memory in this embodiment of this application may alternatively be a circuit or any other apparatus that can implement a storage function, and is configured to store a computer program, a computer program or instructions, and/or data.

Based on the foregoing embodiments, refer to FIG. 11. An embodiment of this application further provides another communication apparatus 1100, including: an input/output interface 1110 and a logic circuit 1120, where the input/output interface 1110 is configured to receive code instructions and transmit the code instructions to the logic circuit 1120; and the logic circuit 1120 is configured to run the code instructions to perform the method performed by the sending device or the receiving device in any one of the foregoing embodiments.

The following describes in detail an operation performed when the communication apparatus is used in the sending device or the receiving device.

In an optional implementation, the communication apparatus 1100 may be used in the sending device, to perform the foregoing method performed by the sending device, for example, the foregoing method performed by the sending device in the embodiment shown in FIG. 4. The logic circuit 1120 is configured to determine a mother code in a k^thtransmission based on a length of to-be-transmitted bits in the k^thtransmission, and perform systematic polar encoding on to-be-coded bits based on the mother code, to obtain the to-be-transmitted bits. The input/output interface 1110 is configured to output the to-be-transmitted bits.

In another optional implementation, the communication apparatus 1100 may be used in the receiving device, to perform the foregoing method performed by the receiving device, for example, the foregoing method performed by the receiving device in the method embodiment shown in FIG. 4. The input/output interface 1110 is configured to input to-be-transmitted bits in a k^thtransmission from the sending device. The logic circuit 1120 is configured to decode the to-be-transmitted bits.

The communication apparatus 1100 provided in this embodiment may be used in the sending device to perform the method performed by the sending device, or may be used in the receiving device to complete the method performed by the receiving device. Therefore, for technical effects that can be achieved by this embodiment, refer to the foregoing method embodiments. Details are not described herein again.

Based on the foregoing embodiments, an embodiment of this application further provides a communication system. The system includes at least one communication apparatus used in a sending device and at least one communication apparatus used in a receiving device. For technical effects that can be achieved by this embodiment, refer to the foregoing method embodiments. Details are not described herein again.

Based on the foregoing embodiments, an embodiment of this application further provides a computer-readable storage medium. The computer-readable storage medium stores a computer program or instructions. When the instructions are executed, the method performed by the sending device or the method performed by the receiving device in any one of the foregoing embodiments is implemented. The computer-readable storage medium may include: any medium that can store program code, like a USB flash drive, a removable hard disk, a read-only memory, a random access memory, a magnetic disk, or an optical disc.

Based on the foregoing embodiments, this application further provides a computing program product, including computer-executable instructions. When the computer-executable instructions are run on a computer, the method performed by the sending device or the method performed by the receiving device in any one of the foregoing embodiments is implemented.

To implement functions of the communication apparatuses in FIG. 8 and FIG. 11, an embodiment of this application further provides a chip, including a processor, configured to support the communication apparatus in implementing the functions of the sending device or the receiving device in the foregoing method embodiments. In a possible design, the chip is connected to a memory, or the chip includes a memory. The memory is configured to store a computer program or instructions and data that are necessary for the communication apparatus.

A person skilled in the art should understand that embodiments of this application may be provided as a method, a system, or a computer program product. Therefore, this application may use a form of hardware only embodiments, software only embodiments, or embodiments with a combination of software and hardware. In addition, this application may use a form of a computer program product that is implemented on one or more computer-usable storage media (including but not limited to a disk memory, a CD-ROM, an optical memory, and the like) that include computer-usable program code.

This application is described with reference to the flowcharts and/or block diagrams of the method, the device (system), and the computer program product according to embodiments of this application. It should be understood that a computer program or instructions may be used to implement each procedure and/or each block in the flowcharts and/or the block diagrams and a combination of a procedure and/or a block in the flowcharts and/or the block diagrams. The computer program or instructions may be provided for a general-purpose computer, a dedicated computer, an embedded processor, or a processor of another programmable data processing device to generate a machine, so that the instructions executed by the computer or the processor of another programmable data processing device generate an apparatus for implementing a specific function in one or more procedures in the flowcharts and/or in one or more blocks in the block diagrams.

The computer program or instructions may alternatively be stored in a computer-readable memory that can instruct the computer or the another programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory generate an artifact that includes an instruction apparatus. The instruction apparatus implements a specified function in one or more procedures in the flowcharts and/or in one or more blocks in the block diagrams.

The computer program or instructions may alternatively be loaded onto the computer or the another programmable data processing device, so that a series of operation steps are performed on the computer or the another programmable device to generate computer-implemented processing. Therefore, the instructions executed on the computer or the another programmable device provide steps for implementing a specific function in one or more procedures in the flowcharts and/or in one or more blocks in the block diagrams.

Apparently, a person skilled in the art may make various modifications and variations to embodiments of this application without departing from the scope of embodiments of this application. In this case, this application is intended to cover these modifications and variations of embodiments of this application provided that they fall within the scope of protection defined by the following claims and their equivalent technologies.

	Number	Date	Country
Parent	PCT/CN2023/081390	Mar 2023	WO
Child	18914973		US

CODING METHOD AND APPARATUS

Information

Publication Number

Date Filed

Date Published

Inventors

Original Assignees

CPC

International Classifications

Abstract

Description

Claims

Priority Claims (1)

CROSS-REFERENCE TO RELATED APPLICATIONS

Continuations (1)