Channel encoding method for transport block, channel decoding method for transport block, electronic device, and storage medium

Abstract

Embodiments of the present application provide a channel encoding method for a transport block, a channel decoding method for a transport block, an electronic device, and a storage medium. The channel encoding method for a transport block comprises: determining whether code block segmentation is to be performed on a transport block; when it is determined that code block segmentation is not to be performed on the transport block, determining the number C of code blocks to be 1; when it is determined that code block segmentation is to be performed on the transport block, determining the number C of code blocks, performing code block segmentation on an inputted data sequence, and adding a cyclic redundancy check bit sequence to each code block after the segmentation; performing low-density parity-check code channel encoding on the C code blocks, and obtaining C mother code codewords each having a length N, and selecting, on the basis of data characteristics, whether each mother code codeword having the length N comprises the first L codeword bits of an inputted information bit sequence; and writing the C mother code codewords each having the length N into corresponding circular buffers each having a length Ncb, sequentially selecting E codeword bit sequences starting from a starting position K0 of each circular buffer, and obtaining bit-selected sequences of the C mother code codewords. The present application can reduce the number of decoding iterations.

Description

A channel coding and decoding method for transport blocks, an electronic device, and a storage medium. Technical Field

[0001] This application relates to the field of wireless communication technology, and in particular to a channel coding and decoding method for a transport block, an electronic device, and a storage medium. Background Technology

[0002] In the future, mobile communications will promote the rapid development and maturation of technologies such as the industrial internet, the Internet of Things, artificial intelligence, virtual display, autonomous driving, robotics, and the metaverse. 6G will be applied in various scenarios. Taking immersive communication as an example, this use case extends enhanced mobile broadband and covers use cases that provide users with rich interactive video experiences, including interaction with machine interfaces. Typical use cases include immersive XR communication, remote multi-sensory telepresence, and holographic communication. Immersive communication supports the mixed data transmission of video, audio, and other environmental data in a time-synchronized manner, and also includes independent voice support. Some immersive communication use cases may also require support for high reliability and low latency to enable responsive and accurate interaction with real and virtual objects. Additionally, it needs to support greater system capacity to connect multiple devices simultaneously. Various use cases of immersive communication, such as 6-line gaming, 3D messaging, immersive 6DoF streaming, real-time 3D communication, industrial remote assistance, and online shopping, all place increasingly higher demands on mobile communications in terms of immersion, comfort, interoperability, and cost-effectiveness. Cloud-based artificial intelligence (AI) can complement sixth-generation mobile communication to enhance the user experience. Taking immersive communication as an example, cloud-based AI utilizes cloud computing to provide intelligent services, covering areas such as intelligent assistants, visual computing, personalized recommendations, voice processing, health monitoring, autonomous driving, fintech, and entertainment. Cloud-based AI can overcome computing power limitations, providing efficient and intelligent experiences for mobile terminals and driving technological innovation.

[0003] As immersive services evolve from the current "face-to-face" approach to subsequent "shoulder-to-shoulder" and "hand-in-hand" interactions, data streams expand from audiovisual to audiovisual-tactile experiences, and image resolution evolves from 4K to 8K. User experiences will evolve from semi-immersive to fully immersive, application scenarios will expand from indoors to outdoors, and mobile terminal AI cloud applications will rapidly rise. Mobile networks will face challenges in terms of speed, latency, capacity, and mobility. Peak speeds will increase from 10Gbps to 50Gbps-200Gbps, and user experience data rates will increase from 100Mbps to 300-500Mbps.

[0004] Currently, relevant communication technologies utilize low-density parity-check codes (LDPCs) for channel coding and decoding. These codes offer optimal performance in overcoming the Shannon limit, supporting ultra-high parallelism, arbitrary code rates and lengths, and excellent support for Hybrid Automatic Repeat Request (HARQ) and high-order modulation. However, traditional 5G LDPC codes, to achieve near-Shannon limit performance, require numerous iterations (e.g., 30 iterations) using a layered decoding approach. This leads to significant power consumption under ultra-high throughput conditions, demands large chip areas, and increases complexity and cost. Therefore, meeting the ultra-high throughput requirements of future sixth-generation mobile communications while maintaining existing network coverage and compatibility with current needs has become a pressing issue. Summary of the Invention

[0005] This application provides a channel coding and decoding method for transport blocks, an electronic device, and a storage medium, aiming to reduce the number of iterations in the decoding process, improve encoding and decoding efficiency, increase the data throughput of the communication system, and enhance the user experience.

[0006] This application provides a channel coding method for transport blocks, which is applied to a communication node. The method includes:

[0007] Determine whether the transport block should be segmented into code blocks;

[0008] If it is determined that the transport block is not segmented into code blocks, the number of code blocks C is determined to be 1;

[0009] When it is determined that the transport block is to be segmented into code blocks, the number of code blocks C is determined, the input data sequence is segmented into code blocks, and a cyclic redundancy check bit sequence is added to each segmented code block, wherein the number of code blocks C is greater than 1, and the input data sequence includes at least one of the following: transport block, transport block and a concatenated sequence of cyclic redundancy check bit sequences of transport block;

[0010] Channel coding of the C code blocks using low-density parity-check codes is performed to obtain C mother codewords of length N. The mother codewords of length N are selected based on data characteristics to determine whether they include the first L codeword bits of the input information bit sequence, where L is a positive integer greater than 1.

[0011] C codewords of length N are written into their respective circular buffers of length Ncb. Starting from the beginning position K0 of each circular buffer, E codeword bit sequences are selected sequentially to obtain the bit selection sequences corresponding to the C codewords. Here, N, Ncb and E are integers.

[0012] This application also provides a channel coding method for a transport block, which is applied to a communication node. The method includes:

[0013] Determine whether the transport block should be segmented into code blocks;

[0014] If it is determined that the transport block is not segmented into code blocks, the number of code blocks C is determined to be 1;

[0015] When it is determined that the transport block is to be segmented into code blocks, the number of code blocks C is determined, the input data sequence is segmented into code blocks, and a cyclic redundancy check bit sequence is added to each segmented code block, wherein the number of code blocks C is greater than 1, and the input data sequence includes at least one of the following: transport block, transport block and a concatenated sequence of cyclic redundancy check bit sequences of transport block;

[0016] Channel coding with low-density parity-check codes is performed on each of the C code blocks to obtain C mother codewords of length N, wherein each mother codeword includes the entire input information bit sequence, and the input information bit sequence is the information bit sequence of the code block;

[0017] C codewords of length N are written into their respective circular buffers of length Ncb. Starting from the beginning position K0 of each circular buffer, E codeword bit sequences are selected sequentially to obtain the bit selection sequences corresponding to the C codewords. The beginning position K0 is obtained based on the redundancy version information. The starting position of the redundancy version 0 information is selected as 0 or L based on the data characteristics. N, E, Ncb and L are positive integers greater than 1.

[0018] This application also provides a channel decoding method for a transport block, which is applied to a communication node. The method includes:

[0019] Obtain the deinterleaved sequence of C selected bits, and write the C selected bits into a circular buffer of length Ncb. Based on the mother codeword length N and the starting position K0, restore the codeword sequence of the C circular buffers to a mother codeword of length N. It is determined whether the mother codeword of length N includes the first L codeword bits of the input information bit sequence according to the data characteristics. L is a positive integer greater than 1.

[0020] Channel decoding of C mother codewords of length N is performed using low-density parity-check codes to generate C decoded code blocks of length N, where N, Ncb, and C are integers.

[0021] This application also provides a channel decoding method for a transport block, which is applied to a communication node. The method includes:

[0022] Obtain the deinterleaved sequence of C selected bits, and write the C selected bits into a circular buffer of length Ncb. Based on the mother codeword length N and the starting position K0, restore the sequence of C codewords in the circular buffer to a mother codeword of length N. The starting position K0 is obtained according to the redundancy version information. The starting position of the redundancy version 0 information in the redundancy version information is selected as 0 or L according to the data characteristics, where L is a positive integer greater than 1.

[0023] Channel decoding of C mother codewords of length N is performed using low-density parity-check codes to generate C decoded code blocks of length N, where N, Ncb, and C are integers.

[0024] This application also provides an electronic device, wherein the electronic device includes:

[0025] At least one processing unit;

[0026] The processing unit is used to execute a channel coding method or channel decoding method for a transport block as described in any one of the embodiments of this application.

[0027] This application provides a computer-readable storage medium storing one or more programs that are executed by one or more processor units to implement a channel coding method or channel decoding method for a transport block as described in any one of the embodiments of this application.

[0028] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of this application, nor is it intended to limit the scope of this application. Other features of this application will become readily apparent from the following description. Attached Figure Description

[0029] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0030] Figure 1 is a schematic diagram of the architecture of a communication system for a transport block provided in an embodiment of this application;

[0031] Figure 2 is a flowchart of a channel coding method for a transport block provided in an embodiment of this application;

[0032] Figure 3 is a flowchart of another channel coding method for a transport block provided in an embodiment of this application;

[0033] Figure 4 is a flowchart of a channel coding method for a transport block provided in an embodiment of this application;

[0034] Figure 5 is a flowchart of another channel coding method for a transport block provided in an embodiment of this application;

[0035] Figure 6 is a flowchart of a channel decoding method for a transport block provided in an embodiment of this application;

[0036] Figure 7 is a flowchart of a channel decoding method for a transport block provided in an embodiment of this application;

[0037] Figure 8 is an example diagram of another channel decoding method for a transport block provided in an embodiment of this application;

[0038] Figure 9 is a schematic diagram of the structure of an electronic device provided in an embodiment of this application;

[0039] Figure 10 is a schematic diagram of the structure of a channel coding device for a transport block provided in an embodiment of this application;

[0040] Figure 11 is a schematic diagram of the structure of a channel decoding device for a transport block provided in an embodiment of this application;

[0041] Figure 12 is a schematic diagram of a wireless communication transmitting device provided in an embodiment of this application;

[0042] Figure 13 is a schematic diagram of the structure of a wireless communication receiving device provided in an embodiment of this application. Detailed Implementation

[0043] It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the scope of this application.

[0044] In the following description, the use of suffixes such as “module,” “part,” or “unit” to denote elements is solely for the purpose of illustration in this application and has no particular meaning in itself. Therefore, “module,” “part,” or “unit” may be used interchangeably.

[0045] Wireless communication systems are widely deployed to provide a variety of telecommunications services, such as telephone, video, data, messaging, and broadcasting. Typical wireless communication systems may employ multiple access technologies that enable communication with multiple users by sharing available system resources. Examples of such multiple access technologies include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Orthogonal Frequency Division Multiple Access (OFDMA) systems, Single-Carrier Frequency Division Multiple Access (SC-FDMA) systems, and Time Division Synchronous Code Division Multiple Access (TD-SCDMA) systems. These multiple access technologies have been adopted by various telecommunications standards to provide a common protocol enabling different wireless devices to communicate at the city, national, regional, and even global levels.

[0046] The cellular concept proposed by Bell Labs in the early 1970s led to the rapid development of mobile communications, which can be roughly divided into the following stages:

[0047] The first generation of mobile communication systems used frequency division multiple access (FDMA) analog modulation.

[0048] Second-generation cellular systems employ Time Division Multiple Access (TDMA) and Code Division Multiple Access (CDMA) digital modulation schemes, increasing system capacity and using independent channels for signaling transmission, significantly improving system performance. These primarily include GSM in Northern Europe and IS-95 in North America.

[0049] The third-generation mobile communication system IMT-2000 offers greater system capacity to meet the requirements of multimedia communication. It mainly includes North America's CDMA2000, Europe's Wideband Code Division Multiple Access (WCDMA), and China's TD-SCDMA. R99 is the official version of WCDMA; HSPA is the 3.5G evolution of WCDMA.

[0050] Fourth-generation mobile communication systems primarily employ Orthogonal Frequency Division Multiplexing (OFDM) and Multiple-Input Multiple-Output (MIMO) technologies, enabling truly high-speed broadband access. The first version of LTE was Release 8 (Rel-8), completed in September 2007. Due to widespread interest from operators, LTE gradually became the most mainstream 4G mobile communication standard globally. Starting in 2009, 3GPP began standardizing LTE-Advanced. As a significant technological advancement, the LTE-Advanced standard was released as Release 10, with performance indicators fully meeting the requirements of IMT-Advanced (Rel-10 LTE achieves a peak rate of 375 Mbit / s with five 0MHz bandwidths and a single antenna). LTE / LTE-Advanced largely retains the Turbo codes used in 3G for forward error correction in the data channel. LTE has made some optimizations to the Turbo code structure, reducing decoding complexity and improving performance to some extent. The control channel uses tail-biting convolutional codes, which slightly improve performance compared to classic zero-tail bit convolutional codes because they do not require additional tail bits.

[0051] The fifth-generation mobile communication system, IMT-2020, is a new generation of broadband mobile communication technology characterized by high speed, low latency, and massive connectivity. 5G communication infrastructure serves as the network infrastructure for realizing the interconnection of humans, machines, and things. The International Telecommunication Union (ITU) defines three main application scenarios for 5G: enhanced mobile broadband (eMBB), ultra-reliable and low-latency communications (uRLLC), and massive machine-type communications (mMTC). To support high-speed transmission and better coverage, key 5G technologies employ LDPC, the new Polar channel coding scheme, and high-performance massive MIMO technology. To support low latency and high reliability, 5G utilizes technologies such as short frames, fast feedback, and multi-layer / multi-site data retransmission.

[0052] 6G, or the sixth-generation mobile communication standard, is also known as the sixth-generation mobile communication technology. It is the IMT-2030 mobile communication standard and can promote the rapid development and maturity of the industrial internet, the Internet of Things, artificial intelligence, virtual reality, autonomous driving, robotics, and the metaverse. Around 2030, 6G will achieve large-scale commercial use worldwide. In 2023, the International Telecommunication Union (ITU) Radio Sector released recommendations on the 6G framework and overall objectives, providing guidance for the research and development of 6G technology. The ITU proposed that the goal of 6G technology is to achieve higher data transmission speeds, lower latency, higher reliability, wider network connectivity, and better security in the future.

[0053] The wireless interface is often the decisive factor in a mobile communication system; in other words, the evolution of wireless interface technology directly determines the transformation of mobile communication systems. A wireless interface typically includes transceivers (base stations and terminals) and an air channel. The transceiver itself consists of three parts: baseband, intermediate frequency (IF), and radio frequency (RF). In wireless interface technology, baseband processing is often the most crucial; therefore, this discussion will focus on the baseband processing flow.

[0054] Based on the encoding method of the information sequence at the transmitting end, the receiving end can process the received data accordingly to reliably recover the original information sequence. The encoding method must be visible to both the transmitting and receiving ends. Generally, the encoding processing method is based on Forward Error Correction (FEC) coding, also known as channel coding. Forward error correction coding adds redundant information to the information sequence. The receiving end can use this redundant information to reliably recover the original information sequence. In communication systems, FEC (Forward Error Correction, i.e., channel coding) is used to improve data reliability by adding redundant information to correct errors during transmission. The FEC coding rate refers to the ratio of input information bits K to the total output coded bits, determining the data redundancy and bit error rate performance. 5G employs two main FEC coding schemes: LDPC (Low-Density Parity-Check Code) and Polar codes, used for data channels and control channels, respectively.

[0055] Some common FEC codes include convolutional codes, Turbo codes, Low Density Parity Check (LDPC) codes, and Polar codes. In FEC encoding, an information sequence with k bits is FEC-encoded to obtain an n-bit FEC codeword (with nk redundant bits), and the FEC code rate is k / n. Convolutional coding can easily encode blocks of arbitrary sizes, and Turbo coding, by utilizing two coded components that operate on the information sequence and by employing interleaving methods that support different code sizes, can support different information sequence sizes.

[0056] LDPC codes are linear block codes that can be defined using a very sparse parity check matrix or a bipartite graph. It is precisely the sparsity of its parity check matrix that enables low-complexity encoding and decoding, thus making LDPC practical. Through various practical and theoretical proofs, LDPC codes have demonstrated to be the best-performing channel code in Additive White Gaussian Noise (AWGN) channels, with performance very close to the Shannon limit and superior to convolutional codes and Turbo codes.

[0057] The data channel of the 5G NR mobile communication system adopts quasi-cyclic LDPC coding. Because quasi-cyclic LDPC coding is very simple to describe and has a simple decoder structure, it is used in various communication standards. Quasi-cyclic LDPC coding can also be called structured LDPC coding. Its binary parity check matrix H is an mb×Zc row and nb×Zc column matrix, composed of mb×nb block matrices. Each block matrix is ​​a different power of a basic permutation matrix of size Zc×Zc, which is obtained by right-circular shifting (or left-circular shifting 1) a unit matrix by 1 bit; alternatively, each block matrix can be considered as a submatrix obtained by right-circular shifting (or left-circular shifting) a Zc×Zc identity matrix by several bits. For a binary parity check matrix H, if each Zc×Zc is replaced with an element "0" or an element "1", the zero-block matrix is ​​replaced with "0", and the cyclic shift block matrix of the identity matrix is ​​replaced with "1", the corresponding matrix is ​​called the base graph, but the specific shift values ​​are not distinguished. The base graph is an intermediate product of the design of the QC-LDPC parity check matrix. At this point, as long as the cyclic shift values ​​and the submatrix size are known, a quasi-cyclic LDPC code can be determined. All shift values ​​corresponding to each submatrix constitute an mb×nb matrix, which can be called the base matrix Hb, the shift coefficient parity check matrix, or the parity check matrix of the base graph. The submatrix size can be called the extension factor, the lift size, or the submatrix size; here, it is described as the lift size. Because the quasi-cyclic LDPC code is very compact and simple in structure, and is very beneficial for decoder implementation, it is also called a structured LDPC code. Currently, this defined quasi-cyclic LDPC code is a one-sided quasi-cyclic LDPC code, which is also the main commercial form.

[0058] For example, the binary parity check matrix H:

[0059] It can be obtained by expanding the following lift value Zc and a 2×4 basic graph parity check matrix Hb:

[0060] Zc=3 and

[0061] The corresponding basic graph matrix H BG as follows:

[0062] Since quasi-cyclic LDPC codewords are systematic codes, meaning the systematic bits in the codeword are equal to the information bits before encoding, only the parity bits need to be calculated in quasi-cyclic LDPC encoding. Quasi-cyclic LDPC encoding can then be performed based on the parity check matrix described above. For example, the parity check matrix H can be described as two parts: H = [Hs; Hp], where Hs corresponds to the systematic bit matrix and Hp corresponds to the parity bit matrix. According to the LDPC encoding principle, for a quasi-cyclic LDPC codeword C (including the systematic bits Cs and the parity bits Cp), the condition H × C = 0 is satisfied, i.e., [Hs; Hp] × [Cs; Cp] = 0; therefore, it can be deduced that Hs × Cs = Hp × Cp, and thus Cp = (Hp) / (Hp). -1 ×Hs×Cs, where '×' in the formula is binary matrix multiplication and (x)-1 is binary matrix inversion; thus, the parity bit Cp of the quasi-cyclic LDPC codeword can be calculated, thereby obtaining the quasi-cyclic LDPC codeword C=[Cs;Cp].

[0063] At the transmitting end, the transport block to be transmitted needs to be segmented into multiple smaller transport blocks. Then, each of these smaller transport blocks undergoes FEC coding. The transport block to be transmitted has a certain transport block size (TBS) and coding rate. The FEC coding rate is generally defined as the ratio of the number of bits in the original information bit sequence entering the encoder to the number of bits in the actual transmitted bit sequence (or rate-matched output sequence). In 4G LTE and 5G NR communication systems, the transport block size is relatively flexible, thus meeting the various data packet size requirements of mobile communication systems. Furthermore, 4G and 5G communication systems use a Modulation and Coding Scheme (MCS) index to indicate different combinations of modulation order and coding rate R. The TBS index is determined through control information such as Downlink Control Information (DCI) or Channel Quality Indication (CQI), and the size of the actual information bit sequence is determined jointly based on the number of resource blocks (RBs) and the TBS index. Channel types can include data channels and control channels. Data channels generally carry data from user equipment (UE), while control channels carry control information, including MCS index number, channel information, DCI, CQI, and other control information. Bandwidth generally refers to the spectrum width allocated by the system for data transmission. Data transmission directions include uplink data and downlink data. Uplink data generally refers to data transmitted from the UE to the base station, while downlink data refers to data transmitted from the base station to the UE.

[0064] Physical channel mapping refers to mapping modulation symbols onto physical channel resources, such as the spreading code channel in a CDMA system or a subchannel or resource block (composed of multiple subcarriers) in an OFDM system.

[0065] Hybrid Automatic Repeat Request (HARQ) is a crucial link adaptation technique in digital communication systems. The implementation process is as follows: the receiver decodes the received HARQ data packets. If the decoding is correct, it sends an ACK (Acknowledgement) message to the sender, instructing the sender to transmit a new HARQ data packet. If decoding fails, it sends a NACK (Negative Acknowledgement) message to the sender, requesting the sender to retransmit the HARQ data packet. By performing IR or Chase merging decoding on the retransmitted data packets, the receiver can improve the success rate of decoding, achieving high reliability requirements for link transmission.

[0066] In wireless communication networks, transmitters can encode information data according to specific error correction and decoding schemes to improve communication reliability. Transmitters can then modulate the encoded information onto frequency subcarriers for transmission according to specific modulation schemes. Transmitters can use various modulation techniques. In some cases, transmitters may use modulation techniques based on Quadrature Amplitude Modulation (QAM). Modulation schemes can have specific constellation diagrams, with constellation points located in the complex plane. Constellation points can also be called constellation symbols or modulation symbols. Transmissions generated using a specific modulation scheme can carry information data bits represented by constellation symbols, which come from a set of constellation symbols defined for that modulation scheme.

[0067] Quadrature Amplitude Modulation (QAM) is a modulation method that modulates amplitude on two orthogonal carriers. These two carriers are typically sine waves with a 90-degree (π / 2) phase difference, hence the name "quadrature carriers." The modulation method derives its name from this. QAM is a widely used modulation technique in digital communication. The transmission characteristics of QAM signals can be intuitively understood through the representation of constellation diagrams. In a constellation diagram, each constellation point corresponds to a specific value in the transmitted signal set. These points are typically arranged in a square grid with equal spacing in both the horizontal and vertical directions, forming a two-dimensional geometric figure that facilitates observation of signal distribution. In digital communication, data is usually represented using binary numbers, so the number of constellation points is often a power of 2. As the number of constellation points increases, the amount of information that each symbol can transmit also increases. However, if the average energy of the constellation diagram remains constant, increasing the number of constellation points will lead to a decrease in the distance between the points. In this case, interference between signals will increase, thereby increasing the bit error rate and reducing communication reliability. In communication systems, modulation order refers to the number of information bits carried by each symbol in a modulation scheme. A higher modulation order allows for the transmission of more bits per unit time, thus improving the system's spectral efficiency. However, high modulation orders typically require higher signal quality (a better signal-to-noise ratio, SNR) to ensure reliable transmission.

[0068] HARQ is a crucial link adaptation technology in digital communication systems. The implementation process is as follows: the receiver decodes the received HARQ data packets. If the decoding is correct, it sends an ACK (Acknowledgement) message to the sender, instructing the sender to transmit a new HARQ data packet. If decoding fails, it sends a NACK (Negative Acknowledgement) message to the sender, requesting retransmission of the HARQ data packet. By performing IR or Chase merging decoding on multiple retransmitted data packets, the receiver can improve the success rate of decoding, achieving high reliability requirements for link transmission.

[0069] In 5G NR (New Radio), Downlink Control Information (DCI) formats are used to transmit scheduling information on the Physical Downlink Control Channel (PDCCH). DCI instructs User Equipment (UE) on how to receive downlink data or how to transmit uplink data, and is a core part of the 5G NR scheduling mechanism. The 5G NR specification (3GPP TS 38.212) defines several DCI formats, each suitable for different scheduling tasks. The Format 0 series is used for uplink scheduling, with Format 0_0 suitable for regular uplink data transmission via PUSCH (Physical Uplink Shared Channel), while Format 0_1 ​​adds dynamic power control instructions to optimize UE transmit power. The Format 1 series is used for downlink scheduling, with Format 1_0 suitable for regular downlink data scheduling via PDSCH (Physical Downlink Shared Channel), while Format 1_1 supports more advanced MIMO and multiple TRP (Transmission Access Point) scheduling. In addition, the Format 2 series involves Channel State Information (CSI) feedback. Format 2_0 is suitable for single-user CSI feedback, Format 2_1 for multi-user CSI feedback, and Format 2_2 is used to trigger the UE to transmit a Sounding Reference Signal (SRS) for gNB to perform channel measurements. Furthermore, the Format 3 series focuses on power control. Format 3_0 is responsible for downlink power control, and Format 3_1 for uplink power control, to optimize the UE's receive and transmit power. These formats work together to enable 5G NR networks to flexibly allocate resources according to different communication needs, improving spectrum utilization and communication efficiency. Similarly, the 4G LTE standard specification (3GPP TS 36.212) defines the DCI format, which includes the following formats: DCIformat0, DCIformat1, DCIformat1A, DCIformat1B, DCIformat1C, DCIformat1D, DCIformat2, DCIformat2A, DCIformat2B, DCIformat2C, DCIformat2D, DCIformat3, and DCIformat3A.

[0070] In 5G NR (New Radio), the Radio Network Temporary Identifier (RNTI) is primarily used to distinguish different User Equipments (UEs) and control the reception of specific UEs or broadcast messages. The RNTI ensures data integrity and prevents misunderstandings by scrambling the Cyclic Redundancy Check (CRC) of the Downlink Control Information (DCI) in the Physical Downlink Control Channel (PDCCH). The scrambling method involves processing the CRC code using a bit-level XOR operation, i.e., CRC' = CRC ⊕ RNTI. The CRC is calculated by the base station (gNB), while the RNTI depends on the UE type. Different types of RNTI are suitable for different application scenarios, such as C-RNTI (Cell-RNTI) for normal UE scheduling, RA-RNTI (Random Access RNTI) for random access, SI-RNTI (System Information RNTI) for system information broadcasting, P-RNTI (Paging RNTI) for paging, and TPC-RNTI (Transmit Power Control RNTI) for power control adjustment, etc.

[0071] In 5G NR (New Radio), the Search Space (SS) is the candidate area where a UE monitors the PDCCH and attempts to decode DCI (Downlink Control Information). Since the PDCCH may reside in different Control Resource Sets (CORESETs), and a CORESET consists of multiple Control Channel Elements (CCEs), the Search Space determines which CCE locations the UE needs to attempt to detect control information. Proper configuration of the Search Space is crucial for the UE to successfully receive DCI and reduce decoding overhead. The 5G NR specification (3GPP TS 38.213) divides the Search Space into two categories: Common Search Space (CSS): This is a shared PDCCH resource used by all UEs and is typically used to broadcast DCIs such as System Information Blocks (SIBs), Random Access Responses (RARs), and paging messages. UE-specific Search Space (USS): PDCCH resources reserved for a specific UE, mainly used for UE resource scheduling, such as scheduling instructions for PDSCH (Physical Downlink Shared Channel) and PUSCH (Physical Uplink Shared Channel).

[0072] In 4G LTE and 5G NR, the number of transport layers refers to the number of independent spatial channels. Each transport layer represents an independent data stream, transmitted in parallel through different antenna pairs. With the development of MIMO (Multiple-Input Multiple-Output) technology, systems can support multiple transport layers; for example, 2×2 MIMO supports two transport layers, and 4×4 MIMO supports four, thereby improving throughput and spectral efficiency. Each transport layer corresponds to an independent spatial channel, allowing multiple data streams to be transmitted simultaneously, increasing system capacity and data transmission rate. The increase in the number of transport layers enables communication systems to achieve higher throughput with limited spectrum resources, especially in Massive MIMO and millimeter-wave networks, significantly improving signal quality and transmission rate.

[0073] In 4G LTE and 5G NR, Adaptive Modulation and Coding (AMC) is a technique that dynamically adjusts the modulation scheme and coding rate based on the quality of the wireless channel, thereby improving the efficiency and reliability of data transmission. In 4G LTE and 5G NR, the Channel Quality Indicator (CQI) is an indicator used to represent the quality of the wireless channel, helping the base station determine which modulation and coding schemes to use to optimize data transmission. The protocol presents it in the form of a CQI table, with each CQI index indicating a set of modulation schemes and FEC rates. CQI values ​​reflect factors such as signal quality, signal-to-noise ratio (SNR), and bit error rate (BER), and are used to guide scheduling and channel state feedback. In 4G LTE and 5G NR, the CQI range is typically from 1 to 15. A higher CQI value indicates better channel quality and supports higher-order modulation schemes (such as 64-QAM), while a lower CQI value corresponds to poorer channel conditions and uses lower-order modulation schemes (such as Quadrature Phase Shift Keying (QPSK)).

[0074] In 4G LTE and 5G NR, Modulation and Coding Scheme (MCS) indices are typically transmitted via Downlink Control Information (DCI) from the base station to the User Equipment (UE). DCI is control information used for scheduling, carrying important instructions regarding data transmission, including MCS indices, resource block allocation, and time slots. Specifically, the protocol defines modulation and transport block size tables, with each row corresponding to an MCS index. For each MCS index, the modulation and transport block size table defines a combination of modulation scheme and code rate. Specific tables can be found in the LTE 36.213 standard and the 5G NR 38.214 standard. An MCS index essentially corresponds to a spectral efficiency index. The main purpose of the MCS index is dynamic scheduling. Based on feedback of channel quality such as CQI, the base station can adjust the scheduling strategy in real time to optimize data transmission efficiency. When channel quality is poor, the base station may choose a lower MCS index, using a lower-order modulation scheme (such as QPSK) and a lower coding rate to ensure reliable data transmission. When channel quality is good, the base station will choose a higher MCS index and adopt a higher-order modulation scheme (such as 64-QAM or 256-QAM) to improve the data rate. In this way, the MCS index helps the system provide efficient transmission and resource utilization under various channel conditions.

[0075] The accompanying drawings provided in this application are intended to describe various configurations and are not intended to limit the described technical features to the only configurations that can be implemented. The detailed description includes specific details to provide a comprehensive understanding of the various concepts; however, these concepts can be implemented without specific details, and well-known structures and components are shown in block diagram form to avoid obscuring these concepts.

[0076] The method provided in this application can be applied to various communication systems. For example, the communication system can be a long-term evolution (LTE) system, a 5th generation (5G) communication system, a 5G-A communication system, a Wi-Fi system, a 3rd generation partnership project (3GPP) related communication system, a future evolution communication system (such as a 6th generation (6G) or a 7th generation (7G) communication system), or a system integrating multiple systems, etc., without limitation. The method provided in this application embodiment is described below using the communication system 100 shown in Figure 1 as an example. Figure 1 is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided in this application.

[0077] Figure 1 is a schematic diagram of the architecture of a communication system provided in an embodiment of this application. As shown in Figure 1, the communication system 100 may include one or more network devices (i.e., base stations) and one or more terminal devices. As shown in Figure 1, the communication system 100 may include a base station 110, terminal devices 120, 130, 140, and a core network 150. It should be noted that the network devices may include base stations.

[0078] Network device 110 can provide communication services to terminal devices 120, 130, and 140, and can also connect to the core network 150. For example, network device 110 communicates with terminal device 120 via a wireless network. When terminal device 120 sends data, the wireless communication module can encode the information for transmission. Specifically, the wireless communication module can acquire a certain number of information bits to be transmitted to access network device 110 through the channel. These information bits may be generated by the processing module, received from other devices, or stored in the storage module. These information bits may be contained in one or more transport blocks (TBs), and TBs can be segmented to generate multiple code blocks (CBs).

[0079] When the transmission direction of the communication system 100 is uplink, the terminal device 120 is the transmitter and the access network device 110 is the receiver. When the transmission direction of the communication system 100 is downlink, the access network device 110 is the transmitter and the terminal device 120 is the receiver.

[0080] The technical solutions provided in this application can be applied to various wireless communication systems. For example, the technical solutions provided in this application are mainly applied to future communication systems, such as sixth-generation mobile communication systems, next-generation wireless local area network systems, etc. The 6G mobile communication system described in this application includes non-standalone (NSA) 6G mobile communication systems and / or standalone (SA) 6G mobile communication systems.

[0081] The method proposed in this optional embodiment can be used in next-generation mobile communication systems or other wireless communication systems. The data transmission direction is either from the base station to the mobile user (downlink transmission service data) or from the mobile user to the base station (uplink transmission service data). Mobile users include: mobile devices, access terminals, user terminals, user stations, user units, mobile stations, remote stations, remote terminals, user agents, user equipment, user devices, or other terms. Base stations include access points (APs), or may be referred to as node B, radio network controller (RNC), evolved Node B (eNB), base station controller (BSC), base transceiver station (BTS), base station (BS), transceiver function (TF), radio router, radio transceiver, basic service unit, extended service unit, radio base station (RBS), or other terms.

[0082] Base stations can provide communication coverage for macro cells, pico cells, femto cells, and / or other types of cells. Macro cells can cover a relatively large geographic area (e.g., a radius of several kilometers) and can allow unrestricted access for UEs with service subscriptions. Pico cells may cover a relatively small geographic area and may allow unrestricted access for UEs with service subscriptions. Femto cells can cover a relatively small geographic area (e.g., a home) and can allow restricted access for UEs associated with a Femto cell (e.g., UEs in a Closed Subscriber Group (CSG)). An almost blank subframe (ABS) of a macro cell can be referred to as a macro base station (BS). A BS for a pico cell can be referred to as a pico BS. A BS for a femto cell may be referred to as a femto BS or a home BS. The terms “eNB,” “base station,” “NR BS,” “gNB,” “TRP,” “AP,” “node B,” “5G NB,” “hNB,” “6G NB,” “iNB,” “7G NB,” and “cell” are used interchangeably here.

[0083] A network controller can be coupled to one or more (e.g., a group of) business units (BSs) and can provide coordination and control for these BSs. The network controller can communicate with the BSs via backhaul. BSs can also communicate with each other, for example, directly or indirectly via wireless or wired backhaul.

[0084] UEs can be distributed throughout the wireless network, and each UE can be fixed or mobile. A UE can communicate with one or more BSs in the wireless network.

[0085] UE can also be referred to as access terminal, terminal, mobile station, user unit, station, etc. UE can be a cellular phone (e.g., smartphone), personal digital assistant (PDA), wireless modem, wireless communication device, handheld device, laptop, cordless phone, wireless local loop (WLL) station, tablet, camera, gaming device, netbook, smartbook, ultrabook, medical device or equipment, biometric sensor / device, wearable device (smartwatch, smart clothing, smart glasses, smart wristband, smart jewelry (e.g., smart ring, smart bracelet)), entertainment device (e.g., music or video device or satellite radio), vehicle component or sensor, smart meter / sensor, industrial manufacturing equipment, GPS device, or any other suitable device configured to communicate via wireless or wired media.

[0086] Figure 2 is a flowchart of a channel coding method for a transport block provided in an embodiment of this application. This embodiment is applicable to data transmission between different communication nodes. The method can be executed by a channel coding device for a transport block, which is generally integrated into a communication node. The communication node may include a base station, a terminal, etc. Referring to Figure 2, the method provided in this embodiment specifically includes the following steps:

[0087] Step 110: Determine whether the transport block is segmented into code blocks; if the transport block is not segmented into code blocks, determine the number of code blocks C to be 1; if the transport block is segmented into code blocks, determine the number of code blocks C, segment the input data sequence into code blocks, and add a cyclic redundancy check bit sequence to each segmented code block, wherein the number of code blocks C is greater than 1, and the input data sequence includes at least one of the following: transport block, transport block and a concatenated sequence of cyclic redundancy check bit sequences of transport block.

[0088] In the embodiments of this application, it can be determined whether to perform code block segmentation and code block CRC addition on the transport block. If code block segmentation is not required, the transport block is at least used as a code block for channel coding, and the number of code blocks C is 1. If code block segmentation is required, the number of code blocks C is determined. If C is greater than 1, the input data sequence is segmented into code blocks, and CRC is added to the segmented code blocks or code block groups.

[0089] Furthermore, adding CRC to the segmented code blocks or code block groups includes: adding a CRC sequence to each segmented code block, or first grouping the segmented code blocks and then adding a CRC sequence to each group of code blocks, or adding a CRC sequence to each segmented code block, then grouping the segmented code blocks and then adding a CRC sequence to each group of code blocks.

[0090] In some embodiments of the application, before determining whether the transport block should be segmented into code blocks, the method further includes:

[0091] Add a cyclic redundancy check bit sequence to the transport block.

[0092] In this embodiment of the application, a CRC sequence can be generated and added to the end of the input transport block.

[0093] Step 120: Perform low-density parity-check channel coding on each of the C code blocks to obtain C mother codewords of length N. Based on the data characteristics, select whether the mother codeword of length N includes the first L codeword bits of the input information bit sequence, where L is a positive integer greater than 1.

[0094] In this embodiment, low-density parity-check coding can be performed on C code blocks to generate C parent codewords of length N, where N is a positive integer. Further, generating C parent codewords of length N includes: selecting, based on data characteristics, whether a parent codeword of length N includes the first L codeword bits of the input information bit sequence, where the input information bit sequence can be the information bit sequence of the code block being channel coded.

[0095] Based on the above application embodiments, L equals 2*Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0096] In other embodiments, L equals Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0097] In other embodiments, L is a positive integer greater than 1 and less than or equal to 2*Zc.

[0098] Step 130: Write C mother codewords of length N into their respective circular buffers of length Ncb. Starting from the beginning position K0 of each circular buffer, sequentially select E codeword bit sequences to obtain the bit selection sequences corresponding to the C mother codewords; where N, Ncb, and E are integers.

[0099] In this embodiment of the application, bit selection can be performed on C mother codewords of length N. The C mother codewords of length N can be written into C circular buffers of length Ncb bits respectively. Then, starting from the starting position K0 of each circular buffer, the bit sequence of E codewords is selected sequentially to obtain the bit selection sequence after C bit selection.

[0100] Furthermore, based on the above application embodiments, the starting position K0 is obtained according to the Redundancy Version (RV).

[0101] In some embodiments, the method further includes: performing code block interleaving on the selected C bit sequences to obtain C output interleaved sequences; and concatenating the C interleaved sequences to obtain a code block concatenated output sequence.

[0102] Based on the above-mentioned application embodiments, the method further includes: selecting the coding type of channel coding according to data characteristics, wherein the coding type includes a first coding type or a second coding type; wherein the first coding type is a multilateral quasi-cyclic LDPC code, and the second coding type is a unilateral quasi-cyclic LDPC code;

[0103] Among them, the binary parity check matrix H of the one-sided quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. The block sub-matrices are Zc×Zc zero square matrices or Zc×Zc identity matrices or Zc×Zc identity matrices cyclic shift matrices, and include at least multiple Zc×Zc identity matrices or identity matrix cyclic shift matrices.

[0104] The binary parity check matrix H of the multilateral quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. Each block sub-matrix is ​​a Zc×Zc zero matrix, a Zc×Zc identity matrix, a cyclic shift matrix of a Zc×Zc identity matrix, or a Zc×Zc multilateral sub-matrix, and includes at least multiple Zc×Zc multilateral sub-matrices. The number of "1" elements in each column of each Zc×Zc multilateral block sub-matrix is ​​equal to 2.

[0105] In this embodiment, the channel coding type is selected as either a first coding type or a second coding type based on data characteristics. The first coding type includes a multilateral quasi-cyclic LDPC code, and the second coding type includes a single-sided quasi-cyclic LDPC code. The binary parity check matrix H of the multilateral quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. The block sub-matrices are Zc×Zc zero matrices, Zc×Zc identity matrices, cyclic shift matrices of Zc×Zc identity matrices, or Zc×Zc multilateral sub-matrices, and include at least multiple Zc×Zc multilateral sub-matrices. The number of "1" elements in each column of the Zc×Zc multilateral block sub-matrices is equal to 2.

[0106] In other embodiments, the number of "1" elements in each column of the Zc×Zc polygonal block submatrix is ​​greater than or equal to 2.

[0107] Here is an example of a polycyclic LDPC code; in real-world applications, the matrix size will be much larger.

[0108] The basic graph parity check matrix (also known as the fundamental matrix) of this code includes multiple elements:

[0109] The 0th element is used to indicate the elements of a square matrix of all zeros (which can be called -1 elements, null elements, or empty elements);

[0110] The first type of element is used to indicate an element that has been cyclically shifted by one identity matrix;

[0111] The second type of element is used to indicate the elements of a cyclic shift of two identity matrices;

[0112] The third type of element is used to indicate the elements of a cyclic shift of a 3-unit matrix.

[0113] In this embodiment of the application, the basic graph matrix is ​​obtained by changing the elements indicating all-zero square matrices (type 0 elements) in the binary parity check matrix H to 0, the elements indicating 1 identity matrix cyclic shift (type 1 elements) to 1, the elements indicating 2 identity matrix cyclic shift (type 2 elements) to 2, and the elements indicating 3 identity matrix cyclic shift (type 3 elements) to 3.

[0114] The fundamental graph matrix can include the following elements: 0, 1, 2, or 3. The 0th element (equal to 0) in the fundamental graph matrix corresponds to the 0th element (which can be -1, null, or an empty element) in the basic matrix; the 1st element (equal to 1) in the fundamental graph matrix corresponds to the 1st element (indicating a 1-dimensional cyclic shift of the identity matrix) in the basic matrix; the 2nd element (equal to 2) in the fundamental graph matrix corresponds to the 2nd element (indicating a 2-dimensional cyclic shift of the identity matrix) in the basic matrix; and the 3rd element (equal to 3) in the fundamental graph matrix corresponds to the 3rd element (indicating a 3-dimensional cyclic shift of the identity matrix) in the basic matrix.

[0115] In a specific example, consider a parity check matrix with 2 rows and 4 columns. The element in row 0, column 0 is a third-class element with 3 shift values ​​{3, 2, 1}; the element in row 0, column 1 is a second-class element with 2 shift values ​​{3, 7}; the element in row 0, column 2 is a first-class element with 1 shift value {0}; and the element in row 0, column 3 is a third-class element, represented by -1. The row weights are 6 for row 0 and 6 for row 1; the column weights are 5 for column 0, 3 for column 1, 3 for column 2, and 1 for column 3. This parity check matrix H... PCM The shift value for each element can be specifically shown in Table 1 below:

[0116] Table 1 Parity Check Matrix H PCM Example table of offset values ​​for inner elements

[0117] In one exemplary embodiment, the element type of each element in the basic graph matrix corresponding to the binary parity check matrix can be as shown in Table 2 below, wherein the element in row 0 and column 0 of the basic graph matrix is ​​a third-type element, which equals 3; the element in row 0 and column 1 of the basic graph matrix is ​​a second-type element, which equals 2; the element in row 0 and column 2 of the basic graph matrix is ​​a first-type element, which equals 1; and the element in row 0 and column 3 of the basic graph matrix is ​​a zero-type element, which equals 0.

[0118] Table 2. Examples of element types in the basic graph matrix.

[0119] In some application embodiments, the data features include a first type of parameters, which at least include code rate, modulation order, and number of transmission layers.

[0120] Specifically, the data features may include a first type of parameter, which may include code rate, modulation order and transmission layer number. Furthermore, the data features may also include at least a threshold value of the first type of parameter.

[0121] In other embodiments, the data features include a first type of parameters, which at least include code blocks, modulation order, number of transmission layers, and the number of resources occupied by a transmission block.

[0122] Specifically, the data characteristics include at least a first type of parameters, wherein the first type of parameters includes at least the code rate, modulation order, number of transmission layers, and the number of resources occupied by the transport block.

[0123] In other embodiments, the data features include a first type of parameter, which includes at least the number of code blocks C.

[0124] In some application embodiments, the data features include a second type of parameters, which includes at least one of the following: the format of the control information for scheduling the transport block, the radio network temporary identifier scrambled on the cyclic redundancy check bit sequence corresponding to the control information for scheduling the transport block, and the search space corresponding to the control information for scheduling the transport block.

[0125] Based on the above-described embodiments, the format of the control information for scheduling the transport block included in the second type of parameters includes at least one of the following:

[0126] The N1 index or N2 index respectively indicates the downlink control format used for downlink scheduling, where N1 and N2 are positive integers greater than or equal to 0, and N1 is less than N2;

[0127] The M1 index or M2 index indicates the downlink control format used for uplink scheduling, where M1 and M2 are positive integers greater than or equal to 0, and M1 is less than M2.

[0128] In this embodiment, the second type of parameter includes the format of the control information for the scheduled transport block. The format of this scheduled transport block may include a downlink control format for downlink scheduling indicated by index N1 or a downlink control format for downlink scheduling indicated by index N2, where N1 and N2 are positive integers greater than or equal to 0, and N1 is less than N2. Further, index N1 indicates the control information format for fallback, and index N2 indicates the control information format for none fallback.

[0129] Alternatively, the second type of parameter includes the format of the control information for the scheduled transport block. This format may include the downlink control format for the uplink scheduling indicated by index M1, or the downlink control format for the uplink scheduling indicated by index M2, where M1 and M2 are positive integers greater than or equal to 0, and M1 is less than M2. Further, index M1 indicates the control information format for fallback, and index M2 indicates the control information format for none fallback.

[0130] Based on the above-described embodiments, the format of the control information for scheduling transport blocks further includes a downlink control format indicated by index N3 or a downlink control format for downlink scheduling indicated by index N4, where N3 and N4 are different English characters, and the English character order of N3 precedes that of N4. Furthermore, index N3 indicates a control information format with rollback, while index N4 indicates a control information format without rollback.

[0131] Furthermore, based on the above-described embodiments, the format of the control information for scheduling transport blocks further includes a downlink control format for uplink scheduling indicated by index M3 and a downlink control format for uplink scheduling indicated by index M4. M3 and M4 are different English characters, with the English character order of M3 preceding that of M4. Furthermore, index M3 indicates a control information format with rollback, while index M4 indicates a control information format without rollback.

[0132] Based on the above application embodiments, the second type of parameter includes a temporary wireless network identifier scrambled on the cyclic redundancy check bit sequence corresponding to the control information of the scheduling transmission block, including a first type of temporary wireless network identifier or a second type of temporary wireless network identifier. The first type of temporary wireless network identifier includes at least one of a cell wireless network identifier and a configuration scheduling wireless network identifier. The second type of temporary wireless network identifier includes at least one of a system information wireless network identifier, a random access wireless network identifier, a paging wireless network identifier, and a temporary cell wireless network identifier.

[0133] Specifically, the second type of parameter includes the Radio Network Temporary Identifier (RNTI) scrambled onto the Cyclic Redundancy Check (CRC) bit sequence corresponding to the control information of the scheduled transport block. This includes either a first type of Radio Network Temporary Identifier or a second type. The first type includes at least one of the Cell Radio Network Temporary Identifier (C-RNTI) and the Configured Scheduling RNTI. The second type includes at least one of the System Information Radio Network Temporary Identifier (RNTI), the Random Access Radio Network Temporary Identifier (RNTI), the Paging Radio Network Temporary Identifier (RNTI), and the Temporary Cell Radio Network Temporary Identifier (Temporary C-RNTI). It is understood that the RNTI scrambled onto the CRC corresponding to the control information of the scheduled transport block is simply referred to as the current RNTI.

[0134] Based on the above application embodiments, the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block includes a first type of RNTI or a second type of RNTI, wherein the first type of RNTI is a public message-related RNTI; and the second type of RNTI is a private message-related RNTI.

[0135] In some application embodiments, the search space corresponding to the control information for scheduling the transport block, which is included in the second type of parameter, includes a public search space or a user equipment-specific search space.

[0136] Based on the above application embodiments, in some application embodiments, the data features include at least a first type of parameter, which includes the modulation order, transmission layer number and code rate of the corresponding transmission block.

[0137] In other embodiments, the data features include at least a third type of parameter, which includes at least one of the following: a Bandwidth Part (BWP) index, a component carrier index, and resource allocation indication information for control signaling bearers.

[0138] In some other embodiments, the data features include at least a fourth type of parameter, which includes at least one of the following: channel type, link direction, and waveform type. The link direction includes uplink or downlink; the channel type includes at least one of the following: data channel, broadcast channel, control channel, and access channel; the waveform type includes at least one of the following: cyclic prefix orthogonal frequency division multiplexing waveform and discrete Fourier transform spread spectrum orthogonal frequency division multiplexing waveform.

[0139] In some other application embodiments, the data features include at least a fifth type of parameter, which includes at least one of the following: higher-layer parameters configured by the base station for the terminal, UE capability indication signaling reported by the terminal to the base station, terminal type, and terminal capability level.

[0140] In some application embodiments, the data features include at least a first type of parameter and a second type of parameter.

[0141] In some application embodiments, the data features include at least a first type of parameter and a third type of parameter.

[0142] In some application embodiments, the data features include at least a first type of parameter and a fourth type of parameter.

[0143] In some application embodiments, the data features include at least a first type of parameter and a fifth type of parameter.

[0144] In some application embodiments, the data features include at least a second type of parameter and a third type of parameter.

[0145] In some application embodiments, the data features include at least a second type of parameter and a fourth type of parameter.

[0146] In some application embodiments, the data features include at least the second type of parameters and the fifth type of parameters.

[0147] In some application embodiments, the data features include at least a third type of parameter and a fourth type of parameter.

[0148] In some application embodiments, the data features include at least the third type of parameters and the fifth type of parameters.

[0149] In some application embodiments, the data features include at least a fourth type of parameter and a fifth type of parameter.

[0150] In one exemplary embodiment, a channel coding method for a transport block is applied at the transmitting end, as shown in Figure 3. The method includes at least the following steps:

[0151] Step S210, CRC addition to transport block: Add the generated CRC check bit sequence to the end of the input transport block.

[0152] Step S220, code block segmentation and code block CRC addition: Determine whether code block segmentation is needed; if code block segmentation is not needed, the number of code blocks C is 1; if code block segmentation is needed, determine the number of code blocks C; if C>1, segment the input data sequence into code blocks and add CRC to the segmented code blocks or code block groups.

[0153] Adding CRC to segmented code blocks or code block groups includes: 1) adding a CRC (Cyclic redundancy check) sequence to each segmented code block, or 2) first segmenting the code blocks and then grouping them, and then adding CRC to each group of code blocks, or 3) both of the above methods of adding CRC.

[0154] Step S230, channel coding: Encode the C code blocks using quasi-cyclic LDPC codes to generate C mother codewords of length N. Here, N is a positive integer.

[0155] In some embodiments, the method further includes: selecting whether the mother codeword of length N includes the first L codeword bits of the input information bit sequence based on data characteristics, where L is a positive integer greater than 1, and the input information bit sequence can be the information bit sequence of a code block for channel coding.

[0156] Furthermore, based on the data characteristics, it is selected whether the mother codeword of length N includes the last L codeword bits of the input information bit sequence, where L is a positive integer greater than 1.

[0157] It should be noted that if the first transmission occurs, the first L bits correspond to the heaviest column of the binary parity check matrix H of the LDPC code, and the next L bits correspond to the lightest column of the binary parity check matrix H of the LDPC code. If the first HARQ retransmission occurs, this pattern does not apply.

[0158] Based on the above application embodiments, in the LDPC codeword of length N, part or all of the input information bit sequence is placed at the beginning, and the parity bits generated by LDPC encoding are placed at the end.

[0159] Based on the above application embodiments, the encoding type is selected according to the data characteristics. The encoding type includes a first encoding type and a second encoding type. The first encoding type is a mother codeword of length N that includes at least the first L codeword bits of the input information bit sequence. The second encoding type is a mother codeword of length N that does not include the first L codeword bits of the input information bit sequence.

[0160] Based on the above application embodiments, the encoding type is selected according to the data characteristics. The encoding type includes a first encoding type or a second encoding type. The first encoding type is a multi-sided quasi-cyclic LDPC code; the second encoding type is a unilateral LDPC code.

[0161] The binary parity check matrix H of the single-sided quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. The block sub-matrices are cyclic shift matrices of Zc×Zc zero square matrix, Zc×Zc identity matrix, or Zc×Zc identity matrix, and include at least multiple cyclic shift matrices of Zc×Zc identity matrix or identity matrix.

[0162] The binary parity check matrix H of the polygonal quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. Each block sub-matrix is ​​a Zc×Zc zero matrix, a Zc×Zc identity matrix, a cyclic shift matrix of a Zc×Zc identity matrix, or a Zc×Zc polygonal sub-matrix, and includes at least multiple Zc×Zc polygonal sub-matrices. The number of "1" elements in each column of each Zc×Zc polygonal block sub-matrix is ​​equal to 2.

[0163] Furthermore, the number of "1" elements in each column of the Zc×Zc polygonal block submatrix is ​​greater than or equal to 2.

[0164] In some application embodiments, the L codewords are the first L codeword bits of the input information bits.

[0165] In some application embodiments, the L codewords are the last L codeword bits of the input information bits.

[0166] In some application embodiments, L equals 2*Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0167] In some embodiments of the application, L is equal to Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0168] In some application embodiments, L is a positive integer greater than 1 and less than or equal to 2*Zc.

[0169] In some embodiments, the data features include at least a first type of parameter, wherein the first type of parameter includes at least one of the following: code rate, modulation order, number of transmission layers, number of code blocks, and number of resources occupied by the transmission block. Furthermore, in some embodiments, the data features also include at least a threshold value for the first type of parameter.

[0170] In some embodiments, the data features include at least a first type of parameter, wherein the first type of parameter includes at least the number of code blocks. Furthermore, in some embodiments, the data features also include at least a threshold value for the first type of parameter.

[0171] In some application embodiments, the data features include at least a first type of parameters, wherein the first type of parameters includes at least the code rate, modulation order, number of transmission layers, and number of resources occupied by the transport block.

[0172] In some embodiments of the present application, the data feature at least includes a second type of parameter, where the second type of parameter at least includes one of the following: the format of control information for scheduling a transport block, a Radio Network Temporary Identifier (RNTI) scrambled on the CRC corresponding to the control information for scheduling the transport block, and a search space corresponding to the control information for scheduling the transport block.

[0173] In some embodiments of the present application, the second type of parameter is the format of the control information for scheduling the transport block.

[0174] In some embodiments of the present application, the second type of parameter is the format of the control information for scheduling the transport block and the RNTI scrambled on the CRC corresponding to the control information for scheduling the transport block.

[0175] On the basis of the above embodiments of the present application, the formats of the control information for scheduling the transport block include a fallback control information format and a non-fallback control information format.

[0176] On the basis of the above embodiments of the present application, the formats of the control information for scheduling the transport block include a downlink control information format indicated by an N1 index or a downlink control format for downlink scheduling indicated by an N2 index, where N1 and N2 are used to distinguish different downlink control information formats for downlink scheduling, N1 and N2 are positive integers greater than or equal to 0, and N1 < N2. Further, in some embodiments of the present application, N1 is used to indicate the fallback control information format, and N2 is used to indicate the non-fallback control information format.

[0177] On the basis of the above embodiments of the present application, the formats of the control information for scheduling the transport block include a downlink control information format indicated by an N3 index or a downlink control format for downlink scheduling indicated by an N4 index, where N1 and N2 are used to distinguish different downlink control information formats for downlink scheduling, N3 and N4 are different single English letters, and N3 comes before N4 in alphabetical order. Further, in some embodiments of the present application, N3 is used to indicate the fallback control information format, and N4 is used to indicate the non-fallback control information format.

[0178] On the basis of the above embodiments of the present application, the formats of the control information for scheduling the transport block include a downlink control information format indicated by an M1 index or a downlink control format for uplink scheduling indicated by an M2 index, where M1 and M2 are used to distinguish different downlink control information formats for uplink scheduling, M1 and M2 are positive integers greater than or equal to 0, and M1 < M2. Further, in some embodiments of the present application, M1 is used to indicate the fallback control information format, and M2 is used to indicate the non-fallback control information format.

[0179] Based on the above-described embodiments, the format of the control information for scheduling transport blocks includes a downlink control information format indicated by index M3 or a downlink control format for uplink scheduling indicated by index M4. M3 and M4 are used to distinguish different downlink control information formats for uplink scheduling; M3 and M4 are different single letters in English, with M3 preceding M4 in alphabetical order. Furthermore, in some embodiments, M3 is used to indicate a fallback control information format, and M4 is used to indicate a none-fallback control information format.

[0180] Based on the above application embodiments, the RNTI scrambled on the CRC corresponding to the control information of the scheduling transport block includes either a first type of RNTI or a second type of RNTI. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI) or CS-RNTI (Configured Scheduling RNTI). The second type of RNTI includes at least one of the following: SI-RNTI (System Information RNTI), RA-RNTI (Random Access RNTI), P-RNTI (Paging RNTI), or TC-RNTI (Temporary C-RNTI).

[0181] It should be noted that the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block can be simply referred to as the current RNTI.

[0182] Based on the above application embodiments, the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block includes a first type of RNTI or a second type of RNTI, wherein the first type of RNTI is a common message-related RNTI; and the second type of RNTI is a private message-related RNTI.

[0183] Based on the above application embodiments, the search space includes a public search space (CSS) or a UE-specific search space (UESS).

[0184] Based on the above application embodiments, the data features include at least a first type of parameter, which is the modulation order, transmission layer number and code rate of the corresponding transmission block.

[0185] In some application embodiments, the data features include at least a third type of parameter, which includes at least one of the following: partial bandwidth BWP index, component carrier index, and resource allocation indication information of control signaling bearer.

[0186] In some application embodiments, the data characteristics include at least a fourth type of parameter, which includes at least one of the following: channel type, link direction, and waveform type. The link direction includes uplink or downlink; the channel type includes one of the following: data channel, broadcast channel, control channel, or access channel; and the waveform type includes one of the following: Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) or Discrete Fourier Transform-Spread-Orthogonal Frequency Division Multiplexing (DFT-S-OFDM).

[0187] In some application embodiments, the data features include at least a fifth type of parameter, wherein the fifth type of parameter includes at least one of the following: higher-layer parameters configured by the base station for the terminal, UE capability indication signaling reported by the terminal to the base station, terminal type, and terminal capability level.

[0188] In some embodiments of the application, the data features include at least a first type of parameter and a second type of parameter;

[0189] In some embodiments of the application, the data features include at least a first type of parameter and a third type of parameter;

[0190] In some embodiments of the application, the data features include at least a first type of parameter and a fourth type of parameter;

[0191] In some embodiments of the application, the data features include at least a first type of parameter and a fifth type of parameter;

[0192] In some embodiments of the application, the data features include at least a second type of parameter and a third type of parameter;

[0193] In some application embodiments, the data features include at least a second type of parameter and a fourth type of parameter;

[0194] In some embodiments of the application, the data features include at least the second type of parameters and the fifth type of parameters;

[0195] In some application embodiments, the data features include at least a third type of parameter and a fourth type of parameter;

[0196] In some embodiments of the application, the data features include at least the third type of parameters and the fifth type of parameters;

[0197] In some application embodiments, the data features include at least a fourth type of parameter and a fifth type of parameter.

[0198] Based on the above-described embodiments, an exemplary implementation may include the following sub-scheme: Sub-scheme 1

[0199] In some application embodiments, the selection of whether a mother codeword of length N includes the first L codeword bits of the information bit sequence of the code block to be channel coded is based on data characteristics. The data characteristics include a first type of parameter, which includes the code rate, modulation order and transmission layer corresponding to the transport block.

[0200] Based on the above-described embodiments, a preset length parameter is determined according to the code rate, modulation order, and number of transmission layers. This preset length parameter can be used to indicate whether the selected mother codeword of length N includes the first L codeword bits of the information bit sequence of the code block to be channel-coded. For example, if the code rate is low, the modulation order is small, and the number of transmission layers is small, the mother codeword of length N does not include the first L codeword bits of the input information bit sequence. When the code rate is high, the modulation order is large, and the number of transmission layers is large, the mother codeword of length N includes the first L codeword bits of the input information bit sequence.

[0201] In other embodiments, a first coding type or a second coding type is selected based on data characteristics, which are first-type parameters, including the code rate, modulation order, and number of transmission layers used for the transport block. The first coding type is a multi-sided LDPC code, and the second coding type is a single-sided LDPC code. For example, if the code rate, modulation order, and number of transmission layers are low, a multi-sided LDPC code is selected. Conversely, when the code rate, modulation order, and number of transmission layers are high, a multi-sided LDPC code is selected.

[0202] Furthermore, when the code rate, modulation order, and number of transmission layers are high, the mother codeword of length N includes the first L codeword bits of the input information bit sequence. If the code rate, modulation order, and number of transmission layers are low, the mother codeword of length N does not include the first L codeword bits of the input information bit sequence.

[0203] Sub-scheme two

[0204] In some application embodiments, the data features include at least a first type of parameters, wherein the first type of parameters includes at least the code rate, modulation order, number of transmission layers, and the number of resources occupied by the transport block.

[0205] Furthermore, if the code rate is low, the modulation order is low, the number of transmission layers is low, and the number of resources occupied by the transport block is small, a single-sided LDPC code is selected. When the code rate is high, the modulation order is high, the number of transmission layers is high, and the number of resources occupied by the transport block is large, a multi-sided LDPC code is selected.

[0206] Furthermore, when the code rate is high, the modulation order is high, the number of transmission layers is high, and the number of resources occupied by the transport block is large, the mother codeword of length N includes the first L codeword bits of the input information bit sequence. If the code rate is low, the modulation order is low, the number of transmission layers is low, and the number of resources occupied by the transport block is small, the mother codeword of length N does not include the first L codeword bits of the input information bit sequence.

[0207] Based on the above-described embodiments, the two exemplary implementation methods described above can exist alone or simultaneously.

[0208] The embodiments of this application can yield different benefits depending on different situations. When the code rate, modulation order, and number of transmission layers are high, the maximum number of iterations can be reduced. Simulations show that, without changing performance, the maximum number of iterations can be reduced to 60% of the original, which can significantly improve the decoder's throughput and reduce its complexity. When the code rate, modulation order, and number of transmission layers are low, the link performance of the LDPC code can be significantly improved.

[0209] In some embodiments, the selection of whether a mother codeword of length N includes the first L codeword bits of the input information bit sequence is based on data characteristics, where the data characteristics are a first type of parameter. Specifically, the first type of parameter is the number of code blocks C, and the input information bit sequence can be the information bit sequence of code blocks used for channel coding. Further, for channel coding of the data sharing channel, if the number of code blocks C is greater than a preset threshold, the mother codeword of length N includes the first L codeword bits of the input information bit sequence. If the number of code blocks C is less than a preset threshold, the mother codeword of length N does not include the first L codeword bits of the input information bit sequence, and the data characteristics are a first type of parameter. Here, C is a positive integer greater than or equal to 1. It should be noted that the above "greater than" and "less than" thresholds can also include two variations: greater than or equal to a threshold, and less than a threshold; greater than a threshold, and less than or equal to a threshold.

[0210] In some embodiments, channel coding is performed using either a first coding type or a second coding type based on data characteristics, where the data characteristics are first-type parameters. Specifically, the first-type parameter is the number of code blocks C, the first coding type is a multi-sided LDPC code, and the second coding type is a one-sided LDPC code. Further, for channel coding of the data-sharing channel, if the number of code blocks C is less than a preset threshold, a one-sided LDPC code is selected; if the number of code blocks C is greater than the preset threshold, a multi-sided LDPC code is selected. Here, C is a positive integer greater than or equal to 1. It should be noted that the terms "greater than" and "less than" can also include two variations: greater than or equal to a threshold, and less than a threshold; greater than a threshold, and less than or equal to a threshold.

[0211] Extensive research has revealed that the embodiments of this application can yield different benefits depending on the circumstances. When the number of code blocks is large, the maximum number of iterations can be reduced, significantly improving the decoder's throughput and reducing its complexity. When the number of code blocks is small, the link performance of LDPC codes can be significantly improved.

[0212] In some application embodiments, the selection of whether the mother codeword of length N includes the first L codeword bits of the input information bit sequence is based on data characteristics. The data characteristics are second-type parameters, which are the format of the control information for scheduling the transport block. The input information bit sequence can be the information bit sequence of the code block to be channel coded.

[0213] Furthermore, channel coding is performed by selecting either the first coding type or the second coding type based on the format of the control information of the scheduled transport block. If the current control information format belongs to a control information format in which the corresponding mother codeword does not include L codeword bits of the input information bits, the LDPC code mother codeword will not include L codeword bits of the input information bits. If the current control information format belongs to a control information format that supports the corresponding mother codeword including L codeword bits of the input information bits, the LDPC code mother codeword will include L codeword bits of the input information bits.

[0214] Based on the above application embodiments, for the channel coding of the data sharing channel, if the format of the control information used to schedule the current transport block is the fallback control information format, the LDPC code mother code will not include L codeword bits of the input information bits; if the format of the control information used to schedule the current transport block is the none fallback control information format, the LDPC code mother code will include L codeword bits of the input information bits.

[0215] Based on the above-described embodiments, for the channel coding of the data sharing channel, if the format of the control information used to schedule the current transport block is the downlink control information format for downlink scheduling indicated by index N1, the LDPC code mother codeword will not include L codeword bits of the input information bits; if the format of the control information used to schedule the current transport block is the downlink control information format for uplink scheduling indicated by index N2, the LDPC code mother codeword will include L codeword bits of the input information bits. Wherein, N1 and N2 are positive integers greater than or equal to N1, and N1... <N2。

[0216] Based on the above-described embodiments, for the channel coding of the data sharing channel, if the format of the control information used to schedule the current transport block is the downlink control information format for uplink scheduling indicated by index M1, the LDPC code mother codeword will not include L codeword bits of the input information bits; if the format of the control information used to schedule the current transport block is the downlink control information format for uplink scheduling indicated by index M2, the LDPC code mother codeword will include L codeword bits of the input information bits. Wherein, M1 and M2 are positive integers greater than or equal to M1, and M2 is a positive integer. <M2。

[0217] In some embodiments, channel coding is performed using either a first coding type or a second coding type based on data characteristics, where the data characteristics are second-type parameters, and the second-type parameters are the format of the control information for scheduling transport blocks. Specifically, the first coding type is a multilateral LDPC code, and the second coding type is a unilateral LDPC code.

[0218] Based on the above application embodiments, for the channel coding of the data sharing channel, if the format of the control information used to schedule the current transport block is a fallback control information format, a one-sided LDPC code is selected; if the format of the control information used to schedule the current transport block is a none fallback control information format, a multi-sided LDPC code is selected.

[0219] Based on the above-described embodiments, for the channel coding of the data sharing channel, if the format of the control information used to schedule the current transport block is the downlink control information format for downlink scheduling indicated by index N1, a one-sided LDPC code is selected; if the format of the control information used to schedule the current transport block is the downlink control information format for uplink scheduling indicated by index N2, a multi-sided LDPC code is selected. Wherein, N1 and N2 are positive integers greater than or equal to N1. <N2。

[0220] Based on the above-described embodiments, for the channel coding of the data sharing channel, if the format of the control information used to schedule the current transport block is the downlink control information format for uplink scheduling indicated by index M1, a one-sided LDPC code is selected; if the format of the control information used to schedule the current transport block is the downlink control information format for uplink scheduling indicated by index M2, a multi-sided LDPC code is selected. Wherein, M1 and M2 are positive integers greater than or equal to M1... <M2。

[0221] It should be noted that the fallback control information format is mainly used to maintain the UE's connection when coverage deteriorates, and its load is relatively small. The fallback control information format can achieve more coding redundancy, but scheduling efficiency will decrease. Generally speaking, the smaller index indicates the fallback control information format, while the larger index indicates the none fallback control information format.

[0222] It should be noted that the above-mentioned "greater than" and "less than" thresholds can also include two variations: greater than or equal to a threshold, and less than a threshold; greater than a threshold, and less than or equal to a threshold. In an exemplary implementation, the fallback control information format can be DCI format 0_0 or DCI format 1_0 in the 5G NR standard, and the none fallback control information format is DCI format 0_1 ​​or DCI format 1_1.

[0223] In some embodiments, the selection of whether a mother codeword of length N includes the first L codeword bits of the input information bit sequence is based on data characteristics, where the data characteristics are a second type of parameter. This second type of parameter is the RNTI scrambled onto the CRC corresponding to the control information of the scheduled transport block, and the input information bit sequence can be the information bit sequence of the code block to be channel coded.

[0224] Based on the above application embodiments, channel coding is performed by selecting one of the first coding type or the second coding type according to the RNTI on the CRC corresponding to the control information scrambled in the scheduling transport block.

[0225] Based on the above application embodiments, for the channel coding of the data sharing channel, if the RNTI scrambled on the CRC corresponding to the control information of the scheduling transport block is a first type RNTI, the LDPC code mother code will include L codeword bits of the input information bits; if the RNTI scrambled on the CRC corresponding to the control information of the scheduling transport block is a second type RNTI, the LDPC code mother code will not include L codeword bits of the input information bits.

[0226] Among them, the RNTI scrambled on the CRC corresponding to the control information of the scheduled transmission block includes either the first type of RNTI or the second type of RNTI. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI) or CS-RNTI. The second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, or TC-RNTI.

[0227] In other embodiments, for channel coding of the data sharing channel, if the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block is a public RNTI, the LDPC code mother code will not include L codeword bits of the input information bits; if the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block is a private RNTI, the LDPC code mother code will include L codeword bits of the input information bits.

[0228] Based on the above application embodiments, channel coding is performed by selecting one of the first coding type or the second coding type according to the RNTI on the CRC corresponding to the control information scrambled in the scheduling transport block.

[0229] Based on the above application embodiments, for the channel coding of the data sharing channel, if the RNTI scrambled on the CRC corresponding to the control information of the scheduling transport block is a first type RNTI, a multi-sided LDPC code is selected; if the RNTI scrambled on the CRC corresponding to the control information of the scheduling transport block is a second type RNTI, a single-sided LDPC code is selected.

[0230] Based on the above application embodiments, for the channel coding scheme of the data sharing channel, if the RNTI scrambled on the CRC corresponding to the control information of the scheduling transport block is a public RNTI, a one-sided LDPC code is selected; if the RNTI scrambled on the CRC corresponding to the control information of the scheduling transport block is a proprietary RNTI, a multi-sided LDPC code is selected.

[0231] It is understandable that the current RNTI refers to the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block.

[0232] In some embodiments, the selection is based on data characteristics to determine whether a mother codeword of length N includes the first L codeword bits of the input information bit sequence. These data characteristics are second-type parameters. The second-type parameters refer to the search space corresponding to the control information of the scheduled transport block, and the input information bit sequence is the information bit sequence of the code block to be channel-coded.

[0233] Based on the above application embodiments, channel coding is performed by selecting one coding type from either the first coding type or the second coding type according to the search space corresponding to the control information of the scheduled transport block.

[0234] Based on the above application embodiments, if the current RNTI belongs to a search space type that supports the first encoding type, the LDPC code mother codeword will include L codeword bits of the input information bits; if the current RNTI belongs to a search space type that supports the second encoding type, the LDPC code mother codeword will not include L codeword bits of the input information bits. It can be understood that the current RNTI refers to the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block.

[0235] Based on the above application embodiments, for channel coding of the data sharing channel, if the search space corresponding to the control information of the scheduling transport block is a user-dedicated search space (USS), the LDPC code mother code will include L codeword bits of the input information bits; if the search space corresponding to the control information of the scheduling transport block is a public search space (CSS), the LDPC code mother code will not include L codeword bits of the input information bits.

[0236] In other embodiments, a first encoding type or a second encoding type is selected based on data characteristics, where the data characteristics are a second type of parameter. The second type of parameter is the search space corresponding to the control information of the scheduled transport block.

[0237] Based on the above application embodiments, if the current RNTI belongs to the search space type that supports the first encoding type, a multi-sided LDPC code is selected; if the current RNTI belongs to the search space type that supports the second encoding type, a single-sided LDPC code is selected. It can be understood that the current RNTI refers to the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block.

[0238] Based on the above application embodiments, for the channel coding of the data sharing channel, if the search space corresponding to the control information of the scheduling transport block is a user-dedicated search space (USS), a multi-sided LDPC code is selected; if the search space corresponding to the control information of the scheduling transport block is a public search space (CSS), a single-sided LDPC code is selected.

[0239] In some embodiments, the selection is based on data characteristics to determine whether a mother codeword of length N includes the first L codeword bits of the input information bit sequence. Here, data characteristics are a second type of parameter. The second type of parameter is the format of the control information for the scheduled transport block and the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block. The input information bit sequence can be the information bit sequence of the code block to be channel coded.

[0240] Based on the above application embodiments, according to the format of the control information of the scheduling transport block and the scrambling, RNTI selects one of the first coding type or the second coding type on the CRC corresponding to the control information of the scheduling transport block for channel coding.

[0241] Based on the above application embodiments, if the current control information format belongs to the corresponding RNTI type that supports the first encoding type, the first encoding type is used; if the current control information format belongs to the corresponding control information format that does not support the second encoding type or the RNTI type that does not support the second encoding type, the second encoding type is used.

[0242] Based on the above application embodiments, if the current control information format belongs to the none fallback control information format and the first type of RNTI, the LDPC code mother codeword will include L codeword bits of the input information bits. If the current control information format belongs to the fallback control information format or the second type of RNTI, the LDPC code mother codeword will not include the L codeword bits of the input information bits. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI.

[0243] Based on the above application embodiments, if the current control information format is the downlink scheduling control information format indicated by N2 and the current RNTI type is the first type of RNTI, the LDPC code mother codeword will include L codeword bits of the input information bits. If the current control information format is the downlink scheduling control information format indicated by N1 and the current RNTI type is the second type of RNTI, the LDPC code mother codeword will not include L codeword bits of the input information bits. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI.

[0244] It is understandable that the current RNTI refers to the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block.

[0245] In other embodiments, a first encoding type or a second encoding type is selected based on data characteristics, wherein the data characteristics are second-type parameters, and the second-type parameters include the format of the control information of the scheduled transport block and the scrambling of the CRC on the control information of the scheduled transport block to the RNTI.

[0246] Based on the above application embodiments, if the current control information format belongs to the none-fallback control information format and the first type of RNTI, a multi-sided LDPC code is selected. If the current control information format belongs to the fallback control information format or the second type of RNTI, a unilateral LDPC code is selected. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI.

[0247] Based on the above application embodiments, if the current control information format is the downlink scheduling control information format indicated by N2 and the current RNTI type is the first type of RNTI, a multilateral LDPC code is selected. If the current control information format is the downlink scheduling control information format indicated by N1 and the current RNTI type is the second type of RNTI, a unilateral LDPC code is selected. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI.

[0248] In some application embodiments, the mother codeword of length N is selected based on data characteristics to determine whether it includes the first L codewords or the last L codeword bits of the input information bit sequence. The data characteristics are second-type parameters, wherein the second-type parameters are the format of the control information of the scheduled transport block, the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block, and the search space corresponding to the control information of the scheduled transport block. The input information bit sequence is the information bit sequence of the code block to be channel coded.

[0249] Based on the above application embodiments, channel coding is performed by selecting one from the first coding type and the second coding type according to the format of the control information of the scheduling transport block, the RNTI scrambled on the CRC corresponding to the control information of the scheduling transport block, and the search space corresponding to the control information of the scheduling transport block.

[0250] Based on the above application embodiments, if the current control information format belongs to a control information format that supports the first encoding type, an RNTI type that supports the first encoding type, and a search space that supports the first encoding type, the first encoding type is adopted; if the current control information format belongs to a control information format that supports the second encoding type, or an RNTI type that supports the second encoding type, or a search space that supports the second encoding type, the second encoding type is adopted.

[0251] Based on the above-described embodiments, if a none-fallback control information format, a first-type RNTI type, and a user-dedicated search space are used, the LDPC code mother codeword will include L codeword bits of the input information bits. If a fallback control information format, a first-type RNTI type, or a public search space are used, the LDPC code mother codeword will not include the L codeword bits of the input information bits. The first-type RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI) or CS-RNTI; the second-type RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, or TC-RNTI.

[0252] Based on the above application embodiments, if the control information format for downlink scheduling indicated by index N2, the first type of RNTI, and the user-dedicated search space are used, the LDPC code mother codeword will include L codeword bits of the input information bits. If the control information format for downlink scheduling, the first type of RNTI, or the public search space indicated by index N1 are used, the LDPC code mother codeword will not include L codeword bits of the input information bits. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. N1 and N2 are positive integers greater than or equal to 0, and N1... <N2。

[0253] Based on the above application embodiments, if the control information format for uplink scheduling indicated by index M2, the first type of RNTI, and the user-dedicated search space are used, the LDPC code mother codeword will include L codeword bits of the input information bits. If the control information format for uplink scheduling indicated by index M1, the second type of RNTI, or the public search space are used, the LDPC code mother codeword will not include L codeword bits of the input information bits. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI, SPS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. M1 and M2 are positive integers greater than or equal to 0, and M1... <M2。

[0254] In some embodiments, a first encoding type or a second encoding type is selected based on data characteristics. The data characteristics are a second type of parameter. This second type of parameter includes the format of the control information for the scheduled transport block, the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block, and the search space corresponding to the control information of the scheduled transport block.

[0255] Based on the above application embodiments, channel coding is performed by selecting one of the first coding type and the second coding type according to the format of the control information of the scheduling transport block, the RNTI scrambled on the CRC corresponding to the control information of the scheduling transport block, and the search space corresponding to the control information of the scheduling transport block.

[0256] Based on the above application embodiments, if the current control information format belongs to a control information format that supports the first encoding type, an RNTI type that supports the first encoding type, and a search space that supports the first encoding type, the first encoding type is adopted; if the current control information format belongs to a control information format that supports the second encoding type, or an RNTI type that supports the fourth encoding type, or a search space that supports the second encoding type, the second encoding type is adopted.

[0257] Based on the above application embodiments, if a none-fallback control information format, a first-type RNTI type, and a user-dedicated search space are used, a multi-sided LDPC code is selected; if a fallback control information format, a first-type RNTI type, or a public search space are used, a unilateral LDPC code is selected. The first-type RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI) or CS-RNTI; the second-type RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, or TC-RNTI.

[0258] Based on the above application embodiments, if the control information format for downlink scheduling, the first type of RNTI type, and the user-dedicated search space indicated by index N2 are used, a multi-sided LDPC code is used; if the control information format for downlink scheduling, the first type of RNTI type, or the public search space indicated by index N1 are used, a unilateral LDPC code is used. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. N1 and N2 are positive integers greater than or equal to 0, and N1... <N2。

[0259] Based on the above application embodiments, if the control information format for uplink scheduling, the first type of RNTI type, and the user-dedicated search space indicated by index M2 are used, a multi-sided LDPC code is selected; if the control information format for uplink scheduling, the second type of RNTI type, or the public search space indicated by index M1 are used, a unilateral LDPC code is selected. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI, or SPS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, or TC-RNTI. M1 and M2 are positive integers greater than or equal to 0, and M1... <M2。

[0260] In some embodiments, the selection is based on data characteristics to determine whether a mother codeword of length N includes the first L codeword bits of the input information bit sequence. The data characteristics are a first type of parameter and a second type of parameter. The second type of parameter includes the format of the control information for the scheduled transport block, the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block, and the search space corresponding to the control information of the scheduled transport block. The first type of parameter is the Radio Resource Control (RRC) enabling signaling, and the input information bit sequence can be the information bit sequence of a code block for channel coding.

[0261] Based on the above-described embodiments, if the RRC enable signaling indication master codeword includes the first L bits of the input information bit sequence and employs a none fallback control information format, a first type RNTI type, and a user-dedicated search space, the LDPC code master codeword will include L codeword bits of the input information bits. If the RRC enable signaling indication master codeword does not include the first L bits of the input information bit sequence, or employs a fallback control information format, or uses a first type RNTI type, or employs a public search space, the LDPC code master codeword will not include L codeword bits of the input information bits. The first type RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI.

[0262] Based on the above application embodiments, if the RRC enable signaling indicates that the parent codeword includes the first L bits of the input information bit sequence, and uses the control information format for downlink scheduling indicated by index N2, the first type of RNTI, and the user-dedicated search space, the LDPC code parent codeword will include L codeword bits of the input information bits; if the RRC enable signaling indicates that the parent codeword does not include the first L bits of the input information bit sequence, or uses the control information format for downlink scheduling indicated by index N1, or uses the first type of RNTI, or uses a public search space, the LDPC code parent codeword will not include L codeword bits of the input information bits. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. N1 and N2 are positive integers greater than or equal to 0, and N1... <N2。

[0263] Based on the above application embodiments, if the RRC enable signaling indicates that the parent codeword includes the first L bits of the input information bit sequence, and uses the control information format for uplink scheduling indicated by index M2, the first type of RNTI, and the user-dedicated search space, the LDPC code parent codeword will include L codeword bits of the input information bits; if the RRC enable signaling indicates that the parent codeword does not include the first L bits of the input information bit sequence, or uses the control information format for uplink scheduling indicated by index M1, or uses the first type of RNTI, or uses a public search space, the LDPC code parent codeword will not include L codeword bits of the input information bits. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. M1 and M2 are positive integers greater than or equal to 0, and M1 <M2。

[0264] In some embodiments, a first encoding type or a second encoding type is selected based on data characteristics. The data characteristics are a first type of parameter and a second type of parameter. The second type of parameter includes the format of the control information for the scheduled transport block, the Radio Network Temporary Identifier (RNTI) scrambled onto the CRC corresponding to the control information of the scheduled transport block, and the search space corresponding to the control information of the scheduled transport block. The first type of parameter is the Radio Resource Control (RRC) enabling signaling.

[0265] Based on the above-described embodiments, if the RRC enable signaling indication master codeword includes the first L bits of the input information bit sequence and employs a none-fallback control information format, a first-type RNTI type, and a user-dedicated search space, a multi-sided LDPC code is selected. If the RRC enable signaling indication master codeword does not include the first L bits of the input information bit sequence, or employs a fallback control information format, or a first-type RNTI type, or employs a public search space, a unilateral LDPC code is selected. The first-type RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI) or CS-RNTI; the second-type RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, or TC-RNTI.

[0266] Based on the above application embodiments, if the RRC enable signaling indicates that the mother codeword includes the first L bits of the input information bit sequence, and uses the control information format for downlink scheduling indicated by index N2, the first type of RNTI, and the user-dedicated search space, a multi-sided LDPC code is selected; if the RRC enable signaling indicates that the mother codeword does not include the first L bits of the input information bit sequence, or uses the control information format for downlink scheduling indicated by index N1, or uses the first type of RNTI, or uses a public search space, a unilateral LDPC code is selected. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. N1 and N2 are positive integers greater than or equal to 0, and N1... <N2。

[0267] Based on the above application embodiments, if the RRC enable signaling indicates that the mother codeword includes the first L bits of the input information bit sequence, and uses the control information format for uplink scheduling indicated by index M2, the first type of RNTI, and the user-dedicated search space, a multi-sided LDPC code is selected; if the RRC enable signaling indicates that the mother codeword does not include the first L bits of the input information bit sequence, or uses the control information format for uplink scheduling indicated by index M1, or uses the first type of RNTI, or uses a public search space, a unilateral LDPC code is selected. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. M1 and M2 are positive integers greater than or equal to 0, and M1 <M2。

[0268] Step S240, bit selection: Write the C encoded mother codewords of length N into C circular buffers of length Ncb. Then, starting from position k0 in each circular buffer, sequentially select E codeword bit sequences to obtain the C bit-selected output sequence. Here, Ncb is a positive integer, and k0 is an integer greater than or equal to 0.

[0269] In this embodiment of the application, the starting position k0 is obtained based on the redundancy version (RV), wherein the downlink control information (DCI) carried by the downlink control channel PDCCH indicates the redundancy version.

[0270] In this embodiment, the redundant version with a value of 0 indicates that the starting position k0 is at bit position 0 of the circular buffer.

[0271] Specifically, bit selection generates a HARQ sub-packet for the current transmission of a HARQ process. The number of bits E read from the circular buffer for the current transmission of a HARQ process is determined based on the number of allocated resource elements, the modulation scheme, and the number of transmission layers.

[0272] Step S250, code block interleaving: interleave the input rate matching output sequence of each code block to obtain an interleaved sequence of C outputs.

[0273] Step S260, code block concatenation: Concatenate the C interleaved sequences in order to obtain the output sequence after code block concatenation.

[0274] It is understood that the above sequence of steps is only for distinguishing steps and is not intended to restrict the execution order of steps. One or more steps in the above application embodiments can be deleted, or one or more additional steps can be added. For example, transport block CRC addition can be omitted, or code block segmentation and code block CRC addition can be omitted.

[0275] Figure 4 is a flowchart of another channel coding method for transport blocks provided in an embodiment of this application. This embodiment of the application is applicable to data transmission between different communication nodes. The method can be executed by a channel coding device for transport blocks, which is generally integrated into the communication node. The communication node may include a base station, a terminal, etc. Referring to Figure 4, the method provided in this embodiment of the application specifically includes the following steps:

[0276] Step 310: Determine whether the transport block is segmented into code blocks; if the transport block is not segmented into code blocks, determine the number of code blocks C to be 1; if the transport block is segmented into code blocks, determine the number of code blocks C, segment the input data sequence into code blocks, and add a cyclic redundancy check bit sequence to each segmented code block, wherein the number of code blocks C is greater than 1, and the input data sequence includes at least one of the following: transport block, transport block and a concatenated sequence of cyclic redundancy check bit sequences of transport block.

[0277] Furthermore, in some application embodiments, before determining whether the transport block is to be segmented into code blocks, the method further includes: adding CRC to the transport block, which can be done by adding the generated CRC check bit sequence to the end of the transport block.

[0278] Step 320: Perform low-density parity-check coding on the C code blocks to obtain C mother codewords of length N. Each mother codeword includes the entire input information bit sequence, which is the information bit sequence of the code block.

[0279] In this embodiment, low-density parity-check coding can be performed on C code blocks to generate C parent codewords of length N, where N is a positive integer. Each parent codeword includes the complete sequence of input information bits, which can be the information bit sequence of the code block or the transport block being channel-coded.

[0280] Step 330: Write the C mother codewords of length N into their respective circular buffers of length Ncb. Starting from the beginning position K0 of each circular buffer, sequentially select E codeword bit sequences to obtain the bit selection sequences corresponding to the C mother codewords. The beginning position K0 is obtained based on the redundancy version information. Based on the data characteristics, the beginning position of the redundancy version 0 information is selected as 0 or L. N, E, Ncb and L are positive integers greater than 1.

[0281] In this embodiment of the application, bit selection can be performed on C mother codewords of length N. The C mother codewords of length N can be written into C circular buffers of length Ncb bits respectively. Then, starting from the starting position K0 of each circular buffer, the bit sequence of E codewords is selected sequentially to obtain the bit selection sequence after C bit selection.

[0282] Specifically, the starting position K0 is obtained based on the redundant version information. The starting position of the redundant version 0 information in this redundant version information can be selected as 0 or L through data features.

[0283] In some application embodiments, L equals 2*Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0284] In other embodiments, L equals Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0285] In other embodiments, L is a positive integer greater than 1 and less than or equal to 2*Zc.

[0286] Based on the above-described embodiments, the size of the circular buffer is determined based on a finite buffer rate matching parameter.

[0287] In this embodiment, the circular buffer length Ncb can be determined based on the Limited Buffer Rate Matching (LBRM) parameter.

[0288] Based on the above application embodiments, it also includes: not supporting finite buffer rate matching, and the length Ncb of the circular buffer is equal to the length N of the parent codeword.

[0289] In this embodiment of the application, when finite buffer rate matching is not supported, the length of the circular buffer Ncb = N, where N is the length of the mother codeword.

[0290] In other embodiments, the method further includes: supporting finite buffer rate matching, wherein the length Ncb of the circular buffer is the minimum value between the length N of the mother codeword and Nref, wherein Nref is determined according to the preset maximum number of transmission layers, maximum modulation order, maximum coding rate and maximum resource block allocation.

[0291] In this embodiment of the application, when supporting finite buffer rate matching, the length Ncb of the circular buffer can be the minimum value of the mother code length N and Nref. The Nref can be determined by the preset maximum number of supported layers, maximum modulation order, maximum coding rate and maximum resource block allocation. Ncb, N and Nref are all positive integers greater than 1.

[0292] In some other embodiments, the starting position K0 is obtained based on the redundancy version information, wherein the redundancy version information is indicated by the downlink control information carried by the downlink control channel.

[0293] In this embodiment, the starting position K0 can be determined by redundant version information, which can be indicated by downlink control information, which can be carried on the downlink control channel.

[0294] Based on the above application embodiments, it further includes: selecting the starting positions of redundant version 0 information, redundant version 1 information, redundant version 2 information and redundant version 3 information of redundant version information according to the feature data as 0, floor((a1*Ncb) / ((nb-2)*Zc))*Zc, floor((a2*Ncb) / ((nb-2)*Zc))*Zc and floor((a3*Ncb) / ((nb-2)*Zc))*Zc or 2*Zc, (floor((b1*Ncb) / (nb*Zc))+2)*Zc, (floor((b2*Ncb) / (nb*Zc))+2)*Zc and (floor((b3*Ncb) / (nb*Zc))+2)*Zc respectively;

[0295] Where L, a1, a2, a3, b1, b2, and b3 are integers greater than 1, floor represents the floor operation, nb represents the list of the corresponding basic graph matrices, and Zc is the boost value.

[0296] Based on the above application embodiments, the starting position k0 is obtained according to the redundancy version (RV), wherein the downlink control information (DCI) carried by the downlink control channel PDCCH indicates the redundancy version.

[0297] In one exemplary embodiment, a channel coding method for transport blocks is provided, applicable to the transmission of base stations, terminals, or other communication transmission nodes. Furthermore, it can be applied to next-generation 6G mobile communication systems and subsequent 7G mobile communication systems, or next-generation fixed access wireless communication systems, or next-generation local area networks. Referring to Figure 5, the method includes the following steps:

[0298] Step S410, CRC addition to transport block: Add the generated CRC check bit sequence to the end of the input transport block.

[0299] Step S420, code block segmentation and code block CRC addition: Determine whether code block segmentation is needed; if code block segmentation is not needed, the number of code blocks C is 1; if code block segmentation is needed, determine the number of code blocks C; if C>1, segment the input data sequence into code blocks and add CRC to the segmented code blocks or code block groups.

[0300] Adding CRC to segmented code blocks or code block groups includes: 1) adding a CRC (Cyclic redundancy check) sequence to each segmented code block, or 2) first segmenting the code blocks and then grouping them, and then adding CRC to each group of code blocks, or 3) both of the above methods of adding CRC.

[0301] Step S430, Channel Coding: Encode the C code blocks using quasi-cyclic LDPC codes to generate C mother codewords of length N. Each mother codeword includes the entire sequence of input information bits, where N and Ncb are positive integers.

[0302] Furthermore, the size of the circular buffer is calculated based on the finite buffer rate matching (LBRM) parameter.

[0303] Furthermore, if Limited Buffer Rate Matching (LBRM) is not supported, Ncb = N.

[0304] Furthermore, if finite cyclic buffer rate matching is supported, Ncb is the minimum of N and Nref, where Nref is determined based on the preset maximum supported number of layers, maximum modulation order, maximum coding rate, and maximum resource block allocation. Ncb, N, and Nref are all positive integers greater than 1.

[0305] Furthermore, the encoding type is selected based on the data characteristics. The encoding type includes a first encoding type or a second encoding type. The first encoding type is a multi-sided quasi-cyclic LDPC code; the second encoding type is a single-sided LDPC code. The binary parity check matrix H of the single-sided quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. Each block sub-matrix is ​​a cyclic shift matrix of a Zc×Zc zero matrix, a Zc×Zc identity matrix, or a Zc×Zc identity matrix, and includes at least multiple cyclic shift matrices of Zc×Zc identity matrices or identity matrices.

[0306] The binary parity check matrix H of the polygonal quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. The block sub-matrices are Zc×Zc zero matrices, Zc×Zc identity matrices, cyclic shift matrices of Zc×Zc identity matrices, or Zc×Zc polygonal sub-matrices, and include at least multiple Zc×Zc polygonal sub-matrices. The number of "1" elements in each column of the Zc×Zc polygonal block sub-matrices is equal to 2.

[0307] Furthermore, the number of "1" elements in each column of the Zc×Zc polygonal block submatrix is ​​greater than or equal to 2.

[0308] It should be noted that existing 3GPP standards have already specified the concept of LBRM to help reduce the requirement for large code blocks in the buffer. This helps reduce device costs by reducing memory requirements. The downside is that transmitting large code blocks may degrade performance. When transmitting smaller code blocks, LBRM does not affect performance, as these blocks can be fully accommodated by the circular buffer. If the circular buffer size is limited by "Nref", only a subset of the channel-coded bits is written to the circular buffer. Excluded parity bits are never transmitted over the air interface. While reducing storage costs, this reduces the performance gains of HARQ incremental redundancy.

[0309] Furthermore, in the LDPC code mother codeword of length N, the entire input information bit sequence is placed at the beginning, and the parity bits generated by LDPC encoding are placed at the end.

[0310] Step S440, bit selection: Write C encoded mother codewords of length N into C circular buffers respectively, and then sequentially select E codeword bit sequences starting from the starting position k0 in each circular buffer to obtain the output sequence after C bit selection.

[0311] Determining Redundancy Version 0: Select the starting position of Redundancy Version 0 based on data characteristics, choosing either 0 or L, where L is a positive integer greater than 1.

[0312] Optionally, L equals 2*Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0313] Optionally, L equals Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0314] Optionally, L is a positive integer greater than 1 and less than or equal to 2*Zc.

[0315] Optionally, L equals Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0316] Determining the four redundant versions: The starting positions of the redundant versions [0,1,2,3] are selected based on data characteristics.

[0317] [0,floor((a1*Ncb) / ((nb-2)*Zc))*Zc,floor((a2*Ncb) / ((nb-2)*Zc))*Zc,floor((a3*Ncb) / ((nb-2)*Zc))*Zc] or [2*Zc,(floor((b1*Ncb) / (nb*Zc))+2)*Zc,(floor((b2*Ncb) / (nb*Zc))+2)*Zc,(floor((b3*Ncb) / (nb*Zc))+2)*Zc], where L, a1, a2, a3, b1, b2, and b3 are positive integers greater than 1, floor represents the floor operation, nb represents the number of columns in the corresponding base graph (BG), and Zc is the lift value.

[0318] Optionally, b1 = a1 + Δ1, b2 = a2 + Δ2, b3 = a3 + Δ3, where Δ1, Δ2, and Δ3 are 0, 1, or 2.

[0319] Alternatively, b1 = a1, b2 = a2 + 1, b3 = a2 + 2.

[0320] Optionally, b1 = a1, b2 = a2+1, b3 = a2+1.

[0321] Alternatively, b1 = a1, b2 = a2 + 1, b3 = a2 + 3.

[0322] Alternatively, b1 = a1, b2 = a2 + 1, b3 = a2 + 2.

[0323] Furthermore, based on data characteristics, the starting positions of the redundant versions [0,1,2,3] are respectively...

[0324] [0,floor((17*Ncb) / (66*Zc))*Zc,floor((33*Ncb) / (66*Zc))*Zc,floor((56*Ncb) / (66*Zc))*Zc] or [2*Zc,(floor((17*Ncb) / (68*Zc))+2)*Zc,(floor((34*Ncb) / (68*Zc))+2)*Zc,(floor((57*Ncb) / (68*Zc))+2)*Zc], where Zc is the boost value.

[0325] Furthermore, based on data characteristics, the starting positions of the redundant versions [0,1,2,3] are respectively...

[0326] [0,floor((17*Ncb) / (66*Zc))*Zc,floor((33*Ncb) / (66*Zc))*Zc,floor((56*Ncb) / (66*Zc))*Zc] or [2*Zc,(floor((17*Ncb) / (68*Zc))+2)*Zc,(floor((34*Ncb) / (68*Zc))+2)*Zc,(floor((58*Ncb) / (68*Zc))+2)*Zc], where Zc is the boost value.

[0327] It should be noted that, regarding the definition of the starting position of RV in the embodiments of this application, one independent protection scheme is that the combination of RV=0 and RV=1 in the embodiments of this application is determined by the RV determination method provided in the embodiments of this application, while RV=2 and RV=3 can be unrestricted or determined by other methods; as another independent protection scheme, the combination of the RV=0 feature and the RV2 feature is determined by the determination method provided in the embodiments of this application, while RV=1 and RV3 can be unrestricted or determined by other methods; as another independent protection scheme, the determination of RV=0 and RV3 is implemented by the RV determination method provided in the embodiments of this application, while RV1 and RV2 can be unrestricted or determined by other methods.

[0328] Definition of a circular cache:

[0329] Circular cache method 1: For a circular cache of length Ncb, the bit following any bit except the last bit refers to the bit immediately following it, and the bit following the last bit is the first bit (corresponding to index 0). It should be noted that this is the most common method.

[0330] Circular cache method 2: For a circular cache of length Ncb, the next bit after any bit except the last bit refers to the bit immediately preceding it, and the bit preceding the last bit is the Lth bit (corresponding to the index L).

[0331] Based on the data characteristics, the circular caching method is selected to determine whether to use circular caching method 1 or circular caching method 2. It should be noted that different circular caching methods will result in different performance and complexity of HARQ retransmission merging.

[0332] Furthermore, the starting position k0 is obtained based on the redundancy version (RV), where the downlink control information (DCI) carried by the downlink control channel PDCCH indicates the redundancy version.

[0333] Specifically, the starting position k0 of the current transfer of a HARQ process in the circular buffer is determined based on the redundant version.

[0334] It should be noted that redundancy version 0 is generally used to determine the starting position in the circular buffer for the initial transmission of the transport block of a HARQ process.

[0335] Data feature description:

[0336] Optionally, the data feature at least includes a first type of parameter, where the first type of parameter at least includes one of the following: code rate and modulation order and transmission layer number, code block number, and the number of resources occupied by the transport block. Further, optionally, the data feature at least further includes a threshold value of the first type of parameter.

[0337] Optionally, the data feature at least includes a first type of parameter, where the first type of parameter at least includes the number of code blocks. Further, optionally, the data feature at least further includes a threshold value of the first type of parameter.

[0338] The data feature at least includes a first type of parameter, where the first type of parameter at least includes code rate, modulation order, transmission layer number, and the number of resources occupied by the transport block.

[0339] Optionally, the data feature at least includes a second type of parameter, where the second type of parameter at least includes one of the following: the format of the control information for scheduling the transport block, the Radio Network Temporary Identifier (RNTI) scrambled on the CRC corresponding to the control information for scheduling the transport block, and the search space type corresponding to the control information for scheduling the transport block.

[0340] Optionally, the second type of parameter is the format of the control information for scheduling the transport block.

[0341] Optionally, the second type of parameter is the format of the control information for scheduling the transport block and the RNTI scrambled on the CRC corresponding to the control information for scheduling the transport block.

[0342] Further, optionally, the format of the control information for scheduling the transport block includes a fallback control information format and a non-fallback control information format.

[0343] Further, optionally, the format of the control information for scheduling the transport block includes a downlink control information format indicated by the N1 index or a downlink control format for downlink scheduling indicated by the N2 index, where N1 and N2 are used to distinguish different downlink control information formats for downlink scheduling, N1 and N2 are positive integers greater than or equal to 0, and N1<N2. Still further, optionally, N1 is used to indicate the fallback control information format, and N2 is used to indicate the non-fallback control information format.

[0344] Further, optionally, the format of the control information for scheduling a transport block includes a downlink control information format indicated by an N3 index or a downlink control format for downlink scheduling indicated by an N4 index, where N1 and N2 are used to distinguish different downlink control information formats for downlink scheduling, N3 and N4 are different single English letters, and N3 precedes N4 in alphabetical order. Still further optionally, N3 is used to indicate the fallback control information format, and N4 is used to indicate the non-fallback control information format.

[0345] Further, optionally, the format of the control information for scheduling a transport block includes a downlink control information format indicated by an M1 index or a downlink control format for uplink scheduling indicated by an M2 index, where M1 and M2 are used to distinguish different downlink control information formats for uplink scheduling, M1 and M2 are positive integers greater than or equal to 0, and M1 < M2. Still further optionally, M1 is used to indicate the fallback control information format, and M2 is used to indicate the non-fallback control information format.

[0346] Further, optionally, the format of the control information for scheduling a transport block includes a downlink control information format indicated by an M3 index and a downlink control format for uplink scheduling indicated by an M4 index, where M3 and M4 are used to distinguish different downlink control information formats for uplink scheduling, M3 and M4 are different single English letters, and M3 precedes M4 in alphabetical order. Still further optionally, M3 is used to indicate the fallback control information format, and M4 is used to indicate the non-fallback control information format.

[0347] Further, the RNTI scrambled on the CRC corresponding to the control information for scheduling a transport block includes a first type of RNTI or a second type of RNTI, where the first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier C-RNTI, CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI.

[0348] It should be noted that in the embodiments of the present application, the RNTI scrambled on the CRC corresponding to the control information for scheduling a transport block is briefly referred to as the current RNTI.

[0349] Further, the RNTI scrambled on the CRC corresponding to the control information for scheduling a transport block includes a first type of RNTI and a second type of RNTI, where the first type of RNTI is an RNTI related to a common message; the second type of RNTI is an RNTI related to a dedicated message.

[0350] Furthermore, the search space includes the Public Search Space (CSS) and the User-Specific Search Space (UESS).

[0351] Furthermore, optionally, the data features include at least a first type of parameter, which is the modulation order, transmission layer number, and code rate of the corresponding transport block.

[0352] Furthermore, the data features include at least the first type of parameters and the second type of parameters.

[0353] The data features in the embodiments of this application include, but are not limited to, all the descriptions above.

[0354] In one exemplary implementation:

[0355] The starting position of redundant version 0 is selected as 0 or L based on data characteristics, where L is a positive integer greater than 1. Data characteristics are first-class parameters, which are the code rate, modulation order, and number of transmission layers used for the transport block.

[0356] The preset length parameter is determined based on the code rate, modulation order, and number of transmission layers. When the code rate, modulation order, and number of transmission layers are high, the starting position of redundant version 0 in the Ncb length cyclic buffer is 0. If the code rate, modulation order, and number of transmission layers are low, the starting position of redundant version 0 in the Ncb length cyclic buffer is L.

[0357] The preset length parameter is determined based on the code rate, modulation order, and number of transmission layers. When the code rate, modulation order, and number of transmission layers are high, the starting position of redundant version 0 in the Ncb length cyclic buffer is 0. If the code rate, modulation order, and number of transmission layers are low, the starting position of redundant version 0 in the Ncb length cyclic buffer is L.

[0358] From a technical perspective, our extensive research has revealed that the technical solution can yield different benefits depending on the specific circumstances. At higher code rates, higher modulation orders, and more transmission layers, it can reduce the maximum number of iterations, significantly improving decoder throughput and reducing decoder complexity. Conversely, at lower code rates, lower modulation orders, and fewer transmission layers, it can significantly improve the link performance of LDPC codes.

[0359] In one exemplary implementation:

[0360] The starting position of redundant version 0 is selected based on data characteristics, either 0 or L, where L is a positive integer greater than 1. Data characteristics are first-class parameters.

[0361] Furthermore, the first type of parameter is the number of code blocks, C.

[0362] Optionally, as a channel coding scheme for the data sharing channel, if the number of code blocks C is greater than a preset threshold, the starting position of redundant version 0 in the Ncb-length circular buffer is 0. If the number of code blocks C is less than the preset threshold, the starting position of redundant version 0 in the Ncb-length circular buffer is L, and the data characteristics are the first type of parameters. Here, C and L are positive integers greater than or equal to 1. It should be noted that the above-mentioned "greater than" and "less than" thresholds can also include two variations: greater than or equal to and less than, and greater than and less than or equal to.

[0363] From a technical perspective, our extensive research has shown that the technical solution can yield different benefits depending on the situation. When the number of code blocks is large, it can reduce the maximum number of iterations, significantly improving the decoder's throughput and reducing its complexity. When the number of code blocks is small, it can significantly improve the link performance of LDPC codes.

[0364] In one exemplary implementation:

[0365] The starting position of redundant version 0 is selected as 0 or L based on data characteristics, where L is a positive integer greater than 1. The data characteristics are the second type of parameters, which are the format of the control information for scheduling transport blocks.

[0366] Optionally, as a channel coding scheme for the data sharing channel, if the format of the control information used to schedule the current transport block is a fallback control information format, the starting position of the redundancy version 0 in the Ncb-length circular buffer is L; if the format of the control information used to schedule the current transport block is a none fallback control information format, the starting position of the redundancy version 0 in the Ncb-length circular buffer is 0.

[0367] Optionally, as a channel coding scheme for the data sharing channel, if the format of the control information used to schedule the current transport block is the downlink control information format for downlink scheduling indicated by index N1, the starting position of redundant version 0 in the Ncb-length circular buffer is L; if the format of the control information used to schedule the current transport block is the downlink control information format for uplink scheduling indicated by index N2, the starting position of redundant version 0 in the Ncb-length circular buffer is 0. Wherein, N1 and N2 are positive integers greater than or equal to N1. <N2。

[0368] Optionally, as a channel coding scheme for the data sharing channel, if the format of the control information used to schedule the current transport block is the downlink control information format for uplink scheduling indicated by index M1, the starting position of redundant version 0 in the Ncb-length circular buffer is L; if the format of the control information used to schedule the current transport block is the downlink control information format for uplink scheduling indicated by index M2, the starting position of redundant version 0 in the Ncb-length circular buffer is 0. Wherein, M1 and M2 are positive integers greater than or equal to them, and M1... <M2。

[0369] The fallback control information format is mainly used to maintain the UE's connection when coverage deteriorates, and its load is relatively small. The fallback control information format can achieve more coding redundancy, but scheduling efficiency will be reduced.

[0370] It should be noted that the terms "greater than" and "less than" above can also include two variations: greater than or equal to and less than, and greater than and less than or equal to. For example, in the 5G NR standard, the Fallback control information format is DCI format 0_0 or DCI format 1_0, and the nonefallback control information format is DCI format 0_1 ​​or DCI format 1_1.

[0371] In one exemplary implementation: the starting position of redundancy version 0 is selected as 0 or L based on data characteristics, where L is a positive integer greater than 1. The data characteristics are second-type parameters. Specifically, the second-type parameter is the Radio Network Temporary Identifier (RNTI) scrambled onto the CRC corresponding to the control information of the scheduled transport block.

[0372] Optionally, an encoding method is selected from both the first encoding type and the second encoding type based on the Radio Network Temporary Identifier (RNTI) on the CRC corresponding to the control information of the scheduled transport block.

[0373] It should be noted that, for the sake of simplicity, the current RNTI refers to the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block.

[0374] Optionally, as a channel coding scheme for the data sharing channel, if the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block is a first-type RNTI, the starting position of the redundancy version 0 in the Ncb-length circular buffer is 0; if the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block is a second-type RNTI, the starting position of the redundancy version 0 in the Ncb-length circular buffer is L.

[0375] Among them, the RNTI scrambled on the CRC corresponding to the control information of the scheduled transmission block includes a first type of RNTI and a second type of RNTI. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI) or CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, or TC-RNTI.

[0376] As a channel coding scheme for a data sharing channel, if the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block is a proprietary RNTI, the starting position of the redundancy version 0 in the Ncb length circular buffer is 0; if the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block is a public RNTI, the starting position of the redundancy version 0 in the Ncb length circular buffer is L.

[0377] In one exemplary implementation:

[0378] The starting position of redundant version 0 is selected based on data characteristics, either 0 or L, where L is a positive integer greater than 1. The data characteristics are the second type of parameters. These second type of parameters represent the search space corresponding to the control information of the scheduled transport block.

[0379] Optionally, as a channel coding scheme for the data sharing channel, if the search space corresponding to the control information of the scheduled transport block is a user-dedicated search space (USS), the starting position of the redundant version 0 in the Ncb-length circular buffer is 0; if the search space corresponding to the control information of the scheduled transport block is a public search space (CSS), the starting position of the redundant version 0 in the Ncb-length circular buffer is L.

[0380] In one exemplary implementation:

[0381] The starting position of redundancy version 0 is selected as 0 or L based on data characteristics, where L is a positive integer greater than 1. The data characteristics are the second type of parameters. These second type of parameters include the format of the control information for the scheduled transport block and the Radio Network Temporary Identifier (RNTI) scrambled onto the CRC corresponding to the control information of the scheduled transport block.

[0382] Optionally, if the current control information format belongs to the none fallback control information format and the first type of RNTI, the starting position of the redundancy version 0 in the Ncb length circular buffer is 0. If the current control information format belongs to the fallback control information format or the second type of RNTI, the starting position of the redundancy version 0 in the Ncb length circular buffer is L. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI.

[0383] Optionally, if the current control information format is the downlink scheduling control information format indicated by N2 and the current RNTI type is the first type of RNTI, the starting position of the redundancy version 0 in the Ncb length circular buffer is 0. If the current control information format is the downlink scheduling control information format indicated by N1 and the current RNTI type is the second type of RNTI, the starting position of the redundancy version 0 in the Ncb length circular buffer is L. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. Wherein, N1... <N2。

[0384] Optionally, if the current control information format is the uplink scheduling control information format indicated by M2 and the current RNTI type is the first type of RNTI, the starting position of redundancy version 0 in the Ncb length circular buffer is 0. If the current control information format is the uplink scheduling control information format indicated by M1 and the current RNTI type is the second type of RNTI, the starting position of redundancy version 0 in the Ncb length circular buffer is L. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. M1 <M2。

[0385] In one exemplary implementation:

[0386] The starting position of redundancy version 0 is selected as 0 or L based on data characteristics, where L is a positive integer greater than 1. Data characteristics are the second type of parameters. These second type of parameters include the format of the control information for the scheduled transport block, the Radio Network Temporary Identifier (RNTI) scrambled onto the CRC corresponding to the control information of the scheduled transport block, and the search space corresponding to the control information of the scheduled transport block.

[0387] Optionally, the starting position of redundancy version 0 can be selected as 0 or L, depending on the format of the control information of the scheduling transport block, the radio network temporary identifier (RNTI) scrambled on the CRC corresponding to the control information of the scheduling transport block, and the search space corresponding to the control information of the scheduling transport block.

[0388] Optionally, if the none fallback control information format, the first type of RNTI, and the user-dedicated search space are used, the starting position of redundancy version 0 is 0; if the fallback control information format, the first type of RNTI, or the public search space are used, the starting position of redundancy version 0 is L. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI.

[0389] Optionally, if the control information format for downlink scheduling, the first type of RNTI, and the user-dedicated search space indicated by index N2 are used, the starting position of redundancy version 0 is 0. If the control information format for downlink scheduling, the first type of RNTI, or the public search space indicated by index N1 are used, the starting position of redundancy version 0 is L. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. N1 and N2 are positive integers greater than or equal to 0, and N1... <N2。

[0390] Optionally, if the control information format for uplink scheduling, the first type of RNTI, and the user-dedicated search space indicated by index M2 are used, the starting position of redundancy version 0 is 0. If the control information format for uplink scheduling, the second type of RNTI, or the public search space indicated by index M1 are used, the starting position of redundancy version 0 is L. The first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI, or SPS-RNTI; the second type of RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, or TC-RNTI. M1 and M2 are positive integers greater than or equal to 0, and M1... <M2。

[0391] In one exemplary implementation:

[0392] The starting position of redundancy version 0 is selected as 0 or L based on data characteristics, where L is a positive integer greater than 1. The data characteristics are a first type of parameter and a second type of parameter. The second type of parameter includes the format of the control information for the scheduled transport block, the Radio Network Temporary Identifier (RNTI) scrambled onto the CRC corresponding to the control information of the scheduled transport block, and the search space corresponding to the control information of the scheduled transport block. The first type of parameter is the Radio Resource Control (RRC) enabling signaling.

[0393] Optionally, if the Radio Resource Control (RRC) enables the signaling indication master codeword to include the first L bits of the input information bit sequence, and employs a none fallback control information format, a Type I RNTI type, and a user-dedicated search space, the starting position of Redundancy Version 0 is 0. If the RRC enables the signaling indication master codeword to not include the first L bits of the input information bit sequence, or employs a fallback control information format, or a Type I RNTI type, or a public search space, the starting position of Redundancy Version 0 is L. The Type I RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the Type II RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI.

[0394] Optionally, if the Radio Resource Control (RRC) enable signaling indication master codeword includes the first L bits of the input information bit sequence, uses the control information format for downlink scheduling indicated by index N2, the first type RNTI, and a user-dedicated search space, the starting position of redundancy version 0 is 0; if the RRC enable signaling indication master codeword does not include the first L bits of the input information bit sequence, or uses the control information format for downlink scheduling indicated by index N1, or uses the first type RNTI, or uses a public search space, the starting position of redundancy version 0 is L. The first type RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. N1 and N2 are positive integers greater than or equal to 0, and N1... <N2。

[0395] Optionally, if the Radio Resource Control (RRC) enable signaling indication master codeword includes the first L bits of the input information bit sequence, and uses the control information format for uplink scheduling indicated by index M2, the first type RNTI type, and the user-dedicated search space, the starting position of redundancy version 0 is 0; if the RRC enable signaling indication master codeword does not include the first L bits of the input information bit sequence, or uses the control information format for uplink scheduling indicated by index M1, or uses the first type RNTI type, or uses a public search space, the starting position of redundancy version 0 is L. The first type RNTI includes at least one of the following: Cell Radio Network Temporary Identifier (C-RNTI), CS-RNTI; the second type RNTI includes at least one of the following: SI-RNTI, RA-RNTI, P-RNTI, TC-RNTI. M1 and M2 are positive integers greater than or equal to 0, and M1... <M2。

[0396] Step S450, code block interleaving: interleave the input rate matching output sequence of each code block to obtain an interleaved sequence of C outputs.

[0397] Step S460, code block concatenation: Concatenate the C interleaved sequences in order to obtain the output sequence after code block concatenation.

[0398] It is understood that the above sequence of steps is only for distinguishing steps and is not intended to restrict the execution order of steps. One or more steps in the above application embodiments can be deleted, or one or more additional steps can be added. For example, transport block CRC addition can be omitted, or code block segmentation and code block CRC addition can be omitted.

[0399] Figure 6 is a flowchart of a channel decoding method for a transport block provided in an embodiment of this application. This embodiment is applicable to data transmission between different communication nodes. The method can be executed by a channel decoding device for a transport block, which is generally integrated into a communication node. The communication node may include a base station, a terminal, etc. Referring to Figure 6, the method provided in this embodiment specifically includes the following steps:

[0400] Step 510: Obtain the deinterleaved sequence of C selected bits, and write the C selected bits into a circular buffer of length Ncb. Based on the mother codeword length N and the starting position K0, restore the codeword sequence of the C circular buffers to the mother codeword of length N. It is determined whether the mother codeword of length N includes the first L codeword bits of the input information bit sequence according to the data characteristics, where L is a positive integer greater than 1.

[0401] In this embodiment, a deinterleaved sequence of C selected bits can be obtained. These C selected bits can be written into a circular buffer of length Ncb. Based on the mother codeword length N and the starting position K0, the codeword sequences of the C circular buffers are restored to a mother codeword of length N. This process can be the reverse of the bit selection process described in the previous embodiment, restoring the selected bit sequence to the mother codeword. During the restoration of the mother codeword, it can be determined based on data characteristics whether the mother codeword of length N includes the first L codeword bits of the input information bit sequence. This input information bit sequence can be the information bit sequence of the code block used for channel coding during the channel coding process.

[0402] Step 520: Perform low-density parity-check code channel decoding on C mother codewords of length N to generate C decoded code blocks of length N, where N, Ncb, and C are integers.

[0403] Specifically, each code block sequence in the C input mother codewords can be individually decoded using low-density parity-check codes to obtain C decoded code blocks of length N.

[0404] Based on the above-described embodiments, it also includes at least one of the following:

[0405] Perform cyclic redundancy check on the decoded code block and the decoded segment;

[0406] Perform cyclic redundancy check (CR) on the transport block, wherein the transport block includes at least one of the following: a decoded code block, or a decoded code block after CR.

[0407] In this embodiment, after obtaining the decoded code block, cyclic redundancy check (CRC) can be performed on the decoded segment and decoded block. A CRC check can be performed on the sequence of the decoded code block using a given CRC polynomial to determine whether the transmission block has been correctly received. Alternatively, a detransmission block CRC check can be performed on the transmission block using a given CRC polynomial to determine whether the transmission block has been correctly received. This transmission block may include the decoded code block, the decoded block CRC-checked code block, etc.

[0408] In other application embodiments, at least one of the following may also be included: code block deconcatenation and code block deinterleaving.

[0409] Specifically, the received code block sequence can be subjected to at least one of code block deconcatenation and code block deinterleaving. For code block deconcatenation, the input concatenated code block sequences can be deconcatenated to obtain a soft bit sequence of C code blocks. For code block deinterleaving, the obtained soft bit sequence of C code blocks can be deinterleaved to obtain C deinterleaved codeword sequences as the bit selection sequence.

[0410] In some embodiments, the method further includes: selecting the encoding type of the channel decoding based on data characteristics, wherein the encoding type includes a first encoding type and a second encoding type;

[0411] Wherein, the first encoding type is a multi-sided quasi-cyclic LDPC code, and the second encoding type is a unilateral quasi-cyclic LDPC code;

[0412] The binary parity check matrix H of the single-sided quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. The block sub-matrices are cyclic shift matrices of Zc×Zc zero square matrix, Zc×Zc identity matrix, or Zc×Zc identity matrix, and include at least multiple cyclic shift matrices of Zc×Zc identity matrix or identity matrix.

[0413] The binary parity check matrix H of the polygonal quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. Each block sub-matrix is ​​a Zc×Zc zero matrix, a Zc×Zc identity matrix, a cyclic shift matrix of a Zc×Zc identity matrix, or a Zc×Zc polygonal sub-matrix, and includes at least multiple Zc×Zc polygonal sub-matrices. The number of "1" elements in each column of each Zc×Zc polygonal block sub-matrix is ​​equal to 2.

[0414] In some application embodiments, the data features include a first type of parameters, which at least include code rate, modulation order, and number of transmission layers.

[0415] In some embodiments, the data features include a first type of parameters, which at least include code rate, modulation order, number of transmission layers, and number of resources occupied by a transport block.

[0416] In some application embodiments, the data features include a first type of parameter, which includes at least the number of code blocks C.

[0417] In some application embodiments, the data features include a second type of parameters, which includes at least one of the following: the format of the control information for scheduling the transport block, the radio network temporary identifier scrambled on the cyclic redundancy check bit sequence corresponding to the control information for scheduling the transport block, and the search space corresponding to the control information for scheduling the transport block.

[0418] In some embodiments of the application, the format of the control information for scheduling the transport block included in the second type of parameters includes at least one of the following:

[0419] The N1 index or N2 index respectively indicates the downlink control format used for downlink scheduling, where N1 and N2 are positive integers greater than or equal to 0, and N1 is less than N2;

[0420] The M1 index or M2 index indicates the downlink control format used for uplink scheduling, where M1 and M2 are positive integers greater than or equal to 0, and M1 is less than M2.

[0421] In some application embodiments, the second type of parameter includes a temporary wireless network identifier scrambled on the cyclic redundancy check bit sequence corresponding to the control information of the scheduling transport block, including a first type of temporary wireless network identifier or a second type of temporary wireless network identifier. The first type of temporary wireless network identifier includes at least one of a cell temporary wireless network identifier and a configuration scheduling temporary wireless network identifier. The second type of temporary wireless network identifier includes at least one of a system information temporary wireless network identifier, a random access temporary wireless network identifier, a paging temporary wireless network identifier, and a temporary cell temporary wireless network identifier.

[0422] In some application embodiments, the search space corresponding to the control information for scheduling the transport block included in the second type of parameters includes at least one of a public search space or a user equipment-specific search space.

[0423] Figure 7 is a flowchart of a channel decoding method for a transport block provided in an embodiment of this application. This embodiment of the application is applicable to data transmission between different communication nodes. The method can be executed by a channel decoding device for a transport block, which is generally integrated into a communication node. The communication node may include a base station, a terminal, etc. Referring to Figure 7, the method provided in this embodiment of the application specifically includes the following steps:

[0424] Step 610: Obtain the deinterleaved sequence of C selected bits, and write the C selected bits into a circular buffer of length Ncb. Based on the mother codeword length N and the starting position K0, restore the codeword sequence of the C circular buffers to the mother codeword of length N. The starting position K0 is obtained according to the redundancy version information. According to the data characteristics, the starting position of the redundancy version 0 information is selected as 0 or L, where L is a positive integer greater than 1.

[0425] In this embodiment, a deinterleaved sequence of C selected bits can be obtained. These C selected bits can be written into a circular buffer of length Ncb. Based on the mother codeword length N and the starting position K0, the codeword sequences of the C circular buffers are restored to a mother codeword of length N. This process can be the reverse of the bit selection process described in the previous embodiment, restoring the bit-selected sequence to the mother codeword. During the restoration of the mother codeword, the starting position of redundant version 0 information in the redundant version information is selected as 0 or L based on data characteristics.

[0426] Step 620: Perform low-density parity-check code channel decoding on C mother codewords of length N to generate C decoded code blocks of length N, where N, Ncb, and C are integers.

[0427] Specifically, each code block sequence in the C input mother codewords can be individually decoded using low-density parity-check codes to obtain C decoded code blocks of length N.

[0428] Based on the above-described embodiments, it also includes at least one of the following:

[0429] Perform cyclic redundancy check on the decoded code block and the decoded segment;

[0430] Perform cyclic redundancy check (CR) on the transport block, wherein the transport block includes at least one of the following: a decoded code block, or a decoded code block after CR.

[0431] In other application embodiments, at least one of the following may also be included: code block deconcatenation and code block deinterleaving.

[0432] In some application embodiments, the size of the circular buffer is determined based on a finite buffer rate matching parameter.

[0433] In some embodiments of the application, at least one of the following is also included:

[0434] Finite buffer rate matching is not supported; the length of the circular buffer Ncb is equal to the length of the parent codeword N.

[0435] It supports finite buffer rate matching. The length of the circular buffer Ncb is the minimum value between the length of the mother codeword N and Nref. Nref is determined according to the preset maximum number of supported layers, maximum modulation order, maximum coding rate and maximum resource block classification.

[0436] In some application embodiments, the method further includes: selecting the starting positions of redundant version 0 information, redundant version 1 information, redundant version 2 information and redundant version 3 information based on feature data, which are 0, floor((a1*Ncb) / ((nb-2)*Zc))*Zc, floor((a2*Ncb) / ((nb-2)*Zc))*Zc and floor((a3*Ncb) / ((nb-2)*Zc))*Zc or 2*Zc, (floor((b1*Ncb) / (nb*Zc))+2)*Zc, (floor((b2*Ncb) / (nb*Zc))+2)*Zc and (floor((b3*Ncb) / (nb*Zc))+2)*Zc respectively;

[0437] Where L, a1, a2, a3, b1, b2, and b3 are integers greater than 1, floor represents the floor operation, nb represents the list of the corresponding basic graph matrices, and Zc is the boost value.

[0438] In one exemplary embodiment, this application provides a channel decoding method for a transport block. Referring to Figure 8, this method is applied to the receiving end of a communication node, and specifically includes the following steps:

[0439] Step S710, code block deconcatenation: The input concatenated code block sequence is deconcatenated (segmented) to obtain a soft bit sequence of C code blocks. This is the reverse process of the aforementioned code block concatenation step. This step also includes all the technical features and / or sub-implementations involved in the aforementioned code block concatenation.

[0440] Step S720, code block deinterleaving: Deinterleave the soft bit sequences of C code blocks to obtain C deinterleaved soft output codeword sequences. This is the deinterleaving process of the code block interleaving in the aforementioned steps. This step also includes all technical features and / or sub-implementations involved in the code block interleaving in the aforementioned steps.

[0441] Step S730, Deselecting Bits: This is the reverse process of the aforementioned bit selection. This step also includes step S204, which involves all technical features and / or sub-implementations.

[0442] In some application embodiments, the mother codeword of length N is selected based on data characteristics to determine whether it includes the last L codeword bits of the input information bit sequence, where L is a positive integer greater than 1.

[0443] It should be noted that if the first transmission occurs, the first L bits correspond to the heaviest column of the binary parity check matrix H of the LDPC code, and the next L bits correspond to the lightest column of the binary parity check matrix H of the LDPC code. If the first HARQ retransmission occurs, this pattern does not apply.

[0444] In some application embodiments, the encoding type is selected based on data characteristics. The encoding type includes a first encoding type and a second encoding type. The first encoding type is a mother codeword of length N that includes at least the first L codeword bits of the input information bit sequence. The second encoding type is a mother codeword of length N that does not include the first L codeword bits of the input information bit sequence.

[0445] In some application embodiments, the encoding type is selected according to the data characteristics. The encoding type includes a first encoding type or a second encoding type. The first encoding type is a multi-sided quasi-cyclic LDPC code; the second encoding type is a unilateral LDPC code.

[0446] The binary parity check matrix H of the single-sided quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. The block sub-matrices are cyclic shift matrices of Zc×Zc zero square matrix, Zc×Zc identity matrix, or Zc×Zc identity matrix, and include at least multiple cyclic shift matrices of Zc×Zc identity matrix or identity matrix.

[0447] The binary parity check matrix H of the polygonal quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. Each block sub-matrix is ​​a Zc×Zc zero matrix, a Zc×Zc identity matrix, a cyclic shift matrix of a Zc×Zc identity matrix, or a Zc×Zc polygonal sub-matrix, and includes at least multiple Zc×Zc polygonal sub-matrices. The number of "1" elements in each column of each Zc×Zc polygonal block sub-matrix is ​​equal to 2.

[0448] Furthermore, the number of "1" elements in each column of the Zc×Zc polygonal block submatrix is ​​greater than or equal to 2.

[0449] In some application embodiments, the L codewords are the first L codeword bits of the input information bits.

[0450] In some application embodiments, the L codewords are the last L codeword bits of the input information bits.

[0451] In some application embodiments, L equals 2*Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0452] In some embodiments of the application, L is equal to Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0453] In some application embodiments, L is a positive integer greater than 1 and less than or equal to 2*Zc.

[0454] In some embodiments of the present application, the data characteristics at least include a first type of parameter, where the first type of parameter at least includes one of the following: code rate, modulation order, transmission layer number, code block number, and number of resources occupied by a transport block. Further, in some embodiments of the present application, the data characteristics at least further include a threshold value of the first type of parameter.

[0455] In some embodiments of the present application, the data characteristics at least include a first type of parameter, where the first type of parameter at least includes the code block number. Further, in some embodiments of the present application, the data characteristics at least further include a threshold value of the first type of parameter.

[0456] In some embodiments of the present application, the data characteristics at least include a first type of parameter, where the first type of parameter at least includes a code rate, a modulation order, a transmission layer number, and the number of resources occupied by a transport block.

[0457] In some embodiments of the present application, the data characteristics at least include a second type of parameter, where the second type of parameter at least includes one of the following: the format of control information for scheduling a transport block, a Radio Network Temporary Identifier (RNTI) scrambled on the CRC corresponding to the control information for scheduling a transport block, and the search space corresponding to the control information for scheduling a transport block.

[0458] In some embodiments of the present application, the second type of parameter is the format of the control information for scheduling a transport block.

[0459] In some embodiments of the present application, the second type of parameter is the format of the control information for scheduling a transport block and the RNTI scrambled on the CRC corresponding to the control information for scheduling a transport block.

[0460] On the basis of the above embodiments of the present application, the formats of the control information for scheduling a transport block include a fallback control information format and a non-fallback control information format.

[0461] On the basis of the above embodiments of the present application, the formats of the control information for scheduling a transport block include a downlink control information format indicated by an N1 index or a downlink control format for downlink scheduling indicated by an N2 index, where N1 and N2 are used to distinguish different downlink control information formats for downlink scheduling, N1 and N2 are positive integers greater than or equal to 0, and N1 < N2. Furthermore, in some embodiments of the present application, N1 is used to indicate the fallback control information format, and N2 is used to indicate the non-fallback control information format.

[0462] On the basis of the foregoing application embodiments, the format of the control information for scheduling a transport block includes a downlink control information format indicated by an N3 index or a downlink control format for downlink scheduling indicated by an N4 index, where N1 and N2 are used to distinguish different downlink control information formats for downlink scheduling, N3 and N4 are different individual English letters, and N3 precedes N4 in alphabetical order. Further, in some application embodiments, N3 is used to indicate the fallback control information format, and N4 is used to indicate the non-fallback control information format.

[0463] On the basis of the foregoing application embodiments, the format of the control information for scheduling a transport block includes a downlink control information format indicated by an M1 index or a downlink control format for uplink scheduling indicated by an M2 index, where M1 and M2 are used to distinguish different downlink control information formats for uplink scheduling, M1 and M2 are positive integers greater than or equal to 0, and M1 < M2. Further, in some application embodiments, M1 is used to indicate the fallback control information format, and M2 is used to indicate the non-fallback control information format.

[0464] On the basis of the foregoing application embodiments, the format of the control information for scheduling a transport block includes a downlink control information format indicated by an M3 index or a downlink control format for uplink scheduling indicated by an M4 index, where M3 and M4 are used to distinguish different downlink control information formats for uplink scheduling, M3 and M4 are different individual English letters, and M3 precedes M4 in alphabetical order. Further, in some application embodiments, M3 is used to indicate the fallback control information format, and M4 is used to indicate the non-fallback control information format.

[0465] On the basis of the foregoing application embodiments, the RNTI scrambled on the CRC corresponding to the control information for scheduling the transport block includes a first type of RNTI or a second type of RNTI, where the first type of RNTI includes at least one of the following: Cell Radio Network Temporary Identifier C-RNTI (Cell-RNTI), CS-RNTI (Configured Scheduling RNTI); the second type of RNTI includes at least one of the following: SI-RNTI (System Information RNTI), RA-RNTI (Random Access RNTI), P-RNTI (Paging RNTI), TC-RNTI (Temporary C-RNTI).

[0466] It should be noted that the RNTI scrambled on the CRC corresponding to the control information for scheduling the transport block may be abbreviated as the current RNTI.

[0467] Based on the above application embodiments, the RNTI scrambled on the CRC corresponding to the control information of the scheduled transport block includes a first type of RNTI or a second type of RNTI, wherein the first type of RNTI is a common message-related RNTI; and the second type of RNTI is a private message-related RNTI.

[0468] Based on the above application embodiments, the search space includes a public search space (CSS) or a UE-specific search space (UESS).

[0469] Based on the above application embodiments, the data features include at least a first type of parameter, which is the modulation order, transmission layer number and code rate of the corresponding transmission block.

[0470] In some application embodiments, the data features include at least a third type of parameter, which includes at least one of the following: partial bandwidth BWP index, component carrier index, and resource allocation indication information of control signaling bearer.

[0471] In some embodiments, the data characteristics include at least a fourth type of parameter, which includes at least one of the following: channel type, link direction, and waveform type. The link direction includes uplink or downlink, the channel type includes one of the following: data channel, broadcast channel, control channel, or access channel, and the waveform type includes one of the following: CP-OFDM or DFTS-OFDM.

[0472] In some application embodiments, the data features include at least a fifth type of parameter, wherein the fifth type of parameter includes at least one of the following: higher-layer parameters configured by the base station for the terminal, UE capability indication signaling reported by the terminal to the base station, terminal type, and terminal capability level.

[0473] In some embodiments of the application, the data features include at least a first type of parameter and a second type of parameter;

[0474] In some embodiments of the application, the data features include at least a first type of parameter and a third type of parameter;

[0475] In some embodiments of the application, the data features include at least a first type of parameter and a fourth type of parameter;

[0476] In some embodiments of the application, the data features include at least a first type of parameter and a fifth type of parameter;

[0477] In some embodiments of the application, the data features include at least a second type of parameter and a third type of parameter;

[0478] In some application embodiments, the data features include at least a second type of parameter and a fourth type of parameter;

[0479] In some embodiments of the application, the data features include at least the second type of parameters and the fifth type of parameters;

[0480] In some application embodiments, the data features include at least a third type of parameter and a fourth type of parameter;

[0481] In some embodiments of the application, the data features include at least the third type of parameters and the fifth type of parameters;

[0482] In some application embodiments, the data features include at least a fourth type of parameter and a fifth type of parameter.

[0483] In other embodiments, the size of the circular cache is calculated based on the finite buffer rate matching (LBRM) parameter.

[0484] Furthermore, if Limited Buffer Rate Matching (LBRM) is not supported, Ncb = N.

[0485] Furthermore, if finite cyclic buffer rate matching is supported, Ncb is the minimum of N and Nref, where Nref is determined based on the preset maximum supported number of layers, maximum modulation order, maximum coding rate, and maximum resource block allocation. Ncb, N, and Nref are all positive integers greater than 1.

[0486] Step S740, Channel Decoding: Each code block sequence in the C input mother codeword sequences is individually LDPC decoded or Polar decoded to generate C decoded code blocks of length N. This is the reverse process of channel coding corresponding to step S230 or step S430. This step also includes steps S230 and / or S430 involving all technical features.

[0487] In some application embodiments, the starting position of redundant version 0 is selected as 0 or L based on data characteristics, where L is a positive integer greater than 1.

[0488] Optionally, L equals 2*Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0489] Optionally, L equals Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0490] Optionally, L is a positive integer greater than 1 and less than or equal to 2*Zc.

[0491] Optionally, L equals Zc, where Zc is the boost value of the quasi-cyclic LDPC code.

[0492] In other application embodiments, the starting positions of the redundant versions [0,1,2,3] are selected based on data characteristics.

[0493] [0,floor((a1*Ncb) / ((nb-2)*Zc))*Zc,floor((a2*Ncb) / ((nb-2)*Zc))*Zc,floor((a3*Ncb) / ((n b-2)*Zc))*Zc] or [2*Zc,(floor((b1*Ncb) / (nb*Zc))+2)*Zc,(floor((b2*Ncb) / (nb*Zc))+2)*Zc,

[0494] [(floor((b3*Ncb) / (nb*Zc))+2)*Zc], where L, a1, a2, a3, b1, b2, and b3 are positive integers greater than 1, floor represents the floor operation, nb represents the number of columns in the corresponding base graph (BG) matrix, and Zc is the lift value.

[0495] Optionally, b1 = a1 + Δ1, b2 = a2 + Δ2, b3 = a3 + Δ3, where Δ1, Δ2, and Δ3 are 0, 1, or 2.

[0496] Alternatively, b1 = a1, b2 = a2 + 1, b3 = a2 + 2.

[0497] Optionally, b1 = a1, b2 = a2+1, b3 = a2+1.

[0498] Alternatively, b1 = a1, b2 = a2 + 1, b3 = a2 + 3.

[0499] Alternatively, b1 = a1, b2 = a2 + 1, b3 = a2 + 2.

[0500] Furthermore, the feature is that the starting positions of the redundant versions [0,1,2,3] are selected based on data characteristics.

[0501] [0,floor((17*Ncb) / (66*Zc))*Zc,floor((33*Ncb) / (66*Zc))*Zc,floor((56*Ncb) / (66*Zc))*Zc] or [2*Zc,(floor((17*Ncb) / (68*Zc))+2)*Zc,(floor((34*Ncb) / (68*Zc))+2)*Zc,(floor((57*Ncb) / (68*Zc))+2)*Zc], where Zc is the boost value.

[0502] Furthermore, the feature is that the starting positions of the redundant versions [0,1,2,3] are selected based on data characteristics.

[0503] [0,floor((17*Ncb) / (66*Zc))*Zc,floor((33*Ncb) / (66*Zc))*Zc,floor((56*Ncb) / (66*Zc))*Zc] or [2*Zc,(floor((17*Ncb) / (68*Zc))+2)*Zc,(floor((34*Ncb) / (68*Zc))+2)*Zc,(floor((58*Ncb) / (68*Zc))+2)*Zc], where Zc is the boost value.

[0504] Choose between circular caching method 1 and circular caching method 2 based on data characteristics.

[0505] Furthermore, the starting position k0 is obtained based on the redundancy version (RV), where the downlink control information (DCI) carried by the downlink control channel PDCCH indicates the redundancy version.

[0506] Specifically, the starting position k0 of the current transfer of a HARQ process in the circular buffer is determined based on the redundant version.

[0507] It should be noted that redundancy version 0 is generally used to determine the starting position in the circular buffer for the first transmission of a HARQ process's transport block.

[0508] Step S750, Decoding Block Segmentation and Decoding Block CRC: Based on the given CRC polynomial and input sequence, perform CRC verification on the transmission block to determine whether the transmission block has been correctly received. This step also includes code block segmentation and code block CRC addition in step S220 or step 420, involving all technical features.

[0509] Step S760, Decode the transport block CRC: Based on the given CRC (Cyclic Redundancy Check) polynomial and input sequence, perform a CRC check on the transport block to determine whether the transport block has been correctly received. This step also includes step S201, which relates to all technical features and / or sub-implementations.

[0510] This optional embodiment provides a channel decoding method for a transport block, which can be applied to the transmission of base stations, terminals or other communication transmission nodes. Furthermore, it can be applied to next-generation 6G mobile communication systems and subsequent 7G mobile communication systems, or next-generation fixed access wireless communication systems, or next-generation local area networks.

[0511] This application provides detailed examples of a method for channel coding and channel decoding of a transport block. It is understood that the transmitting and receiving ends include corresponding hardware structures and / or software modules to perform the various functions in order to achieve the above-mentioned functions. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art 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.

[0512] Figure 9 is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. The electronic device includes a processing unit 10. The processing unit 10 executes various functional applications and data processing of the electronic device by running stored software programs, instructions and modules, that is, it implements the above-mentioned channel coding method or decoding method for a transport block.

[0513] Based on the above-described embodiments, the electronic device further includes a memory, an input device, and an output device. The processing unit, memory, input device, and output device in the electronic device can be connected via a bus or other means. The memory, as a computer-readable storage medium, can be used to store software programs, computer-executable programs, and modules, such as the modules corresponding to the devices in the embodiments of this application. The processing unit can execute various functional applications and data processing of the electronic device by running the software programs, instructions, and modules stored in the memory, thereby implementing the methods described above.

[0514] The memory may primarily include a program storage area and a data storage area. The program storage area may store the operating system and at least one application program required for a given function; the data storage area may store data created based on the use of the electronic device. Furthermore, the memory may include high-speed random access memory and non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some instances, the memory may further include memory remotely located relative to the processing unit, which can be connected to the electronic device via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0515] Input devices can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of electronic devices. Output devices may include display devices such as displays.

[0516] Figure 10 is a schematic diagram of a channel coding apparatus for a transport block provided in an embodiment of this application. The apparatus 800 includes a processing unit 810. The processing unit 810 can be used to perform the actions described in the embodiment of the channel coding method for a transport block described above, wherein the channel coding method for a transport block includes all previously protected data features.

[0517] Figure 11 is a schematic diagram of a channel decoding apparatus for a transport block provided in an embodiment of this application. The apparatus 900 includes a processing unit 910. The processing unit 910 can be used to perform the actions described in the embodiment of the channel decoding method for a transport block described above, wherein the channel decoding method for a transport block includes all previously protected data features.

[0518] Those skilled in the art will clearly understand that the specific working process and technical effects of the devices and units described above, as well as the execution steps, can be referred to the descriptions in the corresponding method embodiments above. For the sake of brevity, they will not be repeated here.

[0519] The aforementioned channel coding device and dechannel coding device can be a single chip. The processing unit can be implemented in hardware or software. When implemented in hardware, the processing unit can be a logic circuit, integrated circuit, etc. When implemented in software, the processing unit can be a general-purpose processor that reads software code stored in a storage unit. This storage unit can be integrated into the processor or located outside the processor and exist independently.

[0520] Figure 12 is a schematic diagram of a wireless communication transmitting device provided in an embodiment of this application. Referring to Figure 12, the wireless communication transmitting device includes at least a controller / processor 1010 implementing layer 2 / 3 functions, a processor 1020 implementing layer 1 functions, and a Tx transmitter 1030 for converting baseband signals to radio frequency signals and processing radio frequency signals. It can be used for transmitting signals from a base station or terminal. It should be noted that the processor is mainly used to process communication protocols and communication data, control the entire terminal device, execute software programs, and process the data in the software programs. In addition, the wireless transmitting device may also include input and output devices, such as touch screens, displays, and keyboards, mainly used to receive user input data and output data to the user.

[0521] If the transmitting device is a terminal UE, the processor can read the software program from the storage unit, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor performs baseband processing on the data to be transmitted, and then outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit performs RF processing on the baseband signal, and then transmits the RF signal to the outside in the form of electromagnetic waves through the antenna.

[0522] Specifically, this controller / processor 1010 implements Layer 3 and Layer 2 functions. In the DL (Deep Link Controller), IP packets from the core network can be provided to a controller / processor. Layer 3 includes the Radio Resource Control (RRC) layer, and Layer 2 includes the Packet Data Convergence Protocol (PDCP) layer, Radio Link Control (RLC) layer, and Medium Access Control (MAC) layer, primarily comprising the following four functions:

[0523] First, the controller / processor 1010 provides RRC functionality, which is responsible for managing the connection, resource allocation, handover, system information broadcasting, measurement reporting, power consumption control, and security management between user equipment and the radio access network. This ensures efficient connection, signal quality, and network resource optimization for the device, and dynamically adjusts between different states (such as RRC_IDLE, RRC_CONNECTED, and RRC_INACTIVE). It supports connection establishment, reconfiguration and release, handover management, system information broadcasting (such as Master Information Block (MIB) and SIB), as well as network slice selection and multi-connection management in 5G, ensuring that the network can flexibly respond to the needs of various application scenarios.

[0524] Secondly, the controller / processor 1010 also provides PDCP functionality, including header compression and decompression, security assurance (including encryption, decryption, integrity protection and verification), data segmentation and reassembly, and supports the continuity of data transmission during switching, ensuring efficient, secure and seamless uplink and downlink data transmission.

[0525] Third, the controller / processor 1010 also provides RLC layer functions, mainly including data segmentation, reassembly, retransmission, and order management between the physical layer and the PDCP layer, ensuring ordered transmission and retransmission of lost data packets. RLC supports three operating modes: Transparent Mode (TM), Unacknowledged Mode (UM), and Acknowledged Mode (AM), each optimized according to transmission reliability requirements. RLC is also responsible for data encapsulation and transmission control, ensuring data stability on the wireless link. In AM mode, RLC provides an Automatic Repeat Request (ARQ) mechanism to guarantee reliable data transmission and handle packet loss. In UM mode, RLC provides more efficient transmission but does not guarantee data reliability. RLC also adapts to different data packet size requirements through segmentation and reassembly functions to achieve efficient data transmission.

[0526] Fourth, the controller / processor 1010 also provides MAC layer functionality, acting as a bridge between the RLC layer and the physical layer. It is responsible for mapping logical channels to corresponding transmission channels, ensuring on-demand data transmission. The MAC layer controls data transmission based on network scheduling information, handles HARQ (Hybrid Automatic Repeat Request) retransmission processes, and manages resources such as transmission time slots, spectrum, and power. It dynamically adjusts the data transmission rate according to different QoS requirements and ensures that different services are prioritized. The MAC layer is also responsible for channel coding and modulation selection, ensuring reliable transmission under different channel conditions. Furthermore, the MAC layer processes different priority traffic on logical channels through priority scheduling, ensuring that high-priority traffic (such as control signaling or urgent data) is transmitted in a timely manner. Through efficient resource scheduling, logical channel priority processing and management, the MAC layer optimizes the utilization of wireless resources, ensuring the reliability, efficiency, and fairness of data transmission.

[0527] The transmit (TX) processor 1020 implements Layer 1 functions related to various channel coding functions. Layer 1 includes baseband processing at the physical (PHY) layer, including at least error detection, forward error correction (FEC) coding, interleaving, rate matching, mapping to the physical channel, modulation of the physical channel, and MIMO antenna processing. The TX processor processes the mapping of signal constellation diagrams based on various modulation schemes. The coded and modulated symbols can then be split into parallel streams. Each stream can then be mapped to OFDM subcarriers, multiplexed with a reference signal in the time and / or frequency domains, and then combined using an inverse fast Fourier transform (IFFT) to produce a physical channel carrying a stream of time-domain OFDM symbols. The OFDM streams are spatially pre-coded to generate multiple spatial streams.

[0528] The transmitter 1040TX provides multiple spatial streams to different antennas 1050, primarily involving intermediate frequency (IF) and radio frequency (RF) processing. Each transmitter 1040TX can modulate an RF carrier with a corresponding spatial stream for transmission.

[0529] The controller / processor 1010 may be associated with the memory 1030 that stores program code and data.

[0530] If the transmitting device is a terminal, the processor can be used to support the terminal device in performing the actions described in the above embodiments of the channel coding method for the transport block. The transmitter and transmitting antenna are used to support the terminal device in performing the transmission function as described in the channel coding method for the transport block.

[0531] If the transmitting device is a base station, the processor can be used to control the base station equipment to perform the actions described in the above embodiments of the channel coding method for the transport block, and the transmitter and transmitting antenna are used to support the base station equipment to perform the transmission function as described in the channel coding method for the transport block.

[0532] Figure 13 is a schematic diagram of a wireless communication receiving device provided in an embodiment of this application. Referring to Figure 13, a structural example of a wireless communication receiving device is given, which can be used for receiving data from a terminal or a base station. If the receiving device is a terminal UE, when data is transmitted to the terminal device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor. The processor converts the baseband signal into data and processes it.

[0533] In a wireless receiving device, such as the UE in the following example, each receiver 1140RX receives signals through its respective antenna 1150. Each receiver 1140RX recovers the information modulated onto the RF carrier and provides the information to the receive (RX) processor 1120. The RX processor 1120 implements Layer 1 functions associated with various channel coding functions. The RX processor 1120 can perform spatial processing on the information to recover any spatial streams sent to the receiving device (such as the UE in the following example). If multiple spatial streams are destined for the communication receiving device (such as the UE in the following example), they can be combined by the RX processor 1120 into a single OFDM symbol stream. The RX processor 1120 then uses a Fast Fourier Transform (FFT) to convert the OFDM symbol stream from the time domain to the frequency domain. The frequency domain signal consists of a separate OFDM symbol stream for each subcarrier of the OFDM signal. The symbols and reference signals on each subcarrier are recovered and demodulated by determining the most probable signal constellation point. These soft decisions may be based on channel estimation. The soft decision is then decoded to recover the data and control signals originally transmitted by the transmitting device over the physical channel. The data and control signals are then provided to the controller / processor 1110, which implements Layer 3 and Layer 2 functions.

[0534] Memory 1130 may be referred to as computer-readable medium. In UL, controller / processor 1110 provides demultiplexing, packet reassembly, decryption, header decompression, and control channel coding between transport and logical channels to recover IP packets from the core network. Controller / processor 1110 is also responsible for error detection using ACK and / or NACK protocols to support HARQ operation.

[0535] Similar to the functions described in DL transmissions via the transmitting device, the controller / processor 1110 provides the associated RRC layer functions, PDCP layer functions, RLC layer functions, and MAC layer functions as previously described.

[0536] The controller / processor 1110 may be associated with a memory 1130 that stores program code and data. The memory 1130 may be referred to as a computer-readable medium.

[0537] If the transmitting device is a terminal, the processor can be used to support the terminal device in performing the actions described in the embodiments of the channel decoding method for the above-described transport block, and the transmitter and transmitting antenna are used to support the terminal device in performing the transmission function as described in the channel decoding method for the transport block.

[0538] If the transmitting device is a base station, the processor can be used to control the base station equipment to perform the actions described in the embodiments of the channel decoding method for the above-described transport block, and the transmitter and transmitting antenna are used to support the base station equipment to perform the transmission function as described in the channel decoding method for the transport block.

[0539] Those skilled in the art will understand that, for ease of explanation, in Figures 12 and 13, the actual terminal device may have multiple memories (1030 or 1130) and multiple processors (1020 or 1120). Memory may also be referred to as storage medium or storage device, etc.

[0540] In wireless communication systems, especially mobile communication systems, base stations are responsible for downlink transmission and uplink reception. A base station may include one or more radio frequency (RF) units (e.g., Remote Radio Units (RRUs)) and one or more baseband units (BBUs) (also known as digital units, DUs). This approach allows for separation of the baseband and RF sections, enabling centralized control of the baseband section and allowing the RF section to be located further away from the user, thus significantly improving coverage and reducing power consumption. For example, an RRU typically includes at least one transmit antenna 1040 and a transmitter 1050, and at least one receive antenna 1140 and a transmitter 1150. It should be noted that the transceiver units can be integrated or implemented using the same module. A BBU typically includes a controller / processor 1010, a Tx processor 1020, a controller / processor 1110, and an Rx processor 1120. Again, the control or processing of the transceiver can be integrated or implemented using the same module.

[0541] It should be noted that in the aforementioned wireless communication transmitting and / or wireless communication receiving devices, the processor can be a general-purpose processor or a dedicated processor, etc. For example, it can be a baseband processor or a central processing unit (CPU). A baseband processor can be used to process communication protocols and communication data, while a CPU can be used to control communication equipment (e.g., base stations, terminals, or chips), execute software programs, and process data from the software programs. The communication device may include a transceiver unit for implementing signal input (reception) and output (transmission). For example, the communication device can be a chip, and the transceiver unit can be the chip's input and / or output circuits, or a communication interface. This chip can be used in a terminal, base station, or other communication equipment. Furthermore, if the communication device is a terminal, base station, or other communication equipment, the transceiver unit may include a transceiver, an RF chip, a filter, an analog-to-digital converter, an RF switch, etc.

[0542] In the embodiments of this application, the foregoing disclosure provides illustrations and descriptions, but is not intended to be exhaustive or to limit aspects to the precise form disclosed. Modifications and alterations can be made based on the foregoing disclosure, and can also be obtained from practice in these aspects.

[0543] In embodiments of this application, unless explicitly described, no element, action, or instruction used herein should be construed as critical or necessary. Furthermore, the articles “a” and “an” used herein are intended to include one or more items and may be used interchangeably with “one or more.” Additionally, the terms “set” and “group” used herein are intended to include one or more elements (e.g., related elements, unrelated elements, combinations of related and unrelated elements, and / or similar elements) and may be used interchangeably with “one or more.” If only one item is intended to be used, the phrase “single,” “only one,” or similar language is used.

[0544] In this application embodiment, the term "according to" should not be interpreted as a reference to a closed set of information, one or more conditions, one or more factors, or similar content. In other words, the phrase "according to A" (where "A" can be information, conditions, factors, etc.) should be interpreted as "at least according to A," unless specifically interpreted differently.

[0545] In embodiments of this application, although specific combinations of features are referenced in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of aspects. In fact, many of these features may be combined in ways not specifically referenced in the claims and / or not closed in the specification. Although each dependent claim listed below may directly depend on only one claim, the disclosure of aspects includes combinations of each dependent claim with all other claims in the claim set. The phrase “at least one” in the list of referenced items refers to any combination of these items, including individual members. For example, “comprising at least one of: A, B, or C” is intended to cover A, B, C, A and B, A and C, B and C, A and B and C (and any other order of A, B, and C).

[0546] In the embodiments of this application, the terms "system" and "network" are often used interchangeably herein. The term "and / or" in this document is merely an association to describe the associated objects, indicating that there can be three relationships, such as A and / or B, which can represent three situations: A exists alone, A and B exist simultaneously, and A and B exist independently of B.

[0547] In the embodiments of this application, "when," "if," and "if" all indicate that the UE or base station will make corresponding processing under certain objective circumstances, rather than within a limited time. They do not require the UE or base station to make a judgment action during implementation, and do not imply any other restrictions.

[0548] Those skilled in the art will understand that all or some of the steps, systems, and apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned above does not necessarily correspond to the division of physical units; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all components may be implemented as processors, such as software executed by a digital channel encoder or microprocessor, or as hardware, or as integrated circuits, such as application-specific integrated circuits (ASICs). Such software can be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or transient media).

[0549] As is known to those skilled in the art, the processor in this embodiment of the application can be an integrated circuit chip with channel coding capabilities. During implementation, each step of the above method embodiments can be completed by hardware integrated logic circuits or software instructions in the processor. The processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The methods, steps, and logic block diagrams disclosed in the embodiments of this application can be implemented or executed. The general-purpose processor can be a microprocessor, or any conventional processor or something similar. The steps of the methods disclosed in the various embodiments of this application can be directly implemented by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. The storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method.

[0550] As is well known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technique for storing information (such as computer-readable instructions, data structures, program modules, or other data). Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM), which acts as an external cache. For example, many forms of RAM are available, such as Static Random-Access Memory (SRAM), Dynamic Random-Access Memory (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), and Direct Memory Bus RAM (DR RAM). Furthermore, it is well known to those skilled in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0551] This application also provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to perform a channel coding method / channel decoding method for a transport block.

[0552] Based on the above description of the implementation methods, those skilled in the art can clearly understand that this application can be implemented using software and necessary general-purpose hardware, and of course, it can also be implemented using hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, read-only memory (ROM), random access memory (RAM), flash memory, hard disk, or optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0553] In some embodiments, the data transmission method may be implemented as a computer program tangibly contained in a computer-readable storage medium, such as a memory. In some embodiments, part or all of the computer program may be loaded and / or installed on an electronic device via ROM 12 and / or a communication unit. When the computer program is loaded into RAM and executed by a processor, one or more steps of the data transmission method described above may be performed. Alternatively, in other embodiments, the processor may be configured to perform the data transmission method by any other suitable means (e.g., by means of firmware). The computer program used for the methods of embodiments of this application may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus such that, when executed by the processor, the computer program causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The computer program may be executed entirely on a machine, partially on a machine, partially on a machine and partially on a remote machine as a standalone software package, or entirely on a remote machine or server.

[0554] In the context of embodiments of this application, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, compact disc read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0555] It is worth noting that in the embodiments of the above-mentioned device, the various units and modules included are only divided according to functional logic, but are not limited to the above division, as long as the corresponding functions can be realized; in addition, the specific names of each functional unit are only for easy differentiation and are not used to limit the scope of protection of this application.

[0556] Those skilled in the art will understand that all or some of the steps, apparatuses, or functional modules / units in the methods disclosed above can be implemented as software, firmware, hardware, or suitable combinations thereof.

[0557] In hardware implementations, the division between functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. The corresponding software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, Digital Video Disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, as is known to those skilled in the art, communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0558] The above description, with reference to the accompanying drawings, illustrates optional embodiments of this application and does not limit the scope of this application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and spirit of this application shall be within the scope of this application.

Claims

1. A channel coding method for transport blocks, applied to a communication node, the method comprising: Determine whether the transport block should be segmented into code blocks; If it is determined that the transport block is not segmented into code blocks, the number of code blocks C is determined to be 1; When it is determined that the transport block is to be segmented into code blocks, the number of code blocks C is determined, the input data sequence is segmented into code blocks, and a cyclic redundancy check bit sequence is added to each segmented code block, wherein the number of code blocks C is greater than 1, and the input data sequence includes at least one of the following: transport block, transport block and a concatenated sequence of cyclic redundancy check bit sequences of transport block; Channel coding of the C code blocks using low-density parity-check codes is performed to obtain C mother codewords of length N. The mother codewords of length N are selected based on data characteristics to determine whether they include the first L codeword bits of the input information bit sequence, where L is a positive integer greater than 1. C codewords of length N are written into their respective circular buffers of length Ncb. Starting from the beginning position K0 of each circular buffer, E codeword bit sequences are selected sequentially to obtain the bit selection sequences corresponding to the C codewords. Here, N, Ncb and E are positive integers.

2. The method according to claim 1, further comprising at least one of the following: Add a cyclic redundancy check bit sequence to the transport block; The selected C bits are then interleaved to obtain C interleaved sequences.

3. The method according to claim 1, further comprising: The coding type of the channel coding is selected based on the data characteristics, and the coding type includes a first coding type or a second coding type; Wherein, the first encoding type is a multi-sided quasi-cyclic low-density parity-check LDPC code, and the second encoding type is a unilateral quasi-cyclic LDPC code; The binary parity check matrix H of the single-sided quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. The block sub-matrices are cyclic shift matrices of Zc×Zc zero square matrix, Zc×Zc identity matrix, or Zc×Zc identity matrix, and include multiple cyclic shift matrices of Zc×Zc identity matrix or identity matrix. The binary parity check matrix H of the polygonal quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. Each block sub-matrix is ​​a Zc×Zc zero matrix, a Zc×Zc identity matrix, a cyclic shift matrix of a Zc×Zc identity matrix, or a Zc×Zc polygonal sub-matrix, and includes multiple Zc×Zc polygonal sub-matrices. The number of "1" elements in each column of each Zc×Zc polygonal block sub-matrix is ​​equal to 2.

4. The method according to claim 1, wherein, The data features include a first type of parameters, which include code rate, modulation order, and number of transmission layers.

5. The method according to claim 1, wherein, The data features include a first type of parameters, which include code rate, modulation order, number of transmission layers, and the number of resources occupied by a transmission block.

6. The method according to claim 1, wherein, The data features include a first type of parameter, which includes the number of code blocks C.

7. The method according to claim 1, wherein, The data features include a second type of parameters, which includes at least one of the following: the format of the control information for scheduling the transport block, the radio network temporary identifier scrambled on the cyclic redundancy check bit sequence corresponding to the control information for scheduling the transport block, and the search space corresponding to the control information for scheduling the transport block.

8. The method according to claim 7, wherein, The second type of parameters includes control information for scheduling the transport blocks, which includes at least one of the following formats: The N1 index or N2 index respectively indicates the downlink control format used for downlink scheduling, where N1 and N2 are positive integers greater than or equal to 0, and N1 is less than N2; The M1 index or M2 index indicates the downlink control format used for uplink scheduling, where M1 and M2 are positive integers greater than or equal to 0, and M1 is less than M2.

9. The method according to claim 7, wherein, The second type of parameter includes a temporary wireless network identifier scrambled onto the cyclic redundancy check bit sequence corresponding to the control information of the scheduling transmission block. It includes a first type of temporary wireless network identifier or a second type of temporary wireless network identifier. The first type of temporary wireless network identifier includes at least one of a cell wireless network identifier and a configuration scheduling wireless network identifier. The second type of temporary wireless network identifier includes at least one of a system information wireless network identifier, a random access wireless network identifier, a paging wireless network identifier, and a temporary cell wireless network identifier.

10. The method according to claim 7, wherein, The second type of parameter includes the search space corresponding to the control information for scheduling the transport block, which includes a public search space or a user equipment-specific search space.

11. A channel coding method for a transport block, applied to a communication node, the method comprising: Determine whether the transport block should be segmented into code blocks; If it is determined that the transport block is not segmented into code blocks, the number of code blocks C is determined to be 1; When it is determined that the transport block is to be segmented into code blocks, the number of code blocks C is determined, the input data sequence is segmented into code blocks, and a cyclic redundancy check bit sequence is added to each segmented code block, wherein the number of code blocks C is greater than 1, and the input data sequence includes at least one of the following: transport block, transport block and a concatenated sequence of cyclic redundancy check bit sequences of transport block; Channel coding with low-density parity-check codes is performed on each of the C code blocks to obtain C mother codewords of length N, wherein each mother codeword includes the entire input information bit sequence, and the input information bit sequence is the information bit sequence of the code block; C codewords of length N are written into their respective circular buffers of length Ncb. Starting from the beginning position K0 of each circular buffer, E codeword bit sequences are selected sequentially to obtain the bit selection sequences corresponding to the C codewords. The beginning position K0 is obtained based on the redundancy version information. The starting position of the redundancy version 0 information is selected as 0 or L based on the data characteristics. N, E, Ncb and L are positive integers greater than 1.

12. The method according to claim 11, wherein, The size of the circular buffer is determined based on a finite buffer rate matching parameter.

13. The method of claim 11, further comprising at least one of the following: Finite buffer rate matching is not supported; the length Ncb of the circular buffer is equal to the length N of the parent codeword. Supports finite buffer rate matching, where the length Ncb of the circular buffer is the minimum value between the length N of the mother codeword and Nref, where, The Nref is determined based on the preset maximum supported number of layers, maximum modulation order, maximum coding rate, and maximum resource block classification.

14. The method according to claim 11, further comprising: Based on the feature data, the starting positions of redundant version 0, redundant version 1, redundant version 2, and redundant version 3 are selected as 0, floor((a1*Ncb) / ((nb-2)*Zc))*Zc, floor((a2*Ncb) / ((nb-2)*Zc))*Zc, and floor((a3*Ncb) / ((nb-2)*Zc))*Zc, or 2*Zc, (floor((b1*Ncb) / (nb*Zc))+2)*Zc, (floor((b2*Ncb) / (nb*Zc))+2)*Zc, and (floor((b3*Ncb) / (nb*Zc))+2)*Zc, respectively. Where L, a1, a2, a3, b1, b2, and b3 are integers greater than 1, floor represents the floor operation, nb represents the list of the corresponding basic graph matrices, and Zc is the boost value.

15. A channel decoding method for a transport block, applied to a communication node, the method comprising: Obtain the deinterleaved sequence of C selected bits, and write the C selected bits into a circular buffer of length Ncb. Based on the mother codeword length N and the starting position K0, restore the C codeword sequences of the circular buffer into a mother codeword of length N. It is determined whether the mother codeword of length N includes the first L codeword bits of the input information bit sequence according to the data characteristics. L is a positive integer greater than 1. Channel decoding of C mother codewords of length N using low-density parity-check codes is performed to generate C decoded code blocks of length N, where N, Ncb, and C are integers.

16. The method of claim 15, further comprising at least one of the following: Cyclic redundancy check is performed on the decoded code block and the decoded segment. Perform cyclic redundancy check (CRC) on the transport block, where, The transmission block includes at least one of the following: a decoded code block, or a decoded code block with cyclic redundancy check.

17. The method of claim 15, further comprising: The encoding type for channel decoding is selected based on data characteristics, and the encoding type includes a first encoding type and a second encoding type; Wherein, the first encoding type is a multi-sided quasi-cyclic low-density parity-check LDPC code, and the second encoding type is a unilateral quasi-cyclic LDPC code; The binary parity check matrix H of the single-sided quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. The block sub-matrices are cyclic shift matrices of Zc×Zc zero square matrix, Zc×Zc identity matrix, or Zc×Zc identity matrix, and include multiple cyclic shift matrices of Zc×Zc identity matrix or identity matrix. The binary parity check matrix H of the polygonal quasi-cyclic LDPC code is composed of multiple Zc×Zc block sub-matrices. Each block sub-matrix is ​​a Zc×Zc zero matrix, a Zc×Zc identity matrix, a cyclic shift matrix of a Zc×Zc identity matrix, or a Zc×Zc polygonal sub-matrix, and includes multiple Zc×Zc polygonal sub-matrices. The number of "1" elements in each column of each Zc×Zc polygonal sub-matrix is ​​equal to 2.

18. The method according to claim 15, wherein, The data features include a first type of parameters, which include code rate, modulation order, and number of transmission layers.

19. The method according to claim 15, wherein, The data features include a first type of parameters, which include code rate, modulation order, number of transmission layers, and the number of resources occupied by a transmission block.

20. The method according to claim 15, wherein, The data features include a first type of parameter, which includes the number of code blocks C.

21. The method according to claim 15, wherein, The data features include a second type of parameters, which includes at least one of the following: the format of the control information for scheduling the transport block, the radio network temporary identifier scrambled on the cyclic redundancy check bit sequence corresponding to the control information for scheduling the transport block, and the search space corresponding to the control information for scheduling the transport block.

22. The method according to claim 21, wherein, The second type of parameters includes control information for scheduling the transport blocks, which includes at least one of the following formats: The N1 index or N2 index respectively indicates the downlink control format used for downlink scheduling, where N1 and N2 are positive integers greater than or equal to 0, and N1 is less than N2; The M1 index or M2 index indicates the downlink control format used for uplink scheduling, where M1 and M2 are positive integers greater than or equal to 0, and M1 is less than M2.

23. The method according to claim 21, wherein, The second type of parameter includes a temporary wireless network identifier scrambled onto the cyclic redundancy check bit sequence corresponding to the control information of the scheduling transmission block. This includes either a first type of temporary wireless network identifier or a second type of temporary wireless network identifier. The first type of temporary wireless network identifier includes at least one of a cell temporary wireless network identifier and a configuration scheduling temporary wireless network identifier. The second type of temporary wireless network identifier includes at least one of a system information temporary wireless network identifier, a random access temporary wireless network identifier, a paging temporary wireless network identifier, and a temporary cell temporary wireless network identifier.

24. The method according to claim 21, wherein, The second type of parameter includes the search space corresponding to the control information for scheduling the transport block, which includes at least one of a public search space or a user equipment-specific search space.

25. A channel decoding method for a transport block, applied to a communication node, the method comprising: Obtain the deinterleaved sequence of C selected bits, and write the C selected bits into a circular buffer of length Ncb. Based on the mother codeword length N and the starting position K0, restore the C codeword sequences of the circular buffer into a mother codeword of length N. The starting position K0 is obtained according to the redundancy version information. According to the data characteristics, the starting position of the redundancy version 0 information is selected as 0 or L, where L is a positive integer greater than 1. Channel decoding of C mother codewords of length N using low-density parity-check codes is performed to generate C decoded code blocks of length N, where N, Ncb, and C are integers.

26. The method according to claim 25, wherein, The size of the circular buffer is determined based on a finite buffer rate matching parameter.

27. The method of claim 25, further comprising at least one of the following: Finite buffer rate matching is not supported; the length Ncb of the circular buffer is equal to the length N of the parent codeword. Supports finite buffer rate matching, where the length Ncb of the circular buffer is the minimum value between the length N of the mother codeword and Nref, where, The Nref is determined based on the preset maximum supported number of layers, maximum modulation order, maximum coding rate, and maximum resource block classification.

28. The method of claim 25, further comprising: Based on the feature data, the starting positions of redundant version 0, redundant version 1, redundant version 2, and redundant version 3 are selected as 0, floor((a1*Ncb) / ((nb-2)*Zc))*Zc, floor((a2*Ncb) / ((nb-2)*Zc))*Zc, and floor((a3*Ncb) / ((nb-2)*Zc))*Zc, or 2*Zc, (floor((b1*Ncb) / (nb*Zc))+2)*Zc, (floor((b2*Ncb) / (nb*Zc))+2)*Zc, and (floor((b3*Ncb) / (nb*Zc))+2)*Zc, respectively. Where L, a1, a2, a3, b1, b2, and b3 are integers greater than 1, floor represents the floor operation, nb represents the list of the corresponding basic graph matrices, and Zc is the boost value.

29. An electronic device, the electronic device comprising: At least one processing unit; The processing unit is used to execute a channel coding method or a channel decoding method for a transport block as described in any one of claims 1-28.

30. A computer-readable storage medium storing one or more programs, which are executed by one or more processing units to implement a channel coding or decoding method for a transport block as described in any one of claims 1-28.

Images