Method, communication device, processing device and storage medium for transmitting transport block

Abstract

This device acquires parity bits by performing first encoding on DCBs related to a transport block and determines PCBs from the parity bits, and the communication device can determine a predetermined number of PCBs from a start PCB according to a first redundancy version from among the PCBs. The communication device can determine transmission bits from each of a plurality of codewords acquired by applying second encoding to each of the DCBs and the PCBs, and transmit the transmission bits.

Description

Method for transmitting a transport block, communication device, processing device, and storage medium

[0001] This specification relates to wireless communication systems.

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

[0003] As more and more communication devices demand greater capacity, the need for enhanced mobile broadband (eMBB) communications is emerging, surpassing legacy radio access technology (RAT). Furthermore, massive machine type communication (mMTC), which connects multiple devices and objects to provide diverse services anytime, anywhere, is a key issue to be considered in next-generation communications.

[0004] Additionally, discussions are underway on communication systems designed to accommodate reliability- and latency-sensitive services and user equipment (UE). The introduction of next-generation wireless access technologies is being discussed, including enhanced mobile broadband (eMBB), mMTC, and ultra-reliable and low latency communication (URLLC).

[0005] Advances in communication technology are driving the need for increasingly larger transport blocks to be transmitted simultaneously. When errors occur during the transmission of large transport blocks, efficient methods and devices for recovering from transmission errors are required.

[0006] The technical tasks to be achieved by this specification are not limited to the technical tasks mentioned above, and other technical tasks not mentioned will be clearly understood by those of ordinary skill in the art related to this specification from the detailed description below.

[0007] As one aspect of the present specification, a method for transmitting a transport block is provided.

[0008] In another aspect of the present disclosure, a device is provided comprising: 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.

[0009] In another aspect of the present disclosure, a processing device is provided, comprising: 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.

[0010] In another aspect of the present specification, a computer-readable non-transitory storage medium is provided storing at least one program code comprising instructions that, when executed, cause at least one processor to perform operations.

[0011] The above method, the above operations of the device, the above operations of the processing device or the above operations of the storage medium are: C based on a transport block d Obtaining data code blocks (DCBs); the C d Perform a first encoding on the DCBs to obtain the outer parity bits; based on the outer parity bits, C p Determine the parity code blocks (PCBs); the first redundancy version RV o Based on the above C p Determine P PCBs among the dog PCBs; C above d (C) obtained by applying the second encoding to each of the P DCBs and the above P PCBs d The method may include determining transmission bits from each of the P codewords; and performing a wireless transmission including the transmission bits. Determining the P PCBs may include: determining the C p It may include cyclically selecting P PCBs starting from PCB p among the P PCBs, where 0 ≤ p < C. p and the PCB p is the first redundancy version RV o is determined based on. Determining the transmission bits: starting from bit i0 within the codeword r_i, a predetermined length E for the r_i-th inner codeword r_i may include a cyclic selection of bits, wherein said codeword r_i is C dIt is obtained by applying the second encoding to the r_i-th DCB among the dog DCBs, where 0 ≤ r_i < C d , and the above bit i0 is the second redundancy version RV i It is decided based on .

[0012] In each aspect of this specification, determining the transmission bits is: from bit 0 within the codeword r_p to a predetermined length E for the codeword r_p. r_p It may further include cyclically selecting as many bits as possible, wherein the codeword r_p is obtained by applying the second encoding to the r_p-th PCB among the P PCBs, where 0 ≤ r_p < P.

[0013] In each aspect of this specification, determining the transmission bits is: a predetermined length E for the codeword r_p starting from bit j0 within the codeword r_p. r_p It may further include cyclically selecting as many bits as the codeword r_p is obtained by applying the second encoding to the r_p-th PCB among the P PCBs, where 0 ≤ r_p < P, and the bit j0 is the second redundancy version RV i It is decided based on .

[0014] In each aspect of the present specification, based on the wireless transmission being an uplink transmission, the method, the operations of the device, the operations of the processing device, or the operations of the storage medium may further include: receiving control information for scheduling the uplink transmission.

[0015] In each aspect of the present specification, based on the wireless transmission being a downlink transmission, the method, the operations of the device, the operations of the processing device, or the operations of the storage medium may further include: transmitting control information for scheduling the downlink transmission.

[0016] In each aspect of this specification, the control information is the second redundancy version RV i may contain information about.

[0017] In each aspect of this specification, the control information is the first redundancy version RV o may include more information about.

[0018] In each aspect of this specification, the first redundancy version RV o Silver is the second redundancy version RV i It can be determined to be the same as .

[0019] The above problem solving methods are only 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 having 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 transmitted and received efficiently. Consequently, the overall throughput of a wireless communication system can be increased.

[0021] Some implementations of this specification can reduce the probability of errors occurring during the transmission of transport blocks.

[0022] According to some implementations of this specification, even if an error occurs in a transport block or a portion of said transport block, the receiver can efficiently recover the portion in which the error occurred.

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

[0024] To aid in understanding implementations of this specification, the accompanying drawings, which are included as part of the detailed description, provide examples of implementations of this specification and, together with the detailed description, illustrate implementations of this specification:

[0025] Figure 1 illustrates an example of a communication system 1 to which implementations of the present specification are applied;

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

[0027] FIG. 3 illustrates another example of a wireless device capable of performing implementation(s) of this specification;

[0028] Figure 4 is the 3rd generation partnership project (3 rd It illustrates an example of a frame structure available in a wireless communication system based on the 3rd Generation Partnership Project (3GPP);

[0029] Figure 5 illustrates a processing process on the transmission side for a transport block (TB);

[0030] Figures 6 and 7 are drawings illustrating a parity check matrix H of a low density parity check (LDPC) code using a bipartite graph;

[0031] Figure 8 is an example of a block diagram for a polar encoder;

[0032] Figures 9 and 10 illustrate transmissions of parity for forward error correction (FEC);

[0033] FIG. 11 illustrates outer code block (OCB)(s) ​​and outer code parity generated according to some implementations of this specification;

[0034] FIG. 12 illustrates some implementations of the present specification that reduce the probability of occurrence of burst errors for code blocks;

[0035] Figures 13 and 14 illustrate implementation examples of an OCB configuration and PCB generation method;

[0036] Figure 15 is a diagram illustrating the concept of the rate matching process;

[0037] Figure 16 illustrates transmission bits / symbols by redundancy version;

[0038] Figure 17 illustrates redundancy version-specific transmission bits / symbols according to some implementations of this specification;

[0039] FIG. 18 is an illustration to help understand an external codeword buffer according to some implementations of the present specification described with reference to FIG. 17;

[0040] FIG. 19 is an illustration to help understand an internal codeword circular buffer according to some implementations of the present specification described with reference to FIG. 16;

[0041] Figures 20 through 24 are examples of data / parity transmitted for each redundancy version (or each combination of redundancy versions) according to some implementations of this specification;

[0042] FIG. 25 is an example of a data transmission / reception flow according to some implementations of this specification;

[0043] FIG. 26 is another example of a data transmission / reception flow according to some implementations of this specification;

[0044] Figure 27 illustrates a channel encoding process according to some implementations of this specification.

[0045] Hereinafter, implementations according to this specification will be described in detail with reference to the attached drawings. The detailed description provided below, together with the attached drawings, is intended to describe exemplary implementations of this specification and is not intended to represent the only possible implementations of this specification. The detailed description below includes specific details to provide a thorough understanding of this specification. However, one of ordinary skill in the art will appreciate that this specification may be practiced without these specific details.

[0046] In some cases, to avoid ambiguity in the concepts of this specification, known structures and devices may be omitted or illustrated in block diagram form focusing on the core functions of each structure and device. Furthermore, identical components are described using the same drawing reference numerals throughout this specification.

[0047] The techniques, devices, and systems described below can be applied to various wireless multiple access systems. Examples of multiple access systems include code division multiple access (CDMA) systems, frequency division multiple access (FDMA) systems, time division multiple access (TDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, single carrier frequency division multiple access (SC-FDMA) systems, and multi-carrier frequency division multiple access (MC-FDMA) systems. CDMA can be implemented in wireless technologies such as Universal Terrestrial Radio Access (UTRA) or CDMA2000. TDMA can be implemented in wireless technologies such as Global System for Mobile communication (GSM), General Packet Radio Service (GPRS), and Enhanced Data Rates for GSM Evolution (EDGE) (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 a part of E-UMTS that uses 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.

[0048] For 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 to this. For example, although the detailed description below is based on a mobile communication system corresponding to a 3GPP LTE / NR system, it can also be applied to any other mobile communication system, except for features specific to 3GPP LTE / NR.

[0049] For terms and technologies used in this specification that are not specifically explained, reference may be made to 3GPP-based standard documents, such as 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.

[0050] In the examples of this specification described below, the expression "assumes" that a device "assumes" that the entity transmitting the channel transmits the channel in a manner consistent with the "assume." The entity receiving the channel may mean that, under the assumption that the channel was transmitted in a manner consistent with the "assume," the entity receiving the channel receives or decodes the channel in a manner consistent with the "assume."

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

[0052] In this specification, a node refers to a fixed point that can transmit / receive radio signals by communicating with a UE. Various types of BSs can be used as nodes regardless of their names. For example, BSs, NBs, eNBs, pico-cell eNBs (PeNBs), home eNBs (HeNBs), relays, and repeaters can be nodes. Furthermore, a node may not be a BS. For example, it can be a radio remote head (RRH) or a radio remote unit (RRU). RRHs, RRUs, etc. generally have a lower power level than the BS. Since an RRH or RRU (hereinafter referred to as 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 than cooperative communication between BSs that are generally connected via a wireless line. Each node is equipped with at least one antenna. The antenna may be a physical antenna, an antenna port, a virtual antenna, or an antenna group. A node is also called a point.

[0053] In this specification, a cell refers to a certain geographical area where one or more nodes provide communication services. Therefore, in this specification, communicating with a specific cell may mean communicating with a BS or node that provides communication services to the specific cell. In addition, the downlink / uplink signal of a specific cell refers to a downlink / uplink signal from / to a BS or node that provides communication services to the specific cell. A cell that provides uplink / downlink communication services to a UE is specifically referred to as a serving cell. In addition, the channel state / quality of a specific cell refers to the channel state / quality of a channel or communication link formed between a BS or node that provides communication services to the specific cell and the UE. In a 3GPP-based communication system, a UE can measure a downlink channel state from a specific node using CRS (Cell-specific Reference Signal) resources transmitted by antenna port(s) of the specific node on CRS resources allocated to the specific node and / or CSI-RS (Channel State Information Reference Signal) resources transmitted.

[0054] Meanwhile, 3GPP-based communication systems use the concept of cells to manage radio resources, and cells associated with radio resources are distinguished from cells in geographical areas.

[0055] A "cell" in a geographical area can be understood as the coverage over which a node can provide a service using a carrier, and a "cell" in a radio resource is associated with a bandwidth (BW), which is a frequency range configured by the carrier. 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 node can receive a valid signal from a UE, depend on the carrier carrying the signal, the coverage of a node is also associated with the coverage of the "cell" of the radio resource used by the node. Therefore, the term "cell" can sometimes be used to mean the coverage of a service by a node, sometimes a radio resource, and sometimes the range over which a signal using the radio resource can reach with a valid intensity.

[0056] Meanwhile, the 3GPP communication standard uses 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), i.e., a combination of a DL component carrier (CC) and an UL CC. A cell can be configured with DL resources alone or a combination of DL resources and UL resources. If carrier aggregation is supported, the linkage between the carrier frequency of the DL resources (or DL ​​CC) and the carrier frequency of the UL resources (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 can be the same as 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 connection establishment / re-establishment / handover, and one serving cell provides security input during RRC connection re-establishment / handover. Such a cell is called a primary cell (Pcell). A Pcell is a cell operating on the primary frequency where the UE performs initial connection establishment procedures or initiates connection re-establishment procedures.Depending on the UE capability, secondary cells (Scells) can be configured to form a set of serving cells together with Pcells. An Scell ​​can be configured after RRC (Radio Resource Control) connection establishment, and is a cell that provides additional radio resources in addition to the resources of a special cell (SpCell). The carrier corresponding to a Pcell in downlink is called a downlink primary CC (DL PCC), and the carrier corresponding to a Pcell in uplink is called an UL primary CC (DL PCC). The carrier corresponding to an Scell ​​in downlink is called a DL secondary CC (DL SCC), and the carrier corresponding to the Scell ​​in uplink is called an UL secondary CC (UL SCC).

[0057] For dual connectivity (DC) operation, the term SpCell refers to a Pcell of a master cell group (MCG) or a Pcell of a secondary cell group (SCG). A SpCell supports PUCCH transmission and contention-based random access and is always activated. An 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 for DC, an 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 an SCG. For a UE in RRC_CONNECTED state that is not configured for CA or DC, there is only one serving cell consisting solely of Pcells. For a UE in RRC_CONNECTED state configured as CA or DC, the term serving cells refers to the set of cells consisting of SpCell(s) and all Scell(s). In DC, two medium access control (MAC) entities are configured in the UE: one for the MCG and one for the SCG.

[0058] For 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 a Scell ​​PUCCH group consisting of only Scell(s) may be set. In the case of an Scell, an Scell ​​(hereinafter referred to as a PUCCH cell) on which a PUCCH associated with the cell is transmitted may be set. An Scell ​​indicated as a PUCCH Scell ​​belongs to an Scell ​​PUCCH group, and PUCCH transmission of the relevant UCI is performed on the PUCCH Scell, and an Scell ​​where a PUCCH Scell ​​is not indicated or is a Pcell indicated as a cell for PUCCH transmission, belongs to a Pcell PUCCH group, and PUCCH transmission of the relevant UCI is performed on the Pcell.

[0059] In a wireless communication system, a UE receives information from a base station (BS) via the downlink (DL), and the UE transmits information to the base station via the uplink (UL). The information transmitted and / or received by the BS and 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.

[0060] 3GPP-based communication standards define downlink physical channels corresponding to resource elements that carry information originating from higher layers, and downlink physical signals corresponding to resource elements that are used by the physical layer but do not carry information originating from higher 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, and reference signals and synchronization signals are defined as downlink physical signals. A reference signal (RS), also referred to as a pilot, refers to a signal with a predefined, special waveform that is known to the BS and UE. For example, the demodulation reference signal (DMRS) and the 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 higher layers, and uplink physical signals corresponding to resource elements that are used by the physical layer but do not carry information originating from higher layers.For example, a physical uplink shared channel (PUSCH), a physical uplink control channel (PUCCH), and a physical random access channel (PRACH) are defined as uplink physical channels, and a demodulation reference signal (DMRS) for uplink control / data signals and a sounding reference signal (SRS) used for uplink channel measurement are defined.

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

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

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

[0064] As more and more communication devices demand greater communication capacity, the need for improved mobile broadband communication compared to existing radio access technology (RAT) is emerging. Furthermore, massive MTC, which connects numerous devices and objects to provide diverse services anytime, anywhere, is also a key issue to be considered in next-generation communications. Furthermore, communication system design that considers reliability and latency-sensitive services / UEs is being discussed. The introduction of next-generation RATs that take advanced mobile broadband communication, massive MTC, and URLLC (Ultra-Reliable and Low Latency Communication) into account is currently under discussion. 3GPP is currently conducting studies on next-generation mobile communication systems beyond EPC. For convenience, this technology is referred to as new RAT (NR) or 5G RAT, and a system that uses or supports NR is referred to as an NR system.

[0065] FIG. 1 illustrates an example of a communication system 1 to which implementations of the present specification are applied. Referring to FIG. 1, the communication system (1) applied to the present specification includes a wireless device, a BS, and a network. Here, the wireless device refers to a device that performs communication using a 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, the 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 Things) device (100f), and an AI device / server (400). For example, the vehicle may include a vehicle equipped with a wireless communication function, an autonomous vehicle, a vehicle capable of performing vehicle-to-vehicle communication, etc. Here, the vehicle may include an Unmanned Aerial Vehicle (UAV) (e.g., a drone). XR devices include AR (Augmented Reality) / VR (Virtual Reality) / MR (Mixed Reality) devices, and may be implemented in the form of a Head-Mounted Device (HMD), a Head-Up Display (HUD) installed in a vehicle, a television, a smartphone, a computer, a wearable device, a home appliance, digital signage, a vehicle, a robot, etc. Mobile devices may include a smartphone, a smart pad, a wearable device (e.g., a smart watch, smart glasses), a computer (e.g., a laptop, etc.), etc. Home appliances may include a TV, a refrigerator, a washing machine, etc. IoT devices may include sensors, smart meters, etc. For example, a BS or network may also be implemented as a wireless device, and a specific wireless device may act as a BS / network node to other wireless devices.

[0066] Wireless devices (100a to 100f) can be connected to a network (300) via a BS (200). Artificial Intelligence (AI) technology can 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 a network (300). The network (300) can be configured using a 3G network, a 4G (e.g., LTE) network, a 5G (e.g., NR) network, etc. The wireless devices (100a to 100f) can communicate with each other via the BS (200) / network (300), but can also communicate directly (e.g., sidelink communication) without going through the BS / network. For example, vehicles (100b-1, 100b-2) can communicate directly (e.g., V2V (Vehicle to Vehicle) / V2X (Vehicle to Everything) communication). In addition, IoT devices (e.g., sensors) can communicate directly with other IoT devices (e.g., sensors) or other wireless devices (100a to 100f).

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

[0068] FIG. 2 is a block diagram illustrating examples of communication devices capable of performing a 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 via various wireless access technologies (e.g., LTE, NR). Here, {the first wireless device (100), the second wireless device (200)} can correspond to {the wireless device (100x), the BS (200)} and / or {the wireless device (100x), the wireless device (100x)} of FIG. 1.

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

[0070] The second wireless device (200) includes one or more processors (202), one or more memories (204), and may further include one or more transceivers (206) and / or one or more antennas (208). The processor (202) controls the memories (204) and / or the 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 in the memory (204) to generate third information / signals, and then transmit a wireless signal including the third information / signals via the transceivers (206). In addition, the processor (202) may receive a wireless signal including fourth information / signals via the transceivers (206), and then store information obtained from signal processing of the fourth information / signals in the memory (204). The memory (204) may be connected to the processor (202) and may store various information related to the operation of the processor (202). For example, the memory (204) may perform some or all of the processes controlled by the processor (202), or may store software code including commands for performing the procedures and / or methods described / proposed below. Here, the processor (202) and the memory (204) may be part of a communication modem / circuit / chip designed to implement wireless communication technology (e.g., LTE, NR). The transceiver (206) may be connected to the processor (202) and may transmit and / or receive wireless signals via one or more antennas (208). The transceiver (206) may include a transmitter and / or a receiver. The transceiver (206) may be used interchangeably with an RF unit. In this specification, a wireless device may also mean a communication modem / circuit / chip.

[0071] The wireless communication technology implemented in the wireless device (100, 200) of the present specification may include not only LTE, NR, and 6G, but also Narrowband Internet of Things for low-power communication. At this time, for example, NB-IoT technology may be an example of LPWAN (Low Power Wide Area Network) technology, and may be implemented with standards such as LTE Cat NB1 and / or LTE Cat NB2, and is not limited to the above-described names. Additionally or alternatively, the wireless communication technology implemented in the wireless device (XXX, YYY) of the present specification may perform communication based on LTE-M technology. At this time, for example, LTE-M technology may be an example of LPWAN technology, and may be called by various names such as eMTC (enhanced Machine Type Communication). For example, LTE-M technology can be implemented by 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 above-described names. Additionally or alternatively, the wireless communication technology implemented in the wireless device (XXX, YYY) of the present specification can include at least one of ZigBee, Bluetooth, and Low Power Wide Area Network (LPWAN) considering low-power communication, and is not limited to the above-described names. For example, ZigBee technology can create PAN (personal area networks) related to small / low-power digital communication based on various standards such as IEEE 802.15.4, and can be called by various names.

[0072] 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 (PDUs) and / or one or more service data units (SDUs) 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 signals (e.g., baseband signals) including PDUs, SDUs, messages, control information, data or information according to the functions, procedures, proposals and / or methods disclosed in this specification, and provide the signals to one or more transceivers (106, 206). One or more processors (102, 202) may receive signals (e.g., baseband signals) from one or more transceivers (106, 206) and obtain PDUs, SDUs, messages, control information, data or information according to the functions, procedures, proposals and / or methods disclosed in this specification.

[0073] One or more processors (102, 202) may be referred to as a controller, a microcontroller, a microprocessor, or a 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, suggestions 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 executed by one or more processors (102, 202). The functions, procedures, suggestions and / or methods disclosed in this specification may be implemented using firmware or software in the form of codes, instructions and / or sets of instructions.

[0074] One or more memories (104, 204) may be coupled to one or more processors (102, 202) and may store various forms of data, signals, messages, information, programs, codes, instructions, and / or commands. The one or more memories (104, 204) may be configured as ROM, RAM, EPROM, flash memory, hard drives, registers, cache memory, computer-readable storage media, and / or combinations thereof. The one or more memories (104, 204) may be located internally and / or externally to the one or more processors (102, 202). Additionally, the one or more memories (104, 204) may be coupled to the one or more processors (102, 202) via various technologies, such as wired or wireless connections.

[0075] One or more transceivers (106, 206) may transmit user data, control information, wireless signals / channels, etc., as described in the methods and / or flowcharts 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 described in the functions, procedures, proposals, methods and / or flowcharts of this specification, from one or more other devices. For example, one or more transceivers (106, 206) may be coupled 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 coupled 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, or the like, as referred to in the functions, procedures, proposals, methods, and / or operational flowcharts disclosed in this specification, via 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) may convert received user data, control information, wireless signals / channels, etc. from RF band signals to baseband signals for processing using one or more processors (102, 202).One or more transceivers (106, 206) may convert user data, control information, wireless signals / channels, etc. processed by one or more processors (102, 202) from baseband signals to RF band signals. For this purpose, one or more transceivers (106, 206) may include an (analog) oscillator and / or filter.

[0076] FIG. 3 illustrates another example of a wireless device capable of performing implementation(s) of the present specification. Referring to FIG. 3, the wireless device (100, 200) corresponds to the wireless device (100, 200) of FIG. 2 and may be composed of various elements, components, units, and / or modules. For example, the wireless device (100, 200) may include a communication unit (110), a control unit (120), a memory unit (130), and an additional component (140). The communication unit may include a communication circuit (112) and a transceiver(s) (114). For example, the communication circuit (112) may include one or more processors (102, 202) and / or one or more memories (104, 204) of FIG. 2. For example, the transceiver(s) (114) may include one or more transceivers (106, 206) and / or one or more antennas (108, 208) of FIG. 2. The control unit (120) is electrically connected to the communication unit (110), the memory unit (130), and the additional components (140) and controls the overall operation of the wireless device. For example, the control unit (120) may control the electrical / mechanical operation of the wireless device based on the program / code / command / information stored in the memory unit (130). In addition, the control unit (120) may transmit information stored in the memory unit (130) to an external device (e.g., another communication device) via a wireless / wired interface through the communication unit (110), or store information received from an external device (e.g., another communication device) via a wireless / wired interface in the memory unit (130).

[0077] The additional configuration (140) may be configured in various ways depending on the type of the wireless device. For example, the additional configuration (140) may include at least one of a power unit / battery, an input / output (I / O) unit, a driving unit, and a computing unit. Although not limited thereto, the wireless device may be implemented in the form of a robot (Fig. 1, 100a), a vehicle (Fig. 1, 100b-1, 100b-2), an XR device (Fig. 1, 100c), a portable device (Fig. 1, 100d), a home appliance (Fig. 1, 100e), an IoT device (Fig. 1, 100f), a UE for digital broadcasting, a hologram device, a public safety device, an MTC device, a medical device, a fintech device (or a financial device), a security device, a climate / environmental device, an AI server / device (Fig. 1, 400), a BS (Fig. 1, 200), a network node, etc. Wireless devices may be mobile or stationary depending on the use / service.

[0078] In FIG. 3, various elements, components, units / parts, and / or modules within the wireless device (100, 200) may be interconnected entirely via a wired interface, or at least some may be wirelessly connected via a communication unit (110). For example, within the wireless device (100, 200), the control unit (120) and the communication unit (110) may be wired, and the control unit (120) and a first unit (e.g., 130, 140) may be wirelessly connected via the communication unit (110). In addition, each element, component, unit / part, and / or module within the wireless device (100, 200) may further include one or more elements. For example, the control unit (120) may be configured with one or more processor sets. For example, the control unit (120) may be configured as a set of a communication control processor, an application processor, an electronic control unit (ECU), a graphics processing processor, a memory control processor, etc. As another example, the memory unit (130) may be configured as a random access memory (RAM), a dynamic RAM (DRAM), a read only memory (ROM), a flash memory, a transitory memory, a non-transitory memory, and / or a combination thereof.

[0079] In this specification, at least one memory (e.g., 104 or 204) can store instructions or programs that, when executed, cause at least one processor operably connected to the at least one memory to perform operations according to some embodiments or implementations of the present specification.

[0080] In this specification, a computer-readable (non-transitory) storage medium can store at least one instruction or computer program, which when executed by at least one processor causes the at least one processor to perform operations according to some embodiments or implementations of this specification.

[0081] In this specification, a processing device or apparatus may include at least one processor and at least one computer memory operatively connected to the at least one processor. The at least one computer memory may store instructions or programs, which, when executed, cause at least one processor operatively connected to the at least one memory to perform operations according to some embodiments or implementations of the present specification.

[0082] In this specification, a computer program may be stored in at least one computer-readable (non-transitory) storage medium and may include program code that, when executed, performs operations according to some implementations of the present specification or causes at least one processor to perform operations according to some implementations of the present 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-transitory) storage medium.

[0083] A communications device of the present 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 example(s) of the present specification described below.

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

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

[0086] Referring to Figure 4, in the NR system, uplink and downlink transmissions are organized into frames. Each frame is T f = (△f max *N f / 100)*T c = 10 ms duration, divided into two half-frames of 5 ms each. Here, T is the basic time unit for NR. c = 1 / (△fmax *N f ) and △f max = 480*10 3 Hz, and N f =4096. For reference, T is the basic time unit for LTE. s = 1 / (△f ref *N f,ref ) and △f ref = 15*10 3 Hz, and N f,ref =2048. T c Wow T s is a constant κ = T s / T c = 64 relationship. Each half-frame consists of 5 subframes, and the duration of a single subframe (SF) is T sf is 1ms. Subframes are further divided into slots, and the number of slots in a subframe depends on the subcarrier spacing. Each slot consists of 14 or 12 OFDM symbols based on the cyclic prefix. For a normal cyclic prefix (CP), each slot consists of 14 OFDM symbols, and for an extended CP, each slot consists of 12 OFDM symbols. The numerology is exponentially scalable with a subcarrier spacing △f = 2. u *Depends on 15 kHz. The following table shows the subcarrier spacing for regular CP △f = 2. u *Number of OFDM symbols per slot at 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 ) is shown.

[0087]

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

[0089]

[0090] For a subcarrier spacing setting u, slots are n in increasing order within a subframe. u s ∈ {0, ..., nsubframe,u slot - 1} and n in increasing order within the frame u s,f ∈ {0, ..., n frame,u slot - Numbered as 1}.

[0091] A slot contains multiple symbols (e.g., 14 or 12) in the time domain. For each numeral (e.g., subcarrier spacing) and carrier, a common resource block (CRB) N is indicated by higher-layer signaling (e.g., radio resource control (RRC) signaling). start,u grid Starting from,N size,u grid,x *N RB sc Dog subcarriers and N subframe,u symb A resource grid of OFDM symbols is defined, where N size,u grid,x is the number of resource blocks (RBs) in the resource grid, and the subscript x is DL for downlink and UL for uplink. N RB sc is the number of subcarriers per RB, and in 3GPP-based wireless communication systems, N RB scis typically 12. For a given antenna port p, subcarrier spacing configuration u, and transmission direction (DL or UL), there is one resource grid. The carrier bandwidth N for subcarrier spacing configuration u size,u grid is given to the UE by higher layer parameters (e.g., RRC parameters) from the network. Each element in the resource grid for antenna port p and subcarrier spacing configuration u is called a resource element (RE), and one complex symbol can be mapped to each RE. Each RE in 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, an RB is 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 the subcarrier spacing configuration u. The center of subcarrier 0 of CRB 0 for the subcarrier spacing configuration u coincides with 'Point A', which is a common reference point for the resource block grids. PRBs for subcarrier spacing u are defined within the bandwidth part (BWP) and range from 0 to N. size,u BWP,i -1, where i is the number of the bandwidth part. Common resource block n u CRB and bandwidth part i within physical resource block n PRB The relationship between the two is as follows: n u PRB = n u CRB +N start,u BWP,i , here N start,u BWP,iis a common resource block (BRB) whose bandwidth part starts relative to CRB 0. A BWP comprises multiple consecutive RBs in the frequency domain. For example, a BWP may be a given numeral u within a BWP i on a given carrier. i A subset of contiguous CRBs defined for a carrier. A carrier may include 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 activated BWPs, and only a predetermined number (e.g., 1) of BWPs configured for the UE may be activated on the carrier.

[0092] 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 cell groups of the UE and does not belong to multiple cell groups.

[0093] Figure 5 illustrates a processing process on the transmission side for a transport block (TB).

[0094] To enable the receiver to correct errors encountered in wireless signals over the wireless channel, the transmitter encodes the information it sends using a forward error correction code before transmitting it. The receiver demodulates the received signal and then decodes the error correction code to restore the transmitted information. This decoding process corrects errors in the received signal caused by the wireless channel.

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

[0096] - Add a cyclic redundancy check (CRC) to the transport block;

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

[0098] - Channel coding;

[0099] - Rate matching;

[0100] - Code block concatenation.

[0101] In actual communication systems, for ease of implementation, transport blocks larger than a certain size are divided into several smaller data blocks for encoding. These smaller data blocks are called code blocks. While code blocks typically have the same size, due to the size limitations of the channel encoder's internal interleaver, one code block among multiple code blocks may have a different size. After error-correcting encoding is performed on code blocks of a given interleaver size, interleaving is performed to reduce the impact of burst errors that occur during transmission over a wireless channel. These blocks are then mapped to actual radio resources and transmitted. Since the amount of radio resources used in actual transmission is constant, rate matching must be performed on the encoded code blocks to accommodate this. Typically, rate matching is achieved through puncturing or repetition. For example, if the amount of wireless resources, i.e., the number of transmission bits that can be transmitted by the wireless resources, 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과 같아지도록, 코딩된 비트 시퀀스의 비트들 중 일부가 펑처링되며, 펑처링된 비트는 전송에서 제외된다.

[0102] That is, in a wireless communication system, the transmitting end encodes data to be transmitted using channel coding having 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.

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

[0104] There are various types of error-correcting codes. For example, turbo codes consist of a recursive systematic convolution encoder and an interleaver. In practical implementations of turbo codes, an interleaver facilitates parallel decoding, and one such interleaver is the quadratic polynomial permutation (QPP). This QPP interleaver is known to maintain good performance only for a certain data block size. Turbo code performance is known to improve as the data block size increases. However, in actual communication systems, for ease of implementation, data blocks larger than a certain size are divided into several smaller data blocks for encoding. These smaller data blocks are called code blocks. While code blocks typically have the same size, due to the size limitations of the QPP interleaver, one code block among multiple code blocks may have a different size.

[0105] Among error-correcting codes, the low-density parity check (LDPC) code is a linear block code with low density because most of the elements of the parity check matrix H are 0. It was proposed by Gallager in 1962. The LDPC code was so complex that it was impossible to implement with the technology available at the time of its proposal, so it was forgotten until it was rediscovered in 1995 and its excellent performance was proven, and since then, active research on it has been conducted (References: [1] Robert G. Gallager, "Low-Density Parity-Check Codes", The MIT Press, September 15, 1963. [2] D. J. C. McCay, 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). Typically, in standards that apply LDPC (e.g., the DVB standard), encoding is performed using a parity-check matrix instead of a generator matrix.Since the parity check matrix of the LDPC code has a very small number of 1s, it can be decoded through iterative decoding even in a very large block size. As the block size becomes very large, it shows performance approaching Shannon's channel capacity limit like a turbo code. In the above parity check matrix, the number of 1s included in a row or column is called a 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 equation.

[0106]

[0107]

[0108] Here, c is a codeword, and x is an information bit. The decoder of the receiving device must obtain the information bit (x) from the codeword (c), which is the encoding result by the transmitting device, and finds x by using the property that Hc = 0. That is, when the received codeword is c', the value of Hc' is calculated, and if the result is 0, the k bits in front of c' are determined to be decoded information bits. If the value of Hc' is not 0, a sum-product algorithm through a graph, a belief propagation algorithm, etc. are used to find c' that satisfies the value of Hc' as 0, and x is restored. The check expression Hc' = 0 is c'H according to the relationship between the corresponding information bit and the corresponding generator matrix G. T =0, and thus the check formula can change depending on the relationship between the information bits and the generator matrix G.

[0109] Figures 6 and 7 illustrate the parity check matrix H of an LDPC code using a bipartite graph.

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

[0111] Figure 7 illustrates another parity check matrix and the entire bipartite lines.

[0112] Referring to Fig. 7, since the product of the parity check matrix H and the codeword c' must be '0', the sum of the hard decision values ​​of the variable nodes connected to any check node must be '0'. Mathematical formulas for the hard decision for each check node are exemplified in Fig. 7(b). Checking at a check node whether the sum of the variable node(s) connected to the check node is '0' in this way is called a syndrome check.

[0113] Among error-correcting codes, polar codes are codes that provide a new framework to solve the problems of existing channel codes. They were invented by Arikan of Bikent University (Reference: E. Arikan, "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels," in IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051-3073, July 2009). Polar codes are the first mathematically proven capacity-achieving codes with low encoding and decoding complexity. Polar codes outperform turbo codes at large information block lengths without any error flow. Hereinafter, channel coding using polar codes is called polar coding. Polar codes are known as codes that can achieve channel capacity in a given binary discrete memoryless channel. This can only be achieved when the information block size is sufficiently large. In other words, polar codes are codes that can achieve channel capacity by increasing the code size N infinitely. Polar codes have low encoding and decoding complexity and can be successfully decoded. Polar codes are a type of linear block error correction code, and recursive multiple concatenation is the basic building block for polar codes and the basis for code construction. The physical transformation of a channel, which converts physical channels into virtual channels, occurs based on recursive multiple concatenation. When multiple channels are multiplied and accumulated, most of the channels either improve or worsen, and the idea behind polar codes is to utilize good channels.For example, data is sent at rate 1 through good channels and at rate 0 through bad channels. In other words, channel polarization causes the channels to go from a normal state to a polarized state.

[0114] Figure 8 is an example of a block diagram for a polar encoder.

[0115] Figure 8(a) illustrates the base module of a polar code, and in particular, it is a diagram illustrating the first-level channel combining for polar coding. In Figure 8(a), W2 represents the entire equivalent channel obtained by combining two binary discrete memoryless channels (B-DMC), W, . Here, u1 and u2 represent binary input source bits, and y1 and y2 represent output coded bits. Channel combining is the process of concatenating B-DMC channels in parallel.

[0116] Figure 8(b) shows the basic matrix F for the basic module, and the binary input source bits u1, u2 to the basic matrix F and the corresponding output x1, x2 have the following relationship.

[0117]

[0118] Channel W2 can achieve a symmetric capacity I(W), which is the highest rate. In B-DMC W, the symmetric capacity is an important parameter, which is used to measure the rate, and is the highest rate at which reliable communication can occur over the channel W. B-DMC can be defined as follows.

[0119]

[0120] It is possible to synthesize or create a second set of N binary input channels from N independent copies of a given B-DMCW, said channels having properties {W N (i) : 1 <= i <= N}. As N increases, some of the channels tend to have capacities close to 1, while the rest tend to have capacities close to 0. This is called channel polarization. In other words, channel polarization uses N independent copies of a given B-DMCW to create a second set of N channels {W N (i) : is a process that generates {1 <= i <= N}, and the channel polarization effect increases as N increases, all symmetric capacity terms {I(W N (i) )} tends to be either 0 or 1 except for the vanishing fraction of these indices i. In other words, the idea behind channel polarization in polar codes is to transform N copies (i.e., N transmissions) of a channel with symmetric capacity I(W) (e.g., an additive white Gaussian noise channel) into extreme channels with capacities close to 1 or 0. Among the N channels, the I(W) fraction will be perfect channels and the 1-I(W) fraction will be completely noise channels. Then, information bits are sent only through good channels, and inputs to other channels are frozen as 1 or 0. The amount of channel polarization increases with the block length.

[0121] There are predetermined information block sizes that provide optimal performance depending on the error correction code. While many coding schemes are available that offer high capacity information performance at large information block lengths, most of them do not consistently perform well across a wide range of information block lengths and code rates. However, turbo codes, low-density parity check (LDPC) codes, and polar codes have shown promising BLER performance over a wide range of coding rates and code lengths. With the increasing demands for various use cases such as enhanced mobile broadband (eMBB), massive IoT, and URLLC, there is a need for coding schemes that provide stronger channel coding efficiency. Furthermore, there is a growing need for increased capacity, i.e., an increase in the maximum number of subscribers that a channel can currently accommodate.

[0122] Below, implementations of this specification relating to encoding and decoding devices, methods, and procedures for error correction codes for recovering transmission errors occurring in communication systems are described. The following symbols, abbreviations, or terms are used in connection with the implementations of this specification described.

[0123] - ACK: Acknowledgement

[0124] - ARQ: Automatic Repeat request

[0125] - AWGN: Additive White Gaussian Noise

[0126] - BLER: Block Error Rate

[0127] - BP: Belief Propagation

[0128] - CB: Code Block

[0129] - CBS: Code Block Size

[0130] - CC: Chase Combining

[0131] - CRC: Cyclic Redundancy Check

[0132] - DCB: Data Code Block

[0133] - DCI: Downlink Control Information

[0134] - FEC: Forward Error Correction

[0135] - GF: Galois Field

[0136] - HARQ: Hybrid Automatic Repeat request

[0137] - HARQ-ACK: Hybrid Automatic Repeat request Acknowledgement

[0138] - IR: Incremental Redundancy

[0139] - LDPC: Low Density Parity Check

[0140] - LLR: Log-Likelihood Ratio

[0141] - NACK: Negative Acknowledgement

[0142] - OCB: Outer Code Block

[0143] - OCS: Outer Code Symbol

[0144] - OCSG: Outer Code Symbol Group

[0145] - OCW: Outer CodeWord

[0146] - OPS: Outer Parity Symbol

[0147] - OPSG: Outer Parity Symbol Group

[0148] - PCB: Parity Code Block

[0149] - TB: Transport Block

[0150] - TBS: Transport Block Size

[0151] As previously explained, in communication systems such as LTE and NR, a single large transport block (TB) can be divided into multiple smaller code blocks (CBs) for transmission. As transmission rates increase and new service demands evolve, the size of the transport block can increase. As the transport block size increases, the number of code blocks also increases, especially if the maximum code block size is limited.

[0152] The number of code blocks is C, and the error probability of a code block is BLER. CB If so, the error probability BLER of the transport block TB can be expressed as follows.

[0153]

[0154] Referring to the above equation, it can be seen that as the number of code blocks increases, the error probability of the code blocks must decrease to maintain the target error probability of the transport blocks. In communication systems, it can be difficult to reduce the error probability of the code blocks below a certain level due to various factors such as white noise (AWGN), wireless channel fading, and interference signals. Consequently, achieving the target error probability of the transport blocks can be difficult.

[0155] If a transmission error occurs for a transport block, the error can be recovered by retransmitting the transport block. For example, hybrid automatic request (HARQ) is a technology that combines forward error correction (FEC) and automatic repeat request (ARQ). The transmitter transmits all or part of the encoded bits using FEC, and the receiver detects whether the received data has an error and transmits a HARQ-ACK signal indicating an acknowledgment (ACK) or negative ACK (NACK) of the received data to the transmitter. If the receiver determines that the received data has no error or is below a certain threshold, the transmitter transmits new data, whereas if the receiver determines that the received data has an error or is above a certain threshold, the transmitter retransmits the data block. The receiver combines the retransmitted data block with the previously transmitted data block and decodes it again to detect whether there is an error. That is, the receiver notifies the transmitter of any errors in the transport block, and the transmitter, upon detecting a transmission error, can retransmit the entire transport block to recover from the transmission error. As the number of code blocks increases, the transmitter must retransmit all code blocks in the transport block if an error occurs in any of them, which can increase the retransmission overhead.

[0156] Below, several implementations of this specification are described, which relate to devices, methods and procedures that enable a transmitter to reduce the error probability of a transport block when dividing a transport block into multiple code blocks and transmitting it, and that enable a receiver to efficiently recover from a transmission error when one occurs.

[0157] As previously explained, in wireless communication systems such as LTE and NR, the transmitter divides a transport block (TB) into multiple data code blocks (DCBs) (code block segmentation), and performs encoding on each DCB, such as an LDPC code, turbo code, or polar code, and transmits them along with parity bits. The receiver decodes each DCB, and if all DCBs are decoded without error, the receiver can assemble the DCBs (code block assembly) to restore the transmitted TB.

[0158] DCBs may fail to be decoded at the receiver due to factors such as white noise, fading, or interference. In these cases, the receiver cannot recover the complete TB, and recovery processes such as HARQ-ACK feedback and HARQ retransmission may be required. These retransmission procedures can increase transmission delay and incur overhead in the feedback signaling and retransmission processes. In cases where decoding fails due to deep fading or strong interference, even HARQ retransmission and soft combining may not be able to efficiently recover the TB.

[0159] <External encoding>

[0160] Figures 9 and 10 illustrate transmissions of parity for forward error correction (FEC).

[0161] As mentioned earlier, as the TBS increases, the number of CBs may increase, and as the number of CBs increases, the error requirements for each CB also become more stringent to satisfy the BLER. Since an error in a specific CB requires retransmission of the entire TB, HARQ transmission efficiency also decreases. One approach to addressing this issue is to improve CB BLER during inter-CB decoding through inter-CB encoding. For this purpose, applying channel coding in addition to conventional channel coding can be considered.

[0162] Referring to Fig. 9(a), the transmitter can generate parity by applying an FEC code between multiple DCBs and transmit this parity along with the DCBs in the initial transmission. Alternatively, referring to Fig. 9(b), if an error occurs in the initial transmission, the transmitter can transmit parity when performing a retransmission, thereby improving the aforementioned problems.

[0163] Parity generated from multiple DCBs ("Inter-DCB parity" in FIG. 9) can be generated and transmitted as one or more parity code blocks (PCBs), as illustrated in FIG. 10. As illustrated in FIG. 10, the transmitter can generate and transmit parity for each DCB and each PCB by applying forward error correction codes to each DCB and each PCB. The transmitter can add a CRC before applying forward error correction codes to each DCB and each PCB.

[0164] Hereinafter, the forward error correction code applied between multiple DCBs is called an outer code, and the parity generated by the outer code ("Inter-DCB parity" in FIG. 9 and parity included in the PCB in FIG. 10) is called outer code parity or outer parity. The encoding of the outer code is called outer code encoding or outer encoding, and the decoding is called outer code decoding or outer decoding. In contrast, the forward error correction code applied to each DCB and each PCB is called an inner code, and the parity generated from the inner code ("Parity" in FIG. 10) is called inner code parity or inner parity. Encoding of the inner code is called inner code encoding or inner encoding, and decoding is called inner code decoding or inner decoding.

[0165] External codes can improve system performance by enabling the receiver to recover from DCBs with errors due to deep fading in a fading channel using DCB(s) without errors and PCB(s). Furthermore, the transmitter can retransmit only a number of PCB(s) equal to the number of DCBs with errors, rather than retransmitting all DCBs, thereby allowing the receiver to recover from errors. Therefore, applying external codes can reduce retransmission overhead.

[0166] According to some implementations of this specification, an outer code block (OCB) can be determined from CBs for inter-CB encoding, and an outer code parity can be obtained from the OCBs. PCB(s) can be generated from the outer code parity.

[0167] For example, OCB, external code parity (i.e., "Inter-DCB parity"), and / or PCB(s) may be generated as follows:

[0168] Figure 11 illustrates outer code block (OCB)(s) ​​and outer code parity generated according to some implementations of this specification. In some implementations of this specification, an OCB is configured to include a portion of each of the DCBs, but not include bits of DCBs included in other OCBs. For example, OCB 0 includes DCB 0 through DCB C. d -1 Each part is included, and OCB 1 contains DCB 0 to DCB C that are not included in OCB 0. d -1 Some of the bits of each are included, and OCB o includes DCB 0 to DCB C that are not included in OCB 0 to OCB o-1. d -1 Some of the bits in each DCB are included, and the bits in one OCB are not included in another OCB. According to some implementations of this specification, the transmitter can generate one or more OCBs from multiple DCBs, generate an outer code parity from each OCB, and then generate one or more PCBs from the outer code parity generated from the one or more OCBs.

[0169] In Fig. 11, d is a data bit, and p is an outer code parity bit. In channel coding, a code symbol is a unit to which channel coding is applied. One outer code symbol (OCS) may be composed of one or more data bits (d), and one outer code symbol group (OCSG) may be composed of one or more OCSs. One outer parity symbol (OPS) may be composed of one or more parity bits (p), and one outer parity symbol group (OPSG) may be composed of one or more OPSs. The number of OCSs or OPSs that make up an OCSG or OPSG may vary depending on the system design. The number of bits that make up an OCS or OPS may be determined depending on the type of channel coding. For example, GF(2 n) based Reed-Solomon code, n bits form one OCS. If the outer code is a GF(256) based Reed-Solomon code, one OCS may be composed of 8 bits of data, one OCSG may be composed of 1 OCS, one OPS may be composed of 8 bits of parity, and one OPSG may be composed of 1 OPS. As another example, if the outer code is a binary LDPC code, one OCS may be composed of 1 bit of data, one OPS may be composed of 1 bit of parity, and one OCSG and one OPSG may be composed of 1 OCS and 1 OPS, respectively. As another example, if the outer code is a binary LDPC code, one OCS may be composed of 1 bit of data, one OPS may be composed of 1 bit of parity, and one OCSG and one OPSG may be composed of 8 OCSs and 8 OPSs, respectively. As another example, when the outer code is a polar code, one OCS may be composed of one bit of data, one OPS may be composed of one bit of parity, and one OCSG and one OPSG may be composed of one OCS and one OPS, respectively. In some implementations of this specification, the number of OCSs or OPSs included in each OCSG and OPSG may be 1, or may be defined or set to be a positive integer multiple of a byte (i.e., 8 bits), considering that data is generally stored and processed in units of bytes in digital systems with memory, such as computer systems and communication systems.

[0170] An OCB may be formed from one OCS from each of the DCBs, but in some implementations of the present specification, as illustrated in FIG. 11, an OCB may be formed from multiple OCSs from each of the DCBs. An OCB may also be formed from one OCSG from each of the DCBs, but in some implementations of the present specification, as illustrated in FIG. 11, an OCB may be formed from multiple OCSGs from each of the DCBs.

[0171] In some implementations of this specification, the size of the DCB, including filler bit(s), and the size of the PCB may be defined as being the same. This is because if the sizes of the DCB and the PCB are different, the base station or, in the case of direct UE-to-UE communication, the scheduling UE must signal the sizes of the DCB and the PCB differently.

[0172] Referring to FIG. 11, one or more OCBs can be generated from multiple DCBs. Each OCB can extract one or more OCSGs from each DCB and be configured by collecting multiple OCSGs extracted from multiple DCBs.

[0173] The size of DCB (number of data bits) is K d , the number of DCBs is C d , the maximum size of OCB (maximum number of data bits) is K o,max Then, the transmitter has the number of OCBs C as follows: o can be obtained.

[0174]

[0175] The number of bits for each OCS is K s , the number of OCS for each OCSG is L s If so, the number of OCSGs in each DCB is L g can be obtained as follows.

[0176]

[0177] Size K of DCB d Go K s Wow L s Wow L g The product of (i.e., K s L s L g ) is less than the maximum number of DCBs, the transmitter may add filler bit(s) to each DCB. The size of the filler to be added is K. f can be obtained as in mathematical formula 8.

[0178]

[0179] OCB o(0≤o <C o , o is an integer) is the number of OCSGs to be extracted from each DCB. o When we say, L o can be determined by mathematical expressions 9 and 10.

[0180]

[0181]

[0182] Size K of OCB o o can be obtained as follows.

[0183]

[0184] As defined in Equation 10, L o Since there are two types, the sizes of OCBs obtained from DCBs may be different. L o >1 may mean that OCSs (or OCSGs) that form the OCB are extracted from multiple locations within each DCB.

[0185] The transmitter can generate external parity by performing external code encoding on each OCB. The transmitter generates external parity as shown in Fig. 11. p It can be transmitted in the form of PCBs. The size of the PCB (i.e., the number of parity bits) is K p If you say K pis the size of DCB K d can be as follows. One OPS on each PCB is K s It consists of parity bits and one OPSG is L s If it consists of OPS, the size P of the external parity to be generated from OCB o o can be obtained as follows.

[0186]

[0187] The size N of each outer codeword (OCW) composed of each OCB and its parity o can be expressed as follows.

[0188]

[0189] Each OCW o(0≤o <C o , o is an integer) outer code rate R o can be expressed as follows.

[0190]

[0191] The transmitter is L from each OCW o o We can extract the OPSGs of a single PCB. The size of the PCB is K. p can be expressed as follows: L o >1 may mean that OPSs (or OPSGs) that will form the PCB are extracted from multiple locations within each OCW.

[0192]

[0193] For example, the size K of DCB d 64, number of DCBs C d is 10 and the maximum size of OCB is K o,max If the number of OCBs is 144, then the number of OCBs is C o is 5 by mathematical expression 6. The maximum size of OCB K o,maxis a system parameter and may be equal to or different from the maximum size of the DCB. K o,max is predefined or can be set by the base station. The number of bits for each OCS is K. s is 1 and the number of OCSs for each OCSG is L s If is 8, the number of OCSGs of each DCB is L g becomes 8 by mathematical formula 7. In this case, the size of the filler K f Since it becomes 0 by Equation 8, there is no need to add a filler. Since M becomes 3 in Equation 9, the number of OCSGs to be extracted from each DCB to construct OCB o (0≤o<5, o is an integer) L o is 2(0≤o<3) or 1(3≤o<5) by mathematical expression 10. Therefore, the size K of OCB o o becomes 160 (0≤o<3) or 80 (3≤o<5) by mathematical expression 11. When the transmitter wants to transmit the external parity generated by performing external code encoding on each OCB to two PCBs, where one OPS consists of one parity bit and one OPSG consists of eight OPSs, the size P of the external parity to be generated from OCB o o is 32 (0≤o<3) or 16 (3≤o<5) by mathematical expression 12. The size N of each OCW o o By mathematical expression 13, it becomes 192 (0≤o<3) or 96 (3≤o<5). External code rate R o can be calculated by mathematical formula 14 and is equal to '5 / 6' for all OCWs. The size K of the PCB p is calculated as 64 by mathematical expression 15, and the size K of DCB d and the size of the filler K f It becomes equal to the added value.

[0194] In the example of Fig. 11, the OCW may be composed of adjacent OCSGs within the DCB and adjacent OPSGs within the PCB. In this case, if a burst error occurs in the DCB or PCB, a burst error may also occur in the OCW, making recovery difficult at the receiver.

[0195] Figure 12 illustrates some implementations of the present specification that reduce the probability of burst errors for a code block. In particular, Figure 12 is an example of a method for reducing the probability of burst errors by spacing out OCSGs and OPSGs belonging to the same OCW within a DCB and a PCB. For example, the transmitter may extract OCSGs belonging to the same OCB within a DCB so that they are spaced apart by the number of OCBs within the DCB. The transmitter may also generate PCBs so that OPSGs belonging to the same OCW are transmitted within a PCB so that they are spaced apart by the number of OCBs within the DCB. In some implementations of the present specification, the total number of OCBs, the number of OCBs within a DCB, and the number of OCWs within a PCB may be the same.

[0196] There are various ways to ensure that OCSGs and OPSGs belonging to the same OCW are separated from each other within the DCB and PCB. That is, the OCB configuration and PCB generation method of FIG. 12 can be implemented in various ways. FIG. 13 and FIG. 14 illustrate implementation examples of the OCB configuration and PCB generation method.

[0197] The OCB configuration and PCB generation method of FIG. 12 can be implemented using block interleavers for each DCB and each PCB, for example, as illustrated in FIG. 13. In some implementations of this specification, the size of the block interleaver for the PCB and the size of the block interleaver for the DCB may be the same. Referring to FIG. 13, the transmitter may have C rows for each DCB and each PCB. o and the number of columns is L o,max Using OCSG and OPSG block interleavers, the OCB can be configured and the PCB generated by following the procedure: where L o,max is L o It is the largest value among the values. Referring to mathematical expression 10, for example, L o,max = CEIL(L g / C o ) may be.

[0198] > S1. The transmitter sequentially stores (writes) the OCSGs of each DCB in the column direction to each DCB block interleaver. When one column is full, it moves to the next column and stores.

[0199] > S2. Read the OCSGs of the DCB block interleavers row-wise to create an OCB. Each row becomes one OCB.

[0200] > S3. Perform outer code encoding on each OCB to generate parity and OPSG. The generated OPSGs are stored in the row direction of the PCB block interleavers.

[0201] > S4. Each PCB block interleaver's OPSGs are read in the column direction to generate each PCB. After reading one column, the next column is read.

[0202] Another implementation example of the OCB configuration and PCB generation method is DCB i(0≤i <C d, i is an integer) are OCSGs belonging to OCSG<i, a> (0≤a <L g , a is an integer), and OCB o(0≤o <C o , o is an integer) are OCSGs that constitute OCSG [o, x] (0≤x <L o C d , x is an integer), then OCSG [o, x] can be expressed as follows.

[0203]

[0204] Here, OCSG [o, x] means OCSG x of OCB o, and OCSG<i, a> means OCSG a of DCB i.

[0205] PCB j(0≤j <C p , j is an integer) of OPSGs<j, b> (0≤b <L g , b is an integer), OCB o(0≤o <C o , o is an integer) are generated from OPSGs OPSG [o, y] (0≤y <L o C p , y is an integer), then OPSG<j, b> can be expressed as follows.

[0206]

[0207] Here, OPSG [o, y] means OPSG y generated from OCB o, and OPSG<j, b> means OPSG b of PCB j.

[0208] Fig. 14 is another implementation example of an OCB configuration and PCB generation method. The example of Fig. 14 is an example of generating two PCBs, each consisting of 13 OPSGs, from three DCBs, each consisting of 13 OCSGs. Referring to Fig. 14, OCBs can be configured and PCB(s) can be generated using each DCB and PCB block interleaver. In the example of Fig. 14, the number of OCBs (or the number of OCWs) C o is 5, L ois 3(0≤o<3) or 2(3≤o<5), L o,max The block interleaver size of DCB and PCB is 5 rows and 3 columns. The indices of OCSGs and the indices of OPSGs can be calculated by Equations 16 and 17, as indicated in each OCSG and each OPSG in Fig. 14.

[0209] In some implementations of this specification, the transmitter may construct one or more OCBs from a plurality of DCBs as described above, generate an outer code parity from the OCBs, and generate one or more PCBs from the generated outer code parity. The transmitter may add a CRC to each DCB and PCB. The transmitter may perform internal encoding on each DCB and PCB (with or without a CRC) to generate an inner code parity and transmit it along with each DCB and PCB.

[0210] The receiver can perform internal decoding of each DCB using the internal code parity transmitted together. If the transmitter transmits each DCB with a CRC, the receiver can determine whether decoding was successful by checking the CRC of each DCB that has completed internal decoding. If the transmitter does not transmit a CRC for each DCB, the receiver can determine whether decoding was successful by checking the syndrome of the internal code. If the internal decoding of all DCBs is successful, the receiver can reconstruct the TB by assembling the DCBs (code block assembly). The receiver can determine whether there is a transmission error by checking the CRC of the TB. In some implementations, if all DCBs are decoded without error or successfully, decoding of the PCB may be omitted. In some implementations, internal decoding of the DCB and internal decoding of the PCB may be performed together to reduce decoding delay.

[0211] If transmission errors are confirmed after internal decoding of DCBs, the receiver can perform external decoding using external code parity. If there are DCBs for which transmission errors are not recovered even after external decoding, retransmission may be required. The receiver can inform the transmitter whether the TB was received without errors, i.e., whether all DCBs were received without errors. For example, in a cellular mobile communication system, in the downlink, the UE can transmit an ACK or NACK as HARQ-ACK feedback to the BS, or inform the BS of the number of CBs in which transmission errors occurred. As another example, in the uplink, the BS can schedule the UE to retransmit the same data as the data of the DCBs for which transmission errors were not recovered.

[0212] Redundancy version (RV) and HARQ

[0213] Figure 15 is a diagram illustrating the concept of the rate matching process.

[0214] 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 may consist of sub-block interleaving, bit selection, and bit interleaving. For example, the input bit sequence to rate matching may be 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 coded bits d0,d1,d2,d3,...,d N-1 If we denote it, the coded bits d0,d1,d2,d3,...,d N-1can be divided into multiple sub-blocks. Here, E can be a value determined based on the size of the radio resources scheduled for the corresponding transport block. It can 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 If we denote it as , 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, i.e., if sub-block interleaving is not applied, coded bits d0,d1,d2,d3,...,d N-1 This length is written to a circular buffer of size N.

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

[0216] > k = 0;

[0217] > j = 0;

[0218] > while k < E

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

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

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

[0222] >> end if

[0223] >> j = j+1

[0224] > end while.

[0225] In Fig. 5, 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) Here, r=0,...,C-1, 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 radio resource. Through the code block concatenation, rate-matched outputs for different code blocks can be sequentially concatenated.

[0226] Hybrid automatic request (HARQ) is a technology that combines forward error correction (FEC) and automatic repeat request (ARQ). For example, a transmitter transmits all or part of the encoded coded bits using FEC, and a receiver detects whether there are errors in the received data and transmits a HARQ-ACK signal indicating an acknowledgment (ACK) or negative ACK (NACK) of the received data to the transmitter. If the receiver determines that the received data is error-free or below a certain threshold, the transmitter transmits new data. On the other hand, if the receiver determines that the received data contains errors or exceeds a certain threshold, the transmitter retransmits the corresponding data block. The receiver combines the retransmitted data block with previously transmitted data blocks and decodes it again to detect errors. This operation can be repeated until no errors are detected or until a predetermined number of errors are detected. The combining methods for decoding retransmitted data blocks can be divided into the following two types.

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

[0228] * Incremental redundancy (IR): For combining at the receiver, the transmitter retransmits coded bits that are not identical to the coded bits that were initially transmitted. For example, the transmitter sends the redundancy that was not sent in the initial transmission to the receiver in the retransmission. Since the redundancy that was 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 to increase the redundancy, which has the effect of lowering the code rate. In other words, incremental redundancy can reduce the error probability through coding gain when decoding retransmitted data blocks. In general, since chase combining corresponds to the case where there is no incremental redundancy among incremental redundancies, chase combining can be interpreted as a special form of incremental redundancy.

[0229] In HARQ operation, the receiver generates an ACK or NACK for received or scheduled packets and provides them to the transmitter. A transmitter that receives a NACK for a transmission can retransmit the requested 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 Figure 15, there are multiple (e.g., four) RVs that define the positions of the starting points from which bits are read from the circular buffer.

[0230] The circular buffer is a crucial component for rate matching and enables puncturing and / or repetition of coded bits. Referring to Figure 15, the coded bits or the output bits after sub-block interleaving of the coded bits are sequentially written 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 within the circular buffer.

[0231] As mentioned above, the encoding applied to each code block in this specification is called internal encoding, and the coded bits after internal encoding for the code block, i.e., the codeword, are called internal codewords. Hereinafter, for the convenience of explanation, the (circular) buffer in which the internal codeword is written / stored is called internal codeword (circular) buffer. In some implementations of this specification described below, an external codeword is written to the (circular) buffer, and the (circular) buffer in which the external codeword is written / stored is called external codeword (circular) buffer. In addition, considering that in some implementations of this specification described below, a redundancy version for an internal codeword and a redundancy version for an external codeword can be used separately, in order to distinguish between the two, the redundancy version for an internal codeword is called RV hereinafter. i , the redundancy version for external codewords is RV o It is expressed as .

[0232] A transmitter of a BS that receives a HARQ-ACK, which is a NACK, or a transmitter of a UE that receives retransmission scheduling information may perform retransmission of the data, which is a NACK. The transmitter may perform transmission with a redundancy version (RV) different from the initial transmission in order to increase a coding gain. The transmitter may select bits or symbols to be transmitted according to the RV from among systematic bits or symbols and parity bits or symbols of the outer code. The transmitter may also select bits or symbols to be transmitted according to the RV from among systematic bits or symbols and parity bits or symbols of the inner code.

[0233] Figure 16 illustrates transmission bits / symbols by redundancy version. In particular, Figure 16 illustrates the RV index RV of the internal code. i When RV has values ​​from 0 to 3, i exemplifies systematic and parity bits or symbols transmitted according to the present specification. In some implementations of the present specification, the inner codeword circular buffer of FIG. 16 may be a buffer that stores a codeword (also called a coded block) generated by internally encoding one of the DCBs or PCBs illustrated in FIGS. 11 to 14. In the example of FIG. 16, the transmitter is RV i According to the method, the first bit or symbol to be transmitted from the circular buffer can be selected, and consecutive bits or symbols can be transmitted in an amount determined by rate matching from the selected bit or symbol.

[0234] Referring to Fig. 16, RV i It can be seen that some or all of the systematic bits or symbols may not be transmitted depending on the method. This means that if the same method is applied to the external code block, some or all of the DCBs may not be transmitted. If an error occurs in the initial transmission and the DCBs that need to be recovered are not retransmitted, the remaining DCBs and PCBs must be used for external decoding to recover them, which increases the possibility of losing the opportunity to directly recover the DCBs with errors through internal decoding and increasing the decoding complexity. Therefore, in the case of the external code block, it may be efficient to always transmit the systematic bits or symbols first, unlike the internal code block. Taking this into account, in some implementations of the present specification described below, the transmitter may determine the transmission bits / symbols by applying a circular operation according to the RV value to the entire inner codeword in the case of the inner codeword, and may determine all systematic bits / symbols of the outer codeword as transmission bits / symbols in the case of the outer codeword and apply a circular operation according to the RV value only to the parity part of the outer codeword to determine the parity bits / symbols to be transmitted. The receiver may perform decoding assuming this.

[0235] Figure 17 illustrates transmission bits / symbols for each redundancy version according to some implementations of this specification. In particular, Figure 17 illustrates the RV index RV of the outer code. o When RV has values ​​from 0 to 3, o An example showing the system and parity bits or symbols transmitted according to the outer codeword buffer of Fig. 17 is a buffer that stores an OCW. For example, the outer codeword buffer of Fig. 17 may be a buffer that stores one of the OCWs illustrated in Figs. 11 to 14. Referring to Fig. 17, in some implementations of the present specification, the transmitter stores all RV o Transmit systematic bits or symbols first, and then additionally transmit the starting position of parity bits or symbols to be transmitted. o In some implementations of this specification, if the transmitter generates and transmits PCB(s) from external code parity, RV o The starting PCB to be transmitted can be determined according to the RV o The parity bits / symbols (or PCB(s)) to be transmitted can be determined cyclically. For example, RV in Fig. 17 o = Referring to the case of 3, the transmitter is RV o After transmitting from the start position of the parity bits or symbols determined according to the systematic bits or symbols, the transmission can be continued by returning to the beginning of the parity bits or symbols, rather than the systematic bits or symbols. This is because it may be more efficient to transmit the outer code parity that contains information about several DCBs than to transmit a specific DCB(s), since it is difficult for the transmitter to know the position of the DCB in which a transmission error occurred. To this end, in some implementations, the transmitter records / stores the parity bits / symbols of the outer codeword in a corresponding circular buffer for the parity bits / symbols of the outer codeword, and stores the RV for the circular buffer. o Starting from the starting position of the value, the number of parity bits / symbols to be transmitted can be read (or selected) and transmitted. In some implementations of this specification, RV o The spacing between the starting positions of the parity bits or symbols determined by RV may be constant or similar. For example, RV o The interval between the starting position when 0 and the starting position when 1 may be equal to or similar to the interval between the starting position when 1 and the starting position when 2, and the interval between the starting position when 2 and the starting position when 3. In some implementations, RV o The starting position according to can be defined considering the PCB boundary. For example, RV o The starting position according to can be defined to be the start of the PCB. In some implementations, if the external code is an LDPC code, the lifting size is taken into account, for example, a position that is an integer multiple of the lifting size is RV o The starting position can be defined to be aligned according to .

[0236] Figure 18 is an illustration to help understand an external codeword buffer according to some implementations of the present specification described with reference to Figure 17. In other words, Figure 18 is an example showing how the external codeword buffer of Figure 17 can be used. In some implementations of the present specification, C o About the dog OCWs C o External codeword buffers may be used. In some implementations, for example, assuming that OCB(s) and PCB(s) are generated as in FIG. 14, the five OCBs generated from the three DCBs may be stored as systematic bits or symbols of respective (respectively) buffers assigned to the corresponding OCWs, as illustrated in FIG. 18. The external code parity generated by performing external encoding on each OCB may be stored as parity bits or symbols of the (circular) buffer assigned to each OCW. For example, the external code parity generated from OCB 0 may be stored in the circular buffer assigned for OCB 0, or in the circular buffer assigned to the OCW generated from OCB 0.

[0237] FIG. 19 is a diagram illustrating an internal codeword circular buffer according to some implementations of the present specification described with reference to FIG. 16 to help understand the internal codeword circular buffer. In other words, FIG. 19 is an example showing how the internal codeword circular buffer of FIG. 16 can be used for DCBs and PCBs. In some implementations of the present specification, as many internal codeword circular buffers as the sum of the number of DCBs and the number of PCBs can be used. For example, when a transmitter generates and transmits two PCBs from three DCBs as in FIG. 14, referring to FIG. 19, each of the DCBs and the PCBs can be stored as systematic bits or symbols of the internal codeword circular buffer allocated for the corresponding DCB or PCB, and the internal code parity generated by performing internal encoding on the corresponding DCB or PCB can be stored as parity bits or symbols of the corresponding internal codeword circular buffer.

[0238] Figures 18 and 19 illustrate how OCSGs in OCB(s) and DCB(s) and OPSGs in PCB(s) are stored in external codeword buffers and internal codeword circular buffers for OCWs according to Figure 14 to help understand how the external codeword buffer and the internal codeword circular buffer are used, but implementations of the present specification regarding the application of redundancy versions may also be applied to OCWs and DCBs / PCBs generated by other methods than some implementations of the present specification described in Figures 11 to 14. For example, PCBs are determined from parity bits obtained by applying external encoding to DCBs, and the starting PCB among the PCBs is RV o The start bit to be transmitted from the corresponding internal codeword is determined based on RV and is obtained by applying internal encoding to each DCB / PCB. i (or RV i,d or RV i,p ) can be determined based on.

[0239] According to some implementations of this specification, the internal code's RV index RV i and RV index of external code RV o There may be various transmission methods depending on the combination of. Figures 20 to 24 are examples of data / parity transmitted for each redundancy version (or each combination of redundancy versions) according to some implementations of the present specification. In particular, Figures 20 to 24 illustrate RV in a system where a transmitter can generate five PCBs when transmitting five DCBs, i.e., a system with an external code rate of 1 / 2. i Wow RV o Examples of transmission methods according to combinations are shown. The shaded portions in FIGS. 20 to 24 are bits or symbols that are selected and actually transmitted according to rate matching and redundancy versions.

[0240] Fig. 20 is RV i Wow RV o As an example of a case where all are 0, the starting PCB transmitted with the DCBs may be the first PCB (PCB 0). Referring to FIG. 20, each DCB and PCB may be transmitted with systematic bits or symbols given priority. In particular, transmitting in this manner may be efficient for the first transmission. Retransmission may also be performed as illustrated in FIG. 20, but in this case, since both the inner code and the outer code are CC HARQ, not IR HARQ, there is no effect of lowering the code rate, and thus no increase in coding gain may occur.

[0241] Fig. 21 is RV i is 0 and RV o For example, if the starting PCB transmitted with DCBs is not 0, the RV may not be the first PCB (PCB 0). o It can be determined according to. For each of DCBs and PCB(s), the corresponding systematic bits or symbols are transmitted with priority. If retransmission is performed as in Fig. 21 after the initial transmission as in Fig. 20, the inner code may be in the form of CC HARQ and the outer code may be in the form of IR HARQ, so that the coding gain of the outer code may increase.

[0242] Fig. 22 is RV i is not 0 and RV o For example, if the starting PCB transmitted with the DCBs is 0, the first PCB (PCB 0) and for each of the DCBs and PCB(s), RV i Depending on the systemic bits or symbols, some or all of them may not be transmitted, and instead more parity bits or symbols may be transmitted. If retransmission is performed as in FIG. 22 after the initial transmission as in FIG. 20, the inner code may be in the form of IR HARQ, so that the coding gain may increase, but the outer code may be in the form of CC HARQ, so that it may be difficult to expect an increase in coding gain. If the outer code is an MDS (Maximum Distance Separable) code such as the Reed-Solomon code, in order to recover an erroneous DCB, only as many error-free DCBs and PCBs as the total number of DCBs are needed, so as in FIG. 22, the outer code is retransmitted in the CC HARQ manner, and only the inner code is retransmitted in the IR HARQ manner (i.e., the PCB transmitted in the initial transmission is replaced with a new RV i A method of retransmitting (redirecting) can be used.

[0243] Fig. 23 is RV i Wow RV o Here is an example of a case where all are not 0. The starting PCB transmitted with the DCBs may not be the first PCB (PCB 0), and RV o can be determined according to the DCBs and PCB(s) respectively, RV i Depending on the systemic bits or symbols, some or all of them may not be transmitted and instead more parity bits or symbols may be transmitted. If retransmission is performed as in FIG. 23 after the initial transmission as in FIG. 20, both the inner code and the outer code may be in the form of IR HARQ, so an increase in coding gain may be expected. However, a PCB that is not transmitted in the initial transmission but only in the retransmission (e.g., PCB 1 in FIG. 23) may have a reduced probability of being decoded without error at the receiver because some or all of the systematic bits or symbols are not transmitted. If transmission errors remain in the PCBs, this may lead to a degradation in the performance of outer code decoding.

[0244] Figure 24 is an example of a case where the internal code RV index for DCB and the internal code RV index for PCB are separated to improve the problem of Figure 23, and the internal code RV index of PCB is always applied as 0 and transmitted. The internal code RV index of DCB is RV i,d And the internal code RV index of the PCB is RV i,p In the example of Fig. 24, RV i,d Wow RV o is not 0 and RV i,p becomes 0. If retransmission is performed as in Fig. 24 after the initial transmission as in Fig. 20, both the inner code and the outer code become IR HARQ forms, so an increase in coding gain can be expected, and since all systematic bits or symbols are transmitted with priority in the PCB transmitted only in the retransmission (e.g., PCB 1 in Fig. 24), performance improvement can be expected compared to Fig. 23. If the outer code is a code that allows soft decision decoding, such as an LDPC code, retransmission as in Fig. 24 can be efficient.

[0245] In some implementations of this specification, the transmitter and receiver can share RV information of the inner code and the outer code through signaling information. In the case of a wireless communication system, the BS can transmit the RV information of the inner code and the outer code to the UE through downlink control information (DCI), medium access control (MAC) control element (CE), and / or radio resource control (RRC) messages. For example, in the examples of FIGS. 20 to 23, the BS can transmit the RV information of the inner code and the outer code to the UE through DCI. i Wow RV o can be transmitted.

[0246] As another example, in the case of Fig. 24, the BS sends RV to the UE through DCI i,d Wow RV o and send RV i,p can be stipulated or defined as fixed to 0. As another example, to reduce signaling overhead, only one RV index is transmitted via DCI, and (in the case of Figs. 20 to 23) RV i Wow RV o Or (for Fig. 24) RV i,d Wow RV o The above one RV index can be used for all. For example, the RV index transmitted as DCI is RV DCI If so, RV of Fig. 24 i,d Wow RV i,p , and RV o can be expressed as follows.

[0247]

[0248] Figure 25 is an example of a data transmission / reception flow according to some implementations of the present specification. In particular, Figure 25 is an example of a case in which, in a wireless communication system, a UE recovers through retransmission when an error occurs in data transmitted in the uplink using external coding. In the example of Figure 25, it is assumed that the UE transmits one PCB with five DCBs, from DCB 0 to DCB 4, and RV o If RV is 0, the starting index of the PCB to be transmitted is 0, and RV o If is 1, it is assumed that the starting index of the PCB to be transmitted is 1. This is only an example, and the number of DCBs, the number of PCBs included in each PUSCH transmission, and RV o Starting index of PCB by value, RV included in each DCI DCI The number of values, etc. may differ from the example in Fig. 25.

[0249] Referring to Figure 25, the BS can transmit DCI 1 including scheduling information of PUSCH 1 to the UE through PDCCH 1 (S2501). DCI 1 is RV DCI , and in the example of Fig. 25, its value is assumed to be 0.

[0250] A UE that receives PDCCH 1 and successfully decodes DCI 1 receives the received RV DCI The value, i.e. 0, is RV o can be set in (S2502a). The UE generates PCBs by performing external encoding on DCBs, and RV o (=0) can be selected as the PCB to transmit PCB 0 (S2502a). The UE receives the RV DCI The value, i.e. 0, is RV i,d Set to RV and set to a fixed value X (e.g., 0) as promised (e.g., specified in the system or standard or preset via RRC signaling). i,p can be set in (S2502b). The UE encodes each DCB internally and then RV i,d The bits or symbols to be transmitted can be selected based on (S2502b). In addition, the UE internally encodes PCB 0 and then RV i,p The bits or symbols to be transmitted can be selected based on (S2502b). The UE can transmit the selected bits or symbols via PUSCH 1 (S2503).

[0251] The BS may receive PUSCH 1 and perform internal decoding on each of the DCBs and PCB 0 (S2504). If there is a DCB that fails internal decoding, the BS may perform external decoding based on all the DCBs and PCB 0 (S2504). If there is a DCB whose error is not recovered even after external decoding, the BS may schedule PUSCH 2 for retransmission. The BS may transmit DCI 2 including scheduling information of PUSCH 2 to the UE via PDCCH 2. DCI 2 is RV DCI , and in the example of Fig. 25, its value is assumed to be 1.

[0252] A UE that receives PDCCH 2 and successfully decodes DCI 2 receives the received RV DCI The value, i.e. 1, is RV o can be set to (S2506a). In some implementations, the UE is RV o Based on (= 1), PCB 1 can be selected as the PCB to be transmitted among the PCBs generated by performing external encoding on the DCBs. In some implementations, if the UE has stored PCBs generated in a previous transmission (e.g., the initial transmission), external encoding is not performed again and RV o (= 1) can be selected as the PCB to be transmitted. In some implementations, if the UE does not store the PCBs generated in the previous transmission (e.g., the initial transmission), the UE may regenerate the PCBs based on the DCBs. The UE may receive the RV DCI The value, i.e. 1, is RV i,d Set to RV and set to a fixed value X (e.g., 0) as promised (e.g., specified in the system or standard or preset via RRC signaling). i,p can be set to (S2506b). The UE encodes each DCB internally and then RV i,d The bits or symbols to be transmitted can be selected based on (S2506b). In addition, the UE internally encodes PCB 1 and then transmits the RV i,p The bits or symbols to be transmitted can be selected based on (S2506b). The UE can transmit the selected bits or symbols via PUSCH 2 (S2507).

[0253] The BS may receive PUSCH 2 and combine PUSCH 2 with previously received PUSCH 1 to re-perform internal decoding for DCB(s) that had transmission errors in a previous transmission (e.g., initial transmission) (S2508). If all DCBs are decoded without errors, the BS may terminate without performing any further decoding. If any DCBs remain that failed internal decoding, the BS may internally decode PCB 1 and then perform external decoding based on all DCBs, PCB 0, and PCB 1 (S2509). If all DCBs have transmission errors corrected in the external decoding, the BS may terminate the retransmission procedure. If any DCBs have not been corrected from errors even after external decoding, the BS may schedule a second retransmission.

[0254] Figure 26 is another example of a data transmission / reception flow according to some implementations of the present specification. In particular, Figure 26 is an example of a case in which, in a wireless communication system, a BS recovers through retransmission when an error occurs in data transmitted in the downlink using external coding. In the example of Figure 26, it is assumed that the BS transmits one PCB with five DCBs, from DCB 0 to DCB 4, and RV o If RV is 0, the starting index of the PCB to be transmitted is 0, and RV o When is 1, it is assumed that the starting index of the PCB to be transmitted is 1. In the example of Fig. 26, the BS transmits DCI 1 including scheduling information of PDSCH 1 to the UE through PDCCH 1, and DCI 1 is RV with value 0. DCI It is assumed that it includes the number of DCBs, the number of PCBs included in each PDSCH transmission, and the RV. This is just an example. o Starting index of PCB by value, RV included in each DCI DCI The number of values, etc. may differ from the example in Fig. 26.

[0255] Referring to Figure 26, the BS performs external encoding on the DCBs to generate PCBs and RVs to be transmitted. DCI A value, for example, 0 in RV o Set up in RV o = 0 can be selected as the PCB to be transmitted based on PCB 0 (S2600a). The BS is the RV to be transmitted DCI A value, for example, 0 in RV i,d Set (S2600b) to a fixed value X (e.g., 0) that is promised (e.g., specified in the system or standard or preset via RRC signaling) to RV i,p can be set to (S2600b). The BS encodes each DCB internally and then RV i,d The bits or symbols to be transmitted can be selected based on (S2600b). In addition, the BS internally encodes PCB 0 and then RV i,p The bits or symbols to be transmitted can be selected based on (S2600b). The BS transmits PDCCH 1 carrying DCI 1 scheduling PDSCH 1 (S2601), and can transmit the selected bits or symbols through PDSCH 1 (S2602).

[0256] A UE that has successfully decoded DCI 1 by receiving PDCCH 1 can receive PDSCH 1 based on DCI 1 carried by PDCCH 1. The UE can receive the received RV DCI Value and RV i,p Based on the fixed value X for the above, internal decoding can be performed on each of the DCBs and PCB 0 received through the PDSCH 1 (S2603). If there is a DCB for which internal decoding fails, the UE can perform external decoding based on all DCBs and PCB 0 (S2603). If there is a DCB for which an error is not recovered even in external decoding, the UE can transmit HARQ-ACK information to the BS notifying that there is a DCB for which decoding failed (S2604).

[0257] If the BS recognizes that the UE has an unrecovered DCB based on the HARQ-ACK information, the BS can schedule PDSCH 2 for retransmission. The BS can include RV in the scheduling information for PDSCH 2. DCI A value, for example, 1 in RV o Set up in RV o = 1 can be selected as the PCB to be transmitted (S2605a). In some implementations, if the BS stores PCBs generated in previous transmissions (e.g., initial transmission), the RV does not perform external encoding again. o = 1 can be selected as the PCB to be transmitted based on PCB 1. In some implementations, if the BS does not store the PCBs generated in the previous transmission (e.g., the initial transmission), the BS may regenerate the PCBs based on the DCBs. The BS may select the RV to be transmitted DCI A value, for example, 1 in RV i,d Set (S2605b) to a fixed value X (e.g., 0) that is promised (e.g., specified in the system or standard or preset via RRC signaling) to RV i,p can be set to (S2605b). The BS encodes each DCB internally and then RV i,d The bits or symbols to be transmitted can be selected based on (S2605b). In addition, the BS internally encodes PCB 1 and then RV i,p The bits or symbols to be transmitted can be selected based on (S2605b). The BS transmits PDCCH 2 carrying DCI 2 including scheduling information for PDSCH 2 (S2606), and can transmit the selected bits or symbols through PDSCH 2 (S2607). DCI 2 is RV DCI , and in the example of Fig. 26, its value is assumed to be 1.

[0258] A UE that successfully decodes DCI 2 by receiving PDCCH 2 can receive PDSCH 2 based on DCI 2 carried by PDCCH 2. The UE can combine PDSCH 2 with previously received PDSCH 1 to perform internal decoding on DCB(s) that had transmission errors in a previous transmission (e.g., initial transmission) again (S2608). If all DCBs are decoded without errors, the UE can terminate without performing any further decoding. If there are DCBs that failed internal decoding, the BS can internally decode PCB 1 and then perform external decoding based on all DCBs and PCB 0 and PCB 1 (S2609). If all DCBs have transmission errors recovered in the external decoding, the UE can transmit HARQ-ACK information, for example, an ACK, indicating that there are no DCBs with transmission errors. Otherwise, it may transmit HARQ-ACK information, for example, NACK, indicating that there is a DCB with a transmission error.

[0259] In Figures 25 and 26, one RV value RV according to some implementations of this specification DCI This is provided through DCI and RV DCI This RV i,d Wow RV o An example is given where two redundancy version values ​​for transport blocks are set via DCI, RV i Wow RV o may be provided.

[0260] According to some implementations of this specification, the probability of transmission errors can be reduced in a wireless communication system in which a single transmission block can be divided into multiple code blocks and transmitted. According to some implementations of this specification, if a transmission error occurs in a code block(s) transmitted by a transmitter, the corresponding code block(s) can be efficiently recovered at the receiver through HARQ retransmission.

[0261] Figure 27 illustrates a channel encoding process according to some implementations of the present specification.

[0262] A communications device or encoder may perform operations according to some implementations of the present disclosure in connection with channel encoding. The communications 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 the present disclosure. A processing device for the communications 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 the present disclosure. A computer-readable (non-transitory) storage medium may store at least one computer program comprising instructions that, when executed by at least one processor, cause the at least one processor to perform operations according to some implementations of the present disclosure. A computer program or computer program product may be recorded on at least one computer-readable (non-transitory) storage medium and may contain instructions that, when executed, cause (at least one processor) to perform operations according to some implementations of the present specification.

[0263] Referring to FIG. 27, a method performed by the communication device, or in the communication device, the encoder, the processing device, the computer-readable (non-transitory) storage medium, and / or the computer program product, the operations: C based on the transport block d Obtaining the dog DCBs (S2701); the above C d Perform a first encoding on the DCBs to obtain the outer parity bits; based on the outer parity bits, C p It may include determining the dog PCBs (S2703). The first encoding may correspond to the external encoding described above. The method or the operations may include: C d Dog DCBs and C p Perform a second encoding on each of the dog PCBs to obtain the C d C associated with each of the dog DCBs (respectively) d Dog codewords and the above C p C associated with each of the dog PCBs (respectively) p It may include generating dog codewords. The second encoding may correspond to the internal encoding described above. The method or the operations: a first redundancy version RV o Based on the above C p Determine P PCBs among the dog PCBs (S2705); the above C d (C) obtained by applying the second encoding to each of the P DCBs and the above P PCBs d It may include determining transmission bits from each of the codewords (S2707) (dog + P); and performing wireless transmission including the transmission bits (S2709).

[0264] In some implementations, determining the P PCBs is: p It may include cyclically selecting P PCBs starting from PCB p among the P PCBs, where 0 ≤ p < C. p and the PCB p is the first redundancy version RV o can be decided based on.

[0265] In some implementations, determining the transmission bits comprises: a predetermined length E for the r_i-th inner codeword, starting from bit i0 within the codeword r_i. r_i may include a cyclic selection of bits, wherein said codeword r_i is C d It is obtained by applying the second encoding to the r_i-th DCB among the dog DCBs, where 0 ≤ r_i < C d , and the above bit i0 is the second redundancy version RV i can be determined based on the second redundancy version RV i RV of Fig. 20, Fig. 21, Fig. 22, or Fig. 23 i , or RV of Fig. 24 i,d It could be.

[0266] In some implementations, determining the transmission bits comprises: bit j0 within a codeword r_p, starting from a predetermined length E for the codeword r_p. r_p It may further include cyclically selecting as many bits as the codeword r_p is obtained by applying the second encoding to the r_p-th PCB among the P PCBs, where 0 ≤ r_p < P, and the bit j0 is the second redundancy version RV i can be decided based on.

[0267] In some implementations, the wireless transmission may be an uplink transmission. If the wireless transmission is an uplink transmission, the method or the operations may: receive control information for scheduling the uplink transmission.

[0268] In some implementations, the wireless transmission may be a downlink transmission. If the wireless transmission is a downlink transmission, the method or the operations may: transmit control information for scheduling the downlink transmission.

[0269] In some implementations, the control information is the second redundancy version RV i may contain information about.

[0270] In some implementations, the control information is the first redundancy version RV o may include more information about.

[0271] In some implementations, the method or the operations: the first redundancy version RV o The second redundancy version RV provided through the above control information i It can be set in the same way.

[0272] In some implementations, determining the transmission bits comprises: bit 0 within a codeword r_p and a predetermined length E for the codeword r_p. r_p It may further include cyclically selecting as many bits as possible, wherein the codeword r_p is obtained by applying the second encoding to the r_p-th PCB among the P PCBs, and wherein 0 ≤ r_p < P.

[0273] As described above, the examples disclosed in this specification are provided to enable those skilled in the art to implement and practice the disclosure. While the examples have been described above with reference to the examples of this specification, those skilled in the art will appreciate that various modifications and variations may be made to the examples of this specification. Accordingly, this disclosure is not intended to be limited to the examples described herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

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

Claims

1. C based on transport blocks d Obtain dog data code blocks (DCBs); C above d Perform a first encoding on the dog DCBs to obtain the outer parity bits; C based on the above external parity bits p Determine the parity code blocks (PCBs); 1st Redundancy Version RV o Based on the above C p Determine P PCBs among the dog PCBs; C above d (C) obtained by applying the second encoding to each of the P DCBs and the above P PCBs d Determine the transmission bits from each of the (P + P) codewords; and Comprising performing a wireless transmission including the above transmission bits, Determining the above P PCBs: C above p Starting from PCB p among the dog PCBs, it includes cyclically selecting the P PCBs, where 0 ≤ p < C. p and the PCB p is the first redundancy version RV o is determined based on, Determining the above transmission bits: A predetermined length E for the r_i-th inner codeword starting from bit i0 within the codeword r_i r_i It includes cyclically selecting as many bits as the codeword r_i of the C d It is obtained by applying the second encoding to the r_i-th DCB among the dog DCBs, where 0 ≤ r_i < C d , and the above bit i0 is the second redundancy version RV i is determined based on, method.

2. In paragraph 1, Determining the above transmission bits: Within the codeword r_p, starting from bit 0, a predetermined length E for the codeword r_p r_p Further comprising cyclically selecting as many bits as the codeword r_p is obtained by applying the second encoding to the r_p-th PCB among the P PCBs, wherein 0 ≤ r_p < P. method.

3. In paragraph 1, Determining the above transmission bits: Within the codeword r_p, a predetermined length E for the codeword r_p starting from bit j0 r_p Further comprising cyclically selecting as many bits as the codeword r_p is obtained by applying the second encoding to the r_p-th PCB among the P PCBs, where 0 ≤ r_p < P, and the bit j0 is the second redundancy version RV i is determined based on, method.

4. In paragraph 1, Further comprising receiving control information for scheduling the uplink transmission based on the above wireless transmission being an uplink transmission, The above control information is the second redundancy version RV i Contains information about, method.

5. In paragraph 4, The above control information is the first redundancy version RV o including more information about, method.

6. In paragraph 4, The above first redundancy version RV o Silver is the second redundancy version RV i is determined to be the same as, method.

7. In paragraph 1, Further comprising transmitting control information for scheduling the downlink transmission based on the above wireless transmission being a downlink transmission, The above control information is the second redundancy version RV i Contains information about, method.

8. In paragraph 7, The above control information is the first redundancy version RV o including more information about, method.

9. In paragraph 7, The above first redundancy version RV o Silver is the second redundancy version RV i is determined to be the same as, method.

10. At least one transmitter / receiver; 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, said operations comprising: C based on transport blocks d Obtain dog data code blocks (DCBs); C above d Perform a first encoding on the dog DCBs to obtain the outer parity bits; C based on the above external parity bits p Determine the parity code blocks (PCBs); 1st Redundancy Version RV o Based on the above C p Determine P PCBs among the dog PCBs; C above d (C) obtained by applying the second encoding to each of the P DCBs and the above P PCBs d Determine the transmission bits from each of the (P + P) codewords; Comprising performing a wireless transmission including the above transmission bits, Determining the above P PCBs: C above p Starting from PCB p among the dog PCBs, it includes cyclically selecting the P PCBs, where 0 ≤ p < C. p and the PCB p is the first redundancy version RV o is determined based on, Determining the above transmission bits: A predetermined length E for the r_i-th inner codeword starting from bit i0 within the codeword r_i r_i It includes cyclically selecting as many bits as the codeword r_i of the C d It is obtained by applying the second encoding to the r_i-th DCB among the dog DCBs, where 0 ≤ r_i < C d , and the above bit i0 is the second redundancy version RV i is determined based on, machinery and tools.

11. 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, said operations comprising: C based on transport blocks d Obtain dog data code blocks (DCBs); C above d Perform a first encoding on the dog DCBs to obtain the outer parity bits; C based on the above external parity bits p Determine the parity code blocks (PCBs); 1st Redundancy Version RV o Based on the above C p Determine P PCBs among the dog PCBs; C above d (C) obtained by applying the second encoding to each of the P DCBs and the above P PCBs d Determine the transmission bits from each of the (P + P) codewords; Comprising performing a wireless transmission including the above transmission bits, Determining the above P PCBs: C above p Starting from PCB p among the dog PCBs, it includes cyclically selecting the P PCBs, where 0 ≤ p < C. p and the PCB p is the first redundancy version RV o is determined based on, Determining the above transmission bits: A predetermined length E for the r_i-th inner codeword starting from bit i0 within the codeword r_i r_i It includes cyclically selecting as many bits as the codeword r_i of the C d It is obtained by applying the second encoding to the r_i-th DCB among the dog DCBs, where 0 ≤ r_i < C d , and the above bit i0 is the second redundancy version RV i is determined based on, Processing unit.

12. Store at least one program code comprising instructions that, when executed, cause at least one processor to perform operations, said operations comprising: C based on transport blocks d Obtain dog data code blocks (DCBs); C above d Perform a first encoding on the dog DCBs to obtain the outer parity bits; C based on the above external parity bits p Determine the parity code blocks (PCBs); 1st Redundancy Version RV o Based on the above C p Determine P PCBs among the dog PCBs; C above d (C) obtained by applying the second encoding to each of the P DCBs and the above P PCBs d Determine the transmission bits from each of the (P + P) codewords; Comprising performing a wireless transmission including the above transmission bits, Determining the above P PCBs: C above p Starting from PCB p among the dog PCBs, it includes cyclically selecting the P PCBs, where 0 ≤ p < C. p and the PCB p is the first redundancy version RV o is determined based on, Determining the above transmission bits: A predetermined length E for the r_i-th inner codeword starting from bit i0 within the codeword r_i r_i It includes cyclically selecting as many bits as the codeword r_i of the C d It is obtained by applying the second encoding to the r_i-th DCB among the dog DCBs, where 0 ≤ r_i < C d , and the above bit i0 is the second redundancy version RV i is determined based on, A computer-readable, non-transitory storage medium.

Images