Information transmission method and device

Abstract

The embodiment of the invention provides an information transmission method and device, and the method comprises the steps: determining a cyclic cache according to the length N of a first bit sequence and a rate matching mode, the length of the cyclic cache being M, and both N and M being integers greater than or equal to 1; determining a sending starting point of the second bit sequence according to the redundancy version; and sending the second bit sequence according to the cyclic cache, the sending length E of the second bit sequence and the sending starting point, wherein E is an integer greater than or equal to 1. According to the embodiment of the invention, the complexity of information retransmission can be reduced.

Description

Technical Field

[0001] This application relates to the field of communication technologies, and in particular, to an information transmission method and apparatus. Background Art

[0002] In a communication system, channel coding is usually adopted to improve the reliability of data transmission so as to ensure the quality of communication. A polar code is a linear block code. Currently, the polar code is an encoding method that can achieve the Shannon limit and has a low encoding and decoding complexity.

[0003] In the encoding process of a polar code, the traditional incremental redundancy (IR) hybrid automatic repeat request (HARQ) technology is usually adopted for encoding. Specifically, the initial transmission can adopt the rate matching of the new radio. For example, the initial transmission mother code (encoding length) is NRV0, and the transmission length is ERV0. If NRV0 > ERV0, rate matching is required. For example, puncturing is performed on the length of NRV0 - ERV0 at the front according to the code rate, and the corresponding non-interleaved positions are pre-frozen, or shortening processing is performed on the length of NRV0 - ERV0 at the back, or a repeated rate matching method is required when NRV0 < ERV0. However, there are multiple different branches of rate matching during retransmission. A large number of branches corresponding to the rate matching during retransmission will result in a high complexity of retransmission.

[0004] Therefore, how to reduce the complexity of information retransmission is a technical problem to be urgently solved. Summary of the Invention

[0005] Embodiments of this application provide an information transmission method and apparatus, which can reduce the complexity of information retransmission.

[0006] In a first aspect, embodiments of this application provide an information transmission method. This method can be applied to a sending end, which can be applied to a terminal device side, such as a terminal device or an encoding module in a terminal device, or a circuit or chip in a terminal device responsible for encoding functions (such as an encoding / decoding chip, also known as a baseband chip, or a system-on-chip (SoC) chip or system-in-package (SIP) chip containing an encoding / decoding core, etc.); or, the sending end can be applied to a network device side, such as a network device or an encoding module in a network device, or a circuit or chip in a network device responsible for encoding functions (such as an encoding / decoding chip, also known as a baseband chip, or a SoC chip or SIP chip containing an encoding / decoding core, etc.). The method may include: determining a circular buffer based on the length N of the first bit sequence and the rate matching method, wherein the length of the circular buffer is M, and N and M are both integers greater than or equal to 1; determining the transmission start point of the second bit sequence based on the redundancy version (RV); and transmitting the second bit sequence based on the circular buffer, the transmission length E of the second bit sequence, and the transmission start point, wherein E is an integer greater than or equal to 1.

[0007] In this embodiment, the second bit sequence is sent according to the circular buffer, the sending length of the second bit sequence, and the sending start point. This implementation is more friendly to the information transmission of polar codes and can ensure that each transmission can be self-decoded. Unlike the rate matching of different branches during retransmission, the information transmission scheme provided by this embodiment is simple to describe, uses the same rate matching description method for initial transmission and retransmission, and determines the sending start point of the second bit sequence according to the redundant version when sending the second bit sequence. The performance is stable and the complexity of retransmission can be reduced.

[0008] Secondly, embodiments of this application provide an information transmission method. This method can be applied to a receiving end, which can be applied to a terminal device side, such as a terminal device or a decoding module in a terminal device, or a circuit or chip in a terminal device responsible for decoding (such as an encoding / decoding chip, also known as a baseband chip, or a SoC chip or SIP chip containing an encoding / decoding core, etc.); or, the receiving end can be applied to a network device side, such as a network device or a decoding module in a network device, or a circuit or chip in a network device responsible for decoding (such as an encoding / decoding chip, also known as a baseband chip, or a SoC chip or SIP chip containing an encoding / decoding core, etc.). The method may include: receiving a signal, the signal corresponding to a transmitted second bit sequence, the second bit sequence corresponding to an encoding length of N, where N is an integer greater than or equal to 1; determining a circular buffer based on N and a rate matching method, the length of the circular buffer being M, where M is an integer greater than or equal to 1; determining the transmission start point of the second bit sequence based on a redundancy version; and decoding the signal based on the circular buffer, the transmission length E of the second bit sequence, and the transmission start point, where E is an integer greater than or equal to 1.

[0009] In this embodiment, the circular buffer can be determined by the length of the first bit sequence and the rate matching method. The transmission start point of the second bit sequence is determined based on the redundant version. Then, the received signal is decoded based on the circular buffer, the transmission length of the second bit sequence, and the transmission start point. This implementation is more friendly to polar code information transmission, ensuring that it can be self-decoded in each transmission. Unlike rate matching with different branches during retransmission, the retransmission scheme for information transmission provided in this embodiment is simple to describe, does not require re-encoding during retransmission, determines the transmission start point of the second bit sequence based on the redundant version, has stable performance, and can reduce the complexity of decoding.

[0010] In conjunction with the first or second aspect, in one possible implementation, determining the circular buffer based on N and the rate matching method includes: the rate matching method being puncturing or repeating, M = N, or the rate matching method being shortening, M = E0, where E0 is the length of the third bit sequence, the third bit sequence being the initial bit sequence, and E0 is an integer greater than or equal to 1.

[0011] In conjunction with the first or second aspect, in one possible implementation, the starting point of the third bit sequence in the circular buffer is the starting point corresponding to one of the multiple redundant versions. Through this embodiment, for the initial transmission, unlike the initial point of the third bit sequence in the circular buffer corresponding to rv0, the starting point of the third bit sequence in the circular buffer in this application embodiment can be the starting point corresponding to one of the multiple redundant versions. It can also be understood that the starting point of the third bit sequence in the circular buffer is the starting point corresponding to any one of the redundant versions. That is, for the third bit sequence, its starting point in the circular buffer is not fixed to the starting point corresponding to rv0, but can be the starting point corresponding to any redundant version, thereby increasing the flexibility of information transmission.

[0012] In one possible implementation, the rate matching method is determined based on E0 and the number of information bits K corresponding to the first bit sequence, including: E0≥N, the rate matching method is repetition; or, K / E0 is less than or equal to (or less than) a threshold and E0<N, the rate matching method is punching; or, K / E0 is greater than (or greater than or equal to) a threshold and E0<N, the rate matching method is shortening.

[0013] In one possible implementation, in conjunction with the first or second aspect, the threshold is equal to 7 / 16.

[0014] In one possible implementation, combining the first or second aspect, the starting point for transmitting the second bit sequence is determined based on the number of redundant versions.

[0015] In conjunction with the first or second aspect, in one possible implementation, the starting point for transmitting the second bit sequence is also determined according to N.

[0016] In conjunction with either the first or second aspect, in one possible implementation, the starting point for transmitting the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x≥2, and x is an integer.

[0017] In this embodiment, the transmission start points of the second bit sequence can be distributed between 0 and N / 2, with each start point being equally spaced. For retransmission, each transmission is relatively uniform and will not fall into a position greater than N / 2, i.e., it will not fall into a shortened position. Considering that during shortening, the bits at positions E to N-1 of the transmission length of the second bit sequence are shortened bits and cannot be transmitted as encoded bits, and the length of E to N-1 can be up to N / 2-1, the transmission start points determined in this embodiment only occur at positions 0 to N / 2, and none of the start points will fall into a shortened bit position. Therefore, the complexity of information retransmission can be reduced.

[0018] In conjunction with either the first or second aspect, in one possible implementation, the starting point for transmitting the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x+1, x≥2, and x is an integer.

[0019] In this implementation, compared to the possible implementations described above, the transmission start points of rv0 to rvx-1 are the same as those described above. The difference is that a transmission start point for rvx is added. This start point can be selected at the midpoint between M and N / 2, so that the transmission start point will not fall into the shortened bit position. The retransmission performance is better and the error rate can be reduced. Therefore, the performance after multiple retransmissions can be improved.

[0020] In conjunction with either the first or second aspect, in one possible implementation, the starting point for transmitting the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, where x ≥ 2 and x is an integer. In this implementation, the starting points are divided into equally spaced segments by N.

[0021] In conjunction with the first or second aspect, in one possible implementation, K0≥M, the version number of the redundant version is 0. Through this implementation, for the case where K0≥M, scheduling the version number of the redundant version to 0 prevents the transmission start point from falling into the shortened bit position, avoiding misunderstandings of the bit sequence. Therefore, it can reduce the description complexity and rate matching complexity in the standard.

[0022] In conjunction with the first or second aspect, in one possible implementation, the starting point for transmitting the second bit sequence is also determined according to M.

[0023] In conjunction with either the first or second aspect, in one possible implementation, the starting point for transmitting the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the second bit sequence transmission, id represents the version number of the redundant version, and the number of redundant versions is x, where x ≥ 2 and x is an integer. Through this implementation, under different M lengths, the bit sequence resulting from x transmissions can uniformly cover the entire codeword, preventing the starting point from falling into the shortened bit position, avoiding bit sequence misunderstandings, reducing the complexity of information retransmission, and further improving the performance of multiple retransmissions.

[0024] In conjunction with the first or second aspect, in one possible implementation where M < N, the method may further include: mapping the first M bits of a first bit sequence of length N to a circular buffer of length M.

[0025] In conjunction with the first or second aspect, in one possible implementation, the method may further include: determining E and the redundant version.

[0026] Thirdly, embodiments of this application provide a communication device for executing the method in the first aspect and its possible implementations. The communication device includes a module for executing the method in the first aspect and its possible implementations.

[0027] Fourthly, this application provides a communication apparatus for performing the method in the second aspect and its possible implementations. The communication apparatus includes modules for performing the method in the second aspect and its possible implementations.

[0028] The modules in the third or fourth aspect can also be replaced with units or means, etc. The aforementioned modules can be implemented in software, hardware, or a combination of both.

[0029] Fifthly, this application provides a communication device including a processing circuit for executing the method of the first aspect or any possible implementation thereof. The processing circuit executes a program stored in a memory, and when the program is executed, the method described in the first aspect or any possible implementation thereof is performed.

[0030] In one possible implementation, the memory is located outside the aforementioned communication device.

[0031] In one possible implementation, the memory is located within the aforementioned communication device.

[0032] In this embodiment, the processing circuit and memory can be integrated into a single device; that is, the processing circuit and memory can be integrated together. For example, the communication device can be a chip responsible for the aforementioned transmitting end function, such as a baseband chip, or a SoC chip or SIP chip containing modules implementing the aforementioned transmitting end function.

[0033] In one possible implementation, the communication device further includes a transceiver circuit for receiving information (or inputting information) or sending information (or outputting information). For example, the communication device may be a terminal device or a network device, etc.

[0034] Sixthly, this application provides a communication device including a processing circuit for executing the method of the second aspect or any possible implementation thereof. The processing circuit executes a program stored in a memory, and when the program is executed, the method described in the second aspect or any possible implementation thereof is performed.

[0035] In one possible implementation, the memory is located outside the aforementioned communication device.

[0036] In one possible implementation, the memory is located within the aforementioned communication device.

[0037] In this embodiment, the processing circuit and memory can also be integrated into a single device; that is, the processing circuit and memory can be integrated together. For example, the communication device can be a chip responsible for the aforementioned receiving end functions, such as a baseband chip, or a SoC chip or SIP chip containing modules implementing the aforementioned receiving end functions.

[0038] In one possible implementation, the communication device further includes a transceiver circuit for receiving information (or inputting information) or sending information (or outputting information). For example, the communication device may be a terminal device or a network device, etc.

[0039] In a seventh aspect, embodiments of this application provide a communication device, which includes a processing circuit and a transceiver circuit. The processing circuit can be a logic circuit, and the transceiver circuit can be an interface circuit. The logic circuit and the interface are coupled. The interface circuit is used to input and / or output information, and the logic circuit is used to execute the method in the first aspect or any possible implementation thereof.

[0040] Eighthly, embodiments of this application provide a communication device including a processing circuit and a transceiver circuit. The processing circuit can be a logic circuit, and the transceiver circuit can be an interface circuit. The logic circuit and the interface are coupled. The interface circuit is used to input and / or output information, and the logic circuit is used to execute the method in the second aspect or any possible implementation thereof.

[0041] Ninthly, embodiments of this application provide a computer-readable storage medium for storing a computer program that, when run on a computer, causes the methods shown in any of the first to second aspects or any possible implementation thereof to be executed.

[0042] In a tenth aspect, embodiments of this application provide a computer program product that, when run on a computer, causes the methods shown in any of the first to second aspects or any possible implementations described above to be executed.

[0043] The computer described in the ninth or tenth aspect may include, but is not limited to, terminal equipment or network equipment.

[0044] Eleventhly, embodiments of this application provide a communication system including a transmitting end and a receiving end. The transmitting end may be a communication device as provided in the third, fifth, and seventh aspects, and the receiving end may be a communication device as provided in the fourth, sixth, and eighth aspects. The transmitting end may be used to perform the method shown in the first aspect or any possible implementation thereof, and the receiving end may be used to perform the method shown in the second aspect or any possible implementation thereof. Attached Figure Description

[0045] Figure 1 This is a schematic diagram of a system architecture provided in an embodiment of this application;

[0046] Figure 2 This is a schematic diagram of a polar code encoding provided in an embodiment of this application;

[0047] Figure 3 This is a schematic diagram of an IR-HARQ based on polar codes provided in an embodiment of this application;

[0048] Figure 4 and Figure 5 This is a flowchart illustrating an information transmission method provided in an embodiment of this application;

[0049] Figures 6-8 This is a schematic diagram of the structure of a possible communication device provided in the embodiments of this application. Detailed Implementation

[0050] The technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings.

[0051] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or apparatuses.

[0052] In this document, the term "embodiment" means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of this application. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0053] In this application, "at least one (item)" means one or more, "more than one" means two or more, "at least two (items)" means two or three or more, and "and / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.

[0054] In this application, "send" and "receive" indicate the direction of signal transmission. For example, "send information to XX" can be understood as the destination of the information being XX, which can include direct transmission via the air interface or indirect transmission via the air interface from other units or modules. "Receive information from YY" can be understood as the source of the information being YY, which can include direct reception from YY via the air interface or indirect reception from YY via the air interface from other units or modules. "Send" can also be understood as the "output" of a chip interface, and "receive" can also be understood as the "input" of a chip interface. In other words, sending and receiving can occur between devices, such as between network devices and terminal devices, or within a device, such as between components, modules, chips, software modules, or hardware modules within the device via buses, traces, or interfaces.

[0055] To better understand the embodiments of this application, the system architecture involved in the embodiments of this application will be described first below:

[0056] This application's embodiments can be applied to various communication systems, such as Internet of Things (IoT) systems, narrowband Internet of Things (NB-IoT) systems, long-term evolution (LTE) systems, 5th-generation (5G) communication systems, new radio (NR) systems, and new communication systems emerging in future communication developments. Among these, IoT networks may include, but are not limited to, vehicle-to-everything (V2X) networks. The communication methods in V2X systems can be collectively referred to as vehicle-to-everything (V2X), where X can represent anything. For example, V2X can include: vehicle-to-vehicle (V2V) communication, vehicle-to-infrastructure (V2I) communication, vehicle-to-pedestrian (V2P) communication, or vehicle-to-network (V2N) communication, etc. The following... Figure 1 In this process, terminal devices (such as terminal device 3) can communicate with each other using device-to-device (D2D), machine-to-machine (M2M), or V2X technologies. The method provided in this application embodiment can also be applied to non-terrestrial network (NTN) communication (also known as non-terrestrial network communication).

[0057] The methods provided in this application can be applied to wireless local area network (WLAN) systems, such as Wi-Fi. For example, the methods provided in this application can be applied to the Institute of Electrical and Electronics Engineers (IEEE) 802.11 series protocols, such as the 802.11be protocol, the 802.11bn protocol, or next-generation protocols of the 802.11bn protocol, etc., and will not be listed exhaustively. The technical solutions provided in this application can also be applied to wireless personal area networks (WPANs) based on millimeter wave (MMW) and ultra-wideband (UWB) technologies. For example, the methods provided in this application can be applied to the IEEE 802.15 series protocols, such as the 802.15.4a protocol, the 802.15.4z protocol, or the 802.15.4ab protocol, or a future generation of UWB WPAN protocols, etc., and will not be listed exhaustively.

[0058] The method provided in this application can be applied between two entities in a communication system, such as one entity sending information to or receiving information sent by the other entity. In a wireless communication system, communication devices are included, and these devices can communicate wirelessly using air interface resources. Air interface resources may include at least one of time-domain resources, frequency-domain resources, code resources, and spatial resources; this application does not limit this. For example, the aforementioned two entities may include a network device and a terminal device, or may include a chip that can be placed in a network device and a chip that can be placed in a terminal device, etc. Of course, as standards advance, other types of entities may emerge subsequently; this application does not limit this.

[0059] Please see Figure 1 , Figure 1 This is a schematic diagram of a system architecture provided in an embodiment of this application, such as... Figure 1 As shown, the communication system 1000 includes a radio access network (RAN), a core network (CN) 200, and an Internet 300. RAN 100 includes at least one network device (such as...). Figure 1 110a and 110b (collectively referred to as 110) and at least one terminal device (such as Figure 1 RAN 100, denoted as RAN 120a-120j, is collectively referred to as RAN 120. RAN 100 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment. Figure 1 (Not shown in the image). Terminal 120 is connected to network device 110 wirelessly. Network device 110 is connected to core network 200 wirelessly or via wired connection. The core network device in core network 200 and network device 110 in RAN 100 can be different physical devices, or they can be the same physical device integrating core network logical functions and radio access network logical functions.

[0060] It should be noted that RAN 100 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as 4G, 5G mobile communication systems, or evolution systems beyond 5G. RAN 100 can also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), etc. RAN 100 can also be a communication system integrating two or more of the above systems. It should be stated that... Figure 1 The number of network devices and terminal devices shown is merely illustrative and should not be considered a specific limitation of this application. The terminal devices and network devices involved in the system architecture will be described in detail below.

[0061] Terminal devices can include various handheld devices, in-vehicle devices, wearable devices, computing devices, or other processing devices connected to a wireless modem that have wireless communication capabilities. Terminal devices can also be referred to as terminals. Terminal equipment can also refer to user equipment (UE), access terminal, subscriber unit, user agent, cellular phone, smartphone, wireless data card, personal digital assistant (PDA) computer, tablet computer, wireless modem, handset, laptop computer, point of sale (POS) machine, customer-premises equipment (CPE), machine-type communication (MTC) terminal, communication equipment carried on high-altitude aircraft, wearable device, drone, robot, device-to-device (D2D) terminal, vehicle-to-everything (V2X) terminal, virtual reality (VR) terminal equipment, augmented reality (AR) terminal equipment, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical care, and smart grid. This application does not limit the scope of wireless terminals, such as those in grids, transportation safety, smart cities, smart homes, or future communication networks.

[0062] Network devices, also known as access network devices or RAN nodes (or devices), are used to help terminals achieve 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 devices 110 and terminals 120 are relative, for example... Figure 1Network element 120i can be a helicopter or a drone, and it can be configured as a mobile base station. For terminals 120j that access RAN 100 through network element 120i, network element 120i is a base station; however, for base station 110a, network element 120i is a terminal. Network device 110 and terminal 120 are sometimes referred to as communication devices, for example... Figure 1 Network elements 110a and 110b can be understood as communication devices with base station functions, while network elements 120a-120j can be understood as communication devices with terminal functions.

[0063] In one possible scenario, network equipment can be a base station, an evolved NodeB (eNodeB), a transmitting and receiving point (TRP), a transmitting point (TP), a next-generation base station (gNB) within a next-generation NodeB, a base station in a future mobile communication system, a satellite, an integrated access and backhaul (IAB) node, or network equipment in a mobile switching center non-terrestrial network (NTN) communication system; that is, it can be deployed on high-altitude platforms or satellites. Network equipment can also be a macro base station (such as...). Figure 1 110a), micro base stations or indoor stations (such as Figure 1 In CRAN scenarios, network devices can be 110b), relay nodes or donor nodes, or wireless controllers. Network devices can also function as base stations in device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, drone communication, and machine-to-machine (M2M) communication. Optionally, network devices can also be servers, wearable devices, vehicles, or in-vehicle equipment. For example, in vehicle-to-everything (V2X) technology, the network device can be a roadside unit (RSU).

[0064] All or part of the functions of the network device in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (such as a cloud platform). The network device in this application can also be a logical node, logical module, or software capable of implementing all or part of the functions of a network device.

[0065] In another possible scenario, multiple network devices collaborate to assist terminals 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), etc. CUs and DUs can be set up separately 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.

[0066] 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 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 and hardware modules.

[0067] 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.

[0068] The technical solutions provided in this application can be applied to channel coding / decoding between communication devices. Channel coding / decoding between communication devices can include: channel coding / decoding between network devices and terminal devices, channel coding / decoding between network devices, or channel coding / decoding between terminal devices.

[0069] The following description uses a transmitting end and a receiving end as examples to illustrate the method provided in this application. The transmitting end can also be called an encoding device, which can be a device for transmitting encoded signals. The receiving end can also be called a decoding device, which can be a device for receiving the aforementioned signals. The specific names of the transmitting end and the receiving end are not limited in this application. As an example, the transmitting end can be a terminal device or a chip or functional module of a terminal device, and the receiving end can be a network device or a chip or functional module of a network device. As another example, the transmitting end can be a network device or a chip or functional module of a network device, and the receiving end can be a terminal device or a chip or functional module of a terminal device. As yet another example, the transmitting end and the receiving end can be different terminal devices, etc. Specific forms of the transmitting end and the receiving end will not be listed here.

[0070] It is understood that when the solutions of this application are applied to future communication systems, the names of the corresponding network function entities may change, and this application does not limit this.

[0071] The following describes the terminology used in this application.

[0072] (1) Polar code encoding

[0073] Polar codes are a channel coding scheme that can be proven to achieve Shannon channel capacity. They have the characteristics of good performance and low complexity, and can currently be used as a control channel coding scheme for scenarios such as 5G Embed (uplink / downlink).

[0074] The encoding matrix G of a Polar code can be determined based on the standard polarization kernel. This is obtained by performing n Kronecker products. For example, when n=2, a polar code encoding matrix with a code length of N=4 can be obtained.

[0075] Figure 2 This is a schematic diagram of a polar code encoding provided in an embodiment of this application. For example, when n=3, the polar code encoding matrix G with a code length of N=8 is shown below:

[0076]

[0077] like Figure 2 As shown, the bits to be encoded can be sorted into two categories based on their reliability: frozen bits (also called fixed bits) and data bits. Generally, bits with higher reliability are designated as data bits, and bits with lower reliability are designated as frozen bits. The value of frozen bits is usually set to 0, and is known to both the sending and receiving ends in actual transmission. Figure 2As shown, u7, u6, u5, and u3 are the first four bits of reliability, set as data bits, while u4, u2, u1, and u0 are the last four bits of reliability, set as frozen bits.

[0078] The primary method for polar code decoding is the successive cancellation (SC) decoding algorithm. SC decoding refers to the decoder decoding bit-by-bit based on the inherent timing characteristics of polar codes. Currently, the main SC decoding algorithms include successive cancellation (SC) decoding, successive cancellation list (SCL) decoding, and CRC-aided successive cancellation list (CA-SCL) decoding. SCL decoding offers a significant improvement over SC decoding, and with the addition of CRC checksum, CA-SCL can make polar codes perform better than LDPC and Turbo codes. Therefore, SCL decoding and CA-SCL decoding are commonly used in practical systems.

[0079] from Figure 2 It can be seen that the length of the Pola code mother code is an integer power of 2. When the code length N required for actual communication is not the mother code length, further code length matching is required through methods such as puncturing and retransmission. In other words, puncturing and retransmission refer to removing or retransmitting several positions of the encoded mother code length sequence to make it suitable for the code length requirement.

[0080] (2) Hybrid Automatic Repeat Request (HARQ)

[0081] HARQ is a technique that combines forward error correction coding (FEC) and automatic repeat request (ARQ) to improve spectral efficiency. Traditional ARQ simply discards erroneous data without storing it, thus lacking a merging process and diversity gain, often resulting in excessive retransmissions and long waiting times. HARQ, on the other hand, saves the received data when decoding fails and requests retransmission from the sender. The receiver then merges the retransmitted data with the previously received data before decoding. This provides diversity gain, reduces the number of retransmissions, and consequently reduces latency.

[0082] HARQ can be divided into two types: soft combo repeat (CC) and incremental redundancy (IR). CC retransmits part or all of the codeword from the initial transmission. At the receiving end, the received data from these multiple transmissions, based on their corresponding positions on the codeword, is combined and decoded. Multiple transmissions increase the transmission energy of the codeword bits. IR incrementally transmits the codeword bits that were not transmitted in the initial transmission. Besides increasing the overall transmission energy, it also provides a long code gain.

[0083] For example, the basic principle of IR-HARQ is to increase the codeword length to find more reliable information positions than the initial transmission, and use these newly generated more reliable information positions to place retransmission bits, thereby obtaining a coding gain that approximates the length of the code.

[0084] Figure 3 This is a schematic diagram of an IR-HARQ based on polar codes provided in an embodiment of this application. Figure 3 As shown, exemplarily, firstly, a parity-check polar (PC-polar) code of length equal to the extended code length is constructed; then, new information bit positions are found in the extended portion; simultaneously, the information bits requiring verification from the initial transmitted information bits are copied to the newly generated information positions; finally, the bit sequence to be transmitted is re-encoded. Exemplarily, N1 represents the length of the initial transmitted information bits including the frozen bits, and N2 represents the length of the retransmitted information bits including the frozen bits. Polar encoding is performed on the N1 initial transmitted information bits to obtain C1 initial transmitted codewords. Then, during retransmission, polar encoding can be performed on the N2 retransmitted information bits to obtain C2' intermediate bits. Finally, C2 retransmitted codewords are obtained based on these C2' intermediate bits and the C1 initial transmitted codewords.

[0085] from Figure 3 It can be seen that the IR-HARQ retransmission method can achieve a coding gain close to that of a long code by increasing the code length. However, the extended information bits may come from a previous transmission. At the same time, the reading and copying order of the original information bits and the copied bits is irregular, making the implementation inflexible.

[0086] It should be understood that the definitions of the above technical terms are merely illustrative. For example, as technology continues to develop, the scope of the above definitions may also change, and the embodiments of this application are not intended to limit the scope.

[0087] First, to facilitate understanding of the embodiments of this application, the specific technical problems to be solved by this application are further analyzed and proposed. Currently, for the application of polar code IR HARQ, specifically, the initial transmission uses NR (5G) rate matching. The initial transmission mother code (encoding length) is NRV0, and the transmission length is ERV0. If NRV0 > ERV0, rate matching is required. Based on the code rate, puncturing is performed on the first NRV0-ERV0 length, pre-freezing the corresponding uninterleaved positions, or shortening the last NRV0-ERV0 length. In puncturing mode, based on NRV0 and ERV0, an additional portion of bit positions can be pre-frozen. This ensures that positions with significantly different puncturing capacity are not selected as information bits. For retransmission, there may be different branches of rate matching, as shown in Table 1 below:

[0088] Table 1. Schematic diagram of different branches of rate matching

[0089]

[0090]

[0091] As can be seen from Table 1 above, the rate matching involved in retransmission involves numerous branches, making the description complex and potentially leading to performance defects. Furthermore, the construction and decoding processes are quite complex. Therefore, the proposed solution may suffer from high retransmission complexity.

[0092] This application provides an information transmission method and apparatus. The method can be applied to IR-HARQ, is simple to describe, and can reduce the complexity of information retransmission.

[0093] Optionally, the method provided in this application can be applied to the sending end or receiving end shown above. For example, the sending end is a terminal device, such as determining a circular buffer based on the length and rate matching method of the first bit sequence, determining the transmission start point of the second bit sequence based on the redundancy version, and transmitting the second bit sequence to a network device based on the circular buffer, the transmission length of the second bit sequence, and the transmission start point; the receiving end is a network device, such as receiving a signal, determining a circular buffer based on N and the rate matching method, determining the transmission start point of the second bit sequence based on the redundancy version, and decoding the signal based on the circular buffer, the transmission length of the second bit sequence, and the transmission start point. For another example, the sending end can be a network device, and the receiving end can be a terminal device; this application does not limit this. It is understood that, for the embodiments of this application, the sending end can be a communication device that transmits the second bit sequence, and the receiving end can be a communication device that receives the signal corresponding to the second bit sequence. The terminal device can be... Figure 1The network architecture shown refers to the terminal device, or the encoding module within the terminal device, or the circuitry or chip responsible for encoding functions within the terminal device (such as an encoding / decoding chip, also known as a baseband chip, or a SoC chip or SIP chip containing an encoding / decoding core, etc.). Network devices can be... Figure 1 The network devices in the network architecture shown, or the encoding modules in the network devices, or the circuits or chips in the network devices responsible for encoding functions (such as encoding / decoding chips, also known as baseband chips, or SoC chips or SIP chips containing encoding / decoding cores, etc.) are described in the embodiments of this application and will not be repeated hereafter.

[0094] Optionally, the method provided in this application can also be applied to application-specific integrated circuits (ASICs) (also known as dedicated integrated chips), field-programmable gate arrays (FPGAs), or programmable chips. Optionally, the method provided in this application can also be implemented by software (such as through program code stored in memory). This application does not limit the scope of the application in this regard.

[0095] The information transmission method described in this application will be described in detail below.

[0096] Please see Figure 4 , Figure 4 This is a flowchart illustrating an information transmission method provided in an embodiment of this application. Figure 4 As shown, the method may include S401-S403.

[0097] S401: The transmitting end determines the circular buffer based on the length N of the first bit sequence and the rate matching method. The length of the circular buffer is M, and both N and M are integers greater than or equal to 1.

[0098] The sending end can obtain the initial transmission length E0 and the bit sequence to be encoded. This bit sequence can be understood as containing information or the bit sequence to be transmitted. Optionally, the bit sequence to be encoded can be understood as a bit sequence including K information bits. It should be noted that E0 can also be referred to as the length of the third bit sequence, which is the initial transmission bit sequence.

[0099] In one possible implementation, the K information bits may include cyclic redundancy check (CRC) bits and / or parity check (PC) bits, where K is an integer greater than or equal to 1. For example, for uplink transmission, K may be greater than or equal to 18 bits, and the CRC bits may include 6 bits or 11 bits, etc. Similarly, for downlink transmission, K may be greater than or equal to 36 bits, and the CRC bits may include 16 bits or 24 bits, etc.

[0100] In another possible implementation, the K information bits may not include CRC bits; or, they may not include PC bits, etc. As an example, when the K information bits do not include CRC bits, the sending end can add CRC bits to the obtained K information bits, or the sending end can add CRC bits to the N bits after obtaining the first bit sequence (as shown in step 401). As yet another example, when the K information bits do not include PC bits, the sending end can add PC bits to the obtained K information bits, or the sending end can add PC bits to the N bits after obtaining the first bit sequence. Yet another example, when the K information bits do not include either CRC bits or PC bits, the sending end can add CRC bits and PC bits to the obtained K information bits, or the sending end can add CRC bits and PC bits to the N bits after obtaining the bit sequence to be encoded. This application embodiment does not limit the position where the sending end adds CRC bits or PC bits. It is understood that the CRC bits and PC bits shown above are all verification methods, and this application embodiment does not limit other verification methods.

[0101] The initial transmission length E0 can be understood as a given initial transmission code length. E0 can also be understood as a flexibly expandable code length, a flexibly expandable polarization (EF-polar) code length, etc. This application embodiment does not limit the name of E0. For example, E0 can be determined based on channel transmission resources and modulation order. For example, E0 can be set by network devices; or, E0 can be specified by protocols or standards, etc. This application embodiment does not limit the method of setting E0.

[0102] For example, the sending end obtaining the bit sequence to be encoded may include: the sending end generating the bit sequence to be encoded, or the encoding device in the sending end obtaining the bit sequence to be encoded from other devices in the sending end, etc. The embodiments of this application do not limit how the sending end obtains the bit sequence to be encoded.

[0103] The transmitting end can perform first channel coding on the bit sequence to be encoded to obtain a first bit sequence. The length of the first bit sequence is N, which can also be understood as the first bit sequence consisting of N bits. The number of information bits corresponding to the first bit sequence is K. The first bit sequence can also be understood as the encoded bit sequence.

[0104] The sending end can determine the rate matching method. Specifically, the rate matching method can be determined based on E0 and the number of information bits K corresponding to the first bit sequence. For example:

[0105] If E0 ≥ N, the rate matching method is repetition; or, if K / E0 is less than or equal to (or less than) the threshold and E0 < N, the rate matching method is puncturing; or, if K / E0 is greater than (or greater than or equal to) the threshold and E0 < N, the rate matching method is shortening. The threshold can be 7 / 16. K / E0 can be understood as the code rate. Illustratively, shortening of polar codes typically refers to the case where the polar code rate K / E0 > 7 / 16, and the last N-E0 bits are zero bits that will not be transmitted. Punching of polar codes typically refers to the case where the polar code rate K / E0 ≤ 7 / 16, and due to the deletion of N-E0 codewords, the corresponding N-E0 input bits (or sub-channels) are pre-frozen. In other words, the values ​​of the corresponding pre-coded bits are set to known values ​​(e.g., binary 0).

[0106] Furthermore, after determining the first bit sequence, the sending end can send the second bit sequence. The first bit sequence can be understood as the encoded bit sequence, the second bit sequence as the transmitted bit sequence, and the third bit sequence described below as the initial transmitted second bit sequence. For retransmissions, each retransmitted bit can be obtained from one or more initial transmitted bits, which are contained in the first bit sequence.

[0107] The transmission length E of the second bit sequence can be N, or it can be the code length after rate matching. The transmitting end transmits K information bits, such as u = u0, u1, ..., u... K-1 Polar code encoding is performed to obtain a first bit sequence of length N, such as d = d0, d1, ..., d N-1 For example, if E = N, it can be sent directly; or if E is not equal to N, the sender can obtain bits of length E through rate matching. That is, when E is not equal to N, the sender can adapt to the length of available resources through rate matching to obtain the first bit sequence. Rate matching methods may include repetition, puncture, shortening, etc., which are not limited in this application embodiment.

[0108] The sending end can determine the circular buffer based on N and the rate matching method. This can also be understood as the sending end determining the length of the circular buffer based on N and the rate matching method. Specifically: if the rate matching method is puncturing or repetition, M = N; or if the rate matching method is shortening, M = E0, where E0 is the length of the third bit sequence, which is the initial bit sequence. The third bit sequence can be understood as the second bit sequence of the initial transmission. E0 can also be referred to as the initial transmission length mentioned above.

[0109] After determining the length M of the circular buffer, the sender can map the first bit sequence of length N to the circular buffer of length M to obtain the second bit sequence. Optionally, if M < N, the first M bits of the first bit sequence of length N can be mapped to the circular buffer of length M. That is, the sender can discard or delete the last NM bits of the first bit sequence of length N (e.g., not transmit them), and the last NM bits can be zero bits that will not be transmitted.

[0110] S402: The transmitting end determines the starting point for transmitting the second bit sequence based on the redundant version.

[0111] The sending end determines the transmission start point of the second bit sequence based on the redundant version. Specifically, the sending end obtains the redundant version and selects the transmission start point of the second bit sequence corresponding to that redundant version. The relationship between the redundant version and the transmission start point of the second bit sequence can be implemented using tables, sets, etc. For example, the following description can illustrate the relationship between the redundant version and the transmission start point of the second bit sequence in tabular form. Exemplarily, the selection relationship between the redundant version and the transmission start point of the second bit sequence can be configured by the network device or specified by a protocol or standard. This application embodiment does not limit the method for setting the selection relationship between the redundant version and the transmission start point of the second bit sequence. For example, if the selection relationship between the redundant version and the transmission start point of the second bit sequence is predefined by a protocol or standard in tabular form, then after obtaining the redundant version, the sending end can select the transmission start point of the second bit sequence corresponding to that redundant version by looking up the table.

[0112] For the initial transmission, unlike the case where the starting point of the third bit sequence in the circular buffer is the starting point corresponding to rv0, in this embodiment, the starting point of the third bit sequence in the circular buffer can be the starting point corresponding to one of the multiple redundant versions. Alternatively, it can be understood that the starting point of the third bit sequence in the circular buffer is the starting point corresponding to any one of the redundant versions. That is, for the third bit sequence, its starting point in the circular buffer is not fixed to the starting point corresponding to rv0, but can be the starting point corresponding to any one of the redundant versions described below: rv0~rvx-1 (e.g., rv0~rv3) or rv0~rvx (e.g., rv0~rv4), thereby increasing the flexibility of information transmission.

[0113] The relationship between the sending start point and the redundant version selection can be implemented in any of the following ways:

[0114] In the first to third possible implementations, the starting point for transmitting the second bit sequence can be determined based on the redundancy version and N. In the fourth possible implementation, the starting point for transmitting the second bit sequence can be determined based on the redundancy version and M.

[0115] In the first possible implementation, the starting point K0 of the second bit sequence can satisfy the following relationship, where the number of redundant versions is x:

[0116]

[0117] Where id represents the version number of the redundant version, x≥2, and x is an integer. The following possible implementations are illustrated using 2≤x≤4 as an example.

[0118] For example, if x = 2, then rv id They are rv0 to rv1, K0 and rv respectively. id The selection relationships are shown in Table 2 below:

[0119] Table 2K0 and rv id Choice relationship

[0120]

[0121] For example, if x = 3, then rv id They are rv0 to rv2, K0 and rv respectively. id The selection relationships are shown in Table 3 below:

[0122] Table 3K0 and rv id Choice relationship

[0123]

[0124] For example, if x = 4, then rv idThey are rv0 to rv3, K0 and rv respectively. id The selection relationships are shown in Table 4 below:

[0125] Table 4K0 and rv id Choice relationship

[0126]

[0127] For the first possible implementation, it can be seen that the transmission start points of the second bit sequence can be distributed between 0 and N / 2, with each start point being equally spaced. For retransmissions, each transmission is relatively uniform and will not fall into a position greater than N / 2, i.e., it will not fall into a shortened position. Considering that during shortening, the bits in the transmission length E to N-1 of the second bit sequence are shortened bits and cannot be transmitted as encoded bits, and the length of E to N-1 can be up to N / 2-1, the transmission start points determined in this embodiment only occur in the positions from 0 to N / 2, and there is no possibility of the transmission start point falling into a shortened bit position. Therefore, the complexity of rate matching can be reduced.

[0128] In the second possible implementation, K0 can satisfy the following relationship, where the number of redundant versions is x+1:

[0129]

[0130] For example, if x = 2 and x + 1 = 3, then rv id They are rv0 to rv2, K0 and rv respectively. id The selection relationships are shown in Table 5 below:

[0131] Table 5K0 and rv id Choice relationship

[0132]

[0133] For example, if x = 3 and x + 1 = 4, then rv id They are rv0 to rv3, K0 and rv respectively. id The selection relationships are shown in Table 6 below:

[0134] Table 6 K0 and rv id Choice relationship

[0135]

[0136] For example, if x = 4 and x + 1 = 5, then rv id They are rv0 to rv4, K0 and rv respectively. id The selection relationships are shown in Table 7 below:

[0137] Table 7K0 and rvid Choice relationship

[0138]

[0139] For the second possible implementation, it can be seen that, compared to the first possible implementation, the transmission start point of rv0 to rvx-1 is the same as in the first possible implementation. The difference lies in the addition of a transmission start point for rvx. This start point can be selected at the midpoint between M and N / 2, preventing the transmission start point from falling into the shortened bit position. This results in better retransmission performance and a lower error rate, thus improving the performance after multiple retransmissions. Understandably, in the second possible implementation, the number of redundant versions is x+1. Alternatively, the number of redundant versions can also be y, where y = x+1. Similarly, for the first possible implementation with x redundant versions, the number of redundant versions can also be y-1. Since the transmission start points for rv0 to rvx-1 are the same in both the first and second possible implementations, for ease of description, the first possible implementation uses x redundant versions, and the second possible implementation uses x+1 redundant versions for illustration. In other words, you can replace x with y-1 and the result will be the same.

[0140] In the third possible implementation, K0 can satisfy the following relationship, where the number of redundant versions is x:

[0141]

[0142] For example, if x = 2, then rv id They are rv0 to rv1, K0 and rv respectively. id The selection relationships are shown in Table 8 below:

[0143] Table 8K0 and rv id Choice relationship

[0144]

[0145] For example, if x = 3, then rv id They are rv0 to rv2, K0 and rv respectively. id The selection relationships are shown in Table 9 below:

[0146] Table 9K0 and rv id Choice relationship

[0147]

[0148] For example, if x = 4, then rv id They are rv0 to rv3, K0 and rv respectively. idThe selection relationships are shown in Table 10 below:

[0149] Table 10K0 and rv id Choice relationship

[0150]

[0151] Optionally, for the third possible implementation, K0 ≥ M, the version number of the redundant version is 0. Optionally, The version number of the redundant version is 0.

[0152] For the third possible implementation, it can be seen that dividing the transmission start point into equal intervals by N will prevent it from falling into the shortened position. Optionally, for K0≥M or In such cases, the version number of the redundant version is scheduled to be 0, so that the sending start point will not fall into the shortened bit position, avoiding the misunderstanding of the bit sequence. Therefore, the description complexity and rate matching complexity in the standard can be reduced.

[0153] The fourth possible implementation, K0, can satisfy the following relationship, where the number of redundant versions is x:

[0154]

[0155] For example, if x = 2, then rv id They are rv0 to rv1, K0 and rv respectively. id The selection relationships are shown in Table 11 below:

[0156] Table 11K0 and rv id Choice relationship

[0157]

[0158] For example, if x = 3, then rv id They are rv0 to rv2, K0 and rv respectively. id The selection relationships are shown in Table 12 below:

[0159] Table 12K0 and rv id Choice relationship

[0160]

[0161]

[0162] For example, if x = 4, then rv id They are rv0 to rv3, K0 and rv respectively. id The selection relationships are shown in Table 13 below:

[0163] Table 13K0 and rvid Choice relationship

[0164]

[0165] For the fourth possible implementation, it can be seen that under different M lengths, the bit sequence after x transmissions can uniformly cover the entire codeword, and there is no possibility that the transmission start point falls into the shortened bit position, thus avoiding the misunderstanding of the bit sequence. Therefore, the complexity of retransmission can be reduced, and the performance of multiple retransmissions can be further improved.

[0166] It should be noted that, for the first to fourth possible implementations described above, the selection of the transmission start point of the second proportional sequence is not limited to the form shown in the table in the examples above, and the table can also have other variations. Furthermore, the expressions for each physical meaning are merely examples and are not intended to limit the embodiments of this application. For instance, in the above expressions, K0 represents the transmission start point of the second bit sequence, but the transmission start point of the second bit sequence can also be represented using other parameters.

[0167] For example, regarding K0 and rv id The table illustrating the selection relationship differs from the version numbers being arranged sequentially (e.g., rv0~rvx-1(rv0~rv3) or rv0~rvx(rv0~rv4)). In this embodiment, rv... id It can be a random arrangement of rv0~rvx-1 or rv0~rvx, and the order of rv0~rvx-1 or rv0~rvx is not limited. For example, Table 13 above can be replaced with Table 14 below, which is understandable. Other tables can also be replaced in the same way, and will not be shown one by one:

[0168] Table 14K0 and rv id Choice relationship

[0169]

[0170] It is understandable, as shown in Table 14 above, that although rv id The sorting can be random. For the transmitted bit sequence, K0 can be selected for transmission in sequence (e.g., rv0~rvx-1 or rv0~rvx), or it can be selected based on rv... id The random sorting corresponding to K0 is sent, but this application embodiment does not limit this.

[0171] For example, the above tables can be used individually or in combination. For example, a combination of tables could be shown in Table 15 below:

[0172] Table 15K0 and rv id Choice relationship

[0173]

[0174]

[0175] As shown in Table 15, different redundancy versions can correspond to one or more transmission start points of the second bit sequence. Therefore, the transmitter can determine that the transmission start point of the second bit sequence is any one of the one or more transmission start points corresponding to the redundancy version.

[0176] S403: The sending end sends the second bit sequence according to the circular buffer, the sending length E of the second bit sequence, and the sending start point, where E is an integer greater than or equal to 1.

[0177] After determining the starting point for sending the second bit sequence, the sending end can send the second bit sequence according to the circular buffer, E, and the starting point.

[0178] For example, the pseudocode for sending the second bit sequence can be as follows:

[0179]

[0180] For example, the aforementioned redundancy version and E can be set by the network device. For instance, the network device sends configuration information including the redundancy version and E, and the sending end can determine the redundancy version and E based on the configuration information. For example, if the sending end is a terminal device, the network device can send configuration information to the terminal device, which includes the redundancy version and E, thereby allowing the terminal device to determine the redundancy version and E based on the configuration information. Alternatively, if the sending end is a network device, the network device can determine the redundancy version and E itself based on the scheduling. The redundancy version and E can be configured using the same or different signaling. This application embodiment does not limit the method for determining the redundancy version and E. Furthermore, for the redundancy version used to determine the transmission start point of the second bit sequence for each transmission, the sending end / receiving end can determine the redundancy version required for all transmissions at once, or the redundancy version used to determine the transmission start point of the second bit sequence for each transmission can be determined for the current transmission. This application embodiment does not limit the method for obtaining the redundancy version. In particular, for the initial transmission, the redundancy version can also be configured by the network device for the sending end.

[0181] Similarly, for the E used to send the second bit sequence in each transmission, the sending end / receiving end can determine the E required for all transmissions at once, or the E used to send the second bit sequence in the current transmission can be determined in each transmission. The embodiments of this application do not limit the method for obtaining redundant E.

[0182] It is understandable that if the transmitter has already performed rate matching in S401, then after outputting the second bit sequence, the transmitter does not need to perform rate matching again. Of course, if the transmitter has not performed rate matching in S401, then the transmitter can perform rate matching after step 403.

[0183] Optionally, after S403, the transmitting end may also perform modulation, and send the modulated sequence to the receiving end through the channel, etc. This application embodiment does not limit this.

[0184] based on Figure 4 The illustrated method embodiment determines the circular buffer based on the length of the first bit sequence and the rate matching method, determines the transmission start point of the second bit sequence based on the redundant version, and then transmits the second bit sequence according to the circular buffer, the transmission length of the second bit sequence, and the transmission start point. This implementation is more friendly to polar code information transmission, ensuring that each transmission can be self-decoded. Unlike rate matching with different branches during retransmission, the retransmission scheme for information transmission provided in this application embodiment is simple in description, uses the same rate matching description method for initial transmission and retransmission, has stable performance, and can reduce the complexity of information retransmission.

[0185] In addition, for each transmission of the second bit sequence, the bit sequence to be encoded can be encoded to obtain the first bit sequence before each transmission. Alternatively, the bit sequence to be encoded can be encoded to obtain the first bit sequence only when the second bit sequence (or third bit sequence) is transmitted for the first time. In subsequent retransmissions, no further encoding is required, that is, the bit sequence to be encoded does not need to be encoded to obtain the first bit sequence again, which can reduce the complexity of information retransmission.

[0186] The above are the encoding methods for information transmission provided in the embodiments of this application. The embodiments of this application also provide a decoding method for information transmission.

[0187] Figure 5 This is a schematic diagram of an information transmission process provided in an embodiment of this application, such as... Figure 5 As shown, the method for transmitting this information includes:

[0188] S501: The receiver receives a signal corresponding to the second bit sequence sent. The encoding length of the second bit sequence is N, where N is an integer greater than or equal to 1.

[0189] The receiving end receives a signal corresponding to the transmitted second bit sequence, which has an encoding length of N. The sending end can encode the bit sequence to be encoded to obtain a first bit sequence, which has a length of N, meaning it consists of N bits and corresponds to K information bits. The first bit sequence can also be understood as the encoded bit sequence. After determining the first bit sequence, the sending end can send the second bit sequence to the receiving end. The second bit sequence can be understood as the transmitted bit sequence, therefore its encoding length is N.

[0190] As can be understood, the signal obtained by the receiving end, as shown here, refers to the receiving end's ability to process the received signal and then obtain the corresponding second bit sequence. For example, the receiving end can perform demodulation or other processing on the received signal to obtain the second bit sequence.

[0191] S502: The receiving end determines the circular buffer based on N and the rate matching method. The length of the circular buffer is M, where M is an integer greater than or equal to 1. The specific implementation of S502, where the receiving end determines the circular buffer based on N and the rate matching method, can be referenced from S401 above, and the sending end and receiving end can be replaced with equivalents.

[0192] S503: The receiver determines the starting point for transmitting the second bit sequence based on the redundant version.

[0193] The specific implementation of S503, in which the receiving end determines the transmission start point of the second bit sequence based on the redundant version, can refer to the above-mentioned S402, and the sending end and the receiving end can be replaced by equivalents.

[0194] S504: The receiver decodes the signal based on the circular buffer, the transmission length E of the second bit sequence, and the transmission start point, where E is an integer greater than or equal to 1.

[0195] The receiver can decode the signal based on the determined cyclic buffer, E, and transmission start point to obtain K information bits.

[0196] Understandable, regarding Figure 5 For detailed descriptions of the first bit sequence, second bit sequence, rate matching method, redundancy version, transmission start point, etc., please refer to the above text of this application. Figure 4 The methods shown will not be described in detail here.

[0197] based on Figure 5The illustrated method embodiment determines the circular buffer based on the length of the first bit sequence and the rate matching method, determines the transmission start point of the second bit sequence based on the redundant version, and then decodes the received signal based on the circular buffer, the transmission length of the second bit sequence, and the transmission start point. This implementation is more friendly to polar code information transmission, ensuring that each transmission can be self-decoded. Unlike rate matching with different branches during retransmission, the retransmission scheme for information transmission provided in this application embodiment is simple to describe, has stable performance, and can reduce the complexity of decoding.

[0198] The apparatus provided in the embodiments of this application will be described below.

[0199] This application divides the device into functional modules according to the above method embodiments. For example, each function can be divided into its own functional modules, or two or more functions can be integrated into one processing module. The integrated modules can be implemented in hardware or as software functional modules. It should be noted that the module division in this application is illustrative and only represents one logical functional division; other division methods may be used in actual implementation. The following will combine... Figures 6 to 8 The apparatus of the embodiments of this application is described in detail.

[0200] Figure 6 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application, such as... Figure 6 As shown, the communication device 600 includes a processing module 601 and a transceiver module 602. The transceiver module 602 can implement corresponding communication functions, and the processing module 601 is used to implement corresponding processing functions. The transceiver module 602 can also be referred to as an interface, communication interface, communication module, or input / output interface, etc.

[0201] In some embodiments of this application, the communication device can be used to perform the actions performed by the sending end in the above method embodiments. In this case, the sending end can be the terminal device itself or a chip or functional module configurable in the terminal device, or the sending end can be the network device itself or a chip or functional module configurable in the network device. The transceiver module 602 is used to perform transmission and reception related operations or input / output related operations of the sending end in the above method embodiments, and the processing module 601 is used to perform processing related operations of the sending end in the above method embodiments.

[0202] For example, the processing module 601 is used to determine a circular buffer based on the length N of the first bit sequence and the rate matching method, wherein the length of the circular buffer is M, and both N and M are integers greater than or equal to 1;

[0203] The processing module 601 is also configured to determine the transmission start point of the second bit sequence based on the redundancy version. For example, the processing module 601 may include a determination module, etc. Alternatively, the processing module 601 may also include an encoding module, etc.

[0204] As an example, transceiver module 602 is used to transmit a second bit sequence based on a circular buffer, a transmission length E of the second bit sequence, and a transmission start point, where E is an integer greater than or equal to 1. Transceiver module 602 may include a radio frequency module, an antenna module, etc.

[0205] Reuse Figure 6 In other embodiments of this application, the communication device can be used to perform the actions performed by the receiving end in the above method embodiments. In this case, the communication device can be the network device itself or a chip or functional module configurable in the network device, or the receiving end can be the terminal device itself or a chip or functional module configurable in the terminal device. The transceiver module 602 is used to perform the transceiver-related operations of the receiving end in the above method embodiments, and the processing module 601 is used to perform the processing-related operations of the receiving end in the above method embodiments.

[0206] For example, transceiver module 602 is used to receive a signal corresponding to a transmitted second bit sequence, the second bit sequence corresponding to an encoding length of N, where N is an integer greater than or equal to 1. As an example, transceiver module 602 can receive signals transmitted through a channel. Transceiver module 602 may include a radio frequency module, an antenna module, etc. As another example, transceiver module 602 can receive a sequence to be decoded from other modules, such as inputting the sequence to be decoded, so that a processing module can decode the sequence. Transceiver module 602 may include an input / output module, etc.

[0207] Processing module 601 is used to determine the circular buffer according to N and the rate matching method, wherein the length of the circular buffer is M, and M is an integer greater than or equal to 1;

[0208] Processing module 601 is also used to determine the transmission start point of the second bit sequence based on the redundant version;

[0209] The processing module 601 is further configured to decode the signal based on the circular buffer, the transmission length E of the second bit sequence, and the transmission start point, wherein E is an integer greater than or equal to 1. The processing module 601 may also include a determination module, etc. For example, the processing module 601 may also include a demodulation module, etc.

[0210] One possible implementation is that the processing module 601 determines the circular buffer based on N and the rate matching method, specifically for: the rate matching method is puncturing or repeating, M=N, or the rate matching method is shortening, M=E0, where E0 is the length of the third bit sequence, the third bit sequence is the bit sequence transmitted initially, and E0 is an integer greater than or equal to 1.

[0211] One possible implementation is that the third bit sequence starts at the starting point of one of the multiple redundant versions in the circular buffer.

[0212] One possible implementation is that the rate matching method is determined based on E0 and the number of information bits K corresponding to the first bit sequence, including: E0≥N, the rate matching method is repetition; or, K / E0 is less than or equal to (or less than) a threshold and E0<N, the rate matching method is punching; or, K / E0 is greater than (or greater than or equal to) a threshold and E0<N, the rate matching method is shortening.

[0213] One possible implementation is that the threshold is equal to 7 / 16 or other values ​​agreed upon by standard protocols.

[0214] One possible implementation is that the starting point for sending the second bit sequence is determined based on the number of redundant versions.

[0215] In one possible implementation, the starting point for sending the second bit sequence is also determined based on N.

[0216] One possible implementation is that the starting point for sending the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x≥2, and x is an integer.

[0217] One possible implementation is that the starting point for sending the second bit sequence satisfies the following relationship: K0=[N / 2 / (x-1)]*id, id∈0~x-1; id∈x; where K0 represents the starting point of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x+1, x≥2, and x is an integer.

[0218] One possible implementation is that the starting point for sending the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x≥2, and x is an integer.

[0219] One possible implementation is K0≥M, where the version number of the redundant version is 0.

[0220] In one possible implementation, the starting point for sending the second bit sequence is also determined according to M.

[0221] One possible implementation is that the starting point for sending the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x≥2, and x is an integer.

[0222] In one possible implementation, M < N, the processing module 601 is also used to map the first M bits of the first bit sequence of length N to a circular buffer of length M.

[0223] In one possible implementation, the processing module 601 is also used to determine E and the redundant version.

[0224] For a more detailed description of the aforementioned processing module 601 and transceiver module 602, please refer to [link / reference]. Figures 4-5 The relevant descriptions in the method embodiments shown.

[0225] Optionally, in the above embodiments, the device may further include a storage module, which can be used to store instructions and / or data, and the processing module 601 can read the instructions and / or data in the storage module to enable the device to implement the aforementioned method embodiments.

[0226] For specific explanations of terms or steps in the above embodiments, please refer to the descriptions in the above method embodiments, which will not be detailed here.

[0227] The specific descriptions of the transceiver module and processing module shown in the above embodiments are merely examples. For the specific functions or execution steps of the transceiver module and processing module, please refer to the above method embodiments, which will not be described in detail here.

[0228] It is understandable that the module division in the above-mentioned device is merely a logical functional division. Each function can correspond to a functional module, or two or more functions can be integrated into one functional module. In actual implementation, all or some modules can be integrated into one physical entity, or they can be distributed across different physical entities. Furthermore, the above-mentioned functional modules can be implemented in hardware, software, or a combination of both.

[0229] In one example, the functional unit in any of the above devices may be one or more integrated circuits configured to implement the above methods, such as: one or more application-specific integrated circuits (ASICs), or one or more central processing units (CPUs), one or more microcontroller units (MCUs), one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these integrated circuit forms.

[0230] The apparatus of the embodiments of this application has been described above. The possible product forms of the described apparatus are described below. Any device possessing the above-described features... Figure 6 Any form of product that incorporates the functionality of the described device falls within the protection scope of the embodiments of this application. The following description is merely illustrative and does not limit the product form of the device in the embodiments of this application to this specific example.

[0231] In one possible implementation, Figure 6 In the communication device shown, the processing module 601 can be one or more processing circuits, and the transceiver module 602 can be a transceiver circuit, or the transceiver module 602 can also be a transmitting module and a receiving module. The transmitting module can be a transmitting circuit, and the receiving module can be a receiving circuit, which are integrated into one device, such as a transceiver circuit. In the embodiments of this application, the processing circuit and the transceiver circuit can be coupled, etc., and the connection method of the processing circuit and the transceiver circuit is not limited in the embodiments of this application. In the process of performing the above method, the process of sending information in the above method can be the process of the processing circuit outputting the above information. When outputting the above information, the processing circuit outputs the above information to the transceiver circuit so that the transceiver circuit can transmit (or output). After the above information is output by the processing circuit, it may need to undergo other processing before reaching the transceiver circuit. Similarly, the process of receiving information in the above method can be the process of the processing circuit receiving the input above information. When the processing circuit receives the input information, the transceiver circuit receives the above information and inputs it into the processing circuit. Furthermore, after the transceiver circuit receives the aforementioned information, the information may need to undergo further processing before being input into the processing circuit.

[0232] Figure 7 This is a schematic diagram of the structure of a device provided in an embodiment of this application. For example... Figure 7As shown, the communication device 700 includes one or more processing circuits 720 and transceiver circuits 710.

[0233] In some embodiments of this application, the apparatus can be used to perform the steps, methods, or functions performed by the transmitting end described above, such as the processing circuit 720 being used to perform... Figure 6 The transceiver circuit 710 can be used to perform the functions or steps implemented by the processing module 601 shown. Figure 6 The transceiver module 602 shown illustrates the functions or steps implemented by this module. For detailed descriptions of the processing circuit 720 and the transceiver circuit 710, please refer to [link / reference needed]. Figure 6 Alternatively, the method embodiments shown above will not be described in detail here.

[0234] In other embodiments of this application, the apparatus is used to perform the steps, methods, or functions performed by the receiving end described above, such as the processing circuit 720 being used to perform... Figure 6 The transceiver circuit 710 can be used to perform the functions or steps implemented by the processing module 601 shown. Figure 6 The transceiver module 602 shown illustrates the functions or steps implemented by this module. For detailed descriptions of the processing circuit 720 and the transceiver circuit 710, please refer to [link / reference needed]. Figure 6 Alternatively, the method embodiments shown above will not be described in detail here.

[0235] For example, the processing circuitry can be one or more processors, or all or part of the circuitry within one or more processors. The transceiver circuitry can be a transceiver, an input / output circuit, or an interface circuit, etc.

[0236] For example, in Figure 7 In various implementations of the illustrated apparatus, the transceiver circuitry may include a receiver for performing a receiving function (or operation) and a transmitter for performing a transmitting function (or operation). The transceiver circuitry is also used for communicating with other devices / appliances via a transmission medium.

[0237] Optionally, the communication device 700 may further include one or more memories 730 for storing program instructions and / or data. The memories 730 are coupled to the processing circuitry 720. The coupling in this embodiment is an indirect coupling or communication connection between devices, units, or modules, and can be electrical, mechanical, or other forms, used for information exchange between devices, units, or modules. The processing circuitry 720 may operate in conjunction with the memories 730. The processing circuitry 720 may execute the program instructions stored in the memories 730. Optionally, the one or more memories may be integrated with the processing circuitry, or the one or more memories may be independent of the processing circuitry.

[0238] This application embodiment does not limit the specific connection medium between the transceiver circuit 710, the processing circuit 720, and the memory 730. This application embodiment... Figure 7 The memory 730, processing circuit 720, and transceiver circuit 710 are connected via a bus 740. Figure 7 The connections between other components are shown in bold and are for illustrative purposes only, not as limiting information. The bus can be divided into address bus, data bus, control bus, etc. For ease of illustration, Figure 7 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0239] In the embodiments of this application, the processing circuit may be a general-purpose processing circuit, a digital signal processing circuit, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processing circuit may be a microprocessor circuit or any conventional processing circuit, etc. The steps of the methods disclosed in the embodiments of this application can be directly manifested as being executed by a hardware processing circuit, or being executed by a combination of hardware and software modules in the processing circuit, etc.

[0240] In this application embodiment, the memory may include, but is not limited to, non-volatile memory such as hard disk drive (HDD) or solid-state drive (SSD), random access memory (RAM), erasable programmable read-only memory (EPROM), read-only memory (ROM), or compact disc read-only memory (CD-ROM), etc. Memory is any storage medium capable of carrying or storing program code having instruction or data structure form, and capable of being read and / or written by a computer (such as the device shown in this application), but is not limited to this. The memory in this application embodiment may also be a circuit or any other device capable of implementing storage functions, used to store program instructions and / or data.

[0241] For example, the processing circuit 720 is mainly used to process communication protocols and communication data, control the entire device, execute software programs, and process the data of the software programs. The memory 730 is mainly used to store software programs and data. The transceiver circuit 710 may include a control circuit and an antenna. The control circuit is mainly used for converting baseband signals to radio frequency signals and processing radio frequency signals. The antenna is mainly used for transmitting and receiving radio frequency signals in the form of electromagnetic waves. Input / output devices, such as touch screens, displays, and keyboards, are mainly used to receive user input data and output data to the user.

[0242] When the device is powered on, the processing circuit 720 can read the software program in the memory 730, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processing circuit 720 performs baseband processing on the data to be transmitted and outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit then performs RF processing on the baseband signal and transmits the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processing circuit 720. The processing circuit 720 converts the baseband signal into data and processes the data.

[0243] In another implementation, the radio frequency circuit and antenna can be set up independently of the processing circuit that performs baseband processing. For example, in a distributed scenario, the radio frequency circuit and antenna can be arranged remotely, independent of the device.

[0244] The apparatus shown in the embodiments of this application may also have a higher... Figure 7 This application does not limit the use of other components or other related elements. The methods performed by the processing circuit and transceiver circuit shown above are merely examples; the specific steps performed by the processing circuit and transceiver circuit can be found in the methods described above.

[0245] In another possible implementation Figure 6 In the communication device shown, the processing module 601 can be one or more logic circuits, and the transceiver module 602 can be an input / output interface, or a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiver module 602 can also be a transmitting module and a receiving module. The transmitting module can be an output interface, and the receiving module can be an input interface. The transmitting module and the receiving module are integrated into one unit, such as an input / output interface.

[0246] Figure 8 This is a schematic diagram of the structure of a device provided in an embodiment of this application. For example... Figure 8 As shown, Figure 8The communication device shown includes logic circuit 801 and interface circuit 802. That is, the processing module 601 can be implemented using logic circuit 801, and the transceiver module 602 can be implemented using interface circuit 802. The logic circuit 801 can be a chip, processing circuit, integrated circuit, or system-on-chip (SoC) chip, etc., and the interface 802 can be a communication interface, input / output interface, pins, etc. For example, Figure 8 Taking the aforementioned communication device as an example, the chip includes a logic circuit 801 and an interface circuit 802.

[0247] In this embodiment, the logic circuit and the interface circuit can also be coupled to each other. The specific connection method between the logic circuit and the interface is not limited in this embodiment. For example, the logic circuit 801 can be used to perform... Figure 6 The interface circuit 802 can be used to execute the functions or steps implemented by the processing module 601 shown. Figure 6 The transceiver module 602 shown illustrates the functions or steps implemented by this module. For detailed explanations of the logic circuit 801 and the interface circuit 802, please refer to [link / reference needed]. Figure 6 Alternatively, the method embodiments shown above will not be described in detail here.

[0248] It is understood that the communication device shown in the embodiments of this application can implement the method provided in the embodiments of this application in hardware form or in software form, etc., and the embodiments of this application do not limit it in this way.

[0249] This application also provides a communication system, which includes a transmitter or a receiver. The transmitter and the receiver can be used to perform the methods in any of the foregoing embodiments.

[0250] In addition, this application also provides a computer program for implementing the operations and / or processes performed by the sending end in the method provided in this application.

[0251] This application also provides a computer program for implementing the operations and / or processes performed by the receiving end in the method provided in this application.

[0252] This application also provides a computer-readable storage medium storing computer code that, when executed on a computer, causes the computer to perform the operations and / or processes performed by the various devices in the methods provided in this application.

[0253] This application also provides a computer program product comprising computer code or a computer program that, when run on a computer, causes the operations and / or processes performed by various entities in the method provided in this application to be executed.

[0254] In the embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the couplings or direct couplings or communication connections shown or discussed may be indirect couplings or communication connections through some interfaces, devices, or modules, or they may be electrical, mechanical, or other forms of connection.

[0255] The modules described as separate components may or may not be physically separate. The components shown as modules may or may not be physical modules; that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected according to actual needs to achieve the technical effects of the solutions provided in the embodiments of this application.

[0256] Furthermore, the functional modules in the various embodiments of this application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0257] If the integrated module is implemented as a software functional module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a readable storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned readable storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0258] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. An information transmission method, characterized in that, The method includes: The circular buffer is determined based on the length N of the first bit sequence and the rate matching method. The length of the circular buffer is M, where N and M are both integers greater than or equal to 1. The starting point for transmitting the second bit sequence is determined based on the redundant version; The second bit sequence is transmitted according to the circular buffer, the transmission length E of the second bit sequence, and the transmission start point, wherein E is an integer greater than or equal to 1.

2. An information transmission method, characterized in that, The method includes: A received signal is provided, the signal corresponding to a transmitted second bit sequence, the encoding length of the second bit sequence being N, where N is an integer greater than or equal to 1; The circular buffer is determined based on N and the rate matching method, wherein the length of the circular buffer is M, and M is an integer greater than or equal to 1; The starting point for transmitting the second bit sequence is determined based on the redundant version; The signal is decoded based on the circular buffer, the transmission length E of the second bit sequence, and the transmission start point, where E is an integer greater than or equal to 1.

3. The method according to claim 1 or 2, characterized in that, The circular cache is determined based on N and the rate matching method, including: The rate matching method is either punching or repeating, where M = N; or The rate matching method is shortening, M = E0, E0 is the length of the third bit sequence, the third bit sequence is the initial bit sequence, and E0 is an integer greater than or equal to 1.

4. The method according to claim 3, characterized in that, The third bit sequence is the starting point of one of the multiple redundant versions corresponding to the starting point of the circular buffer.

5. The method according to claim 3 or 4, characterized in that, The rate matching method is determined based on the number of information bits K corresponding to E0 and the first bit sequence, including: If E0 ≥ N, the rate matching method is repetition; or... If K / E0 is less than or equal to the threshold and E0 < N, the rate matching method is punching; or... If K / E0 is greater than the threshold and E0 < N, the rate matching method is shortening.

6. The method according to any one of claims 1-5, characterized in that, The starting point for transmitting the second bit sequence is determined based on the number of redundant versions.

7. The method according to claim 6, characterized in that, The starting point for transmitting the second bit sequence is also determined based on N.

8. The method according to claim 6 or 7, characterized in that, The starting point for transmitting the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the transmission of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, x≥2, where x is an integer.

9. The method according to claim 6 or 7, characterized in that, The starting point for transmitting the second bit sequence satisfies the following relationship: K0=[N / 2 / (x-1)]*id,id∈0~x-1 Where K0 represents the starting point of the transmission of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x+1, x≥2, where x is an integer.

10. The method according to claim 6 or 7, characterized in that, The starting point for transmitting the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the transmission of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, x≥2, where x is an integer.

11. The method according to claim 10, characterized in that, K0≥M, the version number of the redundant version is 0.

12. The method according to claim 6, characterized in that, The starting point for transmitting the second bit sequence is also determined according to M.

13. The method according to claim 6 or 12, characterized in that, The starting point for transmitting the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the transmission of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, x≥2, where x is an integer.

14. The method according to any one of claims 1-13, characterized in that, If M < N, the method further includes: Map the first M bits of the first bit sequence of length N to a circular buffer of length M.

15. The method according to any one of claims 1-14, characterized in that, The method further includes: Determine the E and the redundant version.

16. A communication device, characterized in that, Includes a module for performing the method as described in any one of claims 1-15.

17. A communication device, characterized in that, It includes a processing circuit and a transceiver circuit, the transceiver circuit being used to input and / or output information, and the processing circuit being used to perform the method as described in any one of claims 1-15.

18. The communication device according to claim 17, characterized in that... The communication device further includes a memory for storing a computer program, which, when executed by the processing circuit, performs the method as described in any one of claims 1-15.

19. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a computer program, which, when executed, performs the method as described in any one of claims 1-15.

20. A computer program product, characterized in that, When the computer program product is executed, the method described in any one of claims 1-15 is performed.

21. A communication system, characterized in that, It includes a transmitting end and a receiving end, wherein the transmitting end is used to implement the method as described in any one of claims 1 or 3-15, and the receiving end is used to implement the method as described in any one of claims 2-15.

Images