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

Abstract

The disclosure relates to a communication technology and a system thereof that fuse a 5G communication system supporting a higher data transmission rate than a 4G system with IoT technology. The disclosure can be applied to intelligent services, such as smart homes, smart buildings, smart cities, smart cars or connected cars, healthcare, digital education, retail, security and safety-related services, etc., based on 5G communication technology and IoT-related technology. In the disclosure, a method and apparatus for determining a size of a transport block in a communication or broadcasting system are disclosed.

Description

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

[0002] This disclosure relates to a method and apparatus for determining the size of a transport block in a communication or broadcasting system. Background Technology

[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 or near-5G communication systems. Therefore, 5G or near-5G communication systems are also referred to as post-4G network communication systems or post-LTE systems.

[0004] To achieve high data transmission rates, the implementation of 5G communication systems in millimeter-wave (mmWave) bands (e.g., the 60 GHz band) is being considered. In 5G communication systems, technologies such as beamforming, massive MIMO, full-dimensional MIMO (FD-MIMO), array antennas, analog beamforming, and massive MIMO are being discussed as means to mitigate propagation path loss and increase propagation distance in the millimeter-wave 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, cooperative communication, 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] Simultaneously, the internet has evolved from a human-centric 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) technology has emerged, where big data processing technologies are combined with IoT technologies through connections to cloud servers, etc. Implementing IoT requires technological factors such as sensing technology, wired / wireless communication, network infrastructure, service interface technology, and security technology. Recently, technologies such as sensor networks, machine-to-machine (M2M) communication, and machine-type communication (MTC) for connecting objects have been researched. In the IoT environment, by collecting and analyzing data generated in connected objects, intelligent Internet Technology (IT) services that create new value for people's lives can be provided. IoT can be applied to fields such as smart homes, smart buildings, smart cities, smart cars, connected cars, smart grids, healthcare, smart appliances, or high-tech medical services through the integration of traditional information technology (IT) and various industries.

[0008] Therefore, various attempts have been made to apply 5G communication to IoT networks. For example, 5G communication technologies such as sensor networks, machine-to-machine (M2M) communication, and machine-type communication (MTC) are implemented using beamforming, MIMO, and array antenna techniques. Cloud RAN, as an application of big data processing technology, can be seen as an example of the integration 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, and inter-symbol interference (ISI). Therefore, to achieve high-speed digital communication and broadcasting systems requiring high data throughput and high reliability, such as those used in next-generation mobile communications, digital broadcasting, and mobile internet, it is necessary to develop techniques for removing noise, fading, and ISI. As part of denoising research, error-correcting codes have recently been actively studied, aiming to achieve a method to improve communication reliability by efficiently reconstructing information distortion. Summary of the Invention

[0010] Technical issues

[0011] This disclosure provides a method and apparatus for determining the transport block size (TBS), wherein the TBS is the size of the transport block (TB), through which the characteristics of low-density parity-check (LDPC) codes can be used to efficiently transmit data.

[0012] Technical solution

[0013] According to one aspect of this disclosure, a method is provided for a terminal to identify the Transport Block Size (TBS) in a wireless communication system. 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 both 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 scheduling information is equal to or less than 0.25 and the number of temporary information bits is N, then based on 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 greater than 8424 (N), then based on... Identify the number of temporary CBs.

[0015] According to another aspect of this disclosure, a method is provided for a base station to identify a Transport Block Size (TBS) in a wireless communication system. The method includes: identifying control information for scheduling; sending the control information for scheduling to a terminal; identifying a 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 sending downlink data based on the identified TBS, wherein the TBS is a multiple of both 8 and the number of temporary code blocks (CBs) identified based on the control information for scheduling.

[0016] According to another aspect of this disclosure, a terminal is provided for identifying the Transport Block Size (TBS) in a wireless communication system. 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, wherein the controller is connected to the transceiver, and the TBS is a multiple of both 8 and the number of temporary code blocks (CBs) identified based on the control information for scheduling.

[0017] Beneficial effects of the invention

[0018] This disclosure provides a method and apparatus for efficiently transmitting and receiving data by using the characteristics of LDPC codes, allocated resources, and code rate to minimize the addition of unnecessary bits to determine the TBS as the size of the TB. Attached Figure Description

[0019] Figure 1This illustrates the transmission structure in the downlink time-frequency domain of an LTE or LTE-A system;

[0020] Figure 2 This illustrates the transmission structure in the uplink time-frequency domain of an LTE or LTE-A system.

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

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

[0023] Figure 5 This illustrates a method for dividing a transport block (TB) into code blocks;

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

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

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

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

[0028] In describing exemplary embodiments of this disclosure, descriptions relating to technical content known in the art to which this disclosure pertains and not directly related to this disclosure will be omitted. Such omission of unnecessary descriptions is intended to prevent obscuring the main ideas of this disclosure and to more clearly convey them.

[0029] For the same reason, some elements may be enlarged, omitted, or shown schematically in the accompanying drawings. Furthermore, the dimensions of each element do not perfectly reflect the actual dimensions. In the accompanying drawings, identical or corresponding elements have the same reference numerals.

[0030] The advantages and features of this disclosure, as well as the ways in which they are implemented, will become apparent from the embodiments described in detail below with reference to the accompanying drawings. However, this disclosure is not limited to the embodiments set forth below, but can be implemented in a variety of different forms. The following embodiments are provided merely to fully disclose this disclosure and to inform those skilled in the art of its scope, and this disclosure is limited only by the scope of the appended claims. Throughout the specification, the same or similar reference numerals denote the same or similar elements.

[0031] Here, it should be understood that each block of the flowchart illustration, and combinations of blocks in the flowchart illustration, can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart block(s). These computer program instructions can also be stored in a computer-usable or computer-readable storage medium, which can instruct the computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-usable or computer-readable storage medium produce an article of writing including instruction means for implementing the functions specified in the flowchart block(s). The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus, thereby producing a computer-implemented process, such that the instructions, which execute on the computer or other programmable apparatus, provide steps for implementing the functions specified in the flowchart block(s).

[0032] Furthermore, each block in the flowchart can represent a module, segment, or section of code, which includes one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions marked in the blocks may not occur in sequence. For example, depending on the functions involved, two blocks shown consecutively may actually execute substantially simultaneously, or these blocks may sometimes execute in reverse order.

[0033] As used herein, "cell" refers to a software or hardware element that performs a predetermined function, such as a Field Programmable Gate Array (FPGA) or Application Specific Integrated Circuit (ASIC). However, "cell" is not always limited to software or hardware. A "cell" can be configured to be stored in addressable storage media or to execute one or more processors. Therefore, a "cell" includes, for example, software elements, object-oriented software elements, class elements or task elements, processes, functions, attributes, procedures, subroutines, code segments, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and parameters. Elements and functions provided by a "cell" can be combined into a smaller number of elements, "cells," or divided into a larger number of elements, "cells." Furthermore, elements and "cells" can be implemented to reproduce one or more CPUs within a device or secure multimedia card. And, in embodiments, a "cell" may include one or more processors.

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

[0035] In the following description, 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 where such descriptions may make the subject matter of the disclosure considerably unclear. The terminology described below is defined in consideration of the functions in the present disclosure and may vary depending on the user, user intent, or habit. Therefore, the definitions of the terminology should be made based on the entirety of this specification.

[0036] In the following text, a base station (BS) is an entity that allocates resources to a terminal and can be one of a gNode B, eNodeB, Node B, radio access unit, base station controller, or node on a network. A terminal may include a user equipment (UE), a mobile station (MS), a cellular phone, a smartphone, a computer, and a multimedia system capable of performing communication functions. In this disclosure, downlink (DL) refers to the radio transmission path of signals transmitted from the base station to the terminal, and uplink (UL) refers to the radio transmission path of signals transmitted from the terminal to the base station.

[0037] In the following description, embodiments of the present disclosure are illustrated by way of example based on an LTE or LTE-A system (hereinafter referred to as an LTE system), but embodiments of the present disclosure can also be applied to other communication systems with similar backgrounds or channel configurations. For example, fifth-generation mobile communication technologies (5G, New Radio, and NR) developed after LTE-A may be included therein. Embodiments of the present disclosure can be applied to other communication systems with modifications, based on the determination of those skilled in the art, without departing from the scope of the present disclosure.

[0038] As a representative example of a broadband wireless communication system, the LTE 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 these multiple access schemes, time-frequency resources used to carry data or control information are allocated and manipulated in a way that avoids resource overlap; that is, orthogonality is established among users to identify each user's data or control information.

[0039] When decoding fails during the initial transmission, the LTE system employs 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 acknowledgment (NACK) to the transmitter, allowing the transmitter to retransmit the corresponding data at the physical layer. The receiver improves data reception performance by combining the retransmitted data with the failed-to-decode data. Conversely, if the receiver correctly decodes the data, it sends an acknowledgment (ACK) reporting successful decoding, prompting the transmitter to send new data.

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

[0041] exist Figure 1 In the diagram, the horizontal axis indicates the time domain and the vertical axis indicates the frequency domain. The smallest transmission unit in the time domain is an OFDM symbol. A time slot of 10⁶ consists of N... symb A radio frame 105 consists of 10 OFDM symbols 102, and a subframe 105 consists of 2 time slots. The length of one time slot is 0.5 ms, and the length of one subframe is 1.0 ms. Radio frames 114 are time-domain intervals consisting of 10 subframes. In the frequency domain, the smallest transmission unit is a subcarrier. The bandwidth of the entire system's transmission frequency band is determined by a total of N. BW It consists of 104 subcarriers.

[0042] The basic unit of a resource in the time-frequency domain is a resource element (RE) 112, which can be indicated by an OFDM symbol index and a subcarrier index tu. A resource block (RB or physical resource block (PRB)) 108 is formed by N in the time domain. symb A series of consecutive OFDM symbols 102 and N in the frequency domain RB A series of consecutive subcarriers 110 are defined. Therefore, an RB 108 includes N symb ×N RB 112 REs. Typically, the smallest unit of data transmission is an RB unit. Typically, in LTE systems, N... symb =7 and N RB =12. NBW The data rate is proportional to the system's transmission bandwidth. The data rate increases proportionally to the number of Resource Blocks (RBs) scheduled in the terminal.

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

[0044] [Table 1]

[0045]

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

[0047] In LTE systems, scheduling information for downlink or uplink data is transmitted from the base station to the terminal via downlink control information (DCI). DCI is defined in various formats. The specific DCI format is applied and operated based on whether it is scheduling information for uplink data (UL license) or downlink data (DL license), whether it is a compact DCI with small-size control information, whether it utilizes spatial multiplexing with multiple antennas, and whether it is a DCI for power control. For example, DCI format 1, indicating scheduling control information (DL license) 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 uses a bitmap scheme and allocates resources in units of Resource Block Groups (RBGs). In LTE systems, the basic scheduling unit is a resource block (RB) represented by time-domain and frequency-domain resources, and in Type 0, an RBG comprises multiple RBs and is used as the basic scheduling unit. Type 1 allows the allocation of predetermined RBs within an RBG.

[0049] - Resource Block Allocation: Indicates the Resource Blocks (RBs) allocated for data transmission. The resource represented is determined based on 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 (i.e., the data to be sent).

[0051] -HARQ process ID: Indicates the process ID of HARQ.

[0052] - New Data Indicator: Indicates whether HARQ is an initial transmission or a HARQ retransmission.

[0053] - Redundancy Version (RV): Indicates a redundant version of HARQ.

[0054] Transmission Power Control (TPC) Commands for Physical Uplink Control Channel (PUCCH): Indicates the transmission power control commands used for the PUCCH, which is the uplink control channel.

[0055] DCI is transmitted via the Physical Downlink Control Channel (PDCCH) or Enhanced PDCCH (EPDCCH) as the downlink physical control channel, through channel coding and modulation processes. In the following text, PDCCH transmission / reception or EPDCCH transmission / reception can be understood as DCI transmission / reception over PDCCH or EPDCCH. This technique can also be applied to other channels.

[0056] Typically, each individual PDCCH is configured and transmitted independently for each terminal by scrambling the DCI using a specific Radio Network Temporary Identifier (RNTI) (or terminal identifier), adding Cyclic Redundancy Check (CRC), and performing channel coding. In the time domain, the PDCCH is mapped and transmitted during the control channel transmission interval. In the frequency domain, the mapping position of the PDCCH is determined by each terminal's identifier (ID) and propagated throughout the system's transmission band.

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

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

[0059] The modulation schemes supported by the LTE system include Quadrature Phase Shift Keying (QPSK), 16 Quadrature Amplitude Modulation (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 The basic structure of the time-frequency domain is shown, 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 smallest transmission unit in the time domain is an SC-FDM symbol, and a time slot of 206 consists of N symb It consists of 202 SC-FDMA symbols. A subframe 205 includes two time slots. The smallest transmission unit in the frequency domain is a subcarrier, and the entire system transmission bandwidth is composed of a total of N. BW It consists of 204 subcarriers. N BW It has a value proportional to the system's transmission bandwidth.

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

[0063] In LTE systems, the timing relationships of the PUCCH or Physical Uplink Shared Channel (PUSCH), which serve as the uplink physical channels through which HARQ ACK / NACK are transmitted, are defined. HARQ ACK / NACK corresponds to the PDSCH, which serves as the physical channel for downlink data transmission, or the PDCCH or EPDCCH, which includes a semi-permanent schedule 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-4)th subframe, or the PDCCH or EPDCCH including an SRS release, is transmitted to the PUCCH or PUSCH in the nth subframe.

[0064] In LTE systems, downlink HARQ employs an asynchronous HARQ scheme where the timing of retransmissions is not fixed. That is, if the base station receives a HARQ NACK feedback from the terminal regarding the initial data transmitted by the base station, the base station freely determines the timing of retransmitting the data via scheduling operations. For HARQ operations, the terminal buffers data identified as erroneous based on the result of decoding the received data, and then combines that data with subsequently retransmitted data.

[0065] If the terminal receives a PDSCH containing downlink data from the base station via subframe n, then in subframe n+k, the terminal sends uplink control information, including downlink data, to the base station via PUCCH or PUSCH, consisting of HARQ ACK or NACK. In this case, k is defined differently depending on whether the LTE system uses FDD or Time Division Duplex (TDD) and its subframe configuration. For example, in an FDD LTE system, k is fixed at 4. Meanwhile, in a TDD LTE system, k can be changed based on the subframe configuration and subframe number.

[0066] In LTE systems, unlike downlink HARQ, uplink HARQ employs a synchronous HARQ scheme, where the timing of data transmission is fixed. Specifically, the uplink / downlink timing relationship between the PUSCH (physical channel for uplink data transmission), the PDCCH (downlink control channel preceding it), 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 sending downlink HARQ ACK / NACK in subframe n, the terminal will send uplink data corresponding to the control information via PUSCH in subframe n+k. In this case, k is defined differently depending on whether the LTE system uses FDD or TDD and its configuration. For example, in an FDD LTE system, k is fixed at 4. Meanwhile, in a TDD LTE system, k can be changed according to the subframe configuration and subframe number.

[0068] Furthermore, if the terminal receives a PHICH carrying downlink HARQ ACK / NACK from the base station in subframe i, then 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 uses FDD or TDD and its configuration. For example, in the case of an FDD LTE system, k is fixed at 4. Meanwhile, in the case of a TDD LTE system, k can be changed according to the subframe configuration and subframe number.

[0069] Furthermore, when transmitting data over multiple carriers, k can be applied differently depending on the TDD configuration of each carrier.

[0070] [Table 2]

[0071]

[0072]

[0073]

[0074] Table 2 above shows the supported DCI formats for each transmission mode, as set by the C-RNTI, in 3GPP TS 36.213. The terminal assumes that the corresponding DCI format exists in the control area interval according to the preset transmission mode and performs search and decoding. For example, if transmission mode 8 is indicated 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] This description of a wireless communication system is provided from the perspective of an LTE system; however, this disclosure is not limited to LTE systems and can be applied to various wireless communication systems such as NR and 5G. Furthermore, if this embodiment is applied to other wireless communication systems, k can be changed and applied to systems using modulation schemes corresponding to FDD.

[0076] This disclosure provides methods and apparatus for transmitting coded bits that can support various input lengths and code rates. Furthermore, this disclosure provides methods for configuring a base graph of LDPC codes for data channel transmission, and methods and apparatus for segmenting transport blocks (TBs) using LDPC codes.

[0077] The low-density parity-check (LDPC) code will then be described.

[0078] LDPC codes are a type of linear block code, and the process of determining codewords that satisfy conditions such as [Equation 1] below is included.

[0079] [Equation 1]

[0080]

[0081] In [Equation 1],

[0082] In [Equation 1], H represents the parity check matrix, C represents the codeword, and c i Let N represent the i-th bit of the codeword, and N... ldpc This indicates the LDPC codeword length. Here, h... i This represents the i-th column of the parity check matrix (H).

[0083] Parity check matrix H includes N ldpc The N column ldpc The number of bits is the same as that of the LDPC codeword. [Equation 1] means that the i-th column (h) of the parity check matrix i ) and the i-th codeword bit c i The sum of the products of is "0", therefore the i-th column (h) i ) and the i-th codeword bit c i Related.

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

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

[0086] As shown in [Equation 2] below, the permutation matrix P = P(P) of size Z × Z is... ij (is defined.)

[0087] [Equation 2]

[0088]

[0089] In [Equation 2], P ij (0 ≤ i, j < Z) is an element (entry) in the i-th row and j-th column of 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.

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

[0091] [Equation 3]

[0092]

[0093] If P -1 is defined as a zero matrix of size Z×Z, then each exponent a ij of the cyclic permutation matrix or zero matrix has a value in {-1, 0, 1, 2,..., Z - 1}. In addition, 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.

[0094] Generally, a binary matrix of size m×n obtained by replacing the cyclic permutation matrix and zero matrix in the parity-check matrix of the above [Equation 3] with 1s and 0s 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 zero matrix is determined as the exponent matrix E(H) of the parity-check matrix H.

[0095] [Equation 4]

[0096]

[0097] Meanwhile, the performance of the LDPC code can be determined based on the parity-check matrix. Therefore, an efficient parity-check matrix for LDPC codes with excellent performance needs to be designed. In addition, LDPC encoding and decoding methods that support various input lengths and code rates are required.

[0098] Use the method of lifting, which is known as an effective design for QC-LDPC codes. Lifting is a method for effectively designing a very large parity-check matrix by configuring the Z value that determines the size of the cyclic permutation matrix or zero 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.

[0099] If the LDPC code C0 is given, then the S QC-LDPC codes to be designed using the lifting method are C1, C2, ..., C0. k ,...,C S (Similarly, for C) k For example, 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 and column blocks of the permutation matrix included in the parity check matrix is ​​Z. k C0 corresponds to a matrix with parent matrices C1,..., and C... S As the smallest LDPC code for parity checking matrices, the Z0 value corresponding to the size of the row and column blocks is 1, and for Z... k <Z k+1 For example, 0 ≤ k ≤ S-1. For convenience, each code C... k Parity check matrix H k Having an exponential matrix E(H) of size mХn k ))=a i,j (k) And the values ​​{-1,0,1,2,...,Z} k One of the -1} is chosen as each index a i,j (k) The improvement process includes steps C0→C1→...→C S And characterized by Z k+1 =q k+1 Z k (q k+1 (where k is a positive integer, k = 0, 1, ..., S-1). If, due to the characteristics of the lifting process, only C... S Parity check matrix H S Once stored, all QC-LDPC codes C0, C1, ..., C can be indicated using the following [Equation 5] or [Equation 6] according to the promotion method. S .

[0100] [Equation 5]

[0101]

[0102] [Equation 6]

[0103] E(H k )≡E(H S modZ k

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

[0105] [Equation 7]

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

[0107] In [Equation 7], f(x,y) is a predefined function with x and y as input values. i,j It corresponds to the maximum LDPC code (e.g., the C in the description above). S The corresponding elements in the i-th row and j-th column of the exponent matrix of the parity check matrix. ij This corresponds to an LDPC code having a predetermined size (e.g., the C in the description above). k The corresponding elements in the exponent matrix of the parity check matrix are the elements in the i-th row and j-th column, and Z is the size of the row and column blocks of the cyclic matrix included in the parity check matrix of the corresponding LDPC code. Therefore, if V i,j A parity check matrix for LDPC codes of a predetermined size can be defined.

[0108] In the description of this disclosure, which will be provided later, the above symbols are named, defined and used as follows.

[0109] [Definition 1]

[0110] E(H S ): Maximum Exponential Matrix

[0111] V i,j : Maximum exponential matrix element (and E(H) S The (i,j)th element corresponds to)

[0112] The maximum exponent matrix or maximum exponent matrix element defined above can be used to indicate the parity check matrix used for the predefined LDPC code.

[0113] In next-generation mobile communication systems, multiple maximum exponent matrices as defined above can exist to ensure optimal performance for code blocks of various lengths. For example, there can be M different maximum exponent matrices, which can be represented as shown in the following table.

[0114] [Equation 8]

[0115] E(H S )1, E(H S )2,...,E(H S ) M

[0116] There can be multiple corresponding maximum exponent matrix elements, which can be represented as shown in the following table.

[0117] [Equation 9]

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

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

[0120] The method for turbo code-based block segmentation and CRC addition from the LTE TS 36.213 documentation is referenced below.

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

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

[0123] -Z = 6144.

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

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

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

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

[0128]

[0129]

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

[0131] Number of bits in each code block (only applicable when C≠0):

[0132] First segment size K + =The smallest K in Table 5.1.3-3 of the LTE TS 36.213 document that satisfies C·K≥B′.

[0133]

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

[0135]

[0136]

[0137] Unlike LTE systems, 5G and next-generation communication systems use LDPC codes in the data channel. Even when using LDPC codes, 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 can have different values. Bit-level interleaving can be applied to individual code blocks, code block groups, or transport blocks.

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

[0139] exist Figure 3 In the LDPC code, the two basic structures of the basic graph 300 supporting data channel coding are essentially 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 of 320 and a maximum horizontal length of 68, while the second basic graph structure of the LDPC code is a matrix structure with a maximum vertical length of 320 and a maximum horizontal length of 318 and a maximum horizontal length of 52. The first basic graph structure of the LDPC code can support code rates from a minimum of 1 / 3 to a maximum of 8 / 9, while the second basic graph structure of the LDPC code can support code rates from a minimum of 1 / 5 to a maximum of 8 / 9.

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

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

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

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

[0144] [Table 3]

[0145]

[0146]

[0147] In the first fundamental graph structure of LDPC codes, the size of a supportable code block is as follows.

[0148] 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)

[0149] The above sizes may also include (5984, 6688, 7392, 8096).

[0150] Based on the first fundamental graph (BG#1) of LDPC codes, a total of M maximum exponent matrices are additionally defined. Typically, M can have a value of 8 or a random natural value, and i can have values ​​from 1 to M. The terminal uses a matrix. Perform downlink data decoding or uplink data encoding. Matrix It has specific element values ​​shifted from the first fundamental graph (BG#1) of the LDPC code. That is, the matrix They can have different shift values.

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

[0152] [Table 4]

[0153]

[0154]

[0155] In the second fundamental graph structure of LDPC codes, the size of a 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)

[0156] In the sizes above, (2880, 3200, 3520, 3840, 2720, 3040, 3360, 3680) are values ​​that can be included.

[0157] Based on the second fundamental graph (BG#2) of LDPC codes, a total of M maximum exponent matrices are additionally defined. Typically, M can have a value of 8 or a random natural value, and i can have values ​​from 1 to M. The terminal uses a matrix. Perform downlink data decoding or uplink data encoding. Matrix It has specific element values ​​shifted from the second fundamental graph (BG#2) of the LDPC code. That is, the matrix They can have different shift values.

[0158] As mentioned above, two types of basic diagrams are provided in next-generation mobile communication systems. Therefore, a particular 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.

[0159] [Table 5]

[0160]

[0161] When receiving downlink data information from the base station via downlink control information, the terminal supporting type 1 determines that the basic graph applied to the transport block including downlink data information is always the first basic graph, and the maximum exponent matrix is ​​used. Applied to data encoding or decoding. When receiving downlink data information from a base station via downlink control information, terminals supporting Type 2 determine that the basic graph applied to the transport block including downlink data information is always the second basic graph, and the maximum exponent matrix is ​​used. It is applied to data encoding or decoding. When receiving downlink data information from a base station via downlink control information, Type 3 supporting terminals pre-configured the basic graph of the transport block, which includes downlink data information, from the base station via higher-layer signaling (such as SIB, RRC, or MAC CE) or via downlink control information transmitted in the UE group common control channel, UE (cell) common control channel, or UE-specific control channel. The downlink control information can be included together with transport block scheduling information or separately.

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

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

[0164] 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.

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

[0166] B. The size of the transport block included in the downlink control information

[0167] C. Basic graph indicators included in downlink control information

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

[0169] If the RNTI scrambled in the downlink control information CRC 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) (e.g., Semi-Permanent Scheduling (SPS)-RNTI or Cell RNTI (C-RNTI)), then in step 420, the terminal determines condition 1 and performs operation 1.

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

[0171] If the size of the transport block included in the downlink control information as condition B is greater than or equal to a predetermined threshold (Δ1), then in step 420, the terminal determines condition 1 and executes operation 1.

[0172] If the size of the transport block included in the downlink control information as condition B is equal to or less than a predetermined threshold (Δ2), then in step 430, the terminal determines condition 2 and executes operation 2.

[0173] The threshold (Δ1) or threshold (Δ2) can be a fixed value of 2560 (or 3840, 960, 1040, 1120, 170, 640, or a predetermined value). Furthermore, the threshold (Δ1) or threshold (Δ2) can be the same as or different from each other.

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

[0175] Alternatively, if the downlink control information included in condition B contains a transport block size, and the CRC is less than 2560 (or 3840) (and greater than 160 or 640), and if the minimum block length (K) between the first basic graph's supported block length (K) and the second basic graph's supported block length (K) satisfies K > (transport block size + CRC size), then... min If it belongs to the first basic graph, then in step 420, the terminal determines condition 1 and executes operation 1.

[0176] Alternatively, if the downlink control information included in condition B contains a transport block size and a CRC less than 2560 (or 3840) (and greater than 160 or 640), and if the minimum block length K among the first basic graph's supported block length (K) and the second basic graph's supported block length (K) that satisfies K > (transport block size + CRC size) belongs to the second basic graph, then in step 430, the terminal determines condition 2 and executes operation 2.

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

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

[0179] K*=min(K)

[0180] If K*∈K 1 Condition 1 is satisfied, therefore operation 1 is performed in step 420.

[0181] If K*∈K 2 Condition 2 is satisfied, therefore operation 2 is performed in step 430.

[0182] K is the block length, K* is the selected block length, and TB is the transport block size. Additionally, CRC is the CRC size, and K... 1 It is the set of code block lengths that the first fundamental graph can support, and K 2 It is the set of code block lengths that the second basic graph can support.

[0183] Alternatively, they can be expressed using the following equation.

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

[0185] K*=min(K)

[0186] If K*∈K 1 Condition 1 is satisfied, therefore operation 1 is performed in step 420.

[0187] If K*∈K 2 Condition 2 is satisfied, therefore operation 2 is performed in step 430.

[0188] K is the block length, K* is the selected block length, and TB is the transport block size. Additionally, CRC is the CRC size, and K... 1 It is the set of code block lengths that the first fundamental graph can support, and K 2 It is the set of code block lengths that the second basic graph can support.

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

[0190] Alternatively, if TB+CRC is less than V1 in the above equation, then the maximum exponent matrix can be applied. One of them is used to perform decoding or encoding. If TB+CRC is greater than V2 in the above equation, then it can be done by applying the maximum exponent matrix. One of them is used to perform decoding or encoding.

[0191] K 1 It is the first fundamental graph (or the largest exponential matrix) The set of code block lengths that can be supported, and the type of the set can be one or a combination of two or more of the following values.

[0192] 1. Cases where K is equal to or less than 2560

[0193] 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

[0194] 2. Cases where K is equal to or less than 3840

[0195] 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

[0196] 3. Cases where K is equal to or less than 960

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

[0198] 4. Cases where K is equal to or less than 1040

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

[0200] 5. Cases where K is equal to or less than 1120

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

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

[0203] K 2 It is the second fundamental graph (or the largest exponential matrix). The set of code block lengths that can be supported, and the type of the set can be one or a combination of two or more of the following values.

[0204] 1. Cases where K is equal to or less than 2560

[0205] 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

[0206] 2. Cases where K is equal to or less than 3840

[0207] 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)

[0208] 3. Cases where K is equal to or less than 960

[0209] 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

[0210] 4. Cases where K is equal to or less than 1040

[0211] 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

[0212] 5. Cases where K is equal to or less than 1120

[0213] 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

[0214] If the basic graph indicator value included in the downlink control information as condition C is 0 (or 1), then in step 420, the terminal determines condition 1 and executes operation 1.

[0215] If the basic graph indicator value included in the downlink control information as condition C is 1 (or 0), then in step 430, the terminal determines condition 2 and executes operation 2.

[0216] If the downlink control information included in condition D contains scheduling-related values ​​such as MCS, RV, NDI, or frequency or time resource allocation values ​​that indicate specific information, then in step 420, the terminal determines condition 1 and performs operation 1.

[0217] If the downlink control information included in condition D contains scheduling-related values ​​such as MCS, RV, NDI, or frequency or time resource allocation values ​​that indicate specific information, then in step 430, the terminal determines condition 2 and executes operation 2.

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

[0219] 1. The terminal is based on the first basic graph (or the maximum exponential matrix). The supported code block length is used to attempt to decode the transport block indicated by the downlink control information.

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

[0221] 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)

[0222] 3. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the first basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

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

[0226] 4. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the first basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

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

[0230] 5. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the first basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

[0233] C.1760, 3520, 7040

[0234] D.3520, 7040

[0235] E.7040

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

[0237] 6. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the first basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

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

[0241] 7. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the first basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

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

[0245] 8. Among the following available sets of code blocks, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the first basic graph. Attempt to decode the transport block indicated by downlink control information.

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

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

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

[0249] 9. Among the following available sets of code blocks, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the first basic graph. Attempt to decode the transport block indicated by downlink control information.

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

[0251] B.2816, 4224, 7040

[0252] 10. Among the following available sets of code blocks, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the first basic graph. Attempt to decode the transport block indicated by downlink control information.

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

[0254] B.5632, 8448

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

[0256] 1. The terminal attempts to decode the transport block indicated by the downlink control information based on the code block length supported by the second basic graph.

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

[0258] 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)

[0259] 3. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the second basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

[0262] 4. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the second basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

[0265] 5. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the second basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

[0268] 6. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the second basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

[0271] 7. Among the following available code block sets, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the second basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

[0274] 8. Among the following available sets of code blocks, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the second basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

[0277] 9. Among the following available sets of code blocks, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the second basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

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

[0280] 10. Among the following available sets of code blocks, one or more combinations correspond to the terminal use. Encoded or decoded code blocks. For each code block, the terminal is based at least on the matrix supported by the second basic graph. Attempt to decode the transport block indicated by the downlink control information.

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

[0282] B.2560, (3840)

[0283] In this disclosure, the numbers in parentheses indicate whether the corresponding values ​​may or may not be included.

[0284] In this disclosure, information bits may refer to the amount of data to be transmitted from a higher layer or the transport block size (TBS). A TBS is typically transmitted within a single TTI, but may be transmitted over multiple TTIs. In this disclosure, the TBS is indicated by N.

[0285] In this disclosure, the values ​​enclosed in parentheses in the tables shown are values ​​that can be included in whole or in part in the tables, or all or some of the values ​​may not be included in the tables.

[0286] Figure 5 This illustrates a method for dividing a transport block into one or more code blocks (CBs). Reference Figure 5 CRC 503 can be added to the last or 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 channel coding was successful. Blocks 501 and 503 with TB and CRC added can be divided into multiple code blocks 507, 509, 511, and 513, as indicated by reference numeral 505.

[0287] The code block can be segmented after the maximum size of the code block has been predetermined. In this case, the last code block 513 can be smaller than the other code blocks, or it can be made to have the same length as the other code blocks by inserting 0, random values, or 1. CRC 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 the channel coding was successful. However, depending on the type of channel code to be applied to the code block, the CRC 503 added to the TB and the CRC 517, 519, 521, and 523 added to the segmented code blocks can have variable lengths. Furthermore, when using polar codes, the CRC can be added or omitted. During segmentation, if the number of CBs is one, the CRC 517 added to the CBs can be omitted.

[0288] The CRC inserted into the Transport Block (TB) to determine whether TB decoding was successful after the receiver performs TB decoding is of length L, and L can have at least two available values. That is, a long CRC can be used if the transport block is divided into two or more code blocks and transmitted. On the other hand, a short CRC can be used if the transport block is divided into one code block and transmitted. If LDPC codes are used for encoding in a mobile communication system, the LDPC codes themselves have parity checking functionality, thus allowing for the determination of successful decoding without inserting a CRC.

[0289] If LDPC codes are used in a specific mobile communication system and an additional level of decoding success determination is desired, then in addition to inserting parity checking functionality into the LDPC codes, techniques for determining whether decoding was ultimately successful can be used, thus obtaining the system's desired error rate level for determining decoding success. For example, if the system requires an error rate of 10% for determining decoding success... -6 Furthermore, the determined error rate obtained through the parity check function of LDPC codes is 10. -3 Then by additionally inserting 10 -3 The CRC method for determining the error rate can achieve 10 -6 The final system determines the error rate.

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

[0291] Whether a specific TB is divided into multiple code blocks is determined based on whether a given TB can be sent using a single code block, and therefore the determination can be performed as follows:

[0292] - If N+L- is equal to or less than the maximum available CB length, then TB is sent using a single code block (if (N+L-) <= K). max Then use a CB)

[0293] - If N+L- is greater than the maximum available CB length, then the TB is divided into multiple code blocks and sent (if (N+L-)>K max Then CB will be split.

[0294] K max Indicates the largest available block size.

[0295] In traditional LTE systems, the MCS index transmitted via DCI and the number of allocated PRBs are used to determine the TBS. Based on the downlink, a 5-bit MCS index can be transmitted, therefore the modulation order Q can be derived from [Table 6] below. m And TBS index.

[0296] [Table 6]

[0297]

[0298]

[0299] The number of PRBs used for data transmission can be derived from the resource allocation information sent via DCI, and the TBS can be determined based on the [Table 7] below and the TBS index derived from [Table 6] above.

[0300] [Table 7]

[0301]

[0302] Table 7 above shows the TBS table for PRBs from 1 to 10 and TBS indices from 0 to 26, or even when the maximum PRB is 110 and additional TBS indices are used. The number of spaces in the table above corresponding to the number of allocated PRBs and TBS indices is the TBS understood by the base station and the terminal.

[0303] The method and apparatus described in this disclosure for determining the TBS for downlink data transmission performed by a terminal can be readily applied to the process of encoding transport blocks for uplink data channels. Furthermore, the encoding and decoding operations of the terminal described in this disclosure can be readily applied to the encoding and decoding operations of a base station.

[0304] In this disclosure, a transport block can be data sent from a higher layer to the physical layer, and can be a unit that can be initially sent by the physical layer.

[0305] In this disclosure, N1_max and N2_max can indicate the maximum code block length when using BG#1 in LDPC codes and the maximum code block length when using BG#2. For example, N1_max = 8448 and N2_max = 3840. However, embodiments of this disclosure are not limited thereto. In this disclosure, N1_max can be related to N... 1max or N 1,max They can be used interchangeably, and N2_max can be used with N. 2max or N 2,max Used interchangeably.

[0306] In this disclosure, L_{TB, 16} and L_{TB, 24} can be the lengths of the CRC added to TB, and L_{TB, 16} < L_{TB, 24}. For example, L_{TB, 16} can be 16, and L_{TB, 24} can be 24. In this disclosure, L_{TB, 16} can be equal to L... TB,16 They can be used interchangeably, and L_{TB, 24} can be used with L TB,24 Interchangeable. In this disclosure, L_{CB} can be the length of the CRC added to CB, and can be used interchangeably with L. CB Used interchangeably.

[0307] [Example 1]

[0308] Example 1 provides a method for determining the TBS based on the selection of CB-CRC and the Basic Chart (BG). This example can be applied to situations where, in certain circumstances, when the TBS is large, the TB is divided into two or more code blocks, and each code block is channel-coded into LDPC codes using BG#2. That is, even when the TBS is large, this example can be applied to situations where data can be transmitted using BG#2. In this example, R_1 and R_2 can indicate the code rate 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. Furthermore, in this disclosure, R, R1, and R2, which are indicated as code rates, can be represented 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 BG between BG#1 and BG#2 in data transmission, the terminal's code rate and soft buffer can be taken into account.

[0309] A base station can transmit data by allocating a predetermined number of frequency resources (PRBs) and a predetermined number of time slots or symbols (time resources) to a terminal, and can send associated scheduling information to the terminal via downlink control information (DCI), configurations transmitted via higher-layer signaling, or a combination thereof. Given the scheduling information for both the base station and the terminal, the base station's time slot (TBS) can be determined in the following order.

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

[0311] Steps 1-2: Determine the number of temporary CBs (C), perform byte alignment (making A a multiple of 8), and make A a multiple of the number of CBs (B times).

[0312] Steps 1-3: The process of determining the TBS in addition to the CRC bit count (TBS)

[0313] In step 1-1, the provisional TBS value is determined by considering the amount of resource regions to which the data to be transmitted can be mapped. This can be achieved through the code rate (R), modulation order (Q), and other parameters. m ), the number of REs to which rate-matched data is mapped (N) RE The number of temporary information bits is determined by a combination of one or more of the following reference values: 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 a PRB. For example, A can be determined using the following [Equation 10].

[0314] [Equation 10]

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

[0316] Modulation order Q m The code rate R can be sent to the terminal while being included in the DCI. The layer number v used for transmission can be sent to the terminal via DCI, higher-layer signaling, or a combination thereof. RE The number of REs to which the data is mapped via rate matching when transmitting data can be determined by the base station, and if both the base station and the terminal know the resource allocation information, then the base station and the terminal can understand N equivalently. RE When calculating N RE At that time, data is mapped using a rate-matching scheme, but due to data puncturing for specific reasons (such as the transmission of Channel State Information Reference Signal (CSI-RS), URLLC, or Uplink Control Information (UCI), the REs to which the data is not actually mapped are included in N. RE This is to ensure that both the base station and the terminal understand TBS equally, even when the base station does not send some data scheduled to be mapped using a punching scheme without notifying the terminal.

[0317] An MCS table such as [Table 8] below can be defined, and the base station can transmit the MCS index to the terminal to send information about Q. m And information about R. 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 transmitted in a modulation symbol.

[0318] [Table 8]

[0319]

[0320]

[0321] In Table 8 above, Q m Q is sent along with R via a 5-bit MCS index, but can be sent to the terminal in various ways, making Q... m R is transmitted via DCI using a 6-bit MCS index, or via a 3-bit Q. m Each of the 3 bits in R uses a bit field. Alternatively, A = (number of allocated PRBs) × (number of reference REs per PRB) × Q m ×R×v.

[0322] Steps 1-2 are steps to determine the number of temporary code blocks C (the number of temporary CBs) using the determined A, and to make A a multiple of 8 and a multiple of the number of temporary CBs. This is to align the length bytes of the finally determined TBS and the CRC added to the TB, and also to be a multiple of the CBs. First, the number of temporary CBs can be determined by the following [pseudocode 1].

[0323] [Pseudocode 1]

[0324]

[0325] R is the bitrate, and can be the value transmitted 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 could be 3840. In this case, [pseudocode 2] can be used to determine it, but it is not limited to this. Here, R1 and N are used as examples. 1,max and N 2,max The values ​​are described as 1 / 4, 8448, and 3840, but are not limited to these, and other values ​​can be used.

[0326] [Pseudocode 2]

[0327]

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

[0329] Then, the process of generating B by making A, as 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 [Table 11] below.

[0330] [Equation 11]

[0331]

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

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

[0334] The process involves obtaining the information bits to be sent from the allocated resources up to steps 1-2, and then performing the process in the final steps 1-3 to exclude the number of bits added for CRC from the obtained information bits to be sent. This can be performed using the following [pseudocode 3].

[0335] [Pseudocode 3]

[0336]

[0337] If each parameter value is determined and applied as described above, then [Pseudocode 3] can be applied to [Pseudocode 4] below, but is not limited thereto.

[0338] [Pseudocode 4]

[0339]

[0340] Because the CRC length applied to TB varies depending on TBS, L TB,16 and L TB,24 It is taken into consideration. If the number of code blocks is 1, the CRC added to the CB can be omitted, or the length of the CRC added to the CB can be 0.

[0341] In another example, steps 1-3 can be transformed into the following [pseudocode 5] or [pseudocode 6] and then applied.

[0342] [Pseudocode 5]

[0343] [Start]

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

[0345] Else TBS = BL TB,24

[0346] End if of B

[0347] [End]

[0348] [Pseudocode 6]

[0349] [Start]

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

[0351] Else TBS = B-24

[0352] End if of B

[0353] [End]

[0354] In [Pseudocode 5] or [Pseudocode 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 the actual bit rate can be greater than R.

[0355] Figure 6 This is a flowchart illustrating the steps taken by a base station and a terminal to obtain a Data Switch (TBS) and transmit and receive data during the scheduling and transmission of downlink or uplink data. When the scheduling and data transmission process begins, the base station determines scheduling information in step 602 and transmits this 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, steps 1-1, 1-2, and 1-3 described above can be used to obtain the TBS. Steps 1-1, 1-2, and 1-3 can be combined and executed simultaneously, or their order can be changed. Subsequently, in step 608, CB segmentation, channel coding, decoding, and retransmission operations are performed using the TBS, thus completing the data scheduling and transmission.

[0356] The TBS determination method provided in the embodiments can only be applied in the following situations: 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 transmitted instead of using the method described above. Therefore, the base station and the terminal can pre-determine and know the TBS value based on the combination of {MCS index or rate index, number of PRBs}, and the TBS can only be determined by the method provided in the embodiments in cases other than the stated combination.

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

[0358] [Example 2]

[0359] [Example 2] A method for determining TBS based on the selection of CB-CRC and BG is provided. This embodiment can be applied to situations where, in certain circumstances, when the TBS is large, the TB is divided into two or more code blocks, and each code block is channel-coded into 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 as a reference for selecting BG#1 or BG#2 for LDPC, and R1 and R2 can be used interchangeably. For example, R1 = 1 / 4 and R2 = 2 / 3, but the method provided in this disclosure is not limited to this. Furthermore, in this disclosure, the code rate R, R1, and R2 can be represented and determined in various ways, for example, as fractions and decimals. When selecting BG between BG#1 and BG#2 in data transmission, the terminal's code rate and soft buffer can be taken into account. In this embodiment, a process can be performed at the end of the TBS calculation to make TBS a multiple of 8, a multiple of the number of CB, or a common multiple or least common multiple of the number of 8 and CB.

[0360] A base station can transmit data by allocating a predetermined number of frequency resources (PRBs) and a predetermined number of time slots or symbols (time resources) to a terminal, and can send associated scheduling information to the terminal via downlink control information (DCI), configurations transmitted via higher-layer signaling, or a combination thereof. When the scheduling information for the base station and the terminal is given, the base station's scheduling system (TBS) can be determined in the following order.

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

[0362] Step 2-2: Determine the number (C) of temporary CBs using a defined A, by controlling A to ensure that the value obtained by adding the TB-CRC length to TBS is byte-aligned (a multiple of 8) and is a multiple of the number of temporary CBs, thus determining TBS.

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

[0364] For example, A can be derived from A = N corresponding to [Equation 10] above. RE ×Q m ×R×v is determined. Modulation order Q m The code rate R can be sent to the terminal while being included in the DCI. The layer number v used for transmission can be sent to the terminal via DCI, higher-layer signaling, or a combination thereof. RE The number of REs to which the data is mapped via rate matching when transmitting data can be determined by the base station, and if both the base station and the terminal know the resource allocation information, then the base station and the terminal can understand N equivalently. RE When calculating N RE At that time, data is mapped through rate matching, but REs to which the data is not mapped due to data puncturing for specific reasons (such as CSI-RS, URLLC, or UCI transmission) are included in N. RE This is to ensure that both the base station and the terminal understand TBS equally, even when the base station does not send some data scheduled to be mapped using a punching scheme without notifying the terminal.

[0365] An MCS table such as [Table 8] above can be defined, and the base station can transmit the MCS index to the terminal to send information about Q. m And information about R. 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 This can be the number of bits that can be transmitted in a modulation symbol. In [Table 8] above, Q m Q is sent along with R via a 5-bit MCS index, but can be sent to the terminal in various ways, making Q... m R is transmitted via DCI using a 6-bit MCS index, or via a 3-bit Q. m Each of the 3 bits in R uses a bit field. Alternatively, A = (number of allocated PRBs) × (number of reference REs per PRB) × Q m ×R×v.

[0366] Step 2-2 can be performed as shown in [Pseudocode 7] or [Pseudocode 8] below.

[0367] [Pseudocode 7]

[0368]

[0369] It can be transformed into Then it is applied.

[0370] [Pseudocode 8]

[0371]

[0372] The above [Pseudocode 7] can be transformed into the following [Pseudocode 7-A], [Pseudocode 7-B], or [Pseudocode 7-C], and then applied. The following pseudocode segment can be based on the assumption that TB-CRC has been added.

[0373] [Pseudocode 7-A]

[0374]

[0375]

[0376] [Pseudocode 7-B]

[0377]

[0378]

[0379] I MCS This could be the MCS index, MSC-related parameters, or bitrate. MCS,BG#2 It can be used to select BG#2. MCS Reference values.

[0380] [Pseudocode 7-C]

[0381]

[0382]

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

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

[0385] [Pseudocode 8-A]

[0386]

[0387] "If R≤1 / 4," is not limited to "1 / 4" and can be transformed into, for example, "If R≤0.28," and then applied. Such conditional statements can be in the form of comparing MCS indices, such as "If I..." MCS ≤3,” is used.

[0388] In the pseudocode snippet above, L TB,16 and L TB,24 These can be different values. The number of CRC bits applied to the value divided by A when calculating C and the number of CRC bits excluded from the process of calculating TBS can vary depending on the code rate R and the size of the calculated A. It can be transformed into A+(8-mod(A,8)), A-mod(A,8), or Then it is applied as described in [Example 1]. Additionally, It can be transformed into A-(C×8-mod(A+24,C×8)) or A-mod(A+24,C×8) and then applied. Furthermore, It can be transformed into Then it is applied. Therefore, the pseudocode can be transformed into the following [pseudocode 9], and then applied. Alternatively, the application can be performed using another equation that yields the same result.

[0389] [Pseudocode 9]

[0390]

[0391]

[0392] Step 2-2 can be a process of using a defined A to determine the number of temporary code blocks C (the number of temporary CBs) and based on it, making the length of the CRC+TB of the TBS a multiple of 8 and C.

[0393] In this disclosure, mod(x,y) can be the remainder obtained by dividing x by y, and can be transformed into In this disclosure, It is the smallest integer greater than x, and can be used interchangeably with ceil(x). It 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 x after rounding.

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

[0395] Figure 6 This is a flowchart illustrating the steps taken by a base station and a terminal to obtain the TBS and transmit and receive data when scheduling and transmitting downlink or uplink data. If 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 executed simultaneously, or their order can be changed. Subsequently, in step 608, CB segmentation, channel coding, decoding, and retransmission operations are performed using the TBS, thus completing the data scheduling and transmission.

[0396] The TBS determination method provided in the embodiments can only be applied in the following situations: 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 by the method described above. Therefore, the base station and the terminal can pre-determine and know the TBS value based on the combination of {MCS index or rate index, number of PRBs}, and the TBS can only be determined by the method provided in the embodiments in cases other than the stated combination.

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

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

[0399] *Step 2-A: Determine the number of data resources on it that are rate-matched (Step 2-A: for PDSCH / PUSCH (N RE (Counting the number of available REs for rate matching)

[0400] *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)

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

[0402] *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 by taking into account a specific number of packet sizes and services (if applicable)).

[0403] [Example 3]

[0404] [Example 3] A method for determining TBS based on the selection of CB-CRC and BG is provided. This embodiment can be applied to the specific case where BG#2 is not applied when the TBS is large. That is, in this disclosure, the use of BG#2 to encode the code block channel into LDPC code can be limited 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 for LDPC, and R1 and R2 can be used interchangeably. For example, R1 = 1 / 4 and R2 = 2 / 3, but the method provided in this disclosure is not limited to this. Furthermore, in this disclosure, the code rate R, R1, and R2 can be expressed and determined in various ways, such as fractions and decimals. When selecting BG between BG#1 and BG#2 in data transmission, the terminal's code rate and soft buffer can be taken into account.

[0405] A base station can transmit data by allocating a predetermined number of frequency resources (PRBs) and a predetermined number of time slots or symbols (time resources) to a terminal, and can send associated scheduling information to the terminal via downlink control information (DCI), configurations transmitted via higher-layer signaling, or a combination thereof. When the scheduling information for the base station and the terminal is given, the base station's scheduling system (TBS) can be determined in the following order.

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

[0407] Step 3-2: Determine the number of temporary CBs (C), perform byte alignment (making A a multiple of 8), and make A a multiple of the number of temporary CBs (B times).

[0408] - Step 3-3: The process of determining the TBS except for the number of CRC bits.

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

[0410] For example, A can be derived from A = N corresponding to [Equation 10]. RE ×Q m The modulation order Q is determined by ×R×v. m The code rate R can be sent to the terminal while being included in the DCI. The layer number v used for transmission can be sent to the terminal via DCI, higher-layer signaling, or a combination thereof. RE The number of REs to which the data is mapped via rate matching when transmitting data can be determined by the base station, and if both the base station and the terminal know the resource allocation information, then the base station and the terminal can understand N equivalently. RE When calculating N RE At that time, data is mapped through rate matching, but REs to which the data is not mapped due to data puncturing for specific reasons (such as CSI-RS, URLLC, or UCI transmission) are included in N. RE This is to ensure that both the base station and the terminal understand TBS equally, even when the base station does not send some data scheduled to be mapped using a punching scheme without notifying the terminal.

[0411] An MCS table such as [Table 8] above can be defined, and the base station can transmit the MCS index to the terminal to send information about Q. m And R information. Modulation order refers to information such as QPSK, 16QAM, 64QAM, 256QAM, or 1024QAM. In [Table 8] above, Q m Q is sent along with R via a 5-bit MCS index, but can be sent to the terminal in various ways, making Q... m R is transmitted via DCI using a 6-bit MCS index, or via a 3-bit Q. m Each of the 3 bits in R uses a bit field. Alternatively, A = (number of allocated PRBs) × (number of reference REs per PRB) × Q m ×R×v.

[0412] Step 3-2 is to use the determined A to determine the number of temporary code blocks C (the number of temporary CBs), and to make A a multiple of 8 and the number of temporary CBs (multiple of B). This is to align the final determined TBS with the length bytes of the CRC added to the TB, and also to be a multiple of the CBs.

[0413] First, the number of temporary CBs can be determined as follows: N 1,max It could be 8448. The C obtained above could be the number of temporary CBs. CB splitting is performed when the TB is finally sent, and the number of temporary CBs may differ from the number of actual CBs obtained, but it is certain that the number of actual CBs and temporary CBs can be the same as each other.

[0414] The process of generating B by making A, as 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 calculation shown is as follows. [Equation 11] above can be changed to... B = A + (8C - mod(A, 8C)) and B = A - mod(A, 8C) are then applied. In this disclosure, mod(x, y) can be the remainder obtained by dividing x by y, and can be transformed into In this disclosure, It is the smallest integer greater than x, and can be used interchangeably with ceil(x). It is the largest integer less than x, and can be used interchangeably with floor(x).

[0415] [Equation 11] can be transformed into: And this is applied, meaning that B is the closest multiple of A to 8C. Round(x) can be the closest integer to x or x rounded to the nearest integer. [Equation 11] is used to make A a multiple of 8C, but it can be transformed into an equation to make A a common multiple or least common multiple of 8 and C. Therefore, [Equation 11] above can be transformed into or Then it is applied. LCM(a,b) is the least common multiple of a and b.

[0416] The process involves obtaining the information bits to be sent from the allocated resources up to step 3-2, and then performing a process in the final step 3-3 to exclude the number of bits added for CRC from the obtained information bits to be sent. This can be determined by [pseudocode 10] or [pseudocode 11] below.

[0417] [Pseudocode 10]

[0418] [Start]

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

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

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

[0422] End if of B

[0423] [End]

[0424] [Pseudocode 11]

[0425] [Start]

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

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

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

[0429] End if of B

[0430] [End]

[0431] Because the CRC length applied to TB varies depending on TBS, therefore, consider L. TB,16 and L TB,24 It is taken into consideration. If the number of code blocks is 1, the CRC added to the CB can be omitted, or the length of the CRC added to the CB can be 0.

[0432] 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 sent, the CRC length of the CB can be added to the obtained TBS, so the actual bit rate can be greater than R.

[0433] Figure 6 This is a flowchart illustrating the steps taken by a base station and a terminal to obtain a Data Switch (TBS) and transmit and receive data during the scheduling and transmission of downlink or uplink data. When the scheduling and data transmission process begins, the base station determines scheduling information in step 602 and transmits this 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, steps 3-1, 3-2, and 3-3 described above can be used to obtain the TBS. Steps 3-1, 3-2, and 3-3 can be combined and executed simultaneously, or their order can be changed. Subsequently, in step 608, CB segmentation, channel coding, decoding, and retransmission operations are performed using the TBS, thus completing the data scheduling and transmission.

[0434] The TBS determination method provided in the embodiments can only be applied in the following situations: 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 transmitted instead of using the method described above. Therefore, the base station and the terminal can pre-determine and know the TBS value based on the combination of {MCS index or rate index, number of PRBs}, and the TBS can only be determined by the method provided in the embodiments in cases other than the stated combination.

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

[0436] [Example 4]

[0437] [Example 4] A method for determining TBS based on the selection of CB-CRC and BG is provided. This embodiment can be applied to the specific case where BG#2 is not applied when the TBS is large. That is, in this disclosure, the use of BG#2 to encode the code block channel into LDPC code can be limited 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 for LDPC, and R1 and R2 can be used interchangeably. For example, R1 = 1 / 4 and R2 = 2 / 3, but the method provided in this disclosure is not limited to this. Furthermore, in this disclosure, the code rate R, R1, and R2 can be expressed and determined in various ways, such as fractions and decimals. When selecting BG between BG#1 and BG#2 in data transmission, the terminal's code rate and soft buffer can be taken into account. In this embodiment, a process can be performed at the end of the TBS calculation to make TBS a multiple of 8, a multiple of the number of CB, or a common multiple or least common multiple of the number of 8 and CB.

[0438] A base station can transmit data by allocating a predetermined number of frequency resources (PRBs) and a predetermined number of time slots or symbols (time resources) to a terminal, and can send associated scheduling information to the terminal via downlink control information (DCI), configurations transmitted via higher-layer signaling, or a combination thereof. When the scheduling information for the base station and the terminal is given, the base station's scheduling system (TBS) can be determined in the following order.

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

[0440] Step 4-2: Determine the number of temporary CBs such 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.

[0441] Step 4-1 can be the same as step 2-1 in [Example 2]. In [Step 4-1], the provisional TBS value is determined by considering the number of resource areas to which the data to be transmitted can be mapped. This can be achieved through the code rate (R), modulation order (Q) and other parameters. m ), the number of REs to which rate-matched 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 number of mapped REs within a PRB. For example, A can be determined using [Equation 10] above. Modulation order Q m The code rate R can be sent to the terminal while being included in the DCI. The layer number v used for transmission can be sent to the terminal via DCI, higher-layer signaling, or a combination thereof. RE The number of REs to which the data is mapped via rate matching when transmitting data can be determined by the base station, and if both the base station and the terminal know the resource allocation information, then the base station and the terminal can understand N equivalently. RE When calculating N RE At that time, data is mapped through rate matching, but REs to which the data is not mapped due to data puncturing for specific reasons (such as CSI-RS, URLLC, or UCI transmission) are included in N. RE This is to ensure that both the base station and the terminal understand TBS equally, even when the base station does not send some data scheduled to be mapped using a punching scheme without notifying the terminal.

[0442] An MCS table such as [Table 8] above can be defined, and the base station can transmit the MCS index to the terminal to send information about Q. m And R information. Modulation order refers to information such as QPSK, 16QAM, 64QAM, 256QAM, or 1024QAM. In [Table 8] above, Q m Q is sent along with R via a 5-bit MCS index, but can be sent to the terminal in various ways, making Q... m R is transmitted via DCI using a 6-bit MCS index, or via a 3-bit Q. m Each of the 3 bits in R uses a bit field. Alternatively, A = (number of allocated PRBs) × (number of reference REs per PRB) × Q m ×R×v.

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

[0444] [Pseudocode 12]

[0445]

[0446] It can be transformed into Then it is applied.

[0447] [Pseudocode 13]

[0448]

[0449] Alternatively, [pseudocode 12] can be transformed into [pseudocode 14] and then applied.

[0450] [Pseudocode 14]

[0451]

[0452]

[0453] It can be transformed into A+(8-mod(A,8)), A-mod(A,8) or It is then 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 can be performed and applied to [pseudocode 14].

[0454] [Pseudocode 14]

[0455]

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

[0457] In this disclosure, mod(x,y) can be the remainder obtained by dividing x by y, and can be transformed into In this disclosure, It is the smallest integer greater than x, and can be used interchangeably with ceil(x). It 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 x after rounding.

[0458] Figure 6 This is a flowchart illustrating the steps taken by a base station and a terminal to obtain the TBS and transmit and receive data when scheduling and transmitting downlink or uplink data. If 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 executed simultaneously, or their order can be changed. Subsequently, in step 608, CB segmentation, channel coding, decoding, and retransmission operations are performed using the TBS, thus completing the data scheduling and transmission.

[0459] The TBS determination method provided in the embodiments can only be applied in the following situations: 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 transmitted instead of by the method described above. Therefore, the base station and the terminal can pre-determine and know the TBS value based on the combination of {MCS index or rate index, number of PRBs}, and the TBS can only be determined by the method provided in the embodiments in cases other than the stated combination.

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

[0461] The part of determining the TBS by comparing the bitrate R with a specific value in [Example 1], [Example 2], [Example 3], or [Example 4] can be modified to use the MCS index (such as I) MCS Alternatively, parameters related to MCS or bitrate can be compared with specific reference values, rather than using bitrate directly for comparison.

[0462] Furthermore, when calculating NRE, the use of rate matching to map data is described in [Example 1], [Example 2], [Example 3], or [Example 4], but various methods can be used to calculate NRE. RE For example, N can be calculated and applied by considering one or more of the following: the total number of allocated symbols, the number of allocated PRBs, synchronization 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 a time slot or a PRB of a symbol). RE .

[0463] [Example 5]

[0464] [Example 5] provides a method in which, 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 and apply the final TBS by the method described above.

[0465] For example, the base station and terminal can pre-arrange that a certain range of TBS will not be transmitted, and 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 as 2. If B = 3872, then the final calculated TBS is 3800. If the final calculated TBS is 3800, then the terminal can determine the TBS as 3840.

[0466] In another example, a method can be used to apply the final TBS by comparing the TBS calculated when the base station and terminal know the minimum or maximum value of the TBS with the minimum or maximum value pre-arranged or known through higher-layer signaling. The minimum value of the TBS can be the TBS. min And the maximum value of TBS can be TBS max .

[0467] [Example 6]

[0468] [Example 6] A method is provided for storing information about data received by a terminal in a soft buffer.

[0469] When transmitting downlink data, as the terminal stores the received information about the data in a 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 also notify the terminal of the range of stored information, thereby transmitting the parity check portion with the highest retransmission probability.

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

[0471] [Example 7]

[0472] [Example 7] provides a method for calculating N. RE The method, the N RE When [Example 1], [Example 2], [Example 3] or [Example 4] is applied, it is considered for calculating the number of resource areas to which the data of the temporary TBS is mapped.

[0473] Downlink data can be transmitted using PDSCH, which is the physical channel used for downlink data transmission, and one or more of the following parameters can be considered to obtain N. RE .

[0474] - Allocate the number of PRBs for data transmission and the number of symbols to be sent.

[0475] - Control Resource Set (CORESET), in which downlink control channels that can be transmitted and signaled at higher layers can be used.

[0476] - The region to which the scheduled DCI is mapped.

[0477] -Resource areas in which reference signals (RS) for data transmission are sent.

[0478] -Resource areas corresponding to reserved resources

[0479] -Resources in which RS for channel measurements are transmitted

[0480] -The area in which synchronization signal blocks (SS blocks) including synchronization signals are sent.

[0481] - Timing for sending Control Information (DCI) for scheduling and timing for sending the actual PDSCH.

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

[0483] Uplink data can be transmitted using PUSCH, which is a physical channel used for uplink data transmission. In this case, one or more of the following parameters can be considered to obtain N. RE .

[0484] - Allocate the number of PRBs for data transmission and the number of symbols to be sent.

[0485] -A region where higher layers can send downlink and uplink control channels via signaling.

[0486] -Resource areas in which reference signals for data transmission are sent.

[0487] -Resource areas corresponding to reserved resources

[0488] -Resource areas in which sounding reference signals (SRS) for channel measurements are transmitted.

[0489] -The area in which synchronization signal blocks, including synchronization signals, are transmitted.

[0490] - Timing for sending control information for scheduling (Uplink clearance DCI) and timing for sending the actual PUSCH.

[0491] - Whether to include and send another PDSCH HARQ-ACK message, the timing of sending the corresponding PDSCH, and the amount of HARQ-ACK message to be sent.

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

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

[0494] For example, if the HARQ-ACK for a PDSCH received before the time point when the DCI, including the uplink scheduling permission (uplink permission) for scheduling the corresponding PUSCH, is sent is greater than a certain number of bits, then the resource area required to send the corresponding HARQ-ACK information can be obtained from N obtained for PUSCH transmission. RE Excluded from the middle. On the other hand, the transmission of HARQ-ACK information for PDSCH received at or after the time when the DCI for uplink clearance for scheduling the corresponding PUSCH is sent may not be included in the N of the TBS used to obtain the PUSCH. RE The calculation is taken into account or included. The reference time point for the PDSCH considering HARQ-ACK has been described as the time point for receiving uplink clearance, but is not limited to this, and can 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 for the TBS of the PUSCH.

[0495] In order to implement the above embodiments of this disclosure, in Figure 7 and Figure 8 The diagram illustrates the transmitter, receiver, and processor of each of the terminal and the base station. The transmission / reception methods of the base station and the terminal are described as implementing embodiments 1 to 7, and each of the receiver, processor, and transmitter of the base station and the terminal should operate according to the embodiments to implement the methods.

[0496] Specifically, Figure 7 This is a block diagram illustrating the internal structure of a terminal according to an embodiment of the present disclosure. (As shown...) Figure 7 As shown, the terminal of this disclosure may include a terminal receiver 700, a terminal transmitter 704, and a terminal processor 702. In embodiments of this 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. For this purpose, the transceiver may include: an RF transmitter that up-converts and amplifies the frequency of the transmitted signal; an RF receiver that amplifies the received signal with low noise and down-converts the frequency; and so on. Moreover, the transceiver can receive signals via a radio channel, output signals to the terminal processor 702, and transmit signals output from the terminal processor 702 via a radio channel. The terminal processor 702 can control a series of processes to enable the terminal to operate according to the above embodiments of this disclosure.

[0497] Figure 8 This is a block diagram illustrating the internal structure of a base station according to an embodiment of the present disclosure. Figure 8 As shown, the base station of this disclosure may include a base station receiver 801, a base station transmitter 805, and a base station processor 803. In embodiments of this disclosure, the base station receiver 801 and the base station transmitter 805 are collectively referred to as a transceiver. The transceiver can transmit signals to and receive signals from a terminal. The signals may include control information and data. For this purpose, the transceiver includes: an RF transmitter that up-converts and amplifies the frequency of the transmitted signal; an RF receiver that amplifies the received signal with low noise and down-converts the frequency; and so on. Moreover, the transceiver can receive signals via a radio channel, output signals to the base station processor 803, and transmit signals output from the base station processor 803 via a radio channel. The base station processor 803 can control a series of processes to enable the base station to operate according to the above embodiments of this disclosure.

[0498] Furthermore, embodiments of this disclosure as disclosed in the specification and accompanying drawings have been presented to readily explain the technical content of this disclosure and to aid in understanding it, without limiting the scope of this disclosure. That is, it will be apparent to those skilled in the art that various modifications can be made based on the technical spirit of this disclosure. Some of the embodiments can be operated such that one or more of the embodiments are combined. For example, a base station and a terminal can operate based on a combination of [Embodiment 1] and [Embodiment 3] of this disclosure.< / null>

Claims

1. A method performed by a terminal in a wireless communication system, the method comprising: Receive downlink control information from the base station for the Physical Downlink Shared Channel (PDSCH); The number of temporary information bits A is determined based on the modulation order and code rate of the PDSCH, where the modulation order and code rate are determined based on the modulation and coding scheme information in the downlink control information; based on To determine the transport block size (TBS), where C is based on the condition that the code rate is less than or equal to 1 / 4 and the number of temporary information bits (A) is greater than 3824. It's confirmed.

2. 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, C is based on It's confirmed.

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 equal to or less than 8424, C is 1.

4. The method according to claim 1, wherein, The number A of temporary information bits is based on Determined, where N RE Q is the number of resource elements (REs) used in PDSCH. m R is the modulation order, R is the code rate, v is the number of layers, and The number of REs is determined by multiplying the number of REs in each physical resource block (PRB) by the number of PRBs allocated to the PDSCH.

5. A terminal in a wireless communication system, the terminal comprising: transceiver; and The controller, coupled to the transceiver, is configured as follows: Receive downlink control information from the base station for the Physical Downlink Shared Channel (PDSCH); The number of temporary information bits A is determined based on the modulation order and code rate of the PDSCH, where the modulation order and code rate are determined based on the modulation and coding scheme information in the downlink control information; based on To determine the transport block size (TBS), where C is based on the condition that the code rate is less than or equal to 1 / 4 and the number of temporary information bits (A) is greater than 3824. It's confirmed.

6. The terminal according to claim 5, wherein, When the code rate is greater than 1 / 4 and the number of temporary information bits A is greater than 8424, C is based on It's confirmed.

7. The terminal according to claim 5, wherein, C is 1 when the code rate is greater than 1 / 4 and the number of temporary information bits A is equal to or less than 8424.

8. The terminal according to claim 5, wherein, The number A of temporary information bits is based on Determined, where N RE Q is the number of resource elements (REs) used in PDSCH. m R is the modulation order, R is the code rate, v is the number of layers, and The number of REs is determined by multiplying the number of REs in each physical resource block (PRB) by the number of PRBs allocated to the PDSCH.

9. A method performed by a base station in a wireless communication system, the method comprising: Sending downlink control information for the Physical Downlink Shared Channel (PDSCH) to the terminal, wherein the modulation order and code rate of the PDSCH are associated with the modulation and coding scheme information in the downlink control information; and Based on the transport block size (TBS), PDSCH is sent to the terminal. The number A of temporary information bits is based on the modulation order and code rate. Among them, TBS is based on Furthermore, when the code rate is less than or equal to 1 / 4 and the number of temporary information bits A is greater than 3824, C is based on .

10. The method according to claim 9, wherein, When the code rate is greater than 1 / 4 and the number of temporary information bits A is greater than 8424, C is based on .

11. The method according to claim 9, wherein, C is 1 when the code rate is greater than 1 / 4 and the number of temporary information bits A is equal to or less than 8424.

12. The method according to claim 9, wherein, The number A of temporary information bits is based on , where N RE Q is the number of resource elements (REs) used in PDSCH. m R 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 the PDSCH.

13. A base station in a wireless communication system, the base station comprising: transceiver; and The controller, coupled to the transceiver, is configured as follows: Sending downlink control information for the Physical Downlink Shared Channel (PDSCH) to the terminal, wherein the modulation order and code rate of the PDSCH are associated with the modulation and coding scheme information in the downlink control information; and Based on the transport block size (TBS), PDSCH is sent to the terminal. The number A of temporary information bits is based on the modulation order and code rate. Among them, TBS is based on Furthermore, when the code rate is less than or equal to 1 / 4 and the number of temporary information bits A is greater than 3824, C .

14. The base station according to claim 13, wherein, When the code rate is greater than 1 / 4 and the number of temporary information bits A is greater than 8424, C is based on .

15. The base station according to claim 13, wherein, C is 1 when the code rate is greater than 1 / 4 and the number of temporary information bits A is equal to or less than 8424.

16. The base station according to claim 13, wherein, The number A of temporary information bits is based on , where N RE Q is the number of resource elements (REs) used in PDSCH. m R 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 the PDSCH.

Images