Encoding and modulation method and related apparatus

Abstract

The present application provides an encoding and modulation method and a related apparatus. The method comprises: using the bit rates respectively corresponding to N input bit sequences to encode the N input bit sequences to obtain N encoded bit sequences respectively corresponding to the N input bit sequences, wherein the length of the input bit sequences is determined on the basis of at least one of the bit rates, the modulation order or the number of resource elements (REs) used for data transmission corresponding to the input bit sequences; and mapping the N encoded bit sequences onto the same constellation diagram, wherein the constellation diagram comprises M constellation points, each constellation point comprises N segmented bits, and the N segmented bits respectively correspond to the N encoded bit sequences. The process reduces the encoding complexity of a sending end while guaranteeing the transmission efficiency, and also reduces the protocol modification degree, thereby reducing the encoding implementation cost.

Description

Coding modulation method and related device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on February 5, 2024, with application number 202410168578.1 and invention name “Coding Modulation Method and Related Devices”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of channel coding, and in particular to a coding modulation method and related devices. Background Art

[0003] Channel coding is one of the most core technologies in wireless communications. The channel coding process can include adding cyclic redundancy check (CRC) codes, block segmentation, error correction coding, rate adaptation, block concatenation, data interleaving, and data scrambling. Error correction coding is the most critical component. Its purpose is to ensure that errors occurring during data transmission can be automatically corrected by the receiver using minimal redundancy overhead. For a given bit error rate (BER), the lower the overhead required, the higher the coding efficiency. Traditional channel coding and decoding generally include linear block codes (such as Hamming codes, Gray codes, Bose–Chaudhuri–Hocquenghem (BCH) codes, and Reed–Solomon (RS) codes), convolutional codes, and concatenated codes. These codes have different characteristics and performance, making them suitable for different scenarios.

[0004] In 3G and 4G mobile communication systems, turbo codes, a convolutional codec defined by the 3rd Generation Partnership Project (3GPP) standards, offer excellent performance, approaching the Shannon limit. The 5G era has also seen the emergence of a wider range of service applications and new requirements for channel coding. Therefore, based on the key channel coding requirements of the three major 5G application scenarios, the 5G standard ultimately adopted low-density parity check (LDPC) codes and polar codes. With the advent of 6G, real-time, high-data-rate applications such as extended reality (XR), mixed reality (MR), and immersive services are emerging commercially. These emerging services place higher demands on peak throughput and area efficiency for codecs, with peak rates reaching even terabits per second. At the same time, decoder power consumption must be further reduced. Therefore, chip channel coding and decoding require technological breakthroughs in two key areas: high-throughput, low-power coding and decoding, and high-reliability coding and decoding. These breakthroughs can be achieved through new coding designs and low-complexity decoding designs to achieve the goals of future standards.

[0005] In the existing technology, how to achieve high-throughput and low-power encoding and decoding processes on the encoding side by more fully utilizing the video resources allocated to data transmission, while taking into account smaller protocol changes, is an urgent problem to be solved. Summary of the Invention

[0006] The embodiments of the present application provide a coding modulation method and related devices, which ensure data transmission efficiency by matching N input bit sequences with their allocated time-frequency resources, while reducing the coding complexity at the sending end, reducing the degree of protocol modification, and thereby reducing the coding implementation cost.

[0007] In a first aspect, the present application provides a coding and modulation method, which is applied to a first device. The first device can be a network device or a chip that can be applied to a network device, or a terminal device or a chip that can be applied to a terminal device. The method includes: encoding N input bit sequences using code rates corresponding to the N input bit sequences, to obtain N coded bit sequences corresponding to the N input bit sequences, where N is an integer greater than or equal to 2; the length of each input bit sequence is determined based on relevant information of the input bit sequence, and the relevant information of the input bit sequence includes at least one of the code rate, modulation order, or number of resource elements RE used for data transmission corresponding to the input bit sequence; mapping the N coded bit sequences to the same constellation diagram, where the constellation diagram includes M constellation points, each constellation point includes N segmented bits, and the N segmented bits correspond to the N coded bit sequences, where M is an integer greater than or equal to 1.

[0008] In an embodiment of the present application, N input bit sequences are encoded according to their respective code rates to obtain N coded bit sequences, and the N coded bit sequences are mapped to different segmented bits of the constellation points in the constellation diagram, thereby ensuring that the N input bit sequences are transmitted data according to the protection capability of each segmented bit in the N segmented bits of the constellation points.

[0009] Furthermore, the length of each input bit sequence is determined based on the relevant information of the input bit sequence, so that the encoded bit sequence of the input bit sequence can correspond to the allocated time-frequency resources. This ensures data transmission efficiency while reducing coding complexity at the transmitter. Furthermore, the degree of protocol modification can be reduced, thereby reducing the cost of coding implementation.

[0010] In some possible implementations, the method further includes: determining relevant information of the input bit sequence.

[0011] In some possible implementations, the relevant information of the input bit sequence corresponds to one or more correspondence sets, and the correspondence set includes at least one set of correspondences between the modulation and coding strategy MCS index and the modulation order and / or code rate of the input bit sequence.

[0012] In some possible implementations, determining relevant information of the input bit sequence includes: obtaining a modulation and coding strategy MCS index and the number of REs, and determining the modulation order and / or code rate of the input bit sequence according to the MCS index and the corresponding relationship set.

[0013] Optionally, the relevant information of the input bit sequence is carried in high-layer signaling or downlink control information DCI.

[0014] In a possible implementation, the DCI includes an MCS index indication field, and the MCS index indication field is used to indicate the modulation order and / or code rate of the input bit sequence.

[0015] In an embodiment of the present application, a set of corresponding relationships between a modulation and coding scheme (MCS) index and the modulation order and code rate of a TB is included, and the coding side can determine the modulation order and code rate of the input bit sequence through the received MCS index. On the one hand, assuming that the MCS index indication field corresponds to an existing field in the DCI, the existing MCS index can be fully utilized, the newly added fields in the DCI can be reduced, and the signaling overhead can be saved. On the other hand, assuming that the MCS index indication field is a newly added field, the flexibility of the MCS index setting can be increased, the semantic changes to the existing fields in the DCI can be reduced, and the implementation complexity can be reduced. On the other hand, assuming that the MCS index is a combination of an existing field and a newly added field, it can include the advantages of both of the aforementioned fields at the same time, and increase the flexibility of the DCI sending MCS index while reducing the signaling overhead.

[0016] In some possible implementations, each of the N input bit sequences is segmented into code blocks to obtain a corresponding number of code blocks CB; wherein the N input bit sequences include a reference bit sequence and other bit sequences except the reference bit sequence, and the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequences is determined based on a maximum code block constraint value and a specific constant; or the maximum length of the encoded bit sequence corresponding to the CB of the other input bit sequences is determined based on a maximum code block constraint value and a specific ratio, and the specific ratio is determined based on the ratio of the lengths of the other bit sequences and the reference bit sequence.

[0017] In an embodiment of the present application, by adjusting or determining the maximum length of the encoded bit sequence of the CB corresponding to other bit sequences, the difference between the encoded bit sequence length of the CB corresponding to the other bit sequences and the encoded bit sequence length of the CB of the test bit sequence is reduced, thereby reducing the delay of the CB of different TBs reaching the receiving end, improving the decoding efficiency of the receiving end or improving the decoding throughput.

[0018] In some possible implementations, the lengths of encoded bit sequences corresponding to CBs of different input bit sequences in the N input bit sequences are the same, or the numbers of CBs corresponding to different input bit sequences are the same.

[0019] In the embodiment of the present application, by aligning the number of CBs of different input bit sequences, the granularity of time-frequency resource alignment of different input bit sequences is made finer, the decoding waiting delay is lowered, and the complexity of protocol modification is greatly reduced.

[0020] In some possible implementations, the method also includes: determining the maximum length of the encoded bit sequence corresponding to the CB of the N input bit sequences, including determining the maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence among the N input bit sequences, and the maximum length of the encoded bit sequence corresponding to the CB of other bit sequences.

[0021] In some possible implementations, determining the maximum length of a coded bit sequence corresponding to the CB of the reference bit sequence includes:

[0022] The maximum length of the encoded bit sequence corresponding to the reference bit sequence CB is determined based on the maximum code block constraint value.

[0023] In some possible implementations, determining the maximum length of the encoded bit sequence corresponding to the CB of other bit sequences includes: determining code block related information, and determining the maximum length of other bit sequences based on the code block related information; the code block related information includes a maximum code block constraint value, and also includes at least one of the following: a specific constant, or a specific ratio.

[0024] In some possible implementations, the method further includes: outputting a bit sequence mapped to the same constellation diagram.

[0025] In a second aspect, the present application provides a decoding method, which is applied to a second device. The second device may be a network device or a chip applicable to a network device, or a terminal device or a chip applicable to a terminal device. The method includes: receiving first data, wherein the N segmented bit sequences in the constellation diagram corresponding to the first data respectively correspond to N pre-decoding bit sequences, and the lengths of the N output bit sequences corresponding to the N pre-decoding bit sequences are determined based on relevant information of the output bit sequences, and the relevant information of the output bit sequences includes a code rate, a modulation order, and a number of resource elements RE for data transmission;

[0026] The first data is processed; wherein the processing includes demapping N segmented bits of the constellation point in the constellation diagram into N pre-decoding bit sequences, and decoding the N pre-decoding bit sequences according to the lengths of the N output bit sequences.

[0027] In a third aspect, the present application provides a coding modulation apparatus, the apparatus comprising:

[0028] an encoding unit, encoding N input bit sequences using code rates corresponding to the N input bit sequences respectively, to obtain N encoded bit sequences corresponding to the N input bit sequences respectively, where N is an integer greater than or equal to 2; the length of each input bit sequence is determined based on relevant information of the input bit sequence, where the relevant information of the input bit sequence includes at least one of a code rate, a modulation order, or a number of resource elements (RE) used for data transmission corresponding to the input bit sequence; and a modulation unit, mapping the N encoded bit sequences onto the same constellation diagram, where the constellation diagram includes M constellation points, each constellation point includes N segment bits, and the N segment bits correspond to the N encoded bit sequences respectively, where M is an integer greater than or equal to 1.

[0029] In some possible implementations, the encoding unit is further configured to: determine relevant information of the input bit sequence.

[0030] In some possible implementations, the relevant information of the input bit sequence corresponds to one or more correspondence sets, and the correspondence set includes at least one set of correspondences between the modulation and coding strategy MCS index and the modulation order and / or code rate of the input bit sequence.

[0031] In some possible implementations, determining relevant information of the input bit sequence includes: obtaining a modulation and coding strategy MCS index and the number of REs, and determining the modulation order and / or code rate of the input bit sequence according to the MCS index and the corresponding relationship set.

[0032] In some possible implementations, the relevant information of the input bit sequence is carried in higher layer signaling or downlink control information DCI.

[0033] In some possible implementations, each of the N input bit sequences is segmented into code blocks to obtain a corresponding number of code blocks CB; wherein the N input bit sequences include a reference bit sequence and other bit sequences except the reference bit sequence, and the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequences is determined based on a maximum code block constraint value and a specific constant; or the maximum length of the encoded bit sequence corresponding to the CB of the other input bit sequences is determined based on a maximum code block constraint value and a specific ratio, and the specific ratio is determined based on the ratio of the lengths of the other bit sequences and the reference bit sequence.

[0034] In some possible implementations, the lengths of encoded bit sequences corresponding to CBs of different input bit sequences in the N input bit sequences are the same, or the numbers of CBs corresponding to different input bit sequences are the same.

[0035] In some possible implementations, the encoding unit is further used to: determine the maximum length of the encoded bit sequence corresponding to the CB of the N input bit sequences, including determining the maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence among the N input bit sequences, and the maximum length of the encoded bit sequence corresponding to the CB of other bit sequences.

[0036] In some possible implementations, the encoding unit is specifically configured to determine, based on a maximum code block constraint value, a maximum length of a coded bit sequence corresponding to the reference bit sequence CB.

[0037] In some possible implementations, the encoding unit is specifically used to: determine code block related information, and determine the maximum length of other bit sequences based on the code block related information; the code block related information includes a maximum code block constraint value, and also includes at least one of the following: a specific constant, or a specific ratio.

[0038] In some possible implementations, the coding and modulation apparatus further includes an output unit configured to output a bit sequence mapped onto the same constellation diagram.

[0039] In a fourth aspect, the present application provides a decoding and demodulation device, comprising:

[0040] The transceiver unit receives first data, where N segmented bit sequences corresponding to the first data in the constellation diagram respectively correspond to N pre-decoding bit sequences; the lengths of N output bit sequences corresponding to the N pre-decoding bit sequences are determined based on relevant information of the output bit sequences, where the relevant information of the output bit sequences includes a code rate, a modulation order, and a number of resource elements (REs) for data transmission;

[0041] The decoding and demodulation unit processes the first data; wherein the processing includes demapping N segmented bits of the constellation point in the constellation diagram into N pre-decoding bit sequences, and decoding the N pre-decoding bit sequences according to the lengths of the N output bit sequences.

[0042] In a fifth aspect, the present application provides an electronic device comprising a processor coupled to a memory, wherein when the processor executes a computer program or instruction in the memory, the method of any embodiment of the first aspect is executed, or the method of any embodiment of the second aspect is executed.

[0043] Optionally, the device further comprises a memory.

[0044] Optionally, the device further includes a communication interface, and the processor is coupled to the communication interface.

[0045] Optionally, there are one or more processors and one or more memories.

[0046] Optionally, the memory may be integrated with the processor, or the memory may be provided separately from the processor.

[0047] Optionally, the transceiver may include a transmitter (transmitter) and a receiver (receiver).

[0048] In one implementation, the communication device is a terminal device or a network device. When the communication device is a terminal device or a network device, the communication interface may be a transceiver or an input / output interface. Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input / output interface may be an input / output circuit.

[0049] In another implementation, the communication device is a chip or a chip system. When the device is a chip or a chip system, the communication interface can be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip or chip system. The processor can also be embodied as a processing circuit or a logic circuit.

[0050] In a sixth aspect, the present application provides a computer program product, which includes: a computer program (also referred to as code, or instructions), which, when executed, enables a computer to execute a method in any possible implementation of the first aspect above.

[0051] In a seventh aspect, the present application provides a computer-readable storage medium, which stores a computer program (also referred to as code, or instructions) which, when run on a computer, enables the computer to execute the method in any possible implementation of the first aspect above.

[0052] In an eighth aspect, the present application further provides a circuit comprising: a processor and an interface for executing a computer program or instruction stored in a memory, and executing a method in any possible implementation of the first aspect above.

[0053] In a ninth aspect, the present application also provides a system comprising the apparatus of the third aspect and / or the fourth aspect above. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] FIG1 is a schematic diagram of an application scenario provided by an embodiment of the present application;

[0055] FIG2A is a schematic diagram of a transmitting end and a receiving end of a layered coding modulation according to an embodiment of the present application;

[0056] FIG2B is a schematic diagram of a 16QAM constellation diagram provided in an embodiment of the present application;

[0057] FIG3A is a flowchart of a coding modulation method provided in an embodiment of the present application;

[0058] FIG3B is a schematic diagram of a relationship between different TB lengths provided in an embodiment of the present application;

[0059] FIG3C is a schematic diagram of time-frequency resources of different layers after hierarchical modulation provided by an embodiment of the present application;

[0060] FIG4A is a block diagram of a layered coding modulation process provided by an embodiment of the present application;

[0061] FIG4B is a schematic diagram of time-frequency resources of different layers after another layered modulation according to an embodiment of the present application;

[0062] FIG5 is a schematic structural diagram of a coding modulation apparatus provided in an embodiment of the present application;

[0063] FIG6 is a schematic structural diagram of a decoding and demodulation device provided in an embodiment of the present application;

[0064] FIG7 is a schematic diagram of the hardware structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0065] The embodiments of the present invention are described below with reference to the accompanying drawings.

[0066] The terms "first," "second," "third," and "fourth," etc., in the specification and claims of this application and the accompanying drawings are used to distinguish between different objects, rather than to describe a specific order. In addition, the terms "including," "having," and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus comprising a series of steps or elements is not limited to the listed steps or elements, but may optionally include steps or elements not listed, or may optionally include other steps or elements inherent to the process, method, product, or apparatus.

[0067] References herein to "embodiments" mean that a particular feature, structure, or characteristic described in connection with the embodiments may be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor does it constitute an independent or alternative embodiment that is mutually exclusive of other embodiments. It is understood, both explicitly and implicitly, by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0068] First, the application scenarios corresponding to the embodiments of the present application are introduced.

[0069] Please refer to Figure 1, which is a schematic diagram of an application scenario provided by an embodiment of the present application. As shown in Figure 1, the embodiment of the present application can be applied to various mobile communication scenarios, such as multi-hop / multi-relay (node) transmission between a base station and user equipment (UE), between a base station and a UE, dual connectivity (DC) between multiple base stations and UEs, or multi-connectivity between a UE and multiple relays.

[0070] The following is a brief introduction to the terms involved in this embodiment.

[0071] In a wireless communication system, communication devices are included, and wireless communication between these devices can be performed using air interface resources. These communication devices may include network devices and terminal devices, and network devices may also be referred to as base station devices. Air interface resources may include at least one of time domain resources, frequency domain resources, code resources, and space resources. In the embodiments of this application, "at least one" may also be described as one or more, and "multiple" may be two, three, four, or more, without limitation in this application.

[0072] In the embodiments of the present application, for a technical feature, the technical features in the technical feature are distinguished by "first", "second", "third", "A", "B", "C" and "D", and there is no order of precedence or size between the technical features described by "first", "second", "third", "A", "B", "C" and "D".

[0073] The terminal device involved in the embodiments of the present application can also be called a terminal, which can be a device with wireless transceiver function, which can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it can also be deployed on the water surface (such as ships, etc.); it can also be deployed in the air (for example, on airplanes, balloons and satellites, etc.). The terminal device can be user equipment (UE), wherein the UE includes a handheld device, a vehicle-mounted device, a wearable device or a computing device with wireless communication function. For example, the UE can be a mobile phone, a tablet computer or a computer with wireless transceiver function. The terminal device can also be a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in smart grid, a wireless terminal in smart city, a wireless terminal in smart home, etc. In the embodiments of the present application, the device for realizing the function of the terminal can be a terminal; it can also be a device that can support the terminal to realize the function, such as a chip system, which can be installed in the terminal. In the embodiment of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices. In the technical solution provided in the embodiment of the present application, the device for implementing the functions of the terminal is a terminal, and the terminal is a UE as an example to describe the technical solution provided in the embodiment of the present application.

[0074] The network devices involved in the embodiments of the present application include access network devices, such as base stations (BS). The BS can be a device deployed in a wireless access network that can communicate wirelessly with a terminal. Among them, the base station may have various forms, such as a macro base station, a micro base station, a relay station, and an access point. Among them, the base station can also be called a transmission reception point (TRP). In the embodiments of the present application, the device for realizing the function of the network device can be a network device; it can also be a device that can support the network device to realize the function, such as a chip system, which can be installed in the network device. In the technical solution provided in the embodiments of the present application, the technical solution provided in the embodiments of the present application is described by taking the device for realizing the function of the network device as a network device and the network device as a base station as an example.

[0075] The technical solutions provided in the embodiments of the present application can be applied to channel coding / decoding between communication devices. Channel coding / decoding between communication devices may include: channel coding / decoding between a network device and a terminal, channel coding / decoding between network devices, and channel coding / decoding between terminals. In the embodiments of the present application, channel coding and decoding are referred to as coding and decoding, and the coding structure can be referred to as code type. Code design, coding structure includes cascade structure, layered structure, coupled structure, inner and outer code structure, ladder structure, sliding window structure, etc.

[0076] As shown in FIG2A, it is a schematic diagram of an implementation method of LDPC layered coding modulation and decoding (also called decoding) provided in an embodiment of the present application. At the transmitting end (or encoding end), the input bit sequence S1 to S2 shown in FIG2A m It is layered encoded. Each input bit sequence is input into a different quasi-cyclic low density parity check (QC-LDPC) component encoder (encoder 1 to encoder m in the figure) for encoding. The codewords corresponding to the encoded different input bit sequences are mapped to different segmented special segments of the constellation points in the constellation diagram, completing the modulation process from the bit sequence to the symbol (corresponding to the modulation mapper stage in the figure) to obtain the modulated signal. The modulated signal is then further processed to obtain the RF signal and transmitted through the optical fiber channel. The receiving end (or decoding end) receives the RF signal and can input it into multiple calculation units (calculator, corresponding to Cal.1 to Cal.m) of the bit log likelihood ratio (LLR) for processing, and then input them into the QC-LDPC decoder (decoder 1 to decoder m in the figure) for iterative decoding. The decoded segmented bit sequence is obtained. It is understood that the above layered coding can also be called hierarchical coding, and the present embodiment does not limit the name. In addition, FIG2A above uses LDPC as an example, and layered coding and modulation can also be applied to other coding methods.

[0077] Thus, at the transmitting end, the input bit sequence can be coded and modulated in layers, i.e., layered coding and modulation, wherein each input bit sequence can be referred to as a layer.

[0078] For the modulation process of the layered coded bit sequence, see Figure 2B , which is a schematic diagram of a 16QAM constellation diagram provided in an embodiment of the present application. As shown in Figure 2B , 16-quadrature amplitude modulation (QAM) maps the digital signal (the layered coded bit sequence) into 16 complex symbols (constellation points), each represented by 4 bits. Adjacent constellation points only vary by 1 bit, which corresponds to the constellation diagram, as constellation points with the same first two bits are located in the same quadrant.

[0079] For example, for each constellation point, the first two bits may correspond to a quadrature phase-shift keying (QPSK), and the second two bits may correspond to another QPSK. A QPSK may correspond to an I-path (signal) or a Q-path (signal).

[0080] Therefore, 16QAM can be split into the first two bits and the last two bits. When the last two bits are identical, the distance between the adjacent first two bits in the constellation diagram is large (corresponding to distance 1 in the diagram), and the possibility of interference between the two signals is low, that is, transmission reliability is high. When the first two bits are identical, the distance between the adjacent last two bits in the constellation diagram is small (corresponding to distance 2 in the diagram), and the possibility of interference between the two signals is high, that is, transmission reliability is low. Therefore, the coded bits mapped to the first two bits can use a higher code rate, while the coded bits mapped to the last two bits can use a relatively low code rate. This allows the receiving end to use coding gain to counteract the effects of the wireless channel, etc. In other words, the layered modulation in the case of 16QAM can be shown in Figure 2B. The layered coded bit sequence can be mapped to the first two bits of the constellation diagram to achieve symbol modulation of layer 1, or the layered coded bit sequence can be mapped to the last two bits of the constellation diagram to achieve symbol modulation of layer 2. Here, layer 1 can correspond to a coded bit sequence with a higher code rate than layer 2. It is understandable that in the case of 16QAM, it can also be 3-layer layered coding, or layered coding of other numbers of layers, which is not limited in the embodiments of the present application.

[0081] For example, using layered coded modulation (256QAM), the constellation points include 8 bits. Layered coding can be implemented using three component encoders: Layer 1, Layer 2, and Layer 3. The layered coded bit sequence can then be mapped to the first two bits of the constellation diagram to implement symbol modulation for Layer 1, the middle two bits of the constellation diagram to implement symbol modulation for Layer 2, and the last four bits of the constellation diagram to implement symbol modulation for Layer 3. The code rates of the coded bit sequences corresponding to Layers 1, 2, and 3 decrease in sequence, or the code rates for Layers 1 and 2 are the same, while the code rate for Layer 3 is lower. It is understood that the number of bits mapped to constellation points by coded bit sequences of different layers can be the same or different. The code rates of different layers can be the same or different. It is understood that 256QAM can also employ two-layer layered coding, or layered coding with another number of layers, which is not limited in this embodiment of the present application.

[0082] In the above-mentioned layered coding and modulation process, the layer using higher code rate coding can be called the lower layer, and the layer using lower code rate coding can be called the upper layer. Then, layer 1 in Figure 2B can correspond to the lower layer (symbol modulation), and layer 2 corresponds to the upper layer. As a result of layered coding and modulation, the decoding complexity of the upper layer bits is higher than that of the lower layer bits (the high code rate generates fewer check bits and requires less decoding calculations). Therefore, the architecture of layered coding combined with layered modulation can reduce the overall decoding complexity and improve the decoding peak throughput of the receiving end compared to the traditional architecture of decoupling coding and modulation. It can be understood that the layer using higher code rate coding can also be called the upper layer, and the layer using lower code rate coding can be called the lower layer. The embodiments of this application do not limit the names. The following description adopts the method of using the layer using higher code rate coding to correspond to the lower layer, and the layer using lower code rate coding to correspond to the upper layer. A layer encoded at a higher bit rate may be equivalent to a layer with a higher bit rate, and a layer encoded at a lower bit rate may be equivalent to a layer with a lower bit rate. For the convenience of description, some of the following content may be mixed.

[0083] In a wireless channel environment, due to the influence of large-scale fading, small-scale fading, interference, etc., the signal-to-noise ratio at the receiving end usually fluctuates significantly over time. Therefore, channel coding can adjust the coding rate and modulation order according to the channel conditions. The channel conditions can be matched by matching code rate adaptation technology, so that layered coding technology can be applied to wireless communications. Referring to Figure 3A, a flowchart of a coding and modulation method provided in an embodiment of the present application is shown in Figure 3A. The method may include the following steps:

[0084] 201. A first device encodes N input bit sequences using code rates corresponding to the N input bit sequences to obtain N encoded bit sequences corresponding to the N input bit sequences, where N is an integer greater than or equal to 2.

[0085] Among them, in some possible implementations, the length of each input bit sequence can be determined based on relevant information of the input bit sequence, and the relevant information of the input bit sequence includes at least one of the code rate, modulation order, or number of resource elements RE used for data transmission corresponding to the input bit sequence. It is understandable that the length of the input bit sequence can also be determined in combination with other information, which is not limited in the embodiments of the present application. Each of the above-mentioned input bit sequences can also be called a per-layer input bit sequence. The above-mentioned input bit sequence can also be called a bit sequence.

[0086] Optionally, the total length of the N input bit sequences may be determined first, and then the length of each of the N input bit sequences may be determined based on the code rate corresponding to the N input bit sequences. The total length of the N input bit sequences may be determined based on the code rate, the modulation order, and the number of resource elements (REs) used for data transmission.

[0087] 202. The first device maps the N encoded bit sequences to the same constellation diagram, where the constellation diagram includes M constellation points, each constellation point includes N segmented bits, and the N segmented bits correspond to the N encoded bit sequences respectively, where M is an integer greater than or equal to 1.

[0088] The first device in this embodiment is a device that performs information encoding. Specifically, it can be a network device, UE, or other encoding-capable network element, such as a chip applicable to a network device, or a chip applicable to a terminal device. The input bit sequence refers to the input bit sequence before encoding. Optionally, the encoding performed on the input bit sequence can be cyclical redundancy check (CRC) encoding (filling CRC bits) or other encoding (error correction encoding). CRC encoding can also be combined with other encodings.

[0089] The code rate may also be referred to as the coding rate, which refers to the ratio of the useful part (non-redundant) in the encoded bit sequence.

[0090] In one possible implementation, the N input bit sequences are encoded using corresponding code rates, which can be understood as layered coding or hierarchical coding. That is, each input bit sequence can be considered to correspond to a layer of coding, and each input bit sequence has its own corresponding layer. Optionally, each input bit sequence can be encoded by a corresponding encoder, and the encoders at each layer can be referred to as component encoders.

[0091] In one possible implementation, each input bit sequence may be understood as a transport block (TB). For ease of description, some of the following content may mix input bit sequences and TBs.

[0092] The length of each TB can be related to at least one of the code rate, modulation order, or number of REs corresponding to data transmission corresponding to the TB (or the layer corresponding to the TB), and they are all positively correlated, that is, the larger any one of the parameters of code rate, modulation order, or number of REs is, the larger the TB is.

[0093] (1) The relevant information for TB is an example of any one of the code rate, modulation order, or number of REs.

[0094] a. Assume that the total length of the bit sequence before encoding is fixed, for example, D, and needs to be divided into N TBs. The modulation order and number of REs in each of the N TBs are fixed values ​​specified by the protocol. The length of each TB is then determined according to the following formula (a):

[0095] Among them D i Indicates the length of the i-th TB in N TBs, R i represents the code rate of the i-th TB. In other words, the length of each TB is determined according to its corresponding code rate.

[0096] b. Similarly, assuming that the total length of the bit sequence before encoding is D, where the code rate and the number of REs are fixed, the length of each TB is determined by its corresponding modulation order, specifically according to the following formula (b):

[0097] where Q m-i Indicates the modulation order of the i-th TB.

[0098] c. Assuming that the total length of the bit sequence before encoding is D, where the code rate and modulation order are fixed values, the length of each TB is determined by the number of REs corresponding to it, specifically according to the following formula (c):

[0099] Among them, RE i Indicates the number of REs in the i-th TB.

[0100] (2) The relevant information for TB includes any two of the code rate, modulation order, or number of REs.

[0101] Similar to the case where the relevant information of TB includes any one of the code rate, modulation order, or number of REs, assuming that the total length of the bit sequence before encoding is known (or can be obtained) and one of these three parameters is a fixed value, the relevant information of TB can be the other two.

[0102] (3) The relevant information for TB includes the code rate, modulation order, and number of REs.

[0103] For example, the length of TB can satisfy the following formula (1-1):

[0104] N info =N RE-i ·R i Q m-i ·υ i

[0105] where N info Indicates the length of TB, also known as the size of TB (transport block size, TBS), N RE-i Indicates the number of REs used for data transmission in layer i. For downlink transmission, N RE-i Indicates the number of REs allocated for the physical downlink shared channel (PDSCH) in the physical resource block (PRB). For uplink transmission, N RE-i Indicates the number of REs allocated for the physical uplink shared channel (PUSCH) within the PRB. i Indicates the code rate corresponding to the TB of the i-th layer. m-i Indicates the modulation order of the i-th layer, that is, the number of bits corresponding to the constellation points in the constellation diagram mapped to the TB, which can also be called the number of modulation bits. For example, assuming that the symbol modulation of the TB corresponds to 16QAM in Figure 2B above, each constellation point corresponds to 4 bits, Q m =4. Assuming that TB1 corresponds to the first layer and TB1 is mapped to the first two bits of the constellation point, then TB1 corresponds to Qm-1 Assume that TB2 corresponds to the second layer and is mapped to the last two bits of the constellation point. Then the Q corresponding to TB2 is m-2 is also 2. Assuming that the symbol modulation of TB is 256QAM, each constellation point in the constellation diagram corresponds to 8 bits. TB1 corresponding to the first layer is mapped to the first two bits, then the Q corresponding to TB1 is m-1 is 2, the corresponding TB2 of the second layer is mapped to the middle two bits, then the Q corresponding to TB2 m-2 is 2, corresponding to the third layer TB3 mapped to the last four bits, then the Q corresponding to TB3m-3 It is 4. It can be understood that each TB corresponds to Q m They can be the same or different, and the same constellation point is mapped by different TBs. i Indicates the number of multiple-input multiple-output (MIMO) layers, that is, the number of demodulation reference signal (DMRS) ports allocated. In non-MIMO transmission, this parameter may not be included in the formula, or its value may be a constant of 1.

[0106] The parameters in the above formula may also be represented by other characters. For example, the bit rate may also be represented by CR, which is not limited in this embodiment.

[0107] According to the above formula, the TB-related information used to determine the TB length includes the TB code rate, the TB modulation order, and the number of REs used for data transmission. Optionally, in a MIMO transmission scenario, the TB-related information used to determine the TB length may also include the number of MIMO layers.

[0108] It can be seen that in the embodiment of the present application, for N input bit sequences, the length of each is determined according to the corresponding relevant information, and then the N input bit sequences of the determined length are encoded according to their respective code rates to obtain N encoded bit sequences, and the N encoded bit sequences are mapped to different segmented bits of the constellation points in the constellation diagram. This ensures that the N input bit sequences are transmitted according to the protection capability of each segmented bit in the N segmented bits of the constellation point. In addition, since the time-frequency resources allocated to each input bit correspond to the constellation point guided by the input bit, the above process enables the length of each input bit sequence to correspond to its own allocated time-frequency resources, so that the input bit sequences can be transmitted by their corresponding time-frequency resources, thereby ensuring data transmission efficiency. At the same time, no additional segmentation method is introduced to adapt to the time-frequency resources of the respective input bit sequences, thereby reducing the encoding complexity of the transmitting end. In addition, the degree of protocol modification can be reduced, thereby reducing the cost of encoding implementation.

[0109] The N input bit sequences may be part or all of the bit sequences transmitted via the first channel. When the first device transmits data to the second device based on the mapping of the N input bit sequences to constellation points in a constellation diagram, the first channel may be understood as the communication channel between the first and second devices. The first channel may include one or more wireless channels such as a broadcast channel, a shared channel, or a control channel. In other words, the N input bit sequences may be input bit sequences corresponding to the same user or user device.

[0110] In this case, the second device receives the data transmitted by the first device through the first channel, which can ensure the probability that the data can be correctly decoded no matter which segment bit of the constellation point in the constellation diagram the data is.

[0111] Alternatively, part of the N input bit sequences can be sent to the second device via the first channel, and the other part can be sent to the third device via the second channel. The first part of the input bit sequence and the other part of the input bit sequence correspond to different segmented bits in the constellation point. Moreover, among the input bit sequences, part of the input bit sequence corresponding to segmented bits with a higher code rate (high transmission reliability) can be sent to the second device farther away from the first device, and the other part of the data bit sequence corresponding to segmented bits with a lower code rate (low transmission reliability) can be sent to the third device closer to the first device. This can further ensure the reliability of long-distance communication transmission.

[0112] It should be understood that the above description is an example, and the method described in the above embodiment can also be applied to more communication scenarios, including one-to-many (including more than two), many-to-many, or relay transmission, etc., and the embodiments of this application do not make specific limitations.

[0113] In some possible implementations, assuming that the number of resource elements (REs) used for data transmission is S, after symbol modulation, all symbol sequences are mapped to these S REs for transmission, with each constellation point corresponding to one RE. Therefore, when N TBs are mapped to all constellation points in the same constellation (specifically, to one segment bit among M segment bits), the time-frequency resources of each TB are aligned (equal), that is, the number of REs for each TB is S.

[0114] For example, assuming that N TBs are TB1 and TB2, the coded bit sequence corresponding to TB1 can be mapped to the first two bits in each of the 16 constellation points 0000 to 1111, and the coded bit sequence corresponding to TB2 can be mapped to the last two bits in each of the 16 constellation points 0000 to 1111. It is understood that the first two bits and the last two bits can both be referred to as segment bits. In this case, each TB is mapped to each constellation point, and the time-frequency resources of each TB are the same as those occupied by the symbol sequence.

[0115] Please refer to Figure 3C, which is a schematic diagram of time-frequency resources for different TBs after layered coding according to an embodiment of the present application. As shown in (a) of Figure 3C, it is assumed that the time-frequency resource 1 corresponds to the bit sequence after TB1 coding, and Figure 3C (b) is the time-frequency resource 2 corresponding to the bit sequence after TB2 coding. Time-frequency resource 1 and time-frequency resource 2 have the same number of orthogonal frequency division multiplexing (OFDM) symbols and the same number of frequency domain resource units (subcarriers), and the time-frequency resources of the two are aligned.

[0116] Therefore, the embodiment of the present application can determine the length of each TB based on the premise that the number of REs in each layer of TB is the same (time-frequency resource alignment), so that the encoding side can achieve the maximum throughput.

[0117] In addition, assuming that the number of MIMO layers corresponding to each TB is the same (all 1), then the N of different TBs is info According to the relationship of R i Q m-i Therefore, the above formula (1-1) can also be transformed into the following formula (1-2):

[0118] N info =N RE ·R i Q m-i

[0119] Please refer to FIG3B, which is a schematic diagram of the relationship between different TB lengths provided by an embodiment of the present application. As shown in (a) of FIG3B, assuming that the code rate corresponding to TB1 is 1 and the code rate corresponding to TB2 is 0.5, then the Q corresponding to TB1 is m-1 is 2, TB2 corresponds to Q m-2 When it is also 2, the N corresponding to TB1 info-1 (L1 in the figure) equal to 2 times N info-2 (L2 in the figure) (ie, the proportional relationship of TB lengths is determined according to the proportional relationship of bit rates).

[0120] Or as shown in (b) of FIG3B , it is assumed that the number of bits mapped to the constellation points of TB1-TB3TB are 2, 2, and 4 respectively. m-1 =2,Q m-2 =2,Q m-3 =4, and the code rates are R1=1, R2=0.5, R3=0.5, then the N corresponding to TB1 info-1 (L1' in the figure) is the N corresponding to TB2 info-2 (L2' in the figure) twice, and N corresponding to TB3 info-3 (L3' in the figure) are equal.

[0121] In other possible scenarios, assume that some of the N TBs are not mapped to every constellation point in the constellation diagram, but only to segmented bits of some constellation points. Another portion of the TBs is mapped to another segmented bit of this portion of constellation points, while also being independently mapped to some constellation points. For example, TB1 is mapped only to the first two bits of the eight constellation points 0000 to 0111 in 16QAM, while TB2 is mapped to the last two bits of the seven constellation points 0000 to 0111 and is also independently mapped to the eight constellation points 1000 to 1111. In this case, the time-frequency resources of TB1 and TB2 are not aligned, and the number of REs is different.

[0122] In other words, the length of TB2 can be calculated in two parts: one corresponding to the case where the segments are mapped to the constellation points, and the other corresponding to the case where all bits are mapped to the constellation points. The two parts correspond to different modulation orders, and the number of REs can be the same (when the REs in the two parts are divided in half) or different.

[0123] Another possible implementation method is to determine the total length N of the N input bit sequences by the following formula (1-3): info-total Then, according to the code rate of each layer, the length of each of the N input bit sequences is determined.

[0124] N info-total =N RE ·R·Q m υ (1-3)

[0125] Among them, the obtained N info-total Based on the code rate of each layer, the length of each input bit sequence can be obtained by dividing it according to the ratio corresponding to the code rate. For example, if the code rate corresponding to TB1 is twice that of TB2, then the length of TB1 can be twice that of TB2.

[0126] It is understandable that the above formulas (1-1), (1-2) and (1-3) may have other variations, such as the parameters on the right side of the formula are transformed to the left side of the equation. For example, based on the above formulas, there may be other coefficients or biases on the left and / or right side of the formula, etc., which are not listed one by one in the embodiments of the present application.

[0127] In some cases, the method of the embodiment of the present application further includes: determining relevant information of the input bit sequence.

[0128] According to the above description, the length of the TB (input bit sequence) can be determined based on the relevant information of the TB. Therefore, before determining the length of the TB, the relevant information of the TB can be determined first.

[0129] When the first device is a network device, the first device can directly obtain relevant information of each TB, including the code rate, modulation order, and number of REs of the TB. In some possible implementations, the MCS index may correspond to the code rate and modulation order of the TB. In this case, the first device may first determine the MCS index corresponding to the TB, and then determine the code rate and modulation order corresponding to the MCS index as the code rate and modulation order of the TB.

[0130] In the case where the first device is a UE, the relevant information of the TB can be indicated by the network device.

[0131] Optionally, the relevant information of the TB can be indicated by signaling. The signaling can be, for example, at least one of high-level signaling or downlink control information (DCI). High-level signaling is, for example, a master information block (MIB) or a system information block (SIB), or a radio resource control (RRC). DCI includes uplink DCI or downlink DCI, where uplink DCI refers to the control information sent by the network side for scheduling PUSCH, and downlink DCI refers to the control information for indicating the relevant configuration parameters of the PDSCH on the network side. In addition, in the scenario where UE communicates with UE, the relevant information of the TB can also be indicated by sidelink control information (SCI). Indicating the relevant information of the TB through high-level signaling can reduce the number of signaling sent, and indicating the relevant information of the TB through DCI or SCI can ensure the configuration flexibility of the relevant information of the TB. Alternatively, the two methods can be combined for configuration.

[0132] For the number of REs in a TB, the network device can indicate the number of resource blocks (RBs) indicated in the DCI. For example, one RE corresponds to one symbol and one subcarrier. Taking a time slot including 14 symbols as an example, one RB can correspond to 168 REs in one time slot. Among the 168 REs, part is used for data transmission, and the other part is used to carry other information such as the demodulation reference signal (DMRS). Therefore, the number of REs available for data transmission corresponding to one RB in the DCI in one time slot can be less than 168.

[0133] The above-mentioned various data are examples. It should be understood that these data can also be transformed into other data. For example, when a time slot includes 13 symbols, the relevant data is transformed accordingly, which will not be listed here one by one.

[0134] As described above, the MCS index may correspond to the code rate and modulation order of the TB. This correspondence can be found in Table 1 and Table 2 below:

[0135] Table 1: TB1 code rate and modulation order

[0136] Table 2: TB2 code rate and modulation order

[0137] Tables 1 and 2 above show the correspondence between multiple sets of (possible) code rates and modulation orders and multiple MCS indices for different TBs, forming a corresponding relationship set for each TB. Each set of code rates and modulation orders for a TB can be indicated by an MCS index.

[0138] The MCS indices for different TBs in Tables 1 and 2 are independently encoded, and different TBs may correspond to the same MCS index value. Therefore, the network device can also use other information to indicate the TB corresponding to the MCS index. For example, a single bit can be added to the MCS index indication field to indicate the corresponding TB. When the number of TBs (N) is greater than 2, multiple bits can be added to indicate the TB corresponding to the MCS index.

[0139] It is understandable that multiple TBs may adopt different sets of correspondence relationships as in the above example, or may adopt the same set of correspondence relationships, that is, a set of correspondence relationships between code rate, modulation order and MCS index is applicable to multiple TBs.

[0140] The above correspondence relationship set is generated according to different TBs. In another possible implementation, the correspondence relationship set can also be generated according to different related information of the TBs.

[0141] Please refer to Tables 3 and 4 below:

[0142] Table 3: Corresponding relationship set of modulation orders

[0143] Table 4: Code rate correspondence set

[0144] Tables 3 and 4 show the application relationships between the MCS index, the modulation order, and the code rate, respectively. The MCS index can correspond to either the modulation order or the code rate. However, the modulation order and code rate do not correspond to each other. The modulation order and code rate corresponding to a TB are indicated by two MCS indices carried in the signaling.

[0145] In another possible implementation, a corresponding relationship set of relevant information of another TB corresponding to relevant information of each TB may be generated, for example, a corresponding relationship set of code rates corresponding to different modulation orders or a corresponding relationship set of modulation orders corresponding to different code rates.

[0146] For example, assuming that the modulation order is 2, the corresponding relationship set of its code rate includes the code rates R corresponding to MCS indexes 0 to 3. 11 ~R 14 When the modulation order is 4, the corresponding relationship set of its code rate includes the code rate R corresponding to MCS index 0~1 21 ~R 22 When the modulation order of the TB is determined, the selectable code rate of the TB is determined according to the corresponding relationship set of the code rates corresponding to the modulation order.

[0147] Similarly, assuming that the code rate is 0.1, the corresponding relationship set of its modulation order includes the modulation order Q corresponding to MCS index 0 to 3 m-1 ~Q m-4 When the code rate is 0.5, the corresponding relationship set of its modulation order includes the modulation order Q corresponding to MCS index 0~1 m-1 ~Q m-2 When the code rate of the TB is determined, the selectable modulation order of the TB is determined according to the corresponding relationship set of the modulation order corresponding to the code rate.

[0148] In addition, the MCS indexes corresponding to different TB related information can be numbered consecutively. For example, assuming that the MCS index can indicate 16 index values, the first 8 index values ​​are used to correspond to the modulation order, and the last 8 index values ​​are used to correspond to the code rate.

[0149] The MCS indexes corresponding to different TB-related information can also be numbered independently. In one possible implementation, one bit can be allocated to indicate the TB-related information corresponding to the corresponding relationship set. For example, when the value of this bit is 0, it indicates that the corresponding relationship set corresponds to the modulation order. When the value of this bit is 1, it indicates that the corresponding relationship set corresponds to the code rate.

[0150] Take the above-mentioned signaling carrying the MCS index as DCI as an example. In the DCI, an MCS index indication field of F (for example, 5) bits may be included. It is understandable that the F-bit indication field may be an existing bit in the DCI or a newly added bit in the DCI. Or it may be a combination of existing bits and newly added bits, for example, the code rate of the TB is indicated by the MCS index corresponding to the existing 3 bits, and the modulation order of the TB is indicated by the MCS index corresponding to the newly added 2 bits. Similarly, the indication field for indicating different layers may also be an existing bit or a newly added bit in the DCI, or a combination of existing bits and newly added bits (for example, if there are less than 2 layers, it is indicated by the existing bit, and if there are more than 2 layers, it is indicated by the newly added bit).

[0151] It is understandable that the above examples applicable to DCI are also applicable to SCI, and are not repeated here.

[0152] It can be seen that in the embodiment of the present application, the relevant information of the TB is indicated by the MCS index indication field in the DCI. On the one hand, the MCS index indication field is an existing field in the DCI, which can make full use of the existing MCS index, reduce the number of new fields in the DCI, and save signaling overhead. On the other hand, assuming that the MCS index indication field is a newly added field, the flexibility of the MCS index setting can be increased, the semantic changes to the existing fields in the DCI can be reduced, and the implementation complexity can be reduced. On the other hand, assuming that the MCS index is a combination of the existing field and the newly added field, it can include the advantages of the above two at the same time, and increase the flexibility of the DCI sending MCS index while reducing the signaling overhead.

[0153] The above embodiment describes the coding and modulation process of the input bit sequence (TB). Referring to FIG4A , FIG4A provides a block diagram of a layered coding and modulation process, as shown in FIG4A , which may specifically include the following steps:

[0154] 1) Determine the size of each TB in the N TBs, that is, the length of the original information bit sequence of each TB (before encoding).

[0155] 2) Fill each TB with CRC bits (also called CRC encoding) to generate TB-CRC check bits and add them to the end of each TB.

[0156] 3) Each TB after adding CRC bits is divided into multiple CBs.

[0157] 4) Fill each CB with CRC bits, generate CB-CRC check bits and add them to the end of each CB (which can be called the encoded bit sequence of CB), and then input each CB-CRC into the component encoder for encoding, such as LDPC encoding.

[0158] 5) Rate matching is performed on the coded bit sequence of each CB.

[0159] 6) Map the rate-matched bit sequence into the constellation diagram.

[0160] The CRC encoding described above is used for error checking. The CRCs in steps 2) and 4) are optional. LDPC encoding is used for error correction, so the two encodings described above may also refer to other corresponding encodings of the same type. These will not be discussed further here.

[0161] According to the above process, a TB can be divided into multiple CBs, and the mapping of the coded bit sequence of a TB to the constellation diagram can be regarded as the mapping of the coded bit sequences of multiple CBs to the constellation diagram.

[0162] During the TB encoding and decoding process, high-rate TBs have higher CB information transmission efficiency. High-rate TBs can be divided into more CBs, and each CB occupies less time-frequency resources. Low-rate TBs, on the other hand, correspond to fewer CBs, and each CB occupies more time-frequency resources. Because high-rate and low-rate TBs are mapped to the same constellation point in the same constellation diagram and transmitted to the same decoding end via the first channel, the decoding end can perform decoding after obtaining the complete bit sequence of a constellation point. In other words, the receiving end performs iterative decoding, first demodulating the higher-rate layer (lower layer) and then the lower-rate layer (upper layer). As the smallest unit of demodulation and decoding, if the time-frequency resource boundary between the upper and lower CBs is significantly different, iterative decoding of the different CBs between the two layers may require a longer latency, thereby reducing decoding throughput.

[0163] Optionally, in order to reduce the delay of CBs in different TBs reaching the decoding end and improve decoding efficiency, this embodiment can further adopt different methods to align (aligning means reducing the gap, the two can be equal or unequal) the time-frequency resources of CBs in different TBs.

[0164] In one possible implementation, the maximum length of the encoded bit sequence of the CB of the TB with a lower code rate is adjusted or determined so that the time-frequency resources of the CB of the TB with a lower code rate are aligned with the time-frequency resources of the CB of the TB with a higher code rate. The adjustment may refer to making an adjustment based on the maximum length of the encoded bit sequence of the CB determined in advance. The determination may refer to adopting the maximum length of the encoded bit sequence of the CB from the initial encoding. The specific determination includes obtaining directly from within itself, obtaining based on the indication information of the opposite end, or determining based on the indication information of the opposite end and the calculation process, etc., which is not specifically limited in the embodiments of the present application.

[0165] In some possible implementations, each of the N input bit sequences is divided into H i code blocks CB, each coded bit sequence consists of Hi The maximum length of the encoded bit sequence of the CB is determined based on the maximum code block constraint value and a specific constant; or the maximum length of the encoded bit sequence of the CB is determined based on the maximum code block constraint value and a specific ratio.

[0166] There are two cases, the first of which is: when the code rate of the reference bit sequence is higher than the code rate of other bit sequences, the maximum length of the encoded bit sequence corresponding to the CB of other bit sequences is determined based on the ratio of the maximum code block constraint value and the first constant, or the maximum length of the encoded bit sequence corresponding to the CB of other bit sequences is determined based on the maximum code block constraint value and the first (ratio) value.

[0167] It can be understood that the reference bit sequence refers to an input bit sequence among the N input bit sequences that does not require the maximum length of the encoded bit sequence of the CB to be determined or adjusted based on the code rate.

[0168] For example, assuming that N input bit sequences (TB) include a first input bit sequence (first TB) and a second input bit sequence (second TB), where the code rate of the first TB is higher than the code rate of the second TB, then the first TB is used as a reference bit sequence and the second TB is used as another bit sequence, and the maximum length of the encoded bit sequence of the CB corresponding to the second TB needs to be adjusted or determined.

[0169] As described above, the encoded bit sequence length of the CB refers to the time-frequency resources occupied by the CB. Therefore, in the embodiment of the present application, the encoded bit sequence length of the CB may refer to the length of the encoded bit sequence corresponding to the CB obtained by encoding the CB after the TB is divided to obtain the CB. If encoding is not required, the encoded bit sequence length of the CB may refer to the length of the CB obtained by directly dividing the TB.

[0170] In a possible implementation, this embodiment can reduce the time-frequency resource difference of CBs in different layers by constraining TBs with low code rates to have a smaller maximum length of the encoded bit sequence of CBs.

[0171] In the prior art, the maximum length of the encoded bit sequence of the CB of a TB is determined by the maximum code block constraint value. Assuming the maximum code block constraint value is 1, for example, I = 8448 bits. In the embodiments of the present application, the maximum length of the encoded bit sequence of the CB of a TB with a low code rate can be less than the maximum code block constraint value.

[0172] For example, the CB length of the second TB can be constrained in the following ways:

[0173] (1) The maximum length of the encoded bit sequence of the CB corresponding to the second TB is determined based on the ratio of the maximum code block constraint value and the first constant.

[0174] If the maximum code block constraint value is 1, the maximum length of the encoded bit sequence of the CB of the second TB satisfies the following formula (2-1):

[0175] where K′ cb Indicates the maximum length of the encoded bit sequence of the CB of the second TB, where n is a constant value. Optionally, n can be a power of 2, but n is not greater than 8448. The unit of the above formula is bits (applicable to the following formulas).

[0176] The current maximum code block constraint value is 8448 bits, so formula (2-1) can also be transformed into the following formula (2-2):

[0177] It should be understood that the value of 8448 in the following formula can also change with the change of the maximum code block constraint value Q, which will not be further explained later.

[0178] Alternatively, the maximum length of the encoded bit sequence of the CB of the second TB satisfies the following formula (3):

[0179] where K′ cb Indicates the maximum length of the encoded bit sequence of the CB of the second TB, where n is a constant value. Optionally, n can be a positive integer not greater than 8848. The unit of the above formula is bits. It is understood that if is an integer, and there is no rounding operation, that is,

[0180] Alternatively, the upward rounding function in formula (3) can be replaced by the downward rounding function Or other functional forms, the present application embodiment does not limit it. It is understandable that if Integers can also have no rounding up or rounding down operations, that is,

[0181] (2) The maximum length of the encoded bit sequence of the CB corresponding to the second TB is determined based on the maximum code block constraint value and the first value, and the first value is determined based on the ratio of the lengths of the second TB and the second TB.

[0182] Taking the maximum code block constraint value as 8448 bits as an example, the maximum length of the encoded bit sequence corresponding to the CB of the second TB can satisfy the following formula (4):

[0183] Where R(2) represents the code rate corresponding to the second TB (lower layer), Q m (2) represents the modulation order corresponding to the second TB. R(1) represents the code rate corresponding to the first TB (high layer), Q m (1) represents the modulation order corresponding to the first TB. It is the first value. Since in the embodiment of the present application, the number of REs allocated to different layers (or different TBs) is the same, the TB length ratio of the second TB to the first TB is determined based on the ratio of the product of their respective code rates and modulation orders.

[0184] Alternatively, the maximum length of the encoded bit sequence of the second TB corresponding to the CB can satisfy the following formula (5):

[0185] Where p can be a positive integer, and m can also be a positive integer. In addition, p and m can exist in the formula at the same time, or only one of them can exist. The ceiling function in the above formulas (4) and (5) is It can also be replaced by the floor function Or other functional forms, the present application embodiment does not limit it. It is understandable that if Is an integer, and there may be no rounding up or rounding down operation, that is,

[0186] In some cases, assuming that the N TBs include a third TB, and the code rate corresponding to the third TB is not the highest code rate among the first, second, and third TBs, the first TB can still be used as a reference bit sequence, and the third TB as another bit sequence. The maximum length of the encoded bit sequence of the CB of the third TB can be adjusted or determined so that the time-frequency resources of the CB of the third TB are aligned with the time-frequency resources of the CB of the first TB. The formula for adjusting or determining the length of the CB of the third TB can be found in the aforementioned formulas (2-1) to (5) and will not be repeated here.

[0187] Corresponding to the above embodiment, in a possible implementation, this embodiment can reduce the time-frequency resource difference of CBs in different layers by constraining TBs with high code rates to have a larger maximum length of the encoded bit sequence of CBs.

[0188] That is to say, in another case, when the code rate of the reference bit sequence is lower than the code rate of other bit sequences, the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequences is determined based on the product of the maximum code block constraint value and the second constant; or the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequences is determined based on the maximum code block constraint value and the second (ratio) value, and the second value is determined based on the ratio of the lengths of the reference bit sequence and the other bit sequences.

[0189] For example, assume that the N TBs include a first TB and a second TB, wherein the code rate of the first TB is higher than the code rate of the second TB, the second TB is used as a reference bit sequence, and the first TB is used as another bit sequence.

[0190] There are two specific ways to constrain the CB length of the first TB:

[0191] (1) The maximum length of the encoded bit sequence of the first TB corresponding to the CB is determined based on the product of the maximum code block constraint value and the second constant.

[0192] Assuming that the maximum code block is constrained to 8448, the maximum length of the encoded bit sequence of the CB of the first TB can satisfy the following formula (6):

[0193] K' cb =8448·n,n=2,4,8,16,…

[0194] Similar to the description of the above formula (2), n is a constant value, which is specifically a power of 2.

[0195] (2) The maximum length corresponding to the CB of the first TB is determined based on the maximum code block constraint value and the second value, and the second value is determined based on the ratio of the lengths of the first TB to the second TB.

[0196] Taking the maximum code block constraint value as 8448 bits as an example, the maximum length of the encoded bit sequence corresponding to the CB of the first TB can satisfy the following formula (7):

[0197] in Represents the second value. The ceiling function in the formula It can also be replaced by the floor function Or other functional forms. It is understandable that if is an integer, or there is no rounding function, that is,

[0198] Alternatively, the maximum length of the encoded bit sequence of the first TB corresponding to the CB can satisfy the following formula (8):

[0199] Where p can be a positive integer, m can also be a positive integer. In addition, n and m can exist in the formula at the same time, or only one of them can exist. Similarly, the ceiling function in the formula It can also be replaced by the floor function Or other functional forms, this application embodiment does not limit it. is an integer, or there is no rounding function, that is,

[0200] In addition, in the above formulas (3)(4)(5)(7)(8), The 8488 in the Besides.

[0201] In some cases, assuming that the N TBs include the fourth TB, and the code rate corresponding to the fourth TB is not the lowest code rate among the first, second, and fourth TBs, the fourth TB can be used as another bit sequence to adjust or determine the maximum length of the encoded bit sequence of the CB of the fourth TB so that the time-frequency resources of the CB of the fourth TB are aligned with the time-frequency resources of the CB of the second TB. The formulas for adjusting or determining the length of the CB of the fourth TB can be found in the aforementioned formulas (6) to (8) and are not repeated here.

[0202] In other possible scenarios, assuming that the N TBs include the first, second, and third TBs, and that their code rates are ordered from high to low as R1 > R2 > R3, the second TB can be used as the reference bit sequence, and the first and third TBs as other bit sequences. The maximum lengths of the encoded bit sequences corresponding to the CBs of the first and third TBs are adjusted or determined. This includes constraining the maximum length of the encoded bit sequence for the first TB to have a larger CB, and constraining the maximum length of the encoded bit sequence for the third TB to have a smaller CB.

[0203] In other possible scenarios, assuming that the N TBs include the first, second, third, and fourth TBs, and that their code rates are ordered from high to low as R1>R2>R3>R4, any one of the four TBs can be used as a reference bit sequence to adjust the maximum length of the coded bit sequence of the CB of the other TBs. Alternatively, the maximum length of the coded bit sequence of the CB of all or some of the TBs can be determined or adjusted using the average code rate of some or all of the TBs as a reference.

[0204] All of these possible situations are applicable to the above formulas (2-1) to (8), and will not be further elaborated here. In addition, "larger" and "smaller" are described based on the maximum code block constraint value, or the maximum length of the encoded bit sequence of the reference bit sequence CB. This description applies to all the above related descriptions.

[0205] After the above process of determining or adjusting other bit sequences, the time-frequency resource difference of the encoded bit sequences of CBs of different TBs is reduced. Please refer to Figure 4B, which is a schematic diagram of the time-frequency resources of different TBs after another layered modulation provided by an embodiment of the present application. As shown in Figure 4B, by limiting the maximum length of the encoded bit sequences of CBs of different TBs, the CB of TB1 is 11 CB with TB2 21 Both occupy one OFDM symbol, have the same time domain resources, and occupy different numbers of REs in the frequency domain, but correspond to the same RB, which generally reduces the time-frequency resource difference between different TBs.

[0206] It can be seen that in the embodiment of the present application, by reducing the maximum length limit of the CB corresponding to the TB of the low code rate layer, or by expanding the maximum length limit of the CB of the TB of the high code rate layer, the time-frequency resource difference of the CBs of different TBs is reduced, so that the delay of the CBs of different TBs reaching the receiving end can be reduced, thereby improving the decoding efficiency of the receiving end or improving the decoding throughput.

[0207] Based on the above description, the method also includes: the first device determines the maximum length of the encoded bit sequence corresponding to the CB of the N input bit sequences, including determining the maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence among the N input bit sequences, and the maximum length of the encoded bit sequence corresponding to the CB of other bit sequences.

[0208] In some possible implementations, the first device may determine a maximum length of a coded bit sequence corresponding to a CB of a reference bit sequence based on a maximum code block constraint value, further determine code block related information, and determine maximum lengths of other bit sequences based on the code block related information; the code block related information includes the maximum code block constraint value and at least one of the following: a first constant, a first value, a second constant, or a second value.

[0209] In some possible implementations, when the first device is a network device or a UE, the relevant parameters in the above formulas (2-1) to (8), including K′ cb , the maximum code block constraint value of CB, the first constant, the second constant, the first value or the related parameter for determining the first value, the second value or the related parameter for determining the second value, and the corresponding calculation formula (which can directly obtain K′ cb In this case, the calculation formula may not be determined), and it may be determined by pre-configuration (protocol agreement). It may also be determined by the first device based on information such as the current transmission environment, channel quality, or time-frequency resources.

[0210] Alternatively, when the first device is a UE, the relevant parameters in formula (2-1) to formula (8) can be determined by network side indication (configuration).

[0211] For example, the K′ corresponding to the above formulas (2-1)(2-2)(3)(6) cb , because it is mainly related to the maximum code block constraint value I and a constant, the second device can convert the relevant parameters in the formula (I, constant, or K') cb ) is configured to the first device, and the first device can determine the maximum length of the encoded bit sequence of the CB corresponding to the TB based on the relevant parameters. Alternatively, the second device can first generate a correspondence between the relevant parameters and the index value, and then indicate the corresponding relevant parameters through the index value in the high-level signaling or DCI.

[0212] For example, assume that the corresponding relationship set of generated related parameters and index values ​​is as shown in Table 5:

[0213] Table 5 Corresponding relationship set of relevant parameters

[0214] The index value 1 can indicate that the maximum length of the encoded bit sequence of TB corresponding to CB is 4224.

[0215] Alternatively, the second device may configure a corresponding relationship set of related parameters to the first device, and the first device may determine the related parameters corresponding to a certain index value as the related parameters of the TB according to its own transmission requirements.

[0216] There are two ways to configure the above parameters:

[0217] ① Semi-static configuration, for example, information related to the above parameters can be indicated through high-layer signaling.

[0218] In this embodiment, the second device transmits data with the first device and is a device for decoding information. Specifically, it can be a network device, UE, or other encoding network element, such as a chip applicable to a network device or a chip applicable to a terminal device.

[0219] The high-layer signaling may include the MIB, SIB or RRC signaling described above. When the second device is a network device, the relevant parameters may be broadcast to the first device via high-layer signaling.

[0220] Alternatively, the second device may configure the relevant parameters to the first device through RRC signaling when the first device performs random access.

[0221] ② Dynamic configuration, such as indicating parameter-related information through DCI or SCI, including uplink DCI or downlink DCI, or SCI.

[0222] Assuming that the second device is a network device, or the second device is a UE in vehicle-to-X (V2X) communication, the second device can send DCI or SCI to the first device to schedule the first device for data transmission. The DCI or SCI sent by the second device to the first device can include the above-mentioned related parameters.

[0223] Of the two configuration methods described above, the former can improve configuration efficiency and reduce signaling overhead, while the latter can increase configuration flexibility and allow for the timely updating of relevant parameters. Alternatively, the configuration of relevant parameters can be completed by combining the above two methods ① and ②. That is, the initial configuration of relevant parameters is achieved through high-layer signaling broadcast by the second device, and then when the second device communicates with the first device, a DCI instruction is sent to update the relevant parameters initially configured in the first device. This method can combine the advantages of both methods.

[0224] For the above formulas (4)(5)(6)(7)(8), K′ cb The determination involves parameters such as code rate, modulation order, RE, etc. of different TBs, and the indication method of these parameters can be as described above. For other parameters in these formulas, such as p or m, etc., they can also be indicated in the same way as the relevant parameters in formula (2-1)(2-2)(3)(6). According to these parameters, and the method of determining the maximum length of the encoded bit sequence of the CB (corresponding to the above formulas (2-1) to (8), these formulas can also be indicated by a formula index value, and the formula index value and the formula have a corresponding relationship set, the set includes multiple formula index values, and the corresponding relationship between each formula index value and the formula), the first device can determine the maximum length limit of the encoded bit sequence of the CB.

[0225] The above method describes a method for improving the decoding throughput of the decoding end by aligning the time-frequency resources of CBs in different TBs.

[0226] In some possible implementations, the decoding throughput at the decoding end can be further improved by fully aligning the CB time-frequency resources of different TBs.

[0227] Therefore, the method of the embodiment of the present application further includes: dividing each of the N TBs into the same number of CBs, or setting the CBs divided from each TB to have the same length.

[0228] As described above, the time-frequency resources corresponding to different TBs in the embodiments of the present application are identical. Therefore, the encoded bit sequence length of each TB is also identical. Assume that TB1 is encoded to obtain L(TB1), and TB2 is encoded to obtain L(TB2), i.e., L(TB1) = L(TB2). Therefore, dividing each of the N TBs into the same number of CBs is equivalent to setting the same CB length for each TB.

[0229] Taking the same number of CBs for different TB segmentations as an example, assuming that the number of CBs corresponding to the first layer (high code rate layer) is C(1), and the number of CBs corresponding to the second layer (low code rate layer) is C(2), then C(1)=C(2).

[0230] There are several ways to make the number of CBs divided by different TBs the same:

[0231] ① Determine the number of CBs that each TB can be divided into according to the existing protocol process. Then, align the CBs of all other TBs according to the CB number of the TB with the largest number of CBs. This does not affect the maximum CB size limit of the existing protocol. For TBs with a smaller number of CBs, the code length of each CB can be shortened.

[0232] For example, if the encoded bit sequence length of TB1 is L(TB1), the CB is segmented according to the maximum length constraint of the encoded bit sequence of the CB in the existing protocol, and the number of CB segmentations is C(1) = L(TB1) / I, where I represents the maximum code block constraint. The encoded bit sequence length of TB2, L(TB2), is segmented to obtain the number of CB segmentations C(2) = L(TB2) / I. Since R1>R2, the encoded bit sequence length of TB2, L(TB2), is segmented again according to the number of CBs R1. At this time, the CB length of TB2 becomes shorter (less than I).

[0233] ② Calculate the number of CBs for each TB segment according to the existing protocol process, and then align the number of CBs of all other TBs according to the TB with the least number of CBs. In this way, for TBs with a large number of CBs, it may be necessary to exceed the maximum CB size limit.

[0234] ③ Determine and align the number of CBs of each TB according to a function of the number of CBs of all TBs. The function can be, for example, direct average, weighted average, etc. Where C′ represents the number of CBs in each layer after the number of CBs in each layer is aligned, C(i) represents the number of CBs in each TB divided according to the existing protocol, and N represents the total number of TBs.

[0235] It can be seen that in the embodiment of the present application, by aligning the number of CBs divided by different TBs, the granularity of alignment of different TB time-frequency resources is made finer, the decoding waiting delay is lowered, and the complexity of protocol modification is also reduced.

[0236] Optionally, as shown in FIG3A , the method further includes: 203 , the first device outputs a bit sequence mapped to the same constellation diagram.

[0237] Optionally, the first device may process the modulated bit sequence to obtain first data, and send the first data to the second device.

[0238] Specifically, after the first device maps N encoded bit sequences to a constellation diagram, it completes the symbol modulation process and outputs the bit sequence mapped to the same constellation diagram, i.e., the output symbol sequence. Optionally, the first device can further perform subsequent processing on the symbol sequence, including MIMO precoding, subcarrier mapping, and inverse fast Fourier transform (IFFT), etc., to complete the baseband signal processing and obtain the first data to be transmitted. Furthermore, the first data can be processed into a radio frequency signal and sent to the second device via the radio frequency antenna.

[0239] 204. The second device receives the first data and processes the first data.

[0240] The second device processes the first data by demapping N segmented bits of the constellation point in the constellation diagram into N pre-decoding bit sequences, and decoding the N pre-decoding bit sequences according to the lengths of the N output bit sequences (TB). Decoding may also be referred to as decoding.

[0241] The processing performed by the second device on the first data is the inverse of the processing performed by the first device. For example, the second device converts the RF signal of the received first data into a baseband signal and performs FFT, subcarrier demapping, MIMO decoding, symbol demodulation (constellation point demapping), bit sequence decoding, etc.

[0242] Before symbol demodulation, the second device demaps the symbol sequence onto the constellation diagram to obtain the constellation points in the constellation diagram. The symbol sequence is demapped based on the N segmented bits of the constellation points in the constellation diagram to obtain the pre-decoding bit sequence of the TB, completing the symbol demodulation process.

[0243] Symbol sequence demapping can begin with the higher-rate segment bits of the constellation points in the constellation diagram (e.g., the first two bits of the constellation points in 16QAM), demapping them into a pre-decoding bit sequence. Then, the lower-rate segment bits (e.g., the last two bits of the constellation points in 16QAM) are demapped into another pre-decoding bit sequence. Ultimately, the pre-decoding bit sequence for N TBs is obtained.

[0244] Among them, the pre-decoding bit sequence of the TB obtained by demapping may be a soft value, that is, the bit sequence includes a floating point number (for example, 0.8). The pre-decoding bit sequence of these TBs is further processed to obtain a hard value bit sequence (including only two values ​​0 and 1) before decoding.

[0245] Before decoding, the second device can determine the length of the TB based on the relevant information of the TB, as determined by formulas (1-1) to (1-3) above. The pre-decoded bits of the TB are then decoded at the corresponding bit rate to obtain a TB of the corresponding length (containing only the systematic bit sequence).

[0246] It can be seen that in this embodiment, when the decoding side obtains the relevant information of TB corresponding to the first data sent by the sending end, it uses the code rate, modulation order and number of REs in the relevant information of TB to perform hierarchical decoding and demodulation on the first data, thereby ensuring decoding efficiency and decoding accuracy.

[0247] It should be noted that the decoding method in the embodiments of the present application is only an example. Other decoding methods known to those skilled in the art can also be used based on the layered coding modulation of the present application. The present application does not limit the decoding method.

[0248] As shown in the structural diagram of the coding and modulation device in Figure 5, the embodiment of the present application also provides a coding and modulation device 1200, which can be a terminal device, or a device that can be used for but not limited to a terminal device. It can also be a network device, or a device that can be used for but not limited to a network device. The coding and modulation device 1200 includes a coding unit 1201 and a modulation unit 1202. The coding unit 1201 and the modulation unit 1202 can be or can be deployed in a processor. The coding and modulation device can implement the coding and modulation method or process in any of the aforementioned embodiments. Among them,

[0249] The encoding unit 1201 is configured to encode N input bit sequences using code rates corresponding to the N input bit sequences, respectively, to obtain N coded bit sequences corresponding to the N input bit sequences, respectively, where N is an integer greater than or equal to 2; the length of each input bit sequence is determined based on relevant information of the input bit sequence, the relevant information of the input bit sequence including at least one of a code rate corresponding to the input bit sequence, a modulation order, or a number of resource elements (REs) used for data transmission;

[0250] The modulation unit 1202 is configured to map the N coded bit sequences onto the same constellation diagram, where the constellation diagram includes M constellation points, each constellation point includes N segmented bits, and the N segmented bits correspond to the N coded bit sequences respectively, where M is an integer greater than or equal to 1.

[0251] Optionally, the encoding unit is further configured to: determine relevant information of the input bit sequence.

[0252] Optionally, the relevant information of the input bit sequence corresponds to one or more correspondence sets, and the correspondence set includes at least one set of correspondences between the modulation and coding strategy MCS index and the modulation order and / or code rate of the input bit sequence.

[0253] Optionally, determining relevant information of the input bit sequence includes: obtaining a modulation and coding strategy MCS index and the number of REs, and determining a modulation order and / or code rate of the input bit sequence according to the MCS index and the corresponding relationship set.

[0254] Optionally, the relevant information of the input bit sequence is carried in high-layer signaling or downlink control information DCI.

[0255] Optionally, each of the N input bit sequences is segmented into code blocks to obtain a corresponding number of code blocks CB;

[0256] The N input bit sequences include a reference bit sequence and other bit sequences other than the reference bit sequence, and the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequences is determined based on the maximum code block constraint value and a specific constant; or the maximum length of the encoded bit sequence corresponding to the CB of the other input bit sequences is determined based on the maximum code block constraint value and a specific ratio, and the specific ratio is determined based on the ratio of the lengths of the other bit sequences and the reference bit sequence.

[0257] Optionally, the lengths of encoded bit sequences of CBs corresponding to different input bit sequences in the N input bit sequences are the same, or the numbers of CBs corresponding to different input bit sequences are the same.

[0258] Optionally, the encoding unit 1201 is also used to: determine the maximum length of the encoded bit sequence corresponding to the CB of the N input bit sequences, including determining the maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence among the N input bit sequences, and the maximum length of the encoded bit sequence corresponding to the CB of other bit sequences.

[0259] Optionally, the encoding unit 1201 is specifically used to determine the maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence based on the maximum code block constraint value.

[0260] Optionally, the encoding unit 1201 is specifically used to: determine code block related information, and determine the maximum length of other bit sequences based on the code block related information; the code block related information includes a maximum code block constraint value, and also includes at least one of the following: a specific constant, or a specific ratio.

[0261] Optionally, the coding modulation apparatus further includes an output unit 1203 for outputting a bit sequence mapped to the same constellation diagram. In some possible implementations, the output unit may be or may be deployed in a unit or module capable of implementing an output function, such as a transceiver, a transceiver antenna, an input / output interface, or the like.

[0262] It is understandable that the above-mentioned encoding unit and modulation unit can also be implemented by other hardware circuits as long as the corresponding functions can be achieved. The embodiments of the present application do not limit this. For example, the encoding unit can be an encoder.

[0263] As shown in the structural diagram of the decoding and demodulation device in Figure 6, the embodiment of the present application also provides a decoding and demodulation device 1300, which can be a terminal device, or a device that can be used for but not limited to a terminal device. It can also be a network device, or a device that can be used for but not limited to a network device. The decoding and demodulation device 1300 includes an input unit 1301 and a decoding and demodulation unit 1302. The decoding and demodulation unit 1302 can be or can be deployed in a processor. The decoding and demodulation device can implement the decoding method demodulation or process in any of the aforementioned embodiments. Among them,

[0264] An input unit 1301 inputs first data or obtains input first data, where N segmented bit sequences in a constellation diagram corresponding to the first data correspond to N pre-decoding bit sequences respectively; lengths of N output bit sequences corresponding to the N pre-decoding bit sequences are determined based on relevant information of the output bit sequences, where the relevant information of the output bit sequences includes a code rate, a modulation order, and a number of resource elements (REs) for data transmission;

[0265] The decoding and demodulation unit 1302 processes the first data; wherein the processing includes demapping N segmented bits of the constellation point in the constellation diagram into N pre-decoding bit sequences, and decoding the N pre-decoding bit sequences according to the lengths of the N output bit sequences.

[0266] In some possible implementations, the input unit may be or may be deployed in a unit or module capable of implementing an input function, such as a transceiver, a transceiver antenna, an input / output interface, or the like.

[0267] It is understandable that the above-mentioned decoding and demodulation device can also be implemented by other hardware circuits as long as the corresponding functions can be achieved. The embodiments of the present application do not limit this.

[0268] In addition, the coding and modulation method and the decoding and demodulation method in the present application can also be respectively referred to as communication methods, and the coding and modulation device and the decoding and demodulation device can also be respectively referred to as communication devices.

[0269] As shown in Figure 7, Figure 7 shows a hardware structure diagram of an electronic device 1400 in an embodiment of the present application, which can implement the method or process in one or more of the aforementioned embodiments. Optionally, the structure of the coding and modulation device 1200 or the decoding and demodulation device 1300 can also refer to the structure shown in Figure 7. The electronic device 1400 includes a processor 1401. Optionally, the electronic device 1400 may further include an interface circuit 1402 (indicated by a dotted line in the figure), and the processor 1401 and the interface circuit 1402 are coupled to each other. It is understandable that the interface circuit 1402 can be a transceiver or an input and output interface. Optionally, the electronic device 1400 may further include a memory 1403 (indicated by a dotted line in the figure), and the memory 1403 is used to store instructions executed by the processor 1401, or to store input data required for the processor 1401 to execute instructions, or to store data generated after the processor 1401 executes instructions.

[0270] As an implementation method, the functions of the interface circuit 1402 may be implemented by a transceiver circuit or a dedicated transceiver chip. The processor 1401 may be implemented by a dedicated processing chip, a processing circuit, a processor, or a general-purpose chip. The processor may be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and an NP. The processor may further include a hardware chip or other general-purpose processor. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0271] It should also be understood that the memory mentioned in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM bus random access memory (DR RAM). It should be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0272] An embodiment of the present application provides a computer storage medium storing a computer program, wherein the computer program includes instructions for executing the method corresponding to the first device or the second device in the above embodiment.

[0273] An embodiment of the present application provides a computer program product including instructions, which, when executed on a computer, enables the computer to execute the method corresponding to the first device or the second device in the above embodiment.

[0274] It should be understood that in the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0275] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0276] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0277] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0278] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0279] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0280] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0281] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in the present application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A coding modulation method, characterized in that: The method comprises: Encoding N input bit sequences using code rates corresponding to the N input bit sequences, respectively, to obtain N coded bit sequences corresponding to the N input bit sequences, respectively, where N is an integer greater than or equal to 2, and the length of each input bit sequence is determined based on relevant information of the input bit sequence, the relevant information of the input bit sequence including at least one of a code rate corresponding to the input bit sequence, a modulation order, or a number of resource elements (REs) used for data transmission; The N encoded bit sequences are mapped onto the same constellation diagram, wherein the constellation diagram includes M constellation points, each constellation point includes N segmented bits, and the N segmented bits correspond to the N encoded bit sequences respectively, where M is an integer greater than or equal to 1.

2. The method according to claim 1, characterized in that Also includes: Determine relevant information about the input bit sequence.

3. The method according to claim 1 or 2, characterized in that The relevant information of the input bit sequence corresponds to one or more correspondence sets, and the correspondence set includes at least one set of correspondences between a modulation and coding strategy MCS index and a modulation order and / or code rate of the input bit sequence.

4. The method according to claim 3, characterized in that The determining of the relevant information of the input bit sequence includes: An MCS index and the number of REs are obtained, and a modulation order and / or a code rate of the input bit sequence is determined according to the MCS index and the corresponding relationship set.

5. The method according to any one of claims 2 to 4, characterized in that: The relevant information of the input bit sequence is carried in high-layer signaling or downlink control information DCI.

6. The method according to any one of claims 1 to 5, characterized in that Each of the N input bit sequences is segmented into code blocks to obtain a corresponding number of code blocks CB; The N input bit sequences include a reference bit sequence and other bit sequences other than the reference bit sequence, and the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequences is determined based on the maximum code block constraint value and a specific constant; or the maximum length of the encoded bit sequence corresponding to the CB of the other input bit sequences is determined based on the maximum code block constraint value and a specific ratio, and the specific ratio is determined based on the ratio of the lengths of the other bit sequences and the reference bit sequence.

7. The method according to any one of claims 1 to 6, characterized in that The lengths of encoded bit sequences of CBs corresponding to different input bit sequences in the N input bit sequences are the same, or the numbers of CBs corresponding to different input bit sequences are the same.

8. The method according to claim 6, characterized in that The method also includes: determining the maximum length of the encoded bit sequence corresponding to the CB of the N input bit sequences, including determining the maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence among the N input bit sequences, and the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequences.

9. The method according to claim 8, characterized in that The determining the maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence includes: The maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence is determined based on the maximum code block constraint value.

10. The method according to claim 8 or 9, characterized in that The determining the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequence includes: Determine code block related information, and determine the maximum length of the other bit sequence based on the code block related information; the code block related information includes a maximum code block constraint value and at least one of the following: the specific constant, the specific ratio.

11. A coding modulation apparatus, the apparatus comprising: an encoding unit, configured to encode N input bit sequences using code rates corresponding to the N input bit sequences, respectively, to obtain N encoded bit sequences corresponding to the N input bit sequences, respectively, where N is an integer greater than or equal to 2; the length of each input bit sequence is determined based on relevant information of the input bit sequence, the relevant information of the input bit sequence including at least one of a code rate corresponding to the input bit sequence, a modulation order, or a number of resource elements (REs) used for data transmission; A modulation unit maps the N coded bit sequences to the same constellation diagram, wherein the constellation diagram includes M constellation points, each constellation point includes N segmented bits, and the N segmented bits correspond to the N coded bit sequences respectively, where M is an integer greater than or equal to 1.

12. The device according to claim 11, characterized in that The encoding unit is further configured to determine relevant information of the input bit sequence.

13. The method according to claim 11 or 12, characterized in that The relevant information of the input bit sequence corresponds to one or more correspondence sets, and the correspondence set includes at least one set of correspondences between a modulation and coding strategy MCS index and a modulation order and / or code rate of the input bit sequence.

14. The device according to claim 13, characterized in that The determining of the relevant information of the input bit sequence includes: obtaining a modulation and coding strategy MCS index and the number of REs, and determining the modulation order and / or code rate of the input bit sequence according to the MCS index and the corresponding relationship set.

15. The method according to any one of claims 12 to 14, characterized in that: The relevant information of the input bit sequence is carried in high-layer signaling or downlink control information DCI.

16. The device according to any one of claims 11 to 15, characterized in that Each of the N input bit sequences is segmented into code blocks to obtain a corresponding number of code blocks CB; The N input bit sequences include a reference bit sequence and other bit sequences other than the reference bit sequence, and the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequences is determined based on the maximum code block constraint value and a specific constant; or the maximum length of the encoded bit sequence corresponding to the CB of the other input bit sequences is determined based on the maximum code block constraint value and a specific ratio, and the specific ratio is determined based on the ratio of the lengths of the other bit sequences and the reference bit sequence.

17. The device according to any one of claims 11 to 16, characterized in that The lengths of encoded bit sequences of CBs corresponding to different input bit sequences in the N input bit sequences are the same, or the numbers of CBs corresponding to different input bit sequences are the same.

18. The device according to claim 16, characterized in that The encoding unit is further configured to: Determining the maximum length of the encoded bit sequence corresponding to the CB of the N input bit sequences, including determining the maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence and the maximum length of the encoded bit sequence corresponding to the CB of the other bit sequences among the N input bit sequences.

19. The device according to claim 18, characterized in that The encoding unit is specifically used for: The maximum length of the encoded bit sequence corresponding to the CB of the reference bit sequence is determined based on the maximum code block constraint value.

20. The device according to claim 18 or 19, characterized in that The encoding unit is specifically used for: Determine code block related information, and determine the maximum length of the other bit sequence based on the code block related information; the code block related information includes a maximum code block constraint value and at least one of the following: the specific constant, or the specific ratio.

21. An electronic device comprising a processor, wherein the processor is coupled to a memory, and when the processor executes a computer program or instruction in the memory, the method according to any one of claims 1 to 10 is executed.

22. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions instruct the communication device to execute the method according to any one of claims 1 to 10.

23. A circuit, characterized in that: include: The processor and the interface are used to execute the computer program or instructions stored in the memory and perform the method according to any one of claims 1 to 10.

24. A computer program product, comprising: a computer program, code, or instruction, which enables a computer to execute the method according to any one of claims 1 to 10 when the computer program is executed.

Images