Communication method and apparatus

Abstract

Embodiments of the present application provide a communication method and apparatus. The method comprises: a first communication apparatus acquiring a first information bit sequence, wherein the first information bit sequence comprises at least one first information bit and at least one second information bit, the reliability of the position of the at least one first information bit is lower than that of the position of the at least one second information bit, the first information bit carries valid information, and the second information bit is a reserved bit; then obtaining a second information bit sequence on the basis of the first information bit sequence, wherein the reliability of the position of the at least one first information bit in the second information bit sequence is higher than that of the position of the at least one first information bit in the first information bit sequence; on the basis of the second information bit sequence, obtaining a bit sequence having undergone channel encoding; and finally, outputting the bit sequence having undergone channel encoding. The method can enhance the decoding performance of a receiving end when decoding received information bit sequences.

Description

A communication method and apparatus

[0001] Cross-references to related applications

[0002] This application claims priority to Chinese Patent Application No. 202411642427.1, filed on November 15, 2024, entitled "A Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

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

[0004] Polar codes, a commonly used channel coding method, have the following characteristics: Before encoding information bits using Polar codes, the transmitting end (e.g., the network side) needs to interleave the information bits. This prevents the cyclic redundancy check (CRC) bits from concentrating in one position. During decoding, the receiving end (e.g., the terminal side) can stop decoding earlier if an error is detected in the early CRC check. Another characteristic of Polar codes is that the reliability varies depending on the position of the information bits. A higher reliability bit position corresponds to a lower probability of decoding error.

[0005] In existing standards, Polar codes are used as the channel coding method for control signals. Different formats of control signals carry different effective information bits. To reduce the complexity of blind detection of control signals at the receiving end (e.g., the terminal), the protocol specifies that some control signals use the same number of information bits. For control signals carrying fewer effective information bits, reserved bits are added to meet the information bit requirement. However, these reserved bits do not carry any effective information but occupy the space of the information bits, thus affecting the decoding performance of the effective information bits. Summary of the Invention

[0006] This application proposes a communication method and apparatus for improving the decoding performance of information bits at the receiving end.

[0007] In a first aspect, embodiments of this application provide a communication method, the method comprising: a first communication device obtaining a first information bit sequence, the first information bit sequence including at least one first information bit and at least one second information bit, wherein the reliability of the position of the at least one first information bit is lower than the reliability of the position of the at least one second information bit; the first information bit carrying valid information, and the second information bit being a reserved bit; the first communication device obtaining a second information bit sequence based on the first information bit sequence; the second information bit sequence including the at least one first information bit, wherein the reliability of the position of the at least one first information bit in the second information bit sequence is higher than the reliability of the position of the at least one first information bit in the first information bit sequence; the first communication device obtaining a channel-coded bit sequence based on the second information bit sequence; and the first communication device outputting the channel-coded bit sequence to a second communication device.

[0008] In the above method, the first communication device and the second communication device are different communication devices. The first communication device (or the second communication device) can be a terminal device, a component of a terminal device (e.g., a processor, a chip, or a chip system), or a device used in conjunction with a terminal device. The second communication device (or the first communication device) can be a network device, a component of a network device (e.g., a processor, a chip, or a chip system), or a device used in conjunction with a network device.

[0009] For example: the first communication device is a network device and the second communication device is a terminal device; or the first communication device is a terminal device and the second communication device is a network device; or the first communication device is a terminal device and the second communication device is another terminal device; or the first communication device is a network device and the second communication device is another network device.

[0010] In one possible implementation, the first information bit sequence may carry control information such as scheduling information and / or activation commands.

[0011] In the embodiments of this application, the first information bit can be referred to as the effective information bit. This application does not limit the specific values ​​of the first information bit and / or the second information bit. For example, the value of the second information bit can be 0 or not, and there is no restriction on this.

[0012] In this embodiment, the reliability of the location of the information bit can be understood as, but is not limited to, the channel reliability of the location of the information bit. The higher the channel reliability of the location of the information bit, the lower the probability of channel decoding error, that is, the less likely errors are to occur during the channel decoding process.

[0013] In some embodiments of this application, "decoding" can be replaced with "decoding", and "decoding performance" can be replaced with "decoding performance" accordingly.

[0014] In this application, a first communication device obtains a second information bit sequence based on a first information bit sequence. The reliability of the position of at least one first information bit in the second information bit sequence is higher than the reliability of the position of the same first information bit in the first information bit sequence. Therefore, the first communication device can perform channel coding on the second information bit sequence to obtain a channel-coded bit sequence, and then output the channel-coded bit sequence. Thus, compared to the receiving end obtaining the channel-coded bit sequence based on the first information bit sequence and performing decoding on it, the decoding performance of the receiving end obtaining the channel-coded bit sequence based on the second information bit sequence and performing decoding on it is higher. Therefore, this method can effectively improve the decoding performance of information bits.

[0015] In conjunction with the first aspect, in one possible implementation, the first information bit sequence includes a first information bit at a first position, a first information bit at a second position, a second information bit at a third position, and a second information bit at a fourth position; the reliability of the first and second positions, the third position, and the fourth position are respectively from low to high.

[0016] The first communication device obtains a second information bit sequence based on a first information bit sequence, which may include: the first communication device assigning the first information bit at a first position to a fourth position and assigning the first information bit at a second position to a third position according to a first rule, thereby obtaining the second information bit sequence; wherein, the first rule is to assign the first information bits at positions with increasing reliability to the positions with decreasing reliability in a one-to-one correspondence. Therefore, the reliability of the first information bit in the second information bit sequence assigned to the fourth position is higher than that of the first information bit at the first position in the first information bit sequence, and the reliability of the first information bit in the second information bit sequence assigned to the third position is higher than that of the first information bit at the second position in the first information bit sequence.

[0017] In this implementation, the first communication device assigns the first information bit at the low reliability position in the first information bit sequence to the position of the second information bit at the high reliability position according to the first rule, thereby effectively improving the decoding performance of the first information bit sequence.

[0018] In conjunction with the first aspect, in another possible implementation, the first information bit sequence includes a first information bit at a first position, a first information bit at a second position, a second information bit at a third position, and a second information bit at a fourth position; the reliability of the first and second positions, the third position, and the fourth position are respectively from low to high.

[0019] The first communication device obtains a second information bit sequence based on the first information bit sequence, which may include: the first communication device assigning the first information bit at the second position to the fourth position and assigning the first information bit at the first position to the third position according to the second rule, thereby obtaining the second information bit sequence; wherein, the second rule is to assign the first information bits at the positions with high to low reliability to the positions of the second information bits with high to low reliability in a one-to-one correspondence.

[0020] In this implementation, the first communication device assigns the first information bit at the low reliability position in the first information bit sequence to the position of the second information bit at the high reliability position according to the second rule, thereby effectively improving the decoding performance of the first information bit sequence.

[0021] In one possible implementation, the first information bit sequence further includes a first information bit at a fifth position, the reliability of which is lower than that of the first position. The method may also include: the first communication device assigning the first information bit at the fifth position to the first position or the second position.

[0022] Through this implementation, the first communication device can assign the first information bit at a position with lower reliability to the position of the first information bit that has already been assigned to the second information bit and has higher reliability, so as to improve the reliability of more first information bits as much as possible and improve its decoding performance.

[0023] In conjunction with the first aspect, in one possible implementation, at least one of the aforementioned first information bits includes all or part of the Cyclic Redundancy Check (CRC) bits. This implementation effectively improves the reliability of the positions of all or part of the CRC bits in the first information bit sequence, thereby significantly enhancing the decoding performance when all or part of the CRC bits are decoded. In other words, it reduces the likelihood of errors during decoding, thereby improving the error correction capability of the encoding and ensuring the integrity and accuracy of the transmitted information.

[0024] In one possible implementation, this portion of the CRC bits can be the unescrambled CRC bits from the entire CRC set. For example, it could be the CRC bits excluding those scrambled with the radio network temporary identity (RNTI). This implementation reduces the impact on the scrambled bits by not changing their position.

[0025] In conjunction with the first aspect, in one possible implementation, the first information bit sequence is either the information bit sequence after interleaving or the information bit sequence before interleaving. With this implementation, the first communication device can derive the second information bit sequence based on the first information bit sequence either before or after the interleaving process, making the implementation process more flexible.

[0026] Secondly, embodiments of this application provide a communication method, the method comprising: a second communication device acquiring a channel-coded bit sequence from a first communication device; the second communication device obtaining a second information bit sequence based on the channel-coded bit sequence; and the second communication device obtaining a first information bit sequence based on the second information bit sequence; wherein the first information bit sequence includes at least one first information bit and at least one second information bit, and the reliability of the position of at least one first information bit is lower than the reliability of the position of at least one second information bit, the first information bit carries valid information, and the second information bit is a reserved bit; the second information bit sequence includes at least one first information bit, and the reliability of the position of at least one first information bit is higher than the reliability of the position of at least one first information bit in the first information bit sequence.

[0027] In the above method, the first communication device and the second communication device are different communication devices. The first communication device (or the second communication device) can be a terminal device, a component of a terminal device (e.g., a processor, chip, or chip system), or a device used in conjunction with a terminal device. The second communication device (or the first communication device) can be a network device, a component of a network device (e.g., a processor, chip, or chip system), or a device used in conjunction with a network device. For example: the first communication device can be a network device, and the second communication device can be a terminal device; or, the first communication device can be a terminal device, and the second communication device can be a network device; or, the first communication device is a terminal device, and the second communication device is another terminal device; or, the first communication device is a network device, and the second communication device is another network device, etc.

[0028] In this embodiment, the first information bit sequence may carry control information such as scheduling information and / or activation commands. The first information bit can be called the valid information bit, and the second information bit can be called the reserved bit. This application does not limit the specific values ​​of the first and / or second information bits. For example, the value of the second information bit can be 0 or not; there is no restriction on this.

[0029] In this application, the second communication device receives a channel-coded bit sequence from the first communication device based on a second information bit sequence. The reliability of the position of at least one first information bit in the second information bit sequence is higher than the reliability of the position of the at least one first information bit in the first information bit sequence. Therefore, compared to the second communication device obtaining a channel-coded bit sequence based on the first information bit sequence and performing decoding on it, the decoding performance of the second communication device obtaining a channel-coded bit sequence based on the second information bit sequence and performing decoding on it will be higher. Thus, this method can effectively improve the decoding performance of information bits.

[0030] In conjunction with the second aspect, in one possible implementation, the first information bit sequence includes a first information bit at a first position, a first information bit at a second position, a second information bit at a third position, and a second information bit at a fourth position; the reliability corresponding to the first and second positions, the third position, and the fourth position are respectively from low to high; the second information bit sequence is obtained based on the first information bit sequence and the first rule, in which the second information bit at the fourth position is assigned the value of the first information bit at the first position, and the second information bit at the third position is assigned the value of the first information bit at the second position; the first rule is to assign the first information bits at the positions with reliability from low to high to the positions with reliability from high to low one-to-one.

[0031] In conjunction with the second aspect, in another possible implementation, the first information bit sequence includes a first information bit at a first position, a first information bit at a second position, a second information bit at a third position, and a second information bit at a fourth position; the reliability of the first, second, third, and fourth positions is respectively from low to high; the second information bit sequence is obtained based on the first information bit sequence and the second rule, in which the second information bit at the fourth position is assigned the value of the first information bit at the second position, and the second information bit at the third position is assigned the value of the first information bit at the first position; the second rule is to assign the first information bits at the positions with high to low reliability to the positions with high to low reliability one by one.

[0032] In conjunction with the second aspect, in one possible implementation, the second communication device obtains a first information bit sequence based on the second information bit sequence, including: the second communication device cancels the assignment of the second information bit at the fourth position and cancels the assignment of the second information bit at the third position to obtain the first information bit sequence.

[0033] In the embodiments of this application, canceling the assignment of the second information bit at a certain position can be understood as restoring the value of the second information bit at that position.

[0034] For example, suppose the value of the second information bit in the fourth position is 0, and the value of the first information bit in the first position (or the second position) is 1; after the second information bit in the fourth position is assigned a value by the first information bit in the first position (or the second position), the value of the second information bit in the fourth position is 1. Canceling the assignment of the second information bit in the fourth position can mean setting the value of the second information bit in the fourth position to 0.

[0035] With this implementation, since the second information bit at a high reliability position (such as the third or fourth position) in the second information bit sequence has been assigned a value by the first information bit at a low reliability position (such as the first or second position), the second communication device can effectively obtain the information bit sequence before the assignment by canceling the assignment of the corresponding second information bit.

[0036] In conjunction with the second aspect, in one possible implementation, in the second information bit sequence, the first information bit at the first or second position is assigned a value to the first information bit at the fifth position, where the reliability of the fifth position is lower than that of the first position. The method may further include: before canceling the assignment of the second information bit at the fourth position, the second communication device assigns the value of the second information bit at the fourth position to the first information bit at the first position, and assigns the value of the second information bit at the third position to the first information bit at the second position; or before canceling the assignment of the second information bit at the third position, the second communication device assigns the value of the second information bit at the fourth position to the first information bit at the second position, and assigns the value of the second information bit at the third position to the first information bit at the first position. This implementation ensures the effective restoration of the value of the first information bit at the first or second position.

[0037] In conjunction with the second aspect, in one possible implementation, at least one of the aforementioned first information bits includes all or part of the Cyclic Redundancy Check (CRC) bits. This implementation effectively improves the reliability of the positions of all or part of the CRC bits in the first information bit sequence, thereby significantly enhancing the decoding performance when all or part of the CRC bits are decoded. In other words, it reduces the likelihood of errors during decoding, thereby improving the error correction capability of the encoding and ensuring the integrity and reliability of the transmitted information.

[0038] In one possible implementation, this portion of the CRC bits can be the CRC bits that have not been scrambled from the total CRC bits. For example, CRC bits scrambled by the Radio Network Temporary Identifier (RNTI) can be removed. This implementation reduces the impact on the scrambled bits by not changing their position.

[0039] In conjunction with the second aspect, in one possible implementation, the first information bit sequence is either the information bit sequence before or after deinterleaving. This implementation allows the second communication device to recover the bit sequence either before or after deinterleaving, providing greater flexibility.

[0040] Thirdly, embodiments of this application also provide a communication device that can be used to perform the method of the first aspect.

[0041] In one possible implementation, the communication device may include modules or units corresponding to the methods / operations / steps / actions described in the first aspect. These modules or units may be hardware circuits, software, or a combination of hardware circuits and software. In another possible implementation, the communication device may include a processing unit (also called a processing module) and a communication unit (also called a communication module). The communication unit may be used to perform receiving and / or sending functions, and the processing unit may be used to perform the methods described in the first aspect or any of the possible implementations of the first aspect.

[0042] Fourthly, embodiments of this application also provide a communication device that can be used to perform the method of the second aspect.

[0043] In one possible implementation, the communication device may include modules or units corresponding to the methods / operations / steps / actions described in the second aspect. These modules or units may be hardware circuits, software, or a combination of hardware circuits and software. In another possible implementation, the communication device may include a processing unit (also called a processing module) and a communication unit (also called a communication module). The communication unit may be used to perform receiving and / or sending functions, and the processing unit may be used to perform the methods described in the second aspect or any of the possible implementations of the second aspect.

[0044] Fifthly, embodiments of this application provide a communication device, which includes a processor and an input / output interface (or communication interface); wherein the input / output interface (or communication interface) is used for inputting and / or outputting information; the processor is used to implement the method provided by the first aspect or any possible implementation thereof, or to implement the method provided by the second aspect or any possible implementation thereof.

[0045] In one possible design, the communication device may further include a memory for storing a computer program that, when executed by the processor, causes the method provided by the first aspect or any of the possible implementations thereof to be executed, or causes the method provided by the second aspect or any of the possible implementations thereof to be executed.

[0046] In one possible design, the communication device described in the fifth aspect can be a chip.

[0047] Sixthly, embodiments of this application provide a communication system, which includes a first communication device and a second communication device. The first communication device is used to implement the method provided in the first aspect or any possible implementation thereof, and the second communication device is used to implement the method provided in the second aspect or any possible implementation thereof.

[0048] In a seventh aspect, embodiments of this application provide a computer storage medium storing a software program that, when read and executed by one or more processors, can implement the method provided by the first aspect or any of the possible implementations described above, or implement the method provided by the second aspect or any of the possible implementations described above.

[0049] Eighthly, embodiments of this application provide a computer program product containing instructions that, when run on a computer, cause the method provided by the first aspect or any of its possible implementations to be executed, or cause the method provided by the second aspect or any of its possible implementations to be executed.

[0050] Ninthly, embodiments of this application provide a chip system including a processor for supporting a first communication device in implementing the functions involved in the first aspect; or for supporting a second communication device in implementing the functions involved in the second aspect.

[0051] In one possible design, the chip system further includes a memory for storing necessary program instructions and data to be executed by the loading device. The chip system may consist of chips or may include chips and other discrete components.

[0052] It should be noted that the technical effects that can be achieved by any of the third to ninth aspects or any of the third to ninth aspects can be referred to the description of the technical effects that can be achieved by any of the first and second aspects or any of the first and second aspects; they will not be repeated here. Attached Figure Description

[0053] Figure 1 is a schematic diagram of a communication system that can be applied to an embodiment of this application;

[0054] Figure 2 is a schematic diagram of an information transmission process;

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

[0056] Figure 4 is a flowchart illustrating the method of Embodiment 1 of this application;

[0057] Figure 5 is a schematic diagram of an interleaved information bit sequence according to an embodiment of this application;

[0058] Figure 6A is a schematic diagram of a processing flow in an embodiment of this application;

[0059] Figure 6B is a schematic diagram of another processing flow in an embodiment of this application;

[0060] Figure 6C is a schematic diagram of another processing flow in an embodiment of this application;

[0061] Figure 6D is a schematic diagram of another processing flow in an embodiment of this application;

[0062] Figure 7 is a flowchart illustrating the method of Embodiment 2 of this application;

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

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

[0065] Figure 10 is a schematic diagram of a chip device provided in an embodiment of this application. Detailed Implementation

[0066] The scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. Obviously, the described embodiments are only a part of the embodiments of this application, not all of the embodiments. Based on the embodiments of this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this application.

[0067] The technical solutions of this application can be applied to various communication systems, such as: Long Term Evolution (LTE) systems, LTE-Advanced (LTE-A) systems, Universal Mobile Telecommunications System (UMTS), 5th Generation (5G) mobile communication systems, Beyond 5G (B5G) mobile communication systems, or future evolution communication systems. The communication system can also be a device-to-device (D2D) network, a WiFi network, a machine-to-machine (M2M) network, an Internet of Things (IoT) network, or other networks.

[0068] For example, the architecture of the communication system used in this application embodiment can be as shown in FIG1. ​​The communication system 1000 includes a radio access network (RAN) 100 and a core network (CN) 200. Optionally, the communication system 1000 may also include the Internet 300. The RAN 100 includes at least one network device (FIG. 110a and 110b in FIG1, collectively referred to as 110) and at least one terminal device (FIG. 120a-120j in FIG1, collectively referred to as 120). The RAN 100 may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in FIG1). The terminal device 120 is wirelessly connected to the network device 110. The network device 110 is wirelessly or wiredly connected to the core network 200. The core network device in the core network 200 and the network device 110 in the RAN 100 may be different physical devices, or they may be the same physical device integrating core network logical functions and radio access network logical functions.

[0069] RAN 100 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as 4G, 5G, or evolution systems beyond 5G (i.e., future mobile communication systems). RAN 100 can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a WiFi system. RAN 100 can also be a communication system that integrates two or more of the above systems.

[0070] The apparatus provided in this application embodiment can be applied to network device 110 or terminal device 120. It is understood that Figure 1 only illustrates one possible communication system architecture applicable to this application embodiment; in other possible scenarios, the communication system architecture may also include other devices.

[0071] Network device 110 is a node in the radio access network (RAN), also known as an access network device or an RAN node (or device). Network device 110 assists terminal devices in achieving wireless access. Multiple network devices 110 in the communication system 1000 can be nodes of the same type or different types. In some scenarios, the roles of network device 110 and terminal device 120 are relative. For example, network element 120i in Figure 1 can be a helicopter or drone, which can be configured as a mobile base station. For terminal devices 120j accessing RAN 100 through network element 120i, network element 120i is a base station; however, for base station 110a, network element 120i is a terminal device. Network device 110 and terminal device 120 are sometimes referred to as communication devices. For example, network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functions, and network elements 120a-120j can be understood as communication devices with terminal device functions.

[0072] In one possible scenario, network equipment can be a base station (BS), an evolved NodeB (eNodeB), a transmitting and receiving point (TRP), a transmitting point (TP), a next-generation NodeB (gNB), a base station in a future mobile communication system, a satellite, or an access point (AP) in a WiFi system, an integrated access and backhaul (IAB) node, or network equipment in a mobile switching center non-terrestrial network (NTN) communication system, i.e., it can be deployed on a high-altitude platform or satellite, etc. Network equipment can be a macro base station (as shown in Figure 1, 110a), a micro base station or indoor station (as shown in Figure 1, 110b), a relay node or donor node, or a radio controller in a CRAN scenario. Network equipment can also act as a base station in device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, drone communication, and machine-to-machine (M2M) communication. Optionally, network equipment can also be a server, wearable device, vehicle, or in-vehicle equipment, etc. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU).

[0073] In another possible scenario, multiple network devices collaborate to assist terminal devices in achieving wireless access, with each network device performing a portion of the base station's functions. For example, network devices can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs). CUs and DUs can be separate entities or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs). It is understood that network devices can be CU nodes, DU nodes, or devices comprising both CU and DU nodes. Furthermore, CUs can be classified as network devices in the access network (RAN) or the core network (CN), without limitation.

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

[0075] In this embodiment, the form of the network device is not limited. The device used to implement the function of the network device can be the network device itself, or it can be a device that supports the network device in implementing the function, such as a chip system. The device can be installed in the network device or used in conjunction with the network device.

[0076] Terminal equipment 120, also known as terminal, user equipment (UE), mobile station (MS), mobile terminal (MT), etc., is a device used to provide voice or data connectivity to users. It can also be an Internet of Things (IoT) device or a station (STA) in a WiFi system. For example, terminal equipment includes handheld devices with wireless connectivity, vehicle-mounted devices, etc. Currently, terminal devices can include: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices (such as smartwatches, smart bracelets, pedometers, smart glasses, etc.), in-vehicle equipment (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), satellite terminals, virtual reality (VR) devices, augmented reality (AR) devices, smart point-of-sale (POS) machines, customer-premises equipment (CPE), wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity meters, etc.), smart robots, robotic arms, workshop equipment, wireless terminals in autonomous driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, and flying equipment (such as smart robots, hot air balloons, drones, airplanes), etc. Terminal devices can also be other devices with terminal functions; for example, a terminal device can also be a device that performs terminal functions in D2D communication.

[0077] The embodiments of this application do not limit the device form of the terminal device. The device used to implement the function of the terminal device can be the terminal device itself; it can also be a device that supports the terminal device in implementing the function, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In the embodiments of this application, the chip system can be composed of chips or can include chips and other discrete components.

[0078] The application scenarios and existing problems of the embodiments of this application will be introduced below. It should be noted that the application scenarios are intended to make the embodiments of this application easier to understand, and should not be regarded as a limitation on the scope of protection claimed by this application.

[0079] As shown in Figure 2, the communication system transmission flow involves the following steps: At the transmitting end, the source first performs source coding, then channel coding, followed by rate matching, and then modulation mapping. The transmitting end then sends out the modulated and mapped information. Correspondingly, at the receiving end, after receiving the information, it first performs demodulation mapping, then rate matching, then channel decoding (also known as channel decoding), and finally source decoding to obtain the destination information.

[0080] Polar codes, a commonly used channel coding method, have a key characteristic: the channel reliability varies depending on the position of the information bits. The higher the channel reliability of an information bit, the lower the probability of decoding errors. In one possible implementation, before channel coding the information bits using Polar codes, the transmitting end (e.g., the network side) needs to interleave the information bits. This prevents the cyclic redundancy check (CRC) bits from concentrating in one position. During decoding, the receiving end (e.g., the terminal side) can stop decoding earlier if an error is detected during early CRC checking.

[0081] In the New Radio (NR) standard, Polar codes are used as the channel coding method for control signals. Control signals have different formats, each carrying different effective information bits. However, to reduce the complexity of blind detection of control signals by the receiver (e.g., terminal), the protocol specifies that some control signals use the same number of information bits. For control signals carrying fewer effective information bits, reserved bits are added to maintain the same number of information bits. These reserved bits do not carry any effective information; the transmitter uses both reserved bits and effective information bits together as the information bits for channel coding of the control signal. Correspondingly, the receiver decodes both reserved bits and effective information bits.

[0082] Typically, at the transmitting end, reserved bits are appended after valid information bits and are encoded together with valid information bits using Cyclic Redundancy Check (CRC) to obtain CRC-encoded information bits. Then, the CRC-encoded information bits are interleaved to obtain interleaved information bits, and finally, the interleaved information bits are channel-coded using Polar codes.

[0083] Before interleaving, starting from the last information bit, the bits are sorted according to their decoding reliability from highest to lowest, with the CRC check bit at the highest reliability position, followed by reserved bits, and then valid information bits. After interleaving, the positions of valid information bits and reserved bits change. However, even after interleaving, reserved bits may still occupy a significant number of high-reliability positions, thus affecting the decoding performance of the information bits at the receiver.

[0084] Therefore, this application proposes a communication method and apparatus to improve the decoding performance of information bits at the receiving end. The method and apparatus are based on the same inventive concept. Since the methods and apparatus solve problems in similar principles, their implementations can be mutually referenced, and repeated details will not be elaborated further.

[0085] To better understand the solutions provided in the embodiments of this application, the steps, processes, and concepts involved in the embodiments of this application will be introduced and explained below with reference to the information transmission flow shown in Figure 2. It should be noted that these introductions and explanations are intended to make the embodiments of this application easier to understand and should not be regarded as limiting the scope of protection claimed by this application.

[0086] (1) Channel coding:

[0087] As shown in Figure 2, the communication system transmission flow has a channel coding section located between source coding and modulation. This section is responsible for channel coding the information bits (or bit stream) generated by source coding, then modulating them, and finally transmitting the modulated symbols through a noisy channel to the receiver for demodulation. After demodulation, the receiver performs channel decoding. The channel decoding section, located between demodulation and source decoding, is responsible for recovering the information bits.

[0088] In this embodiment of the application, the length of the information bits can be referred to as the payload size.

[0089] (2) CRC encoding:

[0090] CRC encoding refers to Cyclic Redundancy Check, a commonly used check code with error detection and correction capabilities. In the CRC encoding process, information bits are encoded to obtain a CRC codeword. Taking an information bit length of K as an example, the CRC codeword includes K information bits and L check bits (also called check code, CRC code, etc.) appended to the K information bits; that is, the length of the CRC codeword is K+L bits. K and L are positive integers.

[0091] For a CRC codeword with a check bit length of L, there exists a CRC polynomial gCRC with a highest power of L. This gCRC can be used to generate L check bits; therefore, gCRC can be called the generator polynomial for this check bit. In this application, the power can be replaced with the exponent, and the highest power can be replaced with the highest exponent. The generator polynomial can be determined through negotiation between the sender and receiver, or through protocol definition, pre-configuration, or pre-definition. Therefore, the length of the check bit can be determined based on this polynomial.

[0092] This section illustrates the CRC checksum generation process using an example. Assume the message polynomial is M(D), where the polynomial is determined by the number of binary information bits to be sent. For instance, if the X-th bit of the binary information bit is 1, then the coefficient of the term with a power of X-1 in the polynomial is 1; if the Y-th bit of the binary information bit is 0, then the coefficient of the term with a power of Y-1 in the polynomial is 0. In other words, the polynomial does not include terms with a power of Y, where X and Y are positive integers. To obtain the checksum bit, M(D) is shifted left by L bits, meaning the power of each term is increased by L. The polynomial is represented as M(D)*D^R, where * represents multiplication. The remainder obtained by dividing M(D)*D^R by the generator polynomial gCRC is the checksum bit.

[0093] For example, assuming the generator polynomial for the check bit is gCRCLmax = gCRC4 = D^4 + D + 1, its binary representation is 10011, a total of 5 bits, where Lmax = 4, i.e., L = 4. Assuming the sender wants to transmit a data sequence of 101011 binary bits, a total of 6 bits, the message polynomial is M(D) = D^5 + D^3 + D + 1, where the symbol "^" represents exponentiation. Further, we get M(D) * D^5 = D^9 + D^7 + D^5 + D^4. Dividing the binary bits corresponding to M(D) * D^5 (1010110000) by the binary information bits corresponding to the polynomial gCRCLmax (10011), i.e., obtaining the L-bit remainder using the modulo-2 algorithm, the bit sequence of the remainder in this example is 0100. This remainder is the check bit. Therefore, the CRC codeword bitstream after CRC encoding is 1010110100, where the first 6 bits are the original data (i.e., information bits), and the last 4 bits are the check bits. The sending end can further process the bitstream 1010110100 and send it. If no error occurs during data transmission, the data received by the receiving end containing the check bits will be divisible by the binary bits 10011 of the generator polynomial of the check bits. If an error occurs during transmission, the data received by the receiving end containing the check bits will not be divisible by 10011, thus the receiving end can identify the transmission error.

[0094] In this embodiment, the network device and the terminal device can act as the sender and receiver, respectively. For example, in downlink communication, the network device is the sender and the terminal device is the receiver; in uplink communication, the terminal device is the sender and the network device is the receiver. The network device can be either a sender or a receiver. Specifically, if the sender is a network device, the receiver is a terminal device, and this is downlink communication. If the sender is a terminal device, the receiver is a network device, and this is uplink communication. Furthermore, this application does not exclude the possibility that both the sender and receiver are terminal devices, in which case D2D communication occurs between the sender and receiver.

[0095] (3) Interlacing treatment:

[0096] Interleaving refers to the process of altering the information structure to mitigate sudden errors during transmission, thereby improving the reliability and stability of the communication system.

[0097] In this embodiment of the application, before channel coding, in order to prevent the cyclic redundancy check (CRC) bits from being concentrated in one position, the transmitting end (such as a network device) performs interleaving of the information bits; when the receiving end (such as a terminal device) is decoding, if the early check finds that the decoded bits are incorrect, the decoding can be stopped early.

[0098] In one implementation, at the input of the channel, information is written column-wise to an interleaving memory (or interleaver) and read out row-wise; at the output of the channel, information is written row-wise to a deinterleaving memory (or interleaver) and read out column-wise.

[0099] In another implementation, the encoded bits are interleaved according to the first sequence. Specifically, this may include: inputting the elements of the first sequence into an interleaver to obtain an interleaved sequence; and then sorting the encoded bits according to the interleaved sequence to obtain interleaved bits.

[0100] In this embodiment, the interleaver is a predefined rule of the protocol, which can be implemented by looking up a table. For example, the protocol may agree on an interleaving table, and then interleave the information bits according to the interleaving process to obtain the interleaved information bits.

[0101] Deinterleaving can refer to performing the inverse operation of interleaving.

[0102] (4) Rate matching:

[0103] The data block before encoding is called a transport block (TB). Because a TB has a large number of bits, the transmitter typically divides it into multiple code blocks (CBs), each of which is channel-coded independently. Since the physical resources used to transmit the code blocks may not match the physical time-frequency resources of the code blocks to be transmitted, bit repetition, puncturing, or shortening of the code blocks to be transmitted is necessary to match the capacity of the physical time-frequency resources. This process is called rate matching. Multiple channel-coded CBs need to undergo rate matching, interleaving, concatenation, and other processing before being transmitted as a single physical data block (codeword) to the receiver.

[0104] Accordingly, at the receiving end, the received signal needs to be recovered into the original code block through a rate-matching dematching process. This involves using the reverse operation as at the transmitting end.

[0105] (5) Modulation mapping:

[0106] The principle of modulation mapping is to convert raw information (such as digital signals) into a signal form suitable for transmission through specific mapping rules. Specifically, it involves modulating the channel-coded data / information onto an appropriate carrier wave. There are various modulation methods, such as amplitude modulation (AM), frequency modulation (FM), and phase modulation (PM). These modulation methods can be selected according to the specific application scenario and transmission requirements. The mapping process then performs the mapping, that is, mapping the encoded data / information onto modulation symbols. This typically involves mapping binary data to a specific symbol set (such as quadrature amplitude modulation (QAM), phase shift keying (PSK), etc.), where each symbol can represent a specific combination of bits.

[0107] Finally, the modulated signal is transmitted through the channel. The transmission method of the channel can be wired or wireless, without restriction, depending on the application scenario.

[0108] At the receiving end, after receiving the modulated signal, demodulation and decoding are performed: that is, the original data is recovered through the demodulation and decoding process. This includes using operations that are the reverse of those at the transmitting end, such as demapping, demodulation, and decoding, to ensure that the recovered data is consistent with the original data.

[0109] Different modulation schemes are typically suitable for different channel conditions and transmission requirements. For example, in noisy environments, more complex modulation schemes may be needed to improve interference immunity. The purpose of modulation mapping is to utilize channel resources, thereby improving transmission efficiency and reliability.

[0110] It should be noted that in the embodiments of this application, "at least one" refers to one or more, and "more than one" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can represent: a, b, c, a and b, a and c, b and c, or a and b and c, where a, b, and c can be single or multiple.

[0111] Furthermore, unless otherwise stated, the ordinal numbers such as "first," "second," or "1," "2," etc. (except when referring to numerical values) mentioned in the embodiments of this application are used to distinguish multiple objects and are not used to limit the size, content, order, timing, priority, or importance of multiple objects. For example, the first information bit sequence and the second information bit sequence are only used to distinguish different information bit sequences, and do not indicate that the size, priority, or importance of these two information bit sequences are different.

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

[0113] The terms "comprising" and "having," and any variations thereof, used in the following description of embodiments of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include other steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices. Furthermore, the term "for indicating" used in the description of embodiments of this application can include both direct and indirect indication. When describing an indication message for indicating A, it may include whether the indication message directly indicates A or indirectly indicates A, but does not necessarily mean that the indication message carries A.

[0114] In this application, "send" and "receive" refer to the direction of information / data / signal transmission. For example, "send information to XX" can be understood as the destination of the information being XX, and "send information" can include direct transmission or indirect transmission through other units or modules. "Receive information from YY" can be understood as the source of the information being YY, and "receive information" can include direct reception from YY or indirect reception from YY through other units or modules. Furthermore, "send" can also be understood as the "output" of a chip interface, and "receive" can be understood as the "input" of a chip interface. In other words, "send" or "receive" can occur between nodes / devices, such as a base station and a terminal transmitting or receiving data via an air interface. "Send" or "receive" can also occur within a device, such as between components, modules, chips, software modules, or hardware modules within the device via a bus, wiring, or interface.

[0115] It should be understood that the names of the messages (or information, etc.) in the following processes in this application are merely examples. As communication technology evolves, the names of the messages (or information, etc.) in the following processes may change. However, regardless of how the names change, as long as their meaning is the same as the function or meaning of the messages (or information, etc.) in this application, they all fall within the protection scope of this application. For example, "first information bit" can be replaced with "valid information bit," and "second information bit" can be replaced with "reserved bit." Furthermore, in the embodiments of this application, "assigning" the first information bit to the second information bit can also be understood as: "copying" the first information bit to the second information bit, or "filling" the position of the first information bit into the position of the second information bit.

[0116] The technical solution of this application is described below with reference to specific embodiments.

[0117] This application provides a communication method applicable to, but not limited to, the communication system shown in Figure 1. The method can be implemented by a first communication device and a second communication device. The first communication device can act as a data sender and / or receiver, and the second communication device can also act as a data sender and / or receiver. For example, if the first communication device is the sender, then the second communication device is the receiver; or if the first communication device is the receiver, then the second communication device is the sender. The following example uses the first communication device as the sender and the second communication device as the receiver. The first and second communication devices are different communication devices. The first communication device (or the second communication device) can be a terminal device, a component of a terminal device (e.g., a processor, chip, or chip system), or a device used in conjunction with a terminal device. The second communication device (or the first communication device) can be a network device, a component of a network device (e.g., a processor, chip, or chip system), or a device used in conjunction with a network device. For example, the first communication device is a network device and the second communication device is a terminal device; or the first communication device is a terminal device and the second communication device is a network device; or the first communication device is a terminal device and the second communication device is another terminal device; or the first communication device is a network device and the second communication device is another network device.

[0118] This application does not impose specific limitations on the specific structure of the execution entities (such as the first communication device and the second communication device) or the number of each execution entity in the methods provided in the embodiments of this application. As long as communication can be performed according to the methods provided in the embodiments of this application by running a program that records the code of the methods provided in the embodiments of this application, the following description uses the interaction between the first communication device and the second communication device as an example. The order of steps in the following processes is merely an example. In practical applications, the execution order of steps in each process can be adjusted, and some or all steps can be executed adaptively. Referring to Figure 3, the specific process of this method may include the following steps:

[0119] S301: The first communication device acquires a first information bit sequence, which includes at least one first information bit and at least one second information bit, and the reliability of the location of the at least one first information bit is lower than the reliability of the location of the at least one second information bit; the first information bit carries valid information, and the second information bit is a reserved bit.

[0120] For example: the first communication device can be a network device (e.g., a base station), and the second communication device can be a terminal device; or, the first communication device can be a terminal device, and the second communication device can be a network device (e.g., a base station); or, the first communication device is a terminal device, and the second communication device is another terminal device; or, the first communication device is a network device (e.g., a first base station), and the second communication device is another network device (e.g., a second base station), etc.

[0121] In one possible implementation, the first information bit sequence may carry control information such as scheduling information and / or activation commands.

[0122] In the above, the control information carrying scheduling information and / or activation commands can be downlink control information (DCI), etc. The scheduling information can include scheduling information for the physical downlink shared channel (PDSCH) and / or the physical uplink shared channel (PUSCH), such as time-frequency domain resource allocation information, modulation and coding scheme (MCS), etc. The activation command can include activation commands, deactivation commands, etc. Typically, the control information carrying scheduling information (or activation commands) can include dozens (e.g., 37) effective information bits and a dozen reserved bits. Since the reserved bits account for a relatively high proportion, the scheme of this application embodiment can utilize the reserved bits at high reliability positions to improve the reliability of effective information bits at low reliability positions, thereby significantly improving its decoding performance.

[0123] In this application embodiment, the first information bit can be referred to as the valid information bit, and the second information bit can be referred to as the reserved bit. This application does not limit the specific values ​​of the first information bit and / or the second information bit. For example, the value of the second information bit can be 0 or not, and there is no restriction on this.

[0124] In this embodiment, the reliability of the location of the information bit can be understood as, but is not limited to, the channel reliability of the location of the information bit. The higher the channel reliability of the location of the information bit, the lower the probability of channel decoding error, that is, the less likely errors are to occur during the channel decoding process.

[0125] In some embodiments of this application, "decoding" can be replaced with "decoding", and "decoding performance" can be replaced with "decoding performance" accordingly.

[0126] In one possible implementation, the position of an information bit in the information bit sequence corresponds to a position number / serial number, which can be pre-given according to the order corresponding to the reliability of the position. Therefore, the first communication device can determine the reliability of a position based on the position number / serial number of the first information bit (or the position of the first information bit).

[0127] For example, the reliability of N locations is defined by the protocol (the reliability of these N locations is relative reliability). The N locations are sorted from low to high (or from high to low) according to their reliability to obtain the sorted N locations. The sorted N locations are then assigned corresponding numbers / serial numbers; N is a positive integer.

[0128] For example, the N positions, sorted from lowest to highest reliability, are numbered 1, 2, ..., N. If the position number / serial number of the first information bit is 1 and the position number / serial number of the second information bit is 3, then it can be determined that the reliability of the position of the first information bit is lower than the reliability of the position of the second information bit.

[0129] For example, the N positions, sorted from highest to lowest reliability, are numbered 1, 2, ..., N. If the position number / serial number of the first information bit is 1 and the position number / serial number of the second information bit is 3, then it can be determined that the reliability of the position of the first information bit is higher than the reliability of the position of the second information bit.

[0130] S302: The first communication device obtains a second information bit sequence based on the first information bit sequence; the second information bit sequence includes at least one first information bit, and the reliability of the position of the at least one first information bit is higher than the reliability of the position of the at least one first information bit in the first information bit sequence.

[0131] In this embodiment of the application, when the first communication device executes S302, it may be implemented in several possible ways, including but not limited to the following:

[0132] Implementation Method 1: The first information bit sequence includes the first information bit at the first position, the first information bit at the second position, the second information bit at the third position, and the second information bit at the fourth position; the reliability of the first and second positions, the third position, and the fourth position are respectively from low to high.

[0133] Based on the above, the first communication device obtains a second information bit sequence based on the first information bit sequence, which may include: the first communication device assigning the first information bit at the first position to the fourth position and assigning the first information bit at the second position to the third position according to the first rule, thereby obtaining the second information bit sequence; wherein, the first rule is to assign the first information bits at the positions with reliability from low to high to the positions of the second information bits with reliability from high to low in a one-to-one correspondence.

[0134] For example, when the first communication device assigns a first information bit from a first position to a fourth position, it can mean that the value of the second information bit in the fourth position is replaced (or overwritten) with the value of the first information bit in the first position. When the first communication device assigns a first information bit from a second position to a third position, it can mean that the value of the second information bit in the third position is replaced (or overwritten) with the value of the first information bit in the second position.

[0135] For example, assuming the value of the first information bit in the first position is 1, the first communication device assigns the value of the first information bit in the first position to the fourth position. Specifically, it can replace (or overwrite) the value of the second information bit in the fourth position with 1.

[0136] In one possible implementation, when the first communication device assigns the first information bit in the first position to the fourth position and assigns the first information bit in the second position to the third position, the first communication device may not make any changes to the first information bit in the first position and the first information bit in the second position. Alternatively, the first communication device may assign the second information bit in the fourth position to the first position and assign the second information bit in the third position to the second position.

[0137] Implementation Method 2: The first information bit sequence includes the first information bit at the first position, the first information bit at the second position, the second information bit at the third position, and the second information bit at the fourth position; the reliability of the first and second positions, the third position, and the fourth position are respectively from low to high.

[0138] Based on the above, the first communication device obtains a second information bit sequence based on the first information bit sequence, which may include: the first communication device assigning the first information bit at the second position to the fourth position and assigning the first information bit at the first position to the third position according to the second rule, thereby obtaining the second information bit sequence; wherein, the second rule is to assign the first information bits at the positions with high to low reliability to the positions of the second information bits with high to low reliability in a one-to-one correspondence.

[0139] Similarly, when the first communication device assigns the first information bit from the second position to the fourth position, it can mean that the value of the second information bit in the fourth position is replaced (or overwritten) with the value of the first information bit in the second position. When the first communication device assigns the first information bit from the first position to the third position, it can mean that the value of the second information bit in the third position is replaced (or overwritten) with the value of the first information bit in the first position.

[0140] In this embodiment of the application, when the first communication device assigns the first information bit in the second position to the fourth position and assigns the first information bit in the first position to the third position, the first communication device may not make any changes to the first information bit in the first position and the first information bit in the second position, or the first communication device may assign the second information bit in the fourth position to the second position and assign the second information bit in the third position to the first position, that is, assign the first information bit in the first position and the first information bit in the second position to 0 respectively.

[0141] Based on implementation method two, in one possible implementation, the first information bit sequence further includes a first information bit at a fifth position, where the reliability of the fifth position is lower than that of the first position. The method in this embodiment may further include: the first communication device assigning the first information bit at the fifth position to either the first or second position. This implementation method can improve the reliability of more first information bits in the first information bit sequence, thereby enhancing its decoding performance.

[0142] In one possible implementation, the at least one first information bit may include all or a portion of the Cyclic Redundancy Check (CRC) bits. In this embodiment, the portion of the CRC bits may be unscrambled CRC bits from the total CRC bits. This implementation improves the decoding performance of all or a portion of the CRC bits in the first information bit sequence. Furthermore, even when scrambled CRC bits are present in the first information bit sequence, the position of the scrambled CRC bits remains unchanged, thus reducing the impact on the scrambled bits.

[0143] In one possible implementation, the first information bit sequence is the information bit sequence after interleaving.

[0144] Optionally, before the first communication device performs interleaving processing to obtain the first information bit sequence, the method in this embodiment may further include: the first communication device assigning a first information bit at a lower reliability position in the original information bit sequence to a second information bit at a higher reliability position in the original information bit sequence to obtain the information bit sequence before interleaving processing; and interleaving the information bits before interleaving processing to obtain the first information bit sequence; or

[0145] In other embodiments of this application, the method of this application embodiment may further include: when the first communication device generates the original information bit sequence, it may place all or part of the second information bits at a position with a lower reliability than the position of the first information bits to obtain the information bit sequence before interleaving, and interleave the information bits before interleaving to obtain the first information bit sequence.

[0146] For example, if the reliability of the information bit sequence from beginning to end is from low to high, the base station (an example of the first communication device) can attach all or part of the second information bits before all the first information bits.

[0147] In another possible implementation, the first information bit sequence is the information bit sequence prior to the interleaving process.

[0148] Based on this implementation, after the first communication device obtains the second information bit sequence based on the first information bit sequence, the method of this application embodiment may further include: the first communication device performing interleaving processing on the second information bit sequence to obtain an interleaved information bit sequence. Optionally, after the first communication device performs interleaving processing on the second information bit sequence to obtain an interleaved information bit sequence, the method of this application embodiment may further include: the first communication device assigning the first information bit with lower reliability in the interleaved information bit sequence to the position of the second information bit with higher reliability in the interleaved information bit sequence.

[0149] S303: The first communication device obtains the channel-coded bit sequence based on the second information bit sequence.

[0150] In this embodiment of the application, the first communication device obtains a channel-coded bit sequence based on the second information bit sequence, which may include: the first communication device processes the second information bit sequence using a channel coding method to obtain the channel-coded bit sequence, wherein the channel coding method can be an existing channel coding method, and there is no specific limitation on it, such as the Polar coding method.

[0151] S304: The first communication device outputs the channel-coded bit sequence, and correspondingly, the second communication device obtains the channel-coded bit sequence.

[0152] In this embodiment, the first communication device can transmit the channel-coded bit sequence to the second communication device through a component (e.g., a communication module, antenna, etc.); alternatively, the first communication device can output the channel-coded bit sequence through its communication interface, and the second communication device's communication interface obtains the channel-coded bit sequence; or, the first communication device can output the channel-coded bit sequence through a component (e.g., a chip) corresponding to its first communication device, and the second communication device obtains the channel-coded bit sequence through a component (e.g., a chip) corresponding to its second communication device. Therefore, this application does not limit the specific implementation method of the first communication device transmitting the channel-coded bit sequence to the second communication device.

[0153] In one possible implementation, the first communication device outputs a channel-coded bit sequence including: rate matching and modulation mapping of the channel-coded bit sequence. Specific implementation methods can refer to existing transmission processes such as rate matching and modulation mapping, which will not be detailed here.

[0154] S305: The second communication device obtains a second information bit sequence based on the channel-coded bit sequence.

[0155] In this embodiment of the application, the second communication device obtains a second information bit sequence based on the channel-coded bit sequence, which may include: the second communication device processing the channel-coded bit sequence using a channel decoding method to obtain the second information bit sequence; wherein, the channel decoding method may correspond to the channel coding method in S303 above, such as the polar decoding method.

[0156] S306: The second communication device obtains the first information bit sequence based on the second information bit sequence.

[0157] Corresponding to the various implementations in S302 above, the second information bit sequence in S306 is as follows:

[0158] Based on the above implementation method one: the second information bit sequence is obtained based on the first information bit sequence and the first rule. In the second information bit sequence, the second information bit at the fourth position is assigned the value of the first information bit at the first position, and the second information bit at the third position is assigned the value of the first information bit at the second position.

[0159] Based on the above implementation method two: the second information bit sequence is obtained based on the first information bit sequence and the second rule. In the second information bit sequence, the second information bit at the fourth position is assigned the value of the first information bit at the second position, and the second information bit at the third position is assigned the value of the first information bit at the first position.

[0160] In one possible implementation, the second communication device obtains the first information bit sequence based on the second information bit sequence, which may include: the second communication device canceling the assignment of the second information bit at the fourth position and canceling the assignment of the second information bit at the third position to obtain the first information bit sequence.

[0161] In this embodiment of the application, the second communication device cancels the assignment of the second information bit at the fourth position and cancels the assignment of the second information bit at the third position, which can be understood as: the second communication device restores the value of the second information bit at the fourth position and the value of the second information bit at the third position.

[0162] For example, suppose the value of the second information bit in the fourth position is 0, and the value of the first information bit in the first position (or the second position) is 1; after the second information bit in the fourth position is assigned a value by the first information bit in the first position (or the second position), the value of the second information bit in the fourth position is 1. The second communication device can cancel the assignment of the second information bit in the fourth position by setting the value of the second information bit in the fourth position to 0.

[0163] In one possible implementation, in the second information bit sequence, the first information bit at the first or second position is assigned a value by the first information bit at the fifth position, and the reliability of the fifth position is lower than that of the first position; based on this, the method of this application embodiment may further include the following steps:

[0164] Before canceling the assignment of the second information bit in the fourth position, the second communication device assigns the value of the second information bit in the fourth position to the first information bit in the first position, and assigns the value of the second information bit in the third position to the first information bit in the second position; or

[0165] Before canceling the assignment of the second information bit at the third position, the second communication device assigns the value of the second information bit at the fourth position to the first information bit at the second position, and assigns the value of the second information bit at the third position to the first information bit at the first position.

[0166] Based on the above scheme, the first communication device obtains a second information bit sequence based on the first information bit sequence. The reliability of the position of at least one first information bit in the second information bit sequence is higher than the reliability of the position of the same first information bit in the first information bit sequence. Therefore, the first communication device can perform channel coding on the second information bit sequence to obtain a channel-coded bit sequence, and then output the channel-coded bit sequence. In this way, compared to the receiving end obtaining the channel-coded bit sequence based on the first information bit sequence and performing decoding on it, the decoding performance of the receiving end obtaining the channel-coded bit sequence based on the second information bit sequence and performing decoding on it is higher. Therefore, this method can effectively improve the decoding performance of information bits.

[0167] The following uses the solution shown in Figure 3 applied to the communication system shown in Figure 1 as an example to introduce the solution of the embodiments of this application through several specific implementation methods.

[0168] Implementation Method 1:

[0169] In Embodiment 1, based on the scheme shown in FIG3 above, the scheme of this application embodiment is described in detail. Referring to FIG4, the method flow of Embodiment 1 includes the following steps:

[0170] S401: The first communication device generates the original information bit sequence, which includes m valid information bits (an example of the first information bit in the scheme shown in Figure 3 above) and n reserved bits (an example of the second information bit in the scheme shown in Figure 3 above), where m and n are positive integers.

[0171] In one possible implementation, for the control signal, m valid information bits are generated in the existing manner, and then n reserved bits are added after the m valid information bits to obtain the original information bit sequence.

[0172] S402: The first communication device performs CRC encoding on the original information bit sequence to obtain information bit sequence #1.

[0173] For example, the first communication device adds L CRC bits to the original information bit sequence, where L is a positive integer. CRC bits can also be considered as valid information bits.

[0174] In one possible implementation, the information bit sequence #1 includes, from left to right: m valid information bits, n reserved bits, and L CRC bits.

[0175] S403: The first communication device performs interleaving processing based on information bit sequence #1, and performs position adjustment according to the first rule for valid information bits with reliability lower than that of reserved bits, to obtain the target information bit sequence. The first rule is to fill / assign valid information bits in positions with reliability from low to high to reserved bits in positions with reliability from high to low (or fill / assign valid information bits in positions with reliability from high to low to reserved bits in positions with reliability from low to high).

[0176] When the first communication device executes S403, it may be implemented in several possible ways, including but not limited to the following:

[0177] The first implementation method involves first performing interleaving processing, and then, for valid information bits whose reliability is lower than that of the reserved bits, performing position adjustment according to the first rule (that is, assigning the valid information bits at the low reliability positions to the reserved bits). This specifically includes the following steps:

[0178] Step 1: Interleave the information bit sequence #1 to obtain the information bit sequence #2.

[0179] The information bit sequence #1 can be interleaved according to the existing interleaving process (e.g., section 5.3.1.1 in 3GPP standard TS 38.212v15.6.0), which will not be described in detail here.

[0180] Step 2: For the valid information bits in information bit sequence #2 (an example of the first information bit sequence in the scheme shown in Figure 3 above) whose reliability is lower than that of the reserved bits, fill / assign them to the reserved bits at the high reliability positions according to the first rule to obtain the target information bit sequence (an example of the second information bit sequence in the scheme shown in Figure 3 above).

[0181] For example, if information bit sequence #2 includes 5 valid information bits and 5 reserved bits, and the reliability of the positions where the 5 reserved bits are located is higher than the reliability of the positions where the 5 valid information bits are located, then these 5 valid information bits can be filled / assigned to the 5 reserved bits whose reliability is from high to low, according to their corresponding positions from low to high reliability.

[0182] For example, if information bit sequence #2 includes 10 valid information bits and 5 reserved bits, and the reliability of the positions of the 5 reserved bits is higher than the reliability of the positions of the 10 valid information bits, then the 10 valid information bits are sorted from lowest to highest reliability. The first 5 valid information bits from the sorted sequence are then used to fill / assign values ​​to the 5 reserved bits whose reliability is from highest to lowest, in a one-to-one correspondence.

[0183] For another example, if the information bit sequence #2 includes 6 valid information bits and 9 reserved bits, the reliability of the positions where the 9 reserved bits are located is higher than that of the positions where the 6 valid information bits are located. The 9 reserved bits can be sorted in descending order of reliability of the positions, and the first 6 reserved bits among them can be selected. Then, the 6 valid information bits are filled / assigned one by one to the first 6 reserved bits in descending order of reliability of their corresponding positions, according to the ascending order of reliability of their corresponding positions.

[0184] Optionally, before step 1 in implementation method 1 (i.e., before interleaving processing), the following can also be performed: The valid information bits in the information bit sequence #1 with ascending order of reliability of positions are assigned one by one to the reserved bits in the information bit sequence #1 with descending order of reliability of positions.

[0185] For example, the information bit sequence #1 includes m valid information bits and n reserved bits, and the reliability of the positions where the n reserved bits are located is higher than that of the positions where the m valid information bits are located. These m valid information bits can be filled / assigned one by one to these n reserved bits; specifically, the following can be included:

[0186] If n = m, then the m valid information bits can be filled / assigned one by one to the n reserved bits in descending order of reliability of their corresponding positions, according to the ascending order of reliability of their corresponding positions.

[0187] If n > m, then the m valid information bits can be filled / assigned one by one to the m reserved bits in descending order of reliability of their corresponding positions, according to the ascending order of reliability of their corresponding positions.

[0188] If n < m, then the n valid information bits can be filled / assigned one by one to the n reserved bits in descending order of reliability of their corresponding positions, according to the ascending order of reliability of their corresponding positions.

[0189] In step 2, for the valid information bits assigned to the reserved bits, the following processing methods can be included:

[0190] Processing method 1: For the valid information bits assigned to the reserved bits, the value before the corresponding reserved bit is assigned can be assigned to the position of this valid information bit, or filled / assigned with 0.

[0191] For example, information bit sequence #2 includes valid information bits at position 1 and position 2, and reserved bits at positions 3 and 4; the reliability of positions 1 and 2, and positions 3 and 4, is from low to high. The valid information bit at position 1 is assigned to the reserved bit at position 4, and the reserved bit at position 4 is assigned to the valid information bit at position 1 (equivalent to swapping the values ​​of the valid information bit at position 1 and the reserved bit at position 4). Similarly, the valid information bit at position 2 is assigned to the reserved bit at position 3, and the reserved bit at position 3 is assigned to the valid information bit at position 2 (equivalent to swapping the values ​​of the valid information bit at position 2 and the reserved bit at position 3).

[0192] If the reserved bits at positions 3 and 4 are 0 before the above assignment is performed, then the valid information bits at positions 1 and 2 can be set to 0.

[0193] By adopting processing method one, the reliability of effective information bits can be improved while the reserved bits can be effectively preserved.

[0194] Method 2: For valid information bits already assigned to reserved bits, leave them unchanged. For example, information bit sequence #2 includes valid information bits at positions 1 and 2, and reserved bits at positions 3 and 4; the reliability of positions 1 and 2, and positions 3 and 4, is from low to high. Assign the valid information bits at positions 1 and 2 to the reserved bits at positions 4 and 3 respectively, while leaving the values ​​of the valid information bits at positions 1 and 2 unchanged.

[0195] By adopting processing method two, while improving the reliability of effective information bits, it is possible to further ensure that the receiving end can obtain the effective information carried by the effective information bits, thereby further improving decoding performance.

[0196] In one possible implementation, if all the CRC bits added in step S402 above have not been scrambled, then the valid information bits in information bit sequence #2 may include all the added CRC bits.

[0197] If the CRC bits added in step S402 above include some scrambled CRC bits, then the valid information bits in information bit sequence #2 may include another part of CRC bits, which refers to the CRC bits other than the scrambled CRC bits in the added CRC bits.

[0198] For example, in S402 above, L CRC bits are added to the original information bit sequence, where the last 16 CRC bits of the L CRC bits are scrambled by RNTI. Then the effective information bits in information bit sequence #2 may include L-16 CRC bits that have not been scrambled by RNTI; here L is an integer greater than 16.

[0199] In the embodiments of this application, for all CRC bits or some unscrambled CRC bits in the information bit sequence #2, the same operation as for the valid information bits can be performed, that is, the CRC bits in the positions with lower reliability can be filled or assigned to the reserved bits with higher reliability, thereby improving the channel reliability of all CRC bits or unscrambled CRC bits, that is, the less likely errors are to occur during the channel decoding process, thereby improving the error correction capability of the encoding and ensuring the integrity and accuracy of the transmitted information.

[0200] The second implementation method involves first adjusting the positions of valid information bits whose reliability is lower than that of the reserved bits according to the first rule (i.e., assigning the valid information bits at the low-reliability positions to the reserved bits), and then performing interleaving processing, specifically including the following steps:

[0201] Step 1: For the valid information bits in information bit sequence #1 (an example of the first information bit sequence in the scheme shown in Figure 3 above) whose reliability is lower than that of the reserved bits, assign them one-to-one to the reserved bits in the high reliability position according to the first rule to obtain information bit sequence #3 (an example of the second information bit sequence in the scheme shown in Figure 3 above).

[0202] Step 1 is similar to step 2 in the above implementation method 1, and can be implemented by referring to the example there. It will not be described in detail here.

[0203] In one possible implementation, if all the CRC bits added in step S402 above have not been scrambled, then the valid information bits in information bit sequence #1 may include all the added CRC bits.

[0204] If the CRC bits added in step S402 above include some scrambled CRC bits, then the valid information bits in information bit sequence #1 may include another part of CRC bits, which refers to the CRC bits other than the scrambled CRC bits in the added CRC bits.

[0205] For example, in S402 above, L CRC bits are added to the original information bit sequence, where the last 16 CRC bits among the L CRC bits are scrambled by RNTI. Then, the valid information bits in information bit sequence #1 can include the L - 16 CRC bits that are not scrambled by RNTI; here, L is an integer greater than 16.

[0206] In the embodiments of the present application, for all CRC bits or some unscrambled CRC bits in information bit sequence #1, the same operations as those for valid information bits can be performed, that is, the CRC bits at positions with lower reliability can be filled or assigned to the reserved bits at positions with higher reliability.

[0207] Step 2: Interleave information bit sequence #3 to obtain a target information bit sequence.

[0208] The information bit sequence #3 can be interleaved according to the existing interleaving process to obtain a target information bit sequence, which will not be elaborated here.

[0209] Optionally, after step 2 in implementation manner two (i.e., after interleaving), the following can also be performed: The values of the valid information bits at positions with lower reliability in the target information bit sequence are assigned one by one to the reserved bits at positions with higher reliability in the target information bit sequence.

[0210] For example, if the reliability of the positions where n1 reserved bits are located in the target information bit sequence is higher than the reliability of the positions where m1 valid information bits are located, where n1 is a positive integer less than or equal to n, and m1 is a positive integer less than or equal to m; then these m1 valid information bits can also be filled / assigned one by one to these n1 reserved bits, which can specifically include the following:

[0211] If n1 = m1, then the m1 valid information bits can be filled / assigned one by one to the n1 reserved bits with the reliability of the positions from high to low according to the reliability of their corresponding positions from low to high.

[0212] If n1 > m1, then the m1 valid information bits can be filled / assigned one by one to the m1 reserved bits with the reliability of the positions from high to low according to the reliability of their corresponding positions from low to high. s

[0213] If n1 < m1, then the n1 valid information bits can be filled / assigned one by one to the n1 reserved bits with the reliability of the positions from high to low according to the reliability of their corresponding positions from low to high.

[0214] In step 2, for the valid information bits that have been assigned to the reserved bits, they can be filled / assigned to 0 (if the corresponding reserved bit was 0 before being assigned), or they can be left unchanged. There are no restrictions on this. See the above description for details.

[0215] The following details the process of filling / assigning reserved bits.

[0216] The bit sequence shown in Figure 5 is used as an example of the information bit sequence #2 (the information bit sequence after interleaving) in the above processing flow one. In the information bit sequence shown in Figure 5, the index at each position represents the identifier / number of the corresponding bit. Taking the reliability of the position from left to right as an example, it is sorted from low to high.

[0217] In the information bit sequence shown in Figure 5, the positions of valid information bits with a reliability lower than that of reserved bits are adjusted as follows:

[0218] Referring to Figure 5, for the valid information bits in the information bit sequence shown in Figure 5 whose position reliability is lower than that of some reserved bits, the position reliability from low to high is 1, 3, 5, 7, 8, 10, 12, 15, 16, 17, 19, 20, 2....18, 0, 14, and the sequence numbers of the reserved bits with higher reliability are 34, 33, 28, 22, 32, 30, 27, 25, 21...

[0219] According to the first rule, the valid information bits at the positions with reliability from low to high are filled / placed one-to-one into the reserved bits with reliability from high to low, that is, the valid information bits at the positions with reliability from low to high are assigned one-to-one into the reserved bits with reliability from high to low.

[0220] The valid information bit of sequence number 1 can be placed (assigned) to the reserved bit of sequence number 34, the valid information bit of sequence number 3 can be placed (assigned) to the reserved bit of sequence number 33, the valid information bit of sequence number 5 can be placed (assigned) to the reserved bit of sequence number 38, the valid information bit of sequence number 7 can be placed (assigned) to the reserved bit of sequence number 22, and so on, until the reliability of the position of the valid information bit to be operated is higher than the reliability of the position of the corresponding reserved bit, at which point the operation can be stopped.

[0221] For example, when continuing the above operation to the valid information bit of sequence number 2, the sequence number to be placed into the corresponding reserved bit is 29. However, the reliability of the position of the valid information bit of sequence number 2 is higher than the reliability of the position of the reserved bit of sequence number 29. Therefore, the assignment operation is not performed, that is, the valid information bit of sequence number 2 is not assigned to the reserved bit of sequence number 29.

[0222] In the information bit sequence shown in Figure 5, the valid information bits and CRC bits with a reliability lower than that of the reserved bits are adjusted together according to the first rule mentioned above, as follows:

[0223] Referring to Figure 5, for the valid information bits and CRC bits with reliability lower than that of the reserved bits, the numbers in order of reliability from low to high are: 1, 3, 5, 7, 8, 10, 12, 15, 16, 17, 19, 20, 37 (CRC bits)..., 38 (CRC bits), 0, 14, 39. The numbers of the reserved bits with higher reliability are 34, 33, 28, 22, 32, 30, 27, 25, 21...

[0224] The valid information bit of sequence number 1 can be placed (assigned) to the reserved bit of sequence number 34, the valid information bit of sequence number 3 can be placed (assigned) to the reserved bit of sequence number 33, the valid information bit of sequence number 5 can be placed (assigned) to the reserved bit of sequence number 38, the valid information bit of sequence number 7 can be placed (assigned) to the reserved bit of sequence number 22, and so on, until the reliability of the position of the valid information bit to be operated is higher than the reliability of the position of the corresponding reserved bit, at which point the operation can be stopped.

[0225] For example, when continuing the above operation to the CRC bit of sequence number 37, the sequence number to be placed into the corresponding reserved bit is 29. However, the reliability of the position of the CRC bit of sequence number 37 is higher than the reliability of the position of the reserved bit of sequence number 26. Therefore, the assignment operation is not performed, that is, the CRC bit of sequence number 37 is not assigned to the reserved bit of sequence number 26.

[0226] For example, based on the above implementation, several specific examples of interleaving processing are provided below:

[0227] a represents valid information bits, b represents reserved bits, and c represents CRC bits.

[0228] The information bit sequence before interleaving can be represented as: [a(0),a(1),…,a(s1),b(0),b(1),…,b(s2),c(0),c(1),…,c(s3)]; in one possible implementation, s3 = 23.

[0229] The information bit sequence after interleaving can be represented as: [d(0),d(1),…,d(K)]; where K=s1+1+s2+1+s3=s1+s2+s3+2;

[0230] The reliability W of the bit position in the bit sequence after interleaving is expressed as: W(d(0))<=W(d(1))<=W(d(2))….<=W(d(K)); the symbol “<=” means less than or equal to.

[0231] The valid information bits in the interleaved information bit sequence are represented as a' and the reserved bits are represented as b'.

[0232] When the CRC bits are not included in the valid information bits, the pseudocode for interleaving is as follows:

[0233] First, set i = 0, j = 0, k = 0; when i <= K, if d(i) belongs to the valid information bit a, then a'(j) = d(i); if d(i) belongs to the reserved bit b, then b'(k) = d(i), j = j + 1, k = k + 1.

[0234] When the valid information bits include CRC bits, the pseudocode for interleaving is as follows:

[0235] First, set i = 0, j = 0, k = 0; when i <= K, if d(i) belongs to valid information bit a or CRC bit c, then a'(j) = d(i); if d(i) belongs to reserved bit b, then b'(k) = d(i), j = j + 1, k = k + 1.

[0236] When the valid information bits include CRC bits, but the CRC bits do not include the last 16 scrambled CRC bits, the pseudocode for interleaving is as follows:

[0237] First, set i = 0, j = 0, k = 0; when i is less than or equal to K, if d(i) belongs to the valid information bit a, or d(i) belongs to the CRC bit c(o), where o is an integer greater than or equal to 0 and less than or equal to 15, then a'(j) = d(i); if d(i) belongs to the reserved bit b, then b'(k) = d(i), j = j + 1, k = k + 1.

[0238] Based on the above implementation method, the following is a pseudocode for performing the filling / assignment process of reserved bits according to the first rule:

[0239] For example, the pseudocode for assigning information bits with reliability from low to high to the reserved bits with reliability from high to low is as follows:

[0240] First, set Set l = 0; m1 = 0; m2 = 0; when m2 is less than or equal to s2, if the reliability W(a'(m1)) of a'(m1) is less than the reliability W(b'(s2-m2)) of b'(s2-m2), then b'(s2-m2) = a'(m1), m1 = m1+1, m2 = m2+1; otherwise, m1 = m1+1, that is, perform the aforementioned judgment and assignment for the next valid information bit.

[0241] S404: The first communication device performs channel coding on the target information bit sequence to obtain the channel-coded bit sequence.

[0242] In one possible implementation, the first communication device performs Polar code encoding on the target information bit sequence to obtain the channel-coded bit sequence.

[0243] S405: The first communication device performs rate matching processing based on the channel-coded bit sequence to obtain a rate-matched bit sequence.

[0244] The specific implementation of S405 can be referenced from the current rate matching process, which will not be detailed here.

[0245] S406: The first communication device transmits the bit sequence after rate matching; correspondingly, the second communication device receives the bit sequence after rate matching.

[0246] In one possible implementation, the first communication device transmits a rate-matched bit sequence by: performing modulation mapping on the rate-matched bit sequence and transmitting the modulated-mapped signal. Correspondingly, the second communication device receives the rate-matched bit sequence by: receiving a first signal, performing demodulation mapping on the first signal, and obtaining the rate-matched bit sequence.

[0247] S407: The second communication device performs de-rate matching processing based on the bit sequence after rate matching processing to obtain the channel-coded bit sequence.

[0248] The specific implementation of S407 can refer to the current solution rate matching process, which will not be detailed here.

[0249] S408: The second communication device performs channel decoding on the channel-coded bit sequence to obtain the target information bit sequence.

[0250] In one possible implementation, the second communication device performs Polar code decoding (or decoding) on ​​the target information bit sequence to obtain the channel-coded bit sequence.

[0251] S409: The second communication device performs deinterleaving and position recovery based on the target information bit sequence to obtain information bit sequence #1.

[0252] When the second communication device executes S409, it may include the following possible implementation methods for the target information bit sequence obtained by implementing method one in S403 above:

[0253] Implementation Method 1: Based on the target information bit sequence, first perform position recovery (i.e., perform pre-reserved bit padding cancellation processing), then perform deinterleaving processing. Specifically, this may include the following steps:

[0254] Step 1: For the reserved bits in the target information bit sequence that have been padded / assigned with valid information bits, cancel the corresponding padded / assignment (i.e., padded or assigned back to 0) to obtain information bit sequence #2.

[0255] Regarding step 1 in implementation method one, in one possible implementation method, the bits at which positions in the target information bit sequence are reserved bits can be determined according to the agreed bit placement information before and after interleaving and the first rule; then, among the reserved bits at these positions, for the reserved bits that have been filled / assigned by valid information bits (i.e., reserved bits with values ​​not equal to 0), their corresponding filling / assignment is canceled (i.e., filled / assigned back to 0), to obtain information bit sequence #2.

[0256] The number of reserved bits can be determined based on the number of valid information bits (including CRC bits) and the agreed total number of bits.

[0257] For example, based on the agreed bit placement information before and after interleaving, if it is determined that there are 5 reserved bits in the target bit sequence that have been padded or assigned values, these 5 reserved bits can be refilled or assigned to 0.

[0258] Step 2: Deinterleave the information bit sequence #2 to obtain the information bit sequence #1.

[0259] The de-interleaving process in step 2 corresponds to (or is the reverse of) the interleaving process in step 1 of implementation method S403 above.

[0260] Optionally, if the first communication device performed the assignment of reserved bits before step 1 in implementation method one, then after step 2, the second communication device can also perform the following: determine which bits in the information bit sequence #1 are reserved bits according to the agreed bit placement information before interleaving; wherein the number of reserved bits can be determined according to the number of valid information bits (including CRC bits) and the agreed total number of bits; and then, among the reserved bits in these positions, cancel the corresponding padding / assignment (i.e., padding / assignment back to 0) for the reserved bits that have been padded / assigned by valid information bits.

[0261] Implementation Method 2: Based on the target information bit sequence, first perform deinterleaving processing, and then perform position recovery (i.e., perform the filling cancellation processing of reserved bits).

[0262] Step 1: Deinterleave the target information bit sequence to obtain information bit sequence #4.

[0263] The deinterleaving process used in step 1 corresponds to (or is the reverse of) the interleaving process in S403.

[0264] Step 2: For the reserved bits in information bit sequence #4 that have been filled / assigned with valid information bits, cancel the corresponding filling / assignment (i.e., fill / assign back to 0) to obtain information bit sequence #1.

[0265] Regarding step 2 in implementation method two, in one possible implementation, the bits at which positions in the information bit sequence #4 are reserved bits can be determined based on the agreed bit placement position information before interleaving. The number of reserved bits can be determined based on the known number of valid information bits (including the number of CRC bits) and the agreed total number of bits. Then, among the reserved bits at these positions, for the reserved bits that have been filled / assigned by valid information bits (i.e., reserved bits with non-zero values), their corresponding filling / assignment is canceled (i.e., filled / assigned back to 0), resulting in information bit sequence #1.

[0266] Optionally, in the first implementation of step S403 above, if the valid information corresponding to the padded / assigned reserved bits is padded / assigned to 0, then in step S409, before canceling the padded / assigned reserved bits in the target information bit sequence, the second communication device may further include: the second communication device can determine the position of the valid information bit corresponding to the padded / assigned reserved bits in the target information bit sequence according to the agreed bit placement position information before and after interleaving and the first rule, and then padded / assigned the padded / assigned reserved bits back to the corresponding valid information bits.

[0267] For the target information bit sequence obtained by implementing method two in S403 above, when the second communication device executes S409, it may include the following possible implementation methods:

[0268] Implementation Method 1: Based on the target information bit sequence, first perform deinterleaving processing, then perform position recovery (i.e., perform pre-reserved bit padding cancellation processing). Specifically, this may include the following steps:

[0269] Step 1: Deinterleave the target information bit sequence to obtain information bit sequence #3.

[0270] In step 1, the deinterleaving process can correspond to (or be the reverse of) the interleaving process in step 2 of implementation method 2 in S403. The specific deinterleaving process can be referred to the current deinterleaving process, which will not be detailed here.

[0271] Step 2: For the reserved bits in information bit sequence #3 that have been filled / assigned with valid information bits, cancel the corresponding filling / assignment (i.e., fill / assign back to 0) to obtain information bit sequence #1.

[0272] Regarding step 2 in implementation method one, in one possible implementation, the bits at which positions in the information bit sequence #3 are reserved bits can be determined based on the agreed bit placement information before and after interleaving. The number of reserved bits can be determined based on the known number of valid information bits (including the number of CRC bits) and the agreed total number of bits. Then, among the reserved bits at these positions, for the reserved bits that have been filled / assigned by valid information bits (i.e., reserved bits with non-zero values), their corresponding filling / assignment is canceled (i.e., filled / assigned back to 0), resulting in information bit sequence #1.

[0273] Optionally, in step S403 above, if the first communication device fills / assigns 0 to the valid information corresponding to the filled / assigned reserved bits, then in step S409, before unfilling / assigning the filled / assigned reserved bits in information bit sequence #3, the steps performed by the second communication device may further include: determining which bits in information bit sequence #3 are reserved bits based on the agreed bit placement information before and after interleaving, wherein the number of reserved bits can be determined based on the known number of valid information bits (including the number of CRC bits) and the agreed total number of bits; furthermore, among these reserved bits, for the filled / assigned reserved bits, the positions of the valid information bits corresponding to the filled / assigned reserved bits in information bit sequence #3 can be determined according to the first rule, and then the filled / assigned reserved bits can be filled / assigned back to the corresponding valid information bits one by one.

[0274] Implementation Method Two: Based on the target information bit sequence, first perform position recovery (i.e., perform pre-reserved bit padding cancellation processing), then perform deinterleaving processing. Specifically, this may include the following steps:

[0275] Step 1: For the reserved bits in the target information bit sequence that have been padded / assigned with valid information bits, cancel the corresponding padded / assignment (i.e., padded / assigned back to 0) to obtain information bit sequence #5.

[0276] Regarding step 1 in processing flow a, in one possible implementation, the bits at which positions in the target information bit sequence are reserved bits can be determined based on the agreed bit placement information before and after interleaving. The number of reserved bits can be determined based on the known number of valid information bits (including the number of CRC bits) and the agreed total number of bits. Then, among the reserved bits at these positions, for the reserved bits that have been filled / assigned by valid information bits (i.e., reserved bits with non-zero values), their corresponding filling / assignment is canceled (i.e., filled / assigned back to 0), resulting in information bit sequence #5.

[0277] For example, based on the agreed bit placement information before and after interleaving, if it is determined that there are 5 reserved bits in the target bit sequence that have been padded or assigned values, these 5 reserved bits can be refilled or assigned to 0.

[0278] Optionally, in the second implementation of step S403 above, if the first communication device fills / assigns 0 to the valid information corresponding to the filled / assigned reserved bits, then in step S409, before the second communication device cancels the filling / assignment of the filled / assigned reserved bits in the target information bit sequence, it may further include the following:

[0279] Based on the agreed-upon bit placement information before and after interleaving, it is possible to determine which bits in the target information bit sequence are reserved bits. The number of reserved bits can be determined based on the known number of valid information bits (including the number of CRC bits) and the agreed-upon total number of bits. Furthermore, among these reserved bits, for the reserved bits that have been padded / assigned, the positions of the valid information bits corresponding to the padded / assigned reserved bits in the target information bit sequence can be determined according to the first rule. Then, the padded / assigned reserved bits are padded / assigned back to the corresponding valid information bits one by one.

[0280] Step 2: Deinterleave the information bit sequence #5 to obtain the information bit sequence #1.

[0281] S410: The second communication device performs CRC verification based on information bit sequence #1 to obtain the original information bit sequence.

[0282] For example, based on the above S401 to S410, several transmission process diagrams are shown below.

[0283] Example 1: If the first communication device (transmitter) in S403 is implemented using implementation method one, and the second communication device (receiver) in S409 is implemented using implementation method one, the execution flow can be as shown in Figure 6A. At the transmitting end, the original information bit sequence is first generated (see S401); then CRC bits are added to the original information bit sequence (see S402); next, interleaving processing is performed; after interleaving processing, the filling / assignment processing of reserved bits is performed (see implementation method one in S403); after that, channel coding (see S404), rate matching, and modulation mapping are performed sequentially (see S405); then the modulated and mapped bit sequence can be sent out (see S406).

[0284] Accordingly, at the receiving end, after receiving the bit sequence, demodulation mapping and rate matching (see S407) and channel decoding (see S408) are performed sequentially; after that, deinterleaving is performed, the complete information bits are extracted, and the reserved bits that have been padded / assigned are set to 0 (see implementation method 1 in S409), that is, the padded or assigned reserved bits are canceled; then CRC check is performed (see S410) to obtain the original information bit sequence.

[0285] Example 2: If the first communication device (transmitter) in S403 is implemented using implementation method one, and the second communication device (receiver) in S409 is implemented using implementation method two, the execution flow can be as shown in Figure 6B. At the transmitting end, the original information bit sequence is first generated (see S401); then CRC bits are added to the original information bit sequence (see S402); next, interleaving processing is performed; after interleaving processing, the reserved bits are filled / assigned (see implementation method one in S403); after that, channel coding (see S404), rate matching, and modulation mapping are performed sequentially (see S405); then the modulated and mapped bit sequence can be sent out (see S406).

[0286] Accordingly, at the receiving end, after receiving the bit sequence, demodulation mapping and rate matching (see S407) and channel decoding (see S408) are performed sequentially. After that, after extracting the complete information bits, the reserved bits that have been padded / assigned are set to 0, that is, the padded or assigned reserved bits are canceled, and then deinterleaving is performed (see implementation method 2 in S409). Then, CRC check is performed (see S410) to obtain the original information bit sequence.

[0287] Example 3: If the first communication device (transmitter) in S403 is implemented using implementation method one, and the second communication device (receiver) in S409 is implemented using implementation method two, the execution flow can be as shown in Figure 6C. At the transmitting end, the original information bit sequence is first generated (see S401); then CRC bits are added to the original information bit sequence (see S402); after that, the filling / assignment processing of reserved bits is performed, and then the interleaving processing is performed (see implementation method two in S403); after that, channel coding (see S404), rate matching, and modulation mapping are performed sequentially (see S405); then the rate-matched bit sequence can be sent out (see S406).

[0288] Accordingly, at the receiving end, after receiving the bit sequence, demodulation mapping and rate matching (see S407) and channel decoding (see S408) are performed sequentially; after that, deinterleaving is performed, the complete information bits are extracted, and the reserved bits that have been padded / assigned are set to 0 (see implementation method 1 in S409), that is, the padded or assigned reserved bits are canceled; then CRC check is performed (see S410) to obtain the original information bit sequence.

[0289] Example 4: If the first communication device (transmitter) in S403 is implemented using implementation method one, and the second communication device (receiver) in S409 is implemented using implementation method two, the execution flow can be as shown in Figure 6D. At the transmitting end, the original information bit sequence is first generated (see S401); then CRC bits are added to the original information bit sequence (see S402); after that, the filling / assignment processing of reserved bits is performed, and then the interleaving processing is performed (see implementation method two in S403); after that, channel coding (see S404), rate matching, and modulation mapping are performed sequentially (see S405); then the rate-matched bit sequence can be sent out (see S406).

[0290] Accordingly, at the receiving end, after receiving the bit sequence, demodulation mapping and rate matching (see S407) and channel decoding (see S408) are performed sequentially. After that, after extracting the complete information bits, the reserved bits that have been padded / assigned are set to 0, that is, the padded or assigned reserved bits are canceled, and then deinterleaving is performed (see implementation method 2 in S409). Then, CRC check is performed (see S410) to obtain the original information bit sequence.

[0291] In Implementation Method 1, after the first communication device (transmitter) processes the control information to obtain the original information bits, it can, before or after interleaving, fill or assign the valid information bits at the lower reliability positions to the reserved bits at the higher reliability positions according to the first rule, so as to improve the decoding reliability of the valid information. In this way, when the second communication device (receiver) performs decoding on the information bit sequence in the subsequent process, its decoding performance will be effectively improved.

[0292] Implementation Method Two:

[0293] Compared to Embodiment 1, the main difference in Embodiment 2 lies in the rules used by the first communication device (transmitter) and the second communication device (receiver) when performing the reserved bit filling process based on the information bit sequence #1. Referring to Figure 7, the method flow of Embodiment 2 includes the following steps:

[0294] S701: The first communication device generates the original information bit sequence, which includes m valid information bits (an example of the first information bit in the scheme shown in Figure 3 above) and n reserved bits (an example of the second information bit in the scheme shown in Figure 3 above), where m and n are positive integers.

[0295] S702: The first communication device performs CRC encoding on the original information bit sequence to obtain information bit sequence #1.

[0296] S701 and S702 can be referred to one-to-one with S401 and S402 mentioned above.

[0297] S703: The first communication device performs interleaving processing based on information bit sequence #1, and performs position adjustment according to the second rule for valid information bits with reliability lower than that of reserved bits, to obtain the target information bit sequence. The second rule is to fill / assign valid information bits in positions with high to low reliability to reserved bits in positions with high to low reliability (or fill / assign valid information bits in positions with low to high reliability to reserved bits in positions with low to high reliability).

[0298] When the first communication device executes S703, it may include the following possible implementations:

[0299] The first implementation method involves first performing interleaving processing, and then, for valid information bits whose reliability is lower than that of the reserved bits, performing position adjustment according to the second rule (that is, assigning the valid information bits at the low reliability positions to the reserved bits). This specifically includes the following steps:

[0300] Step 1: Interleave the information bit sequence #1 to obtain the information bit sequence #2.

[0301] The information bit sequence #1 can be interleaved according to the existing interleaving process, which will not be described in detail here.

[0302] Step 2: For the valid information bits in information bit sequence #2 (an example of the first information bit sequence in the scheme shown in Figure 3 above) whose reliability is lower than that of the reserved bits, fill / assign them to the reserved bits in the high reliability positions according to the second rule to obtain the target information bit sequence (an example of the second information bit sequence in the scheme shown in Figure 3 above).

[0303] Step 2 of implementation method one in S703 can be referred to in the description of step 2 of implementation method one in S403 above, and will not be detailed here. However, the main difference between step 2 of implementation method one in S703 and step 2 of implementation method one in S403 is that: for the valid information bits at the low reliability positions in the information bit sequence #2, they can be filled / assigned to the reserved bits with high to low reliability in order of their position reliability from high to low.

[0304] In one possible implementation, if there is a valid information bit in information bit sequence #2 whose position reliability is lower than that of a valid information bit already assigned to a reserved bit, then that valid information bit can be filled or assigned to a valid information bit already assigned to a reserved bit.

[0305] For example, taking the reliability of the positions from left to right as increasing from low to high, the information bit sequence #2 includes: valid information bit #0, valid information bit #1, valid information bit #2, valid information bit #3, and reserved bit #1 and reserved bit #2. The reliability of the positions containing reserved bit #1 and reserved bit #2 is higher than the reliability of the positions containing valid information bit #0, valid information bit #1, valid information bit #2, and valid information bit #3.

[0306] Based on the above, according to the second rule, valid information bits #3 and #2 are filled / assigned to reserved bits #2 and #1 in a one-to-one correspondence. For the remaining valid information bits #1 and #0, they can be filled / assigned to valid information bits #3 and #2 in a one-to-one correspondence.

[0307] The second implementation method involves first adjusting the positions of valid information bits whose reliability is lower than that of the reserved bits according to the second rule (i.e., assigning the valid information bits at the low-reliability positions to the reserved bits), and then performing interleaving processing, specifically including the following steps:

[0308] Step 1: For the valid information bits in information bit sequence #1 (an example of the first information bit sequence in the scheme shown in Figure 3 above) whose reliability is lower than that of the reserved bits, assign them one-to-one to the reserved bits in the high reliability position according to the second rule to obtain information bit sequence #3 (an example of the second information bit sequence in the scheme shown in Figure 3 above).

[0309] Step 1 of implementation method two in S703 can be specifically referred to as the description of step 1 of implementation method two in S403 above, and will not be detailed here. However, compared with step 1 of implementation method two in S403 above, the main difference of step 1 of implementation method two in S703 is that: for the valid information bits at the low reliability positions in the information bit sequence #1, they are filled / assigned one by one to the reserved bits with high to low reliability positions according to their position reliability from high to low (that is, the filling / assignment process is performed according to the second rule).

[0310] In one possible implementation, if there is a valid information bit in information bit sequence #1 whose position reliability is lower than that of a valid information bit already assigned to a reserved bit, then that valid information bit can be filled or assigned to a valid information bit already assigned to a reserved bit.

[0311] Step 1 is similar to step 2 in the above implementation method 1, and can be implemented by referring to the examples therein, which will not be described in detail here.

[0312] Step 2: Interleave the information bit sequence #3 to obtain the target information bit sequence.

[0313] The information bit sequence #3 can be interleaved according to the existing interleaving process to obtain the target information bit sequence, which will not be described in detail here.

[0314] The following details the process of filling / assigning reserved bits.

[0315] The bit sequence shown in Figure 5 is used as an example of the information bit sequence #2 (the information bit sequence after interleaving) in the above processing flow one. In the information bit sequence shown in Figure 5, the index at each position represents the identifier / number of the corresponding bit. Taking the reliability of the position from left to right as an example, it is sorted from low to high.

[0316] In the information bit sequence shown in Figure 5, the positions of valid information bits with a reliability lower than that of reserved bits are adjusted as follows:

[0317] Referring to Figure 5, for the valid information bits in the information bit sequence shown in Figure 5 whose position reliability is lower than that of some reserved bits, the position reliability from high to low is 14, 0, 18, 13, 11, 9, 6, 4, 2, 20, ... 5, 3, 1. For the reserved bits in the information bit sequence shown in Figure 5 whose position reliability is higher than that of some valid information bits, the position reliability from high to low is 34, 33, 38, 22, 32, 30, 27, 25, 21... 24, 23.

[0318] According to the second rule, the valid information bits at positions with high to low reliability are filled / placed one-to-one into the reserved bits with high to low reliability. In other words, the valid information bits at positions with low to high reliability are assigned one-to-one to the reserved bits with high to low reliability. For example, the valid information bit of sequence number 14 can be placed (assigned) to the reserved bit of sequence number 34, the valid information bit of sequence number 0 can be placed (assigned) to the reserved bit of sequence number 33, the valid information bit of sequence number 18 can be placed (assigned) to the reserved bit of sequence number 28, and the valid information bit of sequence number 13 can be placed (assigned) to the reserved bit of sequence number 22.

[0319] However, valid information bits assigned to reserved bits can also be assigned other valid information bits.

[0320] For example, as shown in Figure 5, the valid information bit of sequence number 14 can be placed (assigned) to the reserved bit of sequence number 34, the valid information bit of sequence number 0 can be placed (assigned) to the reserved bit of sequence number 33, the valid information bit of sequence number 18 can be placed (assigned) to the reserved bit of sequence number 28, and the valid information bit of sequence number 13 can be placed (assigned) to the reserved bit of sequence number 22.

[0321] The valid information bit at sequence number 11 (an example of the first information bit at the fifth position in the scheme shown in Figure 3 above) can be placed (assigned) to the valid information bit at sequence number 14 (an example of the first information bit at the first or second position in the scheme shown in Figure 3 above), and the valid information bit at sequence number 9 (an example of the first information bit at the fifth position in the scheme shown in Figure 3 above) can be placed (assigned) to the valid information bit at sequence number 0. Next, the valid information bit at sequence number 6 can be placed (assigned) to the reserved bit at sequence number 32, and so on, until all the reserved bits have been replaced (assigned) with the values ​​of the valid information bits, or until there are no valid information bits with a lower reliability than the reserved bits, at which point the operation stops.

[0322] In the information bit sequence shown in Figure 5, the valid information bits and CRC bits with a reliability lower than that of the reserved bits are adjusted together according to the first rule mentioned above, as follows:

[0323] Referring to Figure 5, for the valid information bits and CRC bits with reliability lower than that of the reserved bits, the order of reliability from high to low is: 39 (CRC bits), 14, 0, 38 (CRC bits), 18, 13, 11, 9, 6, 4, 2, 37 (CRC bits), 20, ... 5, 3, 1. For the reserved bits in the information bit sequence shown in Figure 5 whose position reliability is higher than that of some valid information bits, the order of position reliability from high to low is: 34, 33, 38, 22, 32, 30, 27, 25, 21... 24, 23.

[0324] The CRC bit of sequence number 39 can be placed (assigned) to the reserved bit of sequence number 34, the valid information bit of sequence number 14 can be placed (assigned) to the reserved bit of sequence number 33, the valid information bit of sequence number 0 can be placed (assigned) to the reserved bit of sequence number 28, and the CRC bit of sequence number 38 can be placed (assigned) to the reserved bit of sequence number 22.

[0325] Similarly, the valid information bit at sequence number 18 can be placed (assigned) to the CRC bit at sequence number 39, the valid information bit at sequence number 13 (an example of the first information bit at the fifth position in the scheme shown in Figure 3 above) can be placed (assigned) to the valid information bit at sequence number 14, the valid information bit at sequence number 11 (an example of the first information bit at the fifth position in the scheme shown in Figure 3 above) can be placed (assigned) to the valid information bit at sequence number 0, the valid information bit at sequence number 9 (an example of the first information bit at the fifth position in the scheme shown in Figure 3 above) can be placed (assigned) to the CRC bit at sequence number 38, and so on, until all reserved bits have been replaced (assigned) with the values ​​of valid information bits, or until there are no valid information bits with a lower reliability than the reserved bits, at which point the operation stops.

[0326] Based on the above implementation method, the following is a pseudocode for performing the filling / assignment process of reserved bits according to the second rule:

[0327] For example, the pseudocode for assigning information bits with reliability levels ranging from low to high to the corresponding reserved bits with reliability levels ranging from low to high is as follows:

[0328] First, set Set l = 0; m1 = 0; m2 = 0; when m2 is less than or equal to s2, if the reliability W(a'(m1)) of a'(m1) is less than the reliability W(b'(m2)) of b'(m2), then b'(s2-m2) = a'(m1), where m1 = m1+1 and m2 = m2+1; otherwise, m1 = m1+1, that is, perform the aforementioned judgment and assignment for the next valid information bit.

[0329] S704: The first communication device performs channel coding on the target information bit sequence to obtain the channel-coded bit sequence.

[0330] S705: The first communication device performs rate matching processing based on the channel-coded bit sequence to obtain a rate-matched bit sequence.

[0331] S706: The first communication device transmits the bit sequence after rate matching; correspondingly, the second communication device receives the bit sequence after rate matching.

[0332] S707: The second communication device performs rate matching de-matching processing based on the rate-matched bit sequence to obtain the channel-coded bit sequence.

[0333] S708: The second communication device performs channel decoding on the channel-coded bit sequence to obtain the target information bit sequence.

[0334] S709: The second communication device performs deinterleaving processing based on the target information bit sequence and performs position recovery according to the second rule to obtain information bit sequence #1.

[0335] For details on S709, please refer to the description of S409 above. The main difference of S709 is that the second communication device recovers the information bit sequence based on the second rule.

[0336] S710: The second communication device performs CRC verification based on information bit sequence #1 to obtain the original information bit sequence.

[0337] The above S704 to S710 can be referred to one by one with the contents described in S404 to S410 above, and will not be described in detail here.

[0338] In the second implementation method, after the first communication device (transmitter) processes the control information to obtain the original information bits, it can fill or assign the valid information bits at the lower reliability positions to the reserved bits at the higher reliability positions one by one according to the second rule before or after interleaving, so as to improve the decoding reliability of the valid information. In this way, the decoding performance of the second communication device (receiver) will be effectively improved when it decodes the information bit sequence in the subsequent process.

[0339] The difference between Embodiment 1 and Embodiment 2 lies in the different rules for filling or assigning valid information bits to reserved bits. Of course, in this application embodiment, the first communication device (transmitter) and the second communication device (receiver) are not limited to using the aforementioned rules to fill or assign values ​​to the reserved bits. The first communication device (transmitter) and the second communication device (receiver) may also agree to adopt other rules, which will not be detailed in this application.

[0340] It should be understood that existing technologies may change as technical solutions evolve, and the technical solutions provided in this application are not limited to the existing technologies provided.

[0341] It should be noted that different embodiments or some steps (e.g., any one or more steps) in different embodiments of this application can be combined with each other to form new embodiments. Furthermore, this application does not limit the inclusion of any one or more steps in different embodiments as including optional steps in a certain embodiment, mandatory steps in a certain embodiment, or both optional and mandatory steps in a certain embodiment.

[0342] It should be noted that, unless otherwise specified or there is a logical conflict, the terminology and / or descriptions between different implementation methods are consistent and can be referenced from each other.

[0343] It should be noted that the order of the steps in the embodiments of this application is determined by the logic of the scheme, and this application does not limit it.

[0344] It should be noted that the order in which different conditions are judged in the embodiments of this application is not limited by this application.

[0345] It should be noted that the terms "after" and "time" in this application do not strictly limit the specific point in time.

[0346] It should be noted that the nouns and terms used in this application are merely examples and may be other names, which are not limited in this application.

[0347] In the embodiments provided above, the methods provided by the embodiments of this application have been described from the perspective of interaction between various devices. To implement the functions of the methods provided in the embodiments or implementations of this application, the first communication device or the second communication device may include hardware structures and / or software modules, implementing the above functions in the form of hardware structures, software modules, or a combination of hardware structures and software modules. Whether a particular function is executed in the form of hardware structures, software modules, or a combination of hardware structures and software modules depends on the specific application and design constraints of the technical solution.

[0348] The module division in this embodiment is illustrative and represents only one logical functional division; in actual implementation, other division methods may be used. Furthermore, the functional modules in the various embodiments or implementations of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0349] Similar to the above concept, as shown in FIG8, this application embodiment also provides a communication device 800 for implementing the functions of the first communication device or the second communication device in the above method. For example, the communication device 800 can be a software module or a chip system. In this application embodiment, the chip system can be composed of chips or can include chips and other discrete devices. The communication device 800 may include: a communication unit 801 and a processing unit 802.

[0350] In this embodiment, the communication unit 801, also referred to as the transceiver unit, may include a sending unit and / or a receiving unit, respectively used to execute the sending and receiving steps of the first communication device or the second communication device in the above method embodiments. The processing unit 802 may be used to read instructions and / or data from the storage module so that the communication device 800 implements the aforementioned method embodiments.

[0351] Optionally, the communication device 800 may further include a storage unit 803, which is equivalent to a storage module and can be used to store instructions and / or data.

[0352] The communication device provided in the embodiments of this application will be described in detail below with reference to Figures 8 and 9. It should be understood that the description of the device embodiments corresponds to the description of the method embodiments. Therefore, the contents not described in detail can be implemented by referring to the manner shown in Figures 3 and 4 above and Figure 7. For the sake of brevity, they will not be repeated here.

[0353] The communication unit 801 can also be called a transceiver, transceiver, or transceiver device. The processing unit can also be called a processor, processing board, processing module, or processing device. Optionally, the device in the communication unit 801 used to implement the receiving function can be considered a receiving unit, and the device in the communication unit 801 used to implement the transmitting function can be considered a transmitting unit; that is, the communication unit 801 includes a receiving unit and a transmitting unit. The communication unit can sometimes also be called a transceiver, transceiver circuit, or transceiver unit. The receiving unit can sometimes be called a receiver, receiver, or receiving circuit. The transmitting unit can sometimes be called a transmitter, transmitter, or transmitting circuit.

[0354] When the communication device 800 is applied to the first communication device in the process shown in Figure 3 of the above embodiment:

[0355] The communication unit 801 is used to acquire a first information bit sequence, which includes at least one first information bit and at least one second information bit, and the reliability of the position of the at least one first information bit is lower than the reliability of the position of the at least one second information bit; the first information bit carries valid information, and the second information bit is a reserved bit;

[0356] The processing unit 802 is configured to obtain a second information bit sequence based on the first information bit sequence; the second information bit sequence includes at least one first information bit, and the reliability of the position of the at least one first information bit is higher than the reliability of the position of the at least one first information bit in the first information bit sequence; the processing unit 802 is also configured to obtain a channel-coded bit sequence based on the second information bit sequence.

[0357] The communication unit 801 is also used to output the channel-coded bit sequence.

[0358] When the communication device 800 is applied to the second communication device in the process shown in Figure 3 of the above embodiment:

[0359] The communication unit 801 is used to receive the channel-coded bit sequence.

[0360] The processing unit 802 is used to obtain a first information bit sequence based on the second information bit sequence; wherein the first information bit sequence includes at least one first information bit and at least one second information bit, and the reliability of the position of the at least one first information bit is lower than the reliability of the position of the at least one second information bit, the first information bit carries valid information, and the second information bit is a reserved bit;

[0361] The second information bit sequence includes at least one first information bit, and the reliability of the position of the at least one first information bit is higher than the reliability of the position of the at least one first information bit in the first information bit sequence.

[0362] The above are just examples. Processing unit 802 and communication unit 801 can also perform other functions. For a more detailed description, please refer to the relevant descriptions in the method embodiments shown in Figures 3 and 4 and Figure 7. They will not be repeated here.

[0363] Figure 9 shows a communication device 900 provided in an embodiment of this application. The communication device shown in Figure 9 can be a hardware circuit implementation of the communication device shown in Figure 8. This communication device 900 can be applied to the flowcharts shown above to perform the functions of the first or second communication device in the above method embodiments. For ease of explanation, Figure 9 only shows the main components of the communication device.

[0364] As shown in Figure 9, the communication device 900 includes a communication interface 901 and a processor 902. The communication interface 901 and the processor 902 are coupled to each other. It is understood that the communication interface 901 can be a transceiver or an input / output interface, or an interface circuit such as a transceiver circuit. Optionally, the communication device 900 may further include a memory 903 for storing instructions executed by the processor 902, or storing input data required by the processor 902 to execute instructions, or storing data generated after the processor 902 executes instructions.

[0365] When the communication device 900 is used to implement the methods shown in Figures 3, 4 and 7, the communication interface 901 is used to implement the functions of the communication unit 801, and the processor 902 is used to implement the functions of the processing unit 802.

[0366] This embodiment does not limit the specific connection medium between the communication interface 901, processor 902, and memory 903. In Figure 9, the memory 903, processor 902, and communication interface 901 are connected via a communication bus 904, which is represented by a thick line. The connection methods between other components are for illustrative purposes only and are not intended to be limiting. The communication bus 904 can be divided into address bus, data bus, control bus, etc. For ease of illustration, only one thick line is used in Figure 9, but this does not indicate that there is only one bus or one type of bus.

[0367] When the aforementioned communication device is a chip, Figure 10 shows a simplified schematic diagram of the chip's device structure. The chip 1000 includes an interface circuit 1001 and one or more processors 1002. Optionally, the chip 1000 may also include a bus. Wherein:

[0368] The processor 1002 may be an integrated circuit chip with signal processing capabilities. In implementation, each step of the method for determining the service node information described above can be completed by the integrated logic circuitry in the hardware of the processor 1002 or by instructions in software form. The processor 1002 may be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods and steps disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor.

[0369] The interface circuit 1001 can be used to send or receive data, instructions or information. The processor 1002 can use the data, instructions or other information received by the interface circuit 1001 to process the data, instructions or other information, and can send the processed information out through the interface circuit 1001.

[0370] Optionally, chip 1000 also includes memory 1003, which may include read-only memory and random access memory, and provides operation instructions and data to the processor. A portion of memory 1003 may also include non-volatile random access memory (NVRAM).

[0371] Optionally, the memory stores executable software modules or data structures, and the processor can execute corresponding operations by calling the operation instructions stored in the memory (which may be stored in the operating system).

[0372] Optionally, the chip can be used in the first or second communication device involved in the embodiments of this application. Optionally, the interface circuit 1001 can be used to output the execution result of the processor 1002. For the communication methods provided by one or more embodiments of this application, please refer to the foregoing embodiments, which will not be repeated here.

[0373] It should be noted that the functions of the interface circuit 1001 and the processor 1002 can be implemented through hardware design, software design, or a combination of hardware and software; no restrictions are imposed here.

[0374] This application also provides a computer-readable storage medium storing computer instructions for implementing the methods executed by the first communication device or the second communication device in the above method embodiments.

[0375] For example, when the computer program is executed by a computer, it enables the computer to implement the method executed by the first communication device or the second communication device in the above method embodiments.

[0376] This application also provides a computer program product containing instructions that, when executed by a computer, cause the computer to implement the method performed by the first communication device or the second communication device in the above method embodiments.

[0377] This application also provides a chip, including a processor, for calling computer programs or computer instructions stored in the memory, so that the processor executes the communication method of the implementation shown in Figures 3, 4 and 7.

[0378] In one possible implementation, the input of the chip corresponds to the receiving operation in the implementations shown in Figures 3, 4 and 7, and the output of the chip corresponds to the transmitting operation in the implementations shown in Figures 3, 4 and 7.

[0379] Optionally, the processor is coupled to the memory via an interface.

[0380] Optionally, the chip also includes a memory that stores computer programs or computer instructions.

[0381] The processor mentioned above can be a general-purpose central processing unit, a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits used to control the execution of a program through a communication method for the implementation shown in Figures 3, 4, and 7. The memory mentioned above can be read-only memory (ROM) or other types of static storage devices capable of storing static information and instructions, such as random access memory (RAM).

[0382] It should be noted that, for the sake of convenience and brevity, the explanations and beneficial effects of the relevant content in any of the communication devices provided above can be referred to the corresponding service node information determination method embodiments provided above, and will not be repeated here.

[0383] The module division in this embodiment is illustrative and represents only one logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional modules in each embodiment of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0384] Through the above description of the embodiments, those skilled in the art will clearly understand that the embodiments of this application can be implemented in hardware, firmware, or a combination thereof. When implemented in software, the above functions can be stored in a computer-readable medium or transmitted as one or more instructions or code on a computer-readable medium. Computer-readable media include computer storage media and communication media, wherein communication media include any medium that facilitates the transfer of a computer program from one place to another. Storage media can be any available medium accessible to a computer. For example, but not limited to, computer-readable media can include RAM, ROM, electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disc storage, magnetic disk storage media, or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible to a computer. Furthermore, any connection can suitably be a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of the medium. As used in embodiments of this application, disks and discs include compact discs (CDs), laser discs, optical discs, digital video discs (DVDs), floppy disks, and Blu-ray discs, wherein disks typically magnetically copy data, while discs optically copy data using lasers. The combinations above should also be included within the scope of protection for computer-readable media.

[0385] In summary, the above descriptions are merely embodiments of this application and are not intended to limit the scope of protection of this application. Any modifications, equivalent substitutions, improvements, etc., made based on the disclosure of this application should be included within the scope of protection of this application.

Claims

1. A communication method characterized by comprising: The method includes: Obtain a first information bit sequence, which includes at least one first information bit and at least one second information bit, wherein the reliability of the position of the at least one first information bit is lower than the reliability of the position of the at least one second information bit; the first information bit carries valid information, and the second information bit is a reserved bit; Based on the first information bit sequence, a second information bit sequence is obtained; the second information bit sequence includes at least one first information bit, and the reliability of the position of the at least one first information bit in the second information bit sequence is higher than the reliability of the position of the at least one first information bit in the first information bit sequence. Based on the second information bit sequence, the channel-coded bit sequence is obtained; Output the channel-coded bit sequence.

2. The method of claim 1, wherein, The first information bit sequence includes the first information bit at a first position, the first information bit at a second position, the second information bit at a third position, and the second information bit at a fourth position; the reliability of the first position, the second position, the third position, and the fourth position are respectively from low to high. The process of obtaining the second information bit sequence based on the first information bit sequence includes: According to the first rule, the first information bit at the first position is assigned to the fourth position, and the first information bit at the second position is assigned to the third position to obtain the second information bit sequence; The first rule is to assign the first information bits at positions with reliability from low to high to the positions of the second information bits with reliability from high to low in a one-to-one correspondence.

3. The method of claim 1, wherein, The first information bit sequence includes the first information bit at a first position, the first information bit at a second position, the second information bit at a third position, and the second information bit at a fourth position; the reliability of the first position, the second position, the third position, and the fourth position are respectively from low to high. The process of obtaining the second information bit sequence based on the first information bit sequence includes: According to the second rule, the first information bit at the second position is assigned to the fourth position, and the first information bit at the first position is assigned to the third position to obtain the second information bit sequence; The second rule involves assigning the first information bits, which are located at positions with high to low reliability, to the second information bits, which are located at positions with high to low reliability, in a one-to-one correspondence.

4. The method of claim 3, wherein, The first information bit sequence also includes the first information bit at a fifth position, wherein the reliability of the fifth position is lower than the reliability of the first position, and the method further includes: Assign the first information bit at the fifth position to the first position or the second position.

5. The method according to any one of claims 1 to 4, characterized in that, The at least one first information bit includes all or part of the cyclic redundancy check (CRC) bits.

6. The method of claim 5, wherein, The CRC bits in the aforementioned portion are the CRC bits that have not been scrambled from all the CRC bits.

7. The method according to any one of claims 1 to 6, characterized in that, The first information bit sequence is control information carrying scheduling information and / or activation commands.

8. The method according to any one of claims 1 to 7, characterized in that, The first information bit sequence is either the information bit sequence after interleaving or the information bit sequence before interleaving.

9. A communication method characterized by comprising: The method includes: Obtain the channel-coded bit sequence; Based on the channel-coded bit sequence, a second information bit sequence is obtained; Based on the second information bit sequence, the first information bit sequence is obtained; The first information bit sequence includes at least one first information bit and at least one second information bit, and the reliability of the position of the at least one first information bit is lower than the reliability of the position of the at least one second information bit. The first information bit carries valid information, and the second information bit is a reserved bit. The second information bit sequence includes at least one first information bit, and the reliability of the position of the at least one first information bit in the second information bit sequence is higher than the reliability of the position of the at least one first information bit in the first information bit sequence.

10. The method of claim 9, wherein, The first information bit sequence includes the first information bit at a first position, the first information bit at a second position, the second information bit at a third position, and the second information bit at a fourth position; the reliability of the first position, the second position, the third position, and the fourth position are respectively from low to high. The second information bit sequence is obtained based on the first information bit sequence and the first rule. In the second information bit sequence, the second information bit at the fourth position is assigned the value of the first information bit at the first position, and the second information bit at the third position is assigned the value of the first information bit at the second position. The first rule is to assign the first information bits, which are located at positions with reliability from low to high, to the positions of the second information bits, which are located at positions with reliability from high to low, in a one-to-one correspondence.

11. The method of claim 9, wherein, The first information bit sequence includes the first information bit at a first position, the first information bit at a second position, the second information bit at a third position, and the second information bit at a fourth position; the reliability of the first position, the second position, the third position, and the fourth position are respectively from low to high. The second information bit sequence is obtained based on the first information bit sequence and the second rule. In the second information bit sequence, the second information bit at the fourth position is assigned the value of the first information bit at the second position, and the second information bit at the third position is assigned the value of the first information bit at the first position. The second rule is to assign the first information bits at positions with high to low reliability to the second information bits at positions with high to low reliability in a one-to-one correspondence.

12. The method according to claim 10 or 11, characterized in that, The process of obtaining the first information bit sequence based on the second information bit sequence includes: The assignment of the second information bit at the fourth position is cancelled, and the assignment of the second information bit at the third position is also cancelled, to obtain the first information bit sequence.

13. The method according to claim 11 or 12, characterized in that, In the second information bit sequence, the first information bit at the first position or the second position is assigned a value by the first information bit at the fifth position, where the reliability of the fifth position is lower than the reliability of the first position; the method further includes: Before canceling the assignment of the second information bit at the fourth position, the second information bit at the fourth position is assigned to the first information bit at the first position, and the second information bit at the third position is assigned to the first information bit at the second position; or Before canceling the assignment of the second information bit at the third position, the second information bit at the fourth position is assigned to the first information bit at the second position, and the second information bit at the third position is assigned to the first information bit at the first position.

14. The method according to any one of claims 9 to 13, characterized in that, The at least one first information bit includes all or part of the cyclic redundancy check (CRC) bits.

15. The method of claim 14, wherein, The CRC bits in that part are the CRC bits that have not been scrambled from all the CRC bits.

16. The method according to any one of claims 9 to 15, characterized in that, The first information bit sequence is control information carrying scheduling information and / or activation commands.

17. The method according to any one of claims 9 to 16, characterized in that, The first information bit sequence is either the information bit sequence before deinterleaving or the information bit sequence after deinterleaving.

18. A communications device, characterized by It includes units or modules for performing the method as described in any one of claims 1 to 8, or units or modules for performing the method as described in any one of claims 9 to 17.

19. A communications device, characterized by It includes a processor and an input / output interface for inputting and / or outputting information, the processor for performing the method as described in any one of claims 1 to 8, or for performing the method as described in any one of claims 9 to 17.

20. The communication apparatus according to claim 19, wherein, It also includes a memory for storing a computer program, which, when executed by the processor, performs the method as described in any one of claims 1 to 8, or the method as described in any one of claims 9 to 17.

21. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer-readable program or instructions that, when executed on a communication device, cause the method as described in any one of claims 1 to 8 to be performed, or cause the method as described in any one of claims 9 to 17 to be performed.

22. A computer program product, characterised in that, The computer program product includes a computer program or instructions that, when run on a computer, cause the method as described in any one of claims 1 to 17 to be performed.

Images