Method performed by device, device, and storage medium

The method enhances LDPC codes by determining a parity check matrix and applying a shortening pattern to improve LDPC codes for next-generation wireless communication systems, addressing the 'error floor' issue and increasing throughput.

WO2026240218A1PCT designated stage Publication Date: 2026-11-19LG ELECTRONICS INC +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
PCT/KR2025/006365
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2025-05-12
Publication Date
2026-11-19

AI Technical Summary

Technical Problem

Current LDPC codes experience performance degradation known as an 'error floor' in high signal-to-noise ratio regions, which is expected to worsen with the lower target block error rate required in next-generation wireless communication systems.

Method used

A method involving determining a parity check matrix based on transport block size, performing channel encoding and decoding with a shortening pattern, and applying cyclic redundancy check to enhance LDPC codes for next-generation wireless communication systems.

Benefits of technology

The proposed method improves LDPC codes to efficiently transmit and receive wireless communication signals, increasing overall throughput and addressing the 'error floor' issue in high SNR regions.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure KR2025006365_19112026_PF_FP_ABST
    Figure KR2025006365_19112026_PF_FP_ABST
Patent Text Reader

Abstract

This device may: determine a parity check matrix on the basis of a transport block size (TBS) of a transport block; determine a codeword by performing, on the basis of the parity check matrix, channel encoding on a code block generated from the transport block; determine a transmitted bit sequence by performing shortening on the codeword; and transmit the transmitted bit sequence. The shortening pattern may be a shortening pattern predetermined for the TBS of the transport block, from among a plurality of shortening patterns respectively predetermined for a plurality of TBSs.
Need to check novelty before this filing date? Find Prior Art

Description

Method performed by the device, device, and storage medium

[0001] This specification relates to a wireless communication system.

[0002] Various devices and technologies, such as machine-to-machine (M2M) communication, machine type communication (MTC), and devices requiring high data transmission rates like smartphones and tablet PCs (Personal Computers), are emerging and becoming widespread. Consequently, the amount of data required to be processed in cellular networks is increasing very rapidly. To satisfy this rapidly increasing demand for data processing, technologies such as carrier aggregation and cognitive radio are being developed to efficiently utilize more frequency bands, while technologies such as multi-antenna technology and multi-BS cooperation are being developed to increase the data capacity transmitted within a limited frequency range.

[0003] As more communication devices require greater communication capacity, the need for enhanced mobile broadband (eMBB) communication is emerging compared to legacy radio access technology (RAT). In addition, massive machine type communication (mMTC), which connects multiple devices and objects to provide various services anytime and anywhere, is one of the key issues to consider in next-generation communication.

[0004] In addition, discussions are underway regarding communication systems to be designed with user equipment (UE) in mind, which is sensitive to reliability and latency. The introduction of next-generation wireless access technologies is being discussed with consideration of eMBB communication, mMTC, and ultra-reliable and low-latency communication (URLLC).

[0005] Low-density parity check (LDPC) codes play a significant role in modern communication systems due to their practical hardware implementation and efficient theoretical analysis methods. However, LDPC codes are characterized by performance degradation known as an "error floor" occurring in high signal-to-noise ratio (SNR) regions. Currently used LDPC codes do not experience performance degradation at the current target block error rate (BLER). However, in next-generation communication systems, the target BLER is expected to be lower than the current target BLER; consequently, currently used LDPC codes may generate an error floor before reaching this lowered target BLER, which could lead to performance degradation. Therefore, LDPC codes suitable for next-generation wireless communication systems are required.

[0006] The technical problems that this specification aims to solve are not limited to those mentioned above, and other technical problems not mentioned will be clearly understood by those skilled in the art related to this specification from the detailed description below.

[0007] In one aspect of the present specification, a method by means of a device is provided. In another aspect of the present specification, a device is provided comprising: at least one processor; and at least one computer memory operably connectable to the at least one processor and, when executed, storing instructions that cause the at least one processor to perform operations. In yet another aspect of the present specification, a computer-readable non-transitory storage medium is provided for storing at least one program code that includes instructions that cause the at least one processor to perform operations when executed. The method or the operations may include: determining a parity check matrix based on the transport block size (TBS) of a transport block; determining a codeword by performing channel encoding based on the parity check matrix on a code block generated from the transport block; determining a transmission bit sequence by performing shortening on the codeword; and transmitting the transmission bit sequence. Performing the shortening may include setting some bits within the codeword to zero according to a shortening pattern. The above shortening pattern may be a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs.

[0008] In another aspect of the present specification, a method by means of a device is provided. In another aspect of the present specification, a device is provided comprising: at least one processor; and at least one computer memory operably connectable to the at least one processor and, when executed, storing instructions that cause the at least one processor to perform operations. In another aspect of the present specification, a computer-readable non-transitory storage medium is provided for storing at least one program code that includes instructions that cause the at least one processor to perform operations when executed. The method or the operations may include: receiving a bit sequence associated with a transport block; determining a parity check matrix based on the transport block size (TBS) of the transport block; and determining a codeword by performing channel decoding based on the bit sequence, the parity check matrix, and a shortening pattern. The shortening pattern may be used to set bits corresponding to some columns of the parity check matrix to zero. The above shortening pattern may be a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs.

[0009] In each aspect of the present specification, the shortening pattern may be applied based on the length of the codeword being greater than a predetermined length.

[0010] In each aspect of the specification, each of the plurality of shortening patterns may be defined for the highest code rate supported by the base graph associated with the parity check matrix for the corresponding TBS.

[0011] In each aspect of this specification, the parity check matrix is ​​Z each element in the basic graphc -by-Z c Zero matrix or Z c -by-Z c Z obtained by cyclically transitioning the identity matrix by positive integers c -by-Z c Determined by replacing with a circular permutation matrix,

[0012] In each aspect of the present specification, the codeword is divided into an information bit sequence and a parity bit sequence, and the shortening pattern for the TBS of the transport block may represent (N - E) bit positions to be removed in the information bit sequence, where E is a predetermined length and N is the length of the codeword.

[0013] In each aspect of the specification, the set of (N - E) bit positions to be removed may differ from the set of the last (N - E) consecutive bit positions in the information bit sequence.

[0014] In each aspect of the present specification, it may further include determining a cyclic redundancy check (CRC) sequence based on the transport block; and generating the code block by adding the CRC sequence to the transport block.

[0015] In each aspect of the present specification, the predetermined length may be determined based on the amount of wireless resources allocated for the transmission of the transport block, the modulation order, and the target code rate.

[0016] In each aspect of the present specification, the device may be a base station, and the method or operation may further include transmitting control information including information regarding the radio resources and information regarding the modulation order and the target code rate.

[0017] In each aspect of the present specification, the device may be a user device, and the method or operation may further include receiving control information including information regarding the wireless resources and information regarding the modulation order and the target code rate.

[0018] In each aspect of the present specification, the method or operation related to the channel decoding may include: performing a CRC based on a cyclic redundancy check (CRC) sequence within the codeword; performing a syndrome check based on the parity check matrix; determining a predetermined CRC sequence that matches the CRC sequence among a plurality of predetermined CRC sequences associated with the parity check matrix based on the failure of the CRC and the success of the syndrome check, wherein the plurality of predetermined CRC sequences are respectively associated with a plurality of minimum distance codewords; and determining a transmitted codeword based on a binary sum between the minimum distance codeword associated with the predetermined CRC sequence and the codeword.

[0019] The above-mentioned problem-solving methods are merely some of the examples of this specification, and various examples reflecting the technical features of this specification can be derived and understood by a person with ordinary knowledge in the relevant technical field based on the detailed description below.

[0020] According to some implementations of this specification, wireless communication signals can be efficiently transmitted and received. Accordingly, the overall throughput of the wireless communication system can be increased.

[0021] According to some implementations of this specification, LDPC codes suitable for next-generation wireless communication systems can be provided.

[0022] The effects of this specification are not limited to those mentioned above, and other unmentioned effects will be clearly understood by those skilled in the art related to this specification from the detailed description below.

[0023] The attached drawings, included as part of the detailed description to aid in understanding the implementations of this specification, provide examples of the implementations of this specification and describe the implementations of this specification together with the detailed description:

[0024] FIG. 1 illustrates an example of a communication system 1 to which the implementations of the present specification are applied;

[0025] FIG. 2 is a block diagram illustrating examples of communication devices capable of performing the method according to the present specification;

[0026] Fig. 3 shows the third-generation partnership project (3 rd This illustrates an example of a frame structure available in a wireless communication system based on the Generation Partnership Project (3GPP);

[0027] FIG. 4 illustrates the processing process at the transmission end for a transport block (TB);

[0028] FIG. 5 illustrates an example of a transport block encoding process according to several scenarios;

[0029] Figure 6 is illustrated to explain the concept of the rate matching process;

[0030] Figure 7 illustrates the parity check matrix H of an LDPC code and the corresponding Tanner graph;

[0031] Figures 6 and 7 are illustrated to explain the parity check matrix H of a low density parity check (LDPC) code through a bipartite graph;

[0032] FIG. 8 is an example of a synesthetic codeword structure generated by encoding;

[0033] Figures 9 and 10 are illustrated to explain the parity check matrix H of an LDPC code through a bipartite graph;

[0034] FIG. 11 illustrates circulant permutation matrices (CPMs);

[0035] Figure 12 illustrates the schematic structure of the basic graph of an LDPC code;

[0036] Figure 13 is illustrated to explain the criteria for selecting the LDPC basic graph;

[0037] FIG. 14 illustrates a process for determining the number of code blocks (CBs) according to several implementations;

[0038] FIG. 15 illustrates puncturing locations for an LDPC code;

[0039] FIG. 16 illustrates shortening positions for an LDPC code;

[0040] FIG. 17 illustrates the form of a final codeword obtained by applying puncturing and shortening to a coded bit sequence;

[0041] FIG. 18 is illustrated to explain mis-decoding errors;

[0042] FIG. 19 illustrates the structure of a Raptor-like LDPC code;

[0043] FIG. 20 is an example of applying a shortening pattern to parity check matrices of different code rates according to some implementations of the present specification;

[0044] FIG. 21 illustrates the word error rate performance for a shortening pattern determined according to some implementations of the present specification;

[0045] FIG. 22 illustrates the word error rate performance for a shortening pattern determined according to some implementations of the present specification by code rate;

[0046] FIG. 23 is illustrated to illustrate cyclic redundancy check (CRC)-assisted post-processing according to some implementations of the present specification;

[0047] FIG. 24 illustrates a channel encoding process according to some implementations of the present specification;

[0048] FIG. 25 illustrates a channel decoding process according to some implementations of the present specification.

[0049] Implementations according to this specification are described below with reference to the accompanying drawings. The detailed description disclosed below, together with the accompanying drawings, is intended to describe exemplary implementations of this specification and is not intended to represent the only form in which this specification may be practiced. The detailed description below includes specific details to provide a complete understanding of this specification. However, a person skilled in the art will know that this specification may be practiced without such specific details.

[0050] In some cases, to avoid ambiguity regarding the concepts of this specification, known structures and devices may be omitted or depicted in the form of block diagrams focusing on the core functions of each structure and device. Additionally, the same reference numerals are used to describe identical components throughout this specification.

[0051] The techniques, devices, and systems described below can be applied to various wireless multiple access systems. Examples of multiple access systems include CDMA (code division multiple access) systems, FDMA (frequency division multiple access) systems, TDMA (time division multiple access) systems, OFDMA (orthogonal frequency division multiple access) systems, SC-FDMA (single carrier frequency division multiple access) systems, and MC-FDMA (multi carrier frequency division multiple access) systems. CDMA can be implemented in wireless technologies such as UTRA (Universal Terrestrial Radio Access) or CDMA2000. TDMA can be implemented in wireless technologies such as GSM (Global System for Mobile communication), GPRS (General Packet Radio Service), and EDGE (Enhanced Data Rates for GSM Evolution) (i.e., GERAN). OFDMA can be implemented in wireless technologies such as IEEE (Institute of Electrical and Electronics Engineers) 802.11 (WiFi), IEEE 802.16 (WiMAX), IEEE 802-20, and E-UTRA (evolved-UTRA). UTRA is part of UMTS (Universal Mobile Telecommunication System), and 3GPP (3rd Generation Partnership Project) LTE (Long Term Evolution) is part of E-UMTS that utilizes E-UTRA.3GPP LTE adopts OFDMA for the downlink (DL) and SC-FDMA for the uplink (UL). LTE-A (LTE-advanced) is an evolved form of 3GPP LTE.

[0052] For the convenience of explanation, the following description assumes that this specification applies to 3GPP-based communication systems, such as LTE and NR. However, the technical features of this specification are not limited thereto. For example, even though the following detailed description is based on a mobile communication system corresponding to a 3GPP LTE / NR system, it may be applied to any other mobile communication system, except for matters specific to 3GPP LTE / NR.

[0053] For terms and technologies used in this specification that are not specifically described, reference may be made to 3GPP-based standard documents, e.g., 3GPP TS 36.211, 3GPP TS 36.212, 3GPP TS 36.213, 3GPP TS 36.321, 3GPP TS 36.300 and 3GPP TS 36.331, 3GPP TS 37.213, 3GPP TS 38.211, 3GPP TS 38.212, 3GPP TS 38.213, 3GPP TS 38.214, 3GPP TS 38.300, 3GPP TS 38.331, etc.

[0054] In the examples of this specification described below, the expression that the device "assumes" may mean that the entity transmitting the channel transmits the channel in accordance with said "assume." It may mean that the entity receiving the channel receives or decodes the channel in a form that conforms to said "assume," under the premise that the channel was transmitted in accordance with said "assume."

[0055] In this specification, UEs may be fixed or mobile and include various devices that communicate with a base station (BS) to transmit and / or receive user data and / or various control information. A UE may be referred to as Terminal Equipment, Mobile Station (MS), Mobile Terminal (MT), User Terminal (UT), Subscribe Station (SS), wireless device, Personal Digital Assistant (PDA), wireless modem, handheld device, etc. Additionally, in this specification, a BS generally refers to a fixed station that communicates with a UE and / or other BSs, and exchanges various data and control information by communicating with a UE and other BSs. A BS may be referred to by other terms such as Advanced Base Station (ABS), Node-B (NB), eNB (evolved-NodeB), Base Transceiver System (BTS), Access Point, Processing Server (PS), etc. In particular, BSs of UTRAN are called Node-Bs, BSs of E-UTRAN are called eNBs, and BSs of new radio access technology networks are called gNBs. For convenience of explanation, BSs will be collectively referred to as BSs regardless of the type or version of the communication technology.

[0056] In this specification, a node refers to a fixed point capable of transmitting or receiving wireless signals by communicating with a UE. Various types of BSs may be used as nodes regardless of their designation. For example, a BS, NB, eNB, pico-cell eNB (PeNB), home eNB (HeNB), relay, repeater, etc., may serve as a node. Additionally, a node does not have to be a BS. For example, it may be a radio remote head (RRH) or a radio remote unit (RRU). RRHs, RRUs, etc. generally have a power level lower than that of a BS. Since an RRH or RRU (or RRH / RRU) is generally connected to a BS via a dedicated line such as an optical cable, cooperative communication between an RRH / RRU and a BS can be performed more smoothly compared to cooperative communication between BSs connected via wireless lines. At least one antenna is installed at a node. This antenna may refer to a physical antenna, an antenna port, a virtual antenna, or an antenna group. Nodes are also referred to as points.

[0057] In this specification, the term "cell" refers to a specific geographical area where one or more nodes provide communication services. Accordingly, in this specification, communicating with a specific cell may mean communicating with a BS or node that provides communication services to said specific cell. Furthermore, the downlink / uplink signals of a specific cell refer to downlink / uplink signals from to or to the BS or node that provides communication services to said specific cell. A cell that provides uplink / downlink communication services to a UE is specifically referred to as a serving cell. Additionally, the channel state / quality of a specific cell refers to the channel state / quality of the channel or communication link formed between the BS or node providing communication services to said specific cell and the UE. In a 3GPP-based communication system, a UE can measure the downlink channel state from a specific node using the CRS(s) transmitted by the antenna port(s) of the specific node over the CRS (Cell-specific Reference Signal) resource assigned to the specific node and / or the CSI-RS(s) transmitted over the CSI-RS (Channel State Information Reference Signal) resource.

[0058] Meanwhile, 3GPP-based communication systems use the concept of a cell to manage wireless resources, and a cell associated with wireless resources is distinguished from a cell in a geographical area.

[0059] A “cell” of a geographical area can be understood as the coverage over which a node can provide services using a carrier wave, and a “cell” of a wireless resource is associated with the bandwidth (BW), which is the frequency range configured by said carrier wave. Since downlink coverage, which is the range over which a node can transmit a valid signal, and uplink coverage, which is the range over which a valid signal can be received from a UE, depend on the carrier wave carrying the signal, the coverage of a node is also associated with the coverage of the “cell” of the wireless resource used by said node. Therefore, the term “cell” can be used to refer sometimes to the coverage of a service by a node, sometimes to a wireless resource, and sometimes to the range over which a signal using said wireless resource can reach with effective strength.

[0060] Meanwhile, 3GPP communication standards use the concept of a cell to manage radio resources. A "cell" associated with radio resources is defined as a combination of downlink resources (DL resources) and uplink resources (UL resources), that is, a combination of a DL component carrier (CC) and a UL CC. A cell can be configured as a DL resource alone or as a combination of a DL resource and a UL resource. Where carrier aggregation is supported, the linkage between the carrier frequency of a DL resource (or DL ​​CC) and the carrier frequency of a UL resource (or UL CC) can be indicated by system information. For example, the combination of DL resources and UL resources can be indicated by a System Information Block Type 2 (SIB2) linkage. Here, the carrier frequency may be equal to or different from the center frequency of each cell or CC. When Carrier Aggregation (CA) is established, the UE has only one Radio Resource Control (RRC) connection with the network. One serving cell provides Non-Access Stratum (NAS) mobility information during RRC establishment / re-establishment / handover, and one serving cell provides security input during RRC re-establishment / handover. This cell is called a primary cell (Pcell). A Pcell is a cell operating on the primary frequency where the UE performs the initial connection establishment procedure or initiates the connection re-establishment procedure.Depending on the UE capability, secondary cells (Scells) can be configured to form a set of serving cells together with Pcells. Scells can be configured after a Radio Resource Control (RRC) connection is established and are cells that provide additional radio resources in addition to the resources of special cells (SpCells). The carrier corresponding to a Pcell in the downlink is called the downlink primary CC (DL PCC), and the carrier corresponding to a Pcell in the uplink is called the UL primary CC (DL PCC). The carrier corresponding to an Scell ​​in the downlink is called the DL secondary CC (DL SCC), and the carrier corresponding to the Scell ​​in the uplink is called the UL secondary CC (UL SCC).

[0061] In the case of dual connectivity (DC) operation, the term SpCell refers to a Pcell of the master cell group (MCG) or a Pcell of the secondary cell group (SCG). SpCells support PUCCH transmission and contention-based random access, and are always active. The MCG is a group of serving cells associated with a master node (e.g., BS) and consists of a SpCell (Pcell) and optionally one or more Scells. For a UE configured as a DC, the SCG is a subset of serving cells associated with a secondary node and consists of a PSCell and zero or more Scells. A PSCell is the primary Scell ​​of the SCG. For a UE in the RRC_CONNECTED state that is not configured as a CA or DC, there is only one serving cell consisting solely of Pcells. For a UE in the RRC_CONNECTED state configured as CA or DC, the term serving cells refers to a set of cells consisting of SpCell(s) and all Scell(s). In the DC, two MAC entities are configured on the UE: one medium access control (MAC) entity for the MCG and one MAC entity for the SCG.

[0062] In a UE where CA is set and DC is not set, a Pcell PUCCH group consisting of a Pcell and zero or more Scells and an Scell ​​PUCCH group consisting only of Scell(s) may be set. In the case of an Scell, an Scell ​​(hereinafter referred to as PUCCH cell) to which a PUCCH associated with the cell is transmitted may be set. An Scell ​​designated as a PUCCH Scell ​​belongs to the Scell ​​PUCCH group, and a PUCCH transmission of the associated UCI is performed on the said PUCCH Scell; an Scell ​​that is not designated as a PUCCH Scell, or an Scell ​​designated as a cell for PUCCH transmission that is a Pcell, belongs to the Pcell PUCCH group, and a PUCCH transmission of the associated UCI is performed on the said Pcell.

[0063] In a wireless communication system, the UE receives information from the BS via the downlink (DL) and transmits information to the BS via the uplink (UL). The information transmitted and / or received by the BS and the UE includes data and various control information, and various physical channels exist depending on the type and purpose of the information they transmit and / or receive.

[0064] 3GPP-based communication standards define downlink physical channels corresponding to resource elements that carry information originating from upper layers, and downlink physical signals corresponding to resource elements used by the physical layer but not carrying information originating from upper layers. For example, the Physical Downlink Shared Channel (PDSCH), Physical Broadcast Channel (PBCH), and Physical Downlink Control Channel (PDCCH) are defined as downlink physical channels, while the reference signal and synchronization signal are defined as downlink physical signals. The reference signal (RS), also referred to as a pilot, refers to a signal of a specific, predefined waveform known to both the BS and the UE. For example, the Demodulation Reference Signal (DMRS) and Channel State Information RS (CSI-RS) are defined as downlink reference signals. 3GPP-based communication standards define uplink physical channels corresponding to resource elements that carry information originating from upper layers, and uplink physical signals corresponding to resource elements that are used by the physical layer but do not carry information originating from upper layers.For example, the physical uplink shared channel (PUSCH), physical uplink control channel (PUCCH), and physical random access channel (PRACH) are defined as uplink physical channels, and the demodulation reference signal (DMRS) for uplink control / data signals and the sounding reference signal (SRS) used for uplink channel measurement are defined.

[0065] In this specification, PDCCH (Physical Downlink Control Channel) refers to a set of time-frequency resources (e.g., resource elements (REs)) carrying DCI (Downlink Control Information), and PDSCH (Physical Downlink Shared Channel) refers to a set of time-frequency resources carrying downlink data. Additionally, PUCCH (Physical Uplink Control Channel), PUSCH (Physical Uplink Shared Channel), and PRACH (Physical Random Access Channel) respectively refer to sets of time-frequency resources carrying UCI (Uplink Control Information), uplink data, and random access signals. In the following, the expression that a user device transmits / receives PUCCH / PUSCH / PRACH is used to mean that the user device transmits / receives uplink control information / uplink data / random access signals on or through PUCCH / PUSCH / PRACH, respectively. In addition, the expression that BS transmits / receives PBCH / PDCCH / PDSCH is used with the same meaning as transmitting broadcast information / downlink control information / downlink data on or through PBCH / PDCCH / PDSCH, respectively.

[0066] In this specification, radio resources (e.g., time-frequency resources) scheduled or set for a UE by a BS for the transmission or reception of PUCCH / PUSCH / PDSCH are also referred to as PUCCH / PUSCH / PDSCH resources.

[0067] Since the communication device receives SSB, DMRS, CSI-RS, PBCH, PDCCH, PDSCH, PUSCH, and / or PUCCH in the form of radio signals on the cell, it cannot selectively receive only radio signals containing only a specific physical channel or a specific physical signal through the RF receiver, nor can it selectively receive only radio signals excluding only a specific physical channel or a specific physical signal through the RF receiver. In actual operation, the communication device first receives radio signals on the cell through the RF receiver, converts the radio signals, which are RF band signals, into baseband signals, and uses one or more processors to decode the physical signals and / or physical channels within the baseband signals. Accordingly, in some implementations of this specification, not receiving a physical signal and / or physical channel may actually mean that the communication device does not receive wireless signals containing the physical signal and / or physical channel at all, but rather does not attempt to recover the physical signal and / or physical channel from the wireless signals, for example, not attempt to decode the physical signal and / or physical channel.

[0068] As more communication devices require larger communication capacities, the need for improved mobile broadband communication compared to existing radio access technology (RAT) is emerging. Furthermore, Massive Mobile Telecommunications (MTC), which connects multiple devices and objects to provide various services anytime and anywhere, is also one of the key issues to be considered in next-generation communication. In addition, communication system designs that consider reliability and latency-sensitive services / UEs are being discussed. Accordingly, the introduction of next-generation RATs that incorporate advanced mobile broadband communication, Massive MTC, and Ultra-Reliable and Low Latency Communication (URLC) is being discussed. Currently, 3GPP is conducting studies on next-generation mobile communication systems following the EPC. For convenience, this specification refers to the technology as New RAT (NR) or 5G RAT, and systems that use or support NR are referred to as NR systems.

[0069] FIG. 1 illustrates an example of a communication system 1 to which the implementations of the present specification apply. Referring to FIG. 1, the communication system (1) to which the present specification applies includes a wireless device, a BS, and a network. Here, a wireless device refers to a device that performs communication using wireless access technology (e.g., 5G NR (New RAT), LTE (e.g., E-UTRA)) and may be referred to as a communication / wireless / 5G device. Although not limited thereto, a wireless device may include a robot (100a), a vehicle (100b-1, 100b-2), an XR (eXtended Reality) device (100c), a hand-held device (100d), a home appliance (100e), an IoT (Internet of Thing) device (100f), and an AI device / server (400). For example, a vehicle may include a vehicle equipped with wireless communication capabilities, an autonomous vehicle, a vehicle capable of performing inter-vehicle communication, etc. Here, vehicles may include UAVs (Unmanned Aerial Vehicles) (e.g., drones). XR devices include AR (Augmented Reality) / VR (Virtual Reality) / MR (Mixed Reality) devices and may be implemented in the form of HMDs (Head-Mounted Devices), HUDs (Head-Up Displays) equipped in vehicles, televisions, smartphones, computers, wearable devices, home appliances, digital signage, vehicles, robots, etc. Portable devices may include smartphones, smartpads, wearable devices (e.g., smartwatches, smart glasses), computers (e.g., laptops, etc.). Home appliances may include TVs, refrigerators, washing machines, etc. IoT devices may include sensors, smart meters, etc. For example, BS and networks may be implemented as wireless devices, and specific wireless devices may operate as BS / network nodes to other wireless devices.

[0070] Wireless devices (100a to 100f) can be connected to a network (300) via a BS (200). Artificial Intelligence (AI) technology may be applied to the wireless devices (100a to 100f), and the wireless devices (100a to 100f) can be connected to an AI server (400) via the network (300). The network (300) can be configured using a 3G network, a 4G (e.g., LTE) network, or a 5G (e.g., NR) network. The wireless devices (100a to 100f) may communicate with each other via the BS (200) / network (300), but they may also communicate directly (e.g., sidelink communication) without using the BS / network. For example, vehicles (100b-1, 100b-2) can communicate directly (e.g., V2V (Vehicle to Vehicle) / V2X (Vehicle to everything) communication). Also, IoT devices (e.g., sensors) can communicate directly with other IoT devices (e.g., sensors) or other wireless devices (100a to 100f).

[0071] Wireless communication / connection (150a, 150b) may be established between wireless devices (100a~100f) / BS (200) and BS (200) / wireless devices (100a~100f). Here, the wireless communication / connection may be established through uplink / downlink communication (150a) and sidelink communication (150b) (or D2D communication) using various wireless access technologies (e.g., 5G NR). Through the wireless communication / connection (150a, 150b), wireless devices and BS / wireless devices may transmit / receive wireless signals to / from each other. To this end, based on various proposals of the present specification, at least some of the following may be performed: a process for setting various configuration information for transmitting / receiving wireless signals, a process for various signal processing (e.g., channel encoding / decoding, modulation / demodulation, resource mapping / demapping, etc.), and a resource allocation process.

[0072] FIG. 2 is a block diagram illustrating examples of communication devices capable of performing the method according to the present specification. Referring to FIG. 2, a first wireless device (100) and a second wireless device (200) can transmit and / or receive wireless signals through various wireless access technologies (e.g., LTE, NR). Here, {the first wireless device (100), the second wireless device (200)} may correspond to {wireless device (100x), BS (200)} and / or {wireless device (100x), wireless device (100x)} of FIG. 1.

[0073] The first wireless device (100) includes one or more processors (102) and one or more memories (104), and may additionally include one or more transceivers (106) and / or one or more antennas (108). The processor (102) controls the memory (104) and / or transceivers (106) and may be configured to implement the functions, procedures and / or methods described / suggested below. For example, the processor (102) may process information within the memory (104) to generate a first information / signal and then transmit a wireless signal containing the first information / signal through the transceiver (106). Additionally, the processor (102) may receive a wireless signal containing a second information / signal through the transceiver (106) and then store information obtained from the signal processing of the second information / signal in the memory (104). Memory (104) may be connected to the processor (102) and may store various information related to the operation of the processor (102). For example, memory (104) may store software code containing instructions for performing some or all of the processes controlled by the processor (102) or for performing the procedures and / or methods described / suggested below. Here, the processor (102) and memory (104) may be part of a communication modem / circuit / chip designed to implement wireless communication technology (e.g., LTE, NR). A transceiver (106) may be connected to the processor (102) and may transmit and / or receive wireless signals through one or more antennas (108). The transceiver (106) may include a transmitter and / or receiver. The transceiver (106) may be interchangeably used with an RF (Radio Frequency) unit. In this specification, a wireless device may mean a communication modem / circuit / chip.

[0074] The second wireless device (200) includes one or more processors (202) and one or more memories (204), and may additionally include one or more transceivers (206) and / or one or more antennas (208). The processor (202) controls the memory (204) and / or transceivers (206) and may be configured to implement the functions, procedures and / or methods described / suggested below. For example, the processor (202) may process information within the memory (204) to generate a third information / signal and then transmit a wireless signal containing the third information / signal through the transceiver (206). Additionally, the processor (202) may receive a wireless signal containing a fourth information / signal through the transceiver (206) and then store information obtained from the signal processing of the fourth information / signal in the memory (204). Memory (204) may be connected to the processor (202) and may store various information related to the operation of the processor (202). For example, memory (204) may store software code containing instructions for performing some or all of the processes controlled by the processor (202) or for performing the procedures and / or methods described / suggested below. Here, the processor (202) and memory (204) may be part of a communication modem / circuit / chip designed to implement wireless communication technology (e.g., LTE, NR). A transceiver (206) may be connected to the processor (202) and may transmit and / or receive wireless signals through one or more antennas (208). The transceiver (206) may include a transmitter and / or receiver. The transceiver (206) may be interchangeably used with an RF unit. In this specification, a wireless device may mean a communication modem / circuit / chip.

[0075] The wireless communication technology implemented in the wireless device (100, 200) of this specification may include LTE, NR, and 6G, as well as Narrowband Internet of Things for low-power communication. In this case, for example, NB-IoT technology may be an example of LPWAN (Low Power Wide Area Network) technology and may be implemented according to standards such as LTE Cat NB1 and / or LTE Cat NB2, but is not limited to the names mentioned above. Additionally, or generally, the wireless communication technology implemented in the wireless device (XXX, YYY) of this specification may perform communication based on LTE-M technology. In this case, for example, LTE-M technology may be an example of LPWAN technology and may be referred to by various names such as eMTC (enhanced Machine Type Communication). For example, LTE-M technology may be implemented in at least one of various standards such as 1) LTE CAT 0, 2) LTE Cat M1, 3) LTE Cat M2, 4) LTE non-BL (non-Bandwidth Limited), 5) LTE-MTC, 6) LTE Machine Type Communication, and / or 7) LTE M, and is not limited to the names mentioned above. Additionally or generally, wireless communication technology implemented in the wireless device (XXX, YYY) of this specification may include at least one of ZigBee, Bluetooth, and Low Power Wide Area Network (LPWAN) with consideration for low-power communication, and is not limited to the names mentioned above. As an example, ZigBee technology can create personal area networks (PANs) related to small / low-power digital communication based on various standards such as IEEE 802.15.4 and may be referred to by various names.

[0076] Hereinafter, hardware elements of the wireless device (100, 200) will be described in more detail. Although not limited thereto, one or more protocol layers may be implemented by one or more processors (102, 202). For example, one or more processors (102, 202) may implement one or more layers (e.g., functional layers such as a physical (PHY) layer, a medium access control (MAC) layer, a radio link control (RLC) layer, a packet data convergence protocol (PDCP) layer, a radio resource control (RRC) layer, and a service data adaptation protocol (SDAP) layer). One or more processors (102, 202) may generate one or more protocol data units (PDU) and / or one or more service data units (SDU) according to the functions, procedures, proposals and / or methods disclosed in this specification. One or more processors (102, 202) may generate messages, control information, data, or information according to the functions, procedures, proposals, and / or methods disclosed in this specification. One or more processors (102, 202) may generate a signal (e.g., baseband signal) containing a PDU, SDU, message, control information, data, or information according to the functions, procedures, proposals, and / or methods disclosed in this specification and provide it to one or more transceivers (106, 206). One or more processors (102, 202) may receive a signal (e.g., baseband signal) from one or more transceivers (106, 206) and may obtain a PDU, SDU, message, control information, data, or information according to the functions, procedures, proposals, and / or methods disclosed in this specification.

[0077] One or more processors (102, 202) may be referred to as a controller, microcontroller, microprocessor, or microcomputer. One or more processors (102, 202) may be implemented by hardware, firmware, software, or a combination thereof. For example, one or more Application Specific Integrated Circuits (ASICs), one or more Digital Signal Processors (DSPs), one or more Digital Signal Processing Devices (DSPDs), one or more Programmable Logic Devices (PLDs), or one or more Field Programmable Gate Arrays (FPGAs) may be included in one or more processors (102, 202). The functions, procedures, proposals, and / or methods disclosed in this specification may be implemented using firmware or software, and the firmware or software may be implemented to include modules, procedures, functions, etc. Firmware or software configured to perform the functions, procedures, proposals and / or methods disclosed in this specification may be included in one or more processors (102, 202) or stored in one or more memories (104, 204) and driven by one or more processors (102, 202). The functions, procedures, proposals and / or methods disclosed in this specification may be implemented using firmware or software in the form of code, instructions and / or sets of instructions.

[0078] One or more memories (104, 204) may be connected to one or more processors (102, 202) and may store various forms of data, signals, messages, information, programs, code, instructions, and / or commands. One or more memories (104, 204) may be composed of ROM, RAM, EPROM, flash memory, hard drive, registers, cache memory, computer read storage media, and / or combinations thereof. One or more memories (104, 204) may be located inside and / or outside of one or more processors (102, 202). Additionally, one or more memories (104, 204) may be connected to one or more processors (102, 202) through various technologies such as wired or wireless connections.

[0079] One or more transceivers (106, 206) may transmit user data, control information, wireless signals / channels, etc., as mentioned in the methods and / or operation flowcharts, etc. of this specification to one or more other devices. One or more transceivers (106, 206) may receive user data, control information, wireless signals / channels, etc., as mentioned in the functions, procedures, proposals, methods and / or operation flowcharts, etc. disclosed in this specification from one or more other devices. For example, one or more transceivers (106, 206) may be connected to one or more processors (102, 202) and may transmit and / or receive wireless signals. For example, one or more processors (102, 202) may control one or more transceivers (106, 206) to transmit user data, control information, or wireless signals to one or more other devices. Additionally, one or more processors (102, 202) may control one or more transceivers (106, 206) to receive user data, control information, or wireless signals from one or more other devices. Additionally, one or more transceivers (106, 206) may be connected to one or more antennas (108, 208), and one or more transceivers (106, 206) may be configured to transmit and / or receive user data, control information, wireless signals / channels, etc., as mentioned in the functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this specification through one or more antennas (108, 208). In this specification, one or more antennas may be multiple physical antennas or multiple logical antennas (e.g., antenna ports). One or more transceivers (106, 206) can convert the received wireless signal / channel, etc. from an RF band signal to a baseband signal in order to process the received user data, control information, wireless signal / channel, etc. using one or more processors (102, 202).One or more transceivers (106, 206) can convert user data, control information, wireless signals / channels, etc. processed using one or more processors (102, 202) from baseband signals to RF band signals. To this end, one or more transceivers (106, 206) may include (analog) oscillators and / or filters.

[0080] In this specification, at least one memory (e.g., 104 or 204) may store instructions or programs, and said instructions or programs may, when executed, cause at least one processor operablely connected to said at least one memory to perform operations according to some embodiments or implementations of this specification.

[0081] In this specification, a computer-readable (non-transient) storage medium may store at least one instruction or computer program, and when executed by at least one processor, said at least one instruction or computer program may cause said at least one processor to perform operations according to some embodiments or implementations of this specification.

[0082] In this specification, a processing device or apparatus may include at least one processor and at least one computer memory connectable to said at least one processor. said at least one computer memory may store instructions or programs, and said instructions or programs, when executed, may cause at least one processor operablely connected to said at least one memory to perform operations according to some embodiments or implementations of this specification.

[0083] In this specification, a computer program may include program code stored on at least one computer-readable (non-transient) storage medium and, when executed, perform operations according to some implementations of this specification or cause at least one processor to perform operations according to some implementations of this specification. The computer program may be provided in the form of a computer program product. The computer program product may include at least one computer-readable (non-transient) storage medium.

[0084] A communication device of this specification comprises at least one processor; and at least one computer memory operably connected to said at least one processor and storing instructions that, when executed, cause said at least one processor to perform operations according to the examples(s) of this specification described below.

[0085] Figure 3 illustrates an example of a frame structure available in a 3GPP-based wireless communication system.

[0086] The structure of the frame in Fig. 3 is merely an example, and the number of subframes, slots, and symbols in the frame can be varied. In an NR system, OFDM numerology (e.g., subcarrier spacing (SCS)) may be configured differently among multiple cells aggregated to a single UE. Accordingly, the (absolute time) duration of a time resource (e.g., subframe, slot, or transmission time interval (TTI)) consisting of the same number of symbols may be configured differently among the aggregated cells. Here, symbols may include OFDM symbols (or cyclic prefix-orthogonal frequency division multiplexing (CP-OFDM) symbols) and SC-FDMA symbols (or discrete Fourier transform-spread-OFDM (DFT-s-OFDM) symbols). In this specification, symbols, OFDM-based symbols, OFDM symbols, CP-OFDM symbols, and DFT-s-OFDM Symbols can be substituted for each other.

[0087] Referring to Fig. 3, uplink and downlink transmissions in an NR system are organized into frames. Each frame is T f = (△f max *N f / 100)*T c = It has a duration of 10 ms and is divided into two half-frames, each with a duration of 5 ms. Here, T is the basic time unit for NR. c = 1 / (△f max *N f ) and, △f max = 480*10 3 It is Hz, and N f= 4096. For reference, T is the standard time unit for LTE. s = 1 / (△f ref *N f,ref ) and, △f ref = 15*10 3 It is Hz, and N f,ref =2048. T s Wow T c is a constant κ = T s / T c It has a relationship of = 64. Each half-frame consists of 5 subframes, and the period T of a single subframe. sf is 1ms. Subframes are further divided into slots, and the number of slots within a subframe depends on the subcarrier spacing. Each slot consists of 14 or 12 OFDM symbols based on a cyclic prefix. For a normal cyclic prefix (CP), each slot consists of 14 OFDM symbols, while for an extended CP, each slot consists of 12 OFDM symbols. The above numerology is an exponentially scalable subcarrier spacing △f = 2 u It depends on 15 kHz. The following table shows the subcarrier spacing △f = 2 for a normalized CP. u *Number of OFDM symbols per slot according to 15 kHz (N slot symb ), number of slots per frame (N frame,u slot ) and the number of slots per subframe (N subframe,u slot It represents ).

[0088]

[0089] The following table shows the subcarrier spacing △f = 2 for extended CP. u This shows the number of OFDM symbols per slot, the number of slots per frame, and the number of slots per subframe according to *15 kHz.

[0090]

[0091] For a subcarrier interval setting u, the slots are arranged in increasing order n within the subframe. u s ∈ {0, ..., nsubframe,u slot - 1} and n in increasing order within the frame u s,f ∈ {0, ..., n frame,u slot - 1} is numbered.

[0092] A slot contains multiple (e.g., 14 or 12) symbols in the time domain. For each numeral (e.g., subcarrier interval) and carrier, a common resource block (CRB) N indicated by upper-layer signaling (e.g., radio resource control (RRC) signaling) start,u grid Starting from,N size,u grid,x *N RB sc individual subcarriers and N subframe,u symb A resource grid of N OFDM symbols is defined. Here, N size,u grid,x is the number of resource blocks (RB) in the resource grid, and the subscript x is DL for downlinks and UL for uplinks. RB sc is the number of subcarriers per RB, and in 3GPP-based wireless communication systems, N RB sc is typically 12. There is one resource grid for a given antenna port p, subcarrier spacing configuration u, and transmission direction (DL or UL). Carrier bandwidth N for subcarrier spacing configuration u. size,u gridThis is given to the UE by upper-layer parameters (e.g., RRC parameters) from the network. Each element within the resource grid for antenna port p and subcarrier spacing u is referred to as a resource element (RE), and one complex symbol can be mapped to each resource element. Each resource element within the resource grid is uniquely identified by an index k in the frequency domain and an index l indicating the symbol position relative to a reference point in the time domain. In an NR system, RBs are defined by 12 consecutive subcarriers in the frequency domain. In an NR system, RBs can be classified into Common Resource Blocks (CRBs) and Physical Resource Blocks (PRBs). CRBs are numbered upwards from 0 in the frequency domain for subcarrier spacing u. The center of subcarrier 0 of CRB 0 for subcarrier spacing u coincides with 'Point A', which is the common reference point for the resource block grids. The PRBs for the subcarrier spacing setting u are defined within the bandwidth part (BWP), and range from 0 to N size,u BWP,i Numbered up to -1, where i is the number of the above bandwidth part. Common resource block n u CRB and physical resource block n within bandwidth part i PRB The relationships between them are as follows: n u PRB = n u CRB +N start,u BWP,i , here N start,u BWP,i is a common resource block where the above bandwidth part starts relative to CRB 0. A BWP contains multiple consecutive RBs in the frequency domain. For example, a BWP is a given numerator u within a BWP i on a given carrier. iIt is a subset of contiguous CRBs defined for. The carrier may contain up to N (e.g., 5) BWPs. A UE may be configured to have one or more BWPs on a given component carrier. Data communication is performed through the enabled BWPs, and only a predetermined number (e.g., 1) of the BWPs configured for the UE may be enabled on the carrier.

[0093] A UE configured with carrier aggregation may be configured to use one or more cells. If the UE is configured to have multiple serving cells, the UE may be configured to have one or more cell groups. The UE may be configured to have multiple cell groups associated with different BSs. Alternatively, the UE may be configured to have multiple cell groups associated with a single BS. Each cell group of the UE consists of one or more serving cells, and each cell group includes a single PUCCH cell configured with PUCCH resources. The PUCCH cell may be a Pcell or an Scell ​​configured as a PUCCH cell among the Scells of the corresponding cell group. Each serving cell of the UE belongs to one of the UE's cell groups and does not belong to multiple cell groups.

[0094] NR frequency bands are defined as two types of frequency ranges, FR1 and FR2, where FR2 is also referred to as millimeter wave (mmW). The following table illustrates the frequency ranges in which NR can operate.

[0095]

[0096] Figure 4 illustrates the processing process at the transmission end for a transport block (TB).

[0097] To enable the receiver to correct errors that the wireless signal experiences in the wireless channel, the transmitter codes the information to be sent using a forward error correction code before transmission. At the receiver, the received signal is demodulated, and the transmitted information is restored after undergoing the decoding process of the error correction code. During this decoding process, errors in the received signal caused by the wireless channel are corrected.

[0098] Data reaches the coding block in the form of up to two transport blocks per DL / UL cell every TTI. The following coding steps can be applied to each transport block of the DL / UL cell:

[0099] - Add cyclic redundancy check (CRC) code to transport blocks;

[0100] - Code block segmentation and code block CRC attachment;

[0101] - Channel coding;

[0102] - Rate matching;

[0103] - Code block concatenation.

[0104] In actual communication systems, for the convenience of implementation, transport blocks exceeding a certain size are divided into multiple smaller data blocks for encoding. These divided smaller data blocks are called code blocks.

[0105] FIG. 5 illustrates an example of a transport block encoding process according to several scenarios. Referring to FIG. 5, for example, a TB CRC may be attached to a TB. The TB CRC may be used to confirm the TB during the decoding process. If the TB CRC-attached TB is not larger than a predetermined size, the TB CRC-attached TB is encoded by a (channel) encoder. If the TB CRC-attached TB is larger than the predetermined size, the TB CRC-attached TB may be divided into multiple code blocks (CBs). When the TB CRC-attached TB is divided into multiple CBs, in some scenarios, CB CRCs may be attached to each CB. This allows for the acquisition of multiple CB CRC-attached CBs. The CB CRCs may be used to confirm the CBs during the decoding process by a receiver. Each of the aforementioned multiple CRC-attached CBs can be encoded through a (channel) encoder. While CBs generally have the same size, one of the multiple CBs may have a different size due to size limitations of the channel encoder's internal interleaver. The aforementioned multiple CRC-attached CBs may be encoded in parallel through respective (channel) encoders or one by one through a single (channel) encoder. In some implementations, interleaving may be performed to reduce the impact of burst errors occurring during transmission over a wireless channel after error correction coding is performed in CB units of a fixed interleaver size. Then, the codes are mapped to actual wireless resources and transmitted. Since the amount of wireless resources used during actual transmission is constant, rate matching must be performed on the encoded code blocks to match this. Generally, rate matching is achieved through puncturing or repetition.For example, if the amount of a wireless resource, e.g., the number of transmission bits that can be transmitted by said wireless resource, is M, and the coded bit sequence, i.e., the number of output bits of the encoder, is N, then if M and N are different, rate matching is performed to adjust the length of the coded bit sequence to match M. If M > N, all or part of the bits of the coded bit sequence are repeated so that the length of the rate-matched sequence becomes equal to M. M <N이면, 레이트 매칭된 시퀀스의 길이가 M과 같아지도록, 코딩된 비트 시퀀스의 비트들 중 일부가 펑처링되며, 펑처링된 비트는 전송에서 제외된다.

[0106] In a wireless communication system, the transmitting end encodes the data to be transmitted using channel coding with a specific code rate, and then adjusts the code rate of the data to be transmitted through a rate matching process consisting of puncturing and repetition.

[0107] The output bit sequence following rate matching and code block concatenation is modulated into modulation symbols through a modulator according to the modulation scheme. These modulation symbols are mapped to radio resources allocated by the base station and transmitted to the receiver via these radio resources. The channel code decoding process is the reverse of the encoding process, and a decoder corresponding to each encoder of the transmitter is used in the decoding process performed at the receiver. After performing decoding for each code block (CB), the receiver constructs a TB and finally checks whether the TB passes the TB CRC. In current 3GPP-based systems, the CB CRC is used for fast decoding termination. For example, if the CB CRC fails, the receiver may generate a NACK without decoding other CBs.

[0108] Figure 6 is illustrated to explain the concept of the rate matching process.

[0109] In some implementations, rate matching may be performed after channel coding. In 3GPP-based systems, rate matching for coded bits is defined per code block and can be performed by sub-block interleaving, bit selection, and / or bit interleaving. For example, the input bit sequence to rate matching is d0, d1, d2, d3, ..., d N-1 After rate matching, the output bit sequence is f0, f1, f2, f3, ..., f E-1 ..., the bits input to the sub-block interleavers are the coded bits d0, d1, d2, d3, ..., d N-1 If denoted, the above coded bits d0, d1, d2, d3, ..., d N-1 It can be divided into multiple sub-blocks. Here, E may be a value determined based on the size of the radio resource scheduled for the corresponding transport block. It may be a predetermined or predefined length for the corresponding code block. The bits output from the sub-block interleavers are y0, y1, y2, y3,..., y N-1 Denote, the bit sequence y0, y1, y2, y3,..., y after sub-block interleaving N-1 is written to a circular buffer of length N. If sub-block interleavers are not used, that is, if sub-block interleaving is not applied, the coded bits d0, d1, d2, d3, ..., d N-1 This is written to a circular buffer of length N.

[0110] Bits of length E, representing the rate-matching output sequence, are output from the circular buffer as transmission bits. For example, the redundancy version number for this transmission is rv id Let f be the rate-matching output bit sequence from the circular buffer for the corresponding code block, where sub-block interleaving is not applied. k(Here, k=0,1,2,...,E-1) can be obtained according to the following, where k0 is rv id The value of and the size N of the above circular buffer cb , it may be a value determined based on the corresponding channel code.

[0111] > k = 0;

[0112] > j = 0;

[0113] while k < E

[0114] >> if d(k0+j)mod Ncb≠ <null>

[0115] >>> f k = d(k0+j)mod Ncb;

[0116] >>> k = k+1;

[0117] >> end if

[0118] >> j = j+1

[0119] end while.

[0120] In FIG. 4, the input bit sequences for the code block (CB) concatenation block are sequences f r0 , f r1 , f r2 , f r3 ,...,f r(Er-1) Let r=0, ..., C-1, where C is the number of code blocks and Er is the number of rate-matched bits for the r-th code block. Er may be a value determined based on the size of the wireless resource. Through the code block concatenation above, rate-matched outputs for different code blocks can be concatenated sequentially.

[0121] Hybrid Automatic Request (HARQ) is a technology that combines Forward Error Correction (FEC) and Automatic Repeat Request (ARQ). For example, a transmitter uses FEC to transmit all or part of the encoded coded bits, and a receiver detects whether there is an error in the received data and sends a HARQ-ACK signal to the transmitter indicating an acknowledgment (ACK) or negative ACK (NACK) regarding the received data. If it is determined that there is no error in the data received by the receiver or that it is below a certain threshold, the transmitter transmits new data; however, if it is determined that there is an error in the data received by the receiver or that it exceeds the threshold, the transmitter retransmits the corresponding data block. The receiver combines the retransmitted data block with the previously transmitted data block and performs decoding again to detect for errors. This operation can be performed until no errors are detected or a predetermined number of cycles is reached. Combining methods for decoding retransmitted data blocks can be divided into the following two types.

[0122] * Chase Combining: For combining at the receiver, the transmitter retransmits coded bits identical to the originally transmitted coded bits. Chase combining can reduce the probability of error through power gain during the decoding of the retransmitted data blocks.

[0123] * Incremental Redundancy (IR): For combining at the receiver, the transmitter retransmits coded bits that are not identical to the initially transmitted coded bits. For example, the transmitter sends redundancy to the receiver in the retransmission that was not sent in the initial transmission. Since redundancy not sent in the previous transmission is sent in the retransmission, the redundancy of the previous transmission and the redundancy of the current transmission are combined, increasing the redundancy and consequently lowering the code rate. In other words, incremental redundancy can reduce the probability of error through coding gain during the decoding of the retransmitted data block. Generally, since chase combining corresponds to the case where there is no incremental redundancy among the incremental redundancies, chase combining can be interpreted as a special form of incremental redundancy.

[0124] In the case of HARQ operation, the receiver generates an ACK or a NACK for the received or scheduled packets and provides them to the transmitter. Upon receiving a NACK for transmission, the transmitter may resend the required packet. The bits read from the circular buffer and sent in each retransmission may differ depending on the transmission start position determined by the redundancy version (RV). Referring to FIG. 6, there are multiple (e.g., four) RVs that define the starting point positions from which bits are read from the circular buffer.

[0125] The circular buffer is an important part for rate matching and enables puncturing and / or repetition of the coded bits. Referring to FIG. 6, the coded bits or the output bits after sub-block interleaving of the coded bits are written sequentially to the circular buffer for the mother code. The number of coded bits is read sequentially from the starting point specified by the RV point in the circular buffer.

[0126] There are various types of error correction codes. Among error correction codes, the low-density parity check (LDPC) code is a linear block code with low density, in which most of the elements of the parity check matrix H are zero, and it was proposed by Gallager in 1962. Because the LDPC code was very complex and impossible to implement with the technology available at the time of its proposal, it was forgotten until it was rediscovered in 1995. Since its excellent performance was proven, research on it has been actively conducted (References: [1] Robert G. Gallager, "Low-Density Parity-Check Codes", The MIT Press, September 15, 1963. [2] DJCMackay, Good error-correcting codes based on very sparse matrices, IEEE Trans. Inform. Theory, IT-45, pp.399-431(1999)). Currently, LDPC codes are mainly used in 802.11n (see 'IEEE P802.11n=D10: 'Draft IEEE Standard for Local Metropolitan networks - Specific requirements. Part 11: Wireless LAN Medium Access Control (MAC), and Physical Layer (PHY) specifications: Enhancements for Higher Throughput', March 2006.), 802.11ac, and digital video broadcasting (DVB). Generally, in standards that apply LDPC (e.g., DVB standard), encoding is performed using a parity check matrix instead of a generator matrix.Because the parity check matrix of the LDPC code contains very few 1s, decoding is possible through iterative decoding even with very large block sizes; thus, as the block size becomes very large, it exhibits performance approaching the Shannon channel capacity limit, similar to Turbo codes. The number of 1s contained in a row or column of the above parity check matrix is ​​called the weight. The LDPC code can be described by an (nk)*n parity check matrix H. The generator matrix G corresponding to the parity check matrix H can be obtained by the following mathematical formula.

[0127]

[0128]

[0129] Here, c is a codeword and x are information bits. The receiver's decoder must find the information bits x from the codeword c, which is the encoding result by the transmitter, by utilizing the property Hc=0. That is, when the received codeword is denoted as c', if the value of Hc' is calculated and the result is 0, the first k bits of c' are determined to be the decoded information bits. If the value of Hc' is not 0, algorithms such as the sum-product algorithm or belief propagation algorithm using a graph are used to find a c' that satisfies Hc'=0 and recover x. The above check expression Hc'=0 is c'H according to the relationship between the corresponding information bit and the corresponding generator matrix G. T It can be changed to =0, and therefore the above check expression can change according to the relationship between the information bit and the generator matrix G.

[0130] Figure 7 illustrates the parity check matrix H of an LDPC code and the corresponding Tanner graph.

[0131] A parity check matrix is ​​a binary matrix that defines the parity check expressions of an LDPC code. A parity check matrix defining a single LDPC code can be represented by a single Tanner graph. The column vectors of the parity check matrix are associated with variable nodes, and the row vectors are associated with check nodes. The presence of a '1' in the i-th row and j-th column of the parity check matrix means that the i-th check node and the j-th variable node are connected. For example, let us assume the following parity check matrix (PCM)H.

[0132]

[0133] Referring to the above PCMH or FIG. 7(a), the first row of the PCMH, i.e., the first check node (CN), is connected to the first, second, third, and fourth variable nodes (VN), the second CN is connected to the third, fourth, and sixth VNs, and the third CN is connected to the first, fourth, and fifth VNs. When represented as a Tanner graph, this may be as shown in FIG. 7(b). A Tanner graph consists of i) VNs representing coded bits, ii) CNs representing parity check expressions that the coded bits must satisfy, and iii) edges connecting the VNs and CNs. In Tanner graphs, conventionally, check nodes are represented as squares, and variable nodes are represented as circles. Properties of the PCMH, such as row and column weights, are converted into node degrees in the Tanner graph. Sparsely distributed non-zero entries within the PCMH represent edges in the Tanner graph. The sparsity of non-zero entries enables efficient decoding of these codes using an iterative decoding algorithm known as the belief propagation (BP) algorithm.

[0134] Figure 8 is an example of a synesthetic codeword structure generated by encoding.

[0135] The PCM of an LDPC code specifies the set of all valid codewords. In the case of LDPC codes, valid codewords are always xH T It satisfies the parity check constraints defined by =0. The process of mapping message bits into a valid codeword is called encoding. A codeword is i) message bits u = [u1, u2, u3, ..., u K ] and ii) parity bits p=[p1, p2, p3, ..., p N-K It consists of ].

[0136] Since LDPC codes are linear block codes, message u=[u1, u2, u3,..., u K ] codeword x = [x0, x1x2, ..., x n-1 Encoding as ] can be expressed as the product of u and G as follows: x = u·G, where G is a K-by-N generator matrix.

[0137] For sistermatic LDPC codewords, matrix G is a K-by-K identity matrix I K And it is composed of a (NK)-by-K binary matrix A, G= [I K It is a generator matrix of the form A], where the first K codeword bits are message bits u1, u2, u3, ..., u K It consists of (meaning the i-th message bit is mapped to the i-th codeword bit), and the remaining NK codeword bits are parity bits p1, p2, p3, ..., p (which are the linear sums of the message bits). N-K It consists of. The generated codeword x may be in the form shown by Fig. 8.

[0138] Figures 9 and 10 are illustrated to explain the parity check matrix H of an LDPC code through a bipartite graph.

[0139] In the parity check matrix exemplified in Fig. 9(a), a '1' in the row represents an edge connected to a check node in a bipartite graph, and a '1' in the column represents an edge connected to a variable node. Fig. 9(b) illustrates a portion of the bipartite graph corresponding to the parity check matrix exemplified in Fig. 9(a). Referring to Fig. 9(b), in the reciprocal graph, the nodes on the left represent variable nodes and the nodes on the right represent check nodes.

[0140] Figure 10 illustrates different parity check matrices and entire bipartite lines.

[0141] Referring to FIG. 10, since the product of the parity check matrix H and the codeword c' must be zero, the sum of the hard decision values ​​of the variable nodes connected to any check node must be '0'. FIG. 10(b) illustrates mathematical equations for hard decisions for each check node. Checking whether the sum of the variable node(s) connected to the check node is '0' in this way is called a syndrome check.

[0142] The LDPC codes reflected in the NR standard can be classified as quasi-cyclic LDPC (QC-LDPC) codes. QC-LDPC codes have low encoding / decoding complexity and possess a structure advantageous for parallelization. The parity check matrix of the QC-LDPC code is Z c -by-Z c It can be represented as an m-by-n array of circulant permutation matrices (CPMs). For example, the parity check matrix represents each element within the model matrix or base graph (BG) (also called the base matrix or base code) as Z c -by-Z c CPM or Z c -by-Z c It can be obtained by replacing with a zero matrix. From a model matrix of size m-by-n or an LDPC BG of size m-by-n (mZ c )-by-(nZ c The process of obtaining a parity check matrix is ​​called lifting or expanding.

[0143] Figure 11 illustrates circulant permutation matrices (CPMs). In particular, Figure 11 illustrates a 4x4 CPM. Referring to Figure 11, CPMP a In this equation, a is the circular shift value, a non-negative integer, and magnitude Z c xZ c It is obtained by cyclically transitioning the identity matrix I to the right or left a times. In Fig. 11, the zero matrix is ​​P Δ It is expressed as such, but may be denoted differently depending on the definition in the system or standard. For example, depending on the system or standard, the cyclic transition value a = -1 is sometimes used to represent the zero matrix.

[0144] In the model or exponent matrix for LDPC, each element represents a cyclic transition value or a zero matrix of the CPM. Each element of the LDPC BG is either 0 or 1, and each element with a value of 0 within the LDPC BG has a size Z c xZ c It is replaced by the zero matrix 0, and each element of value 1 within the LDPC BG is CPMI(P i,j It is replaced by ), where i and j are the row index and column index of that element, and I(P i,j ) is size Z c -by-Z c P to the right or left of the identity matrix I i,j It is obtained by cyclic transitions a number of times. P i,j The value of P i,j = mod(V i,j , Z c It can be given by ). V i,j The value of may correspond to the cyclic transition value of the model matrix and may be predefined depending on the system in which LDPC is used. For example, in the case of 3GPP TS 38.212 Release 15, V i,j The value of set index i LS and according to the LDPC BG, this is given by Tables 5.3.2-2 and 5.3.2-3 of 3GPP TS 38.212 Release 15 (see Section 5.3.2 of 3GPP TS 38.212 Release 15).

[0145] In the case of BG introduced in the NR standard, the first two columns of the base graph, corresponding to high-degree variable nodes, are punctured. That is, the base graph and the lifting size Z c The first 2Z of the parity check matrix extended based on c The columns are punctured. Therefore, among the coded bits obtained after encoding using the above parity check matrix, the first 2Z c The bits are punctured. Additionally, the BG introduced in the NR standard features single parity extension to support low code rates. To support various data block sizes (e.g., transport block size or code block size) and for good performance, two BGs are defined, each having 8 CPM values ​​(i.e., respective cyclic transition values ​​for 8 CPMs). In this case, the parity check matrix can be expressed as follows: H = H BG + V i,j , here H BG is an LDPC BG, and V i,j represents the cyclic transition value of CPM.

[0146] Figure 12 illustrates the schematic structure of the basic graph of an LDPC code. In particular, Figure 12(a) is a schematic diagram of the LDPC basic graph 1 (BG1) according to the NR standard, and Figure 12(b) is a schematic diagram of the LDPC basic graph 2 (BG2) according to the NR standard.

[0147] According to 3GPP TS 38.212 Release 15, BG1 is K corresponding to sistermatic information bits. s =22, supports a minimum code rate of 1 / 3, and is a 46-by-68 dimensional matrix. BG2 is K corresponding to synesthetic information bits. s =10, supports a minimum code rate of 1 / 5, and is a 42-by-52 dimensional matrix. Generally, BG1 is advantageous in terms of performance for large data block sizes, while BG2 is advantageous in terms of decoding latency for small data block sizes and low code rates.

[0148] In some implementations of this specification, the parity check matrix for channel encoding / decoding for each code block can be determined as follows.

[0149] Step 1: Select Basic Graph

[0150] Step 2: K b Determine value

[0151] Step 3: Extended Argument Z c decision

[0152] Step 4: Select the shift coefficient matrix set. For example, set index i LS Select

[0153] Step 5: Calculate the value of the base matrix item. For example, P i,j = mod(V i,j , Z c Calculate ) and each element of the elementary matrix Z c -by-Z c CPM or Z c -by-Z c The final parity check matrix is ​​obtained by performing a lifting operation that replaces the matrix with the zero matrix.

[0154] Below, the process of determining the parity check matrix is ​​explained in more detail, using LDPC codes used in 3GPP-based systems (e.g., 5G NR systems) as examples.

[0155] In 3GPP-based systems (e.g., 5G NR systems), LDPC codes are used for efficient data transmission. The performance of LDPC codes depends heavily on the base graph, which can vary depending on the transport block size and code rate. The base graph is a matrix that defines the structure of the LDPC code, and each element is an expansion factor Z c Z according to c -by-Z c It can be replaced with a matrix. The selection of the basic graph is an important factor in LDPC channel coding and plays a crucial role in optimizing transmission efficiency and error correction performance.

[0156] FIG. 13 is illustrated to explain the criteria for selecting an LDPC base graph. For the (initial) transmission of a transport block with a coding rate R (i.e., code rate R) indicated by a modulation and coding scheme (MCS) index within a control information format scheduling a physical channel carrying the transport block, and for the retransmission of the same transport block, each code block of said transport block may be encoded as LDPC BG1 or LDPC BG2. Which base graph will be used may be determined based on a given transport block size and code rate. Referring to FIG. 13, for example, if A ≤ 292, or if A ≤ 3824 and R ≤ 0.67, or if R ≤ 0.25, LDPC BG2 is used; otherwise, LDPC BG1 is used, where A is the payload size, for example, the transport block size (TBS). This basic graph selection process enables channel coding to flexibly respond to various transmission environments and requirements, which can significantly improve system performance.

[0157] Once the basic graph is determined, K b The value is determined. K b is the given Z c Indicates the number of information bit sequences for. For example, in a 3GPP NR-based system, for LDPC BG1 and LDPC BG2, Z c The values ​​are as follows.

[0158] * LDPC BG1: K b = 22

[0159] * LDPC BG2: For B > 640 K b For = 10, 560 < B ≤ 640, K b For = 9, 192 < B ≤ 560, K b For = 8, B ≤ 192, K b = 6. Here, B is the size of the input bit sequence to the code block partition, and may be the same as the size of the transport block with the CRC added.

[0160] The following table illustrates various sets of Z values.

[0161]

[0162] A parity check matrix can be obtained using the BG determined based on TBS and the coding rate R, and the CPM size (i.e., lifting size). For example, for all sets of lifting sizes in the table above, K b *Z c Z, the minimum value of Z that ≥K' c is found, and for LDPC BG1, K = 22Z c a. For LDPC BG2, K = 10Z c It can be set.

[0163] K b *Z c For ≥K', K' = B' / C, where K is the number of bits in each code block, and B' = B + C*L, where B is the size of the CRC-added TB, B = A + L, A is the payload size (i.e., TBS), C is the number of code blocks, and L is the length of the CRC sequence attached to the TB, i.e., the number of CRC bits. K' can be the sum of the code block size K and the CRC sequence length L. The transport block (TB), which is the transmitted data, is a MAC PDU, and the transmitter adds, for example, a 24-bit CRC sequence to the TB and performs LDPC encoding. However, if the size of the CRC-added TB is greater than a certain value, the CRC-added TB is segmented into multiple code blocks (CB). According to 3GPP TS 38.212 Release 15, for BG1, code block segmentation is performed if the size of the CRC-added TB exceeds 8,448 bits, and for BG2, code block segmentation is performed if the size of the CRC-added TB exceeds 3,840 bits. The number of code blocks C obtained based on a single TB can be obtained using the following: C = CEIL{B / (K cb - L)}, where K cb is the maximum code block size, and L is the length of the additional CRC sequence attached to each code block, i.e., the number of CRC bits. As previously mentioned, B is the size of the CRC-added TB. According to 3GPP TS 38.212 Release 15, K cb BG1 is 8448, BG2 is 3840, and L is 24. If the number of CBs C > 1, a 24-bit CRC is added to each CB, and then LDPC encoding is performed.

[0164] Z c Once determined, refer to the relevant table in 3GPP 38.212 (e.g., Table 5.3.2-2 or Table 5.3.2-3 of 3GPP TS 38.212), Z c The set of shift coefficient matrices corresponding to (e.g., set index i) LS V corresponding to i,j A set of values) can be selected. Z c Once the set of transition coefficient matrices is determined, each element P i,j = f(V i,j , Z c ) = mod(V i,j , Z c It is calculated by ), and for 3GPP TS 38.212 Release 15, V i,j The value of set index i LS and according to the LDPC BG, this is given by Tables 5.3.2-2 and 5.3.2-3 of 3GPP TS 38.212 Release 15 (see Section 5.3.2 of 3GPP TS 38.212 Release 15).

[0165] Bit sequence input for a given code block in channel coding: c0, c1, c2, c3, ..., c K-1 Let it be denoted as , and the bits after encoding are d0, d1, d2, d3,..., d N-1 If denoted as such, for each code block encoded by LDPC, for example, the following encoding process may be applied, where K is the number of bits to be encoded and N is the number of bits after encoding:

[0166] > 1) Z in Table 4 c Index i containing LS Find the in set.

[0167] > 2) for k = 2Z c to K-1

[0168] >> if c k ≠ <null>

[0169] >>> d k-2Zc = c k ;

[0170] >> else

[0171] >>> c k = 0;

[0172] >> end if

[0173] end for

[0174] 3) N+2Z so that it becomes c -K parity bits w=c=[w0,w1,w2,w3,...,c N+2Zc-K-1 ] T It generates, where c=[c0,c1,c2,c3,...,c K-1 ] T ;0 is a column vector where all elements are 0. Encoding is performed in GF(2), where GF is a Galois field. In some scenarios, for LDPC BG1, H BG The matrix can have 46 rows with row indices i=0,1,2,...,45 and 68 columns with column indices j=0,1,2,...,67. In some scenarios, for LDPC BG2, H BG The matrix can have 42 rows with row indices i=0,1,2,...,41 and 52 columns with column indices j=0,1,2,...,51. The parity check matrix H is as follows: BG Each element of Z c -by-Z c It can be obtained by replacing with a matrix:

[0175] -H BG Each element of my value 0 is of size Z c *Z c It is replaced by the zero matrix 0;

[0176] -H BG Each element of my value 1 is of size Z c *Z c The circular permutation matrix I(P i,j It is replaced by ), where i and j are the row index and column index of that element, and I(P i,j ) is size Z c -by-Z c P to the right or left of the identity matrix I i,j It is obtained by cyclic transitions a number of times. P i,j The value of P i,j = mod(V i,j , Z c It can be given by ). For example, in the case of 3GPP TS 38.212 Release 15, V i,j The value of is the above set index i LS and according to the LDPC BG, this is given by Tables 5.3.2-2 and 5.3.2-3 of 3GPP TS 38.212 Release 15 (see Section 5.3.2 of 3GPP TS 38.212 Release 15).

[0177] > 4) for k = K to N+2Z c -1

[0178] >> d k-2Zc = w k-K ;

[0179] end for.

[0180] Figure 14 illustrates the process of determining the number of code blocks (CBs) according to some implementations.

[0181] The BS transmits information regarding the number of radio resources allocated to the UE, the number of transport layers, the modulation order, and the target code rate (TCR), and based on this information, the UE can obtain the number of CBs and the size of the CBs associated with the corresponding TB of data carried by the data channel (e.g., PDSCH, PUSCH). For example, in a 3GPP-based system, downlink control information for scheduling the data channel may include an MCS index value, and the MCS index value is a modulation order value Q m The target code rate R can be announced. UE and BS N according to the procedure of Fig. 14 RE , v, Q m Based on , the number of CBs C can be calculated, where N RE is the number of radio resources (e.g., resource elements (REs)) for the transmission of C CBs, v is the number of transmission layers, and Q m is the modulation order, and R is the target code rate. For example, in an NR-based system, the BS and / or UE are N as in FIG. 14. RE , v, Q m , based on R, N' info Calculate , and N' info The number of CBs C can be calculated based on and R. BS and / or UE are N' as in Equation 4. info Based on the size of C and CB CRC, the size of CB K (without CRC added) d can be calculated. BS and / or UE are K as in Equation 5 d The size of TB can be obtained by multiplying the number of CBs C and subtracting the size of TB CRC. In Equation 5, the size of TB CRC is assumed to be 24.

[0182]

[0183]

[0184] In some scenarios, transport block sizes are predefined in the system to facilitate the transmitter and carrier assuming / generating the same transport block size. The following is an example of a transport block size table. For example, referring to Fig. 14, the unquantized intermediate variable N info If ≤ 3824, then the quantized intermediate number of information bits N' info = max{24, 2 n *floor(N info / 2 n )} and, where n = max{3, floor(log2(N info )) - 6} and N' in the following table info The nearest TBS that is not smaller is determined as the TBS for the corresponding data channel.

[0185]

[0186] If the TBS is smaller than 3824-bit, for example, the TBS can be determined as defined in the table above. The threshold of 3824 is based on 3840-bit, which is the maximum code block size that can be handled by LDPC channel coding when using LDPC BG2. Since CRC bits are added before channel coding, a 16-bit CRC can be added to transport blocks smaller than 3824-bit, and after the CRC is added, the total size can be up to 3840-bit. Since LDPC BG1 can handle code block sizes up to 8448-bit, transport blocks smaller than 3824-bit do not require splitting before channel coding for both LDPC BG1 and LDPC BG2.

[0187] In some implementations, rate matching may be performed after channel coding. In 3GPP-based systems, rate matching for LDPC codes is defined per code block and can be achieved through bit selection and bit interleaving. In this specification, the input bit sequence to rate matching is d0, d1, d2, d3,..., d N-1 After rate matching, the output bit sequence is f0, f1, f2, f3, ..., f E-1 It can be denoted as. If sub-block interleaving is not applied, the output bit sequence f0,f1,f2,f3,...,f after rate matching. E-1 length N cb It is written to the circular buffer. If sub-block interleaving is applied, the above coded bits d0, d1, d2, d3,..., d N-1 It can be divided into multiple sub-blocks. In this specification, the bits input to the sub-block interleaver are the coded bits d0, d1, d2, d3, ..., d N-1 As such, the bits output from the sub-block interleaver are y0, y1, y2, y3,..., y N-1 If denoted as, the bit sequence y0, y1, y2, y3,..., y after the sub-block interleaver N-1 length N cb It is written to the circular buffer.

[0188] In some scenarios, LDPC codes are applied to the data channel, and limited buffer rate matching (LBRM) is performed, in which part of the codeword is not stored in the transmitter's circular buffer due to constraints on the size of the circular buffer within the transmitter or receiver. LBRM excludes some of the coded bits corresponding to the mother code rate from the transmit buffer. Since this effectively increases the mother code rate physically, it can bring benefits in terms of implementation by reducing the receiver's memory complexity and processing burden. However, the increase in the mother code rate can lead to performance degradation. Generally, the transport block size (TBS) affected by LBRM depends on the number of coded bits stored in the circular buffer defined by the LBRM. For example, if the number of coded bits stored in the circular buffer can support the mother code rate when LBRM is not applied, it may be desirable to apply full buffer rate matching to the TBS.

[0189] In some implementations of this specification, the circular buffer size N cb If LBRM is not applied, it is N cb = N, otherwise N cb = min(N, N ref ) and here N ref is TBS, the number of code blocks C, and the predefined or pre-configured code rate R for LBRM. LBRM It can be determined based on. For example, in some implementations, N ref = floor{TBS / (C*R LBRM It can be determined by )}.

[0190] When LBRM is applied, the circular buffer size assumed for indicating the RV during HARQ operations is reduced, so the position of the RV during HARQ operations is also changed. In some implementations, for example, the position of the RV may be scaled and indicated in proportion to the reduced circular buffer.

[0191] In current 3GPP-based wireless systems, Turber codes and LDPC codes are applied for channel coding of data channels. Both LDPC codes are a type of syntactic code. That is, a codeword (also called a coded bit sequence) consists of information bits and parity bits. For example, the input sequence c0, c1, ..., c K-1 The codeword obtained through LDPC code-based channel coding for the above input sequence c0,c1,...,c K-1 Includes as is as part of the above codeword.

[0192] FIG. 15 illustrates puncturing locations for an LDPC code, and FIG. 16 illustrates shortening locations for an LDPC code.

[0193] For effective wireless communication, it is important for wireless communication systems to support various code rates and code lengths in relation to channel coding. Therefore, for LDPC codes defined in communication system standards, transmitters may perform shortening and / or puncturing on some message bits of the parity check matrix and puncturing on some parity bits to support the required code rate and message length. Shortening is a rate-matching method that reduces the amount of (valid) information bits actually transmitted by excluding some information bits from transmission or replacing them with known values ​​(e.g., 0). In the case of shortening, the shortened bits among the information bits are fixed to 0 and are not actually transmitted; however, since the decoder is aware that the shortening bits are 0, the amount of valid information of the corresponding code is reduced. Puncturing is generally a rate-matching method that excludes some parity bits from transmission, but in 5G NR LDPC codes, message puncturing (e.g., leading information bits (e.g., 2Z)) is performed exceptionally. c Puncturing is performed on the information bits. In the case of message puncturing, the punctured bits must also be decoded at the receiver, and the decoder performs decoding by assuming the punctured bits are unknown values. Therefore, in the case of message decoding, the amount of valid information is maintained without being reduced. If the number of information bits is K, the number of parity bits is M, and the total number of coded bits is N, the code rate can be expressed as K / (K+M) = K / N. When shortening is performed, it has an effect similar to decreasing the value of K in the code rate, and when parity puncturing is performed, it has an effect similar to decreasing the value of M in the code rate. However, in the case of message puncturing, even if the punctured message bits are not actually transmitted, the receiver must decode the punctured message bits, so the value of K in the code rate does not decrease. In 5G NR, parity bits are added equal to the number of punctured message bits, so the number of transmitted bits remains the same regardless of puncturing.

[0194] A parity check matrix is ​​a matrix that enables the detection of whether a received codeword is valid through matrix multiplication, and one parity check matrix defines one code.

[0195] For example, in the case of LDPC codes defined in 5G NR, a radio access technology developed by 3GPP for 5G mobile networks, the lifting degree Z c Regarding puncturing, the first 2Z of the message beats c It is performed on bits, and referring to FIG. 16, shortening is performed on the last part of the portion corresponding to message bits in the parity check matrix to satisfy a given message length (e.g., input length K to the channel encoder for one code block). For example, in the case of NR BG2, for shortening, the leading 10Z corresponding to the message bits of the parity check matrix c The last of the columns (K - 10Z c Elements within ) columns can be set to 0. Or, as another example, for shortening, the length 10Z corresponding to the sistermatic information part of the parity check matrix. c The leading part of the input bit sequence contains c0, c1, ..., c K-1 This is set, and each of the remaining bits can be set to 0. The lifting degree is a value defined in the QC LDPC code and is a variable regarding how much the basic graph will be expanded.

[0196] Figure 17 illustrates the form of a final codeword obtained by applying puncturing and shortening to a coded bit sequence.

[0197] LDPC codes suffer from a chronic problem of performance degradation caused by error floors in high SNR regions. These error floors arise from two causes: one is mis-decoding due to low-weight codewords, and the other is decoding failure dependent on the decoder. Mis-decoding refers to the receiver decoding a received signal into a codeword other than the one transmitted by the transmitter, while decoding failure can mean the inability to determine which codeword the received signal carried after decoding. Existing research on improving LDPC error floors has focused on reducing decoding failure errors by improving the decoder. However, this method cannot effectively reduce mis-decoding errors.

[0198] Non-decoding occurs when decoding is performed using a valid codeword other than the transmitted codeword during the decoding process. Non-decoding is an error that cannot be detected by the decoder, and it occurs with a higher probability as the distance between codewords becomes shorter. In this case, the distance between codewords is defined by the Hamming distance. Hamming distance refers to the minimum number of transformations required to change one bit sequence into another between two bit sequences. The Hamming distance between codewords has the characteristic that once the code structure is determined, it cannot be modified, and it is not an error dependent on the decoder. Shortening and / or puncturing of a code alters the structure of the existing code. Since the structure of the parity check matrix changes after the shortening step, shortening also affects the distance between codewords. However, there is a problem in that shortening for existing LDPC codes is performed at the end of the message bit sequence and does not take into account the code performance gain. Accordingly, in some implementations of this specification, an optimized shortening pattern for LDPC codes is predetermined or defined, and shortening is performed based on said shortening pattern. For example, conventional shortening for LPDC codes is performed on the last information bits among the information bits, but according to some implementations of this specification, other information bits other than the last information bits may also be shortened according to a predetermined or predetermined shortening pattern.

[0199] In some implementations of this specification, shortening patterns may be predetermined / defined per (available) TBS. For example, shortening patterns may be predetermined / defined for each of the TBSs in Table 5. Since the code block size (CBS) is determined once the TBS is determined, it may be understood that in some implementations of this specification, shortening patterns are predetermined / defined per CBS. In this specification, the length of a shortening pattern may be equal to the length of the sismatic part of the PCM determined based on the TBS or CBS. For example, in the case of BG1 of 5G NR, since the length of the sismatic part is 22, the length of the shortening pattern is 22Z. c It can be, and in the case of BG2 of 5G NR, since the length of the synonymous part is 10, the length of the shortening pattern is 10Z c It could be.

[0200] In some implementations of this specification, for example, if the rate-matching output sequence length is E, the TBS + TB CRC length is K, and the number of resulting bits of channel encoding is N, then N - 2Z c When it is E, the leading 2Z c The beats are puncturing, (N - 2Z c - E) The information bits can be shortened according to the shortening pattern.

[0201] Some implementations of this specification that derive or determine optimized shortening positions for each LDPC code are described below.

[0202] LDPC codes are linear codes, and in linear codes, all codewords are generated by linear combinations. Therefore, the set of codewords forms a linear space and has vectors where all bits are 0 as codewords. Codewords where all bits are 0 are also referred to as all-zero codewords. Additionally, the minimum distance d between codewords for any given code min It is defined as follows. In the case of a linear code, the minimum distance value is equal to the Hamming weight of the codeword with the lowest Hamming weight, and this is d min It can be defined as a codeword. Hamming weights refer to the number of bits with a value of 1 in a codeword vector.

[0203] The shorter the minimum distance of the code, the more d min The greater the number of codewords, the more easily non-decoding occurs and becomes the dominant cause of error crests. Several implementations of this specification that derive optimized shortening pattern(s) to change the structure of the code are described below. Several implementations of this specification are d min Number of codewords A_d min Reduces and increases the minimum distance. Therefore, according to some implementations of this specification, the performance of the code can be improved.

[0204] FIG. 18 is illustrated to explain mis-decoding errors and exemplifies the Hamming distance relationship between codewords for a code. Referring to FIG. 18, some implementations of the present specification d from a transmitted codeword min d that is separated by that amount min The distribution of distance codeword(s) can be checked, and the shortening location(s) can be determined in a direction that removes them.

[0205] Some implementations of this specification vary the shortening pattern for the code to d for the transmitted codeword min The distribution of the distance codeword(s) is changed to improve the performance of the code. In this case, the codeword is a binary vector c satisfying the following equation: H·c=0, where H is the parity check matrix of the LDPC code and 0 is the zero vector. Among all possible codeword vectors c, the one with the minimum Hamming weight is d. min It is a codeword, and d min The number of codewords is A_d min It is expressed as. d min Codeword vector c = (c1, c2, ..., c n Given ), the set of indices representing the positions of 1s in the binary vector c is as follows:

[0206] {i|c i = 1, i ∈ {1,2,...,n}},

[0207] Here, c i represents the i-th element of c, and n signifies the length of the code. From the perspective of a parity check matrix, the fact that a binary vector c is a codeword of a linear code is equivalent to the fact that column vectors of the parity check matrix corresponding to the positions where the value of said binary vector c is 1 can be obtained, and that the binary sum of these corresponding column vectors is the zero vector. For example, if we denote a parity check matrix H consisting of three column vectors v1, v2, and v3 as [v1, v2, v3], the fact that the binary vector c = [0, 1, 1] is a codeword of a linear code implies that the binary sum of the column vectors v2 and v3 corresponding to the positions where the element value of said binary vector c is 1 is the column vector. This relationship implies that the product of a parity check matrix and a codeword is the syndrome zero, H·c T It can be easily derived from the relationship =0.

[0208] In code theory, the shortening technique is equivalent to deleting columns from a parity check matrix. The basic idea of ​​some implementations of this specification is d min By deleting columns from the parity check matrix that participate frequently in the codeword, d min It is to make the codeword no longer exist in the code. This means that d min It can be said that this is equivalent to forcing that the binary sum of the column vectors corresponding to the codeword positions does not become a zero vector. A_d min dogs d min Assuming that codewords exist, each d min Codeword C j = {c1,c2,...,c n }(here 1≤j≤A_d min For ), an index set can be defined.

[0209] In some implementations of this specification, d min Based on the codeword, the shortening pattern can be determined as follows:S j = {i|c j i = 1, i ∈ {1,2,...,n}}.

[0210] At this time, to determine the shortening pattern, a binary variable can be assigned to each index i as follows.

[0211]

[0212] To efficiently derive the shortening pattern, the following optimization problem can be constructed.

[0213] Objective function:

[0214] Constraint:

[0215] The constraint at this time is each S j This means that it must have at least one selected element. This is one method for determining the shortening pattern, and depending on the code characteristics, greedy algorithms, depth-first search, breadth-first search, etc. min Shortening patterns can be determined in various ways by reflecting the distribution of codewords.

[0216] If a shortening pattern is defined for an input bit sequence of length K, the length of the output bit sequence after encoding may vary depending on the code rate. Defining or determining separate shortening patterns for each codeword length or code rate is complex in terms of design and may not be appropriate as it would require a large amount of memory to store the shortening patterns. In some implementations of this specification, a shortening pattern defined or determined for an LDPC code for a high code rate may also be applied to an LDPC code for a low code rate. For example, if N2 > N1, a shortening pattern defined for code rate K / N1 may be defined identically for K / N2.

[0217] Figure 19 illustrates the structure of a Raptor-like LDPC code. The 5G NR LDPC code has a Raptor-like LDPC code structure. Referring to Figure 19, the parts corresponding to matrices A and B are the core parity check matrix, and the parity check matrix of Figure 19 has an extended form compared to the core parity check matrix through matrices C, D, and E. In Figure 19, matrix C is an all-zero matrix where all elements are 0, and E has the structure of an identity matrix. Linear code C with code rate x x = {c|H x ·c=0} is the parity check matrix H after lifting x It can be expressed by. In the following, A x d represents the number of codewords with Hamming weight d, and the set of such codewords is S x d It is indicated as such. In that case, for a Raptor-like LDPC structure, the code rate R≥R core In this case, structures C, D, and E and an extended parity check matrix are defined. Here, a set c ∈ S of codewords with codeword weight d. core d and extended parity check matrix H R Assuming this is given, these codeword sets S core d The weights of are updated in the expanded parity check matrix as follows: d + w H (s), here and, J is the set of indices of elements with a value of 1 in codeword c, and h j is H R It is the j-th column vector of. For example, if J is the set of indices of elements with a value of 1 in codeword c obtained based on the parity check matrix for code rate K / N1, then vectors h for j∈J in the said parity check matrix for code rate K / N1. j The binary sum of becomes the zero vector. If we add the column vectors corresponding to the indices included in the above set J among the column vectors of the parity check matrix for code rate K / N2 (where N2 > N1) (e.g., ), updated d for code rate K / N2 min Candidates (d + w H (s)) can be obtained. Therefore, the minimum weight codeword of the extended parity check matrix can be determined by updating the minimum weight codeword of the parity check matrix of the high code rate. Thus, even in the 5G NR LDPC code structure, the minimum weight codeword can be effectively removed even if the shortening pattern obtained at the highest code rate supported by 5G is applied to the code of the low code rate.

[0218] FIG. 20 is an example of the application of a shortening pattern to parity check matrices of different code rates according to some implementations of the present specification. In terms of the parity check matrix, the shortening pattern is the columns of the sistermatic part of the parity check matrix, e.g., the leading K s *Z c It can be understood as defining the position of the column to be replaced with a zero column vector among the columns. From the perspective of a coded bit sequence, for example, from the perspective of a codeword for a single code block, the shortening pattern is the syntactic bits of the codeword (e.g., the leading K). s *Z c It can be understood as defining the position of the bit to be replaced with 0 among the bits. For the same TBS or CBS and for the same BG, K s *Z c Since it is constant, the same shortening pattern can be used even if the code rate is different.

[0219] FIG. 21 illustrates the word error rate performance for a shortening pattern determined according to some implementations of the present specification. FIG. 21 shows the word error rate performance when a shortening pattern determined according to some implementations of the present specification is applied to an LDPC code with a message length of 400. In FIG. 21, (1200, 400) means that the length of the input bit sequence is 400 and the total length of the coded bit sequence is 1200. In FIG. 21, an additive white Gaussian noise channel (AWGN) is assumed, a belief propagation (BP) decoder and 50 iterations are assumed.

[0220] In Figure 21, a performance graph of the LDPC code defined in the 5G NR standard and a performance graph when the shortening pattern is changed according to some implementations of the present specification can be seen. Referring to Figure 21, it can be confirmed that some implementations of the present specification can improve performance while maintaining backward compatibility with the existing LDPC code, and it can be seen that a signal-to-noise ratio performance gain is obtained compared to the LDPC code defined in the actual standard.

[0221] FIG. 22 illustrates the word error rate performance for a shortening pattern determined according to some implementations of the present specification, by code rate. In particular, FIG. 22 shows the result of applying a shortening pattern optimized for an LDPC code defined for the highest code rate 2 / 3 supported in 5G, based on BG2, to a low code rate LDPC code. In FIG. 22, (N, K) = (600, 400), (800, 400), or (1200, 400) means that the length of the input bit sequence is K and the total length of the coded bit sequence is N, and the code rate R is defined as R = K / N. In FIG. 22, the respective code rates are 2 / 3, 1 / 2, and 1 / 3, and the information bit length K = 400. Figure 22 confirms that applying the shortening pattern at the highest code rate supported by 5G to low code rates effectively removes low-weight codewords. In the case of (N, K) = (600, 400), since K = 400, K b = 8, and K in all sets of lifting sizes in Table 4 b *Z c That which makes ≥ K', i.e., 8*Z c The minimum value of Z that makes Z ≥ 400 c Since = 52, for BG2, the length of the shortening pattern is 10Zc = 10*52 = 520, and the shortening pattern can be defined to shorten 520 - 400 = 120 bits out of the leading 520 bits of an output bit sequence of length 600. Even if the code rate changes for the same TBS and the same BG, the shortening pattern defined for (N, K) = (600, 400) can be used.

[0222] Referring to FIGS. 21 and 22, in the case of Raptor-Like LDPC code, the optimized shortening location(s) in high code rate code are also valid in low code rate code. According to some implementations of the present specification, improved fault peak performance can be achieved while maintaining backward compatibility.

[0223] Several implementations of this specification regarding CRC-assisted post-processing are described below. In 5G NR, a 24-bit CRC for BG1 and a 16-bit CRC for BG2 may be added to each code block. In communication systems, a CRC code check is usually performed before decoding. If a CRC check performed on a received signal fails to pass the CRC but the received signal is successfully decoded—for example, if a syndrome vector is 0 when a parity check matrix syndrome check is performed on the received signal—this means that there is an error in the transmitted codeword, but the receiver has decoded it as a different codeword than the one transmitted. This implies that mis-decoding has occurred. This can be illustrated as in Fig. 23.

[0224] FIG. 23 is illustrated to explain cyclic redundancy check (CRC)-assisted post-processing according to some implementations of the present specification.

[0225] Codeword with the minimum distance relationship to the transmitted codeword (e.g., d min All codewords) can be obtained, and these (e.g., yes, d) min Codewords) may be partially removed when the shortening pattern is redefined. However, if there are codewords that cannot be removed even when the shortening pattern is redefined, a CRC-assisted post-processing method according to some implementations of this specification may be used. In some implementations of this specification, the minimum distance codewords ((e.g., d min The CRC values ​​associated with each codeword are stored in advance in the receiver or decoder. For example, for each of the different PCMs, minimum distance codewords and their respective CRC values ​​may be stored in the receiver. Subsequently, if the reconstructed codeword fails the CRC but passes the syndrome check, it is verified whether the CRC value of the transmitted codeword matches any of the CRC values ​​of these minimum distance codewords. Here, the CRC value of the transmitted codeword may refer to the value corresponding to the CRC portion of the coded bit sequence received by the receiver / decoder. For example, when a receiver or decoder receives a sequence of coded bits c_1, c_2, ..., c_(KL), ..., c_(K-2), c_(K-1), c_K, ..., c_N, and the CRC length is L, the receiver or decoder may view the CRC value as c_(KL), ..., c_(K-2), c_(K-1), c_K, ..., c_N and compare it with pre-stored CRC values. Then, it can be determined which minimum distance codeword caused the non-decoding. Subsequently, by performing a binary sum (e.g., XOR addition, or modulo-2 operation) on the corresponding minimum distance codeword and the non-decoded codeword, the original transmitted codeword can be obtained.

[0226] FIG. 24 illustrates a channel encoding process according to some implementations of the present specification.

[0227] A communication device or encoder may perform operations according to some implementations of this specification in relation to channel encoding. The communication device may include at least one transceiver; at least one processor; and at least one computer memory operably connected to the at least one processor and storing instructions that, when executed, cause the at least one processor to perform operations according to some implementations of this specification. A processing device for the communication device or encoder may include at least one processor; and at least one computer memory operably connected to the at least one processor and storing instructions that, when executed, cause the at least one processor to perform operations according to some implementations of this specification. A computer-readable (non-transient) storage medium may store at least one computer program including instructions that, when executed by at least one processor, cause the at least one processor to perform operations according to some implementations of this specification. A computer program or computer program product is written on at least one computer-readable (non-transient) storage medium and may include instructions that, when executed, cause (at least one processor) to perform operations according to some implementations of this specification.

[0228] Referring to FIG. 24, in a method performed by the communication device, or in the communication device, the encoder, the processing device, the computer-readable (non-transient) storage medium, and / or the computer program product, the operations may include: determining a parity check matrix based on the transport block size (TBS) of the transport block (S2401); determining a codeword by performing channel encoding based on the parity check matrix for a code block generated from the transport block (S2403); determining a transmission bit sequence by performing shortening on the codeword (S2405); and transmitting the transmission bit sequence. Performing the shortening may include setting some bits within the codeword to zero according to a shortening pattern. The shortening pattern may be a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs.

[0229] FIG. 25 illustrates a channel decoding process according to some implementations of the present specification.

[0230] A communication device or decoder may perform operations according to some implementations of this specification in relation to channel decoding. The communication device may include at least one transceiver; at least one processor; and at least one computer memory operably connected to the at least one processor and storing instructions that, when executed, cause the at least one processor to perform operations according to some implementations of this specification. A processing device for the communication device or decoder may include at least one processor; and at least one computer memory operably connected to the at least one processor and storing instructions that, when executed, cause the at least one processor to perform operations according to some implementations of this specification. A computer-readable (non-transient) storage medium may store at least one computer program including instructions that, when executed by at least one processor, cause the at least one processor to perform operations according to some implementations of this specification. A computer program or computer program product is written on at least one computer-readable (non-transient) storage medium and may include instructions that, when executed, cause (at least one processor) to perform operations according to some implementations of this specification.

[0231] Referring to FIG. 25, in a method performed by the communication device, or in the communication device, the decoder, the processing device, the computer-readable (non-transient) storage medium, and / or the computer program product, the operations may include: receiving a bit sequence associated with a transport block (S2501); determining a parity check matrix based on the transport block size (TBS) of the transport block (S2503); and determining a codeword by performing channel decoding based on the bit sequence, the parity check matrix, and a shortening pattern (S2505). The shortening pattern may be used to set bits corresponding to some columns of the columns of the parity check matrix to zero. The shortening pattern may be a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs.

[0232] In some implementations related to FIG. 24 or FIG. 25, the shortening pattern may be applied based on the length of the codeword being greater than a predetermined length.

[0233] In some implementations related to FIG. 24 or FIG. 25, each of the plurality of shortening patterns may be defined for the highest code rate supported by the base graph associated with the parity check matrix for the corresponding TBS.

[0234] In some implementations related to FIG. 24 or FIG. 25, the parity check matrix is ​​Z each element in the basis graph c -by-Z c Zero matrix or Z c -by-Z c Z obtained by cyclically transitioning the identity matrix by positive integers c -by-Z c It can be determined by replacing it with a circular permutation matrix, where Z c is a positive integer.

[0235] In some implementations related to FIG. 24 or FIG. 25, the codeword is divided into an information bit sequence and a parity bit sequence, and the shortening pattern for the TBS of the transport block may represent (N - E) bit positions to be removed in the information bit sequence, where E is a predetermined length and N is the length of the codeword.

[0236] In some implementations related to FIG. 24 or FIG. 25, the set of (N - E) bit positions to be removed may be different from the set of the last (N - E) consecutive bit positions in the information bit sequence.

[0237] In some implementations related to FIG. 24, the process may further include determining a cyclic redundancy check (CRC) sequence based on the transport block; and generating the code block by adding the CRC sequence to the transport block.

[0238] In some implementations related to FIG. 24 or FIG. 25, the predetermined length may be determined based on the amount of wireless resources allocated for the transmission of the transport block, the modulation order, and the target code rate.

[0239] In some implementations related to FIG. 24 or FIG. 25, the communication device may be a base station, and the operations may further include transmitting control information including information regarding the wireless resources, and information regarding the modulation order and the target code rate.

[0240] In some implementations related to FIG. 24 or FIG. 25, the communication device may be a user device, and the operations may further include receiving control information including information regarding the wireless resources, and information regarding the modulation order and the target code rate.

[0241] In some implementations related to FIG. 25, a CRC is performed based on a cyclic redundancy check (CRC) sequence within the codeword; a syndrome check is performed based on a parity check matrix; based on a failure of the CRC and a success of the syndrome check, a predetermined CRC sequence that matches the CRC sequence is determined among a plurality of predetermined CRC sequences associated with the parity check matrix, wherein the plurality of predetermined CRC sequences are respectively associated with a plurality of minimum distance codewords; and a transmitted codeword is determined based on a binary sum between the minimum distance codeword associated with the predetermined CRC sequence and the codeword.

[0242] As described above, the examples of this specification disclosed are provided to enable a person skilled in the art related to this specification to implement and practice this specification. Although the foregoing has been described by reference to the examples of this specification, a person skilled in the art may modify and change the examples of this specification in various ways. Accordingly, this specification is not intended to be limited to the examples described herein, but to be given the broadest possible scope consistent with the principles and novel features disclosed herein.

[0243] Implementations of this specification may be used in wireless communication systems, base stations or user devices, or other equipment.< / null> < / null>

Claims

1. In a method performed by a device, Determine the parity check matrix based on the transport block size (TBS) of the transport block; Determine a codeword by performing channel encoding based on the parity check matrix for the code block generated from the above transport block; Determining a transmission bit sequence by performing shortening on the above codeword; and It includes transmitting the above transmission bit sequence, Performing the above shortening includes setting some bits within the codeword to 0 according to the shortening pattern, and The above shortening pattern is a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs, method.

2. In Paragraph 1, Each of the above plurality of shortening patterns is defined for the highest code rate supported by the base graph associated with the parity check matrix for the corresponding TBS, method.

3. In Paragraph 2, The above parity check matrix represents each element in the above basic graph as Z c -by-Z c Zero matrix or Z c -by-Z c Z obtained by cyclically transitioning the identity matrix by positive integers c -by-Z c It is determined by substituting with a circular permutation matrix, where Z c is a positive integer, method.

4. In Paragraph 1, The above codeword is divided into an information bit sequence and a parity bit sequence, and The shortening pattern for the TBS of the above transport block represents (N - E) bit positions to be removed in the information bit sequence, where E is a predetermined length and N is the length of the codeword, and The above (N - E) bit positions to be removed are different from the last (N - E) consecutive bit positions in the information bit sequence, method.

5. In Paragraph 1, Determine the cyclic redundancy check (CRC) sequence based on the above transport block; Further comprising generating the code block by adding the CRC sequence to the transport block. method.

6. In Paragraph 4, The above predetermined length is determined based on the amount of wireless resources allocated for the transmission of the above transport block, the modulation order, and the target code rate, method.

7. In Paragraph 6, The above device is a base station, and the above method is: Further comprising transmitting control information including information regarding the above wireless resources, and information regarding the modulation order and the target code rate, method.

8. In Paragraph 6, The above device is a user device, and the above method is: Further comprising receiving control information including information regarding the above wireless resources, and information regarding the modulation order and the target code rate, method.

9. At least one processor; and It includes at least one computer memory operablely connectable to the at least one processor and, when executed, stores instructions that cause the at least one processor to perform operations, wherein the operations are: Determine the parity check matrix based on the transport block size (TBS) of the transport block; Determine a codeword by performing channel encoding based on the parity check matrix for the code block generated from the above transport block; Determining a transmission bit sequence by performing shortening on the above codeword; and It includes transmitting the above transmission bit sequence, Performing the above shortening includes setting some bits within the codeword to 0 according to the shortening pattern, and The above shortening pattern is a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs, machinery and tools.

10. A computer-readable, non-transitory storage medium storing at least one program code comprising instructions that cause at least one processor to perform operations when executed, wherein the operations are: Determine the parity check matrix based on the transport block size (TBS) of the transport block; Determine a codeword by performing channel encoding based on the parity check matrix for the code block generated from the above transport block; Determining a transmission bit sequence by performing shortening on the above codeword; and It includes transmitting the above transmission bit sequence, Performing the above shortening includes setting some bits within the codeword to 0 according to the shortening pattern, and The above shortening pattern is a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs, Storage medium.

11. In a method performed by a device, Receive a bit sequence associated with a transport block; Determining a parity check matrix based on the transport block size (TBS) of the above transport block; and The method includes determining a codeword by performing channel decoding based on the bit sequence, the parity check matrix, and the shortening pattern. The above shortening pattern is used to set bits corresponding to some columns of the above parity check matrix to 0, and The above shortening pattern is a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs, method.

12. In Paragraph 11, Each of the above plurality of shortening patterns is defined for the highest code rate supported by the base graph associated with the parity check matrix for the corresponding TBS, method.

13. In Paragraph 12, The above parity check matrix represents each element in the above basic graph as Z c -by-Z c Zero matrix or Z c -by-Z c Z obtained by cyclically transitioning the identity matrix by positive integers c -by-Z c It is determined by substituting with a circular permutation matrix, where Z c is a positive integer, method.

14. In Paragraph 11, The above codeword is divided into an information bit sequence and a parity bit sequence, and The shortening pattern for the TBS of the above transport block represents (N - E) zero value bit positions in the information bit sequence, where E is a predetermined length and N is the length of the codeword, and The above (N - E) zero value bit positions are different from the last (N - E) consecutive bit positions in the above information bit sequence, method.

15. In Paragraph 11, Perform a CRC based on the cyclic redundancy check (CRC) sequence within the above codeword; Perform a syndrome check based on the above parity check matrix; Based on the failure of the above CRC and the success of the above syndrome test, a predetermined CRC sequence matching the above CRC sequence is determined among a plurality of predetermined CRC sequences associated with the above parity test matrix, wherein the plurality of predetermined CRC sequences are respectively associated with a plurality of minimum distance codewords; Determining a transmitted codeword based on a minimum distance codeword associated with the above-determined CRC sequence and a binary sum between the codewords, method.

16. In Paragraph 14, The above predetermined length is determined based on the amount of wireless resources allocated for the transmission of the above transport block, the modulation order, and the target code rate, method.

17. In Paragraph 16, The above device is a base station, and the above method is: Further comprising transmitting control information including information regarding the above wireless resources, and information regarding the modulation order and the target code rate, method.

18. In Paragraph 16, The above device is a user device, and the above method is: Further comprising receiving control information including information regarding the above wireless resources, and information regarding the modulation order and the target code rate, method.

19. At least one processor; and It includes at least one computer memory operablely connectable to the at least one processor and, when executed, stores instructions that cause the at least one processor to perform operations, wherein the operations are: Receive a bit sequence associated with a transport block; Determining a parity check matrix based on the transport block size (TBS) of the above transport block; and The method includes determining a codeword by performing channel decoding based on the bit sequence, the parity check matrix, and the shortening pattern. The above shortening pattern is used to set bits corresponding to some columns of the above parity check matrix to 0, and The above shortening pattern is a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs, machinery and tools.

20. A computer-readable, non-transitory storage medium storing at least one program code comprising instructions that cause at least one processor to perform operations when executed, wherein the operations are: Receive a bit sequence associated with a transport block; Determining a parity check matrix based on the transport block size (TBS) of the above transport block; and The method includes determining a codeword by performing channel decoding based on the bit sequence, the parity check matrix, and the shortening pattern. The above shortening pattern is used to set bits corresponding to some columns of the above parity check matrix to 0, and The above shortening pattern is a shortening pattern determined for the TBS of the transport block among a plurality of shortening patterns determined respectively for a plurality of TBSs, Storage medium.