Method and apparatus for determining transport block size in a communication or broadcast system

Abstract

This disclosure relates to communication technologies and systems that integrate 5G communication systems, which support higher data transmission rates than 4G systems, with IoT technologies. Based on 5G communication technologies and IoT-related technologies, this disclosure can be applied to smart services such as smart homes, smart buildings, smart cities, smart or connected cars, healthcare, digital education, retail, and safety and security services. The present invention also discloses a method and apparatus for determining the size of a transport block in a communication or broadcasting system.

Description

[0001] This application is a divisional application of the invention patent application with application date of September 6, 2018 and application number 201880065924.6. Technical Field

[0002] The present disclosure relates to a method and apparatus for determining the size of a transport block in a communication or broadcast system. Background Art

[0003] To meet the increasing demand for wireless data services since the commercialization of 4G communication systems, efforts have been made to develop improved 5G communication systems or quasi-5G communication systems. Therefore, 5G communication systems or quasi-5G communication systems are also called beyond-4G network communication systems or post-LTE systems.

[0004] To achieve high data transmission rates, 5G communication systems are being considered for implementation in the millimeter wave (mmWave) band (e.g., the 60 GHz band). In 5G communication systems, technologies such as beamforming, massive MIMO, full-dimensional MIMO (FD-MIMO), array antennas, analog beamforming, and massive antennas are being discussed as a means of mitigating propagation path loss and increasing propagation transmission distance in the mmWave band.

[0005] In addition, 5G communication systems have developed technologies such as evolved small cells, advanced small cells, cloud radio access networks (cloud RAN), ultra-dense networks, device-to-device (D2D) communication, wireless backhaul, mobile networks, collaborative communications, coordinated multipoint (CoMP), and interference cancellation to improve system networks.

[0006] In addition, 5G systems have developed advanced coding modulation (ACM) schemes such as hybrid FSK and QAM modulation (FQAM) and sliding window superposition coding (SWSC), as well as advanced access technologies such as filter bank multi-carrier (FBMC), non-orthogonal multiple access (NOMA), and sparse code multiple access (SCMA).

[0007] At the same time, the Internet has evolved from a human-centric connected network where people generate and consume information to the Internet of Things (IoT), where distributed components such as objects exchange and process information. The Internet of Everything (IoE) has emerged, combining big data processing technologies with IoT technologies through connections to cloud servers and the like. Implementing the IoT requires technological factors such as sensing, wired / wireless communications, network infrastructure, service interface technologies, and security technologies. Recently, research has been conducted on technologies for connecting objects, such as sensor networks, machine-to-machine (M2M) communications, and machine-type communications (MTC). In the IoT environment, by collecting and analyzing data generated by connected objects, intelligent Internet Technology (IT) services can be provided that create new value for people's lives. The IoT can be applied to fields such as smart homes, smart buildings, smart cities, smart cars, connected vehicles, smart grids, healthcare, smart appliances, and high-tech medical services through the convergence of traditional information technology (IT) and various industries.

[0008] Therefore, various attempts have been made to apply 5G communications to IoT networks. For example, 5G communication technologies such as sensor networks, machine-to-machine (M2M) communications, and machine-type communications (MTC) are implemented using beamforming, MIMO, and array antenna technologies. The application of cloud RAN as a big data processing technology can be an example of the convergence of 5G and IoT technologies.

[0009] In communication and broadcasting systems, link performance can be significantly degraded due to various types of channel noise, fading phenomena, and intersymbol interference (ISI). Therefore, in order to realize high-speed digital communication and broadcasting systems that require high data throughput and high reliability, such as those used for next-generation mobile communications, digital broadcasting, and mobile Internet, it is necessary to develop a technology that removes noise, fading, and intersymbol interference. As part of the research on denoising, error correction codes have recently been actively studied with the goal of realizing a method for improving the reliability of communication by efficiently reconstructing the distortion of information. Summary of the Invention

[0010] Technical issues

[0011] The present disclosure provides a method and apparatus for determining a transport block size (TBS), which is the size of a transport block (TB) by which data can be efficiently transmitted using characteristics of a low-density parity-check (LDPC) code.

[0012] Technical Solution

[0013] According to one aspect of the present disclosure, a method for identifying a transport block size (TBS) by a terminal in a wireless communication system is provided. The method includes: receiving control information for scheduling from a base station; identifying the number of temporary information bits based on the control information for scheduling; identifying the TBS based on the control information for scheduling and the number of temporary information bits; and decoding received downlink data based on the identified TBS, wherein the TBS is a multiple of 8 and the number of temporary code blocks (CBs) identified based on the control information for scheduling.

[0014] If the code rate identified based on the scheduling information is equal to or less than 0.25 and the number of temporary information bits is N, then Identify the number of temporary CBs. If the code rate identified based on the scheduling information is greater than 0.25 and the number of temporary information bits is N greater than 8424, then Identifies the number of temporary CBs.

[0015] According to another aspect of the present disclosure, a method for identifying a transport block size (TBS) by a base station in a wireless communication system is provided. The method includes: identifying control information for scheduling; transmitting the control information for scheduling to a terminal; identifying the number of temporary information bits based on the control information for scheduling; identifying the TBS based on the control information for scheduling and the number of temporary information bits; and transmitting downlink data based on the identified TBS, wherein the TBS is a multiple of 8 and the number of temporary code blocks (CBs) identified based on the control information for scheduling.

[0016] According to another aspect of the present disclosure, a terminal for identifying a transport block size (TBS) in a wireless communication system is provided. The terminal includes: a transceiver; and a controller configured to perform control to receive control information for scheduling from a base station, identify the number of temporary information bits based on the control information for scheduling, identify the TBS based on the control information for scheduling and the number of temporary information bits, and decode received downlink data based on the identified TBS, the controller being connected to the transceiver, wherein the TBS is a multiple of 8 and the number of temporary code blocks (CBs) identified based on the control information for scheduling.

[0017] Advantageous Effects of the Invention

[0018] The present disclosure provides a method and apparatus for efficiently transmitting and receiving data by determining a TBS, which is the size of a TB, by minimizing addition of unnecessary bits using characteristics of an LDPC code, allocated resources, and a code rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] Figure 1The structure of downlink transmission in the time-frequency domain of the LTE or LTE-A system is shown;

[0020] Figure 2 The structure of transmission in the uplink time-frequency domain of the LTE or LTE-A system is shown;

[0021] Figure 3 The basic structure of the mother matrix (or basic graph) of the LDPC code is shown;

[0022] Figure 4 is a block diagram illustrating a receiving process of a terminal;

[0023] Figure 5 A method of segmenting a transport block (TB) into code blocks is shown;

[0024] Figure 6 is a flow chart illustrating the operation of a base station and a terminal implementing some embodiments of the present disclosure;

[0025] Figure 7 is a block diagram illustrating a structure of a terminal according to an embodiment of the present disclosure; and

[0026] Figure 8 is a block diagram illustrating a structure of a base station according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0027] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the accompanying drawings.

[0028] When describing the exemplary embodiments of the present disclosure, descriptions related to technical contents that are well-known in the field to which the present disclosure belongs and are not directly related to the present disclosure will be omitted. Such omission of unnecessary descriptions is intended to prevent the main idea of the present disclosure from being obscured and to convey the main idea more clearly.

[0029] For the same reason, in the accompanying drawings, some elements may be exaggerated, omitted or schematically shown. In addition, the size of each element does not fully reflect the actual size. In the accompanying drawings, the same or corresponding elements have the same reference numerals.

[0030] The advantages and features of the present disclosure and the manner in which they are achieved will become apparent by reference to the embodiments described in detail below in conjunction with the accompanying drawings. However, the present disclosure is not limited to the embodiments set forth below, but may be implemented in various forms. The following embodiments are provided solely to fully disclose the present disclosure and to inform those skilled in the art of the scope of the present disclosure, and the present disclosure is limited only by the scope of the appended claims. Throughout the specification, identical or similar reference numerals represent identical or similar elements.

[0031] Here, it should be understood that each block of the flowchart diagram and the combination of blocks in the flowchart diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device create a device for implementing the functions specified in the (multiple) flowchart blocks. These computer program instructions can also be stored in a computer-usable or computer-readable memory, which can direct the computer or other programmable data processing device to operate in a specific manner so that the instructions stored in the computer-usable or computer-readable memory produce an article of manufacture including an instruction device that implements the functions specified in the (multiple) flowchart blocks. The computer program instructions can also be loaded onto a computer or other programmable data processing device to cause a series of operating steps to be performed on the computer or other programmable device, thereby producing a computer-implemented process, so that the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in the (multiple) flowchart blocks.

[0032] And each block of the flowchart diagram can represent a module, segment or portion of code, which includes one or more executable instructions for implementing (a plurality of) specified logical functions. It should also be noted that in some alternative embodiments, the functions marked in the blocks may not occur in sequence. For example, depending on the functions involved, two blocks shown in succession can actually be executed substantially simultaneously, or the blocks can sometimes be executed in reverse order.

[0033] As used herein, "unit" refers to a software element or hardware element that performs a predetermined function, such as a Field Programmable Gate Array (FPGA) or an Application Specific Integrated Circuit (ASIC). However, "unit" does not always have the meaning of being limited to software or hardware. A "unit" can be constructed to be stored in an addressable storage medium or to execute one or more processors. Therefore, a "unit" includes, for example, software elements, object-oriented software elements, class elements or task elements, processes, functions, attributes, procedures, subroutines, program code segments, drivers, firmware, microcodes, circuits, data, databases, data structures, tables, arrays, and parameters. The elements and functions provided by a "unit" can be combined into fewer elements, "units," or divided into more elements, "units." In addition, elements and "units" can be implemented to reproduce one or more CPUs in a device or a secure multimedia card. And, in an embodiment, a "unit" can include one or more processors.

[0034] Wireless communication systems have evolved into broadband wireless communication systems that provide high-speed and high-quality packet data services in addition to voice-based services provided in the initial stage according to communication standards (for example, 3GPP's High-Speed Packet Access (HSPA), Long Term Evolution (LTE) or Evolved Universal Terrestrial Radio Access (E-UTRA), Advanced LTE (LTE-A), LTE-Pro, 3GPP2's High-Rate Packet Data (HRPD), Ultra-Mobile Broadband (UMB), and IEEE's 802.16e, etc.).

[0035] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the accompanying drawings. In the following description of the present disclosure, detailed descriptions of known functions or configurations incorporated herein will be omitted when this may make the subject matter of the present disclosure quite unclear. The terms described below are defined in consideration of the functions in the present disclosure and may vary depending on the user, user intent, or custom. Therefore, the definition of the terms should be made based on the content of the entire specification.

[0036] Hereinafter, a base station (BS) is an entity that allocates resources to a terminal and may be one of a gNode B, an eNode B, a Node B, a radio access unit, a base station controller, and a node on a network. A terminal may include a user equipment (UE), a mobile station (MS), a cellular phone, a smart phone, a computer, and a multimedia system capable of performing a communication function. In the present disclosure, a downlink (DL) refers to a wireless transmission path for a signal transmitted from a base station to a terminal, and an uplink (UL) refers to a wireless transmission path for a signal transmitted from a terminal to a base station.

[0037] Hereinafter, the embodiments of the present disclosure are described based on an LTE or LTE-A system (hereinafter referred to as an LTE system) by way of example, but the embodiments of the present disclosure may also be applied to other communication systems having similar backgrounds or channel forms. For example, the fifth generation mobile communication technology (5G, New Radio, and NR) developed after LTE-A may be included therein. The embodiments of the present disclosure may be applied to other communication systems by modification based on the determination of those skilled in the art without departing from the scope of the present disclosure.

[0038] The LTE system, a representative example of a broadband wireless communication system, employs an orthogonal frequency division multiplexing (OFDM) scheme for the downlink (DL) and a single-carrier frequency division multiple access (SC-FDMA) scheme for the uplink (UL). In this multiple access scheme, time-frequency resources used to carry data or control information are allocated and operated in a manner that avoids resource overlap. In other words, orthogonality is established between users so that data or control information for each user can be identified.

[0039] When decoding fails during initial transmission, the LTE system uses Hybrid Automatic Repeat Request (HARQ) to retransmit the corresponding data at the physical layer. In the HARQ scheme, if the receiver cannot correctly decode the data, it sends a negative acknowledgement (NACK) to notify the transmitter of the decoding failure, allowing the transmitter to retransmit the corresponding data at the physical layer. The receiver improves data reception performance by combining the data retransmitted by the transmitter with the data that failed to be decoded. Alternatively, if the receiver correctly decodes the data, it sends an acknowledgment (ACK) notifying the transmitter of the successful decoding, prompting the transmitter to send new data.

[0040] Figure 1 FIG. 4 shows the basic structure of the time-frequency domain, which is the downlink radio resource region in the LTE system.

[0041] exist Figure 1 In FIG, the horizontal axis indicates the time domain and the vertical axis indicates the frequency domain. The minimum transmission unit in the time domain is an OFDM symbol. A time slot 106 consists of N symb OFDM symbols 102, and a subframe 105 consists of 2 time slots. The length of a time slot is 0.5ms (milliseconds), and the length of a subframe is 1.0ms. A radio frame 114 is a time domain interval consisting of 10 subframes. In the frequency domain, the minimum transmission unit is a subcarrier. The bandwidth of the entire system transmission band consists of a total of N BW It consists of 104 subcarriers.

[0042] The basic unit of resources in the time-frequency domain is a resource element (RE) 112, and can be indicated by an OFDM symbol index and a subcarrier index tu. A resource block (RB or physical resource block (PRB)) 108 consists of N symb consecutive OFDM symbols 102 and N in the frequency domain RB Therefore, one RB 108 includes N consecutive subcarriers 110. symb ×N RB RE 112. Usually, the minimum transmission unit of data is RB unit. Usually, in LTE system, N symb =7 and N RB =12. NBW Proportional to the system transmission bandwidth. The data rate increases in proportion to the number of RBs scheduled in the terminal.

[0043] In the LTE system, six transmission bandwidths are defined and operated. In the case of a frequency division duplex (FDD) system that divides the downlink and uplink according to frequency, the downlink transmission bandwidth and the uplink transmission bandwidth may be different from each other. The channel bandwidth may indicate the RF bandwidth, which corresponds to the system transmission bandwidth. The [Table 1] provided below indicates the relationship between the system transmission bandwidth and the channel bandwidth defined in the LTE system. For example, when the LTE system has a channel bandwidth of 10 MHz, the transmission bandwidth may include 50 RBs.

[0044] [Form 1]

[0045]

[0046] Downlink control information (DCI) is transmitted within the first N OFDM symbols in a subframe. Typically, N = {1, 2, 3}. Therefore, N changes in each subframe depending on the amount of control information that should be sent in the current subframe. This control information includes a control channel transmission interval indicator (CTI) indicating how many OFDM symbols are used to transmit control information, scheduling information for downlink or uplink data, and HARQ ACK / NACK signals.

[0047] In the LTE system, scheduling information for downlink data or uplink data is sent from the base station to the terminal via downlink control information. DCI is defined in various formats. Depending on whether the DCI is scheduling information for uplink data (UL grant) or scheduling information for downlink data (DL grant), whether the DCI is a compact DCI with small-size control information, whether the DCI applies spatial multiplexing using multiple antennas, and whether the DCI is a DCI for power control, the determined DCI format is applied and operated. For example, DCI format 1 indicating scheduling control information (DL grant) for downlink data can be configured as at least one of the following control information.

[0048] - Resource Allocation Type 0 / 1 Flag: Indicates whether the resource allocation type is Type 0 or Type 1. Type 0 applies a bitmap scheme and allocates resources in units of Resource Block Groups (RBGs). In the LTE system, the basic scheduling unit is a Resource Block (RB), which is represented by time and frequency domain resources. In Type 0, an RBG includes multiple RBs and is used as the basic scheduling unit. Type 1 allows allocation of predetermined RBs within an RBG.

[0049] - Resource Block Allocation: Indicates the RBs allocated for data transmission. The indicated resources are determined by the system bandwidth and resource allocation type.

[0050] Modulation and Coding Scheme (MCS): Indicates the modulation scheme used for data transmission and the size of the transport block (ie, the data to be sent).

[0051] -HARQ process number: indicates the HARQ process number.

[0052] - New Data Indicator: indicates HARQ initial transmission or HARQ retransmission.

[0053] - Redundancy Version (RV): indicates the redundancy version of HARQ.

[0054] Transmit Power Control (TPC) Command for Physical Uplink Control Channel (PUCCH): Indicates the transmit power control command for PUCCH, which is an uplink control channel.

[0055] DCI is transmitted via the physical downlink control channel (PDCCH) or enhanced PDCCH (EPDCCH), which is a downlink physical control channel, through a channel coding and modulation process. Hereinafter, PDCCH transmission / reception or EPDCCH transmission / reception may be understood as DCI transmission / reception on the PDCCH or EPDCCH. Hereinafter, such techniques may be applied to other channels.

[0056] Typically, each independent PDCCH is configured and transmitted using a specific radio network temporary identifier (RNTI) (or terminal identifier) for each terminal, scrambled, a cyclic redundancy check (CRC) is added, and channel coding is performed. In the time domain, the PDCCH is mapped and transmitted during the control channel transmission interval. The mapping position of the PDCCH in the frequency domain is determined by the identifier (ID) of each terminal and is propagated across the entire system transmission band.

[0057] Downlink data is transmitted via the Physical Downlink Shared Channel (PDSCH), which is a physical downlink data channel. The PDSCH is transmitted after the control channel transmission interval, and detailed mapping information in the frequency region and scheduling information such as the modulation scheme can be known through the DCI, which is transmitted via the PDCCH.

[0058] The base station can report the modulation scheme applied to the PDSCH to be transmitted to the terminal and the size of the data to be transmitted (transport block size (TBS)) through the MCS formed by 5 bits in the control information included in the DCI. The TBS corresponds to the size before channel coding for error correction is applied to the data to be transmitted by the base station (i.e., transport block).

[0059] The modulation schemes supported by the LTE system include Quadrature Phase Shift Keying (QPSK), 16-QAM (16QAM), and 64QAM. The modulation orders correspond to 2, 4, and 6, respectively. That is, in QPSK modulation, the base station can transmit 2 bits per symbol, in 16QAM modulation, the base station can transmit 4 bits per symbol, and in 64QAM modulation, the base station can transmit 6 bits per symbol.

[0060] Figure 2 FIG. 4 shows the basic structure of the time-frequency domain, which is the uplink radio resource domain in the LTE system.

[0061] refer to Figure 2 , the horizontal axis indicates the time domain and the vertical axis indicates the frequency domain. The minimum transmission unit in the time domain is the SC-FDM symbol, and one time slot 206 consists of N symb SC-FDMA symbols 202. One subframe 205 includes two time slots. The minimum transmission unit in the frequency domain is a subcarrier, and the entire system transmission band (transmission bandwidth) consists of a total of N BW N subcarriers 204. BW Has a value proportional to the system transmission bandwidth.

[0062] The basic unit of resources in the time-frequency domain is a resource element (RE) 212, which can be defined by an SC-FDMA symbol index and a subcarrier index. A resource block (RB) 208 consists of N symb consecutive SC-FDMA symbols and N in the frequency domain BW Therefore, one RB is defined by N consecutive subcarriers. symb ×N RB The PUCCH is mapped to the frequency domain corresponding to one RB and can be transmitted during one subframe.

[0063] In the LTE system, the timing relationship of the PUCCH or the Physical Uplink Shared Channel (PUSCH), which is an uplink physical channel through which HARQ ACK / NACK is transmitted, is defined, wherein the HARQ ACK / NACK corresponds to the PDSCH, which is a physical channel for downlink data transmission, or the PDCCH or EPDCCH including a semi-persistent scheduling release (SPS release). For example, in an LTE system operating in FDD mode, the HARQ ACK / NACK corresponding to the PDSCH transmitted in the n-4th subframe or the PDCCH or EPDCCH including an SRS release is transmitted in the nth subframe.

[0064] In the LTE system, downlink HARQ employs an asynchronous HARQ scheme in which the timing of data retransmission is not fixed. Specifically, if a base station receives HARQ NACK feedback from a terminal for data originally transmitted by the base station, the base station freely determines the timing of retransmitting the retransmitted data through scheduling. For HARQ operations, the terminal buffers data determined to be erroneous based on the results of decoding received data, and then combines this data with subsequently retransmitted data.

[0065] If the terminal receives a PDSCH including downlink data transmitted from the base station in subframe n, the terminal transmits uplink control information including HARQ ACK or NACK for the downlink data to the base station via the PUCCH or PUSCH in subframe n+k. In this case, k is defined differently depending on whether the LTE system adopts FDD or time division duplex (TDD) and its subframe configuration. For example, in the case of an FDD LTE system, k is fixed to 4. Meanwhile, in the case of a TDD LTE system, k can be changed according to the subframe configuration and subframe number.

[0066] In the LTE system, unlike downlink HARQ, uplink HARQ adopts a synchronous HARQ scheme, in which the timing of data transmission is fixed. Specifically, the uplink / downlink timing relationship between the PUSCH (physical channel for uplink data transmission), the PDCCH (preceding downlink control channel), and the PHICH (physical channel for transmitting downlink HARQ ACK / NACK corresponding to the PUSCH) is fixed according to the following rules.

[0067] If the terminal receives a PDCCH containing uplink scheduling control information sent from the base station or a PHICH for transmitting downlink HARQ ACK / NACK in subframe n, the terminal transmits uplink data corresponding to the control information via the PUSCH in subframe n+k. At this time, k is defined differently depending on whether the LTE system adopts FDD or TDD and its configuration. For example, in the case of an FDD LTE system, k is fixed to 4. Meanwhile, in the case of a TDD LTE system, k can be changed according to the subframe configuration and subframe number.

[0068] Furthermore, if a terminal receives a PHICH carrying a downlink HARQ ACK / NACK from a base station in subframe i, the PHICH corresponds to the PUSCH transmitted by the terminal in subframe (ik). In this case, k is defined differently depending on whether the LTE system adopts FDD or TDD and its configuration. For example, in an FDD LTE system, k is fixed to 4. Meanwhile, in a TDD LTE system, k may vary depending on the subframe configuration and subframe number.

[0069] Furthermore, when data is transmitted through multiple carriers, k may be applied differently according to the TDD configuration of each carrier.

[0070] [Form 2]

[0071]

[0072]

[0073]

[0074] Table 2 above shows the supported DCI formats for each transmission mode under the conditions set by the C-RNTI in 3GPP TS 36.213. The terminal assumes that the corresponding DCI format exists in the control region interval according to the preset transmission mode and performs search and decoding. For example, if transmission mode 8 is specified to the terminal, the terminal searches for DCI format 1A in the common search space and the UE-specific search space, and searches for DCI format 2B only in the UE-specific search space.

[0075] The description of the wireless communication system is provided from the perspective of the LTE system, but the present disclosure is not limited to the LTE system and can be applied to various wireless communication systems such as NR, 5G, etc. In addition, if the present embodiment is applied to other wireless communication systems, k can be changed and applied to a system using a modulation scheme corresponding to FDD.

[0076] The present disclosure provides a method and apparatus for transmitting coded bits that can support various input lengths and code rates. Furthermore, the present disclosure provides a method for configuring a base graph of an LDPC code for data channel transmission, and a method and apparatus for segmenting a transport block (TB) using an LDPC code.

[0077] Subsequently, a low-density parity-check (LDPC) code will be described.

[0078] The LDPC code is a type of linear block code, and a process of determining a codeword that satisfies conditions such as the following [Equation 1] is included.

[0079] [Equation 1]

[0080]

[0081] In [Equation 1], In [Equation 1], H represents the parity check matrix, C represents the codeword, and c i represents the i-th bit of the codeword, and N ldpc Indicates the LDPC codeword length. Here, h i Denotes the i-th column of the parity check matrix (H).

[0082] The parity check matrix H consists of N ldpc Column, the N ldpc The same as the number of bits of the LDPC codeword. [Equation 1] means that the i-th column (h i ) and the i-th codeword bit c i The sum of the products is "0", so the i-th column (h i ) and the i-th codeword bit c i associated.

[0083] For parity check matrices used in communication and broadcasting systems, a quasi-cyclic LDPC code (QC-LDPC code, or hereinafter referred to as a QC-LDPC code) using a quasi-cyclic parity check matrix is frequently used for ease of implementation.

[0084] The QC-LDPC code is characterized by including a parity check matrix having a 0 matrix (zero matrix) or a cyclic permutation matrix in the form of a small square matrix.

[0085] As shown in the following [Equation 2], the permutation matrix P of size ZXZ is P=P(P ij ) is defined.

[0086] [Equation 2]

[0087]

[0088] In [Equation 2], P ij (0 ≤ i, j < Z) is an element (entry) in the i-th row and j-th column of the matrix P. Based on 0 ≤ i < Z for the above permutation matrix, it can be noted that P is a cyclic permutation matrix obtained by cyclically shifting each element of the identity matrix of size Z×Z to the right by i.

[0089] The parity-check matrix H of the simplest QC-LDPC code can be indicated as shown in the following [Table 3].

[0090] [Equation 3]

[0091]

[0092] If P -1 is defined as a 0 matrix of size Z×Z, then each exponent a ij of the cyclic permutation matrix or 0 matrix has a value in {-1, 0, 1, 2,..., Z - 1}. Furthermore, it can be noted that the parity-check matrix H of [Equation 3] is of size mZ×nZ because it has n column blocks and m row blocks.

[0093] Generally, a binary matrix of size m×n obtained by replacing the cyclic permutation matrix and 0 matrix in the parity-check matrix of the above [Equation 3] with 1 and 0 is determined as the mother matrix (or fundamental graph) of the parity-check matrix, and as shown in the following [Equation 4], an integer matrix of size m×n obtained by only selecting the exponents of the cyclic permutation matrix or 0 matrix is determined as the exponent matrix E(H) of the parity-check matrix H.

[0094] [Equation 4]

[0095]

[0096] Meanwhile, the performance of the LDPC code can be determined according to the parity-check matrix. Therefore, it is necessary to design an efficient parity-check matrix for LDPC codes with excellent performance. In addition, LDPC encoding and decoding methods that support various input lengths and code rates are required.

[0097] Use the method of lifting, which is known as an effective design for QC-LDPC codes. Lifting is a method of effectively designing a very large parity-check matrix by configuring the Z value that determines the size of the cyclic permutation matrix or 0 matrix from a given small mother matrix according to specific rules. The traditional lifting method and the characteristics of the QC-LDPC codes designed by the lifting are briefly described below.

[0098] If an LDPC code C0 is given, the S QC-LDPC codes to be designed by the lifting method are C1, C2, ..., C k ,...,C S (Similarly, for C k For 1≤k≤S), QC-LDPC code C k The parity check matrix is H k , and the value corresponding to the size of the row block and column block of the permutation matrix included in the parity check matrix is Z k . C0 corresponds to the matrix with mother matrix C1,..., and C S As the minimum LDPC code of the parity check matrix, the Z0 value corresponding to the size of the row block and column block is 1, and for Z k <Z k+1 For convenience, each code C k The parity check matrix H k With an exponential matrix E(H k ))=a i , j (k) And the values {-1,0,1,2,...,Z k -1} is chosen as each index a i , j (k ). The promotion includes steps C0→C1→...→C S , and is characterized by Z k+ 1=q k+1 Z k (q k+1 is a positive integer, k=0,1,...,S-1). If due to the characteristics of the lifting process, only C S The parity check matrix H S are stored, then the following [Equation 5] or [Equation 6] can be used according to the lifting method to indicate all QC-LDPC codes C0, C1, ..., C S .

[0099] [Equation 5]

[0100]

[0101] [Equation 6]

[0102] E(H k )=E(H s )modZ k

[0103] [Equation 7] is the most general representation of the method.

[0104] [Equation 7]

[0105] P i ,j=f(V i ,j,Z)

[0106] In [Equation 7], f(x, y) is a predetermined function having x and y as input values. i , j is the code corresponding to the maximum LDPC code (for example, C in the above description). S The elements of the i-th row and j-th column of the exponential matrix of the corresponding parity check matrix. ij is corresponding to an LDPC code having a predetermined size (for example, C in the above description). k The elements of the i-th row and j-th column of the exponential matrix of the corresponding) parity check matrix, and Z is the size of the row block and column block of the circulant matrix included in the parity check matrix of the corresponding LDPC code. Therefore, if V i , j is defined, a parity check matrix for an LDPC code having a predetermined size may be defined.

[0107] In the description of the present disclosure to be provided later, the above-mentioned symbols are named, defined, and used as follows.

[0108] [Definition 1]

[0109] E(H S ): Maximum exponential matrix

[0110] V i , j : Maximum exponential matrix element (with E(H S ) corresponds to the (i,j)th element of

[0111] The above-defined maximum exponent matrix or a maximum exponent matrix element may be used to indicate a parity check matrix for a predetermined LDPC code.

[0112] In the next generation mobile communication system, there may be multiple maximum exponent matrices defined above to ensure the best performance of code blocks with various lengths. For example, there may be M different maximum exponent matrices, which can be shown in the following table.

[0113] [Equation 8]

[0114] E(H s )1,E(H s )2,...,E(H s ) M

[0115] There may be multiple corresponding maximum exponential matrix elements, which can be shown in the following table.

[0116] [Equation 9]

[0117] (V i，j )1,(V i，j )2,...,(V i，j ) M .

[0118] In [Equation 9], the maximum exponential matrix element (V i , j ) m Corresponding to the maximum exponential matrix E(H S ) m (i, j). Hereinafter, in the definition of the parity check matrix for the LDPC code, the maximum exponent matrix defined above will be used and described. This can be applied in the same manner as the representation using the maximum exponent matrix element.

[0119] The turbo code-based code block segmentation and CRC addition method in the document of LTE TS 36.213 is referenced below.

[0120] 5.1.2 Code Block Segmentation and Code Block CRC Addition

[0121] The input bit sequence for code block segmentation is denoted as b0,b1,b2,b3,...,b B-1 , where B>0. If B is greater than the maximum code block length Z, the input bit sequence is segmented and an additional CRC sequence of L=24 bits is added to each code block. The maximum code block size is:

[0122] -Z=6144.

[0123] If the number of padding bits calculated below is not 0, the padding bits are added at the beginning of the first block.

[0124] Note that if B<40, the padding bits are added directly at the beginning of the code block.

[0125] At the input of the encoder, the padding bits should be set to <null>.

[0126] The total number of code blocks C is determined by the following steps:

[0127]

[0128]

[0129] For the case of C≠0, the bits output from code block segmentation are denoted as c r0 ,c r1 ,c r2 ,c r3 ,..., Where r is the code block number, and K r is the number of bits used for code block number r.

[0130] The number of bits in each code block (only applies when C≠0):

[0131] The first segmentation size K + = the minimum K that satisfies C·K≥B′ in Table 5.1.3-3 in LTE TS 36.213.

[0132]

[0133] Number of padding bits: F = C + ·K + +C _ ·K _ -B′

[0134]

[0135]

[0136] Unlike LTE systems, 5G and next-generation communication systems use LDPC codes in data channels. Even when LDPC codes are used, a transport block can be divided into multiple code blocks, and some of these code blocks can form a code block group. Furthermore, the number of code blocks in each code block group can be the same or different. Bit-based interleaving can be applied to individual code blocks, code block groups, or transport blocks.

[0137] Figure 3 The basic structure of the mother matrix (or basic graph) of the LDPC code is shown.

[0138] exist Figure 3 In the present invention, two basic structures of a basic graph 300 of an LDPC code supporting data channel coding are generally supported by next-generation mobile communication systems. The first basic graph structure of the LDPC code is a matrix structure with a maximum vertical length 320 of 46 and a maximum horizontal length 318 of 68, while the second basic graph structure of the LDPC code is a matrix structure with a maximum vertical length 320 of 42 and a maximum horizontal length 318 of 52. The first basic graph structure of the LDPC code can support a code rate ranging from a minimum of 1 / 3 to a maximum of 8 / 9, while the second basic graph structure of the LDPC code can support a code rate ranging from a minimum of 1 / 5 to a maximum of 8 / 9.

[0139] Basically, an LDPC code can include six submatrix structures. The first submatrix structure 302 includes systematic bits. The second submatrix structure 304 is a square matrix and includes parity check bits. The third submatrix structure 306 is a zero matrix. The fourth submatrix structure 308 and the fifth submatrix structure 310 include parity check bits. The sixth submatrix structure 312 is the identity matrix.

[0140] In the first basic graph structure of the LDPC code, the horizontal length 322 of the first submatrix 302 is 22, and the vertical length 314 is 4 or 5. The horizontal length 324 and vertical length 314 of the second submatrix 304 are both 4 or 5. The horizontal length 326 of the third submatrix 306 is 42 or 41, and the vertical length 314 is 4 or 5. The vertical length 316 of the fourth submatrix 308 is 42 or 41, and the horizontal length 322 is 22. The horizontal length 324 of the fifth submatrix 310 is 4 or 5, and the vertical length 316 is 42 or 41. The horizontal length 326 and vertical length 316 of the sixth submatrix 312 are both 42 or 31.

[0141] In the second basic graph structure of the LDPC code, the horizontal length 322 of the first submatrix 302 has a value of 10, and the vertical length 314 has a value of 7. The horizontal length 324 and vertical length 314 of the second submatrix 304 have a value of 7. The horizontal length 326 of the third submatrix 306 has a value of 35, and the vertical length 314 has a value of 7. The vertical length 316 of the fourth submatrix 308 has a value of 35, and the horizontal length 322 has a value of 10. The horizontal length 324 of the fifth submatrix 310 has a value of 7, and the vertical length 316 has a value of 35. The horizontal length 326 and vertical length 316 of the sixth submatrix 312 have a value of 35.

[0142] In the first basic graph structure of the LDPC code, a supportable code block size is 22ХZ (Z = a×2j, and Z is shown in [Table 3] below. The maximum size of a supportable code block is 8448, and the minimum size of a supportable code block is 44. For reference, in [Table 3], part or all of (272, 304, 336, 368) may be additionally reflected as candidates for Z).

[0143] [Form 3]

[0144]

[0145]

[0146] In the first basic graph structure of the LDPC code, the size of one supportable code block is as follows.

[0147] 44, 66, 88, 110, 132, 154, 176, 198, 220, 242, 264, 286, 308, 330, 352, 296, 440, 484, 528, 572, 616, 660, 704, 792, 880, 968, 1056, 1144, 1232, 1320, 14 08, 1584, 1760, 1936, 2112, 2288, 2464, 2640, 2816, 3168, 3520, 3872, 4224, 4576, 4928, 5280, 5632, 6336, 7040, 7744, 8448, (5984, 6688, 7392, 8096)

[0148] Among the above sizes, (5984, 6688, 7392, 8096) may be additionally included.

[0149] Based on the first basic graph (BG#1) of the LDPC code, a total of M maximum exponential matrices are additionally defined Typically, M can have a value of 8 or a random natural value, and i has a value from 1 to M. Terminal use matrix Performs downlink data decoding or uplink data encoding. has specific element values shifted from the first base graph (BG#1) of the LDPC code. That is, the matrix Can have different shift values.

[0150] In the first basic graph structure of the LDPC code, a supportable code block size is 10ХZ (Z = ax 2j, and Z is as shown in Table 4 below. The maximum size of a supportable code block is 2560 (or 3840), and the minimum size of a supportable code block is 20. For reference, in [Table 4], some or all of (288, 272, 304, 320, 336, 352, 368, 384) may be additionally reflected as candidates for Z).

[0151] [Form 4]

[0152]

[0153]

[0154] In the second basic graph structure of the LDPC code, the size of one supportable code block is as follows. 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 180, 200, 220, 240, 260, 280, 300, 320, 360, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040, 1120, 1200, 1280, 1440, 1600, 1760, 1920, 2080, 2240, 2400, 2560 (2880, 3200, 3520, 3840, 2720, 3040, 3360, 3680)

[0155] In the above sizes, (2880, 3200, 3520, 3840, 2720, 3040, 3360, 3680) are values that may be additionally included.

[0156] Based on the second basic graph (BG#2) of LDPC code, a total of M maximum exponential matrices are additionally defined Typically, M can have a value of 8 or a random natural value, and i can have a value from 1 to M. Terminal Use Matrix Performs downlink data decoding or uplink data encoding. has specific element values shifted from the second base graph (BG#2) of the LDPC code. That is, the matrix Can have different shift values.

[0157] As mentioned above, two types of basic diagrams are provided in the next generation mobile communication system. Therefore, a specific terminal may support only the first basic diagram or the second basic diagram, or there may be terminals that support both basic diagrams. They are listed in [Table 5] shown below.

[0158] [Form 5]

[0159]

[0160] When receiving downlink data information from a base station through downlink control information, a terminal supporting type 1 determines that a basic map applied to a transport block including the downlink data information is always the first basic map, and sets the maximum index matrix When receiving downlink data information from a base station through downlink control information, a terminal supporting type 2 determines that the basic map applied to a transport block including the downlink data information is always the second basic map, and sets the maximum index matrix Applied to data encoding or decoding. When receiving downlink data information from a base station via downlink control information, a terminal supporting type 3 receives in advance from the base station the configuration of a basic graph applied to a transport block including the downlink data information via higher layer signaling (such as SIB, RRC, or MAC CE) or via downlink control information sent in a UE group common control channel, a UE (cell) common control channel, or a UE specific control channel. The downlink control information may be included together with the transport block scheduling information or separately.

[0161] Figure 4 is a block diagram illustrating a receiving process of a terminal according to an embodiment of the present disclosure.

[0162] exist Figure 4 In step 400, the terminal receives downlink control information through a UE (cell) common downlink control channel, a UE group common downlink control channel or a UE specific downlink control channel.

[0163] In step 410, the terminal determines whether the received downlink control information corresponds to one, or a combination of two or more of the following conditions.

[0164] A. RNTI scrambled in the CRC of the downlink control information

[0165] B. Transport Block Size Included in Downlink Control Information

[0166] C. Basic image indicator included in downlink control information

[0167] D. Scheduling-related values included in downlink control information

[0168] If the RNTI scrambled in the CRC of the downlink control information as condition A is an RNTI other than random access (RA)-RNTI, paging-RNTI (P-RNTI), system information (SI)-RNTI, single cell (SC)-RNTI or group-RNTI (G-RNTI) (for example, semi-persistent scheduling (SPS)-RNTI or cell RNTI (C-RNTI)), then in step 420, the terminal determines condition 1 and performs operation 1.

[0169] If the scrambled RNTI in the CRC of the downlink control information as condition A is RA-RNTI, P-RNTI, SI-RNTI, SC-RNTI, or G-RNTI, in step 430 , the terminal determines condition 2 and performs operation 2 .

[0170] If the size of the transport block included in the downlink control information as condition B and the CRC are greater than or equal to the predetermined threshold (Δ1), the terminal determines condition 1 and performs operation 1 in step 420.

[0171] If the size of the transport block included in the downlink control information as condition B and the CRC are equal to or smaller than the predetermined threshold (Δ2), the terminal determines condition 2 and performs operation 2 in step 430.

[0172] The threshold (Δ1) or the threshold (Δ2) may be fixed to 2560 (or 3840, 960, 1040, 1120, 170, 640 or a predetermined value). In addition, the threshold (Δ1) or the threshold (Δ2) may be the same as or different from each other.

[0173] Alternatively, the threshold (Δ1) or the threshold (Δ2) can be a value pre-configured by high-layer signaling (such as SIB, RRC or MAC CE), or a value configured by a UE group common downlink control channel, a UE common downlink control channel, or a UE specific downlink control channel. In this case, before the threshold (Δ) is configured, a value fixed to 2560 (or 3840, 960, 1040, 1120, 170, 640 or a predetermined value) can be used as a default threshold (Δ). The time point before the threshold (Δ1) or the threshold (Δ2) is configured refers to the time point before the terminal uses RA-RNTI, P-RNTI, SI-RNTI, SC-RNTI or G-RNTI to scramble the CRC of the downlink control information.

[0174] Alternatively, if the size of the transport block included in the downlink control information as condition B and the CRC is less than 2560 (or 3840) (and greater than 160 or 640), and if the minimum code block length (K) among the code block length (K) supportable by the first basic chart and the code block length (K) supportable by the second basic chart is satisfied, min ) belongs to the first basic graph, then in step 420, the terminal determines condition 1 and performs operation 1.

[0175] Alternatively, if the size of the transport block included in the downlink control information as condition B and the CRC is less than 2560 (or 3840) (and greater than 160 or 640), and if the minimum code block length K among the code block length (K) supportable by the first basic diagram and the code block length (K) supportable by the second basic diagram satisfying K>(transport block size+CRC size) belongs to the second basic diagram, then in step 430, the terminal determines condition 2 and performs operation 2.

[0176] This can be expressed using the following equation.

[0177] (TB+CRC)≤K≤V2, where K∈K 1 or K∈K 2

[0178] K*=min(K)

[0179] If K*∈K 1 , condition 1 is satisfied, so operation 1 is performed in step 420

[0180] If K*∈K 2 , condition 2 is satisfied, so operation 2 is performed in step 430

[0181] K is the code block length, K* is the selected code block length, and TB is the transport block size. In addition, CRC is the CRC size, K 1 is the set of code block lengths supported by the first basic graph, and K 2 is a set of code block lengths that can be supported by the second basic graph.

[0182] Alternatively, they can be expressed using the following equations.

[0183] V1≤(TB+CRC)≤K≤V2, where K∈K 1 or K∈K 2

[0184] K*=min(K)

[0185] If K*∈K 1 , condition 1 is satisfied, so operation 1 is performed in step 420

[0186] If K*∈K 2 , condition 2 is satisfied, so operation 2 is performed in step 430

[0187] K is the code block length, K* is the selected code block length, and TB is the transport block size. In addition, CRC is the CRC size, K 1 is the set of code block lengths supported by the first basic graph, and K 2 is a set of code block lengths that can be supported by the second basic graph.

[0188] K 1 is the first fundamental graph (or maximum exponential matrix ) A set of code block lengths that can be supported, and the type of the set can be one of the following values, or a combination of two or more. V1 can be 160, 640, or other values. V2 can be 2560, 3840, 960, 1040, 1120, or other values.

[0189] Alternatively, if TB+CRC is less than V1 in the above equation, the maximum exponential matrix If TB+CRC is greater than V2 in the above equation, it can be performed by applying the maximum exponential matrix One of them to perform decoding or encoding.

[0190] K 1 is the first fundamental graph (or maximum exponential matrix )A set of supportable code block lengths, and the type of the set can be one of the following values, or a combination of two or more.

[0191] 1. When K is equal to or less than 2560

[0192] 44, 66, 88, 132, 154, 176, 198, 242, 264, 286, 308, 330, 352, 296, 484, 528, 572, 616, 660, 704, 792, 968, 1056, 1144, 1232, 1320, 1408, 1584, 1936, 2112, 2288, 2464

[0193] 2. When K is equal to or less than 3840

[0194] 44, 66, 88, 132, 154, 176, 198, 242, 264, 286, 308, 330, 352, 296, 484, 528, 572, 616, 660, 704, 792, 968, 1056, 1144, 1232, 1320, 1408, 1584, 1936, 2112, 2288, 2464, 2640, 2816, 3168, 3520

[0195] 3. When K is equal to or less than 960

[0196] 44, 66, 88, 132, 154, 176, 198, 242, 264, 286, 308, 330, 352, 296, 484, 528, 572, 616, 660, 704, 792

[0197] 4. When K is equal to or less than 1040

[0198] 44, 66, 88, 132, 154, 176, 198, 242, 264, 286, 308, 330, 352, 296, 484, 528, 572, 616, 660, 704, 792, 968

[0199] 5. When K is equal to or less than 1120

[0200] 44, 66, 88, 132, 154, 176, 198, 242, 264, 286, 308, 330, 352, 296, 484, 528, 572, 616, 660, 704, 792, 968, 1056

[0201] If the values in the table are equal to or less than M, then they can generally be used while omitting all or some of the values from the table. 160, 640, or other values can be selected as M.

[0202] K 2 is the second fundamental graph (or maximum exponential matrix )A set of supportable code block lengths, and the type of the set can be one of the following values, or a combination of two or more.

[0203] 1. When K is equal to or less than 2560

[0204] 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 180, 200, 220, 240, 260, 280, 300, 320, 360, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040, 1120, 1200, 1280, 1440, 1600, 1760, 1920, 2080, 2240, 2400, 2560

[0205] 2. When K is equal to or less than 3840

[0206] 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 180, 200, 220, 240, 260, 280, 300, 320, 360, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040, 1120, 1200, 1280, 1440, 1600, 1760, 1920, 2080, 2240, 2400, 2560, (2720, 2880, 3040, 3200, 3360, 3520, 3680, 3840)

[0207] 3. When K is equal to or less than 960

[0208] 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 180, 200, 220, 240, 260, 280, 300, 320, 360, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960

[0209] 4. When K is equal to or less than 1040

[0210] 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 180, 200, 220, 240, 260, 280, 300, 320, 360, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040

[0211] 5. When K is equal to or less than 1120

[0212] 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 180, 200, 220, 240, 260, 280, 300, 320, 360, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040, 1120

[0213] If the basic map indicator included in the downlink control information as condition C indicates a value of 0 (or 1), the terminal determines condition 1 and performs operation 1 in step 420 .

[0214] If the basic map indicator included in the downlink control information as condition C indicates a value of 1 (or 0), the terminal determines condition 2 and performs operation 2 in step 430 .

[0215] If MCS, RV, NDI, or frequency or time resource allocation value among scheduling-related values included in the downlink control information as condition D indicates specific information, the terminal determines condition 1 and performs operation 1 in step 420 .

[0216] If MCS, RV, NDI, or frequency or time resource allocation value among scheduling-related values included in the downlink control information as condition D indicates specific information, the terminal determines condition 2 and performs operation 2 in step 430 .

[0217] If the terminal performs operation 1, the terminal performs one operation, or a combination of two or more operations.

[0218] 1. The terminal is based on the first basic graph (or maximum index matrix ) supports a code block length and attempts to decode the transport block indicated by the downlink control information.

[0219] 2. The terminal attempts to decode the transport block indicated by the downlink control information based on the following table of supportable code blocks.

[0220] 44, 66, 88, 110, 132, 154, 176, 198, 220, 242, 264, 286, 308, 330, 352, 296, 440, 484, 528, 572, 616, 660, 704, 792, 880, 968, 1056, 1144, 1232, 1320, 14 08, 1584, 1760, 1936, 2112, 2288, 2464, 2640, 2816, 3168, 3520, 3872, 4224, 4576, 4928, 5280, 5632, 6336, 7040, 7744, 8448, (5984, 6688, 7392, 8096)

[0221] 3. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the first basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0222] A.44, 88, 176, 352, 704, 1408, 2816, 5632

[0223] B.44, 66, 110, 154, 198, 242, 286, 330

[0224] C.44, 66, 154, 198, 242, 286, 330

[0225] 4. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the first basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0226] A.66, 132, 264, 528, 1056, 2112, 4224, 8448

[0227] B.88, 132, 220, 308, 396, 484, 572, 660

[0228] C.88,132,308,396,484,572,660

[0229] 5. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the first basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0230] A.110, 220, 440, 880, 1760, 3520, 7040

[0231] B.176, 264, 440, 616, 792, 968, 1144, 1320

[0232] C.1760,3520,7040

[0233] D.3520,7040

[0234] E.7040

[0235] F.176, 264, 616, 792, 968, 1144, 1320

[0236] 6. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the first basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0237] A.154, 308, 616, 1232, 2464, 4928

[0238] B.352, 528, 880, 1232, 1584, 1936, 2288, 2640

[0239] C.352, 528, 1232, 1584, 1936, 2288, 2640

[0240] 7. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the first basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0241] A.198, 396, 792, 1584, 3168, 6336

[0242] B.704, 1056, 1760, 2464, 3168, 3872, 4576, 5280

[0243] C.704, 1056, 2464, 3168, 3872, 4576, 5280

[0244] 8. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the first basic graph. Attempt to decode the transport block indicated by the downlink control information

[0245] A.242, 484, 968, 1936, 3872

[0246] B.1408, 2112, 3520, 4928, 6336, 7744

[0247] C.1408, 2112, 4928, 6336, 7744

[0248] 9. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the first basic graph. Attempt to decode the transport block indicated by the downlink control information

[0249] A.286, 572, 1144, 2288, 4576

[0250] B.2816,4224,7040

[0251] 10. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the first basic graph. Attempt to decode the transport block indicated by the downlink control information

[0252] A.330, 660, 1320, 2640, 5280

[0253] B.5632,8448

[0254] If the terminal performs operation 2, the terminal performs one of the following operations, or a combination of two or more thereof.

[0255] 1. The terminal attempts to decode the transport block indicated by the downlink control information based on the code block length supportable by the second basic map.

[0256] 2. The terminal attempts to decode the transport block indicated by the downlink control information based on the following table of supportable code blocks.

[0257] 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 180, 200, 220, 240, 260, 280, 300, 320, 360, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040, 1120, 1200, 1280, 1440, 1600, 1760, 1920, 2080, 2240, 2400, 2560 (2880, 3200, 3520, 3840, 2720, 3040, 3360, 3680)

[0258] 3. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the second basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0259] A.20, 40, 80, 160, 320, 640, 1280

[0260] B.20, 30, 50, 70, 90, 110, 130, 150

[0261] 4. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the second basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0262] A.30, 60, 120, 240, 480, 960, 1920, (3840)

[0263] B.40, 60, 100, 140, 180, 220, 260, 300

[0264] 5. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the second basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0265] A.50, 100, 200, 400, 800, 1600, (3200)

[0266] B.80, 120, 200, 280, 360, 440, 520, 600

[0267] 6. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the second basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0268] A.70, 140, 280, 560, 1120, 2240

[0269] B.160, 240, 400, 560, 720, 880, 1040, 1200

[0270] 7. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the second basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0271] A.90, 180, 360, 720, 1440, (2880)

[0272] B.320, 480, 800, 1120, 1440, 1760, 2080, 2400

[0273] 8. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the second basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0274] A.110, 220, 440, 880, 1760, (3520)

[0275] B.640, 960, 1600, 2240, (2880), (3520)

[0276] 9. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the second basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0277] A.130, 260, 520, 1040, 2080

[0278] B.1280, 1920, (3200)

[0279] 10. Among the following available code block sets, one or more combinations correspond to the terminal usage For the corresponding code block, the terminal is based on at least the matrix supported by the second basic graph. An attempt is made to decode the transport block indicated by the downlink control information.

[0280] A.150, 300, 600, 1200, 2400

[0281] B.2560, (3840)

[0282] In the present disclosure, numbers in parentheses indicate that the corresponding values may or may not be included.

[0283] In the present disclosure, information bits may refer to the amount of data to be sent from a higher layer or a transport block size (TBS). TBS is typically sent during one TTI, but may be sent over multiple TTIs. In the present disclosure, TBS is indicated by N.

[0284] In the present disclosure, values in parentheses shown in a table are values that may be wholly or partially included in the table, or all or some of the values may not be partially included in the table.

[0285] Figure 5 A method for dividing a transport block into one or more code blocks (CBs) is shown. Figure 5 , a CRC 503 can be added to the last part or the first part of a transport block 501 for transmission in the uplink or downlink. Depending on the channel conditions, the CRC can have 16 bits, 24 bits, a predetermined number of bits, or a variable number of bits and can be used to determine whether the channel coding is successful. The blocks 501 and 503 to which the TB and CRC are added can be divided into multiple code blocks 507, 509, 511, and 513, as indicated by reference numeral 505.

[0286] A code block can be segmented after its maximum size is predetermined. In this case, the last code block 513 can be smaller than the other code blocks, or can be made the same length as the other code blocks by inserting 0, a random value, or 1. CRCs 517, 519, 521, and 523 can be added to the segmented code blocks, as indicated by reference numeral 515. The CRC can have 16 bits, 24 bits, or a predetermined number of bits and can be used to determine whether channel coding is successful. However, depending on the type of channel code applied to the code block, the CRC 503 added to the TB and the CRCs 517, 519, 521, and 523 added to the segmented code blocks can have variable lengths. Furthermore, when polar codes are used, the CRC can be added or omitted. During segmentation, if the number of CBs is one, the CRC 517 added to the CB can be omitted.

[0287] The length of the CRC inserted into the TB for determining whether the TB decoding is successful after the receiver performs TB decoding is L, and L can have at least two available values. That is, if the transport block is divided into two or more code blocks and transmitted, a long CRC can be used. On the other hand, if the transport block is divided into one code block and transmitted, a short CRC can be used. If an LDPC code is used for encoding in a mobile communication system, the LDPC code itself has a parity check function, and therefore can have the function of determining whether the decoding is successful without inserting a CRC.

[0288] If an LDPC code is used in a particular mobile communication system and an additional level of certainty of decoding success is desired, then in addition to the parity check function inserted into the LDPC code, a technique for determining whether decoding is ultimately successful may be used, and thus the error rate level desired by the system for determining whether decoding is successful may be obtained. For example, if the error rate required by the system for determining whether decoding is successful is 10 -6 , and the determined error rate obtained by the parity check function of the LDPC code is 10 -3 , then by additionally inserting -3 The CRC error rate can be determined by 10 -6 The final system determines the error rate.

[0289] Generally, as the length of the CRC is longer, the error rate for determining whether the decoding is successful becomes lower. If the transport block is divided into two or more code blocks and transmitted, the TB itself is configured by concatenation of LDPC codes, so the parity check function of the LDPC code cannot be used. On the other hand, if the transport block includes one code block, the parity check function of the LDPC code can be used. Therefore, in a specific system, the TB can be used after a long CRC or a short CRC is inserted into the TB according to the number of code blocks within the transport block. In an embodiment of the present disclosure, it is assumed that, depending on whether the TB is divided into two or more code blocks, a long length L+ or a short length L- can be used as the length L of the CRC inserted into the TB. The value that can be used for L+ can be 24 used in the LTE system, and any length shorter than 24 can be used for L-, and the 16 used by the control channel of the LTE system can be reused. However, in an embodiment of the present disclosure, L- is not limited to 16.

[0290] Whether a specific TB is divided into a plurality of code blocks is determined based on whether the given TB can be transmitted using one code block, and thus the determination may be performed as follows:

[0291] - If N+L- is equal to or less than the maximum available CB length, use one code block to send the TB (if (N+L-) <= K max , then use one CB)

[0292] - If N+L- is greater than the maximum available CB length, split the TB into multiple code blocks and send (if (N+L-)>K max , then split CB)

[0293] K max Indicates the largest code block size among the available code block sizes.

[0294] In the conventional LTE system, the MCS index sent through DCI and the number of allocated PRBs are used to determine the TBS. Based on the downlink, a 5-bit MCS index can be sent, so the modulation order Q can be derived from the following [Table 6] m and TBS index.

[0295] [Form 6]

[0296]

[0297]

[0298] The number of PRBs used for data transmission may be derived from resource allocation information transmitted through DCI, and the TBS may be determined based on the following [Table 7] and the TBS index derived from the above [Table 6].

[0299] [Form 7]

[0300]

[0301] Table 7 above is a TBS table for cases where the PRB is 1 to 10 and the TBS index is 0 to 26, or even when the PRB is up to 110 and an additional TBS index is used. The number in the space corresponding to the number of allocated PRBs and TBS index in the above table is the TBS understood by the base station and the terminal.

[0302] The method and apparatus described in this disclosure for determining a TBS for downlink data transmission by a terminal can be fully applied to the process of encoding a transport block of an uplink data channel. In addition, the encoding and decoding operations of the terminal described in this disclosure can be fully applied to the encoding and decoding operations of the base station.

[0303] In the present disclosure, a transport block may be data transmitted from a higher layer to a physical layer, and may be a unit that may be initially transmitted by the physical layer.

[0304] In the present disclosure, N1_max and N2_max may indicate the maximum code block length when BG#1 is used in the LDPC code and the maximum code block length when BG#2 is used. For example, N1_max=8448 and N2_max=3840. However, the embodiments of the present disclosure are not limited thereto. In the present disclosure, N1_max may be the same as N 1max or N 1,max are used interchangeably, and N2_max can be used with N 2max or N 2,max Used interchangeably.

[0305] In the present disclosure, L_{TB, 16} and L_{TB, 24} may be the length of the CRC added to the TB, and L_{TB, 16} < L_{TB, 24}. For example, L_{TB, 16} may be 16, and L_{TB, 24} may be 24. In the present disclosure, L_{TB, 16} may be the same as L TB,16 are used interchangeably, and L_{TB,24} can be used with L TB,24 In the present disclosure, L_{CB} may be the length of the CRC added to the CB and may be used interchangeably with L CB Used interchangeably.

[0306] [Example 1]

[0307] Embodiment 1 provides a method for determining the TBS based on the selection of the CB-CRC and the base graph (BG). This embodiment can be applied to the following situation: in certain cases, when the TBS is large, the TB is divided into two or more code blocks, and each code block is channel-encoded into an LDPC code using BG#2. That is, even when the TBS is large, this embodiment can be applied to situations where data can be transmitted using BG#2. In this embodiment, R_1 and R_2 can indicate the code rate that serves as a reference for selecting BG#1 or BG#2 and can be used interchangeably with R1 and R2. For example, R1 = 1 / 4 and R2 = 2 / 3, but the method provided in this disclosure is not limited to this. In addition, in this disclosure, R, R1, and R2, which are indicated as code rates, can be expressed and determined in various ways, such as fractions and decimals. For example, R can be a value such as 0.28, but is not limited to this, and various numbers and values can be used. When selecting a BG between BG#1 and BG#2 during data transmission, the terminal's code rate and soft buffer can be considered.

[0308] The base station can transmit data by allocating a predetermined number of PRB frequency resources and a predetermined number of time slots or symbols to the terminal, and can send scheduling information related thereto to the terminal through downlink control information (DCI), a configuration sent through higher layer signaling, or a combination thereof. If the scheduling information of the base station and the terminal is given, the TBS can be determined in the following order.

[0309] -Step 1-1: Determine the number of temporary information bits (A)

[0310] -Step 1-2: The process of determining the number of temporary CBs (C), performing byte alignment (making A a multiple of 8), and making A a multiple of the number of CBs (B times)

[0311] -Step 1-3: Process of determining TBS excluding CRC bits (TBS)

[0312] In step 1-1, the temporary TBS value is determined considering the amount of resource regions to which the data to be transmitted can be mapped. m ), the number of REs to which rate matching data is mapped (N RE The number of temporary information bits is determined based on a combination of one or more of the following: , the number of allocated PRBs or RBs (#PRBs), the number of allocated OFDM symbols, the number of allocated time slots, and a reference value for the number of mapped REs within one PRB. For example, A can be determined using the following [Equation 10].

[0313] [Equation 10]

[0314] A=N RE ×Q m ×R×v

[0315] Modulation order Q m The code rate R can be sent to the terminal while being included in the DCI. The number of layers v used for transmission can be sent to the terminal through DCI, high-layer signaling, or a combination thereof. RE It can be determined by the base station using the number of REs to which data is mapped by rate matching when transmitting data, and if both the base station and the terminal know the resource allocation information, the base station and the terminal can equally understand N RE When calculating N RE When N is set, data is mapped in a rate matching scheme, but REs to which the data is not actually mapped are included in N because the data is punctured for a specific reason such as transmission of a channel state information reference signal (CSI-RS), URLLC, or uplink control information (UCI). RE This is to enable both the base station and the terminal to equally understand the TBS even when the base station does not transmit some data scheduled to be mapped in the puncturing scheme without informing the terminal.

[0316] An MCS table such as the following [Table 8] may be defined, and the base station may transmit an MCS index to the terminal to send information about Q m and R. The modulation order refers to information such as QPSK, 16QAM, 64QAM, 256QAM or 1024QAM. In the case of QPSK, Q m =2, in the case of 16QAM, Q m =4, in the case of 64QAM, Q m =6, in the case of 256QAM, Q m =8, and in the case of 1024QAM, Q m =10. That is, Q m It can be the number of bits that can be sent in a modulation symbol.

[0317] [Form 8]

[0318]

[0319]

[0320] In the above [Table 8], Q m and R are transmitted together through a 5-bit MCS index, but can be transmitted to the terminal in various ways so that Q m and R are sent via DCI using a 6-bit MCS index, or using a 3-bit Q m and 3 bits of R each use a bit field. Alternatively, A = (number of allocated PRBs) × (number of reference REs per PRB) × Q m ×R×v.

[0321] Steps 1-2 use the determined A to determine the number of temporary code blocks (C) (the number of temporary CBs), and based on this, make A a multiple of 8 and a multiple of the number of temporary CBs. This is to align the length bytes of the final TBS and the CRC added to the TB, and also to ensure that it is a multiple of CBs. First, the number of temporary CBs can be determined using the following [pseudo code 1].

[0322] [Pseudocode 1]

[0323] [Start]

[0324] If R≤R1, then Else

[0325] End if of R

[0326] [End]

[0327] R is the code rate and can be the value sent via DCI as described above. As mentioned above, R1 can be 1 / 4, N 1,max It can be 8448, and N 2,max It can be 3840. In this case, [pseudo code 2] can be used for determination, but it is not limited to this. At this time, R1, N 1,max and N 2,max Described as 1 / 4, 8448, and 3840, but not limited thereto, and other values may be used.

[0328] [Pseudocode 2]

[0329] [Start]

[0330] If R≤1 / 4, then

[0331] Else

[0332] End if of R

[0333] [End]

[0334] The C obtained above may be the number of temporary CBs. CB segmentation is performed when the TB is finally transmitted, and the number of temporary CBs may be different from the number of actual CBs obtained. It can be determined that the number of actual CBs and temporary CBs may be the same as each other.

[0335] Then, a process of generating B by making A determined in step 1-1 a multiple of 8 and C is performed to prevent unnecessary bits or unnecessary zero padding bits from being included in all code blocks. B can be calculated as shown in the following [Table 11].

[0336] [Equation 11]

[0337]

[0338] The above [Equation 11] can be transformed into B = A + (8C - mod (A, 8C)), and B = A - mod (A, 8C), are then applied. In the present disclosure, mod (x, y) may be a remainder obtained by dividing x by y, and may be transformed into Then it is applied. In this disclosure, is the smallest integer greater than x and can be used interchangeably with ceil(x). is the largest integer less than x and can be used interchangeably with floor(x). [Equation 11] can be transformed into It means B is the multiple of 8C that is closest to A. Round(x) can be the integer closest to x, or the rounded value of x.

[0339] [Equation 11] will make A a multiple of 8C, but can be transformed into an equation that makes A a common multiple or least common multiple of 8 and C, and then applied. Therefore, the above [Equation 11] can be transformed into or Then it is applied. LCM(a,b) is the least common multiple of a and b.

[0340] In the steps up to step 1-2, the information bits to be transmitted in the allocated resources are obtained, and in the final step 1-3, a process is performed to exclude the number of bits added for CRC from the obtained information bits to be transmitted. This can be performed by the following [pseudo code 3].

[0341] [Pseudocode 3]

[0342]

[0343] If each parameter value is determined and applied as described above, [Pseudo Code 3] may be applied to the following [Pseudo Code 4], but is not limited thereto.

[0344] [Pseudocode 4]

[0345]

[0346] Since the length of the CRC applied to the TB varies according to the TBS, L TB,16 and L TB,24 If the number of code blocks is 1, the CRC added to the CB may be omitted, or the length of the CRC added to the CB may be 0.

[0347] In another example, steps 1-3 may be transformed into the following [pseudo code 5] or [pseudo code 6] and then applied.

[0348] [Pseudocode 5]

[0349] [Start]

[0350] If B≤N 2,max , then TBS=BL TB,16

[0351] Else TBS=BL TB,24

[0352] End if of B

[0353] [End]

[0354] [Pseudocode 6]

[0355] [Start]

[0356] If B≤3840, then TBS=B-16

[0357] Else TBS=B-24

[0358] End if of B

[0359] [End]

[0360] In [Pseudo Code 5] or [Pseudo Code 6], the CRC length added to the CB is not excluded to obtain the final TBS. Therefore, when the actual data is subsequently mapped and sent, the CRC length of the CB can be added to the obtained TBS, so that the actual code rate can be greater than R.

[0361] Figure 6 This is a flowchart illustrating the steps by which a base station and a terminal obtain a TBS and transmit and receive data when scheduling and transmitting downlink or uplink data. When the scheduling and data transmission process begins, the base station determines scheduling information in step 602 and transmits the scheduling information to the terminal in step 604 via a combination of one or more of DCI, system information, MAC CE, and RRC signaling. The terminal and base station obtain the TBS from the determined scheduling information in step 606. In step 606, the TBS can be obtained using steps 1-1, 1-2, and 1-3 described above. Steps 1-1, 1-2, and 1-3 can be combined and performed simultaneously, or their order can be changed. Subsequently, in step 608, CB segmentation and channel coding, decoding, and retransmission operations are performed using the TBS, completing data scheduling and transmission.

[0362] The TBS determination method provided in the embodiment can only be applied to the following situation: a specific combination of the MCS index and the number of allocated PRBs pre-arranged between the base station and the terminal is not applied. For example, if the scheduling is determined using MCS index 6 and the number of PRBs is 1, the TBS can be determined as a fixed value of 328, and data can be sent instead of using the above method. Therefore, the base station and the terminal can predetermine and know the TBS value based on the combination of {MCS index or code rate index, number of PRBs}, and the TBS can be determined by the method provided in the embodiment only in cases other than the above combination.

[0363] The TBS determination method according to the present embodiment corresponds only to initial transmission, and in retransmission, transmission and reception may be performed based on the assumption that the TBS determined in the initial transmission corresponds to retransmission.

[0364] [Example 2]

[0365] [Embodiment 2] provides a method for determining TBS based on the selection of CB-CRC and BG. This embodiment can be applied to the following situation: in a specific case, when the TBS is large, the TB is divided into two or more code blocks, and each code block is channel-encoded into an LDPC code using BG#2. That is, even when the TBS is large, this embodiment can be applied to situations where data can be sent using BG#2. In this embodiment, R_1 and R_2 can indicate the code rate as a reference for selecting BG#1 or BG#2 of LDPC, and R1 and R2 can be used interchangeably. For example, R1=1 / 4 and R2=2 / 3, but the method provided in the present disclosure is not limited to this. In addition, in the present disclosure, R, R1, and R2, which refer to the code rate, can be expressed and determined in various methods, such as fractions and decimals. When selecting a BG between BG#1 and BG#2 in data transmission, the code rate and soft buffer of the terminal can be considered. In this embodiment, a process of making TBS a multiple of 8, a multiple of the number of CBs, or a common multiple or least common multiple of 8 and the number of CBs may be performed at the end of TBS calculation.

[0366] The base station can transmit data by allocating a predetermined number of PRB frequency resources and a predetermined number of time slots or symbols to the terminal, and can send scheduling information related thereto to the terminal through downlink control information (DCI), a configuration sent through higher layer signaling, or a combination thereof. When the scheduling information of the base station and the terminal is given, the TBS can be determined in the following order.

[0367] -Step 2-1: Determine the number of temporary information bits (A)

[0368] - Step 2-2: Determine the number (C) of temporary CBs using the determined A, and determine TBS by controlling A so that the value obtained by adding the TB-CRC length to the TBS is byte-aligned (a multiple of 8) and is a multiple of the number of temporary CBs

[0369] Step 2-1 may be the same as the process of step 1-1 in [Embodiment 1]. In [Step 2-1], the temporary TBS value is determined considering the amount of resource regions to which the data to be transmitted can be mapped. The temporary TBS value may be determined by the code rate (R), the modulation order (Q m ), the number of REs to which rate matching data is mapped (N RE The number of temporary information bits is determined by a combination of one or more of the reference values of ), the number of allocated PRBs or RBs (#PRB), the number of allocated OFDM symbols, the number of allocated time slots, and the number of mapped REs within one PRB.

[0370] For example, A can be represented by A=N corresponding to the above [Equation 10] RE ×Q m ×R×v determines the modulation order Q m The code rate R can be sent to the terminal while being included in the DCI. The number of layers v used for transmission can be sent to the terminal through DCI, high-layer signaling, or a combination thereof. RE It can be determined by the base station using the number of REs to which data is mapped by rate matching when transmitting data, and if both the base station and the terminal know the resource allocation information, the base station and the terminal can equally understand N RE When calculating N RE When data is mapped by rate matching, but REs to which the data is not mapped due to data puncturing for a specific reason (such as CSI-RS, URLLC, or UCI transmission) are included in N RE This is to enable both the base station and the terminal to equally understand the TBS even when the base station does not transmit some data scheduled to be mapped in the puncturing scheme without informing the terminal.

[0371] An MCS table such as the above [Table 8] may be defined, and the base station may transmit an MCS index to the terminal to send information about Q m and R. The modulation order refers to information such as QPSK, 16QAM, 64QAM, 256QAM or 1024QAM. In the case of QPSK, Q m =2, in the case of 16QAM, Q m =4, in the case of 64QAM, Q m =6, in the case of 256QAM, Q m =8, and in the case of 1024QAM, Q m =10. That is, Q m It can be the number of bits that can be sent in a modulation symbol. In the above [Table 8], Q m and R are transmitted together through a 5-bit MCS index, but can be transmitted to the terminal in various ways so that Q m and R are sent via DCI using a 6-bit MCS index, or using a 3-bit Q m and 3 bits of R each use a bit field. Alternatively, A = (number of allocated PRBs) × (number of reference REs per PRB) × Q m ×R×v.

[0372] Step 2-2 may be performed as shown in [Pseudo Code 7] or [Pseudo Code 8] below.

[0373] [Pseudocode 7]

[0374]

[0375] can be transformed into Then it is applied.

[0376] [Pseudocode 8]

[0377]

[0378] The above [Pseudo Code 7] may be transformed into the following [Pseudo Code 7-A], [Pseudo Code 7-B], or [Pseudo Code 7-C] and then applied. The following pseudo code segment may be a method based on the assumption that TB-CRC has been added.

[0379] [Pseudocode 7-A]

[0380]

[0381]

[0382] [Pseudocode 7-B]

[0383]

[0384]

[0385] I MCS It can be an MCS index or a parameter related to MSC or a bit rate. MCS,BG#2 Can be used to select BG#2 MCS reference value.

[0386] [Pseudocode 7-C]

[0387]

[0388]

[0389] α is a quantization factor and can be a value used to determine the granularity of the TBS. A can be a value set by the base station and the terminal, and therefore known to both the base station and the terminal, or can be a value configured by the base station in the terminal via higher-layer signaling. Alternatively, α can be a value determined based on the value of A or C.

[0390] The above [Pseudocode 8] can be transformed into the following [Pseudocode 8-A] and then applied.

[0391] [Pseudocode 8-A]

[0392]

[0393] "If R ≤ 1 / 4," is not limited to "1 / 4" and may be transformed into a value such as "If R ≤ 0.28," and then applied. Such a conditional statement may be in the form of comparing MCS indexes, such as "If I MCS ≤3," and is applied.

[0394] In the pseudo code segment above, L TB,16 and L TB,24 The number of CRC bits applied to the value divided by A when calculating C and the value of the CRC bits excluded from the process of calculating TBS can be changed according to the code rate R and the size of A calculated. can be transformed into A+(8-mod(A,8)), A-mod(A,8), or Then it was applied as described in [Example 1]. Can be transformed into A-(C×8-mod(A+24,C×8)) or A-mod(A+24,C×8) and then applied. In addition, can be transformed into Then it is applied. Therefore, the pseudo code can be transformed into the following [pseudo code 9], and then it is applied. In addition, the application can be performed using another equation that obtains the same result.

[0395] [Pseudocode 9]

[0396]

[0397]

[0398] Step 2-2 may be a process of determining the number C of temporary code blocks (the number of temporary CBs) using the determined A, and making the length of CRC+TB of the TBS a multiple of 8 and C based thereon.

[0399] In the present disclosure, mod(x, y) may be a remainder obtained by dividing x by y and may be transformed into In this disclosure, is the smallest integer greater than x and can be used interchangeably with ceil(x). is the largest integer less than x and can be used interchangeably with floor(x). Round(x) can be the integer closest to x, or the rounded value of x.

[0400] In the equation provided in this embodiment, C×8 is used for multiples of the product of 8 and C, but C×8 can be transformed into LCM(8, C) and applied to the above equation.

[0401] Figure 6 This is a flowchart illustrating the steps by which a base station and a terminal obtain a TBS and transmit and receive data when scheduling and transmitting downlink or uplink data. Once the scheduling and data transmission process begins, the base station determines scheduling information in step 602 and transmits the scheduling information to the terminal in step 604 via a combination of one or more of DCI, system information, MAC CE, and RRC signaling. The terminal and base station obtain the TBS from the determined scheduling information in step 606. In step 606, the TBS can be calculated using steps 2-1 and 2-2 described above. Steps 2-1 and 2-2 can be combined and performed simultaneously, or their order can be changed. Subsequently, in step 608, CB segmentation and channel coding, decoding, and retransmission operations are performed using the TBS, completing data scheduling and transmission.

[0402] The TBS determination method provided in the embodiment can only be applied to the following case: a specific combination of the MCS index and the number of allocated PRBs pre-arranged between the base station and the terminal is not applied. For example, if the scheduling is determined using MCS index 6 and the number of PRBs is 1, the TBS can be determined as a fixed value of 328, and data can be sent instead of using the above method. Therefore, the base station and the terminal can predetermine and know the TBS value based on the combination of {MCS index or code rate index, number of PRBs}, and the TBS can be determined by the method provided in the embodiment only in cases other than the above combination.

[0403] The TBS determination method according to the present embodiment may correspond only to initial transmission, and in retransmission, transmission and reception may be performed based on the assumption that the TBS determined in the initial transmission corresponds to retransmission.

[0404] Steps 2-1 and 2-2 may correspond to steps 2-A, 2-B, 2-C, and 2-D below.

[0405] *Step 2-A: Determine the number of resources on which the data resources are rate matched (Step 2-A: For PDSCH / PUSCH (N RE ) is counted based on the number of available REs for rate matching.

[0406] *Step 2-B: Multiply the coding rate, number of layers, and modulation order by the calculated N RE To calculate the temporary TBS including TB-CRC (Step 2-B: by multiplying the coding rate, modulation order and number of layers by N RE To calculate TBS+TB-CRC)

[0407] *Step 2-C: Make the calculated temporary TBS including TB-CRC a common multiple of 8 and the number of CBs, or a multiple of the value obtained by multiplying 8 and the number of CBs (Step 2-C: Make TBS+TB-CRC a common multiple of 8 and the number of CBs)

[0408] *Step 2-D: Calculate the final TBS taking into account a specific packet size or a specific service. In the absence of a specific packet size or a specific service, calculate the final TBS excluding the TB-CRC length from the value calculated in step 2-C (Step 2-D: Determine the final TBS taking into account a specific packet size and service (if applicable)).

[0409] [Example 3]

[0410] [Embodiment 3] provides a TBS determination method based on the selection of CB-CRC and BG. This embodiment can be applied to the following specific case: when TBS is large, BG#2 is not applied. That is, in the present disclosure, the case of using BG#2 to channel encode the code block into an LDPC code can be limitedly applied only to the case where the TB is not divided into multiple code blocks. In this embodiment, R_1 and R_2 can indicate the code rate as a reference for selecting BG#1 or BG#2 of LDPC, and R1 and R2 can be used interchangeably. For example, R1=1 / 4 and R2=2 / 3, but the method provided in the present disclosure is not limited to this. In addition, in the present disclosure, R, R1 and R2 referring to the code rate can be expressed and determined in various methods, such as fractions and decimals. When selecting BG between BG#1 and BG#2 in data transmission, the code rate and soft buffer of the terminal can be considered.

[0411] The base station can transmit data by allocating a predetermined number of PRB frequency resources and a predetermined number of time slots or symbols to the terminal, and can send scheduling information related thereto to the terminal through downlink control information (DCI), a configuration sent through higher layer signaling, or a combination thereof. When the scheduling information of the base station and the terminal is given, the TBS can be determined in the following order.

[0412] -Step 3-1: Determine the number of temporary information bits (A)

[0413] -Step 3-2: The process of determining the number of temporary CBs (C), performing byte alignment (making A a multiple of 8), and making A a multiple of the number of temporary CBs (B times)

[0414] -Step 3-3: Process of determining TBS excluding the number of CRC bits.

[0415] Step 3-1 may be the same as the process of step 1-1 in [Embodiment 1]. In [Step 3-1], the temporary TBS value is determined considering the amount of resource regions to which the data to be transmitted can be mapped. The temporary TBS value may be determined by the code rate (R), the modulation order (Q m ), the number of REs to which rate matching data is mapped (N RE The number of temporary information bits is determined by a combination of one or more of the reference values of ), the number of allocated PRBs or RBs (#PRB), the number of allocated OFDM symbols, the number of allocated time slots, and the number of mapped REs within one PRB.

[0416] For example, A can be represented by A=N corresponding to [Equation 10] RE ×Q m ×R×v to determine the modulation order Q m The code rate R can be sent to the terminal while being included in the DCI. The number of layers v used for transmission can be sent to the terminal through DCI, high-layer signaling, or a combination thereof. RE It can be determined by the base station using the number of REs to which data is mapped by rate matching when transmitting data, and if both the base station and the terminal know the resource allocation information, the base station and the terminal can equally understand N RE When calculating N RE When data is mapped by rate matching, but REs to which the data is not mapped due to data puncturing for a specific reason (such as CSI-RS, URLLC, or UCI transmission) are included in N RE This is to enable both the base station and the terminal to equally understand the TBS even when the base station does not transmit some data scheduled to be mapped in the puncturing scheme without informing the terminal.

[0417] An MCS table such as the above [Table 8] may be defined, and the base station may transmit an MCS index to the terminal to send information about Q m and R. The modulation order refers to information such as QPSK, 16QAM, 64QAM, 256QAM or 1024QAM. In the above [Table 8], Q m and R are transmitted together through a 5-bit MCS index, but can be transmitted to the terminal in various ways so that Q m and R are sent via DCI using a 6-bit MCS index, or using a 3-bit Q m and 3 bits of R each use a bit field. Alternatively, A = (number of allocated PRBs) × (number of reference REs per PRB) × Q m ×R×v.

[0418] Step 3-2 is a step of determining the number of temporary code blocks C (the number of temporary CBs) using the determined A, and making A a multiple of 8 and the number of temporary CBs (B times). This is to align the length bytes of the finally determined TBS and the CRC added to the TB, and also to make A a multiple of CBs.

[0419] First, the number of temporary CBs can be determined as N 1,max It can be 8448. The obtained C above can be the number of temporary CBs. CB splitting is performed when the TB is finally transmitted, and the number of temporary CBs may be different from the number of actual CBs obtained, but it can be determined that the number of actual CBs and temporary CBs can be the same.

[0420] The process of generating B by making A determined in step 3-1 a multiple of 8 and C is performed to prevent the entire code block from being transmitted while including unnecessary bits or unnecessary zero padding bits. B can be as shown in [Equation 11] The above [Equation 11] can be changed to B = A + (8C mod (Ai8C)), and B = -4-mod (A, 8C), are then applied. In the present disclosure, mod (x, y) may be a remainder obtained by dividing x by y, and may be transformed into In this disclosure, is the smallest integer greater than x and can be used interchangeably with ceil(x). is the largest integer less than x and can be used interchangeably with floor(x).

[0421] [Equation 11] can be transformed into And is applied, which means that B is the multiple of 8C that is closest to A. Round(x) can be the integer closest to x or x after rounding. [Equation 11] is used to make A a multiple of 8C, but can be transformed into an equation for making A a common multiple or least common multiple of 8 and C. Therefore, the above [Equation 11] can be transformed into or Then it is applied. LCM(a,b) is the least common multiple of a and b.

[0422] In the steps up to step 3-2, the information bits to be transmitted in the allocated resources are obtained, and in the final step 3-3, the number of bits added for CRC is excluded from the obtained information bits to be transmitted. This can be determined by the following [pseudo code 10] or [pseudo code 11].

[0423] [Pseudocode 10]

[0424] [Start]

[0425] If B≤N 2,max , then TBS=BL TB,16

[0426] Else if B≤N 1,max , then TBS=BL TB,24

[0427] Else TBS=BL TB,24 -C×L CB

[0428] End if of B

[0429] [End]

[0430] [Pseudocode 11]

[0431] [Start]

[0432] If B≤3840, then TBS=B-16

[0433] Else if B≤8448,then TBS=B-24

[0434] Else TBS=B-24×(C+1)

[0435] End if of B

[0436] [End]

[0437] Since the CRC length applied to the TB varies according to the TBS, TB,16 and L TB,24 If the number of code blocks is 1, the CRC added to the CB may be omitted, or the length of the CRC added to the CB may be 0.

[0438] In another example, step 3-3 can be transformed into [Pseudocode 5] or [Pseudocode 6] and then applied. In [Pseudocode 5] or [Pseudocode 6], the CRC length added to the CB is not excluded in order to obtain the final TBS. Therefore, when the actual data is subsequently mapped and transmitted, the CRC length of the CB can be added to the obtained TBS, so the actual code rate can be greater than R.

[0439] Figure 6 This is a flowchart illustrating the steps by which a base station and a terminal obtain a TBS and transmit and receive data when scheduling and transmitting downlink or uplink data. When the scheduling and data transmission process begins, the base station determines scheduling information in step 602 and transmits the scheduling information to the terminal in step 604 via a combination of one or more of DCI, system information, MAC CE, and RRC signaling. The terminal and base station obtain the TBS from the determined scheduling information in step 606. In step 606, the TBS can be obtained using steps 3-1, 3-2, and 3-3 described above. Steps 3-1, 3-2, and 3-3 can be combined and performed simultaneously, or their order can be changed. Subsequently, in step 608, CB segmentation and channel coding, decoding, and retransmission operations are performed using the TBS, completing data scheduling and transmission.

[0440] The TBS determination method provided in the embodiment can only be applied to the following situation: a specific combination of the MCS index and the number of allocated PRBs pre-arranged between the base station and the terminal is not applied. For example, if the scheduling is determined using MCS index 6 and the number of PRBs is 1, the TBS can be determined as a fixed value of 328, and data can be sent instead of using the above method. Therefore, the base station and the terminal can predetermine and know the TBS value based on the combination of {MCS index or code rate index, number of PRBs}, and the TBS can be determined by the method provided in the embodiment only in cases other than the above combination.

[0441] The TBS determination method according to the present embodiment may correspond only to initial transmission, and in retransmission, transmission and reception may be performed based on the assumption that the TBS determined in the initial transmission corresponds to retransmission.

[0442] [Example 4]

[0443] [Embodiment 4] provides a TBS determination method based on the selection of CB-CRC and BG. This embodiment can be applied to the following specific case: when TBS is large, BG#2 is not applied. That is, in the present disclosure, the case of using BG#2 to channel encode the code block into an LDPC code can be limitedly applied only to the case where the TB is not divided into multiple code blocks. In this embodiment, R_1 and R_2 can indicate the code rate as a reference for selecting BG#1 or BG#2 of LDPC, and R1 and R2 can be used interchangeably. For example, R1=1 / 4 and R2=2 / 3, but the method provided in the present disclosure is not limited to this. In addition, in the present disclosure, R, R1 and R2 referring to the code rate can be expressed and determined in various methods, such as fractions and decimals. When selecting BG between BG#1 and BG#2 in data transmission, the code rate and soft buffer of the terminal can be considered. In this embodiment, a process of making TBS a multiple of 8, a multiple of the number of CBs, or a common multiple or least common multiple of 8 and the number of CBs may be performed at the end of TBS calculation.

[0444] The base station can transmit data by allocating a predetermined number of PRB frequency resources and a predetermined number of time slots or symbols to the terminal, and can send scheduling information related thereto to the terminal through downlink control information (DCI), a configuration sent through higher layer signaling, or a combination thereof. When the scheduling information of the base station and the terminal is given, the TBS can be determined in the following order.

[0445] -Step 4-1: Determine the number of temporary information bits (A)

[0446] -Step 4-2: Process of determining the number of temporary CBs so that the value obtained by adding the TB-CRC length to the TBS is byte-aligned and is a multiple of the number of CBs

[0447] Step 4-1 may be the same as the process of step 2-1 in [Example 2]. In [Step 4-1], the temporary TBS value is determined considering the number of resource regions to which the data to be transmitted can be mapped. The temporary TBS value may be determined by the code rate (R), the modulation order (Q m ), the number of REs to which rate matching data is mapped (N RE The number of temporary information bits is determined by a combination of one or more of the following: , the number of allocated PRBs or RBs (#PRB), the number of allocated OFDM symbols, the number of allocated time slots, and the reference value of the number of mapped REs within one PRB. For example, A can be determined by the above [Equation 10]. Modulation order Q m The code rate R can be sent to the terminal while being included in the DCI. The number of layers v used for transmission can be sent to the terminal through DCI, high-layer signaling, or a combination thereof. RE It can be determined by the base station using the number of REs to which data is mapped by rate matching when transmitting data, and if both the base station and the terminal know the resource allocation information, the base station and the terminal can equally understand N RE When calculating N RE When data is mapped by rate matching, but REs to which the data is not mapped due to data puncturing for a specific reason (such as CSI-RS, URLLC, or UCI transmission) are included in N RE This is to enable both the base station and the terminal to equally understand the TBS even when the base station does not transmit some data scheduled to be mapped in the puncturing scheme without informing the terminal.

[0448] An MCS table such as the above [Table 8] may be defined, and the base station may transmit an MCS index to the terminal to send information about Q m and R. The modulation order refers to information such as QPSK, 16QAM, 64QAM, 256QAM or 1024QAM. In the above [Table 8], Q m and R are transmitted together through a 5-bit MCS index, but can be transmitted to the terminal in various ways so that Q m and R are sent via DCI using a 6-bit MCS index, or using a 3-bit Q m and 3 bits of R each use a bit field. Alternatively, A = (number of allocated PRBs) × (number of reference REs per PRB) × Q m ×R×v.

[0449] Step 4-2 can be performed as shown in [Pseudocode 12] or [Pseudocode 13].

[0450] [Pseudocode 12]

[0451]

[0452] can be transformed into Then it is applied.

[0453] [Pseudocode 13]

[0454]

[0455] Alternatively, [Pseudocode 12] may be transformed into [Pseudocode 14] and then applied.

[0456] [Pseudocode 14]

[0457]

[0458]

[0459] can be transformed into A+(8-mod(A,8)),A-mod(A,8) or Then it was applied as described in [Example 1]. It can be transformed into A+(C×8-mod(A+24,C×8)) or A+(C×8-mod(A+24,C×8)) and then applied. For example, the transformation of [Pseudo Code 14] can be performed and applied.

[0460] [Pseudocode 14]

[0461]

[0462] Step 4-2 may be a process of determining the number of temporary code blocks C (the number of temporary CBs) using the determined A and, based on this, making the CRC length of the TBS + TB a multiple of 8 and C. The purpose of using C x 8 in the above equation is to make A a multiple of 8 and C, but it can be transformed so that A is a common multiple or the least common multiple of 8 and C and applied. Therefore, in the above equation, C x 8 can be transformed into LCM(8, C) and applied. LCM(a, b) is the least common multiple of a and b.

[0463] In the present disclosure, mod(x, y) may be a remainder obtained by dividing x by y and may be transformed into In this disclosure, is the smallest integer greater than x and can be used interchangeably with ceil(x). is the largest integer less than x and can be used interchangeably with floor(x). Round(x) can be the integer closest to x, or the rounded value of x.

[0464] Figure 6 This is a flowchart illustrating the steps by which a base station and a terminal obtain a TBS and transmit and receive data when scheduling and transmitting downlink or uplink data. Once the scheduling and data transmission process begins, the base station determines scheduling information in step 602 and transmits the scheduling information to the terminal in step 604 via a combination of one or more of DCI, system information, MAC CE, and RRC signaling. The terminal and base station obtain the TBS from the determined scheduling information in step 606. In step 606, the TBS can be calculated using steps 4-1 and 4-2 described above. Steps 4-1 and 4-2 can be combined and performed simultaneously, or their order can be changed. Subsequently, in step 608, CB segmentation and channel coding, decoding, and retransmission operations are performed using the TBS, completing data scheduling and transmission.

[0465] The TBS determination method provided in the embodiment can only be applied to the following case: a specific combination of the MCS index and the number of allocated PRBs pre-arranged between the base station and the terminal is not applied. For example, if the scheduling is determined using MCS index 6 and the number of PRBs is 1, the TBS can be determined as a fixed value of 328, and data can be sent instead of using the above method. Therefore, the base station and the terminal can predetermine and know the TBS value based on the combination of {MCS index or code rate index, number of PRBs}, and the TBS can be determined by the method provided in the embodiment only in cases other than the above combination.

[0466] The TBS determination method according to the present embodiment may correspond only to initial transmission, and in retransmission, transmission and reception may be performed based on the assumption that the TBS determined in the initial transmission corresponds to retransmission.

[0467] The portion of determining the TBS by comparing the code rate R with a specific value in [Embodiment 1], [Embodiment 2], [Embodiment 3], or [Embodiment 4] may be modified to compare the MCS index (such as I MCS ) or a method of comparing parameters related to MCS or code rate with a specific reference value instead of directly using the code rate for comparison.

[0468] Furthermore, when calculating NRE, the case of mapping data using rate matching is described in [Embodiment 1], [Embodiment 2], [Embodiment 3], or [Embodiment 4], but various methods may be used to calculate NRE. RE For example, N may be calculated and applied by considering one or more of the total number of allocated symbols, the number of allocated PRBs, synchronization signal block resources, reference signal resources, reserved resources, subcarrier spacing, the number of allocated time slots, code rate, modulation order, and the number of reference REs within a specific resource (e.g., the number of available REs within one PRB of one time slot or one symbol). RE .

[0469] [Example 5]

[0470] [Example 5] provides a method, when [Example 1], [Example 2], [Example 3] or [Example 4] is applied, if a specific TBS is calculated and derived, the base station and the terminal modify the calculated TBS through the method and apply the final TBS.

[0471] For example, the base station and the terminal may pre-arrange that TBS within a specific range is not transmitted. If the TBS within the specific range is calculated, the TBS to be applied can be predetermined. For example, in the process, R < 1 / 4 and A = 3872, so the number of temporary CBs is calculated to be 2. If B = 3872, the final calculated TBS is 3800. If the final calculated TBS is 3800, the terminal can determine the TBS to be 3840.

[0472] In another example, a method of applying a final TBS by comparing the TBS calculated when the base station and the terminal know the minimum or maximum value of the TBS with the minimum or maximum value prearranged or known through high-layer signaling may be used. The minimum value of the TBS may be the TBS min , and the maximum value of TBS can be TBS max .

[0473] [Example 6]

[0474] [Embodiment 6] provides a method of storing information on data received by a terminal in a soft buffer.

[0475] When transmitting downlink data, when the terminal stores the received data information in the soft buffer, the base station can know in advance how much data the terminal has stored and can accordingly notify the terminal of the start time of the stored information. The base station can notify the terminal of the range of the stored information so that the parity part with the highest retransmission probability is sent.

[0476] This may be indicated by the base station to the terminal through one or more of RRC signaling, MAC CE, DCI or L1 signaling (such as SIB).

[0477] [Example 7]

[0478] [Example 7] provides a method for calculating N RE The method, the N RE It is the number of resource regions to which data considered for calculating the temporary TBS is mapped when [Embodiment 1], [Embodiment 2], [Embodiment 3], or [Embodiment 4] is applied.

[0479] Downlink data may be transmitted using PDSCH, which is a physical channel for downlink data transmission, and at this time, one or more of the following parameters may be considered to obtain N RE .

[0480] -The number of PRBs allocated for data transmission and the number of symbols to be transmitted

[0481] - Control Resource Set (CORESET), where downlink control channels signaled in higher layers can be sent

[0482] -The area to which the scheduled DCI is mapped

[0483] - A resource region in which a reference signal (RS) for data transmission is transmitted

[0484] -Resource area corresponding to the reserved resources

[0485] - Resources in which RS for channel measurement is transmitted

[0486] -A region in which a synchronization signal block (SS block) including a synchronization signal is transmitted

[0487] - The timing of sending the control information (DCI) used for scheduling and the timing of sending the actual PDSCH

[0488] -Minimum processing time for uplink and downlink data transmission and reception

[0489] Uplink data may be transmitted using a PUSCH, which is a physical channel for uplink data transmission, and at this time, N may be obtained by considering one or more of the following parameters: RE .

[0490] -The number of PRBs allocated for data transmission and the number of symbols to be transmitted

[0491] - The region signaled by higher layers in which downlink and uplink control channels can be sent

[0492] - A resource region in which a reference signal for data transmission is transmitted

[0493] -Resource area corresponding to the reserved resources

[0494] - A resource region in which a sounding reference signal (SRS) for channel measurement is transmitted

[0495] -A region in which a synchronization signal block including a synchronization signal is transmitted

[0496] - The timing of sending the control information (uplink grant DCI) used for scheduling and the timing of sending the actual PUSCH

[0497] - Whether to include and send HARQ-ACK information for another PDSCH, the timing of sending the corresponding PDSCH, and the amount of HARQ-ACK information to be sent

[0498] - Channel State Information (CSI) reporting, reporting timing, and CSI quantity measurement

[0499] - Minimum processing time for uplink and downlink data transmission and reception

[0500] For example, if the HARQ-ACK of the PDSCH received before the time point when the DCI including the uplink scheduling grant (uplink grant) for scheduling the corresponding PUSCH is transmitted is greater than the number of specific bits, the resource region required to transmit the corresponding HARQ-ACK information can be obtained from the N resource region obtained for PUSCH transmission. RE On the other hand, the transmission of HARQ-ACK information of the PDSCH received at or after the time when the DCI including the uplink grant for scheduling the corresponding PUSCH is transmitted may not be in the N of the TBS for obtaining the PUSCH. RE The reference time point for considering the PDSCH for HARQ-ACK has been described as the time point for receiving an uplink grant, but is not limited thereto and may be determined, for example, based on the minimum processing time for uplink data transmission, downlink data reception, and HARQ-ACK transmission. This is to ensure sufficient processing time to process the TBS of the PUSCH.

[0501] In order to implement the above-mentioned embodiments of the present disclosure, Figure 7 and Figure 8 The transmitter, receiver, and processor of each of the terminal and the base station are shown in FIG. The transmission method / reception method of the base station and the terminal are described as performing embodiments 1 to 7, and each of the receiver, processor, and transmitter of the base station and the terminal should operate according to the embodiment to implement the method.

[0502] Specifically, Figure 7 is a block diagram showing the internal structure of a terminal according to an embodiment of the present disclosure. Figure 7 As shown, the terminal of the present disclosure may include a terminal receiver 700, a terminal transmitter 704, and a terminal processor 702. In the embodiments of the present disclosure, the terminal receiver 700 and the terminal transmitter 704 are collectively referred to as a transceiver. The transceiver can transmit signals to or receive signals from a base station. The signals may include control information and data. To this end, the transceiver may include: an RF transmitter that up-converts and amplifies the frequency of the transmitted signal; an RF receiver that performs low-noise amplification and down-converts the frequency of the received signal; and so on. Furthermore, the transceiver may receive signals via a radio channel, output the signals to the terminal processor 702, and transmit the signals output from the terminal processor 702 via the radio channel. The terminal processor 702 may control a series of processes to enable the terminal to operate according to the above-described embodiments of the present disclosure.

[0503] Figure 8 1 is a block diagram showing the internal structure of a base station according to an embodiment of the present disclosure. Figure 8 As shown, the base station of the present disclosure may include a base station receiver 801, a base station transmitter 805, and a base station processor 803. In the embodiments of the present disclosure, the base station receiver 801 and the base station transmitter 805 are collectively referred to as a transceiver. The transceiver can send signals to and receive signals from the terminal. The signals may include control information and data. To this end, the transceiver includes: an RF transmitter that up-converts and amplifies the frequency of the transmitted signal; an RF receiver that performs low-noise amplification and down-converts the frequency of the received signal; and so on. In addition, the transceiver can receive signals through a radio channel, output the signals to the base station processor 803, and transmit the signals output from the base station processor 803 through the radio channel. The base station processor 803 can control a series of processes so that the base station operates according to the above-mentioned embodiments of the present disclosure.

[0504] At the same time, the embodiments of the present disclosure disclosed in the specification and the drawings have been presented to easily explain the technical content of the present disclosure and help understand the present disclosure, and do not limit the scope of the present disclosure. That is, it is obvious to those skilled in the art that different modifications can be implemented based on the technical spirit of the present disclosure. Some of the embodiments can be operated so that one or more of the embodiments are combined. For example, the base station and the terminal can operate based on the combination of [Embodiment 1] and [Embodiment 3] of the present disclosure.< / null>

Claims

1. A method performed by a terminal in a wireless communication system, the method comprising: receiving control information for scheduling downlink data from a base station; identifying the number of temporary information bits based on a modulation order and a code rate of downlink data, the modulation order and the code rate being included in the control information; identifying a transport block size TBS based on the code rate and the number of temporary information bits; and Decode downlink data based on the identified TBS, wherein TBS is a number identified by subtracting 24 from a multiple of both 8 and the number of temporary code blocks CB used to identify TBS, and The number of temporary CBs used to identify the TBS is identified based on the number of temporary information bits and whether the code rate is equal to or less than 1 / 4.

2. The method according to claim 1, wherein When the code rate is equal to or less than 1 / 4, the number C of temporary CBs used to identify TBS is based on Identified and TBS is based on Identified, where A is the number of temporary information bits.

3. The method according to claim 1, wherein When the code rate is greater than 1 / 4 and the number of temporary information bits A is greater than 8424, the number C of temporary CBs used to identify TBS is based on Identified and TBS is based on Identifiable.

4. The method according to claim 1, wherein When the code rate is greater than 1 / 4 and the number of temporary information bits is equal to or less than 8424, the number of temporary CBs used to identify the TBS is 1.

5. The method according to claim 1, wherein The number of temporary information bits is based on N RE ×Q m ×R×v identification, where N RE is the number of resource elements RE used for downlink data, Q m is the modulation order, R is the code rate, v is the number of layers, and The number of REs is identified by multiplying the number of REs per physical resource block (PRB) by the number of PRBs allocated to downlink data.

6. A method performed by a base station in a wireless communication system, the method comprising: Sending control information for scheduling downlink data to the terminal; and Send downlink data to the terminal based on the transport block size TBS, Here, TBS is a number identified by subtracting 24 from a multiple of 8 and the number of temporary code blocks CB used to identify TBS, The number of temporary CBs used to identify the TBS is based on the number of temporary information bits and whether the code rate of downlink data is equal to or less than 1 / 4, and The number of temporary information bits is based on the modulation order and code rate of the downlink data, and the modulation order and code rate are included in the control information.

7. The method according to claim 6, wherein: When the code rate is equal to or less than 1 / 4, the number C of temporary CBs used to identify TBS is based on And TBS is based on Where A is the number of temporary information bits.

8. The method according to claim 6, wherein: When the code rate is greater than 1 / 4 and the number of temporary information bits A is greater than 8424, the number C of temporary CBs used to identify TBS is based on And TBS is based on 9. The method according to claim 6, wherein: When the code rate is greater than 1 / 4 and the number of temporary information bits is equal to or less than 8424, the number of temporary CBs used to identify the TBS is 1.

10. The method according to claim 6, wherein: The number of temporary information bits is based on N RE ×Q m ×R×v, where N RE is the number of resource elements RE used for downlink data, Q m is the modulation order, R is the code rate, v is the number of layers, and The number of REs is based on the product of the number of REs per physical resource block (PRB) and the number of PRBs allocated to downlink data.

11. A terminal in a wireless communication system, the terminal comprising: transceiver; and A controller is coupled to the transceiver and is configured to: receiving control information for scheduling downlink data from a base station; identifying the number of temporary information bits based on a modulation order and a code rate of downlink data, the modulation order and the code rate being included in the control information; identifying a transport block size TBS based on the code rate and the number of temporary information bits; and Decode downlink data based on the identified TBS, wherein TBS is a number identified by subtracting 24 from a multiple of both 8 and the number of temporary code blocks CB used to identify TBS, and The number of temporary CBs used to identify the TBS is identified based on the number of temporary information bits and whether the code rate is equal to or less than 1 / 4.

12. The terminal according to claim 11, wherein: When the code rate is equal to or less than 1 / 4, the number C of temporary CBs used to identify TBS is based on Identified and TBS is based on Identified, where A is the number of temporary information bits. The terminal according to claim 11 , wherein: When the code rate is greater than 1 / 4 and the number of temporary information bits A is greater than 8424, the number C of temporary CBs used to identify TBS is based on Identified and TBS is based on Identifiable. The terminal according to claim 11 , wherein: When the code rate is greater than 1 / 4 and the number of temporary information bits is equal to or less than 8424, the number of temporary CBs used to identify the TBS is 1. The terminal according to claim 11 , wherein: The number of temporary information bits is based on N RE ×Q m ×R×v identification, where N RE is the number of resource elements RE used for downlink data, Q m is the modulation order, R is the code rate, v is the number of layers, and The number of REs is identified by multiplying the number of REs per physical resource block (PRB) by the number of PRBs allocated to downlink data.

16. A base station in a wireless communication system, the base station comprising: transceiver; and A controller is coupled to the transceiver and is configured to: Sending control information for scheduling downlink data to the terminal; and Send downlink data to the terminal based on the transport block size TBS, Here, TBS is a number identified by subtracting 24 from a multiple of 8 and the number of temporary code blocks CB used to identify TBS, The number of temporary CBs used to identify the TBS is based on the number of temporary information bits and whether the code rate of downlink data is equal to or less than 1 / 4, and The number of temporary information bits is based on the modulation order and code rate of the downlink data, and the modulation order and code rate are included in the control information.

17. The base station according to claim 16, wherein: When the code rate is equal to or less than 1 / 4, the number C of temporary CBs used to identify TBS is based on And TBS is based on Where A is the number of temporary information bits.

18. The base station according to claim 16, wherein: When the code rate is greater than 1 / 4 and the number of temporary information bits A is greater than 8424, the number C of temporary CBs used to identify TBS is based on And TBS is based on 19. The base station according to claim 16, wherein: When the code rate is greater than 1 / 4 and the number of temporary information bits is equal to or less than 8424, the number of temporary CBs used to identify the TBS is 1.

20. The base station according to claim 16, wherein The number of temporary information bits is based on N RE ×Q m ×R×v, where N RE is the number of resource elements RE used for downlink data, Q m is the modulation order, R is the code rate, v is the number of layers, and The number of REs is based on the product of the number of REs per physical resource block (PRB) and the number of PRBs allocated to downlink data.

Images