Information transmission method and apparatus

Abstract

Embodiments of the present application provide a kind of information transmission method and device, method includes: the bit sequence of being encoded to the bit sequence of encoding by channel coding obtains, the first bit sequence is obtained by the sub-block interleaving of encoding bit sequence;According to the length N of first bit sequence and rate matching mode, determine cyclic buffer, the length of cyclic buffer is M, N and M are all integers greater than or equal to 1, M is less than or equal to N;According to the transmission reference point of the second bit sequence determined by redundancy version;According to the output length E of second bit sequence and transmission reference point, the second bit sequence is sent, E is an integer greater than or equal to 1.Through the embodiments of the present application, the complexity of information retransmission can be reduced.

Description

Technical Field

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

[0002] In communication systems, channel coding is generally used to improve the reliability of data transmission so as to ensure communication quality. Polar code is a linear block code, and currently the polar code is a coding scheme that can achieve the Shannon limit and has low coding and decoding complexity.

[0003] In the coding process of the polar code, the conventional incremental redundancy (IR) hybrid automatic repeat request (HARQ) technology can be used for coding. Specifically, the rate matching of new radio (NR) can be used for initial transmission, for example, the initial transmission mother code (coding length) is NRV0, and the transmission length is ERV0. If NRV0>ERV0, rate matching is required. For example, puncturing is performed on the foremost NRV0-ERV0 length according to the code rate, the corresponding non-interleaved positions are pre-frozen, or shortening processing is performed on the rearmost NRV0-ERV0 length, or a repeated rate matching manner is adopted when NRV0<ERV0. However, it has multiple branches of rate matching during retransmission. The large number of branches corresponding to rate matching during retransmission will lead to high retransmission complexity.

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

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

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

[0007] In this embodiment, sub-block interleaving of the coded bit sequence can be performed to increase coding gain. Furthermore, the second bit sequence can be output (or transmitted) based on the circular buffer, the output length of the second bit sequence, and the transmission reference point. Unlike rate matching with different branches during retransmission, the information transmission scheme provided in this embodiment is simple to describe, uses the same rate matching description method for initial and retransmission, and determines the transmission reference point of the second bit sequence based on the redundant version when outputting it. This results in stable performance and reduces the complexity of retransmission. Moreover, for example, for Polar codes, this implementation is more friendly to Polar code information transmission, ensuring that each transmission can self-decode. That is, each transmission does not need to rely on the content of the previous transmission, but only needs to decode based on the content of the current transmission. In this scheme, determining the transmission reference point of the second bit sequence based on the redundant version allows for more flexible configuration of the redundant version, further making the output of the second bit sequence more flexible.

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

[0009] In this embodiment, the circular buffer can be determined by the length of the first bit sequence and the rate matching method. The transmission reference point for the output of the second bit sequence is determined based on the redundancy version. Then, the signal is de-rate matched based on the circular buffer, the output length of the second bit sequence, and the transmission reference point. The de-rate matched sequence (such as the first sequence) is then de-interleaved, and the de-interleaved sequence (such as the second sequence) is decoded. De-interleaving the sequence increases decoding gain. Furthermore, the de-rate matching based on the circular buffer, the output length of the second bit sequence, and the transmission reference point differs from rate matching with different branches during retransmission. The retransmission scheme provided in this embodiment is simple to describe, does not require re-encoding during retransmission, determines the transmission reference point of the second bit sequence based on the redundancy version, has stable performance, and reduces decoding complexity. Moreover, for polar codes, this implementation is more friendly to information transmission, ensuring that each transmission can be self-decoded. That is, each transmission does not need to rely on the content of the previous transmission, but only needs to be decoded based on the content of the current transmission. In this scheme, the transmission reference point of the second bit sequence is determined according to the redundant version, which allows for more flexible configuration of the redundant version and further makes the output of the second bit sequence more flexible.

[0010] In conjunction with the first or second aspect, the information transmission method of this application also includes the following possible implementations:

[0011] In one possible implementation, the transmission reference point of the second bit sequence includes either the transmission start point or the transmission end point of the second bit sequence.

[0012] In one possible implementation, the rate matching method is puncturing. The method may further include determining the transmission start point of the second bit sequence based on the transmission end point of the second bit sequence. The rate matching method corresponding to this possible implementation can be puncturing. This is because if N is greater than M, puncturing can be used to delete certain bits (e.g., delete the first NM bits) to make the length of the first bit sequence compatible with M. Therefore, the transmission start point of the second bit sequence can be further determined by determining the transmission end point of the second bit sequence.

[0013] In one possible implementation, the transmission start point of the second bit sequence satisfies the following relationship: K0 = mod(G0 - E + 1, N), where K0 represents the transmission start point of the second bit sequence and G0 represents the transmission end point of the second bit sequence. For example, in NR, for rate matching of shortened or repeated, the transmitter determines the transmission reference point of the second bit sequence as the transmission start point; for rate matching of punctured, the transmitter determines the transmission reference point of the second bit sequence as the transmission end point. In this embodiment, for the case of punctured rate matching, the transmitter can determine the transmission end point of the second bit sequence and also determine the transmission start point based on the transmission end point. This makes the transmitter's determination of the transmission reference point of the second bit sequence the same as in the case of shortened or repeated rate matching. In other words, regardless of the rate matching method, determining the transmission reference point of the second bit sequence can always determine the transmission start point, thus allowing for a unified description and simplifying the description.

[0014] In one possible implementation, the end point of transmission of the second bit sequence is determined based on the number of redundant versions and N.

[0015] In one possible implementation, the end point of transmission of the second bit sequence satisfies the following relationship: Where G0 represents the transmission end point of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x is greater than or equal to 2, x is an integer, and i is a positive integer. Through this implementation, the transmission end points of the second bit sequence can be distributed in... Between each bit sequence, the endpoints are equally spaced, ensuring relatively uniform transmission for retransmissions. Furthermore, based on the relationship between the start and end points of the second bit sequence, the start point will not fall within the specified range. The above positions. For cases where the rate matching method is puncturing, the transmission start point determined in this embodiment may only occur in the following locations. In its position.

[0016] In one possible implementation, i = 2. Through this implementation, the transmission endpoints of the second bit sequence can be distributed in... Between each bit sequence, the endpoints are equally spaced, ensuring relatively uniform transmission for retransmissions. Furthermore, based on the relationship between the start and end points of the second bit sequence, the start point will not fall within the specified range. The above positions. For the case where the rate matching method is puncturing, the transmission start point determined in this embodiment can only occur at positions 0 to N / 2.

[0017] In one possible implementation, the end point of transmission of the second bit sequence satisfies the following relationship: Where G0 represents the transmission end point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, where x is greater than or equal to 2 and x is an integer. In this implementation, the transmission end points are divided into equally spaced segments with N. Furthermore, based on the relationship between the transmission start point and the transmission end point of the second bit sequence, a uniform distribution of transmission end points leads to a uniform distribution of transmission start points, thus resulting in more uniform HARQ performance across multiple transmissions.

[0018] In one possible implementation, determining the circular buffer based on N and the rate matching method includes: the rate matching method being either puncturing or repetition, where M = N; or the rate matching method being shortened, where M = E0, where E0 is the length of the third bit sequence, the third bit sequence being the initially transmitted bit sequence, and E0 being an integer greater than or equal to 1. Where the rate matching method is shortened, the length of the circular buffer can be the length of the initially transmitted bit sequence, i.e., some bits are removed from the encoded bit sequence and not transmitted.

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

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

[0021] In one possible implementation, the threshold is equal to 7 / 16 or a value agreed upon by other standard protocols.

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

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

[0024] In one possible implementation, the transmission start point of the second bit sequence satisfies the following relationship: Where K0 represents the transmission start point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, where x is greater than or equal to 2 and x is an integer. Through this implementation, the transmission start points of the second bit sequence can be distributed between 0 and N / 2, with each start point being equally spaced. For retransmissions, each output is relatively uniform and will not fall into positions above N / 2, i.e., it will not fall into shortened positions. Considering that when the rate matching method is shortened, the output length of the second bit sequence from E to N-1 is a shortened bit, which cannot be output as an encoded bit. Since the length of E to N-1 can be up to N / 2-1, the transmission start points determined in this embodiment can only occur at positions from 0 to N / 2, and none of the start points will fall into shortened bit positions.

[0025] In one possible implementation, the transmission start point of the second bit sequence satisfies the following relationship: Where K0 represents the transmission start point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x+1, where x is greater than or equal to 2 and x is an integer. In this implementation, compared to the possible implementations described above, the transmission start points of rv0 to rvx-1 are the same, the difference being the addition of a transmission start point for rvx. This start point can be selected at the midpoint between M and N / 2, ensuring that the transmission start point does not fall into the shortened bit position, resulting in better retransmission performance and a lower error rate, thus improving performance after multiple retransmissions.

[0026] In one possible implementation, the transmission start point of the second bit sequence satisfies the following relationship: Where K0 represents the transmission start point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, where x is greater than or equal to 2 and x is an integer. This implementation method allows for equally spaced transmission start points with N intervals, meaning the transmission start point will not fall into the shortened bit position, resulting in better retransmission performance and a lower packet error rate.

[0027] In one possible implementation, the rate matching method is puncturing, K0 is greater than or equal to M, and the version number of the redundant version is 0. Through this implementation, for the case where the rate matching method is puncturing and K0 is greater than or equal to M, scheduling the version number of the redundant version to 0 ensures that the transmission start point will not fall into the shortened bit position, avoiding misunderstandings of the bit sequence. Therefore, it can reduce the description complexity in the standard and the complexity of rate matching.

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

[0029] In one possible implementation, the transmission start point of the second bit sequence satisfies the following relationship: Where K0 represents the transmission start point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, where x is greater than or equal to 2 and x is an integer. Through this implementation, under different M lengths, the bit sequence after x superimposed outputs can uniformly cover the entire codeword, and the transmission start point will not fall into the possibility of shortened bit positions, avoiding bit sequence misunderstandings, reducing the complexity of information retransmission, and further improving the performance of multiple retransmissions.

[0030] In one possible implementation, outputting the second bit sequence based on the circular buffer, the output length E of the second bit sequence, and the transmission reference point includes: aligning the transmission start point of the second bit sequence to the position in the circular buffer corresponding to an index that is a multiple of 2^a, where a is a positive integer; and outputting the second bit sequence based on the circular buffer, the output length E of the second bit sequence, and the position. This implementation, by aligning the output position of the second bit sequence, facilitates parallel operations. For example, when performing rate matching on the coded bit sequence at the transmitting end or de-rate matching on the signal at the receiving end, aligning the output start position of the second bit sequence ensures parallelism.

[0031] In one possible implementation, where M is less than N, the method may further include mapping the first M bits of a first bit sequence of length N to a circular buffer of length M.

[0032] In one possible implementation, the method may further include: determining E and the redundant version.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0079] (1) Polar code encoding

[0080] Polar codes are a channel coding scheme that can be proven to achieve Shannon channel capacity. They are characterized by good performance and low complexity, and can currently be used as a control channel coding scheme for scenarios such as 5G enhanced mobile broadband (EMBB) (uplink / downlink).

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

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

[0083]

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

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

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

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

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

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

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

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

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

[0093] (3) Sub-block interweaving

[0094] After encoding, the encoded bit sequence can be interleaved into sub-blocks. For example, the length of the encoded bit sequence (e.g., N, where N in NR is a power of 2 and has a minimum length of 32 and a maximum length of 1024) can be divided into 32 sub-blocks for interleaving, with each sub-block being N / 32 in size. For example, the pseudocode for interleaving the encoded bit sequence into sub-blocks can be as follows:

[0095]

[0096]

[0097] Where a represents the coded bit sequence, b represents the sequence after sub-block interleaving (such as the first bit sequence described later), and P represents the sub-block interleaving pattern, which can be specifically described by Table 1:

[0098] Table 1

[0099] i P[i] i P[i] i P[i] i P[i] i P[i] i P[i] i P[i] i P[i] 0 0 4 3 8 8 12 10 16 12 20 14 24 24 28 27 1 1 5 5 9 16 13 18 17 20 21 22 25 25 29 29 2 2 6 6 10 9 14 11 18 13 22 15 26 26 30 30 3 4 7 7 11 17 15 19 19 21 23 23 27 28 31 31

[0100] Sub-block interleaving of the coded bit sequence can match the construction method of polar codes. By interleaving, the positions of puncturing or shortening in the case of rate matching can be determined, thus determining the position of information bits. In other words, without sub-block interleaving, the performance may be poor under the current bit sequence construction method with rate matching of puncturing or shortening. Therefore, sub-block interleaving of the coded bit sequence can improve transmission performance.

[0101] (4) Circular buffer

[0102] A circular buffer, also known as a circular cache, ring buffer, or circular queue, allows for circular access to data by connecting the end of the buffer to the beginning to form a closed loop.

[0103] For example, the pseudocode for a circular cache can be as follows:

[0104] for k=0 to E-1

[0105]

[0106] endfor

[0107] Among them, e k d represents the output bit sequence, k represents the encoded bit sequence, M represents the length of the circular buffer, and E represents the length of the output bit sequence (such as the second bit sequence in the text).

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

[0109] (5) Rate matching

[0110] Rate matching refers to removing some bits from the encoded bit sequence without transmitting them, or repeating some bits.

[0111] The rate matching method will be further explained in three categories below.

[0112] Punching: Punching refers to directly creating holes in certain bit positions within the encoded bit sequence without transmitting them, thus generating bit sequences of arbitrary length. On the decoding side, since there is no information at the corresponding punctured positions, the log-likelihood ratio (LLR) of the corresponding bit is set to 0.

[0113] Shortening: Shortening involves fixing certain bit positions in the encoded bit sequence so that they do not need to be transmitted. On the decoding side, since the corresponding "shortened" positions are known at the receiver (usually 0), the LLR of the corresponding bit is set to infinity.

[0114] Repetition: "Repetition" refers to obtaining a longer bit sequence by repeatedly sending a portion of the encoded bit sequence.

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

[0116] Table 2

[0117]

[0118]

[0119] As can be seen from the table above, rate matching during retransmission involves numerous branches, resulting in complex descriptions and potential performance defects. Furthermore, the construction and decoding processes are highly complex. Therefore, the proposed solution may suffer from high retransmission complexity.

[0120] This application provides an information transmission method and apparatus. This method can be applied to IR-HARQ, is simple to describe, and can reduce the complexity of information retransmission. The method can be illustrated using polar codes as an example. It is understood that this method can also be applied to other encoding and decoding scenarios, such as low-density parity-check codes (LDPC), Turbo codes, convolutional codes, etc., but the embodiments of this application do not limit this application.

[0121] Optionally, the method provided in this application can be applied to the sending end or receiving end shown above. For example, the sending end is a terminal device, which performs channel coding on the bit sequence to be encoded to obtain a coded bit sequence, performs sub-block interleaving on the coded bit sequence to obtain a first bit sequence, determines a cyclic buffer based on the length and rate matching method of the first bit sequence, determines the transmission reference point of the second bit sequence based on the redundancy version, and outputs the second bit sequence to a network device based on the cyclic buffer, the output length of the second bit sequence, and the transmission reference point. The receiving end is a network device, which receives a signal, determines a cyclic buffer based on the coding length and rate matching method corresponding to the second bit sequence, determines the transmission reference point of the second bit sequence based on the redundancy version, and performs rate matching on the signal based on the cyclic buffer, the output length of the second bit sequence, and the transmission reference point to obtain a first sequence, de-interleaves the first sequence to obtain a second sequence, and decodes the second sequence. For another example, the sending end can be a network device, and the receiving end can be a terminal device; this application does not limit this. It is understood that, for the embodiments of this application, the sending end can be a communication device that outputs the second bit sequence, and the receiving end can be a communication device that receives the signal corresponding to the second bit sequence. The terminal device can be... Figure 1 The network architecture shown refers to the terminal device, or the encoding module within the terminal device, or the circuitry or chip responsible for encoding functions within the terminal device (such as an encoding / decoding chip, also known as a baseband chip, or a SoC chip or SIP chip containing an encoding / decoding core, etc.). Network devices can be... Figure 1 The network devices in the network architecture shown, or the encoding modules in the network devices, or the circuits or chips in the network devices responsible for encoding functions (such as encoding / decoding chips, also known as baseband chips, or SoC chips or SIP chips containing encoding / decoding cores, etc.) are described in the embodiments of this application and will not be repeated hereafter.

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

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

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

[0125] S401: The transmitting end performs channel coding on the bit sequence to be encoded to obtain the encoded bit sequence.

[0126] The sending end can obtain the bit sequence to be encoded, which can be understood as containing information or the bit sequence to be transmitted. Optionally, the bit sequence to be encoded can be understood as a bit sequence including K information bits.

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

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

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

[0130] The transmitting end can perform channel coding on the bit sequence to be encoded to obtain the encoded bit sequence, which can also be understood as the encoded bit sequence corresponding to K information bits. The encoded bit sequence can also be understood as the encoded bit sequence.

[0131] S402: The transmitting end performs sub-block interleaving on the encoded bit sequence to obtain the first bit sequence.

[0132] After obtaining the encoded bit sequence, the transmitting end can perform sub-block interleaving on the encoded bit sequence to obtain the first bit sequence. Specifically, the length of the encoded bit sequence can be divided into multiple sub-blocks for interleaving. For example, if the length of the encoded bit sequence is N, it can be divided into X sub-blocks. The size of each sub-block can be N / X, where X is an integer power of 2, X is divisible by N, and N is greater than X.

[0133] For example, if X = 32, the length of the encoded bit sequence (e.g., N, where N in NR is at least 32 and at most 1024, and is always a power of 2) can be divided into 32 sub-blocks for interleaving, with each sub-block being N / 32 in size. For example, the pseudocode for sub-block interleaving of the encoded bit sequence can be as follows:

[0134] for(i=0;i<32;i=i+1)

[0135] {for(j=0; j<N / 32; j=j+1)

[0136] b[i*N / 32+j]=a[P[i]*N / 32+j];

[0137] }

[0138] Where 'a' represents the encoded bit sequence, 'b' represents the sequence after sub-block interleaving (as described later in the first bit sequence), and 'P' represents the sub-block interleaving pattern. The length of the first bit sequence is N, which can also be understood as the first bit sequence comprising N bits. The sub-block interleaving pattern can be the interleaving pattern shown in Table 1 above, or other interleaving patterns, without limitation.

[0139] Sub-block interleaving of the coded bit sequence can match the construction method of polar codes. Sub-block interleaving allows determination of the puncturing or shortening positions when rate matching is implemented using puncturing or shortening, thus determining the position of information bits. In other words, without sub-block interleaving, the performance of the current bit sequence construction method might be poor when rate matching is implemented using puncturing or shortening. Therefore, sub-block interleaving of the coded bit sequence can improve transmission performance.

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

[0141] The transmitting end can obtain the initial transmission output length E0. The initial transmission output length E0 can be understood as a given initial transmission output code length. E0 can also be understood as a flexibly expandable code length, a flexibly expandable polar (EF-polar) code length, etc. This application embodiment does not limit the name of E0. For example, E0 can be determined based on the channel transmission resources and modulation order. For example, E0 can be set by the network device; or, E0 can be specified by a protocol or standard, etc. This application embodiment does not limit the method of setting E0. It should be noted that E0 can also be referred to as the length of the third bit sequence below, where the third bit sequence is the initial transmission bit sequence.

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

[0143] When E0 is greater than or equal to N, the rate matching method is repetition; or, when K / E0 is less than or equal to (or less than) a threshold and E0 is less than N, the rate matching method is puncturing; or, when K / E0 is greater than (or greater than or equal to) the threshold and E0 is less than N, the rate matching method is shortening. Here, the threshold can be 7 / 16, and K / E0 can be understood as the code rate. Illustratively, shortening of polar codes typically refers to the case where the polar code rate K / E0 is greater than 7 / 16, and the last N-E0 bits are untransmitted zero bits. Punching of polar codes typically refers to the case where the polar code rate K / E0 is less than or equal to 7 / 16, and due to the deletion of N-E0 codewords, the corresponding N-E0 input bits (or sub-channels) are pre-frozen. In other words, for the rate matching method of shortening, the value of the corresponding pre-coded bits can be set to a known value (e.g., binary 0).

[0144] Furthermore, after determining the first bit sequence, the sending end can output the second bit sequence. The first bit sequence can be understood as the bit sequence after encoding and sub-block interleaving, the second bit sequence can be understood as the output bit sequence, and the third bit sequence described below can be understood as the second bit sequence of the initial transmission. For retransmission, each retransmission bit can be obtained from one or more initial transmission bits, which are contained in the first bit sequence.

[0145] The output length E of the second bit sequence can be N, or it can be the code length after rate matching. The transmitter sends K information bits, such as u = u0, u1, ..., u... K-1 Polar coding is performed to obtain a coded bit sequence of length N, such as d = d0, d1, ..., dn. N-1 The first bit sequence of length N is obtained by interleaving sub-blocks of the coded bit sequence. For example, the first bit sequence is e = e0, e1, ..., e N-1 For example, if E = N, the data can be output directly; if E is not equal to N, the sender can obtain bits of length E through rate matching. That is, when E is not equal to N, the sender can adapt to the length of available resources through rate matching to obtain the first bit sequence. Rate matching methods may include repetition, puncture, shortening, etc., which are not limited in this embodiment.

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

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

[0148] It should be noted that S403 can also be replaced by: the transmitter determining the second bit sequence based on the length N of the first bit sequence, the rate matching method, and the first bit sequence. That is, the transmitter can determine the output length of the M-length bit sequence based on N and the rate matching method. Specifically: the rate matching method is puncturing or repetition, M = N; or the rate matching method is shortening, M = E0. After determining M, the transmitter can output the N-length first bit sequence with an output length of M-length bit sequence. Here, the output length of the M-length bit sequence can refer to the circular buffer mentioned in the text; the two are interchangeable. It can be understood that a circular buffer can be a method of transmitting bit sequences, that is, the N-length output bit sequence can be mapped onto an M-length circular buffer. If N is greater than M, the NM-length bit sequence can continue to be transmitted from the first position of the circular buffer. The circular buffer can be equivalent to the exemplary pseudocode of the circular buffer in the above technical terminology.

[0149] S404: The transmitting end outputs the second bit sequence based on the circular buffer, the output length E of the second bit sequence, and the transmission reference point, where E is an integer greater than or equal to 1.

[0150] The transmission reference point is related to the redundancy version. For example, the sender can determine the transmission reference point of the second bit sequence based on the redundancy version. The transmission reference point of the second bit sequence can include the start point or the end point of the transmission of the second bit sequence. Optionally, if the transmission reference point of the second bit sequence includes the end point of the transmission of the second bit sequence, the sender can also determine the start point of the transmission of the second bit sequence based on the end point of the transmission of the second bit sequence. That is, in one possible implementation, the sender can determine the start point of the transmission of the second bit sequence based on the redundancy version. In another possible implementation, the sender can determine the end point of the transmission of the second bit sequence based on the redundancy version, and then determine the start point of the transmission of the second bit sequence based on the end point of the transmission of the second bit sequence. Wherein:

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

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

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

[0154] In the first to third possible implementations, the transmission start point K0 of the second bit sequence is related to the redundancy version and N. In the fourth possible implementation, the transmission start point of the second bit sequence is related to the redundancy version and M.

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

[0156]

[0157] Where id represents the version number of the redundant version, and x is greater than or equal to 2, where x is an integer. The following possible implementations are illustrated by taking x greater than or equal to 2 and less than or equal to 4 as an example.

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

[0159] Table 3

[0160]

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

[0162] Table 4

[0163]

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

[0165] Table 5

[0166]

[0167] For the first possible implementation, it can be seen that the transmission start points of the second bit sequence can be distributed in... Between each starting point, the intervals are equal, ensuring a relatively uniform output for retransmissions and preventing any overlap. The positions mentioned above will not fall into the shortened positions. Considering that during shortening, the bits at positions E to N-1 of the output length of the second bit sequence are shortened bits and cannot be output as encoded bits, and the maximum length of E to N-1 can be... The transmission start point determined in this embodiment can only occur in [location missing]. The position is such that the transmission start point does not fall into the shortened bit position.

[0168] In one embodiment, i = 2. K0 can satisfy the following relationship, where the number of redundant versions is x:

[0169]

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

[0171] Table 6

[0172]

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

[0174] Table 7

[0175]

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

[0177] Table 8

[0178]

[0179] In this embodiment, it can be seen that the transmission start points of the second bit sequence can be distributed between 0 and N / 2, with each start point being equally spaced. For retransmissions, the output is relatively uniform each time, and it will not fall into a position greater than N / 2, i.e., it will not fall into a shortened position. Considering that during shortening, the output length E to N-1 of the second bit sequence is a shortened bit, which cannot be output as an encoded bit. Since the length of E to N-1 can be up to N / 2-1, the transmission start points determined in this embodiment can only occur at positions 0 to N / 2, and the transmission start points will not fall into shortened bit positions.

[0180] In one embodiment, i = 3. K0 can satisfy the following relationship, where the number of redundant versions is x:

[0181]

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

[0183] Table 9

[0184]

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

[0186] Table 10

[0187]

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

[0189] Table 11

[0190]

[0191]

[0192] In this embodiment, it can be seen that the transmission start points of the second bit sequence can be distributed between 0 and N / 3, with each start point being equally spaced. For retransmissions, the output is relatively uniform each time, and it will not fall into a position greater than N / 3, i.e., it will not fall into a shortened position. Considering that during shortening, the output length E to N-1 of the second bit sequence is a shortened bit, which cannot be output as an encoded bit, and the length of E to N-1 can be up to N / 3-1, the transmission start points determined in this embodiment only occur in the positions 0 to N / 3, which is more concentrated than the positions 0 to N / 2, and the transmission start points will not fall into the shortened bit positions, thus reducing the complexity of rate matching.

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

[0194]

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

[0196] Table 12

[0197]

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

[0199] Table 13

[0200]

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

[0202] Table 14

[0203]

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

[0205] In one embodiment, i = 2. K0 can satisfy the following relationship, where the number of redundant versions is x+1:

[0206]

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

[0208] Table 15

[0209]

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

[0211] Table 16

[0212]

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

[0214] Table 17

[0215]

[0216] As can be seen from the implementation of this embodiment, compared with the first possible implementation, the transmission start point of rv0 to rvx-1 is the same as that of the first possible implementation. The difference is that the transmission start point of rvx is added. This start point can be selected at the midpoint of M and N / 2, so that the transmission start point will not fall into the shortened bit position, the retransmission performance is better and the error rate can be reduced, thus improving the performance of multiple retransmissions.

[0217] In one embodiment, i = 3. K0 can satisfy the following relationship, where the number of redundant versions is x+1:

[0218]

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

[0220] Table 18

[0221]

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

[0223] Table 19

[0224]

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

[0226] Table 20

[0227]

[0228] As can be seen from the implementation of this embodiment, compared with the first possible implementation, the transmission start point of rv0 to rvx-1 is the same as that of the first possible implementation. The difference is that the transmission start point of rvx is added. This start point can be selected at the midpoint of M and N / 2, so that the transmission start point will not fall into the shortened bit position, the retransmission performance is better and the error rate can be reduced, thus improving the performance of multiple retransmissions.

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

[0230]

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

[0232] Table 21

[0233]

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

[0235] Table 22

[0236]

[0237]

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

[0239] Table 23

[0240]

[0241] Optionally, for the third possible implementation, K0 is greater than or equal to M, and the version number of the redundant version is 0. Optionally, M is less than... The version number of the redundant version is 0.

[0242] For the third possible implementation, it can be seen that dividing the transmission start points into equal intervals with N avoids falling into shortened positions and makes the HARQ performance of multiple transmissions more uniform. Optionally, for K0 greater than or equal to M or M less than... In such cases, the version number of the redundant version is scheduled to 0, so that the transmission start point does not fall into the shortened bit position, avoiding misunderstanding of the bit sequence. Therefore, the description complexity and rate matching complexity in the standard can be reduced.

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

[0244]

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

[0246] Table 24

[0247]

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

[0249] Table 25

[0250]

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

[0252] Table 26

[0253]

[0254] For the fourth possible implementation, it can be seen that under different M lengths, the bit sequence after x output superpositions can uniformly cover the entire codeword, and the transmission start point will not fall into the shortened bit position, avoiding the misunderstanding of the bit sequence. Therefore, the complexity of retransmission can be reduced, and the performance of multiple retransmissions can be further improved.

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

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

[0257] Table 27

[0258]

[0259] It's understandable, although RV id The sorting can be random. For the output bit sequence, K0 can be selected for output in order (e.g., rv0~rvx-1 or rv0~rvx), or it can be selected based on rv... id The random sorting corresponding to K0 is output, but this application embodiment does not limit this.

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

[0261] Table 28

[0262]

[0263] It can be seen that different redundant versions can correspond to one or more transmission start points of the second bit sequence. Therefore, the sending end can determine that the transmission start point of the second bit sequence is any one of the one or more transmission start points corresponding to the redundant version.

[0264] Similarly, another possible implementation is that the sending end determines the transmission end point of the second bit sequence based on the redundant version, and determines the transmission start point of the second bit sequence based on the transmission end point of the second bit sequence.

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

[0266] It should be noted that the rate matching method corresponding to this possible implementation can be puncturing. This is because if N is greater than M, puncturing can be used to delete certain bits, making the length of the first bit sequence match M. Therefore, the transmission start point of the second bit sequence can be further determined by determining the transmission end point of the second bit sequence.

[0267] The transmission start point K0 and the transmission end point G0 of the second bit sequence can satisfy the following relationship:

[0268] K0 = mod(G0 - E + 1, N) (9)

[0269] The relationship between the transmission endpoint and the redundant version can be implemented in any of the following ways:

[0270] In the first to second possible implementations, G0 can be determined based on the redundant version and N.

[0271] In the first possible implementation, G0 can satisfy the following relationship, where the number of redundant versions is x:

[0272]

[0273] The following possible implementations are illustrated by taking x as an example where x is greater than or equal to 2 and less than or equal to 4.

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

[0275] Table 29

[0276]

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

[0278] Table 30

[0279]

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

[0281] Table 31

[0282]

[0283] For the first possible implementation, it can be seen that the transmission endpoints of the second bit sequence can be distributed in... Between each bit sequence, the endpoints are equally spaced, ensuring relatively uniform transmission for retransmissions. Furthermore, based on the relationship between the start and end points of the second bit sequence, the start point will not fall within the specified range. The above positions. For the case where the rate matching method is puncturing, the transmission start point determined in this embodiment only occurs in the following locations. In terms of location, it can be aligned with the distribution location of the transmission start point with the rate matching method being shortened, which is simple to describe.

[0284] In one embodiment, i = 2. G0 can satisfy the following relationship, where the number of redundant versions is x:

[0285]

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

[0287] Table 32

[0288]

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

[0290] Table 33

[0291]

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

[0293] Table 34

[0294]

[0295] As can be seen from the implementation of this embodiment, the transmission end point of the second bit sequence can be distributed in... Between each bit sequence, the endpoints are equally spaced, ensuring relatively uniform transmission for retransmissions. Furthermore, based on the relationship between the start and end points of the second bit sequence, the start point will not fall within the specified range. The above positions. For the case where the rate matching method is punched, the transmission start point determined in this embodiment only occurs at positions 0 to N / 2, which can be aligned with the distribution positions of the transmission start points when the rate matching method is shortened, making the description simple.

[0296] In one embodiment, i = 3. G0 can satisfy the following relationship, where the number of redundant versions is x:

[0297]

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

[0299] Table 35

[0300]

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

[0302] Table 36

[0303]

[0304]

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

[0306] Table 37

[0307]

[0308] As can be seen from the implementation of this embodiment, the transmission end point of the second bit sequence can be distributed in... Between each bit sequence, the endpoints are equally spaced, ensuring relatively uniform transmission for retransmissions. Furthermore, based on the relationship between the start and end points of the second bit sequence, the start point will not fall within the specified range. The above positions. For the case where the rate matching method is puncturing, the transmission start point determined in this embodiment only occurs in the following locations. In terms of location, it can be aligned with the distribution location of the transmission start point with the rate matching method being shortened, which is simple to describe.

[0309] In the second possible implementation, G0 can satisfy the following relationship, where the number of redundant versions is x:

[0310]

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

[0312] Table 38

[0313]

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

[0315] Table 39

[0316]

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

[0318] Table 40

[0319]

[0320] For the second possible implementation, it can be seen that the transmission end points are divided into equally spaced segments with N. Furthermore, based on the relationship between the transmission start points and the transmission end points of the second bit sequence, it can be seen that a uniform distribution of transmission end points leads to a uniform distribution of transmission start points, thus resulting in more uniform HARQ performance across multiple transmissions.

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

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

[0323] Table 41

[0324]

[0325] It's understandable, although RV id The sorting can be random. For the output bit sequence, G0 can be selected sequentially (e.g., rv0~rvx-1 or rv0~rvx), or it can be selected based on rv... id The random sorting corresponding to G0 is not limited in the embodiments of this application.

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

[0327] Table 42

[0328]

[0329] It can be seen that different redundant versions can correspond to one or more transmission termination points of the second bit sequence. Therefore, the sending end can determine that the transmission termination point of the second bit sequence is any one of the one or more transmission termination points corresponding to the redundant version.

[0330] After the sending end determines the transmission reference point of the second bit sequence, it can output the second bit sequence based on the circular buffer, E, and the transmission reference point.

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

[0332] fork = 0 to E-1

[0333]

[0334] end for

[0335] Optionally, after determining the transmission start point of the second bit sequence, the sending end can align the transmission start point of the second bit sequence to the position in the circular buffer corresponding to an index that is a multiple of 2^a, where a is a positive integer. For example, the position in the circular buffer corresponding to an index that is a multiple of 2^a and closest to the transmission start point of the second bit sequence can be determined as the output start position of the second bit sequence. For instance, if the sending end determines that the transmission start point of the second bit sequence is at index 9 in the circular buffer, then the transmission start point of the second bit sequence can be shifted forward by 1 bit, meaning the output start position of the second bit sequence can be determined to be at position 2^3 = 8; or, for another example, if the sending end determines that the transmission start point of the second bit sequence is at index 38 in the circular buffer, then the transmission start point of the second bit sequence can be shifted forward by 6 bits, meaning the output start position of the second bit sequence can be determined to be at position 2^5 = 32. By aligning the output positions of the retransmitted bit sequences, parallel operations can be facilitated. For example, when performing rate matching on the encoded bit sequence at the transmitting end, aligning the output start position of the second bit sequence can guarantee parallelism.

[0336] For example, 'a' can be 3, 4, 5, or 6, and the corresponding parallelism of data processing can be 8, 16, 32, or 64.

[0337] It should be noted that the sending end can determine the transmission start point of the second bit sequence and align the transmission start point of the second bit sequence to the position in the circular buffer corresponding to an integer multiple of index 2^a, either sequentially or simultaneously, without limitation.

[0338] For the sending end to simultaneously determine the transmission start point of the second bit sequence and align the transmission start point of the second bit sequence to the position in the circular buffer corresponding to an index that is an integer multiple of 2^a, an exemplary implementation of the relationship between the transmission start point and the selection of the redundant version could be as follows:

[0339] In the first to third possible implementations, the transmission start point K0 of the second bit sequence is related to the redundancy version and N. In the fourth possible implementation, the transmission start point of the second bit sequence is related to the redundancy version and M.

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

[0341]

[0342] Where n is a positive integer.

[0343] In one embodiment, i = 2. K0 can satisfy the following relationship, where the number of redundant versions is x:

[0344]

[0345] In one embodiment, i = 3. K0 can satisfy the following relationship, where the number of redundant versions is x:

[0346]

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

[0348]

[0349] In one embodiment, i = 2. K0 can satisfy the following relationship, where the number of redundant versions is x+1:

[0350]

[0351] In one embodiment, i = 3. K0 can satisfy the following relationship, where the number of redundant versions is x+1:

[0352]

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

[0354]

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

[0356]

[0357] The transmission start point K0 and the transmission end point G0 of the second bit sequence can satisfy the following relationship:

[0358]

[0359] In one possible implementation, the value of n in the above formulas (14) to (22) can be determined based on the system throughput.

[0360] In one possible implementation, the value of n in the above formulas (14) to (22) can be 3, 4, 5, or 6.

[0361] When n is 3, it means the starting position is a multiple of 8, which is beneficial for matching system throughput within 3 gigabits per second (Gbps), thus better meeting the parallelism requirements of that system throughput. When n is 4, it means the starting position is a multiple of 16, which is beneficial for matching system throughput within 5 Gbps, thus better meeting the parallelism requirements of that system throughput. When n is 5, it means the starting position is a multiple of 32, which is beneficial for matching system throughput within 10 Gbps, thus better meeting the parallelism requirements of that system throughput. When n is 6, it means the starting position is a multiple of 64, which is beneficial for matching system throughput greater than 20 Gbps, thus better meeting the parallelism requirements of that system throughput.

[0362] It is understandable that formulas (14) to (22) can be used to replace formulas (1) to (9) above. For specific examples and related descriptions of each formula, please refer to formulas (1) to (9) above. They will not be repeated here.

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

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

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

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

[0367] based on Figure 4 The method embodiment shown allows the transmitting end to perform sub-block interleaving on the coded bit sequence to increase coding gain. Furthermore, it can output (or transmit) the second bit sequence based on the circular buffer, the output length of the second bit sequence, and the transmission reference point. Unlike rate matching with different branches during retransmission, the information transmission scheme provided in this application embodiment is simple in description, uses the same rate matching description method for initial and retransmission, and determines the transmission reference point of the second bit sequence based on the redundant version when outputting it. This results in stable performance and reduces the complexity of retransmission. Moreover, for example, for Polar codes, this implementation is more friendly to Polar code information transmission, ensuring that each transmission can self-decode. That is, each transmission does not need to rely on the content of the previous transmission, but only needs to decode based on the content of the current transmission. In this scheme, determining the transmission reference point of the second bit sequence based on the redundant version allows for more flexible configuration of the redundant version, further making the output of the second bit sequence more flexible.

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

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

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

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

[0372] The receiving end receives a signal corresponding to the second bit sequence output, and the encoding length of the second bit sequence is N. The transmitting end can encode the bit sequence to be encoded to obtain an encoded bit sequence, and then perform sub-block interleaving on the encoded bit sequence to obtain a first bit sequence. The length of the first bit sequence is N, which can be understood as the first bit sequence comprising 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 the bit sequence after encoding and sub-block interleaving. After determining the first bit sequence, the transmitting end can output the second bit sequence to the receiving end. The second bit sequence can be understood as the output bit sequence, therefore the encoding length of the second bit sequence is N.

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

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

[0375] S503: The receiver performs rate matching on the signal based on the cyclic buffer, the output length E of the second bit sequence, and the transmission reference point to obtain the first sequence, where E is an integer greater than or equal to 1.

[0376] The transmission reference point is related to the redundancy version. For example, the receiver can determine the transmission reference point based on the redundancy version. The specific implementation of the receiver determining the transmission reference point of the second bit sequence based on the redundancy version can refer to the above-mentioned S404 where the transmitter determines the transmission reference point based on the redundancy version, and the transmitter and receiver can be replaced with equivalents.

[0377] The receiving end can perform rate matching dematching on the signal based on the determined cyclic buffer, E, and transmission reference point to obtain the first sequence. Here, rate matching dematching can be understood as the reverse process of rate matching. For example, the bits that were knocked out during rate matching can be filled with predefined 0s or 1s.

[0378] Optionally, if the transmitting end aligns the transmission start point of the second bit sequence to the position in the circular buffer corresponding to an integer multiple of index 2^a before outputting the second bit sequence, the receiving end can dealign the signal based on the determined circular buffer, E, and transmission reference point. In other words, the original transmission start point of the signal can be determined. For example, if the transmitting end determines that the transmission start point of the second bit sequence is at index 9 in the circular buffer, then the transmission start point of the second bit sequence can be shifted forward by 1 bit. That is, the output start position of the second bit sequence can be determined to be at position 2^3 = 8. Then, for the receiving end, the signal output start position can be determined to be at index 9 in the circular buffer, and the signal output start position can be aligned to position 2^3 = 8, and rate matching can be performed. For another example, if the transmitting end determines that the transmission start point of the second bit sequence is at index 38 in the circular buffer, then the transmission start point of the second bit sequence can be shifted forward by 6 bits. That is, the output start position of the second bit sequence can be determined to be at position 2^5 = 32. Then, for the receiving end, the signal output start position can be determined to be at index 38 in the circular buffer, and the signal output start position can be aligned to position 2^5 = 32, and rate matching can be performed.

[0379] S504: The receiving end deinterleaves the first sequence into sub-blocks to obtain the second sequence.

[0380] S505: The receiver decodes the second sequence to obtain the decoded bit sequence.

[0381] The receiving end decodes the second sequence to obtain the decoded bit sequence, thereby obtaining K information bits.

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

[0383] based on Figure 5The illustrated method embodiment determines the cyclic buffer based on the length of the first bit sequence and the rate matching method, determines the transmission reference point of the second bit sequence output based on the redundancy version, and then performs de-rate matching on the signal based on the cyclic buffer, the output length of the second bit sequence, and the transmission reference point. The de-rate matched sequence (such as the first sequence) is then de-interleaved, and the de-interleaved sequence (such as the second sequence) is decoded. De-interleaving the sequence increases decoding gain. Furthermore, the de-rate matching based on the cyclic buffer, the output length of the second bit sequence, and the transmission reference point is particularly beneficial for polar code information transmission, ensuring self-decoding for each transmission. This means each transmission can decode based solely on the current transmission content, without relying on the previous transmission. Unlike rate matching with different branches during retransmission, the retransmission scheme provided in this embodiment is simple to describe, does not require re-encoding during retransmission, determines the transmission reference point of the second bit sequence based on the redundancy version, has stable performance, and reduces decoding complexity.

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

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

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

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

[0388] For example, processing module 601 is used to perform channel coding on the bit sequence to be encoded to obtain a coded bit sequence;

[0389] Processing module 601 is also used to perform sub-block interleaving on the encoded bit sequence to obtain the first bit sequence;

[0390] The processing module 601 is further configured to determine a circular buffer of length M based on the length N of the first bit sequence and the rate matching method, wherein N and M are both integers greater than or equal to 1, and M is less than or equal to N; and to determine the transmission reference point of the second bit sequence based on the redundancy version. The processing module 601 may include a determination module, etc. For example, the processing module 601 may also include an encoding module and a sub-block interleaving module, etc.

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

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

[0393] For example, transceiver module 602 is used to receive a signal, the signal corresponding to an output second bit sequence, the second bit sequence corresponding to an encoding length of N, where N is an integer greater than or equal to 1; as an example, transceiver module 602 can receive signals transmitted through a channel. Transceiver module 602 may include a radio frequency module, an antenna module, etc. As another example, transceiver module 602 can receive a sequence to be processed (such as de-rate matching, de-interleaving of sub-blocks, and decoding) from other modules, such as inputting the sequence to be processed, so that the processing module can process the sequence. Transceiver module 602 may include an input / output module, etc.

[0394] Processing module 601 is used to determine the circular buffer according to N and the rate matching method. The length of the circular buffer is M, where M is an integer greater than or equal to 1 and less than or equal to N.

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

[0396] The processing module 601 is further configured to perform rate matching on the signal based on the circular buffer, the output length E of the second bit sequence, and the transmission reference point to obtain a first sequence, where E is an integer greater than or equal to 1; to perform sub-block interleaving on the first sequence to obtain a second sequence; and to decode the second sequence to obtain a decoded bit sequence. The processing module 601 may also include a determination module, etc. For example, the processing module 601 may also include a rate matching module, a sub-block interleaving module, a decoding module, etc.

[0397] One possible implementation is that the transmission reference point of the second bit sequence includes either the transmission start point or the transmission end point of the second bit sequence.

[0398] One possible implementation is that the rate matching method is puncturing, and the processing module 601 is also used to determine the transmission start point of the second bit sequence based on the transmission end point of the second bit sequence.

[0399] One possible implementation is that the transmission start point of the second bit sequence satisfies the following relationship: K0 = mod(G0 - E + 1, N), where K0 represents the transmission start point of the second bit sequence and G0 represents the transmission end point of the second bit sequence.

[0400] One possible implementation is that the end point of the transmission of the second bit sequence is determined based on the number of redundant versions and N.

[0401] One possible implementation is that the transmission endpoint of the second bit sequence satisfies the following relationship: Where G0 represents the end point of transmission of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x is greater than or equal to 2, x is an integer, and i is a positive integer.

[0402] One possible implementation is i = 2.

[0403] One possible implementation is that the transmission endpoint of the second bit sequence satisfies the following relationship: Where G0 represents the end point of transmission of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x is greater than or equal to 2, and x is an integer.

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

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

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

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

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

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

[0410] One possible implementation is that the transmission start point of the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the transmission of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x is greater than or equal to 2, and x is an integer.

[0411] One possible implementation is that the transmission start point of the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the transmission of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x+1, x is greater than or equal to 2, and x is an integer.

[0412] One possible implementation is that the transmission start point of the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the transmission of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x is greater than or equal to 2, and x is an integer.

[0413] One possible implementation is a rate matching method using punching, where K0 is greater than or equal to M, and the version number of the redundant version is 0.

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

[0415] One possible implementation is that the transmission start point of the second bit sequence satisfies the following relationship: Where K0 represents the starting point of the transmission of the second bit sequence, id represents the version number of the redundant version, the number of redundant versions is x, x is greater than or equal to 2, and x is an integer.

[0416] One possible implementation is that the processing module 601 outputs the second bit sequence based on the circular buffer, the output length E of the second bit sequence, and the transmission reference point. Specifically, it is used to: align the transmission start point of the second bit sequence to the position in the circular buffer corresponding to an integer multiple of index 2^a, where a is a positive integer; and output the second bit sequence based on the circular buffer, the output length E of the second bit sequence, and the position.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Claims

1. An information transmission method, characterized in that, The method includes: Channel coding is performed on the bit sequence to be encoded to obtain the encoded bit sequence; The encoded bit sequence is sub-block interleaved to obtain the first bit sequence; The circular buffer is determined based on the length N of the first bit sequence and the rate matching method. The length of the circular buffer is M, where N and M are both integers greater than or equal to 1, and M is less than or equal to N. The second bit sequence is output based on the circular buffer, the output length E of the second bit sequence, and the transmission reference point, where E is an integer greater than or equal to 1, and the transmission reference point is related to the redundant version.

2. An information transmission method, characterized in that, The method includes: A received signal is provided, the signal corresponding to a second bit sequence, the encoding length of the second bit sequence being N, where N is an integer greater than or equal to 1; The circular buffer is determined based on N and the rate matching method. The length of the circular buffer is M, where M is an integer greater than or equal to 1 and less than or equal to N. The first sequence is obtained by performing rate matching on the signal based on the circular buffer, the output length E of the second bit sequence, and the transmission reference point, where E is an integer greater than or equal to 1, and the transmission reference point is related to the redundant version. The first sequence is de-interleaved to obtain the second sequence; The second sequence is decoded to obtain a decoded bit sequence.

3. The method according to claim 1 or 2, characterized in that, The transmission reference point of the second bit sequence includes the transmission start point of the second bit sequence or the transmission end point of the second bit sequence.

4. The method according to any one of claims 1-3, characterized in that, The rate matching method is punching, and the method further includes: The start point of transmission of the second bit sequence is determined based on the end point of transmission of the second bit sequence.

5. The method according to claim 3 or 4, characterized in that, The transmission start point of the second bit sequence satisfies the following relationship: K0 = mod(G0 - E + 1, N) Wherein, K0 represents the start point of transmission of the second bit sequence, and G0 represents the end point of transmission of the second bit sequence.

6. The method according to any one of claims 3-5, characterized in that, The transmission end point of the second bit sequence is determined based on the number of redundant versions and N.

7. The method according to any one of claims 3-6, characterized in that, The transmission endpoint of the second bit sequence satisfies the following relationship: Wherein, G0 represents the transmission end point of the second bit sequence, id represents the version number of the redundant version, the number of the redundant versions is x, x is greater than or equal to 2, x is an integer, and i is a positive integer.

8. The method according to claim 7, characterized in that, i＝2。 9. The method according to any one of claims 3-6, characterized in that, The transmission endpoint of the second bit sequence satisfies the following relationship: Wherein, G0 represents the transmission end point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, where x is greater than or equal to 2 and x is an integer.

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

11. The method according to claim 10, characterized in that, The transmission start point of the third bit sequence in the circular buffer is the transmission start point corresponding to one of the multiple redundant versions.

12. The method according to any one of claims 3-11, characterized in that, The transmission start point of the second bit sequence is determined according to the number of redundant versions.

13. The method according to claim 12, characterized in that, The transmission start point of the second bit sequence is also determined according to N.

14. The method according to claim 12 or 13, characterized in that, The transmission start point of the second bit sequence satisfies the following relationship: Wherein, K0 represents the transmission start point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, where x is greater than or equal to 2 and x is an integer.

15. The method according to claim 12 or 13, characterized in that, The transmission start point of the second bit sequence satisfies the following relationship: K0=[N / 2 / (x-1)]*id,id∈0~x-1 Wherein, K0 represents the transmission start point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x+1, where x is greater than or equal to 2 and x is an integer.

16. The method according to claim 12 or 13, characterized in that, The transmission start point of the second bit sequence satisfies the following relationship: Wherein, K0 represents the transmission start point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, where x is greater than or equal to 2 and x is an integer.

17. The method according to claim 16, characterized in that, The rate matching method is punching, K0 is greater than or equal to M, and the version number of the redundant version is 0.

18. The method according to claim 12, characterized in that, The transmission start point of the second bit sequence is also determined according to M.

19. The method according to claim 12 or 18, characterized in that, The transmission start point of the second bit sequence satisfies the following relationship: Wherein, K0 represents the transmission start point of the second bit sequence, id represents the version number of the redundant version, and the number of redundant versions is x, where x is greater than or equal to 2 and x is an integer.

20. The method according to any one of claims 3-19, characterized in that, The step of outputting the second bit sequence based on the circular buffer, the output length E of the second bit sequence, and the transmission reference point includes: Align the transmission start point of the second bit sequence to the position in the circular buffer corresponding to an index that is a multiple of 2^a, where a is a positive integer; The second bit sequence is output based on the circular buffer, the output length E of the second bit sequence, and the position.

21. The method according to claim 20, characterized in that, The value of 'a' is 3, 4, 5, or 6.

22. The method according to any one of claims 1-21, characterized in that, When M is less than N, the method further includes: Map the first M bits of the second bit sequence of length N to a circular buffer of length M.

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

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

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

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

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

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

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

Images