Information transmission method and apparatus

Abstract

Provided in the embodiments of the present application are an information transmission method and apparatus. The method comprises: on the basis of the length N of a first bit sequence and a rate matching mode, determining a circular buffer, wherein the length of the circular buffer is M, and both N and M are integers greater than or equal to 1; on the basis of a redundancy version, determining a sending starting point of a second bit sequence; and on the basis of the circular buffer, a sending length E of the second bit sequence and the sending starting point, sending the second bit sequence, wherein E is an integer greater than or equal to 1. By means of the embodiments of the present application, the complexity of information re-transmission can be reduced.

Description

Information transmission method and device

[0001] The present application claims priority to the Chinese patent application No. 202411176650.1, filed on August 23, 2024, with the State Intellectual Property Office of China, and entitled "Information transmission method and device", the whole content of which is incorporated herein by reference. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, in particular to an information transmission method and device. BACKGROUND

[0003] In a communication system, channel coding is usually used to improve the reliability of data transmission to ensure the quality of communication. Polar code is a linear block code, and currently polar code is an encoding method that can achieve the Shannon limit and has low encoding and decoding complexity.

[0004] In the encoding process of polar code, the traditional incremental redundancy (IR) hybrid automatic repeat request (HARQ) technology is usually used for encoding. Specifically, the initial transmission can use the rate matching of new radio (NR). For example, the initial mother code (coding length) is NRV0, and the sending length is ERV0. If NRV0>ERV0, rate matching needs to be done. For example, according to the code rate, the first NRV0-ERV0 length is punctured, and the corresponding non-interleaved position is pre-frozen, or the last NRV0-ERV0 length is shortened, or when NRV0<ERV0, the repeated rate matching method needs to be used. However, there are various rate matching of different branches when retransmitting. The more branches corresponding to the rate matching when retransmitting, the higher the complexity of retransmission.

[0005] Therefore, how to reduce the complexity of information retransmission is a technical problem to be solved. SUMMARY

[0006] Embodiments of the present application provide an information transmission method and device, which can reduce the complexity of information retransmission.

[0007] In a first aspect, an embodiment of the present application provides an information transmission method, which can be applied to a sending end. The sending end can be applied to a terminal device side, such as a terminal device or a coding module in the terminal device, or a circuit or chip (such as a coding and decoding chip, also known as a baseband chip, or a system on chip (SoC) chip or a system in package (SIP) chip containing a coding and decoding core, etc.) responsible for coding functions in the terminal device. Alternatively, the sending end can be applied to a network device side, such as a network device or a coding module in the network device, or a circuit or chip (such as a coding and decoding chip, also known as a baseband chip, or a SoC chip or a SIP chip containing a coding and decoding core, etc.) responsible for coding functions in the network device. The method can include: determining a circular buffer according to a length N of a first bit sequence and a rate matching manner, a length of the circular buffer being M, the N and the M being integers greater than or equal to 1; determining a sending starting point of a second bit sequence according to a redundancy version (RV); and sending the second bit sequence according to the circular buffer, a sending length E of the second bit sequence, and the sending starting point, the E being an integer greater than or equal to 1.

[0008] In an embodiment of the present application, the second bit sequence is sent according to the circular buffer, the sending length of the second bit sequence, and the sending starting point. Such an implementation manner can be more friendly to information transmission of a polar code, and can ensure that each transmission can be self-decoded. Unlike rate matching with different branches in retransmission, the information transmission scheme provided in the embodiment of the present application has simple description, and the same set of rate matching description methods is used for initial transmission and retransmission. In addition, the sending starting point of the second bit sequence is determined according to the redundancy version when the second bit sequence is sent, so that the performance is stable and the complexity of retransmission can be reduced.

[0009] In a second aspect, an information transmission method is provided. The method can be applied to a receiving end, which can be applied to a terminal device, such as a terminal device or a decoding module in the terminal device, or a circuit or chip responsible for decoding function in the terminal device (such as a coding and decoding chip, also known as a baseband chip, or a SoC chip or a SIP chip containing a coding and decoding core, etc.), or a network device, such as a network device or a decoding module in the network device, or a circuit or chip responsible for decoding function in the network device (such as a coding and decoding chip, also known as a baseband chip, or a SoC chip or a SIP chip containing a coding and decoding core, etc.). The method can include: receiving a signal, the signal corresponding to a transmitted second bit sequence, the second bit sequence corresponding to an encoding length N, the N being an integer greater than or equal to 1; determining a circular buffer according to the N and a rate matching manner, the circular buffer having a length M, the M being an integer greater than or equal to 1; determining a transmission starting point of the second bit sequence according to a redundancy version; and decoding the signal according to the circular buffer, a transmission length E of the second bit sequence, and the transmission starting point, the E being an integer greater than or equal to 1.

[0010] In the embodiments of the present application, the circular buffer can be determined by the length of the first bit sequence and the rate matching manner, the transmission starting point of the second bit sequence transmission can be determined according to the redundancy version, and the received signal can be decoded according to the circular buffer, the transmission length of the second bit sequence, and the transmission starting point. Such an implementation manner can be more friendly to information transmission of the polar code, can ensure that each transmission can be self-decoded, is different from the rate matching of different branches when retransmission, and the retransmission scheme of the information transmission provided in the embodiments of the present application is simple in description, does not need to be encoded again when retransmission, the transmission starting point of the second bit sequence is determined according to the redundancy version, the performance is stable, and the decoding complexity can be reduced.

[0011] With reference to the first aspect or the second aspect, in a possible implementation manner, determining the circular buffer according to the N and the rate matching manner includes: when the rate matching manner is puncturing or repetition, M=N, or when the rate matching manner is shortening, M=E0, E0 being the length of a third bit sequence, the third bit sequence being a bit sequence of initial transmission, and E0 being an integer greater than or equal to 1.

[0012] With the first aspect or the second aspect, in a possible implementation, the starting point of the third bit sequence in the circular buffer is the starting point corresponding to one of the plurality of redundancy versions. In this embodiment, for initial transmission, the starting point of the third bit sequence in the circular buffer can be the starting point corresponding to one of the plurality of redundancy versions, or the starting point corresponding to any one of the plurality of redundancy versions. That is, the starting point of the third bit sequence in the circular buffer can not be fixed as the starting point corresponding to rv0, but can be the starting point corresponding to any one of the plurality of redundancy versions, thereby increasing the flexibility of information transmission.

[0013] In a possible implementation, the rate matching manner is determined according to E0 and the number K of information bits corresponding to the first bit sequence, and includes: E0≥N, and the rate matching manner is repetition; or K / E0 is less than or equal to (or less than) a threshold value and E0

[0014] With the first aspect or the second aspect, in a possible implementation, the threshold value is equal to 7 / 16.

[0015] With the first aspect or the second aspect, in a possible implementation, the starting point of the sending of the second bit sequence is determined according to the number of redundancy versions.

[0016] With the first aspect or the second aspect, in a possible implementation, the starting point of the sending of the second bit sequence is further determined according to N.

[0017] With the first aspect or the second aspect, in a possible implementation, the starting point of the sending of the second bit sequence satisfies the following relationship: wherein K0 represents the starting point of the sending of the second bit sequence, id represents the version number of the redundancy version, the number of redundancy versions is x, x≥2, and x is an integer.

[0018] By the embodiment, the sending starting points of the second bit sequence can be distributed between 0 and N / 2, each starting point is equidistant, each sending is relatively uniform for retransmission, and will not fall into a position above N / 2, that is, will not fall into a shortened position. Considering the shortening, the position of the second bit sequence in the sending length E-N-1 is a shortened bit, and cannot be sent as an encoded bit itself. The length E-N-1 can be up to N / 2-1. The sending starting points determined in the embodiment only occur at positions of 0-N / 2, and all starting points will not fall into the shortened bit position, so the complexity of information retransmission can be reduced.

[0019] With reference to the first aspect or the second aspect, in a possible implementation, the sending starting point of the second bit sequence satisfies the following relationship: wherein K0 represents the sending starting point of the second bit sequence, and id represents the version number of the redundancy version, the number of the redundancy versions is x+1, x≥2, and x is an integer.

[0020] By the embodiment, compared with the above possible implementation, the sending starting points of rv0-rvx-1 are the same as those of the above possible implementation, and the difference is that the sending starting point of rvx is added, which can be selected at the midpoint of M and N / 2, so that the sending starting point will not fall into the shortened bit position, the retransmission performance is better, and the packet error rate can be reduced, so the performance after multiple retransmissions can be improved.

[0021] With reference to the first aspect or the second aspect, in a possible implementation, the sending starting point of the second bit sequence satisfies the following relationship: wherein K0 represents the sending starting point of the second bit sequence, and id represents the version number of the redundancy version, the number of the redundancy versions is x, x≥2, and x is an integer. By the embodiment, the sending starting points are equidistantly divided by N.

[0022] With reference to the first aspect or the second aspect, in a possible implementation, K0≥M, and the version number of the redundancy version is 0. By the embodiment, for the case of K0≥M, the version number of the redundancy version is scheduled as 0, so that the sending starting point will not fall into the shortened bit position, and the bit sequence is avoided from being misinterpreted, so the complexity of description in the standard and the complexity of rate matching can be reduced.

[0023] With reference to the first aspect or the second aspect, in a possible implementation, the sending starting point of the second bit sequence is further determined according to M.

[0024] With reference to the first aspect or the second aspect, in a possible implementation, the sending starting point of the second bit sequence satisfies the following relationship: Wherein, K0 represents a sending starting point of the second bit sequence, id represents a version number of the redundancy version, the number of the redundancy version is x, x≥2, x is an integer. Through the embodiment, under different M lengths, the x times of sent superimposed bit sequences can uniformly cover the entire code word, the possibility that the sending starting point falls into the shortened bit position does not occur, the misinterpretation of the bit sequence is avoided, the complexity of information retransmission is reduced, and the performance of multiple retransmission is further improved.

[0025] With reference to the first aspect or the second aspect, in a possible implementation, M < N, and the method further includes: mapping the first M bits in the N-bit first bit sequence into the M-bit circular buffer.

[0026] With reference to the first aspect or the second aspect, in a possible implementation, the method further includes: determining E and the redundancy version.

[0027] In a third aspect, an embodiment of the present application provides a communication apparatus for executing the method in the first aspect and possible implementation manners thereof. The communication apparatus includes a module for executing the method in the first aspect and possible implementation manners thereof.

[0028] In a fourth aspect, the present application provides a communication apparatus for executing the method in the second aspect and possible implementation manners thereof. The communication apparatus includes a module for executing the method in the second aspect and possible implementation manners thereof.

[0029] The modules in the third aspect or the fourth aspect can also be replaced with units or means, etc. The foregoing modules can be specifically implemented by software, or by hardware, or by a combination of software and hardware.

[0030] In a fifth aspect, the present application provides a communication apparatus including processing circuitry for executing the method in the first aspect or any possible implementation manner of the first aspect. The processing circuitry is configured to execute a program stored in a memory, and when the program is executed, the method in the first aspect or any possible implementation manner is executed.

[0031] In a possible implementation, the memory is located outside the communication apparatus.

[0032] In a possible implementation, the memory is located inside the communication apparatus.

[0033] In the embodiments of the present application, the processing circuitry and the memory can also be integrated into one device, that is, the processing circuitry and the memory can also be integrated together. For example, the communication apparatus can be a chip responsible for the above-mentioned sending end function, such as a baseband chip or a SoC chip or a SIP chip containing the modules for implementing the above-mentioned sending end function.

[0034] In a possible implementation, the communication apparatus further includes a transceiver circuit, configured to receive information (or input information) or send information (or output information). For example, the communication apparatus can be a terminal device or a network device, etc.

[0035] In a sixth aspect, a communication apparatus is provided, which includes a processing circuit configured to perform the method in the second aspect or any possible implementation of the second aspect. The processing circuit is configured to execute a program stored in a memory, and when the program is executed, the method in the second aspect or any possible implementation is performed.

[0036] In a possible implementation, the memory is located outside the communication apparatus.

[0037] In a possible implementation, the memory is located inside the communication apparatus.

[0038] In the embodiments of the present application, the processing circuit and the memory can also be integrated into one device, i.e., the processing circuit and the memory can also be integrated together. For example, the communication apparatus can be a chip responsible for the above-mentioned receiving end functions, such as a baseband chip or a SoC chip or a SIP chip containing a module for implementing the above-mentioned receiving end functions, etc.

[0039] In a possible implementation, the communication apparatus further includes a transceiver circuit, configured to receive information (or input information) or send information (or output information). For example, the communication apparatus can be a terminal device or a network device, etc.

[0040] In a seventh aspect, a communication apparatus is provided, 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 circuit are coupled. The interface circuit is configured to input and / or output information, and the logic circuit is configured to perform the method in the first aspect or any possible implementation of the first aspect.

[0041] In an eighth aspect, a communication apparatus is provided, 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 circuit are coupled. The interface circuit is configured to input and / or output information, and the logic circuit is configured to perform the method in the second aspect or any possible implementation of the second aspect.

[0042] In a ninth aspect, a computer readable storage medium is provided, which is configured to store a computer program, and when the computer program is executed on a computer, the method in any one of the first aspect to the second aspect or any possible implementation is performed.

[0043] In a tenth aspect, an embodiment of the present application provides a computer program product, which, when running on a computer, causes the method shown in any one of the first aspect to the second aspect or any possible implementation manner to be performed.

[0044] The computer shown in the ninth aspect or the tenth aspect can include, but is not limited to, a terminal device or a network device, etc.

[0045] In an eleventh aspect, an embodiment of the present application provides a communication system, which includes a sending end and a receiving end. The sending end can be the communication apparatus provided in the third aspect, the fifth aspect or the seventh aspect, and the receiving end can be the communication apparatus provided in the fourth aspect, the sixth aspect or the eighth aspect. The sending end can be configured to perform the method shown in the first aspect or any possible implementation manner of the first aspect, and the receiving end can be configured to perform the method shown in the second aspect or any possible implementation manner of the second aspect. BRIEF DESCRIPTION OF DRAWINGS

[0046] FIG. 1 is a schematic diagram of a system architecture provided by an embodiment of the present application;

[0047] FIG. 2 is a schematic diagram of polar code encoding provided by an embodiment of the present application;

[0048] FIG. 3 is a flowchart of an IR-HARQ based on polar code provided by an embodiment of the present application;

[0049] FIG. 4 and FIG. 5 are flowcharts of a method for information transmission provided by an embodiment of the present application;

[0050] FIG. 6-FIG. 8 are schematic diagrams of structures of possible communication apparatuses provided by embodiments of the present application. DETAILED DESCRIPTION

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

[0052] The terms “first” and “second” and the like in the specification, claims and drawings of the present application are used to distinguish different objects, rather than to describe a specific order. In addition, the terms “include” and “have” and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device including a series of steps or units is not limited to the listed steps or units, but can optionally include other steps or units not listed or can optionally include other steps or units inherent to the process, method, product or device.

[0053] Reference to“an embodiment” herein means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase“in an embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are they necessarily all referring to a common set of embodiments, of the application. It will be explicitly understood that the application as described herein can be combined with another embodiment to produce a further embodiment.

[0054] In the present application, “at least one” means one or more, “multiple” means two or more, “at least two” means two or three and three or more, and “and / or” is used to describe the relationship between associated objects, indicating that there can be three relationships, for example, “A and / or B” can represent three cases: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character“ / ” generally represents an“or” relationship between the associated objects before and after it. “At least one of the following” or similar expressions means any combination of these items, including any combination of single or multiple items. For example, at least one of a, b or c can represent a, b, c, “a and b”, “a and c”, “b and c”, or “a and b and c”, where a, b, and c can be single or multiple.

[0055] In the present application, “sending” and “receiving” represent the direction of signal transmission. For example, “sending information to XX” can be understood as the destination of the information being XX, which can include direct transmission through the air interface, or indirect transmission through the air interface by other units or modules. “Receiving information from YY” can be understood as the source of the information being YY, which can include direct reception from YY through the air interface, or indirect reception from YY through the air interface from other units or modules. “Sending” can also be understood as the“output” of the chip interface, and “receiving” can also be understood as the“input” of the chip interface. In other words, sending and receiving can be 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 a device through a bus, wire or interface.

[0056] In order to better understand the embodiments of the present application, first, the system architecture related to the embodiments of the present application will be introduced:

[0057] The embodiments of the present application can be applied to various communication systems, for example, can be an internet of things (IoT) system, a narrow band internet of things (NB-IoT) system, a long term evolution (LTE) system, and can also be a 5th-generation (5G) communication system, a new radio (NR) system, and a new communication system to be generated in future communication development. Among them, the IoT network can include, for example, but not limited to, a vehicle-to-everything (V2X) system. The communication mode in the vehicle-to-everything (V2X) system can be collectively referred to as vehicle-to-everything (V2X, X can represent any thing). For example, the 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. In the following FIG. 1, the terminal device (such as terminal device 3) and the terminal device (such as terminal device 4) can communicate with each other by device-to-device (D2D) technology, machine-to-machine (M2M) technology or V2X technology, etc. The method provided by the embodiments of the present application can also be applied to non-terrestrial network (NTN) communication (also can be referred to as non-terrestrial network communication).

[0058] The method provided in the embodiments of the present application can be applied to a wireless local area network (WLAN) system, such as Wi-Fi and the like. The method provided in the embodiments of the present application can be applicable to the institute of electrical and electronics engineers (IEEE) 802.11 series protocol, for example, the 802.11be protocol, the 802.11bn protocol, or the next generation of the 802.11bn protocol, and the like, which will not be listed one by one. The technical solutions provided in the embodiments of the present application can also be applied to a wireless personal area network (WPAN) based on millimeter wave (MMW) and ultra wideband (UWB) technology. The method provided in the embodiments of the present application can be applicable to the IEEE 802.15 series protocol, for example, the 802.15.4a protocol, the 802.15.4z protocol, or the 802.15.4ab protocol, or a future generation of UWB WPAN protocol, and the like, which will not be listed one by one.

[0059] The method provided in the embodiments of the present application can be applied to two entities in a communication system, for example, one of the two entities can send information to the other entity, or receive information sent by the other entity. In a wireless communication system, communication devices can be included, and the communication devices can use air interface resources for wireless communication. The air interface resource can include at least one of a time domain resource, a frequency domain resource, a code resource, and a space resource, which is not limited in the present application. For example, the two entities mentioned above can include a network device and a terminal device, or a chip that can be placed in a network device, and a chip that can be placed in a terminal device, and the like. Of course, with the development of standards, other types of entities may also appear in the future, which is not limited in the embodiments of the present application.

[0060] Please refer to FIG. 1, which is a schematic diagram of a system architecture provided by an embodiment of the present application. As shown in FIG. 1, a communication system 1000 includes a (radio) access network ((R)AN), a core network (CN) 200 and an Internet 300. The RAN 100 includes at least one network device (such as 110a and 110b in FIG. 1, collectively referred to as 110) and at least one terminal device (such as 120a-120j in FIG. 1, collectively referred to as 120). The RAN 100 can further include other RAN nodes, such as a wireless relay device and / or a wireless backhaul device (not shown in FIG. 1), etc. The terminal 120 is connected to the network device 110 in a wireless manner. The network device 110 is connected to the core network 200 in a wireless or wired manner. The core network device in the core network 200 and the network device 110 in the RAN 100 can be different physical devices respectively, or can be the same physical device integrated with the logical functions of the core network and the logical functions of the wireless access network.

[0061] It should be noted that the RAN 100 can be a 3rd generation partnership project (3GPP) related cellular system, such as a 4G, 5G mobile communication system, or an evolved system after 5G. The RAN 100 can also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), etc. The RAN 100 can also be a communication system in which two or more of the above systems are integrated. It should be noted that the number of network devices and terminal devices in FIG. 1 is only illustrative and should not be considered as a specific limitation of the present application. The terminal device and the network device involved in the system architecture will be described in detail below.

[0062] The terminal device can include various handheld devices, vehicle-mounted devices, wearable devices, computing devices, or other processing devices connected to wireless modems with wireless communication functions. The terminal device can also be referred to as a terminal. The terminal device can also refer to a user equipment (UE), an access terminal, a subscriber unit, a user agent, a cellular phone, a smart phone, a wireless data card, a personal digital assistant (PDA) computer, a tablet computer, a wireless modem, a handset, a laptop computer, a point of sale (POS) machine, a customer-premises equipment (CPE), a machine type communication (MTC) terminal, a communication device on an unmanned aerial vehicle, a wearable device, a drone, a robot, a terminal in device to device (D2D), a terminal in vehicle to everything (V2X), a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, or a terminal device in future communication networks, etc., without limitation.

[0063] The network device can be referred to as an access network device or a RAN node (or device). The network device is used to help the terminal to realize wireless access. The network devices 110 in the communication system 1000 can be nodes of the same type or nodes of different types. In some scenarios, the roles of the network devices 110 and the terminals 120 are relative, for example, the network element 120i in FIG. 1 can be a helicopter or a drone, which can be configured as a mobile base station. For a terminal 120j that accesses the RAN 100 through the network element 120i, the network element 120i is a base station; but for the base station 110a, the network element 120i is a terminal. The network devices 110 and the terminals 120 are sometimes both referred to as communication apparatuses, for example, the network elements 110a and 110b in FIG. 1 can be understood as communication apparatuses with base station functions, and the network elements 120a-120j can be understood as communication apparatuses with terminal functions.

[0064] In a possible scenario, the network device can be a base station, an evolved NodeB (eNodeB), a transmitting and receiving point (TRP), a transmitting point (TP), a next generation NodeB (gNB) in a next generation base station, a base station in a future mobile communication system, a satellite, an integrated access and backhaul (IAB) node, a network device in a non-terrestrial network (NTN) communication system, i.e., can be deployed on a high-altitude platform or a satellite, etc. The network device can be a macro base station (such as 110a in FIG. 1), a micro base station or an indoor station (such as 110b in FIG. 1), a relay node or a donor node, or a wireless controller in a CRAN scenario. The network device can also be a device that plays a base station function in device to device (D2D) communication, vehicle-to-everything (V2X) communication, drone communication, and machine communication. Optionally, the network device can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, the network device in the vehicle-to-everything (V2X) technology can be a road side unit (RSU).

[0065] All or part of the functions of the network device in the present application can also be implemented by software functions running on hardware or by virtualized functions instantiated on a platform (such as a cloud platform). The network device in the present application can also be a logical node, a logical module or software that can realize all or part of the functions of the network device.

[0066] In another possible scenario, a terminal is assisted by multiple network devices to implement wireless access, and different network devices respectively implement part of functions of a base station. For example, a network device can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be separately arranged, or can be included in the same network element, for example, a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, for example, included in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). It can be understood that the network device can be a CU node, or a DU node, or a device including a CU node and a DU node. In addition, the CU can be divided into a network device in an access network RAN, or the CU can be divided into a network device in a core network CN, which is not limited here.

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

[0068] In the embodiments of this application, the form of the network device is not limited, and the device for implementing the function of the network device can be the network device; or can be a device capable of supporting the network device to implement the function, for example, a chip system. The device can be installed in the network device or used in matching with the network device.

[0069] The technical scheme provided by the embodiments of the present application can be applied to channel coding / decoding between communication devices. The channel coding / decoding between communication devices can include channel coding / decoding between a network device and a terminal device, channel coding / decoding between network devices, or channel coding / decoding between terminal devices.

[0070] The method provided by the embodiments of the present application will be described below by taking a sending end and a receiving end as examples. The sending end can also be referred to as a coding apparatus, and the sending end can be an apparatus for sending a coded signal. The receiving end can also be referred to as a decoding apparatus, and the receiving end can be an apparatus for receiving the signal. The specific names of the sending end and the receiving end are not limited in the embodiments of the present application. As an example, the sending end can be a terminal device or a chip or a functional module of the terminal device, and the receiving end can be a network device or a chip or a functional module of the network device. As another example, the sending end can be a network device or a chip or a functional module of the network device, and the receiving end can be a terminal device or a chip or a functional module of the terminal device. As yet another example, the sending end and the receiving end can be different terminal devices. The specific forms of the sending end and the receiving end are not listed here.

[0071] It can be understood that when the scheme of the embodiments of the present application is applied to a future communication system, the corresponding network function entity name can change, and the present application does not limit this.

[0072] The following introduces the terms related to the present application.

[0073] (1) Polar code encoding

[0074] Polar code is a channel coding scheme that can be proved to achieve the Shannon channel capacity, has the characteristics of good performance and low complexity, and can be used for, for example, 5G Embb scenario (uplink / downlink) control channel coding scheme.

[0075] The encoding matrix G of the polar code can be obtained by performing n times Kronecker product according to the standard polarization kernel For example, when n=2, the polar code encoding matrix G with a code length of N=4 can be obtained

[0076] FIG. 2 is a schematic diagram of polar code encoding provided by the embodiments of the present application. For example, when n=3, the polar code encoding matrix G with a code length of N=8 is as follows:

[0077] As shown in FIG. 2, the to-be-encoded bits can be divided into frozen bits (also referred to as fixed bits) and information bits (data) according to respective reliability orders. Generally, bits with higher reliability are set as information bits (data), and bits with lower reliability are set as frozen bits (frozen). The value of the frozen bits (frozen) is usually set as 0, and is known by both the sending end and the receiving end in actual transmission. As shown in FIG. 2, u7, u6, u5, and u3 are four bits with higher reliability, which are set as information bits (data), and u4, u2, u1, and u0 are four bits with lower reliability, which are set as frozen bits (frozen).

[0078] The polar code decoding method is mainly a serial cancellation decoding algorithm. The serial cancellation decoding algorithm refers to that a decoder decodes bit by bit according to the natural timing of polar code design. The main serial cancellation decoding algorithms currently include a polar code serial cancellation (SC) decoding, a serial cancellation list (SCL) decoding, and a CRC-aided serial cancellation list (CA-SCL) decoding. The SCL decoding is greatly improved compared with the SC decoding, and the CA-SCL after CRC check can make the performance of the polar code better than that of the LDPC code and the Turbo code. Therefore, the SCL decoding and the CA-SCL decoding are usually used in actual systems.

[0079] As can be seen from FIG. 2, the mother code length of the polar code is an integer power of 2. When the code length N required in actual communication is not the mother code length, further code length matching processes such as puncturing and retransmission are needed. That is, puncturing and retransmission refer to removing or retransmitting some positions of the mother code length sequence obtained by encoding, so as to meet the code length requirement.

[0080] (2) Hybrid automatic repeat request (HARQ)

[0081] HARQ is a technology combining forward error correction coding (FEC) and automatic repeat request (ARQ) to improve spectrum efficiency. Traditional ARQ technology simply discards erroneous data without storage, so there is no combining process, and naturally no diversity gain, often requiring excessive retransmission and long waiting time. HARQ technology saves the received data at the receiving end in the case of decoding failure, and requires the sending end to retransmit the data, and the receiving end combines the retransmitted data and the previously received data before decoding. In this way, there is a certain diversity gain, reducing the number of retransmissions and thereby reducing the latency.

[0082] HARQ can be divided into two types, namely chase combine (CC) and incremental redundancy (IR). CC repeatedly transmits part or all of the initial transmission code word, and decodes the combined received data at the receiving end according to the consistent position of the data on the code word. Multiple transmissions can improve the transmission energy of the code word bits. IR transmits the code word bits that are not transmitted during the initial transmission. In addition to improving the total transmission energy, it can also obtain long code gain.

[0083] For example, the basic principle of IR-HARQ is to find more reliable information positions by increasing the code length of the code word, and to place the retransmission bits in these newly generated more reliable information positions, thereby obtaining the coding gain of the approximate long code.

[0084] FIG. 3 is a flowchart of an IR-HARQ based on a polar code according to an embodiment of the present application. As shown in FIG. 3, for example, a parity-check polar (PC-polar) code with an extended code length is first constructed; then new information bit positions are found in the extension part; at the same time, the information bits that need to be checked in the initial transmission information bits are copied to the newly generated information positions; finally, the re-encoding is performed to obtain the bit sequence to be transmitted. For example, N1 represents the length of the initial transmission information bits including frozen bits, and N2 represents the length of the retransmission information bits including frozen bits. The N1 initial transmission information bits are polar encoded to obtain C1 initial transmission code words. Then, when retransmitting, the N2 retransmission information bits can be polar encoded to obtain C2' intermediate bits, and then C2 retransmission code words can be obtained according to the C2' intermediate bits and the C1 initial transmission code words.

[0085] As can be seen from FIG. 3, the retransmission method of IR-HARQ can obtain the coding gain of the approximate long code by increasing the code length. However, the extension part information bits can come from the previous transmission, and the reading and copying order of the original information bits and the copied bits is irregular, which is not flexible.

[0086] It should be understood that the definition of each technical term as set forth above is for the purpose of referring to the application as claimed. For example, as technology continues to evolve, the definition, which is set forth above, can change. The embodiments are not limited in this regard.

[0087] First, in order to facilitate the understanding of the embodiments of the present application, the technical problems to be solved by the embodiments of the present application are further analyzed and proposed. At present, for the application of polar code IR HARQ, specifically, first, the initial transmission adopts the rate matching of NR (5G), the initial mother code (coding length) is NRV0, and the sending length is ERV0. If NRV0> ERV0, rate matching is needed. According to the code rate, the first NRV0-ERV0 length is punctured, and the corresponding non-interleaved position is pre-frozen, or the last NRV0-ERV0 length is shortened. In the puncturing mode, according to NRV0 and ERV0, a part of bit positions can be additionally pre-frozen, which can ensure that a part of positions with too large puncturing capacity are not selected as information bits. For retransmission, there can be different branches of rate matching, for example, the following table 1:

[0088] Table 1 shows different branches of rate matching

[0089] As can be seen from the above table 1, the branches corresponding to the rate matching of the retransmission are more, the description is complex, and the performance can have bad points. The complexity of the implementation and decoding is large. Therefore, the above scheme can have the technical problem of high complexity of retransmission.

[0090] The present application provides an information transmission method and device, which can be applied to IR-HARQ, and has simple description and can reduce the complexity of information retransmission.

[0091] Optionally, the method provided by the present application can be applied to the sending end or the receiving end shown above. For example, the sending end is a terminal device, such as determining the circular buffer according to the length and the rate matching manner of the first bit sequence, determining the sending starting point of the second bit sequence according to the redundancy version, and sending the second bit sequence to the network device according to the circular buffer, the sending length and the sending starting point of the second bit sequence. The receiving end is a network device, such as receiving a signal, determining the circular buffer according to N and the rate matching manner, determining the sending starting point of the second bit sequence according to the redundancy version, and decoding the signal according to the circular buffer, the sending length and the sending starting point of the second bit sequence. For another example, the sending end can be a network device, and the receiving end can be a terminal device, which is not limited by the present application. It can be understood that, for the embodiments of the present application, the sending end can be a communication apparatus for sending the second bit sequence, and the receiving end can be a communication apparatus for receiving a signal corresponding to the second bit sequence. The terminal device can be a terminal device in the network architecture shown in FIG. 1, or a coding module in the terminal device, or a circuit or a chip (such as a coding and decoding chip, also known as a baseband chip, or a SoC chip or a SIP chip containing a coding and decoding core) responsible for the coding function in the terminal device. The network device can be a network device in the network architecture shown in FIG. 1, or a coding module in the network device, or a circuit or a chip (such as a coding and decoding chip, also known as a baseband chip, or a SoC chip or a SIP chip containing a coding and decoding core) responsible for the coding function in the network device. The embodiments of the present application are uniformly described here, and will not be described again in the following.

[0092] Optionally, the method provided by the present application can also be applied to an application specific integrated circuit (ASIC) (which can also be referred to as a dedicated integrated chip, etc.), a field programmable gate array (FPGA) or a programmable chip, etc. Optionally, the method provided by the present application can also be implemented by software (such as by program code stored in a memory), etc. The present application is not limited in this regard.

[0093] The information transmission method shown in the present application will be described in detail below.

[0094] Please refer to FIG. 4, which is a flowchart of an information transmission method provided by an embodiment of the present application. As shown in FIG. 4, the method can include S401-S403.

[0095] S401: The sending end determines a circular buffer according to the length N of the first bit sequence and the rate matching manner, and the length of the circular buffer is M, both N and M are integers greater than or equal to 1.

[0096] The sending end can obtain a sending length E0 of the initial transmission and a bit sequence to be encoded, which can be understood as a bit sequence containing information quantity or a 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 a third bit sequence, and the third bit sequence is the bit sequence of the initial transmission.

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

[0098] In another possible implementation, the K information bits can not include CRC bits, or can not include PC bits. As an example, when the K information bits do not include CRC bits, the sending end can add CRC bits according to the obtained K information bits, or the sending end can add CRC bits in the N bits after obtaining the first bit sequence (for example, step 401). As another example, when the K information bits do not include PC bits, the sending end can add PC bits according to the obtained K information bits, or the sending end can add PC bits in the N bits after obtaining the first bit sequence. As another example, when the K information bits do not include CRC bits and PC bits, the sending end can add CRC bits and PC bits according to the obtained K information bits, or the sending end can add CRC bits and PC bits in the N bits after obtaining the bit sequence to be encoded. The embodiments of the present application do not limit the position of the sending end adding CRC bits or PC bits. It can be understood that the CRC bits and PC bits shown above are both a check method, and the embodiments of the present application do not limit other check methods.

[0099] The sending length E0 of the initial transmission can be understood as a given sending code length of the initial transmission, and the E0 can also be understood as an extension flexible-polar (EF-polar) code length, and the embodiments of the present application do not limit the name of E0. For example, E0 can be determined according to the resource and modulation order of channel transmission. For example, E0 can be set by a network device, or E0 can be specified by a protocol or standard, and the embodiments of the present application do not limit the setting method of E0.

[0100] Exemplarily, the sending end obtains the bit sequence to be encoded can include that the sending end generates the bit sequence to be encoded, or a device for encoding in the sending end obtains the bit sequence to be encoded from other devices in the sending end, and the like, and embodiments of the present application do not limit how the sending end obtains the bit sequence to be encoded.

[0101] The sending 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, or it can also be understood that the first bit sequence includes N bits, and the number of information bits corresponding to the first bit sequence is K. The first bit sequence can also be understood as a coded bit sequence.

[0102] The sending end can determine a rate matching manner, and specifically, the rate matching manner can be determined according to E0 and the number K of information bits corresponding to the first bit sequence, exemplarily:

[0103] E0≥N, the rate matching manner is repetition; or K / E0 is less than or equal to (or less than) a threshold value and E0

[0104] Further, the sending end can send a second bit sequence after determining the first bit sequence. The first bit sequence can be understood as a coded bit sequence, the second bit sequence can be understood as a transmitted bit sequence, and the following third bit sequence can be understood as a first transmission second bit sequence. For retransmission, each retransmission bit can be obtained according to one or more first transmission bits, which are contained in the first bit sequence.

[0105] The sending length E of the second bit sequence can be N, or it can also be a code length after rate matching. The sending end polar codes the K information bits such as u=u0, u1, …, u K-1 to obtain a first bit sequence of length N, such as d=d0, d1, …, d N-1For example, E=N, the first bit sequence can be directly transmitted, or E is not equal to N, the transmitter can obtain the bit sequence with length E through rate matching. That is, when E is not equal to N, the transmitter can adapt to the length of available resources through the method of rate matching, so as to obtain the first bit sequence. The method of rate matching can include repetition, puncturing, shortening, etc., and the embodiments of the present application are not limited thereto.

[0106] The transmitter can determine the circular buffer according to N and the rate matching manner. It can also be understood that the transmitter determines the length of the circular buffer according to N and the rate matching manner. Specifically: the rate matching manner is puncturing or repetition, M=N; or the rate matching manner is shortening, M=E0, E0 is the length of the third bit sequence, and the third bit sequence is the initial transmission bit sequence. The third bit sequence can be understood as the initial transmission of the second bit sequence. E0 can also be referred to as the transmission length of the initial transmission described above.

[0107] After determining the length M of the circular buffer, the transmitter can map the first bit sequence with length N into the circular buffer with length M to obtain the second bit sequence. Optionally, if M

[0108] S402: The transmitter determines the transmission starting point of the second bit sequence according to the redundancy version.

[0109] The transmitter determines the transmission starting point of the second bit sequence according to the redundancy version. Specifically, the transmitter obtains the redundancy version, and can select the transmission starting point of the second bit sequence corresponding to the redundancy version according to the redundancy version. The relationship between the redundancy version and the transmission starting point of the second bit sequence can be implemented in the form of a table, a set, etc. For example, the following description can illustrate the relationship between the redundancy version and the transmission starting point of the second bit sequence in the form of a table. For example, the selection relationship between the redundancy version and the transmission starting point of the second bit sequence can be configured by a network device, or can be specified by a protocol or standard, and the embodiments of the present application are not limited to the setting method of the selection relationship between the redundancy version and the transmission starting point of the second bit sequence. For example, if the selection relationship between the redundancy version and the transmission starting point of the second bit sequence is predefined in the form of a table by a protocol or standard, the transmitter can select the transmission starting point of the second bit sequence corresponding to the redundancy version by looking up the table after obtaining the redundancy version.

[0110] For initial transmission, the starting point of the third bit sequence in the circular buffer can be the starting point corresponding to one of the redundancy versions, or can be understood as the starting point corresponding to any one of all redundancy versions. That is, for the third bit sequence, the starting point in the circular buffer can not be fixed as the starting point corresponding to rv0, but can be the starting point corresponding to any one of rv0~rvx-1(such as rv0~rv3) or rv0~rvx(such as rv0~rv4), thereby increasing the flexibility of information transmission.

[0111] The selection relationship between the sending starting point and the redundancy version can be any of the following possible implementations:

[0112] Among the first possible implementation~the third possible implementation, the sending starting point of the second bit sequence can be determined according to the redundancy version and N, and in the fourth possible implementation, the sending starting point of the second bit sequence can be determined according to the redundancy version and M.

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

[0114] Where id represents the version number of the redundancy version, x≥2, and x is an integer. The following possible implementations are exemplarily described taking 2≤x≤4 as an example.

[0115] For example, x=2, then rv id respectively, the selection relationship between K0 and rv id is shown in Table 2 as follows:

[0116] Table 2 Selection relationship between K0 and rv id

[0117] For example, x=3, then rv id respectively, the selection relationship between K0 and rv id is shown in Table 3 as follows:

[0118] Table 3 Selection relationship between K0 and rv id

[0119] For example, x=4, then rv id respectively, the selection relationship between K0 and rv id is shown in Table 4 as follows:

[0120] Table 4 Selection relationship between K0 and rv​​id The selection relationship of K0 and rv

[0121] For the first possible implementation, it can be seen that the starting point of the second bit sequence can be distributed between 0 and N / 2, and each starting point is equidistant. For retransmission, each transmission is relatively uniform, and will not fall into a position above N / 2, i.e., will not fall into a shorten position. Considering that when shortened, the position of the second bit sequence in the transmission length E-N-1 is a shortened bit, and itself cannot be transmitted as an encoded bit, and the length E-N-1 can be up to N / 2-1. The determined transmission starting point in the embodiment only occurs in the position of 0-N / 2, and the possibility of the transmission starting point falling into the shortened bit position does not occur, so the complexity of rate matching can be reduced.

[0122] The second possible implementation can satisfy the following relationship, where the number of redundancy versions is x+1:

[0123] For example, x=2, x+1=3, and rv id is rv0-rv2, respectively. The selection relationship of K0 and rv id is shown in Table 5.

[0124] Table 5: Selection relationship of K0 and rv id

[0125] For another example, x=3, x+1=4, and rv id is rv0-rv3, respectively. The selection relationship of K0 and rv id is shown in Table 6.

[0126] Table 6: Selection relationship of K0 and rv id

[0127] For another example, x=4, x+1=5, and rv id is rv0-rv4, respectively. The selection relationship of K0 and rv id is shown in Table 7.

[0128] Table 7: Selection relationship of K0 and rv id

[0129] ​​​For the second possible implementation, it can be seen that the transmission starting point of rv0~rvx-1 is the same as that of the first possible implementation, and the difference is that the transmission starting point of rvx is added, which can be selected at the midpoint of M and N / 2, so that the possibility of the transmission starting point falling into the shortened bit position does not occur, the retransmission performance is better, and the packet error rate can be reduced, thereby improving the performance after multiple retransmissions. It can be understood that in the second possible implementation, the number of redundancy versions is x+1, which is variable, and the number of redundancy versions can also be y, where y=x+1. Then for the first possible implementation described above, the number of redundancy versions is x, and the number of redundancy versions can also be y-1. Here, since the transmission starting point of rv0~rvx-1 is the same for the first possible implementation and the second possible implementation, for the convenience of description, the number of redundancy versions is x in the first possible implementation, and the number of redundancy versions is x+1 in the second possible implementation. That is, the above x can be replaced by y-1, and the results are consistent.

[0130] For the third possible implementation, K0 can satisfy the following relationship, where the number of redundancy versions is x:

[0131] For example, x=2, then rv id respectively, K0 and rv id The selection relationship is as shown in Table 8:

[0132] Table 8 Selection relationship of K0 and rv id

[0133] For example, x=3, then rv id respectively, K0 and rv id The selection relationship is as shown in Table 9:

[0134] Table 9 Selection relationship of K0 and rv id

[0135] For example, x=4, then rv id respectively, K0 and rv id The selection relationship is as shown in Table 10:

[0136] Table 10 Selection relationship of K0 and rv id

[0137] Optionally, for the third possible implementation, K0≥M, and the version number of the redundancy version is 0. Optionally, ​​​The version number of the redundancy version is 0.

[0138] For the third possible implementation, it can be seen that the transmission starting points are equally spaced by N, i.e. do not fall into the shortened positions. Optionally, for the case of K0≥M or the version number of the redundancy version is scheduled as 0, so that the possibility of the transmission starting point falling into the shortened bit positions is avoided, the bit sequence is avoided from being misinterpreted, and thus the description complexity in the standard and the rate matching complexity can be reduced.

[0139] The fourth possible implementation, K0may satisfy the following relationship, where the number of redundancy versions is x:

[0140] For example, x=2, then rv id are rv0~rv1, the selection relationship between K0and rv id is shown in Table 11:

[0141] Table 11: Selection relationship between K0and rv id

[0142] For example, x=3, then rv id are rv0~rv2, the selection relationship between K0and rv id is shown in Table 12:

[0143] Table 12: Selection relationship between K0and rv id

[0144] For example, x=4, then rv id are rv0~rv3, the selection relationship between K0and rv id is shown in Table 13:

[0145] Table 13: Selection relationship between K0and rv id

[0146] For the fourth possible implementation, it can be seen that under different M lengths, the bit sequence after x times of transmission superposition can uniformly cover the entire code word, the possibility of the transmission starting point falling into the shortened bit positions is avoided, the bit sequence is avoided from being misinterpreted, and thus the complexity of retransmission can be reduced, and the performance of multiple retransmissions can be further improved.

[0147] ​​​It should be noted that for the above first possible implementation to the fourth possible implementation, the selection of the sending starting point of the second bit sequence is not limited to the form shown in the above table, and the above table can also have other variations. In addition, the expressions of the respective physical meanings are only examples and are not intended to limit the embodiments of the present application. For example, in the above expressions, K0 represents the sending starting point of the second bit sequence, and the sending starting point of the second bit sequence can also be represented by using other parameters.

[0148] For example, with respect to the selection relationship of K0 and rv id , unlike the version numbers arranged in order (such as rv0~rvx-1 (rv0~rv3) or rv0~rvx (rv0~rv4)), the rv id in the embodiments of the present application can be randomly arranged in rv0~rvx-1 or rv0~rvx, and the arrangement order of rv0~rvx-1 or rv0~rvx is not limited. For example, the above table 13 can be replaced by the following table 14, and it can be understood that other tables can also be replaced in the same way, which will not be illustrated one by one.

[0149] Table 14 selection relationship of K0 and rv id

[0150] It can be understood that, as shown in the above table 14, although the order of rv id can be random, for the sending bit sequence, K0 can be selected according to the order (such as rv0~rvx-1 or rv0~rvx) for sending, or K0 corresponding to the random order of rv id can be selected for sending, and the embodiments of the present application do not limit this.

[0151] For another example, the above table can be separately illustrated or one or more can be combined. For example, for combined illustration, the following table 15 can be used:

[0152] Table 15 selection relationship of K0 and rv id

[0153] As shown in table 15, different redundancy versions can correspond to one or more sending starting points of the second bit sequence, and then the sending end can determine that the sending starting point of the second bit sequence is any one of the one or more sending starting points corresponding to the redundancy version.

[0154] 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 starting point, E being an integer greater than or equal to 1.

[0155] ​​After the sending end determines the sending starting point of the second bit sequence, the sending end can send the second bit sequence according to the circular buffer, E and the sending starting point.

[0156] For example, the pseudo code for sending the second bit sequence can be as follows:

[0157] for k = 0 to E-1

[0158] endfor

[0159] For example, the redundancy version and E can be set by the network device, for example, the network device sends configuration information including the redundancy version and E, and the sending end can determine the redundancy version and E according to the configuration information. For example, the sending end is a terminal device, and the network device can send the configuration information to the terminal device, and the configuration information includes the redundancy version and E, so that the terminal device can determine the redundancy version and E according to the configuration information. For another example, the sending end is a network device, and the network device can determine the redundancy version and E by itself according to the scheduling. The redundancy version and E can be configured by the same or different signaling, and the determination method of the redundancy version and E is not limited in the embodiments of the present application. In addition, for the redundancy version used to determine the sending starting point of the second bit sequence for each transmission, the sending end / receiving end can determine all the required redundancy versions at one time, or the redundancy version used to determine the sending starting point of the second bit sequence for the current transmission can be determined for each transmission, and the acquisition method of the redundancy version is not limited in the embodiments of the present application. In particular, for the initial transmission, the redundancy version can also be configured by the network device to the sending end.

[0160] Similarly, for the E used to send the second bit sequence for each transmission, the sending end / receiving end can determine all the required E at one time, or the E used to send the second bit sequence for the current transmission can be determined for each transmission, and the acquisition method of the redundancy E is also not limited in the embodiments of the present application.

[0161] It can be understood that if the sending end has performed rate matching at S401, the sending end can no longer perform rate matching after outputting the second bit sequence. Of course, if the sending end does not perform rate matching at S401, the sending end can perform rate matching after step S403.

[0162] Optionally, the sending end can further perform modulation and the like after S403, and send the modulated sequence to the receiving end through a channel, and the like, and the embodiments of the present application are not limited in this regard.

[0163] Based on the method embodiment shown in FIG. 4, the cyclic buffer can be determined by the length of the first bit sequence and the rate matching manner, the sending starting point of the second bit sequence can be determined according to the redundancy version, and the second bit sequence can be sent according to the cyclic buffer, the sending length of the second bit sequence, and the sending starting point. Such an implementation manner can be more friendly to information transmission of the polar code, can ensure that each transmission can be self-decoded, is different from the rate matching with different branches during retransmission, and the retransmission scheme of the information transmission provided in the embodiment of the application has simple description, uses the same set of rate matching description methods for initial transmission and retransmission, stable performance, and can reduce the complexity of information retransmission.

[0164] 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 the third bit sequence) is initially transmitted, and encoding is not required in subsequent retransmission, that is, the bit sequence to be encoded is not required to be encoded to obtain the first bit sequence, so that the complexity of information retransmission can be reduced.

[0165] The above is the encoding method of the information transmission provided in the embodiment of the application, and the embodiment of the application further provides a decoding method of the information transmission. FIG. 5 is a flowchart of the information transmission provided in the embodiment of the application, as shown in FIG. 5, the method of the information transmission comprises the following steps.

[0166] S501: A receiving end receives a signal, and the signal corresponds to a transmitted second bit sequence. The second bit sequence corresponds to an encoding length N, and N is an integer greater than or equal to 1.

[0167] The receiving end receives a signal, and the signal corresponds to a transmitted second bit sequence. The second bit sequence corresponds to an encoding length N. The transmitting end can encode a bit sequence to be encoded to obtain a first bit sequence, the length of the first bit sequence is N, that is, the first bit sequence includes N bits, and the first bit sequence corresponds to an information bit quantity K. The first bit sequence can also be understood as an encoded bit sequence. After the transmitting end determines the first bit sequence, the transmitting end can transmit the second bit sequence to the receiving end. The second bit sequence can be understood as a transmitted bit sequence, and thus the second bit sequence corresponds to the encoding length N.

[0168] It can be understood that the receiving end obtaining the signal shown herein means that the receiving end can process the received signal and then obtain the second bit sequence transmitted by the signal. For example, the receiving end can demodulate the received signal and obtain the second bit sequence.

[0169] S502: The receiving end determines the circular buffer according to N and the rate matching manner, and the length of the circular buffer is M, M is an integer greater than or equal to 1. The specific implementation of S502 by the receiving end to determine the circular buffer according to N and the rate matching manner can refer to the above S401, and the transmitting end and the receiving end can be replaced equally.

[0170] S503: The receiving end determines the transmission starting point of the second bit sequence according to the redundancy version.

[0171] The specific implementation of S503 by the receiving end to determine the transmission starting point of the second bit sequence according to the redundancy version can refer to the above S402, and the transmitting end and the receiving end can be replaced equally.

[0172] S504: The receiving end decodes the signal according to the circular buffer, the transmission length E of the second bit sequence and the transmission starting point, E is an integer greater than or equal to 1.

[0173] The receiving end can decode the signal according to the determined circular buffer, E and the transmission starting point, thereby obtaining K information bits.

[0174] It can be understood that the specific description of the first bit sequence, the second bit sequence, the rate matching manner, the redundancy version, the transmission starting point and the like shown in FIG. 5 can refer to the method shown in FIG. 4 of the above application, which will not be described in detail here.

[0175] Based on the method embodiment shown in FIG. 5, the circular buffer can be determined by the length of the first bit sequence and the rate matching manner, the transmission starting point of the second bit sequence transmission is determined according to the redundancy version, and the received signal is decoded according to the circular buffer, the transmission length of the second bit sequence and the transmission starting point. Such an implementation can be more friendly to the information transmission of the polar code, and can ensure that each transmission can be self-decoded, which is different from the rate matching of different branches during retransmission. The retransmission scheme provided in the embodiment of the application is simple in description, stable in performance and can reduce the complexity of decoding.

[0176] The following will introduce the device provided by the embodiment of the application.

[0177] The application divides the functions of the device according to the above method embodiment, for example, each function module can be divided, or two or more functions can be integrated in one processing module. The above integrated module can be realized in the form of hardware or in the form of software function module. It should be noted that the division of the module in the application is illustrative, and is only a logical function division. In actual implementation, another division mode can be used. The device of the embodiment of the application will be described in detail below with reference to FIGS. 6 to 8.

[0178] FIG. 6 is a structural schematic diagram of a communication apparatus provided in an embodiment of the present application. As shown in FIG. 6, the communication apparatus 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 configured to implement corresponding processing functions. The transceiver module 602 can also be referred to as an interface, a communication interface, a communication module, an input / output interface, etc.

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

[0180] For example, the processing module 601 is configured to determine a circular buffer according to a length N of the first bit sequence and a rate matching manner, where the length of the circular buffer is M, and both the N and the M are integers greater than or equal to 1.

[0181] The processing module 601 is further configured to determine a sending starting point of the second bit sequence according to the redundancy version. For example, the processing module 601 can include a determining module, etc. For example, the processing module 601 can further include an encoding module, etc.

[0182] For example, the transceiver module 602 is configured to send the second bit sequence according to the circular buffer, a sending length E of the second bit sequence and the sending starting point, where the E is an integer greater than or equal to 1. For example, the transceiver module 602 can include a radio frequency module, an antenna module, etc.

[0183] Referring to FIG. 6, in some other embodiments of the present application, the communication apparatus can be configured to perform the actions performed by the receiving end in the above method embodiments. In this case, the communication apparatus can be a network device itself or a chip or functional module configured in the network device, or the receiving end can be a terminal device itself or a chip or functional module configured in the terminal device. The transceiver module 602 is configured to perform the transceiving-related operations of the receiving end in the above method embodiments, and the processing module 601 is configured to perform the processing-related operations of the receiving end in the above method embodiments.

[0184] The transceiver module 602 is configured to receive a signal, and the signal corresponds to a second bit sequence to be transmitted, and the second bit sequence corresponds to an encoding length of N, where N is an integer greater than or equal to 1. For example, the transceiver module 602 can receive a signal transmitted through a channel. The transceiver module 602 can include a radio frequency module, an antenna module, etc. For another example, the transceiver module 602 can receive a to-be-decoded sequence from another module, and input the to-be-decoded sequence to the processing module to decode the to-be-decoded sequence. The transceiver module 602 can include an input / output module, etc.

[0185] The processing module 601 is configured to determine a circular buffer according to N and a rate matching manner, and a length of the circular buffer is M, where M is an integer greater than or equal to 1.

[0186] The processing module 601 is further configured to determine a transmission starting point of the second bit sequence according to a redundancy version.

[0187] The processing module 601 is further configured to decode the signal according to the circular buffer, a transmission length E of the second bit sequence, and the transmission starting point, where E is an integer greater than or equal to 1. The processing module 601 can further include a determination module, etc. For example, the processing module 601 can further include a demodulation module, etc.

[0188] In a possible implementation, the processing module 601 determines the circular buffer according to N and the rate matching manner, and specifically, when the rate matching manner is puncturing or repetition, M=N, or when the rate matching manner is shortening, M=E0, where E0 is a length of a third bit sequence, and the third bit sequence is a first transmission bit sequence, and E0 is an integer greater than or equal to 1.

[0189] In a possible implementation, the third bit sequence starts at a starting point corresponding to one of the redundancy versions in the circular buffer.

[0190] In a possible implementation, the rate matching manner is determined according to E0 and a quantity K of information bits corresponding to the first bit sequence, and includes: E0≥N, and the rate matching manner is repetition; or K / E0 is less than or equal to (or less than) a threshold value and E0

[0191] In a possible implementation, the threshold value is equal to 7 / 16 or another value agreed in a standard protocol.

[0192] In a possible implementation, the transmission starting point of the second bit sequence is determined according to a quantity of the redundancy versions.

[0193] In a possible implementation, the transmission starting point of the second bit sequence is further determined according to N.

[0194] In a possible implementation, the sending starting point of the second bit sequence satisfies the following relationship: wherein K0 represents the sending starting point of the second bit sequence, id represents the version number of the redundancy version, and the number of redundancy versions is x, x≥2, and x is an integer.

[0195] In a possible implementation, the sending starting point of the second bit sequence satisfies the following relationship: K0=[N / 2 / (x-1)]*id, id∈0~x-1. wherein K0 represents the sending starting point of the second bit sequence, id represents the version number of the redundancy version, and the number of redundancy versions is x+1, x≥2, and x is an integer.

[0196] In a possible implementation, the sending starting point of the second bit sequence satisfies the following relationship: wherein K0 represents the sending starting point of the second bit sequence, id represents the version number of the redundancy version, and the number of redundancy versions is x, x≥2, and x is an integer.

[0197] In a possible implementation, K0≥M, and the version number of the redundancy version is 0.

[0198] In a possible implementation, the sending starting point of the second bit sequence is further determined according to M.

[0199] In a possible implementation, the sending starting point of the second bit sequence satisfies the following relationship: wherein K0 represents the sending starting point of the second bit sequence, id represents the version number of the redundancy version, and the number of redundancy versions is x, x≥2, and x is an integer.

[0200] In a possible implementation, M<N, and the processing module 601 is further configured to map the first M bit sequences in the first bit sequence of N bits into the circular buffer of M bits.

[0201] In a possible implementation, the processing module 601 is further configured to determine E and the redundancy version.

[0202] For more detailed description of the processing module 601 and the transceiver module 602, refer to the related description in the method embodiments shown in FIG. 4-5.

[0203] Optionally, in each of the above embodiments, the apparatus can further include a storage module, which can be configured 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 apparatus to implement the foregoing method embodiments.

[0204] In the above embodiments, the specific description of the terms or steps can refer to the description in the method embodiments, and will not be repeated here.

[0205] The specific description of the transceiver module and the processing module in the above embodiments is only an example. For the specific functions or steps of the transceiver module and the processing module, refer to the method embodiments, and will not be repeated here.

[0206] It can be understood that the division of the modules in the above device is only a logical function division. Each function can correspond to a function module, or two or more functions can be integrated into one function module. In actual implementation, all or part of the modules can be integrated into one physical entity, or distributed in different physical entities. In addition, the function modules can be implemented in the form of hardware, software, or a combination of hardware and software.

[0207] In one example, the functional units in any of the above devices can 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.

[0208] The above introduces the device of the embodiment of the present application, and the following introduces the possible product form of the device. Any form of product that has the function of the device described in FIG. 6 falls within the protection scope of the embodiment of the present application. The following introduction is only an example, and does not limit the product form of the device of the embodiment of the present application.

[0209] In a possible implementation, in the communication apparatus shown in FIG. 6, 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 sending module and a receiving module, the sending module can be a sending circuit, and the receiving module can be a receiving circuit, and the sending module and the receiving module are integrated in one device, such as a transceiver circuit. In the embodiments of the present application, the processing circuit and the transceiver circuit can be coupled, and the connection mode of the processing circuit and the transceiver circuit is not limited in the embodiments of the present application. In the process of executing the above method, the process of sending information in the above method can be the process of outputting the above information by the processing circuit. When the above information is output, the processing circuit outputs the above information to the transceiver circuit, so as to be transmitted (or output) by the transceiver circuit. After the above information is output by the processing circuit, it can also need to be processed further, and then reach the transceiver circuit. Similarly, the process of receiving information in the above method can be the process of receiving the input above information by the processing circuit. When the processing circuit receives the input information, the transceiver circuit receives the above information and inputs it to the processing circuit. Further, after the transceiver circuit receives the above information, the above information can need to be processed further, and then input to the processing circuit.

[0210] FIG. 7 is a structural schematic diagram of an apparatus provided in the embodiments of the present application. As shown in FIG. 7, the communication apparatus 700 includes one or more processing circuits 720 and a transceiver circuit 710.

[0211] In some embodiments of the present application, the apparatus can be used to execute the steps or methods or functions executed by the sending end, for example, the processing circuit 720 can be used to execute the functions or steps implemented by the processing module 601 shown in FIG. 6, and the transceiver circuit 710 can be used to execute the functions or steps implemented by the transceiver module 602 shown in FIG. 6. For specific description of the processing circuit 720 and the transceiver circuit 710, reference can be made to the method embodiments shown in FIG. 6 or the above description, which will not be repeated here.

[0212] In some embodiments of the present application, the apparatus can be used to execute the steps or methods or functions executed by the sending end, for example, the processing circuit 720 can be used to execute the functions or steps implemented by the processing module 601 shown in FIG. 6, and the transceiver circuit 710 can be used to execute the functions or steps implemented by the transceiver module 602 shown in FIG. 6. For specific description of the processing circuit 720 and the transceiver circuit 710, reference can be made to the method embodiments shown in FIG. 6 or the above description, which will not be repeated here.

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

[0214] Exemplarily, in each implementation of the apparatus shown in FIG. 7, the transceiver can include a receiver configured to perform the functions (or operations) of receiving and a transmitter configured to perform the functions (or operations) of transmitting. The transceiver is configured to communicate with other devices / apparatuses via a transmission medium.

[0215] Optionally, the communication apparatus 700 can further include one or more memories 730 configured to store program instructions and / or data. The memory 730 is coupled to the processing circuit 720. The coupling between the apparatuses, units or modules in the embodiments of the present application is indirect coupling or communication connection between the apparatuses, units or modules, which can be electrical, mechanical or other forms, for information interaction between the apparatuses, units or modules. The processing circuit 720 can operate in cooperation with the memory 730. The processing circuit 720 can execute the program instructions stored in the memory 730. Optionally, the one or more memories can be integrated with the processing circuit, or the one or more memories are independent of the processing circuit.

[0216] The specific connection medium between the transceiver 710, the processing circuit 720 and the memory 730 in the embodiments of the present application is not limited. In FIG. 7, the memory 730, the processing circuit 720 and the transceiver 710 are connected through the bus 740, which is represented by a thick line in FIG. 7, and the connection mode between other components is only illustrative and is not limited. The bus can be divided into an address bus, a data bus, a control bus, etc. For convenience of representation, only one thick line is used in FIG. 7, but it does not mean that there is only one bus or only one type of bus.

[0217] In the embodiments of the present application, the processing circuit can be a general-purpose processing circuit, a digital signal processing circuit, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., which can implement or execute the disclosed methods, steps and logic block diagrams in the embodiments of the present application. The general-purpose processing circuit can be a micro-processing circuit or any conventional processing circuit, etc. The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as execution completed by a hardware processing circuit, or executed by a combination of hardware and software modules in the processing circuit, etc.

[0218] The memory in the embodiments of the present application can include, but is not limited to, a non-volatile memory such as a hard disk drive (HDD) or a solid-state drive (SSD), a random access memory (RAM), an erasable programmable ROM (EPROM), a read-only memory (ROM) or a compact disc read-only memory (CD-ROM), and the like. The memory is any storage medium that can be used to carry or store program codes in the form of instructions or data structures and can be read and / or written by a computer (such as the device shown in the present application and the like). The memory in the embodiments of the present application can also be a circuit or any other device capable of realizing a storage function, used for storing program instructions and / or data.

[0219] For example, the processing circuit 720 is mainly used for processing communication protocols and communication data, and controlling the whole device, executing software programs, and processing data of the software programs. The memory 730 is mainly used for storing software programs and data. The transceiver circuit 710 can include a control circuit and an antenna, and the control circuit is mainly used for converting baseband signals and radio frequency signals and processing the radio frequency signals. The antenna is mainly used for receiving and transmitting radio frequency signals in the form of electromagnetic waves. The input and output device, such as a touch screen, a display screen, a keyboard and the like, is mainly used for receiving data input by a user and outputting data to the user.

[0220] 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 circuit. The radio frequency circuit converts the baseband signal into a radio frequency signal, and transmits the radio frequency signal through the antenna in the form of electromagnetic waves. When data is transmitted to the device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency 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.

[0221] In another implementation, the radio frequency circuit and the antenna can be arranged independently of the processing circuit for baseband processing, for example, in a distributed scenario, the radio frequency circuit and the antenna can be arranged remotely from the device.

[0222] The apparatus shown in the embodiments of the present application can also have more components than those shown in FIG. 7, and the embodiments of the present application do not limit this. The method performed by the processing circuit and the transceiver circuit shown above is only an example, and the specific steps performed by the processing circuit and the transceiver circuit can refer to the method described above.

[0223] In another possible implementation, in the communication apparatus shown in FIG. 6, the processing module 601 can be one or more logic circuits, and the transceiver module 602 can be an input / output interface, also referred to as a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiver module 602 can also be a sending module and a receiving module, the sending module can be an output interface, and the receiving module can be an input interface, and the sending module and the receiving module are integrated in one unit, for example, an input / output interface.

[0224] FIG. 8 is a structural schematic diagram of an apparatus provided by the embodiments of the present application. As shown in FIG. 8, the communication apparatus shown in FIG. 8 includes a logic circuit 801 and an interface circuit 802. That is, the processing module 601 can be implemented by the logic circuit 801, and the transceiver module 602 can be implemented by the interface circuit 802. The logic circuit 801 can be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC) chip, etc., and the interface circuit 802 can be a communication interface, an input / output interface, a pin, etc. For example, FIG. 8 is shown by taking the communication apparatus as a chip, and the chip includes the logic circuit 801 and the interface circuit 802.

[0225] In the embodiments of the present application, the logic circuit and the interface circuit can also be coupled to each other. The embodiments of the present application do not limit the specific connection mode of the logic circuit and the interface. For example, the logic circuit 801 can be used to perform the functions or steps implemented by the processing module 601 shown in FIG. 6, and the interface circuit 802 can be used to perform the functions or steps implemented by the transceiver module 602 shown in FIG. 6. For specific descriptions of the logic circuit 801 and the interface circuit 802, refer to the method embodiments shown in FIG. 6 or the above description, which will not be described in detail here.

[0226] It can be understood that the communication apparatus shown in the embodiments of the present application can implement the method provided by the embodiments of the present application in the form of hardware, or implement the method provided by the embodiments of the present application in the form of software, etc., and the embodiments of the present application do not limit this.

[0227] The embodiments of the present application also provide a communication system, which includes a sending end or a receiving end. The sending end and the receiving end can be used to perform the method in any of the preceding embodiments.

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

[0229] The embodiments of the present application further provide a computer program for implementing the operations and / or processes performed by the receiving end in the method provided by the present application.

[0230] The embodiments of the present application further provide a computer readable storage medium, which stores computer codes, when the computer codes are run on a computer, the computer codes make the computer perform the operations and / or processes performed by each device in the method provided by the present application.

[0231] The embodiments of the present application further provide a computer program product, which includes computer codes or computer programs, when the computer codes or computer programs are run on a computer, the operations and / or processes performed by each device in the method provided by the present application are performed.

[0232] In several embodiments of the present application, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of the modules is only a logical function division, and actual implementation can have another division manner, for example, a plurality of modules or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed modules can be indirect coupling or communication connection through some interfaces, devices or modules, and can also be electrical, mechanical or other forms of connection.

[0233] The modules described as separate components can or can not be physically separated, and the components displayed as modules can or can not be physical modules, that is, they can be located in one place, or can be distributed on a plurality of network modules. According to actual needs, some or all of the modules can be selected to achieve the technical effects of the scheme provided by the embodiments of the present application.

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

[0235] The integrated module, if implemented in the form of a software function module and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such an understanding, the technical solutions of the present application essentially or say the part that contributes to the prior art, or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a readable storage medium, including a number of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in various embodiments of the present application. The aforementioned readable storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0236] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or replacements within the technical scope disclosed in the present application, which should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A method of information transmission, characterized in that, The method comprises: determining a circular buffer according to a length N of a first bit sequence and a rate matching manner, the circular buffer having a length M, the N and the M being integers greater than or equal to 1; determining a transmission starting point of a second bit sequence according to a redundancy version; transmitting the second bit sequence according to the circular buffer, a transmission length E of the second bit sequence and the transmission starting point, the E being an integer greater than or equal to 1.

2. A method of information transmission, characterized by The method comprises: receiving a signal corresponding to a transmitted second bit sequence, the second bit sequence corresponding to an encoding length N, the N being an integer greater than or equal to 1; determining a circular buffer according to the N and a rate matching manner, the circular buffer having a length M, the M being an integer greater than or equal to 1; determining a transmission starting point of a second bit sequence according to a redundancy version; decoding the signal according to the circular buffer, a transmission length E of the second bit sequence and the transmission starting point, the E being an integer greater than or equal to 1.

3. The method according to claim 1 or 2, characterized in that, Determining a circular buffer according to the N and a rate matching manner comprises: the rate matching manner is puncturing or repetition, and M=N; or the rate matching manner is shortening, and M=E0, E0 being a length of a third bit sequence, the third bit sequence being a first transmission bit sequence, the E0 being an integer greater than or equal to 1.

4. The method of claim 3, wherein, The third bit sequence has a starting point in the circular buffer, the starting point corresponding to a starting point of one of a plurality of redundancy versions.

5. The method according to claim 3 or 4, characterized in that, The rate matching manner is determined according to the E0 and a quantity K of information bits corresponding to the first bit sequence, comprising: E0≥N, and the rate matching manner is repetition; or K / E0 is less than or equal to a threshold value and E0 K / E0 is greater than the threshold value and E0 6. The method according to any one of claims 1 to 5, characterized in that, The transmission starting point of the second bit sequence is determined according to the quantity of the redundancy versions.

7. The method of claim 6, wherein, The transmission starting point of the second bit sequence is further determined according to the N.

8. The method according to claim 6 or 7, characterized in that, The sending starting point of the second bit sequence satisfies the following relationship: wherein K0 represents the transmission starting point of the second bit sequence, id represents a version number of the redundancy version, and the quantity of the redundancy versions is x, x≥2, x being an integer.

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

10. The method of claim 6 or 7, wherein, The sending starting point of the second bit sequence satisfies the following relationship: wherein K0 represents the transmission starting point of the second bit sequence, id represents a version number of the redundancy version, and the quantity of the redundancy versions is x, x≥2, x being an integer.

11. The method of claim 10, wherein, K0≥M, and the version number of the redundancy version is 0.

12. The method of claim 6, wherein, The transmission starting point of the second bit sequence is further determined according to the M.

13. The method of claim 6 or 12, wherein, The sending starting point of the second bit sequence satisfies the following relationship: wherein K0 represents the transmission starting point of the second bit sequence, id represents a version number of the redundancy version, and the quantity of the redundancy versions is x, x≥2, x being an integer.

14. The method according to any one of claims 1 to 13, characterized in that, M The method further comprises:

15. The method according to any one of claims 1 to 14, characterized in that, mapping the first M bits in the N-bit first bit sequence into the M-bit circular buffer. The method further comprises:

16. A communications device, characterized by determining the E and the redundancy version. The processing module is configured to determine a circular buffer according to a length N of the first bit sequence and a rate matching manner, the circular buffer having a length M, the N and the M being integers greater than or equal to 1; The processing module is further configured to determine a transmission starting point of the second bit sequence according to the redundancy version; The transceiving module is configured to transmit the second bit sequence according to the circular buffer, a transmission length E of the second bit sequence, and the transmission starting point, the E being an integer greater than or equal to 1.

17. A communications device, characterized by The transceiving module is configured to receive a signal, the signal corresponding to a transmitted second bit sequence, the second bit sequence corresponding to an encoding length N, the N being an integer greater than or equal to 1; The processing module is configured to determine a circular buffer according to the N and a rate matching manner, the circular buffer having a length M, the M being an integer greater than or equal to 1; The processing module is further configured to determine a transmission starting point of the second bit sequence according to the redundancy version; The processing module is further configured to decode the signal according to the circular buffer, a transmission length E of the second bit sequence, and the transmission starting point, the E being an integer greater than or equal to 1. The processing module determines a circular buffer according to the N and a rate matching manner, and specifically is configured to:

18. The apparatus of claim 16 or 17, wherein, The rate matching manner is puncturing or repetition, and M = N; or The rate matching manner is shortening, and M = E0, E0 being a length of a third bit sequence, the third bit sequence being a first transmission bit sequence, and the E0 being an integer greater than or equal to 1. The third bit sequence has a starting point corresponding to a starting point of one of a plurality of redundancy versions at a starting point of the circular buffer.

19. The apparatus of claim 18, wherein, The rate matching manner is determined according to the E0 and a quantity K of information bits corresponding to the first bit sequence, and includes:

20. The apparatus of claim 18 or 19, wherein, E0 > N, and the rate matching manner is repetition; or K / E0 is less than or equal to a threshold value and E0 < N, and the rate matching manner is puncturing; or K / E0 is greater than the threshold value and E0 < N, and the rate matching manner is shortening. The transmission starting point of the second bit sequence is determined according to a quantity of the redundancy versions.

21. The apparatus of any of claims 16-20, wherein, The transmission starting point of the second bit sequence is further determined according to the N.

22. The apparatus of claim 21, wherein, K0 represents the transmission starting point of the second bit sequence, id represents a version number of the redundancy version, and the quantity of the redundancy versions is x, x ≥ 2, and x is an integer.

23. The apparatus of claim 21 or 22, wherein, The sending starting point of the second bit sequence satisfies the following relationship: K0 represents the transmission starting point of the second bit sequence, id represents a version number of the redundancy version, and the quantity of the redundancy versions is x+1, x ≥ 2, and x is an integer.

24. The apparatus of claim 21 or 22, wherein, The transmission starting point of the second bit sequence satisfies the following relationship: K0=[N / 2 / (x-1)]*id, id∈0~x-1 id∈x K0 represents the transmission starting point of the second bit sequence, id represents a version number of the redundancy version, and the quantity of the redundancy versions is x, x ≥ 2, and x is an integer.

25. The apparatus of claim 21 or 22, wherein, The sending starting point of the second bit sequence satisfies the following relationship: K0 ≥ M, and the version number of the redundancy version is 0.

26. The apparatus of claim 25, wherein, The transmission starting point of the second bit sequence is further determined according to the M.

27. The apparatus of claim 21, wherein, K0 represents the transmission starting point of the second bit sequence, id represents a version number of the redundancy version, and the quantity of the redundancy versions is x, x ≥ 2, and x is an integer.

28. The apparatus of claim 21 or 27, wherein, The sending starting point of the second bit sequence satisfies the following relationship: ​ 29. The device of any of claims 16-28, wherein, M < N, the processing module is further configured to map the first M bits of the first sequence of N bits into a circular buffer of M bits.

30. The device of any one of claims 16-29, wherein, The processing module is further configured to determine the E and the redundancy version.

31. A communications device, characterized by The communication device comprises a processing circuitry and a transceiver circuitry, the transceiver circuitry being configured to input and / or output information, the processing circuitry being configured to perform the method according to any one of claims 1-15.

32. The communication apparatus according to claim 31, wherein The communication device further comprises a memory configured to store a computer program, the computer program being configured to be executed by the processing circuitry to perform the method according to any one of claims 1-15.

33. A computer-readable storage medium, characterized in that, The computer readable storage medium is configured to store a computer program, the computer program being configured to be executed to perform the method according to any one of claims 1-15.

34. A computer program product, characterised in that, The computer program product is configured to be executed to perform the method according to any one of claims 1-15.

35. A communication system, characterized by The communication device comprises a transmitting end configured to perform the method according to any one of claims 1 or 3-15, and a receiving end configured to perform the method according to any one of claims 2-15.

Images