Communication method and related device

Abstract

The invention provides a communication method and a related device, which are applied to the technical field of communication. In the technical scheme provided by the invention, a communication device divides M bit streams to be transmitted to obtain N sub-blocks, each data stream to be transmitted in M data streams to be transmitted is divided to obtain one or more sub-blocks, M is a positive integer, and N is an integer greater than or equal to M; aggregation processing is carried out on the N sub-blocks to obtain T bit streams to be coded, each bit stream to be coded in the T bit streams to be coded comprises one or more sub-blocks in the N sub-blocks, and T is a positive integer; and performing channel coding on each bit stream to be coded in the T bit streams to be coded. The coding efficiency can be improved in a multi-flow scene.

Description

Communication method and related device Technical Field

[0001] The present application relates to the field of communications, and in particular to communication methods and related devices. Background Art

[0002] In a communication system, the transmitter performs source coding, channel coding, and modulation on the information to be transmitted, and then transmits the resulting modulated signal over the channel. The receiver, upon receiving the signal transmitted over the channel, performs demodulation, channel decoding, and source decoding to obtain the information transmitted by the transmitter. The transmitter can also be called the information source, and the receiver can also be called the information sink.

[0003] With the development of communication systems, the information transmitted between the sender and the receiver is becoming more and more diverse, and the amount of information is also increasing. If the communication system is not improved, the communication performance of the communication system will be affected.

[0004] Therefore, how to improve the communication performance of the communication system has become a technical problem that needs to be solved urgently.

[0005] Summary of the Invention

[0006] The present application provides a communication method and related devices, which can implement channel coding across bit streams to improve communication performance.

[0007] In a first aspect, the present application provides a communication method, which is applied to a communication device, and the method includes: dividing M bit streams to be transmitted to obtain N sub-blocks, wherein each bit stream to be transmitted in the M data streams to be transmitted is divided into one or more sub-blocks, M is a positive integer, and N is an integer greater than or equal to M; aggregating the N sub-blocks to obtain T bit streams to be encoded, each of the T bit streams to be encoded contains one or more sub-blocks in the N sub-blocks, and T is a positive integer; and channel coding each of the T bit streams to be encoded.

[0008] In this method, different bit streams to be transmitted are divided into sub-blocks, and the sub-blocks are aggregated according to certain rules to form bit streams to be encoded, which can realize channel coding across bit streams to improve communication performance.

[0009] In some possible implementations, the number of sub-blocks obtained by dividing each to-be-transmitted bit stream is predefined, for example, in a communication protocol, in a communication device, or after negotiation between the communication device and a communication peer.

[0010] In some possible implementations, the length of each sub-block obtained by dividing the bit stream to be transmitted is predefined, for example, it may be predefined in the communication protocol, or it may be predefined in the communication device, or it may be predefined after negotiation between the communication device and the communication peer.

[0011] In some possible implementations, all bits within the same sub-block of the N sub-blocks share at least one of the following attributes: service type, key performance indicator (KPI), priority, or routing destination. In other words, the bitstream can be divided into sub-blocks based on the service attributes of the bits. For the same to-be-transmitted bitstream, bits with the same service attributes can be grouped into the same sub-block.

[0012] In some possible implementations, among the T bitstreams to be coded, all bits in the same bitstream to be coded have the same at least one attribute. In other words, sub-blocks can be aggregated according to the service attributes of the bits. For the same bitstream to be transmitted, sub-blocks with the same service attributes can be aggregated into the same bitstream to be coded.

[0013] In some possible implementations, aggregating the N sub-blocks to obtain T bit streams to be encoded includes: interleaving the sub-blocks obtained by dividing the N sub-blocks into different bits to be transmitted to obtain the T bit streams to be encoded.

[0014] In some possible implementations, T is greater than or equal to 2, a first bitstream to be coded among the T bitstreams to be coded includes a first subblock among the N subblocks, and a second bitstream to be coded among the T bitstreams to be coded includes the first subblock. In other words, the same subblock can be aggregated into multiple bitstreams to be coded. Alternatively, multiple bitstreams to be coded include the same subblock, or the subblocks of multiple bitstreams to be coded overlap.

[0015] As an example, if each bit stream to be coded is numbered, and the bit stream to be coded is divided into sub-blocks in the order of the numbers, and the sub-blocks obtained by the division are numbered in the order of the division, and the bit stream to be coded is numbered in the order of the aggregation, then the number of the sub-block in the bit stream to be coded with a later number is not before the number of the sub-block in the bit stream to be coded with a later number, and the two bit streams to be coded with adjacent numbers contain the same sub-block.

[0016] In some possible implementations, T is greater than or equal to 3, and each of the T bitstreams to be coded includes the first sub-block. In other words, all the bitstreams to be coded include the same sub-block, or the same sub-block is aggregated into each bitstream to be coded, or all the bitstreams to be coded have overlapping sub-blocks.

[0017] In some possible implementations, the N sub-blocks are aggregated to obtain T bit streams to be coded, each of the T bit streams to be coded containing one or more sub-blocks from the N sub-blocks, including: performing CRC check code addition processing on the N sub-blocks to obtain N syndrome sub-blocks corresponding one-to-one to the N sub-blocks, wherein each syndrome sub-block in the N syndrome sub-blocks is obtained by adding a CRC check code to a corresponding sub-block in the N sub-blocks; and aggregating the N syndrome sub-blocks to obtain the T bit streams to be coded, each of the T bit streams to be coded containing one or more syndrome sub-blocks from the N syndrome sub-blocks.

[0018] In some possible implementations, the length of the CRC check code added to each syndrome block is determined by the length of the sub-block corresponding to each syndrome block.

[0019] In this method, corresponding error detection functions can be provided for sub-blocks separated from the same or different bit streams.

[0020] In some possible implementations, the M bit streams to be transmitted correspond one-to-one to M data blocks, each of the M bit streams to be transmitted includes a bit stream in a corresponding data block, and the data block is a transport block TB or a code block CB.

[0021] In some possible implementations, the M bit streams to be transmitted correspond one-to-one to the M control information, and each of the M bit streams to be transmitted includes a bit stream in the corresponding control information.

[0022] In a second aspect, the present application provides a communication device. The device may include a module corresponding to each of the methods / operations / steps / actions described in the first aspect, and the module may be implemented as a hardware circuit, software, or a combination of hardware circuit and software.

[0023] In one design, the apparatus may include a communication module and a processing module. The communication module is configured to perform the actions of receiving / sending a bit stream performed by the communication device in the method described in the first aspect above, and the processing module is configured to perform the actions of dividing and aggregating the bit stream performed by the communication device in the method described in the first aspect above.

[0024] In one design, the apparatus may be a communication device, or may be a device, module, circuit or chip configured to be disposed in the communication device, or may be a device that can be used in conjunction with the communication device.

[0025] In a third aspect, the present application provides a communication device comprising a processor and a storage medium, wherein the storage medium stores instructions, which, when executed by the processor, enable the method in the first aspect or any possible implementation of the first aspect to be implemented.

[0026] Optionally, the device may further include a memory, the memory being used to store programs or instructions, and the processor being used to run the programs or instructions so that the method in the first aspect or any possible implementation manner of the first aspect is implemented.

[0027] Optionally, the device may further include the transceiver circuit, or an input / output interface.

[0028] In a fourth aspect, a chip is provided, comprising a processor, wherein the processor is configured to execute a program or instruction so that the method according to the first aspect or any possible implementation manner of the first aspect is implemented.

[0029] Optionally, the chip may further include a memory for storing programs or instructions. Optionally, the chip may further include the transceiver circuit, or an input / output interface.

[0030] In a fifth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium includes instructions, and when the instructions are executed by a processor, the method in the first aspect or any possible implementation of the first aspect is implemented.

[0031] In a sixth aspect, the present application provides a computer program product comprising instructions, which, when executed on a communication device, enables the communication device to implement the method in the first aspect and any possible implementation manner of the first aspect.

[0032] It can be understood that the effects obtainable in the second to sixth aspects can be referred to the description in the first aspect and will not be elaborated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] FIG1 is a schematic architecture diagram of a communication system applicable to a communication method according to an embodiment of the present application;

[0034] FIG2 is a schematic structural diagram of a communication system applicable to the method of an embodiment of the present application;

[0035] FIG3 is a schematic flow chart of a communication method provided in an embodiment of the present application;

[0036] FIG4 is a schematic diagram of a communication method provided in an embodiment of the present application;

[0037] FIG5 is a schematic diagram of another communication method provided in an embodiment of the present application;

[0038] FIG6 is an example of different overlapping sub-blocks of multiple groups of overlapping bit streams to be encoded;

[0039] FIG7 is an example of a plurality of overlapping groups of bit streams to be coded having the same overlapping sub-blocks;

[0040] FIG8 is a schematic flow chart of a communication method according to another embodiment of the present application;

[0041] FIG9 is a schematic structural diagram of a communication device according to an embodiment of the present application;

[0042] FIG10 is a schematic structural diagram of a communication device provided in yet another embodiment of the present application. DETAILED DESCRIPTION

[0043] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0044] To facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first" and "second" are used to distinguish between identical or similar items with substantially the same functions and effects. Those skilled in the art will understand that the words "first" and "second" do not limit the quantity or execution order, and the words "first" and "second" do not necessarily mean different.

[0045] It should be noted that in the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described in this application as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0046] In the embodiments of the present application, "at least one" refers to one or more, and "more" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: the existence of A alone, the existence of A and B at the same time, and the existence of B alone, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, c can be single or multiple.

[0047] The technical solutions provided in this application can be applied to various communication systems, such as: fifth generation (5G) or new radio (NR) systems, long term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, wireless local area networks (WLAN) systems, satellite communication systems, future communication systems, such as sixth generation (6G) mobile communication systems, or a fusion system of multiple systems. The technical solutions provided in this application can also be applied to device to device (D2D) communication, vehicle-to-everything (V2X) communication, machine to machine (M2M) communication, machine type communication (MTC), and Internet of Things (IoT) communication systems or other communication systems.

[0048] In an embodiment of the present application, the terminal device may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device.

[0049] The terminal device may be a device that provides voice / data, such as a handheld device or vehicle-mounted device with a wireless connection function. At present, some examples of terminals are: mobile phones, tablet computers, laptop computers, PDAs, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to wireless modems, wearable devices, terminal devices in 5G networks or future evolved public land mobile communication networks (PLMNs). The terminal equipment in the network (PLMN), etc., is not limited to this in the embodiments of the present application.

[0050] As an example and not a limitation, in the embodiment of the present application, the terminal device may also be a wearable device. Wearable devices may also be called wearable smart devices, which are a general term for wearable devices that are intelligently designed and developed using wearable technology for daily wear, such as glasses, gloves, watches, clothing, and shoes. A wearable device is a portable device that is worn directly on the body or integrated into the user's clothes or accessories. Wearable devices are not only hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include those that are fully functional, large in size, and can achieve complete or partial functions without relying on smartphones, such as smart watches or smart glasses, as well as those that only focus on a certain type of application function and need to be used in conjunction with other devices such as smartphones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0051] The terminal device in the embodiment of the present application can also be replaced with a device that can support the terminal device to implement the function, such as a chip system, which can be installed in the terminal device or used in conjunction with the terminal device. In the embodiment of the present application, the chip system can be composed of a chip, or it can include a chip and other discrete devices. In the embodiment of the present application, only the device for implementing the function of the terminal device is used as an example for description, and does not constitute a limitation on the solution of the embodiment of the present application.

[0052] In the embodiments of the present application, a network device may be a device for communicating with a terminal device. The network device may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in the embodiments of the present application may refer to a radio access network (RAN) node (or device) that connects the terminal device to a wireless network. A base station may broadly cover various names as follows, or replace the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station, secondary station, multi-standard radio (motor slide retainer, MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), radio unit (RU), positioning node, etc. A base station may be a macro base station, a micro base station, a relay node, a donor node, or the like, or a combination thereof. The base station may also refer to a communication module, modem or chip that is set in the aforementioned equipment or device. The base station may also be a mobile switching center and a device that performs the base station function in D2D, V2X, and M2M communications, a network side device in a 6G network, a device that performs the base station function in future communication systems, etc. The base station can support networks with the same or different access technologies. Optionally, the RAN node may also be a server, a wearable device, a vehicle or an on-board device, etc. For example, the access network device in the vehicle to everything (V2X) technology may be a road side unit (RSU). The embodiments of the present application do not limit the specific technology and specific device form adopted by the network equipment.In some deployments, the network devices mentioned in the embodiments of the present application may include a CU, a DU, or both a CU and a DU, or a control plane CU node (central unit-control plane (CU-CP)), a user plane CU node (central unit-user plane (CU-UP)), and a DU node. For example, the network devices may include a gNB-CU-CP, a gNB-CU-UP, and a gNB-DU.

[0053] In the embodiments of the present application, the network device can be replaced with a device that can support the network device to implement the function, such as a chip system, a hardware circuit, a software module, or a hardware circuit and a software module. The device can be installed in the network device or used in conjunction with the network device. In the embodiments of the present application, only the device used to implement the function of the network device is used as an example for description, and does not constitute a limitation on the solutions of the embodiments of the present application.

[0054] The network device and / or terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it can also be deployed on the water surface; it can also be deployed on aircraft, balloons and satellites in the air. The embodiments of this application do not limit the scenarios in which the network device and the terminal device are located. In addition, the terminal device and the network device can be hardware devices, or they can be software functions running on dedicated hardware, software functions running on general-purpose hardware, such as virtualization functions instantiated on a platform (e.g., a cloud platform), or entities including dedicated or general-purpose hardware devices and software functions. This application does not limit the specific forms of the terminal device and the network device.

[0055] Figure 1 is a schematic architecture diagram of a communication system applicable to the communication method of an embodiment of the present application. As shown in Figure 1, the communication system 100 may include at least one network device, such as the network device 110 shown in Figure 1; the communication system 200 may also include at least one terminal device, such as the terminal device 120 shown in Figure 1. The network device 110 and the terminal device 120 can communicate via a wireless link. The communication devices in the communication system, for example, the network device 110 and the terminal device 120, can communicate via multi-antenna technology. In this system, the network device 110 can also be understood as a base station, which provides communication services for the terminal device. The communication method of the embodiment of the present application can be applied to the communication process between the terminal device 120 and the network device 110.

[0056] It should be noted that Figure 1 is only a simplified schematic diagram for ease of understanding, and the embodiment of the present application does not limit the number of network devices and terminal devices included in the communication system.

[0057] It should be understood that Figure 1 is merely a schematic diagram of the architecture of a communication system applicable to the communication method of the embodiments of the present application, and the communication system applicable to the communication method of the embodiments of the present application is not limited thereto. For example, the communication method of the embodiments of the present application may also be applicable to the communication process between terminal devices, or may also be applicable to the communication process between network devices.

[0058] Figure 2 is a schematic diagram of a communication system applicable to the methods of the embodiments of the present application. As shown in Figure 2, the communication system includes a transmitter, a channel, and a receiver. As an example, network device 110 in Figure 1 is the transmitter, and terminal device 120 is the receiver; as an example, terminal device 120 is the transmitter, and network device 110 is the receiver.

[0059] Among them, the sending end may include a signal source, a signal source coding module, a channel coding module and a modulation module. The signal source generates data to be transmitted, the signal source coding module performs source coding processing on the data to be transmitted generated by the signal source, the channel coding module performs channel coding processing on the information obtained by the source coding processing, and the modulation module modulates the information output by the channel coding module. The modulated signal can be sent to the receiving end through the channel.

[0060] The receiving end includes a demodulation module, a channel decoding module, a source decoding module and a sink. The demodulation module demodulates the received signal, the channel decoding module performs channel decoding on the demodulation result obtained by the demodulation module, and the source decoding module performs source decoding on the result output by the channel decoding module. The result output by the source decoding module is transmitted to the sink.

[0061] The channel coding module currently uses the following communication method: after obtaining a transport block (TB), the channel coding module performs channel coding on each TB separately, or divides the TB into code blocks (CB) and performs channel coding on each CB obtained by the division.

[0062] The inventors have discovered that, during the channel coding process, one or more bit streams to be transmitted can be divided into multiple sub-blocks, and the multiple sub-blocks obtained by the division can be aggregated to obtain multiple bit streams to be encoded, and then the bit streams to be encoded can be channel coded, which can improve communication performance.

[0063] FIG3 is a schematic flow chart of a communication method provided in an embodiment of the present application. As shown in FIG3 , the method may include S310 to S330. The method may be performed by the network device and / or terminal device in FIG1 . Alternatively, the method may be performed by the transmitting end in FIG2 , for example, by a channel coding module in the transmitting end in FIG2 .

[0064] S310, dividing M bit streams to be transmitted to obtain N sub-blocks, wherein each of the M bit streams to be transmitted is divided into one or more sub-blocks, M is a positive integer, and N is an integer greater than or equal to M.

[0065] As an example, M may be equal to 1, or M may be an integer greater than 1.

[0066] As an example, each of the M bit streams to be transmitted corresponds to a data block, and all bits in a data block constitute a bit stream, wherein the data block can be a TB or a CB.

[0067] When a bit stream to be transmitted is a TB, the method of this embodiment can implement joint channel coding across TBs. When a bit stream to be transmitted is a CB, the method of this embodiment can implement joint channel coding across CBs.

[0068] As an example, each of the M to-be-transmitted bit streams may correspond to a control channel or control information. For example, a to-be-transmitted bit stream may correspond to a physical downlink control channel (PDCCH) or a physical uplink control channel (PUCCH).

[0069] As an example, the first bit stream to be transmitted from layer 1 can be denoted as “a0, a1, … a k1-1 ", where k1 represents the length of the bit stream to be transmitted, that is, the number of bits contained; the second bit stream to be transmitted from layer 1 can be recorded as "b0, b1, ..., b k2-1 ", where k2 represents the length of the bit stream to be transmitted; ...; the nth bit stream to be transmitted from layer 1 can be recorded as "x0, x1, ..., x kn-1 ", where kn represents the length of the bit stream to be transmitted.

[0070] In this embodiment, M bit streams to be transmitted are divided into N sub-blocks, which can be understood as: each of the M bit streams to be transmitted is divided, each bit stream to be transmitted is divided into one or more sub-blocks, and all sub-blocks obtained by dividing the M bit streams to be transmitted are recorded as N sub-blocks.

[0071] For example, "a0,a1,…a k1-1 " is divided into S1 sub-blocks, and the jth S1 The sub-block is recorded as A jS1 , where j S1={0,1,…,S1}, i.e. j S1 It can be taken from 1 to S1, where S1 is a positive integer; k2-1 " is divided into S2 sub-blocks, and the jth S2 The sub-blocks are recorded as Among them, j S2 ={0,1,…,S2}, i.e. j S2 It can be taken from 1 to S2, where S2 is a positive integer; ...; "x0, x1, ..., x kn-1 " is divided into Sn sub-blocks, and the jth Sn The sub-blocks are recorded as Among them, j Sn ={0,1,…,Sn}, i.e. j Sn It can be from 1 to Sn, where Sn is a positive integer.

[0072] In this embodiment, the sub-blocks obtained by dividing the bit stream to be transmitted include one or more continuous bits in the bit stream to be transmitted.

[0073] If each bit stream to be transmitted is divided into one sub-block, then N is equal to M; if at least one bit stream to be transmitted is divided into multiple sub-blocks, then N is greater than M.

[0074] As an example, the number of sub-blocks obtained by dividing different bit streams to be transmitted in the M bit streams to be transmitted may be the same or different.

[0075] An example in which different bit streams to be transmitted are divided into the same number of sub-blocks is as follows: one bit stream to be transmitted is divided into 3 sub-blocks, and another bit stream to be transmitted is also divided into 3 sub-blocks.

[0076] An example in which different bit streams to be transmitted are divided into different numbers of sub-blocks is as follows: one bit stream to be transmitted is divided into 3 sub-blocks, and another bit stream to be transmitted is divided into 2 sub-blocks.

[0077] When a bit stream to be transmitted is divided into multiple sub-blocks, the lengths of the multiple sub-blocks may be the same or different, that is, the number of bits contained in different sub-blocks in the multiple sub-blocks may be the same or different.

[0078] In this embodiment, an exemplary division method of a bit stream to be transmitted can be one of the following division methods: division according to a fixed number of sub-blocks, division according to a fixed sub-block length, division according to service type, division according to key performance indicators (KPI), division according to priority or division according to routing destination.

[0079] As an example, KPIs may include latency, period, or jitter.

[0080] Dividing according to a fixed number of sub-blocks means that the number of sub-blocks into which a bit stream to be transmitted is divided is predefined and fixed.

[0081] As an example, when dividing according to a fixed number of sub-blocks, a division condition may be preset. For example, if the length of the bit stream to be transmitted is less than Nth, it may be divided into 2 sub-blocks; otherwise, it may be divided into 3 sub-blocks, where Nth is a positive integer.

[0082] Fixed sub-block length division means that the number of bits contained in each sub-block of a transmitted bitstream is predefined and fixed. It is understood that if a transmitted bitstream cannot be evenly divided, meaningless bits can be added to the end of the last sub-block, or the last sub-block can contain fewer bits than the fixed sub-block length.

[0083] For example, a bit stream to be transmitted is divided into two sub-blocks according to the sub-block length. The implementation complexity of dividing according to the sub-block length is relatively low.

[0084] Division by service type refers to dividing bits belonging to the same service type in a bit stream to be transmitted into the same sub-block, that is, the bits contained in the same sub-block belong to the same service type.

[0085] According to the routing destination, bits with the same routing destination in a bit stream to be transmitted are divided into the same sub-block, that is, bits contained in the same sub-block have the same routing destination.

[0086] As an example, when a bit stream to be transmitted is divided according to delay, bits with the same delay are divided into one sub-block, and bits with different delays are divided into different sub-blocks. It can be understood that the delay requirements of all bits in the same sub-block are the same.

[0087] For example, a bit stream to be transmitted is divided into three sub-blocks based on latency. These sub-blocks are denoted as c0, c1, and c2. c0 has the shortest length and the highest latency requirement (i.e., minimum latency), c2 has the longest length and the lowest latency requirement (i.e., maximum latency), and c1 has a length and latency requirement in between. For example, c1 can be bits for voice services, and c2 can be bits for streaming services.

[0088] When dividing sub-blocks according to delay requirements, as an example, bits with a delay requirement lower than Tth are divided into one sub-block, and bits with other delay requirements can be divided into one sub-block, and Tth is greater than 0.

[0089] As another example, when a bit stream to be transmitted is divided according to priority, bits of the same priority are divided into one sub-block, and bits of different priorities are divided into different sub-blocks. It can be understood that all bits in the same sub-block have the same priority.

[0090] For example, a bit stream to be transmitted is divided into three sub-blocks according to priority, which are recorded as D0, D1 and D2 respectively, where D0 has high priority (HP), D1 has middle priority (MP), and D2 has low priority (LP).

[0091] It can be understood that the service type, KPI, priority and routing destination of a bit in this embodiment refers to the service type, KPI, priority and routing destination of the data stream, data block or channel to which the bit belongs.

[0092] In some possible implementations, different bit streams to be transmitted may be divided into sub-blocks in the same or different ways. In one example where different bit streams to be transmitted are divided in the same way, one bit stream to be transmitted is divided according to latency, and the other bit stream to be transmitted is divided according to a fixed number of sub-blocks.

[0093] In this embodiment, when partitioning is performed based on a fixed sub-block length or a fixed number of sub-blocks, it is understood that the relative position of each bit in each sub-block relative to other bits in the sub-block can be the same as the relative position of the bit relative to the other bits in the bitstream to be transmitted. For example, if bit a0 precedes bit a1 in the bitstream to be transmitted, after a0 and a1 are partitioned into the same sub-block, a0 still precedes a1.

[0094] In this embodiment, a bit stream to be transmitted may be divided using one or more division methods. For example, when a bit stream to be transmitted is divided according to priority and routing destination division methods, bits with the same priority and routing destination may be divided into the same sub-block.

[0095] S320 , performing aggregation processing on the N sub-blocks to obtain T bit streams to be coded, each of the T bit streams to be coded includes one or more sub-blocks in the N sub-blocks, and T is a positive integer.

[0096] The aggregation in this embodiment may also be called combination.

[0097] As an example, at least one of the T bit streams to be encoded includes at least two sub-blocks.

[0098] In this embodiment, it is assumed that the sub-block set obtained by division is recorded as {AjS1 ,B jS2 ,…,X jSn}, j S1 ={0,1,…,S1},j S2 ={0,1,…,S2},…,j Sn ={0,1,…,Sn}, then the bit stream to be encoded can be recorded as u0,u1,…u f ={A0,A1,B0}, f=|A0|+|A1|+|B0|, v0,v1,…v f ={A2,A3,X0,X1}, g = |A2|+|A3|+|X0|+|X1|. Among them, “u0,u1,…u f " represents a bit stream to be encoded, "v0,v1,…v f " represents another bit stream to be coded, f and g represent the sub-block aggregation mode, and |.| indicates that the relative position of the bits in the sub-block is the same as the relative position of the bits in the bit stream to be coded.

[0099] In some possible implementations, the N sub-blocks may be aggregated according to a fixed number of sub-blocks. In other words, the number of sub-blocks included in the aggregated bitstream to be coded may be predefined or fixed.

[0100] For example, the number of sub-blocks to be aggregated is predefined as "233". Specifically, the first data stream to be encoded includes two sub-blocks, the second data stream to be encoded includes three sub-blocks, and the third data stream to be encoded includes three sub-blocks.

[0101] It is understood that the relative position relationship of each bit to other bits in the bit stream to be coded can be the same as the relative position relationship of the bit to other bits in the sub-block. For example, bit a0 is located before bit a1 in the sub-block, and bit a0 is located before bit a1 in the bit stream to be coded.

[0102] It is understood that when aggregating a fixed number of sub-blocks, more or fewer bitstreams to be coded can be obtained. For example, when the number of sub-blocks is only 4, only two bitstreams to be coded can be obtained, each containing two sub-blocks. For another example, when the number of sub-blocks is only 6, three bitstreams to be coded can be obtained, each containing two sub-blocks, three sub-blocks, and two sub-blocks. For another example, when the number of sub-blocks is 13, five bitstreams to be coded can be obtained, each containing two sub-blocks, three sub-blocks, three sub-blocks, two sub-blocks, and three sub-blocks.

[0103] FIG4 is a schematic diagram of a communication method provided by an embodiment of the present application. As shown in FIG4, the first bit stream to be transmitted is denoted as a0, a1, ... a k1-1 , the second bit stream to be transmitted is recorded as b0,b1,…,bk2-1 , the third bit stream to be transmitted is recorded as x0,x1,…,x kn-1 .

[0104] As an example, the first bit stream to be transmitted is divided into three sub-blocks, respectively denoted as A0, A1 and A2; the second bit stream to be transmitted is divided into three sub-blocks, respectively denoted as B0, B1 and B2; the third bit stream to be transmitted is divided into two sub-blocks, respectively denoted as X0 and X1.

[0105] The division method of the first bit stream to be transmitted, the second bit stream to be transmitted, and the third bit stream to be transmitted can refer to the content in S310 and will not be repeated here.

[0106] Aggregation is performed according to the predefined number of "233" sub-blocks, where A0 and A1 are aggregated to obtain the first bit stream to be coded, A2, B0 and B1 are aggregated to obtain the second bit stream to be coded, and B2, X0 and X1 are aggregated to obtain the third bit stream to be coded.

[0107] In some examples of this embodiment, the N sub-blocks may be aggregated according to at least one of the following attributes: service type, KPI, priority, or routing destination. Alternatively, sub-blocks with the same attribute may be merged to ultimately obtain T to-be-encoded bitstreams with different attributes.

[0108] In other words, different sub-blocks in each of the T bit streams to be coded obtained after aggregating the N sub-blocks have the same at least one of the following attributes: service type, KPI, priority, or routing destination.

[0109] As an example, when aggregation is performed according to priority, sub-blocks of the same priority are aggregated into one bit stream to be encoded, and sub-blocks of different priorities are aggregated into different bit streams to be encoded.

[0110] As an example, when the KPI is the latency requirement, aggregation according to the latency requirement means aggregating sub-blocks with the same latency into one bit stream to be coded, and aggregating sub-blocks with different latency requirements into different bit streams to be coded.

[0111] For example, aggregation based on the routing destination address aggregates sub-blocks with the same routing address into a single bitstream to be encoded. For example, if A0 and A1 have the same routing destination, they are aggregated to generate the bitstream to be encoded. Similarly, if A2, B0, and B1 have the same destination, these three sub-blocks are aggregated to generate the bitstream to be encoded. If B2, X0, and X1 have the same service KPI, these three bitstreams are aggregated to generate the bitstream to be encoded.

[0112] As an example, when aggregation is performed according to service type, sub-blocks of the same service type are aggregated into one bit stream to be encoded, and sub-blocks of different service types are aggregated into different bit streams to be encoded.

[0113] For example, A0 and B0 both belong to low-latency services, so they can be aggregated together to obtain a bit stream to be encoded; A1 and B1 both belong to voice communication services, so they are aggregated together to form a bit stream to be encoded; A2 and B2 both belong to streaming on-demand services, so they are aggregated together to form a bit stream to be encoded; the remaining two sub-blocks X0 and X1 can be directly aggregated into a bit stream to be encoded, that is, it only contains the sub-blocks of the current bit stream to be transmitted, and does not contain sub-blocks separated from other given bit streams.

[0114] This embodiment can provide higher encoding efficiency in multi-traffic scenarios. For example, two flows with the same routing address but different sources can be aggregated and jointly encoded. Compared with encoding these two flows from different sources separately, the technical solution in this embodiment has higher encoding efficiency. Here, one flow can be understood as one bit stream to be encoded.

[0115] In some implementations of this embodiment, sub-blocks obtained by dividing different bit streams to be transmitted may be interleaved to obtain T bit streams to be encoded.

[0116] As an example, the sub-block interleaving criterion is priority, that is, sub-blocks with the same priority are interleaved together. One form of priority is the "priority index" defined in the existing NR standard. In this way, different transmission protection priorities can be provided for the transmitted bitstream.

[0117] As an example, the criterion for sub-block interleaving is the delay requirement, that is, sub-blocks with the same delay requirement are interleaved together. In this way, transmission protection with different delay requirements can be provided for the bit streams to be transmitted.

[0118] FIG5 is a schematic diagram of another communication method provided by an embodiment of the present application. As shown in FIG5, the first bit stream to be transmitted a0, a1, ... a k1-1 Divided into three sub-blocks according to priority, where sub-block A0 has HP, A1 has MP, and A2 has LP; the second bit stream to be transmitted b0, b1, ..., b k2-1 According to the priority, it is divided into three different sub-blocks, sub-block B0 is HP, B1 is MP, and B2 is LP; the nth bit stream to be transmitted x0, x1, ..., x kn-1 It is divided into two sub-blocks according to priority, sub-block X0 is HP and sub-block X1 is LP.

[0119] When aggregating sub-blocks, sub-blocks of the same priority are interleaved. As shown in Figure 5, A0, B0, and X0 of the HP are interleaved into the HP bit stream to be coded, A1, B1, and X1 of the MP are interleaved into the MP bit stream to be coded, and A2 and B2 of the LP are interleaved into the LP bit stream to be coded.

[0120] In FIG5 , the sub-blocks obtained by division are arranged in descending order of priority, and the aggregated bit streams to be coded are also arranged in descending order of priority. It will be appreciated that this is merely an example. For example, the sub-blocks obtained by division may be arranged in ascending order of priority, and / or the aggregated bit streams to be coded may also be arranged in descending order of priority. It will be appreciated that the channel coding order of the aggregated bit streams to be coded is not necessarily the same as the order in which the bit streams to be coded are arranged.

[0121] In some implementations of this embodiment, when sub-blocks are aggregated, the same sub-block can be aggregated into multiple bitstreams to be coded. That is, multiple bitstreams to be coded can contain the same sub-block. Alternatively, multiple bitstreams to be coded can have overlapping sub-blocks. Alternatively, multiple bitstreams to be coded can overlap.

[0122] As an example, if the overlapping multiple bit streams to be encoded are called a group of overlapping bit streams to be encoded, and the overlapping sub-blocks of the multiple bit streams to be encoded are called overlapping sub-blocks of the group of overlapping bit streams to be encoded, then the overlapping sub-blocks of the multiple groups of overlapping bit streams to be encoded can be the same or different.

[0123] Figure 6 illustrates an example of different overlapping sub-blocks within multiple sets of overlapping bitstreams to be encoded. As shown in Figure 6, one or more bitstreams to be transmitted are divided into six sub-blocks. These six sub-blocks are sequentially labeled A0, A1, A2, A3, A4, and A5, based on the order in which the bits contained in the bitstreams to be transmitted occur.

[0124] As an example, sub-blocks A0 and A1 are aggregated to obtain the first bit stream to be coded, A1 and A2 are aggregated to obtain the second bit stream to be coded, and the overlapping sub-block between the two bit streams to be coded is A1; A2 and A3 are aggregated to obtain the third bit stream to be coded, and the overlapping sub-block between the second bit stream to be coded and the third bit stream to be coded is A2; A3 and A4 are aggregated to obtain the fourth bit stream to be coded, and the overlapping sub-block between the third bit stream to be coded and the fourth bit stream to be coded is A3; A4 and A5 are aggregated to obtain the fifth bit stream to be coded, and the overlapping sub-block between the fourth bit stream to be coded and the fifth bit stream to be coded is A4.

[0125] It will be appreciated that the fact that only one sub-block overlaps between the multiple bitstreams to be coded in FIG6 is merely an example. This embodiment does not limit the number of overlapping sub-blocks, and the number of overlapping sub-blocks may be two or more. For example, two bitstreams to be coded are aggregated, one containing A0, A1, A2, and A3 in sequence, and the other containing A2, A3, A4, and A5 in sequence. The overlapping sub-blocks of the two bitstreams to be coded are A2 and A3.

[0126] It will be appreciated that the overlapping sub-blocks between every two adjacent bitstreams to be coded in FIG6 are merely exemplary, and that only some of the bitstreams to be coded may have overlapping sub-blocks. For example, four bitstreams to be coded are aggregated: the first bitstream to be coded includes A0 and A1 in sequence, the second bitstream to be coded includes A1 and A2 in sequence, the third bitstream to be coded includes A3 and A4 in sequence, and the fourth bitstream to be coded includes A4 and A5 in sequence.

[0127] It will be appreciated that in FIG6 , the overlapping sub-blocks between two adjacent bitstreams to be coded are located at the end of the preceding bitstream to be coded, and the overlapping sub-blocks are located at the end of the preceding bitstream to be coded. This is merely an example, and the overlapping sub-blocks may also be located at other positions. For example, the first bitstream to be coded contains A0 and A1 in sequence, the second bitstream contains A2 and A1 in sequence, and the third bitstream contains A3 and A2 in sequence.

[0128] In this implementation, overlapping and aggregating sub-blocks to generate a bit stream to be coded can improve the link adaptation performance. The same sub-block appears in different bit streams to be coded. If the first bit stream to be coded is decoded incorrectly and the second bit stream to be coded is decoded correctly, the repeated sub-block A1 in the first bit stream to be coded can be eliminated and the first bit stream to be coded can be decoded again. At this time, the bit rate of the first bit stream to be coded is reduced, the decoding accuracy is improved, and the robustness is improved.

[0129] Figure 7 shows an example of overlapping sub-blocks within multiple sets of overlapping bitstreams to be coded. As shown in Figure 7, the first bitstream to be coded consists of sub-blocks A0 and A5, the second bitstream to be coded consists of A1 and A5, the third bitstream to be coded consists of A2 and A5, the fourth bitstream to be coded consists of A3 and A5, and the fifth bitstream to be coded consists of A4 and A5. Each of these bitstreams contains A5, meaning that the overlapping sub-blocks within these five bitstreams are identical: A5.

[0130] In this method, as long as any one of the five bit streams to be coded is decoded correctly, the other bit streams to be coded that are decoded incorrectly can eliminate the repeated sub-block A5. The code rate of the erroneous sub-block after elimination can be reduced, and the accuracy of the re-decoding can be improved, thereby improving the link adaptation performance.

[0131] It can be understood that the overlapping sub-block in FIG7 is the last one among the divided sub-blocks and is only an example. The overlapping sub-block may also be a sub-block at another position, for example, the first sub-block A0 or the middle sub-block A3.

[0132] It can be understood that the overlapping sub-block in FIG7 is only one and is only an example, and there may be multiple overlapping sub-blocks, such as A4 and A5.

[0133] It will be appreciated that the overlapping sub-blocks of all the bitstreams to be coded in FIG7 are the same and are merely exemplary. The overlapping sub-blocks of different groups of bitstreams to be coded may also be different. For example, the first aggregated bitstream to be coded includes A0 and A2, the second aggregated bitstream to be coded includes A1 and A2, the third aggregated bitstream to be coded includes A3 and A5, and the fourth aggregated bitstream to be coded includes A4 and A5.

[0134] S330: Perform channel coding on each of the T bit streams to be coded.

[0135] In this embodiment, the method of performing channel coding on each to-be-coded bit stream may refer to the implementation method of performing channel coding on TB or CB in the prior art, which will not be described in detail here.

[0136] Figure 8 is a schematic flow chart of a communication method according to another embodiment of the present application. As shown in Figure 8 , the method may include S810, S820, S830, S840, and S850. The method may be performed by the network device and / or terminal device in Figure 1 . Alternatively, the method may be performed by the transmitting end in Figure 2 , for example, by a channel coding module in the transmitting end in Figure 2 .

[0137] S810, dividing M bit streams to be transmitted to obtain N sub-blocks, wherein each of the M bit streams to be transmitted is divided into one or more sub-blocks, M is a positive integer, and N is an integer greater than or equal to M.

[0138] This step may refer to S310 and will not be described again here.

[0139] S820, performing cyclic redundancy check (CRC) check code addition processing on the N sub-blocks to obtain N parity sub-blocks corresponding one-to-one to the N sub-blocks, wherein each parity sub-block in the N parity sub-blocks is obtained by adding a CRC check code to a corresponding sub-block in the N sub-blocks.

[0140] As an example, the length of the CRC check code added to each syndrome block is determined by the length of the sub-block corresponding to each syndrome block.

[0141] For example, a mapping relationship between the length range of a sub-block and the length of a CRC check code may be predefined. Thus, the length range to which the length of the sub-block belongs may be determined first, and then the length of the CRC check code may be determined based on the mapping relationship.

[0142] The operation of adding a CRC check code to a sub-block may refer to the operation of adding a CRC check code to a TB or a CB in the prior art.

[0143] S830 , performing aggregation processing on the N syndrome blocks to obtain the T bit streams to be coded, where each of the T bit streams to be coded includes one or more syndrome blocks in the N syndrome blocks.

[0144] This step may refer to S320 , for example, replacing the sub-block in S320 with the check sub-block.

[0145] S840: Perform scrambling code processing on the T bit streams to be coded to obtain T scrambled bit streams to be coded, wherein the T scrambled bit streams to be coded correspond to the T bit streams to be coded one-to-one, and each scrambled bit stream to be coded in the T scrambled bit streams to be coded is obtained by scrambling the corresponding bit stream to be coded.

[0146] The operation of adding a CRC check code to the encoded bit stream may refer to the operation of adding a scrambling code to a TB or a CB in the prior art.

[0147] S850: Perform channel coding on each of the T bit streams to be coded.

[0148] In this method, the CRC check code can provide corresponding error detection functions for sub-blocks from the same or different bit streams to be transmitted. The receiving end can use masks to distinguish the properties of different bit streams to be encoded and support blind detection of the bit streams to be encoded.

[0149] It is understandable that in the embodiment shown in FIG. 8 , S840 may not be included, or S820 may not be included.

[0150] It can be understood that the embodiments shown in FIG. 3 and / or FIG. 8 may also include one or more processing processes of rate matching, resource mapping and multiplexing operations, which will not be described in detail here.

[0151] FIG9 is a schematic diagram of the structure of a communication device according to an embodiment of the present application. As shown in FIG9 , the device 900 may include a processing module 901 and a communication module 902 .

[0152] As a first example, the apparatus 900 can be used to implement the communication method implemented by a communication device in any of the embodiments shown in Figures 3 to 8. For example, the processing module 901 is used to implement the processing-related steps performed by the communication device in any of the embodiments shown in Figures 3 to 8, and the communication module 902 is used to implement the sending and / or receiving steps performed by the communication device in any of the embodiments shown in Figures 3 to 8.

[0153] Figure 10 is a schematic diagram of the structure of a communication device provided in another embodiment of the present application. As shown in Figure 10, the device 1000 includes a processor 1001 and a communication circuit 1002. The processor 1001 and the communication circuit 1002 are coupled to each other. It is understood that the communication circuit 1002 can be a transceiver or an input / output interface. Optionally, the device 1000 may further include a memory 1003 for storing instructions executed by the processor 1001 or storing input data required by the processor 1001 to run the instructions or storing data generated after the processor 1001 runs the instructions. It is understood that the memory 1003 can be located outside the processor 1001, or inside the processor 1001.

[0154] As an example, the processor 1001 is used to implement the functions of the processing module 901 , and the communication circuit 1002 is used to implement the functions of the communication module 902 .

[0155] Apparatus 1000 may be a communication device or a chip used in a communication device. For example, apparatus 1000 may be a communication device or a device, module, circuit, or chip used in a communication device. It is understood that when apparatus 1000 is a communication device, communication circuit 1002 may be a transceiver.

[0156] Some embodiments of the present application also provide a computer program product, which, when running on a processor, can implement the method implemented by the communication device in any of the above embodiments.

[0157] Some embodiments of the present application also provide a computer-readable storage medium, which includes computer instructions. When the computer instructions are executed on a processor, the method implemented by the communication device in any of the above embodiments can be implemented.

[0158] It is understood that the processor in the embodiments of the present application can be the following devices or all or part of the circuits in the following devices for processing functions: a central processing unit (CPU), and can also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. The general-purpose processor can be a microprocessor or any conventional processor.

[0159] The method steps in the embodiments of the present application can be implemented by hardware or by a processor executing software instructions. The software instructions can be composed of corresponding software modules, and the software modules can be stored in a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an erasable programmable read-only memory, an electrically erasable programmable read-only memory, a register, a hard disk, a mobile hard disk, a CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in a network device or a terminal device. Of course, the processor and the storage medium can also be present in a network device or a terminal device as discrete components.

[0160] In the above embodiments, all or part of the embodiments may be implemented using software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are performed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable device. The computer program or instructions may be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions may be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; an optical medium, such as a digital video disk; or a semiconductor medium, such as a solid-state drive.

[0161] In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0162] It is understood that the various numbers used in the embodiments of this application are merely for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not necessarily imply a specific order of execution; the order of execution of the processes should be determined by their functions and inherent logic.

Claims

1. A communication method, characterized in that: Applied to a communication device, the method comprises: Dividing M bit streams to be transmitted to obtain N sub-blocks, wherein each of the M bit streams to be transmitted is divided into one or more sub-blocks, M is a positive integer, and N is an integer greater than or equal to M; Aggregating the N sub-blocks to obtain T bit streams to be encoded, each of the T bit streams to be encoded includes one or more sub-blocks in the N sub-blocks, and T is a positive integer; Channel coding is performed on each of the T bit streams to be encoded.

2. The method according to claim 1, characterized in that The number of sub-blocks obtained by dividing each to-be-transmitted bit stream is predefined.

3. The method according to claim 1, characterized in that The length of each sub-block obtained by dividing the bit stream to be transmitted is predefined.

4. The method according to claim 1, characterized in that: In the N sub-blocks, at least one of the following attributes of all bits in the same sub-block is the same: service type, key performance indicator KPI, priority, or routing destination.

5. The method according to claim 4, characterized in that Among the T bit streams to be encoded, all bits in the same bit stream to be encoded have the same at least one attribute.

6. The method according to any one of claims 1 to 4, characterized in that The aggregating the N sub-blocks to obtain T bit streams to be encoded includes: Interleaving is performed on the sub-blocks obtained by dividing the N sub-blocks by different bits to be transmitted to obtain the T bit streams to be encoded.

7. The method according to any one of claims 1 to 4, characterized in that T is greater than or equal to 2, a first bit stream to be encoded among the T bit streams to be encoded includes a first sub-block among the N sub-blocks, and a second bit stream to be encoded among the T bit streams to be encoded includes the first sub-block.

8. The method according to claim 7, characterized in that T is greater than or equal to 3, and each of the T bit streams to be encoded includes the first sub-block.

9. The method according to any one of claims 1 to 8, characterized in that The aggregating the N sub-blocks to obtain T bit streams to be encoded, each of the T bit streams to be encoded containing one or more sub-blocks in the N sub-blocks, includes: Performing CRC check code addition processing on the N sub-blocks to obtain N check sub-blocks corresponding to the N sub-blocks one by one, wherein each check sub-block in the N check sub-blocks is obtained by adding a CRC check code to a corresponding sub-block in the N sub-blocks; Aggregation processing is performed on the N syndrome blocks to obtain the T bit streams to be encoded, and each of the T bit streams to be encoded contains one or more syndrome blocks in the N syndrome blocks.

10. The method according to claim 9, characterized in that The length of the CRC check code added to each syndrome block is determined by the length of the sub-block corresponding to each syndrome block.

11. The method according to any one of claims 1 to 10, characterized in that The M bit streams to be transmitted correspond one-to-one to the M data blocks, each of the M bit streams to be transmitted includes a bit stream in a corresponding data block, and the database is a transmission block TB or a code block CB.

12. The method according to any one of claims 1 to 9, characterized in that The M bit streams to be transmitted correspond to the M control information one by one, and each of the M bit streams to be transmitted includes a bit stream in the corresponding control information.

13. A communication device, characterized in that: The method comprises a functional module for implementing the method according to any one of claims 1 to 12.

14. A communication device, characterized in that: include: Memory and processor; The memory is used to store program instructions; The processor is configured to execute program instructions in the memory to implement the method according to any one of claims 1 to 12.

15. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a program code for computer execution, wherein the program code includes instructions for implementing the method according to any one of claims 1 to 12.

16. A computer program product, characterized in that The computer program product comprises instructions for implementing the communication method according to any one of claims 1 to 12.

Images