WO2019050304A1 - Method and apparatus for determining transport block size in communication or broadcasting system - Google Patents

Abstract

The present disclosure relates to a communication technique that combines, with IoT technology, 5G communication systems for supporting a higher data transfer rate than a 4G system, and a system therefor. The present disclosure can be applied to intelligent services, such as smart homes, smart buildings, smart cities, smart cars or connected cars, health care, digital education, retail businesses, security and safety related services, etc. on the basis of 5G communication technologies and IoT related technologies. Disclosed, in the present invention, are a method and an apparatus for determining the size of a transport block in a communication or broadcasting system.

Description

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

The present invention relates to a method and apparatus for determining the size of a transport block in a communication or broadcasting system.

Efforts are underway to develop an improved 5G or pre-5G communication system to meet the growing demand for wireless data traffic after commercialization of the 4G communication system. For this reason, a 5G communication system or a pre-5G communication system is called a system after a 4G network (Beyond 4G network) communication system or after a LTE system (Post LTE).

To achieve a high data rate, 5G communication systems are being considered for implementation in very high frequency (mmWave) bands (e.g., 60 gigahertz (60GHz) bands). In order to mitigate the path loss of the radio wave in the very high frequency band and to increase the propagation distance of the radio wave, in the 5G communication system, beamforming, massive MIMO, full-dimension MIMO (FD-MIMO ), Array antennas, analog beam-forming, and large scale antenna technologies are being discussed.

In order to improve the network of the system, the 5G communication system has developed an advanced small cell, an advanced small cell, a cloud radio access network (cloud RAN), an ultra-dense network, (D2D), a wireless backhaul, a moving network, cooperative communication, Coordinated Multi-Points (CoMP), and interference cancellation Have been developed.

In addition, in the 5G system, the Advanced Coding Modulation (ACM) scheme, Hybrid FSK and QAM Modulation (FQAM) and Sliding Window Superposition Coding (SWSC), the advanced connection technology, Filter Bank Multi Carrier (FBMC) (non-orthogonal multiple access), and SCMA (sparse code multiple access).

On the other hand, the Internet is evolving into an Internet of Things (IoT) network in which information is exchanged between distributed components such as objects in a human-centered connection network where humans generate and consume information. IoE (Internet of Everything) technology, which combines IoT technology with big data processing technology through connection with cloud servers, is also emerging. In order to implement IoT, technology elements such as sensing technology, wired / wireless communication, network infrastructure, service interface technology, and security technology are required. In recent years, sensor network for connecting objects, Machine to Machine , M2M), and MTC (Machine Type Communication). In the IoT environment, an intelligent IT (Internet Technology) service can be provided that collects and analyzes data generated from connected objects to create new value in human life. IoT is a field of smart home, smart building, smart city, smart car or connected car, smart grid, healthcare, smart home appliance, and advanced medical service through convergence and combination of existing information technology . ≪ / RTI >

Accordingly, various attempts have been made to apply the 5G communication system to the IoT network. For example, technologies such as a sensor network, a machine to machine (M2M), and a machine type communication (MTC) are implemented by techniques such as beamforming, MIMO, and array antennas It is. The application of the cloud RAN as the big data processing technology described above is an example of the convergence of 5G technology and IoT technology.

In a communication or broadcasting system, the link performance can be significantly degraded by various noise, fading phenomena and inter-symbol interference (ISI) of the channel. Therefore, it is required to develop a technique for overcoming noise, fading, and intersymbol interference in order to realize high-speed digital communication or broadcasting systems requiring high data throughput and reliability such as next generation mobile communication, digital broadcasting and portable Internet. Recently, as a method to overcome the noise, the error correcting code has been actively studied as a method for improving the reliability of the communication by efficiently restoring the information distortion.

The present invention uses a characteristic of a low-density parity-check (LDPC) code to determine a transport block size (TBS), which is a size of a transport block (TB) Method and apparatus.

According to another aspect of the present invention, there is provided a method for checking a transport block size (TBS) of a terminal of a wireless communication system, the method comprising: receiving control information for scheduling from a base station; Checking the number of temporary information bits based on the control information for the scheduling; Checking the TBS based on the control information for the scheduling and the number of temporary information bits; And decoding the received downlink data based on the identified TBS, wherein the TBS includes a number of temporary code blocks (CB) based on the control information for the scheduling and a multiple of 8 .

Also, when the code rate determined based on the scheduling information is equal to or less than 0.25, if the number of temporary information bits is N, the number of temporary CBs is

When the number of temporary information bits is N and the code rate is greater than 0.25 and the number of temporary information bits is greater than 8424 based on the scheduling information, The

And the number of temporary CBs is 1 when the number of temporary information bits is less than or equal to 8424. [

Also, there is provided a method of checking a transport block size (TBS) of a base station of a wireless communication system, the method comprising: checking control information for scheduling; Transmitting control information for scheduling to a terminal; Checking the number of temporary information bits based on the control information for the scheduling; Checking the TBS based on the control information for the scheduling and the number of temporary information bits; And transmitting downlink data based on the identified TBS, wherein the TBS has a number of temporary code blocks (CB) based on the control information for scheduling and a multiple of 8 .

Also, there is provided a terminal for confirming a transport block size (TBS) of a wireless communication system, the terminal comprising: a transceiver; And checking the TBS based on the control information for scheduling and the number of the temporary information bits. The method of claim 1, wherein the control information for scheduling comprises: And a controller coupled to the transmitter and receiver for controlling decoding of the received downlink data on the basis of the identified TBS, wherein the TBS includes a code block determined based on the control information for scheduling, CB) and a multiple of eight.

The present invention provides a method and apparatus for determining TBS, which is the size of a TB, by minimizing the addition of unnecessary bits using the characteristics of an LDPC code, allocated resources, code rate, etc., .

1 is a diagram illustrating a downlink time-frequency domain transmission structure of an LTE or LTE-A system.

2 is a diagram illustrating an uplink time-frequency domain transmission structure of an LTE or LTE-A system.

3 is a diagram showing a basic structure of a matrix matrix (or a base graph) of an LDPC code.

4 is a block diagram illustrating a receiving process of a UE.

5 is a diagram illustrating a method of segmenting a transport block (TB) into a code block.

6 is a flowchart illustrating operations of a base station and a terminal performing some embodiments of the present invention.

7 is a block diagram illustrating a structure of a UE according to embodiments of the present invention.

8 is a block diagram illustrating the structure of a base station according to embodiments of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

In the following description of the embodiments of the present invention, descriptions of techniques which are well known in the technical field of the present invention and are not directly related to the present invention will be omitted. This is for the sake of clarity of the present invention without omitting the unnecessary explanation.

For the same reason, some of the components in the drawings are exaggerated, omitted, or schematically illustrated. Also, the size of each component does not entirely reflect the actual size. In the drawings, the same or corresponding components are denoted by the same reference numerals.

BRIEF DESCRIPTION OF THE DRAWINGS The advantages and features of the present invention and the manner of achieving them will become apparent with reference to the embodiments described in detail below with reference to the accompanying drawings. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. To fully disclose the scope of the invention to those skilled in the art, and the invention is only defined by the scope of the claims. Like reference numerals refer to like elements throughout the specification.

At this point, it will be appreciated that the combinations of blocks and flowchart illustrations in the process flow diagrams may be performed by computer program instructions. These computer program instructions may be loaded into a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, so that those instructions, which are executed through a processor of a computer or other programmable data processing apparatus, Thereby creating means for performing functions. These computer program instructions may also be stored in a computer usable or computer readable memory capable of directing a computer or other programmable data processing apparatus to implement the functionality in a particular manner so that the computer usable or computer readable memory The instructions stored in the block diagram (s) are also capable of producing manufacturing items containing instruction means for performing the functions described in the flowchart block (s). Computer program instructions may also be stored on a computer or other programmable data processing equipment so that a series of operating steps may be performed on a computer or other programmable data processing equipment to create a computer- It is also possible for the instructions to perform the processing equipment to provide steps for executing the functions described in the flowchart block (s).

In addition, each block may represent a module, segment, or portion of code that includes one or more executable instructions for executing the specified logical function (s). It should also be noted that in some alternative implementations, the functions mentioned in the blocks may occur out of order. For example, two blocks shown in succession may actually be executed substantially concurrently, or the blocks may sometimes be performed in reverse order according to the corresponding function.

Herein, the term " part " used in the present embodiment means a hardware component such as software or an FPGA or an ASIC, and 'part' performs certain roles. However, 'part' is not meant to be limited to software or hardware. &Quot; to " may be configured to reside on an addressable storage medium and may be configured to play one or more processors. Thus, by way of example, 'parts' may refer to components such as software components, object-oriented software components, class components and task components, and processes, functions, , Subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables. The functions provided within the components and components may be further combined with a smaller number of components and components, or further components and components. In addition, the components and components may be implemented to play back one or more CPUs in a device or a secure multimedia card. Also, in an embodiment, 'to' may include one or more processors.

The wireless communication system is not limited to providing initial voice-oriented services. For example, 3GPP's High Speed Packet Access (HSPA), Long Term Evolution or Evolved Universal Terrestrial Radio Access (E-UTRA) To a broadband wireless communication system that provides high-speed, high-quality packet data services such as the LTE-A, 3GPP2 high rate packet data (HRPD), UMB (Ultra Mobile Broadband), and IEEE 802.16e communication standards. . In addition, a 5G or NR (new radio) communication standard is being developed with the fifth generation wireless communication system.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the following description of the present invention, detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear. The following terms are defined in consideration of the functions of the present invention, and these may be changed according to the intention of the user, the operator, or the like. Therefore, the definition should be based on the contents throughout this specification.

Hereinafter, the base station may be at least one of a gNode B, an eNode B, a Node B, a base station (BS), a wireless access unit, a base station controller, or a node on a network. A terminal may include a user equipment (UE), a mobile station (MS), a cellular phone, a smart phone, a computer, or a multimedia system capable of performing communication functions. In the present invention, a downlink (DL) is a radio transmission path of a signal transmitted from a base station to a mobile station, and an uplink (UL) is a radio transmission path of a signal transmitted from a mobile station to a base station.

In the following, embodiments of the present invention will be described as an example of an LTE or LTE-A system (hereinafter referred to as LTE system), but the embodiments of the present invention may be applied to other communication systems having a similar technical background or channel form. For example, 5G mobile communication technology developed after LTE-A (5G, new radio, NR) could be included. In addition, embodiments of the present invention may be applied to other communication systems by a person skilled in the art without departing from the scope of the present invention.

In the LTE system, which is a typical example of the broadband wireless communication system, an Orthogonal Frequency Division Multiplexing (OFDM) scheme is used in the downlink and a Single Carrier Frequency Division Multiple Access (SC-FDMA) scheme is used in the uplink. In the above multiple access scheme, data or control information is allocated so that the time and frequency resources to be transmitted for each user are not overlapped with each other, that is, orthogonality is established and operated so that data or control information of each user is classified do.

The LTE system adopts a Hybrid Automatic Repeat reQuest (HARQ) scheme in which a physical layer resends data when a decoding failure occurs in an initial transmission. The HARQ scheme is a scheme in which when a receiver fails to correctly decode data, the receiver transmits negative acknowledgment (NACK) indicating decoding failure to the transmitter so that the transmitter can retransmit the corresponding data in the physical layer. The receiver combines the data retransmitted by the transmitter with the previously decoded data to improve data reception performance. In addition, when the receiver correctly decodes the data, it can transmit information (Acknowledgment, ACK) indicating the decoding success to the transmitter so that the transmitter can transmit new data.

1 is a diagram illustrating a basic structure of a time-frequency domain, which is a downlink radio resource region of an LTE system.

In Fig. 1, the horizontal axis represents the time domain and the vertical axis represents the frequency domain. The minimum transmission unit in the time domain is an OFDM symbol and N _symb OFDM symbols 102 are gathered to constitute one slot 106. Two slots are gathered to form one subframe 105 ). The length of the slot is 0.5 ms and the length of the subframe is 1.0 ms. And a radio frame 114 is a time domain including 10 subframes. The minimum transmission unit in the frequency domain is a subcarrier, and the bandwidth of the total system transmission bandwidth is composed of a total of N _BW subcarriers 104.

In a time-frequency domain, a basic unit of a resource is a Resource Element (RE) 112, which can be represented by an OFDM symbol index and a subcarrier index. A resource block (RB or physical resource block, PRB, 108) is defined as N _symb consecutive OFDM symbols 102 in the time domain and N _RB consecutive subcarriers 110 in the frequency domain. Thus, one RB 108 is comprised of N _symb x N _RB REs 112. In general, the minimum transmission unit of data is the RB unit. In the LTE system, N _symb = 7 and N _RB = 12, and N _RB is proportional to the bandwidth of the system transmission band. The data rate is increased in proportion to the number of RBs scheduled to the UE.

In the LTE system, six transmission bandwidths are defined and operated. In case of a frequency division duplex (FDD) system in which downlink and uplink are classified by frequency, the downlink transmission bandwidth and the uplink transmission bandwidth may be different from each other. The channel bandwidth represents the RF bandwidth corresponding to the system transmission bandwidth. Table 1 shows correspondence between system transmission bandwidth and channel bandwidth defined in the LTE system. For example, an LTE system with a 10 MHz channel bandwidth has a transmission bandwidth of 50 RBs.

Channel bandwidth BW channel [MHz]	1.4	3	5	10	15	20
Transmission bandwidth configuration N RB	6	15	25	50	75	100

In case of downlink control information (DCI), it is transmitted within the first N OFDM symbols in the subframe. In general, N = {1, 2, 3}. Therefore, the N value varies with each subframe according to the amount of control information to be transmitted in the current subframe. The control information includes a control channel transmission interval indicator indicating how many OFDM symbols control information is transmitted, scheduling information for downlink data or uplink data, and an HARQ ACK / NACK signal.

In the LTE system, the scheduling information for the downlink data or the uplink data is transmitted from the base station to the mobile station through the downlink control information. The DCI is defined in various formats. The DCI determines whether the scheduling information (UL grant) for the uplink data or the DL grant for the downlink data, whether the control information is a compact DCI having a small size, Whether or not to apply spatial multiplexing using antennas, whether or not DCI for power control is applied, and the like. For example, DCI format 1, which is scheduling control information (DL grant) for downlink data, is configured to include at least the following control information.

- Resource allocation type 0/1 flag: Notifies whether the resource allocation scheme is Type 0 or Type 1. Type 0 allocates resources in RBG (resource block group) by applying bitmap method. In the LTE system, the basic unit of scheduling is an RB represented by time and frequency domain resources, and the RBG is composed of a plurality of RBs and becomes a basic unit of scheduling in the type 0 scheme. Type 1 allows a specific RB to be allocated within the RBG.

- Resource block assignment: Notifies the RB allocated to data transmission. The resources to be represented are determined according to the system bandwidth and the resource allocation method.

- Modulation and coding scheme (MCS): Notifies the modulation scheme used for data transmission and the size of the transport block, which is the data to be transmitted.

- HARQ process number: Notifies the HARQ process number.

- New data indicator: Notifies HARQ initial transmission or retransmission.

- Redundancy version (RV): Notifies redundancy version of HARQ.

- Transmit power control command for PUCCH (Physical Uplink Control Channel (PUCCH)): Notifies a transmission power control command for the uplink control channel PUCCH.

The DCI is transmitted through a Physical Downlink Control Channel (PDCCH) or an Enhanced PDCCH (Physical Downlink Control Channel), which is a downlink physical control channel, through channel coding and modulation processes. Hereinafter, PDCCH transmission / reception or EPDCCH transmission / reception can be understood as DCI transmission / reception on PDCCH or EPDCCH Such a technique can be applied to other channels as well.

Generally, the DCI is independently scrambled with a specific RNTI (Radio Network Temporary Identifier or Terminal Identifier) for each UE, added with a CRC (cyclic redundancy check), channel-coded, and then transmitted as an independent PDCCH. In the time domain, the PDCCH is mapped and transmitted during the control channel transmission period. The frequency domain mapping position of the PDCCH is determined by the identifier (ID) of each terminal and spread over the entire system transmission band.

The downlink data is transmitted through a Physical Downlink Shared Channel (PDSCH), which is a physical channel for downlink data transmission. The PDSCH is transmitted after the control channel transmission interval. The scheduling information such as the specific mapping position in the frequency domain, the modulation scheme, and the like is notified by the DCI transmitted through the PDCCH.

The base station notifies the UE of a modulation scheme applied to a PDSCH to be transmitted and a transport block size (TBS) to be transmitted through an MCS having 5 bits among the control information constituting the DCI. The TBS corresponds to a size before channel coding for error correction is applied to data (i.e., transport block) to be transmitted by the base station.

The modulation schemes supported by the LTE system are QPSK (Quadrature Phase Shift Keying), 16QAM (Quadrature Amplitude Modulation), and 64QAM, and their modulation orders correspond to 2, 4, and 6, respectively. That is, 2 bits per symbol for QPSK modulation, 4 bits per symbol for 16QAM modulation, and 6 bits per symbol for 64QAM modulation.

2 is a diagram illustrating a basic structure of a time-frequency domain, which is an uplink radio resource region of an LTE system.

Referring to FIG. 2, the horizontal axis represents time domain and the vertical axis represents frequency domain. The minimum transmission unit in the time domain is an SC-FDMA symbol, and N _symb SC-FDMA symbols 202 are gathered to constitute one slot 206. [ Then, two slots form one subframe 205. The minimum transmission unit in the frequency domain is a subcarrier, and the overall system transmission bandwidth is composed of a total of N _BW subcarriers 204. N _BW has a value proportional to the system transmission band.

The basic unit of resources in the time-frequency domain is a resource element (RE) 212, which can be defined as an SC-FDMA symbol index and a subcarrier index. A resource block (RB, 208) is defined as N _symb consecutive SC-FDMA symbols in the time domain and N _RB consecutive subcarriers in the frequency domain. Therefore, one RB consists of N _symb xN _RB REs. In general, the minimum transmission unit of data or control information is RB unit. In case of PUCCH, it is mapped to a frequency region corresponding to 1 RB and transmitted for 1 sub-frame.

In the LTE system, an uplink physical channel PUCCH or PUSCH to which a HARQ ACK / NACK corresponding to a PDCCH or an EPDDCH including a PDSCH for a downlink data transmission or a semi-persistent scheduling release (SPS release) (physical uplink shared channel). For example, in an LTE system operating as an FDD, an HARQ ACK / NACK corresponding to a PDCCH / EPDCCH including PDSCH or SPS release transmitted in an n-4th subframe is transmitted on a PUCCH or a PUSCH in an nth subframe.

In the LTE system, the downlink HARQ employs an asynchronous HARQ scheme in which the data retransmission time is not fixed. That is, when the HARQ NACK is fed back from the UE to the initial transmission data transmitted from the BS, the BS freely determines the transmission time point of the retransmission data by the scheduling operation. The UE buffers data determined to be a decoding result error for the received data for the HARQ operation, and performs combining with the next retransmission data.

When the UE receives the PDSCH including the downlink data transmitted from the base station in the subframe n, it transmits uplink control information including the HARQ ACK or NACK of the downlink data to the subframe n + k through the PUCCH or PUSCH. Lt; / RTI > In this case, k is defined differently according to the FDD or TDD (time division duplex) of the LTE system and its subframe setting. For example, in the case of the FDD LTE system, the k is fixed at 4. On the other hand, in case of the TDD LTE system, k may be changed according to the subframe setting and the subframe number.

Unlike the downlink HARQ in the LTE system, the uplink HARQ adopts a synchronous HARQ scheme in which the data transmission time is fixed. That is, the uplink / downlink timing relationship of the physical channel PUSCH for uplink data transmission, the downlink control channel PDCCH preceding thereto, and the PHICH, which is a physical channel through which downlink HARQ ACK / NACK corresponding to the PUSCH is transmitted, It is fixed by the same rule.

When the UE receives the PDCCH including the uplink scheduling control information transmitted from the base station in the subframe n or the PHICH in which the downlink HARQ ACK / NACK is transmitted, the UE transmits uplink data corresponding to the control information in the subframe n + k PUSCH. In this case, k is defined differently according to FDD or TDD of the LTE system and its setting. For example, in the case of the FDD LTE system, the k is fixed at 4. On the other hand, in case of the TDD LTE system, k may be changed according to the subframe setting and the subframe number.

When the UE receives the PHICH carrying the downlink HARQ ACK / NACK from the base station in the subframe i, the PHICH corresponds to the PUSCH transmitted by the UE in the subframe i-k. In this case, k is defined differently according to FDD or TDD of the LTE system and its setting. For example, in the case of the FDD LTE system, the k is fixed at 4. On the other hand, in case of the TDD LTE system, k may be changed according to the subframe setting and the subframe number.

Also, the value of k may be differently applied according to the TDD setting of each carrier at the time of data transmission through a plurality of carriers.

Transmission mode	DCI format	Search Space	Transmission scheme of PDSCH corresponding to PDCCH
Mode 1	DCI format 1A	Common andUE specific by C-RNTI	Single-antenna port, port 0 (see subclause 7.1.1)
	DCI format 1	UE specific by C-RNTI	Single-antenna port, port 0 (see subclause 7.1.1)
Mode 2	DCI format 1A	Common andUE specific by C-RNTI	Transmit diversity (see subclause 7.1.2)
	DCI format 1	UE specific by C-RNTI	Transmit diversity (see subclause 7.1.2)
Mode 3	DCI format 1A	Common andUE specific by C-RNTI	Transmit diversity (see subclause 7.1.2)
	DCI format 2A	UE specific by C-RNTI	Large delay CDD (see subclause 7.1.3) or Transmit diversity (see subclause 7.1.2)
Mode 4	DCI format 1A	Common andUE specific by C-RNTI	Transmit diversity (see subclause 7.1.2)
	DCI format 2	UE specific by C-RNTI	Closed-loop spatial multiplexing (see subclause 7.1.4) or Transmit diversity (see subclause 7.1.2)
Mode 5	DCI format 1A	Common andUE specific by C-RNTI	Transmit diversity (see subclause 7.1.2)
	DCI format 1D	UE specific by C-RNTI	Multi-user MIMO (see subclause 7.1.5)
Mode 6	DCI format 1A	Common andUE specific by C-RNTI	Transmit diversity (see subclause 7.1.2)
	DCI format 1B	UE specific by C-RNTI	Closed-loop spatial multiplexing (see subclause 7.1.4) using a single transmission layer
Mode 7	DCI format 1A	Common andUE specific by C-RNTI	If the number of PBCH antenna ports is one, single-antenna port, port 0 is used (see subclause 7.1.1), otherwise Transmit diversity (see subclause 7.1.2)
	DCI format 1	UE specific by C-RNTI	Single-antenna port, port 5 (see subclause 7.1.1)
Mode 8	DCI format 1A	Common andUE specific by C-RNTI	If the number of PBCH antenna ports is one, single-antenna port, port 0 is used (see subclause 7.1.1), otherwise Transmit diversity (see subclause 7.1.2)
	DCI format 2B	UE specific by C-RNTI	Dual layer transmission, ports 7 and 8 (see subclause 7.1.5A) or single-antenna port, port 7 or 8 (see subclause 7.1.1)

Table 2 above shows the supported DCI format types for each transmission mode under the conditions set by the C-RNTI in 3GPP TS 36.213. The terminal performs search and decoding on the assumption that the corresponding DCI format exists in the control domain according to a predetermined transmission mode. For example, when the UE is instructed to transmit mode 8, the UE searches DCI format 1A in a common search space and a UE-specific search space, and searches for DCI format 1A only in the UE- 2B.

The description of the wireless communication system is based on the LTE system, and the contents of the present invention are not limited to the LTE system but can be applied to various wireless communication systems such as NR and 5G. Also, when the present embodiment is applied to another wireless communication system, the k value may be changed and applied to a system using a modulation scheme corresponding to FDD.

The present invention provides an encoding bit transmission method and apparatus capable of supporting various input lengths and coding rates. The present invention also provides a method of setting a base graph of an LDPC code used for data channel transmission and a method and apparatus for segmenting a transport block (TB) using an LDPC code.

Next, the LDPC (Low Density Parity Check) code will be described.

The LDPC code is a type of linear block code and includes a process of determining a codeword satisfying the following Equation (1).

[Equation 1]

In Equation (1)

to be.

In Equation (1), H denotes a parity check matrix, C denotes a codeword, c _i denotes an i-th bit of a codeword, and N _ldpc denotes a codeword length. Here, h _i denotes an i-th column of the parity check matrix H.

The parity check matrix H is composed of N _ldpc columns equal to the number of bits of the LDPC codeword. Equation 1 means that the sum of the product of the i-th column h _i of the parity check matrix and the i-th codeword bit c _i is '0', so that the i-th column h _i is the i-th codeword bit c _i . < / RTI >

A parity check matrix used in a communication and broadcasting system is typically a quasi-cyclic LDPC code (or QC-LDPC code) using a parity check matrix, .

The QC-LDPC code is characterized by having a parity check matrix composed of a 0-matrix or a circulant permutation matrix having a small square matrix.

A permutation matrix P = (P _ij ) of Z Z Z size is defined as shown in Equation (2).

&Quot; (2) "

In Equation (2), P _ij (0? I, j < Z) means an entry of an i-th row and a j-th column in the matrix P. According to 0 ≤ i <Z for the permutation matrix P defined above, P is a cyclic permutation matrix in which each element of the identity matrix of ZХZ size is circularly shifted to the right by i times .

The parity check matrix H of the simplest QC-LDPC code can be expressed by the following equation (3).

&Quot; (3) &quot;

If P ^-1 is defined as a Z-ZZ-sized 0-matrix, the index a _ij of the cyclic permutation matrix or the 0-matrix in Equation (3) is {-1, 0, 1, 2, 1}. Also, the parity check matrix H in Equation (3) has n column blocks and m row blocks, so that the parity check matrix H has a size of mZ XnZ.

In general, a binary matrix of m X nn obtained by replacing each of the cyclic permutation matrix and the 0-matrix by 1 and 0 in the parity check matrix of Equation (3) is called a mother matrix of the parity check matrix H (H), and selects an exponent matrix E (H) of the parity check matrix H by selecting only the circulant permutation matrixes or the exponents of the 0-matrices, .

&Quot; (4) &quot;

Meanwhile, the performance of the LDPC code can be determined according to the parity check matrix. Therefore, it is necessary to design an efficient parity check matrix for an LDPC code having excellent performance. Also, there is a need for an LDPC encoding and decoding method capable of supporting various input lengths and coding rates.

For efficient design of QC-LDPC codes, a method known as lifting is used. Lifting is a method of efficiently designing a very large parity check matrix by setting a cyclic permutation matrix or a Z value that determines the size of a 0-matrix from a given small mother matrix according to a specific rule. The existing lifting method and QC-LDPC code designed through lifting are briefly summarized as follows.

First LDPC code C ₀ is the S number of QC-LDPC code is designed by the lifting method is given when _{C 1, C 2, ...,} C k, ..., C S ( same as C _k for 1 ≤ _k ≤ S), the parity check matrix of the QC-LDPC code C _k is H _k , and the value corresponding to the size of the row block and column block of the circulating matrix constituting the parity check matrix is Z _k . Here, C ₀ corresponds to the smallest LDPC code having a codeword matrix of C ₁ , ..., C _S as a parity check matrix, a Z ₀ value corresponding to the size of a row block and a column block is 1, 0 ≤ k ? S-1, Z _k &lt; Z _{k + 1} . In addition, for convenience the parity check matrix H for each code _k C _k has an index matrix _{E (H k) = a i} , j (k) of size mХn each index a _{i, j} ^(k) are {-1, 0, 1, 2, ..., Z _k - 1}. Lifting consists of the same steps as C ₀ → C ₁ → ... → C _S and Z _{k + 1} = q _{k + 1} Z _k (q _{k + 1} is a positive integer, k = 0, 1, ... , S-1). In addition, storing only the parity check matrix H _S C _S by the properties of the lifting process of the QC-LDPC code C _0, and according to the lifting scheme using the following Equation 5 or Equation 6, if the C _1, ..., C _S can be represented.

&Quot; (5) &quot;

&Quot; (6) &quot;

The most generalized method can be expressed as Equation (7) below.

&Quot; (7) &quot;

P _{i, j} = f (V _{i, j} , Z)

In Equation (7), f (x, y) denotes an arbitrary function having x and y as input values. V _{i, j} means an element corresponding to the i-th row and the j-th column of the exponent matrix of the parity check matrix corresponding to the LDPC code having the largest size (for example, corresponding to C _S in the above description). P _ij denotes an element corresponding to the i-th row and j-th column of the exponent matrix of the parity check matrix for an arbitrary-sized LDPC code (for example, corresponding to C _k in the above description), and Z denotes parity Means the size of the row block and column block of the circulating matrix constituting the check matrix. Therefore, if V _{i, j} is defined, a parity check matrix for an LDPC code having an arbitrary size can be defined.

In describing the present invention in future, the notation described above is named and defined as follows.

[Definition 1]

E (H _S ): maximum exponent matrix

V _{i, j} : corresponding to the (i, j) th element of the maximum exponent matrix element E (H _S )

The parity check matrix for an arbitrary LDPC code can be expressed using the maximum exponent matrix or the maximum exponent matrix element defined above.

In the next generation mobile communication system, there may be a plurality of maximum exponential matrices defined in order to ensure optimal performance for code blocks having various lengths. For example, there may be M different maximum exponential matrices, which can be expressed as follows.

&Quot; (8) &quot;

There may be a plurality of maximum exponent matrix elements corresponding thereto, which can be expressed as follows.

&Quot; (9) &quot;

In Equation (9), the maximum exponent matrix element (V _{i, j} ) _m corresponds to (i, j) of the maximum exponent matrix E (H _s ) _m . In the following description, the parity check matrix for the LDPC code is defined using the maximum exponent matrix defined above. This can be applied equally to expressing using the maximum exponent matrix element.

Here is how to add turbo code based code block segmentation and CRC in the LTE TS 36.213 document.

5G and next generation communication systems use LDPC codes in data channels unlike LTE systems. Even in the case of applying the LDPC code, one transport block is divided into a plurality of code blocks, and some code blocks can form one code block group. It is also possible that the number of code blocks in each code block group is the same or some other value. Bitwise interleaving may be applied to individual code blocks or code block groups or transport blocks.

3 is a diagram showing a basic structure of a matrix matrix (or a base graph) of an LDPC code.

In FIG. 3, the basic structure of the base graph 300 of the LDPC code supporting data channel coding in the next generation mobile communication system is fundamentally two. The base graph structure of the first LDPC code has a matrix structure with a maximum vertical length of 46 (320) and a maximum horizontal length of 68 (318). The base graph structure of the second LDPC code has a maximum vertical length of 42 (320) 52 (318). The base graph structure of the first LPDC code supports a code rate of at least 1/3 to a maximum of 8/9, and the base graph structure of the second LDPC code can support a code rate of at least 1/5 to a maximum of 8/9.

Basically, the LDPC code consists of six sub-matrix structures. The first sub-matrix structure 302 includes system bits. The second sub-matrix structure 304 is a square matrix and contains 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 a unitary matrix.

In the base graph structure of the first LDPC code, the length 322 of the first sub-matrix 302 has a value of 22 and the length 314 has a value of 4 or 5. [ The length 324 and the length 314 of the second sub-matrix 304 have values of 4 or 5, respectively. The transverse length 326 of the third sub-matrix 306 has a value of 42 or 41, and the length 314 has a value of 4 or 5. The vertical length 316 of the fourth sub-matrix 308 has a value of 42 or 41, and the horizontal length 322 has a value of 22. The width 324 of the fifth sub-matrix 310 has a value of 4 or 5, and the length 316 has a value of 42 or 41. [ The transverse length 326 and the longitudinal length 316 of the sixth sub-matrix 312 have values of 42 or 31, respectively.

In the basis graph structure of the second LDPC code, the length 322 of the first sub-matrix 302 has a value of 10 and the length 314 has a value of 7. Both the length 324 and the length 314 of the second sub-matrix 304 have a value of 7. The transverse length 326 of the third sub-matrix 306 has a value of 35, and the length 314 has a value of 7. The vertical length 316 of the fourth sub-matrix 308 has a value of 35, and the horizontal length 322 has a value of 10. The transverse length 324 of the fifth sub-matrix 310 has a value of 7, and the length 316 has a value of 35. [ The transverse length 326 and the transverse length 316 of the sixth sub-matrix 312 all have a value of 35.

One code block size that can be supported in the base graph structure of the first LDPC code is 22 Х Z (where Z = a Х 2 ^j , where Z is composed of the following table 3, and the maximum size of one code block that can be supported is 8448 , The minimum size of one code block that can be supported is 44. For reference, some or all of the candidates of Z values (272, 304, 336, and 368) may be additionally reflected in Table 3.

Z		a
		2	3	5	7	9	11	13	15
j	0	2	3	5	7	9	11	13	15
	One	4	6	10	14	18	22	26	30
	2	8	12	20	28	36	44	52	60
	3	16	24	40	56	72	88	104	120
	4	32	48	80	112	144	176	208	240
	5	64	96	160	224	288	352
	6	128	192	320
	7	256	384

One code block size that can be supported in the base graph structure of the first LDPC code is as follows.

286, 308, 330, 352, 296, 440, 484, 528, 572, 616, 660, 704, 792, 880, 968, 1056, 1144, 1232, 1320, 1408, 1584, 1760, 1936, 2112, 2288, 2464, 2640, 2816, 3168, 3520, 3872, 4224, 4576, 4928, 5280, 5632, 6336, 7040, 7744, 8448, (5984, 6688, 7392, 8096)

Here, (5984, 6688, 7392, 8096) may additionally be included.

Also, based on the base graph (BG # 1) of the first LDPC code, a total of M maximum exponential matrices

Is additionally defined. Typically, M can have a value of 8 or any natural number, and i has a value from 1 to M. The terminal transmits the matrix

To perform downlink data decoding or uplink data encoding (can be mixed with encoding). The matrix

Have a form in which certain element values are shifted in the base graph (BG # 1) of the first LDPC code. In other words,

Matrices are types that can have different shift values.

One code block size that can be supported in the basis graph structure of the second LDPC code is 10 Х Z (where Z = a × 2 ^j , where Z is the maximum number of code blocks that can be supported, (Or 3840), and the minimum size of one code block that can be supported is 20. Referring to Table 4, some or all of the candidates of Z value (288, 272, 304, 320, 336, 352, 368, and 384) Can be additionally reflected).

Z		a
		2	3	5	7	9	11	13	15
j	0	2	3	5	7	9	11	13	15
	One	4	6	10	14	18	22	26	30
	2	8	12	20	28	36	44	52	60
	3	16	24	40	56	72	88	104	120
	4	32	48	80	112	144	176	208	240
	5	64	96	160	224
	6	128	192
	7	256

One code block size that can be supported in the base graph structure of the second LDPC code is as follows. 200, 220, 240, 260, 280, 300, 320, 360, 400, 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)

Here, (2880, 3200, 3520, 3840, 2720, 3040, 3360, 3680) are values that can be additionally included.

Further, based on the basis graph (BG # 2) of the second LDPC code, a total of M maximum exponent matrix

Is additionally defined. Typically, M can have a value of 8 or any natural number, and i has a value from 1 to M. The terminal

And performs downlink data decoding or uplink data encoding using the matrix. remind

The matrices have a form in which specific element values are shifted in the base graph (BG # 2) of the second LDPC code. In other words,

Matrices are types that can have different shift values.

As described above, two kinds of base graphs are provided in the next generation mobile communication system. Accordingly, certain terminals may support only the first base graph or only the second base graph, or there may be terminals that support both base graphs. These are summarized in Table 5 below.

Terminal type	Supported actions
Type 1	Supports only the first base graph or supports the maximum exponent matrix E (H S ) 1 i
Type 2	Supports only the second basis graph or supports the maximum exponent matrix E (H S ) 2 i
Type 3	Supports both basis graphs or supports maximum exponential matrices E (H S ) 1 i and E (H S ) 2 i

When receiving the downlink data information through the downlink control information from the base station supporting Type 1, the base graph applied to the transmission block including the downlink data information is always determined to be the first base graph. When data encoding or decoding is performed, Maximum exponent matrix

Is applied. When receiving the downlink data information through the downlink control information from the base station, the terminal supporting Type 2 determines that the base graph applied to the transmission block including the downlink data information is always the second base graph, Maximum exponent matrix

When receiving the downlink data information through the downlink control information from the Node B, the UE supports the base graph applied to the transport block including the downlink data information from the base station to the SIB, RRC or MAC CE And is set up in advance by higher signaling, or through downlink control information that is transmitted to a common terminal group, a common terminal (cell), or a terminal specific control channel. The downlink control information may or may not include the transport block scheduling information.

4 is a block diagram illustrating a process of receiving a terminal according to an embodiment of the present invention.

In FIG. 4, the UE receives (400) downlink control information through a terminal common cell downlink control channel or a terminal group common downlink control channel or a UE-specific downlink control channel.

The UE determines (410) whether a combination of one or more of the following conditions is satisfied through the reception of the downlink control information.

A. The RNTI scrambled in the CRC of the downlink control information

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

C. The base graph indicator included in the downlink control information

D. The scheduling related value included in the downlink control information

RNTI (scrambled RNTI), a P-RNTI (paging-RNTI), a SI-RNTI (system information-RNTI), or an SC-RNTI (RNTI) or C-RNTI (cell-RNTI)) other than the G-RNTI (Group-RNTI) or the G-RNTI And then the operation 1 (420) is performed.

If the scrambled RNTI is a RA-RNTI, a P-RNTI, an SI-RNTI, an SC-RNTI, or a G-RNTI, the UE determines that the RNTI is a condition 2, .

If the size including the transport block and the CRC included in the downlink control information, which is the B condition, is equal to or larger than a certain threshold value (? ₁ ), the terminal determines that the condition is 1 and performs operation 1 (420).

If the size including the transport block and the CRC included in the downlink control information, which is the B condition, is less than or equal to a certain threshold value (? ₂ ), the terminal determines that the condition 2 is satisfied and performs operation 2 (430).

The threshold value? ₁ or the threshold value? ₂ may be a fixed value of 2560 (or 3840 or 960 or 1040 or 1120 or 170 or 640 or any other value). The threshold value? ₁ or the threshold value? ₂ may be the same value or different values.

Alternatively, the threshold value (? ₁ ) or the threshold value (? ₂ ) may be a value previously set in an upper signaling such as SIB, RRC or MAC CE, or may be a value set in advance for a terminal group common terminal common terminal or a downlink May be a value set through link control information. In this case, a value fixed to 2560 (or 3840 or 960 or 1040 or 1120 or 170 or 640 or any other value) may be used as the default threshold value (?) Before the threshold value? Is set . When the UE determines that the CRC of the downlink control information is RA-RNTI or P-RNTI or SI-RNTI or SC-RNTI or G-RNTI before the threshold value? ₁ or threshold value? ₂ is set Before scrambling.

(Or a transmission block size + CRC size) smaller than 2560 (or 3840) (or simultaneously larger than 160 or 640) including a transport block and a CRC included in the downlink control information, which is a B condition, The minimum code block length (K _min ) among the code block lengths (K) that can be supported in the first base graph and the code block lengths (K) that can be supported in the second basis graph belong to the first base graph The UE determines that the condition 1 is satisfied and performs the operation 1 (420).

(Or a transmission block size + CRC size) smaller than 2560 (or 3840) (or simultaneously larger than 160 or 640) including a transport block and a CRC included in the downlink control information, which is a B condition, And the minimum code block length K among the code block lengths that can be supported in the second basis graph belongs to the second basis graph, the terminal determines that the code block length corresponds to the condition 2 And performs operation 2 430. [

This can be expressed using the following equation.

(TB + CRC) ≤ K ≤ V ₂ where K ∈ K ¹ or K ∈ K ²

K * = min (K)

If K * ∈ K ¹ , Condition 1 satisfies and Operation 1 (420) is performed

If K * ∈ K ² , Condition 2 satisfies and Operation 2 (430) is performed

Where K is the length of the code block, K * is the length of the selected code block, and TB is the size of the transport block. CRC denotes a CRC size, K ¹ denotes a set of code block lengths that can be supported in the first base graph, and K ² denotes a set of code block lengths that can be supported in the second base graph.

Alternatively, it can be expressed using the following equation.

V ₁ ≤ (TB + CRC) ≤ K ≤ V ₂ where K ∈ K ¹ or K ∈ K ²

K * = min (K)

If K * ∈ K ¹ , Condition 1 satisfies and Operation 1 (420) is performed

If K * ∈ K ² , Condition 2 satisfies and Operation 2 (430) is performed

Where K is the length of the code block, K * is the length of the selected code block, and TB is the size of the transport block. CRC denotes a CRC size, K ¹ denotes a set of code block lengths that can be supported in the first base graph, and K ² denotes a set of code block lengths that can be supported in the second base graph.

K ¹ is the first basis graph (or maximum exponent matrix

), And the types of the sets can be one or a combination of two or more of the following. V ₁ may be 160 or 640 or other values. V ₂ may be 2560 or 3840 or 960 or 1040 or 1120 or other values.

Or when TB + CRC is smaller than V _{1 in the} above equation, the maximum exponent matrix

And when TB + CRC is larger than V _{2 in the} above equation, the maximum exponent matrix

It is possible to perform decoding or encoding.

K ¹ is the first basis graph (or the maximum exponent matrix

), And the types of the sets can be one or a combination of two or more of the following.

1. If K is less than or equal to 2560

264, 286, 308, 330, 352, 296, 484, 528, 572, 616, 660, 704, 792, 968, 1056, 1144, 1232, 1320, 1408, 1584, 1936, 2112, 2288, 2464

2. If K is less than or equal to 3840

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

3. If K is less than or equal to 960

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

4. If K is less than or equal to 1040

446, 88, 132, 154, 176, 198, 242, 264, 286, 308, 330, 352, 296, 484, 528, 572, 616, 660, 704, 792, 968

5. If K is less than or equal to 1120

444, 666, 88, 132, 154, 176, 198, 242, 264, 286, 308, 330, 352, 296, 484, 528, 572, 616, 660, 704, 792, 968, 1056

It is usually possible that the values in the table are used when all or some of the values are omitted from the above table when the value is equal to or smaller than M. The value of M may be selected to be 160 or 640 or other values.

K ² is a second basis graph (or a maximum exponent matrix

), And the types of the sets can be one or a combination of two or more of the following.

1. If K is less than or equal to 2560

200, 220, 240, 260, 280, 300, 320, 360, 400, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040, 1120, 1200, 1280, 1440, 1600, 1760, 1920, 2080, 2240,

2. If K is less than or equal to 3840

200, 220, 240, 260, 280, 300, 320, 360, 400, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040, 1120, 1200, 1280, 1440, 1600, 1760, 1920, 2080, 2240, 2400, 2560, , 3200, 3360, 3520, 3680, 3840)

3. If K is less than or equal to 960

200, 220, 240, 260, 280, 300, 320, 360, 400, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960

4. If K is less than or equal to 1040

200, 220, 240, 260, 280, 300, 320, 360, 400, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040

5. If K is less than or equal to 1120

200, 220, 240, 260, 280, 300, 320, 360, 400, 400, 440, 480, 520, 560, 600, 640, 720, 800, 880, 960, 1040, 1120

If the base graph indicator included in the downlink control information indicating the C condition indicates a value of 0 (or 1), the UE determines that the condition 1 is satisfied and performs operation 1 (420).

If the base graph indicator included in the downlink control information indicating the C condition indicates a value of 1 (or 0), the terminal determines that the condition 2 is satisfied, and performs operation 2 (430).

If the MCS or RV or NDI or the frequency or time resource allocation values among the scheduling related values included in the downlink control information which is the D condition indicates the specific information, the UE determines that the condition 1 is satisfied, .

If the MCS or RV or the NDI or the frequency or time resource allocation values among the scheduling related values included in the downlink control information that is the D condition indicates the specific information, the UE determines that the condition 2 is satisfied, .

When performing the operation 1, the terminal performs an operation of one or more of the following.

1. The terminal computes the first basis graph (or maximum exponent matrix

And decodes the transport block indicated by the downlink control information based on the code block length that can be supported by the downlink control information.

2. The UE attempts to decode the transport block indicated by the downlink control information with reference to the next available code block table.

286, 308, 330, 352, 296, 440, 484, 528, 572, 616, 660, 704, 792, 880, 968, 1056, 1144, 1232, 1320, 1408, 1584, 1760, 1936, 2112, 2288, 2464, 2640, 2816, 3168, 3520, 3872, 4224, 4576, 4928, 5280, 5632, 6336, 7040, 7744, 8448, (5984, 6688, 7392, 8096)

3. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 44, 88, 176, 352, 704, 1408, 2816, 5632

B. 44, 66, 110, 154, 198, 242, 286, 330

C. 44, 66, 154, 198, 242, 286, 330

4. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 66, 132, 264, 528, 1056, 2112, 4224, 8448

B. 88, 132, 220, 308, 396, 484, 572, 660

C. 88, 132, 308, 396, 484, 572, 660

5. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 110, 220, 440, 880, 1760, 3520, 7040

B. 176, 264, 440, 616, 792, 968, 1144, 1320

C. 1760, 3520, 7040

D. 3520, 7040

E. 7040

F. 176, 264, 616, 792, 968, 1144, 1320

6. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 154, 308, 616, 1232, 2464, 4928

B. 352, 528, 880, 1232, 1584, 1936, 2288, 2640

C. 352, 528, 1232, 1584, 1936, 2288, 2640

7. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 198, 396, 792, 1584, 3168, 6336

B. 704, 1056, 1760, 2464, 3168, 3872, 4576, 5280

C. 704, 1056, 2464, 3168, 3872, 4576, 5280

8. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 242, 484, 968, 1936, 3872

B. 1408, 2112, 3520, 4928, 6336, 7744

C. 1408, 2112, 4928, 6336, 7744

9. One or more combinations of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 286, 572, 1144, 2288, 4576

B. 2816, 4224, 7040

10. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 330, 660, 1320, 2640, 5280

B. 5632, 8448

When the terminal performs the operation 2, it performs one or a combination of two or more of the following.

1. The terminal attempts to decode a transport block indicated by the downlink control information based on a code block length that can be supported in the second base graph.

2. The UE attempts to decode the transport block indicated by the downlink control information with reference to the next available code block table.

200, 220, 240, 260, 280, 300, 320, 360, 400, 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)

3. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 20, 40, 80, 160, 320, 640, 1280

B. 20, 30, 50, 70, 90, 110, 130, 150

4. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

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

B. 40, 60, 100, 140, 180, 220, 260, 300

5. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

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

B. 80, 120, 200, 280, 360, 440, 520, 600

6. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 70, 140, 280, 560, 1120, 2240

B. 160, 240, 400, 560, 720, 880, 1040, 1200

7. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 90, 180, 360, 720, 1440, (2880)

B. 320, 480, 800, 1120, 1440, 1760, 2080, 2400

8. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 110, 220, 440, 880, 1760, (3520)

B. 640, 960, 1600, 2240, (2880), (3520)

9. One or more combinations of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 130, 260, 520, 1040, 2080

B. 1280, 1920, (3200)

10. One or a combination of two or more of the following possible code block sets

Which corresponds to a code block that the terminal encodes or decodes. At least for the code block, the terminal supports the

And decodes the transport block indicated by the downlink control information based on the matrix.

A. 150, 300, 600, 1200, 2400

B. 2560, (3840)

The numerals denoted by parentheses in the present invention mean that the corresponding values may or may not be included.

In the present invention, the number of information bits may mean the amount of data to be transmitted or the transport block size (TBS) of an upper layer. The TBS is typically transmitted during one TTI, but it may also be possible to transmit over several TTIs. In the present invention, TBS may be represented by N.

The values written in parentheses in the tables described in the present invention are values that may be included in all or part of the table or may not be included in all or part thereof.

5 is a diagram illustrating a method in which one transport block is segmented into one or more code blocks (CBs). Referring to FIG. 5, a CRC 503 may be added to the last or first part of one transmission block 501 to be transmitted in uplink or downlink. The CRC may have 16 bits or 24 bits or a predetermined number of bits, or may have a variable number of bits depending on a channel condition or the like, and the CRC may be used to determine whether channel coding is successful. Blocks 501 and 503 to which TB and CRC are added can be divided into a plurality of code blocks 507, 509, 511 and 513 (505).

In this case, the last code block 513 may be smaller in size than the other code blocks, or may be set to have a length equal to the length of the other code blocks by putting 0, a random value or 1 in the code block. Can be adjusted. CRCs 517, 519, 521, and 523 may be added to the divided code blocks 515, respectively. The CRC may have 16 bits or 24 bits or a fixed number of bits, and the CRC may be used to determine whether channel coding is successful. However, the CRC 503 added to the TB and the CRCs 517, 519, 521, and 523 added to the code block may vary in length depending on the type of the channel code to be applied to the code block. Also, CRC can be added or omitted even when polar codes are used. If there is one CB in the above dividing process, the CRC 517 added to the CB may be omitted.

The CRC inserted in the TB used to determine the success or failure of decoding of the TB after decoding the TB in the receiver may have at least two possible values of length L. [ That is, a CRC having a long length is used when a transmission block is divided into two or more code blocks, and a CRC having a short length is used when a transmission block is transmitted with one code block. When an LDPC code is used for coding in a mobile communication system, since the LDPC code has a parity check function as a code itself, it has a function of determining the degree of decoding success without CRC insertion.

When a specific mobile communication system uses an LDPC code and desires to acquire an additional decoding success judgment level, it is possible to use a technique of inserting a CRC in addition to a parity check function of an LDPC code to determine a final decoding success or failure. Method, it is possible to obtain the error rate level of the decoding success or failure determination desired by the system. For example, if the decoding error rate required to determine whether the decoding is required by the system is 10 ^-6 and the decision error rate obtained by the parity check function of the LDPC code is 10 ^-3 , a CRC having a decision error rate of 10 ^-3 is further inserted So that a system judgment error rate of 10 ^-6 can be achieved.

Generally, the longer the length of the CRC, the lower the error rate of decoding success or failure. When the transport block is divided into two or more code blocks and transmitted, the TB itself is configured as a concatenation of LDPC codes and the parity check function of the LDPC code itself can not be used. On the other hand, when the transport block is composed of one code block, the parity check function of the LDPC code can be used. Therefore, in a certain system, it is possible to insert a CRC having a long or short length into the TB according to the number of code blocks in the transport block. In the embodiments of the present invention, it is assumed that the length L of the CRC inserted in the TB is a long length L + or a short length L-, depending on whether the TB is divided and divided into two or more code blocks. An example of the possible values for L + is 24, which was used in the case of LTE, and for L-, it is possible to recycle any of the shorter lengths, but the 16 used in the LTE control channel. However, the embodiment of the present invention is not limited to 16, which is an example of the L-value.

Whether or not a specific TB is divided into a plurality of code blocks is determined depending on whether or not a given TB can be transmitted in one code block, it can be judged as follows:

- If N + L- value is less than or equal to the highest possible CB length, TB is transmitted as one code block; If (N + L-) < = _Kmax , then one CB is used

- If the N + L- value is greater than the maximum possible CB length, TB is divided and TB transmitted to multiple code blocks; If (N + L-)> K max, then CB is segmented

Here, K _max represents the largest code block size among the possible code block sizes.

In the conventional LTE system, the MCS index transmitted from the DCI and the number of allocated PRBs are used to determine the TBS. As a downlink reference, a 5-bit MCS index is transmitted in the DCI, and the modulation order Q _m and the TBS index can be found from Table 6 below.

MCS Index I MCS	Modulation Order Q m	TBS Index I TBS
0	2	0
One	2	One
2	2	2
3	2	3
4	2	4
5	2	5
6	2	6
7	2	7
8	2	8
9	2	9
10	4	9
11	4	10
12	4	11
13	4	12
14	4	13
15	4	14
16	4	15
17	6	15
18	6	16
19	6	17
20	6	18
21	6	19
22	6	20
23	6	21
24	6	22
25	6	23
26	6	24
27	6	25
28	6	26
29	2	reserved
30	4
31	6

The number of PRBs used for data transmission can be known from the resource allocation information transmitted from the DCI, and the TBS can be determined from Table 7 together with the TBS index found in Table 6 below.

[Table 7]

Table 7 shows the TBS table when the PRB is 1 to 10 and the TBS index is 0 to 26. However, this table is also used in the case of the PRB of up to 110 and the additional TBS index. The number of the corresponding cell using the number of allocated PRBs and the TBS index is the TBS understood by the BS and the UE.

The TBS determination method and apparatus for downlink data transmission in a terminal as described in the present invention can be sufficiently applied to a transmission block encoding process of an uplink data channel. Also, the encoding and decoding operations of the terminal described in the present invention can be sufficiently applied to the base station and the decoding and decoding operations.

In the present invention, the transport block may be data transmitted from an upper layer to a physical layer, and may be a unit that can be initially transmitted in the physical layer.

In the present invention, N1_max and N2_max may indicate the maximum code block length when BG # 1 is used and the maximum code block length when BG # 2 is used, respectively, in the LDPC code. For example, N1_max = 8448 and N2_max = 3840. However, the embodiment of the present invention is not limited to this value. In the present invention, N1_max can be mixed with N1 _max or N1 _{, max,} and N2_max can be mixed with N2 _max or N2 _{, max} .

In the present invention, L_ {TB, 16} and L_ {TB, 24} may be lengths of CRCs added to the TB, and L_ {TB, 16} <L_ {TB, 24}. For example, L_ {TB, 16} may be 16, and L_ {TB, 24} may be 24. In the present invention, L_ {TB, 16} may be mixed with L _{TB, 16,} and L_ {TB, 24} may be mixed with L _TB, In the present invention, L_ {CB} may be the length of the CRC added to _CB and may be mixed with L _CB .

[First Embodiment]

The first embodiment provides a TBS determination method according to CB-CRC and base graph (BG) selection. The present embodiment can be applied to a case where the TB is divided into two or more code blocks when the TBS is large in a specific case, and each code block is channel-coded by the LDPC code using the BG # 2 and transmitted. That is, when the TBS is large, it is possible to transmit data using the BG # 2. In the present embodiment, R_1 and R_2 may indicate a code rate as a criterion for selecting BG # 1 or BG # 2 of the LDPC, and may be mixed with R ₁ and R ₂ , respectively. For example, R ₁ = 1/4 R ₂ = 2/3, but the method provided by the present invention is not limited thereto. In the present invention, R, referred to as a code rate, and R ₁ and R ₂ can be expressed and expressed by various methods such as a fraction and a prime number. For example, R may be the same value as 0.28, Various values and values can be used. When selecting a BG among BG # 1 and BG # 2 during data transmission, a code rate, a soft buffer of the terminal, and the like can be considered.

The BS may transmit data by allocating a frequency resource of an arbitrary number of PRBs and a time resource of an arbitrary number of slots or symbols to the UE, and the scheduling information related to the scheduling information may be transmitted through the downlink control information (DCI) Setting or a combination thereof. When the BS and the UE are given scheduling information, the TBS can be determined in the following order.

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

- Step 1-2: Determine the number of temporary CBs (C), the process of making byte alignment (multiples of 8) and the number of temporary CBs (B)

- Step 1-3: TBS decision process excluding the number of CRC bits (TBS)

In step 1-1, a temporary TBS value is determined in consideration of the amount of a resource area to which data to be transmitted can be mapped. This code rate (R), a modulation order (Q _m), the data rate matching (matching rate) is to be mapped may RE (N _RE), the allocated number of PRB, or RB (#PRB), the number of OFDM symbols allocated, allocating The number of slots, the number of slots, and the reference value of RE number mapped in one PRB. For example, A may be determined by the following equation (10).

&Quot; (10) &quot;

The modulation order Q _m and the code rate R may be included in the DCI and transmitted to the UE. The number of layers v used when transmitted can be delivered to the terminal via DCI or higher signaling, or a combination of both. N _RE can be determined using the number of REs to which data is mapped using rate matching when data is transmitted by the BS, and when the BS and the MS know the resource allocation information, the N _RE is equal to the BS Can understand. When the N _RE is calculated, data is mapped by a rate matching method, but data is punctured for a special reason such as channel state information reference signal (CSI-RS) or URLLC or uplink control information (UCI) (RE) that is not actually mapped to data is included in _NRE . This may be done so that the base station and the terminal can understand the TBS equally even when the base station does not notify the terminal but does not transmit a part of the data that it intends to arbitrarily map in a puncturing manner.

An MCS table as shown in Table 8 below is defined and a BS can transmit information on Q _m and R by transmitting an MCS index to the UE. And in the order of modulation refers to information, such as QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, the case of QPSK Q _m = 2, if the 16QAM case of Q _m = 4, 64QAM case of Q _m = 6, 256QAM Q _m = 8 for 1024QAM, and Q _m = 10 for 1024QAM. That is, Q _m may mean the number of bits that can be transmitted in the modulated symbol.

MCS Index	Modulation Order	Code Rate
0	2	0.1171875
One	2	0.15332031
2	2	0.18847656
3	2	0.24511719
4	2	0.30078125
5	2	0.37011719
6	2	0.43847656
7	2	0.51367188
8	2	0.58789063
9	2	0.66308594
10	4	0.33203125
11	4	0.36914063
12	4	0.42382813
13	4	0.47851563
14	4	0.54003906
15	4	0.6015625
16	4	0.64257813
17	6	0.42773438
18	6	0.45507813
19	6	0.50488281
20	6	0.55371094
21	6	0.6015625
22	6	0.65039063
23	6	0.70214844
24	6	0.75390625
25	6	0.80273438
26	6	0.85253906
27	6	0.88867188
28	6	0.92578125
29	2	N / A
30	4	N / A
31	6	N / A

In Table 8, Q _m and R are transmitted together with a 5-bit MCS index. However, it can be transmitted in DCI as a 6-bit MCS index, or 3-bit Q _m and 3-bit R are transmitted using bit fields Or may be delivered to the terminal in a variety of ways. Or A = (number of assigned PRBs) x (number of reference REs per PRB) x Q _m x R xv.

In step 1 - 2, the number of temporary code blocks (temporary CB number) C is determined using the determined A, and A is made to be a multiple of 8 and a multiple of the temporary CB number. This is to ensure that the length of the CRC added to the finally determined TBS and TB is a multiple of CB while being byte aligned. First, the temporary CB number can be determined by the following pseudo-code 1.

[pseudo-code 1]

[start]

If R &lt; R ₁ , then

,

Else

.

End if of R

[End]

Where R may be the value delivered at the DCI as mentioned above at the code rate. As mentioned above, R ₁ can be 1/4, N _{1, max} can be 8448, and N _{2, max} can be 3840. In this case, it may be defined by pseudo-code 2, but it may not be limited thereto. In this case, R ₁ and N _{1, max} , N _{2 and max} are described as 1/4, 8448, and 3840, respectively, but the present invention is not limited thereto and any other value may be used.

[pseudo-code 2]

[start]

If R? 1/4, then

,

Else

.

End if of R

[End]

C obtained above may be the number of temporary CBs. CB splitting is performed when the TB is finally transmitted and the number of temporary CBs may be different from the actual number of CBs obtained at this time, but the number of actual CBs can be set to be equal to the number of temporary CBs.

Now, A is set to a multiple of 8 and C in step 1-1 to generate B, so that all code blocks do not contain unnecessary bits or unnecessary zero padding bits. Lt; / RTI &gt; B can be calculated as shown in Equation (11).

&Quot; (11) &quot;

In Equation (11)

or

or

It is possible to apply it to the above. In the present invention, mod (x, y) is a remainder obtained by dividing x by y,

As shown in FIG. In the present invention

Means a minimum integer greater than x, and can be mixed with ceil (x).

Means the largest integer less than x, and can be mixed with floor (x). The above Equation (11)

, Which may mean that B is a multiple of 8C closest to A. Round (x) means the integer nearest to x, or it can mean rounding.

Equation (11) is for making A a multiple of 8C, but can be modified and applied to make a common multiple or a common multiple of 8 and C. Therefore, Equation (11)

or

or

It may be possible to apply it by being modified. In the above, LCM (a, b) means the least common multiple of a and b.

In the last step 1-3, the number of bits added for the CRC is excluded from the information bits to be transmitted. This can be done by pseudo-code 3 below.

[pseudo-code 3]

[start]

If R? R ₁ ,

If B ≤ N _{2, max} , then TBS = B - L _{TB, 16}

Else TBS = B - L _{TB, 24} - C Х L _CB

End if of B

Else

If B ≤ N _{2, max} , then TBS = B - L _{TB, 16}

Else if B ≤ N _{1, max} , then TBS = B - L _{TB, 24}

Else TBS = B - L _{TB, 24} - C Х L _CB

End if of B

End if of R

[End]

If the value of each variable is applied as described above, [pseudo-code 3] can be applied as [pseudo-code 4], but it is not limited thereto.

[pseudo-code 4]

[start]

If R? 1/4,

If B ≤ 3840, then TBS = B - 16

Else TBS = B - 24 Х (C + 1)

End if of B

Else

If B ≤ 3840, then TBS = B - 16

Else if B ≤ 8448, then TBS = B - 24

Else TBS = B - 24 Х (C + 1)

End if of B

End if of R

[End]

L _{TB, 16} and L _{TB, 24} are considered because the CRC length to be applied to TB may vary depending on the size of TBS. In case of 1 code block, the CRC added to CB may be omitted or added to CB It is considered that the CRC length may become zero.

As another example, it is possible that the steps 1-3 are performed by transforming into [pseudo-code 5] or [pseudo-code 6] as described below.

[pseudo-code 5]

[start]

If B ≤ N _{2, max} , then TBS = B - L _{TB, 16}

Else TBS = B - L _{TB, 24}

End if of B

[End]

[pseudo-code 6]

[start]

If B ≤ 3840, then TBS = B - 16

Else TBS = B - 24

End if of B

[End]

The [pseudo-code 5] or [pseudo-code 6] does not exclude the CRC length added to the CB in calculating the final TBS. Therefore, when the actual data is mapped and transmitted later, the CRC length of the CB may be added to the calculated TBS, so that the actual code rate may be larger than R. [

6 is a flowchart showing a step of transmitting and receiving data by calculating a TBS by a Node B and a UE in downlink or uplink data scheduling and transmission. When the scheduling and data transmission processes are started, the BS determines scheduling information (602) and delivers the scheduling information to the MS in a combination of at least one of DCI, system information, MAC CE, and RRC signaling (604) . The terminal and the base station calculate TBS from the determined scheduling information (606). In step 606, TBS may be calculated using steps 1-1, 1-2, and 1-3 described above. Steps 1-1, 1-2, and 1-3 may be concurrently performed or may be performed in reverse order. CB segmentation and channel coding, decoding, and retransmission operations are then performed 608 using the calculated TBS to complete data scheduling and transmission.

The TBS determination method provided in the embodiment can be applied only to a case where a specific combination of the MCS index and the allocated PRB number is not applied to the base station and the UE. For example, if the scheduling is determined by the MCS index 6 and the PRB number is 1 at this time, the TBS may be determined to be a fixed value of 328 instead of the above method, and data may be transmitted. Therefore, the BS and the MS may know the values of the TBS to be used according to the combination of the PRB numbers such as the MCS index or the code rate index in advance, and the TBS is determined only by the method provided in the above embodiment .

The TBS determination method of the present embodiment is applicable only to the initial transmission, and in case of retransmission, transmission / reception can be performed assuming the TBS determined in the initial transmission of the retransmission.

[Second Embodiment]

The second embodiment provides a method of determining TBS according to CB-CRC and BG selection. The present embodiment can be applied to a case in which TB is divided into two or more code blocks when each TBS is large in a specific case, and each code block is channel-coded by an LDPC code using BG # 2. That is, when the TBS is large, it is possible to transmit data using the BG # 2. In the present embodiment, R_1 and R_2 may indicate a code rate that is a criterion for selecting BG # 1 or BG # 2 of the LDPC, and may be mixed with R ₁ and R ₂ , respectively. For example, R ₁ = 1/4 R ₂ = 2/3, but the method provided by the present invention is not limited thereto. Also, in the present invention, R, referred to as code rate, and R ₁ and R ₂ can be expressed and expressed in various ways such as a fraction and a prime. When selecting a BG among BG # 1 and BG # 2 during data transmission, a code rate, a soft buffer of the terminal, and the like can be considered. This embodiment is characterized in that the process for adjusting the TBS to a multiple of 8 or a multiple of CB or a common or least common multiple of 8 and CB is performed at the end of the TBS calculation.

The BS may transmit data by allocating a frequency resource of an arbitrary number of PRBs and a time resource of an arbitrary number of slots or symbols to the UE, and the scheduling information related to the scheduling information may be transmitted through the downlink control information (DCI) Setting or a combination thereof. When the BS and the UE are given scheduling information, the TBS can be determined in the following order.

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

- Step 2-2: Determine the temporary CB number (C) using the determined A, and the value obtained by adding the length of the TB-CRC to the TBS is byte aligned (a process of making a multiple of 8) and a multiple of the temporary CB number TBS determination &lt; RTI ID = 0.0 &gt;

Step 2-1 may be the same as step 1-1 of the first embodiment. In step 2-1, the temporary TBS value is determined in consideration of the amount of the resource area to which the data to be transmitted can be mapped. This code rate (R), a modulation order (Q _m), the data rate can be matched RE mapped (N _RE), assigned PRB or RB number (#PRB), the number of OFDM symbols allocated, the number of assigned slots, It is possible to determine the number of temporary information bits by a combination of at least one of the RE number of reference values mapped in one PRB.

A, for example,

Lt; / RTI &gt; The modulation order Q _m and the code rate R may be included in the DCI and transmitted to the UE. The number of layers v used when transmitted can be delivered to the terminal via DCI or higher signaling, or a combination of both. N _RE can be determined using the number of REs to which data is mapped using rate matching when data is transmitted by the BS, and when the BS and the MS know the resource allocation information, the N _RE is equal to the BS Can understand. Calculating the N _RE, but as the data is mapped to a rate matching method, a special reason, data such as the CSI-RS or URLLC or UCI transmission is actually punctured RE it is also included in the N _RE where no data is mapped. This may be done so that the base station and the terminal can understand the TBS equally even when the base station does not notify the terminal but does not transmit a part of the data that it intends to arbitrarily map in a puncturing manner.

The MCS table is defined as shown in Table 8, and the BS can transmit information on Q _m and R by transmitting an MCS index to the UE. And in the order of modulation refers to information, such as QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, the case of QPSK Q _m = 2, if the 16QAM case of Q _m = 4, 64QAM case of Q _m = 6, 256QAM Q _m = 8 for 1024QAM, and Q _m = 10 for 1024QAM. That is, Q _m may mean the number of bits that can be transmitted in the modulated symbol. In Table 8 above, Q _m and R are transmitted together with a 5-bit MCS index. However, it can be transmitted in the DCI as a 6-bit MCS index, or 3-bit Q _m and 3-bit R are transmitted using bit fields Or may be delivered to the terminal in a variety of ways. Or A = (number of assigned PRBs) x (number of reference REs per PRB) x Q _m x R xv.

Step 2-2 may be performed as follows [pseudo-code 7] or [pseudo-code 8].

[pseudo-code 7]

[start]

If R? R ₁ ,

If A ≤ N _{2, max} - L _{TB, 16} ,

C = 1 and TBS =

.

Else

TBS =

End if of A

Else

If A ≤ N _{1, max} - L _{TB, 24} ,

C = 1 and TBS =

.

Else

TBS =

End if of A

End if of R

[End]

In the above, TBS =

TBS =

As shown in FIG.

[pseudo-code 8]

[start]

If R? 1/4,

If A ≤ 3824,

C = 1 and TBS =

.

Else

TBS =

End if of A

Else

If A? 8424,

C = 1 and TBS =

.

Else

TBS =

End if of A

End if of R

[End]

The [pseudo-code 7] can be transformed into [pseudo-code 7-A] or [pseudo-code 7-B] or pseudo code 7-C as follows. The following can be a method that assumes that TB-CRC has already been added to A.

[pseudo-code 7-A]

[start]

If R? R ₁ ,

If A &lt; N _{2, max} ,

C = 1 and TBS =

.

Else

TBS =

End if of A

Else

If A ≤ N _{1, max} ,

C = 1 and TBS =

.

Else

TBS =

End if of A

End if of R

[End]

[pseudo-code 7-B]

[start]

If I _MCS ≤ I _{MCS, BG # 2} ,

If A &lt; N _{2, max} ,

C = 1 and TBS =

.

Else

TBS =

End if of A

Else

If A ≤ N _{1, max} ,

C = 1 and TBS =

.

Else

TBS =

End if of A

End if of R

[End]

In the above, I _MCS may be an MCS index or a parameter related to MCS or code rate. I _{MCS, and BG # 2} may be reference values of I _MCS for selecting BG # 2.

[pseudo-code 7-C]

[start]

If R? R ₁ ,

If A &lt; N _{2, max} ,

C = 1 and TBS =

.

Else

TBS =

End if of A

Else

If A ≤ N _{1, max} ,

C = 1 and TBS =

.

Else

TBS =

End if of A

End if of R

[End]

Where alpha is a quantization factor and may be a value that determines the granularity of TBS. The value a may be a value that the base station and the terminal know by making a promise or may be a value that the base station sets to the terminal in higher signaling. Alternatively, it may be a value determined according to the value of A or C.

[Pseudo-code 8] can be transformed into [pseudo-code 8-A] and applied as follows.

[pseudo-code 8-A]

[start]

If R? 1/4,

If A &lt; = 3840,

C = 1

TBS =

.

Else

TBS =

End if of A

Else

If A ≤ 8448,

C = 1 and TBS =

.

Else

TBS =

End if of A

End if of R

[End]

In the above, " If R? 1/4,? Is not limited to a 1/4 value, and it may be possible to apply a modified value such as " If R? 0.28, These conditional statements may also be applied to compare MCS index values such as " If I _MCS &lt; 3, "

In the pseudo-codes, L _{TB, 16} and L _{TB, 24} may be different values. Also, in the above description, the number of CRC bits applied to the division of A when C is calculated and the CRC bits to be excluded from the calculation of TBS finally may be different according to the code rate R and the calculated A, respectively. In the above,

As described in the first embodiment,

Or A + (8-mod (A, 8)) or A-mod (A, 8) or

It may be possible to apply it by being deformed. In addition,

May be transformed into A- (C x 8-mod (A + 24, C x 8) or A-mod (A + 24, C x 8) and applied. Also, TBS =

TBS =

As shown in FIG. Accordingly, the pseudo-code can be modified and applied as follows [pseudo-code 9]. It may also be possible to use other equations or the like which give the same result.

[pseudo-code 9]

[start]

If R? 1/4,

If A ≤ 3824,

C = 1 and TBS =

.

Else

(A + 24, C x 8) or A-mod (A + 24, C x 8)

End if of A

Else

If A? 8424,

C = 1 and TBS =

.

Else

(A + 24, C x 8) or A-mod (A + 24, C x 8)

End if of A

End if of R

[End]

The step 2-2 may be a process of determining the number of temporary code blocks (temporary CB number) C using the determined A, and making the length of the CRC of TBS + TB a multiple of 8 and C based on the number of temporary code blocks.

In the present invention, mod (x, y) is a remainder obtained by dividing x by y,

As shown in FIG. In the present invention

Means a minimum integer greater than x, and can be mixed with ceil (x).

Means the largest integer less than x, and can be mixed with floor (x). Round (x) means the integer nearest to x, or it can mean rounding.

In the above equation provided in this embodiment, C x 8 is used to multiply 8 and C, but it is also possible that C x 8 is modified to LCM (8, C) in the above equations.

6 is a flowchart showing a step of transmitting and receiving data by calculating a TBS by a Node B and a UE in downlink or uplink data scheduling and transmission. When the scheduling and data transmission processes are started, the BS determines scheduling information (602) and delivers the scheduling information to the MS in a combination of at least one of DCI, system information, MAC CE, and RRC signaling (604) . The terminal and the base station calculate TBS from the determined scheduling information (606). In step 606, TBS may be calculated using steps 2-1 and 2-2 described above. Steps 2-1 and 2-2 may be concurrently performed or may be performed in a reversed order. The CB partitioning and channel coding, decoding, and retransmission operations are then performed 608 using the calculated TBS to complete data scheduling and transmission.

The TBS determination method provided in the embodiment can be applied only to a case where a specific combination of the MCS index and the allocated PRB number is not applied to the base station and the UE. For example, the scheduling is determined by the MCS index 6, and if the PRB number is 1 at this time, the TBS may be determined to be a fixed value of 328 instead of the above method, and data may be transmitted. Therefore, the BS and the UE may know the TBS values to be used according to the combination of {the MCS index, the code rate index, and the PRB number} in advance, and the TBS is determined by the method provided in the above embodiment .

The TBS determination method of the present embodiment is applicable only to the initial transmission, and in case of retransmission, transmission / reception can be performed assuming the TBS determined in the initial transmission of the retransmission.

The steps 2-1 and 2-2 can be considered as the following steps 2-A, 2-B, 2-C and 2-D.

Step 2-A: Determine the number of resources capable of rate matching the data resource (Step 2-A. Count the number of available REs for rate matching of PDSCH / PUSCH (N _RE )

Step 2-B: Calculate the temporary TBS including the TB-CRC by multiplying the calculated N _RE by the coding rate, the number of layers, and the modulation order (Step 2-B: Calculate TBS plus TB-CRC by multiplying coding rate, modulation order, and number of layers to N _RE )

Step 2-C: Create the temporary TBS containing the calculated TB-CRC as a common multiple of 8 and CB or a multiple of 8 times CB (Step 2-C: Make TBS plus TB-CRC as a common multiple of 8 and the number of CBs)

Step 2-D: Calculate the final TBS considering a particular packet size or specific services. If the particular packet size and the specific service are not the final TBS calculation (Step 2-D: Determine the final TBS, considering specific packet size and services (if applied)) excluding the TB-CRC length to the value obtained in step 2-C,

[Third Embodiment]

The third embodiment provides a TBS determination method according to CB-CRC and BG selection. This embodiment can be applied to a case where BG # 2 is not applied when TBS is large in a specific case. That is, the present embodiment can be applied in a situation where the code block is channel-coded with the LDPC code using BG # 2, but only when the TB is not divided into several code blocks. In the present embodiment, R_1 and R_2 may indicate a code rate that is a criterion for selecting BG # 1 or BG # 2 of the LDPC, and may be mixed with R ₁ and R ₂ , respectively. For example, R ₁ = 1/4 R ₂ = 2/3, but the method provided by the present invention is not limited thereto. Also, in the present invention, R, referred to as code rate, and R ₁ and R ₂ can be expressed and expressed in various ways such as a fraction and a prime. When selecting a BG among BG # 1 and BG # 2 during data transmission, a code rate, a soft buffer of the terminal, and the like can be considered.

The BS may transmit data by allocating a frequency resource of an arbitrary number of PRBs and a time resource of an arbitrary number of slots or symbols to the UE, and the scheduling information related to the scheduling information may be transmitted through the downlink control information (DCI) Setting or a combination thereof. When the BS and the UE are given scheduling information, the TBS can be determined in the following order.

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

- Step 3-2: The process of making the decision of the temporary CB number (C) and the byte alignment (the process of making a multiple of 8) and the multiple of the temporary CB number (B)

- Step 3-3: TBS decision process except CRC bit number

Step 3-1 may be the same as step 1-1 of the first embodiment. In step 3-1, the temporary TBS value is determined in consideration of the amount of the resource area to which the data to be transmitted can be mapped. This code rate (R), a modulation order (Q _m), the data rate can be matched RE mapped (N _RE), assigned PRB or RB number (#PRB), the number of OFDM symbols allocated, the number of assigned slots, It is possible to determine the number of temporary information bits by a combination of at least one of the RE number of reference values mapped in one PRB.

A, for example,

Lt; / RTI &gt; The modulation order Q _m and the code rate R may be included in the DCI and transmitted to the UE. The number of layers v used when transmitted can be delivered to the terminal via DCI or higher signaling, or a combination of both. N _RE can be determined using the number of REs to which data is mapped using rate matching when data is transmitted by the BS, and when the BS and the MS know the resource allocation information, the N _RE is equal to the BS Can understand. Calculating the N _RE, but as the data is mapped to a rate matching scheme, it is special reasons punctured data is pop, etc. CSI-RS or URLLC or UCI transmission is actually included in the N RE _RE that are not mapped. This may be done so that the base station and the terminal can understand the TBS equally even when the base station does not notify the terminal but does not transmit a part of the data that it intends to arbitrarily map in a puncturing manner.

An MCS table as shown in Table 8 is defined, and the BS can transmit information on Q _m and R by transmitting an MCS index to the UE. The modulation order refers to information such as QPSK, 16QAM, 64QAM, 256QAM, and 1024QAM. In Table 8, Q _m and R are transmitted together with a 5-bit MCS index. However, it can be transmitted in the DCI with a 6-bit MCS index, or Q _m of 3 bits and R of 3 bits are transmitted in the bit field And the like. Or A = (number of assigned PRBs) x (number of reference REs per PRB) x Q _m x R xv.

In step 3-2, the number of temporary code blocks C (the number of provisional CBs) C is determined using the determined A, and A is a multiple of 8 and a multiple of the temporary CBs. This is to ensure that the length of the CRC added to the finally determined TBS and TB is a multiple of CB while being byte aligned.

First, the temporary CB number is

. &Lt; / RTI &gt; In the above, N _{1, max} may be 8448. C obtained above is the number of temporary CBs. CB splitting is performed when the TB is finally transmitted, and the number of temporary CBs may be different from the actual number of CBs obtained at this time, but the number of actual CBs can be set to be equal to the number of temporary CBs.

Now, A is set to a multiple of 8 and C in step 3-1 to generate B, which may be to prevent unnecessary bits or unnecessary zero padding bits from being transmitted to all code blocks. In Equation (11)

B can be calculated as follows. In Equation (11)

or

or

It is possible to apply it to the above. In the present invention, mod (x, y) is a remainder obtained by dividing x by y,

As shown in FIG. In the present invention

Means a minimum integer greater than x, and can be mixed with ceil (x).

Means the largest integer less than x, and can be mixed with floor (x).

The above Equation (11) , Which may mean that B is a multiple of 8C closest to A. Round (x) means the integer nearest to x, or it can mean rounding. Equation (11) is for making A a multiple of 8C, but can be modified and applied to make a common multiple or a common multiple of 8 and C. Therefore, Equation (11)

or

or

It may be possible to apply it by being modified. In the above, LCM (a, b) means the least common multiple of a and b.

In step 3-2, information bits transmitted from the allocated resources are obtained. In step 3-3, the number of bits added for the CRC is excluded from the information bits to be transmitted. This can be determined by the following pseudo-code 10 or pseudo-code 11:

[pseudo-code 10]

[start]

If B ≤ N _{2, max} , then TBS = B - L _{TB, 16}

Else if B ≤ N _{1, max} , then TBS = B - L _{TB, 24}

Else TBS = B - L _{TB, 24} - C × L _CB

End if of B

[End]

[pseudo-code 11]

[start]

If B ≤ 3840, then TBS = B - 16

Else if B ≤ 8448, then TBS = B - 24

Else TBS = B - 24 x (C + 1)

End if of B

[End]

L _{TB, 16} and L _{TB, 24} are considered because the CRC length to be applied to TB may vary depending on the size of TBS. In case of 1 code block, the CRC added to CB may be omitted or added to CB It is considered that the CRC length may become zero.

As another example, it is possible that step 3-3 is transformed into [pseudo-code 5] or [pseudo-code 6] as described above. The [pseudo-code 5] or [pseudo-code 6] does not exclude the CRC length added to the CB in calculating the final TBS. Therefore, when the actual data is mapped and transmitted later, the CRC length of the CB may be added to the calculated TBS, so that the actual code rate may be larger than R. [

6 is a flowchart illustrating a step of transmitting and receiving data by calculating a TBS by a Node B and a UE during downlink or uplink data scheduling and transmission. When the scheduling and data transmission process starts, the BS determines scheduling information (602), and transmits the scheduling information to the MS in a combination of at least one of DCI, system information, MAC CE, and RRC signaling (604). The terminal and the base station calculate TBS from the determined scheduling information (606). In step 606, TBS may be calculated using steps 3-1, 3-2, and 3-3 described above. Steps 3-1, 3-2, and 3-3 may be concurrently performed or performed in reverse order. The CB partitioning and channel coding, decoding, and retransmission operations are then performed 608 using the calculated TBS to complete data scheduling and transmission.

The TBS determination method provided in the embodiment can be applied only to a case where a specific combination of the MCS index and the allocated PRB number is not applied to the base station and the UE. For example, the scheduling is determined by the MCS index 6, and if the PRB number is 1 at this time, the TBS may be determined to be a fixed value of 328 instead of the above method, and data may be transmitted. Therefore, the BS and the UE may know the TBS values to be used according to the combination of {the MCS index, the code rate index, and the PRB number} in advance, and the TBS is determined by the method provided in the above embodiment .

The TBS determination method of the present embodiment is applicable only to the initial transmission, and in case of retransmission, transmission / reception can be performed assuming the TBS determined in the initial transmission of the retransmission.

[Fourth Embodiment]

The fourth embodiment provides a TBS determination method according to CB-CRC and BG selection. This embodiment can be applied to a case where BG # 2 is not applied when TBS is large in a specific case. That is, the present embodiment can be applied in a situation where the code block is channel-coded by the LDPC code using BG # 2, but only when the TB is not divided into a plurality of code blocks. In the present embodiment, R_1 and R_2 may indicate a code rate that is a criterion for selecting BG # 1 or BG # 2 of the LDPC, and may be mixed with R ₁ and R ₂ , respectively. For example, R ₁ = 1/4 R ₂ = 2/3, but the method provided by the present invention is not limited thereto. Also, in the present invention, R, referred to as code rate, and R ₁ and R ₂ can be expressed and expressed in various ways such as a fraction and a prime. When selecting a BG among BG # 1 and BG # 2 during data transmission, a code rate, a soft buffer of the terminal, and the like can be considered. In this embodiment, a process for adjusting TBS to a multiple of 8 or a multiple of CB or a common or minimum common multiple of 8 and CB is performed at the end of TBS calculation.

The BS may transmit data by allocating a frequency resource of an arbitrary number of PRBs and a time resource of an arbitrary number of slots or symbols to the UE, and the scheduling information related to the scheduling information may be transmitted through the downlink control information (DCI) Setting or a combination thereof. When the BS and the UE are given scheduling information, the TBS can be determined in the following order.

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

- Step 4-2: The process of making the number of temporary CB counts and TBS plus the length of TB-CRC in multiples of byte alignment and temporary CB count

Step 4-1 may be the same as step 2-1 of the second embodiment. In step 4-1, the temporary TBS value is determined in consideration of the amount of the resource area to which the data to be transmitted can be mapped. This code rate (R), a modulation order (Qm), the data rate can be matched RE mapped (N _RE), assigned PRB or RB number (#PRB), the number of OFDM symbols allocated, the number of assigned slots, the It is possible to determine the number of temporary information bits by a combination of at least one of the RE number of reference values mapped in the PRB. For example, A may be determined by Equation (10). The modulation order Q _m and the code rate R may be included in the DCI and transmitted to the UE. The number of layers v used when transmitted can be delivered to the terminal via DCI or higher signaling, or a combination of both. N _RE can be determined using the number of REs to which data is mapped using rate matching when data is transmitted by the BS, and when the BS and the MS know the resource allocation information, the N _RE is equal to the BS Can understand. Calculating the N _RE, but as the data is mapped to a rate matching scheme, it is special reasons punctured data is pop, etc. CSI-RS or URLLC or UCI transmission is actually included in the N RE _RE that are not mapped. This may be done so that the base station and the terminal can understand the TBS equally even when the base station does not notify the terminal but does not transmit a part of the data that it intends to arbitrarily map in a puncturing manner.

An MCS table as shown in Table 8 is defined, and the BS can transmit information on Q _m and R by transmitting an MCS index to the UE. The modulation order refers to information such as QPSK, 16QAM, 64QAM, 256QAM, and 1024QAM. In the above Table 8, but passed with the Qm and R to MCS index of 5 bits, which may be passed from the DCI to the 6-bit MCS index, a or Q _m with a 3-bit R of the third bit and so on are respectively transferred from the bit field It can be delivered to the terminal in various ways. Or A = (number of assigned PRBs) x (number of reference REs per PRB) x Q _m x R xv.

Step 4-2 can be performed as follows [pseudo-code 12] or [pseudo-code 13].

[pseudo-code 12]

[start]

If A ≤ N _{1, max} - L _{TB, 24} ,

C = 1 and TBS =

.

Else

TBS =

End if of A

[End]

In the above, TBS =

TBS =

As shown in FIG.

[pseudo-code 13]

[start]

If A? 8424,

C = 1 and TBS =

.

Else

TBS =

End if of A

[End]

Or [pseudo-code 12] can be modified and applied as follows [pseudo-code 14].

[pseudo-code 14]

[start]

TBS =

[End]

In the above,

As described in the first embodiment,

Or A + (8-mod (A, 8)) or A-mod (A, 8) or

It may be possible to apply it by being deformed. In addition,

May be transformed and applied to A + (Cx8-mod (A + 24, Cx8)) or A-mod (A + 24, Cx8). For example, it may be possible to apply a modification such as the following [pseudo-code 14].

[pseudo-code 14]

[start]

If A? 8424,

C = 1 and TBS =

.

Else

(A + 24, C x 8) or A-mod (A + 24, C x 8)

End if of A

[End]

The step 4-2 may be a process of determining the number of temporary code blocks (temporary CB number) C using the determined A, and making the length of the CRC of TBS + TB a multiple of 8 and C based on the number of temporary code blocks. The use of C x 8 in the above equations is intended to make A a multiple of 8 C, but it can be modified and applied to make a common multiple or a common multiple of 8 and C. Therefore, in the above equations, C x 8 may be transformed into LCM (8, C) and applied. In the above, LCM (a, b) means the least common multiple of a and b.

In the present invention, mod (x, y) is a remainder obtained by dividing x by y,

As shown in FIG. In the present invention

Means a minimum integer greater than x, and can be mixed with ceil (x).

Means the largest integer less than x, and can be mixed with floor (x). Round (x) means the integer nearest to x, or it can mean rounding.

6 is a flowchart illustrating a step of transmitting and receiving data by calculating a TBS by a Node B and a UE during downlink or uplink data scheduling and transmission. When the scheduling and data transmission process starts, the BS determines scheduling information (602), and transmits the scheduling information to the MS in a combination of at least one of DCI, system information, MAC CE, and RRC signaling (604). The terminal and the base station calculate TBS from the determined scheduling information (606). In step 606, TBS may be calculated using steps 4-1 and 4-2 described above. Steps 4-1 and 4-2 may be concurrently performed or may be performed in a reversed order. The CB partitioning and channel coding, decoding, and retransmission operations are performed 608 using the calculated TBS, and data scheduling and transmission are completed.

The TBS determination method provided in the embodiment can be applied only to a case where a specific combination of the MCS index and the allocated PRB number is not applied to the base station and the UE. For example, scheduling is determined by MCS index 6, and if the PRB number is 1 at this time, TBS may be determined to be a fixed value of 328 instead of the above method, and may be transmitted. Therefore, the BS and the UE may know the TBS values to be used according to the combination of {the MCS index, the code rate index, and the PRB number} in advance, and the TBS is determined by the method provided in the above embodiment .

The TBS determination method of the present embodiment is applicable only to the initial transmission, and in case of retransmission, transmission / reception can be performed assuming the TBS determined in the initial transmission of the retransmission.

In the first embodiment, the second embodiment, the third embodiment or the fourth embodiment, the code rate R is compared with a specific value to determine the TBS, instead of directly comparing the code rate, an MCS index such as I _MCS , Or a method of comparing a parameter related to an MCS or a code rate with a specific reference value.

Also, in the first embodiment, the second embodiment, the third embodiment, or the fourth embodiment, data is mapped using rate matching when calculating N _RE , but it is possible to apply N _RE to be calculated in various ways There will be. For example, the number of allocated symbols, the number of assigned PRBs, the sync signal block resource, the reference signal resource, the reserved resource, the subcarrier spacing, the number of allocated slots, the code rate, N _RE can be calculated and applied in a manner determined by considering one or more of the reference RE number (e.g., the number of REs available within one PRB of one slot or one symbol)

[Fifth Embodiment]

In the fifth embodiment, when a specific TBS is calculated and derived in applying the first embodiment, the second embodiment, the third embodiment, or the fourth embodiment, the base station and the terminal transform the calculated TBS to apply the final TBS . &Lt; / RTI &gt;

For example, a particular range of TBSs can be promised by the base station and the terminal not to be transmitted, and the TBS to be applied when a specific range of TBSs are calculated can be predetermined. For example, in the above procedure, the temporary CB number is calculated as 2 according to R <1/4 and A = 3872, and when B = 3872, the finally calculated TBS becomes 3800. If the finally calculated TBS is 3800, the UE can apply the TBS to 3840.

As another example, a method of applying the final TBS by comparing the calculated TBS with a minimum value or a maximum value known as the above-mentioned predetermined or higher signaling may be used when the minimum value or the maximum value of the TBS can be known to the base station and the terminal have. The minimum value of the TBS is TBS _min and the maximum value of TBS is TBS _max .

[Sixth Embodiment]

The sixth embodiment provides a method of storing information on data received by a terminal in a soft buffer.

The base station can know in advance how much data the terminal will store when storing the information of the data received by the terminal in the soft buffer during the downlink data transmission and can thus inform the terminal of the starting point of the information to be stored . By informing the terminal of the range of information to be stored as described above, it is possible to transmit the parity part having the highest success probability at the time of retransmission.

The base station may instruct the terminal in one or more of the following ways: L1 signaling such as RRC signaling, MAC CE, DCI, or SIB.

[Seventh Embodiment]

In the seventh embodiment, in applying the first embodiment, the second embodiment, the third embodiment, or the fourth embodiment, it is possible to calculate N _RE, which is the number of resource areas to which the data to be considered in the calculation of the temporary TBS can be mapped . &Lt; / RTI &gt;

The downlink data is transmitted using PDSCH, which is a physical channel for downlink data transmission, and N _RE can be calculated considering at least one of the following parameters.

- the number of PRBs allocated for data transmission and the number of symbols to be transmitted

- a control resource set (CORESET) in which a higher signaled downlink control channel can be transmitted,

- Scheduled DCI mapped area

- a resource area in which a reference signal (RS) used for data transmission is transmitted

- a resource area corresponding to a reserved resource

- resource area where RS for channel measurement is transmitted

- an area in which a synchronization signal block (SS block) including synchronization signals is transmitted

- When the scheduling control information (DCI) is transmitted and when the actual PDSCH is transmitted,

- Minimum processing time for uplink and downlink data transmission and reception

The uplink data is transmitted using the physical channel PUSCH for uplink data transmission, and N _RE can be calculated considering one or more of the following parameters.

- the number of PRBs allocated for data transmission and the number of symbols to be transmitted

- a region where the higher signaled downlink control channel can be transmitted

- a resource area where the reference signal used for data transmission is transmitted

- the resource area corresponding to the reserved resource

- resource area where a sounding reference signal (SRS) for channel measurement is transmitted

- the area where the sync signal block containing the sync signal is transmitted

- When the scheduling control information (uplink grant DCI) is transmitted and when the actual PUSCH is transmitted,

- Whether to include and transmit HARQ-ACK information of another PDSCH, the time when the PDSCH is transmitted and the amount of HARQ-ACK information to be transmitted

- Measurement and reporting point and CSI information amount for reporting channel state information (CSI)

- Minimum processing time for uplink and downlink data transmission and reception

The N _RE calculating for PUSCH transmission as an example the case where the HARQ-ACK of the PDSCH received before the time when the DCI includes a grant (uplink grant) for uplink scheduling for scheduling the PUSCH transmission is more than a specified number of bits The resource area required for transmitting the HARQ-ACK information may be excluded. Whereas the corresponding PUSCH the HARQ-ACK information sent in PDSCH receiving at the point of time or after, such as when the DCI is transmitted including a UL grant to the scheduling is not taken into account in the calculation of the N _RE for TBS calculation of the PUSCH Or not included. The reference time point of the PDSCH considering the HARQ-ACK is described as the reception time of the uplink grant in the above description, but may not be limited thereto. For example, when the minimum processing for uplink data transmission, downlink data reception, and HARQ- Can be determined according to time. This may be to ensure sufficient processing time for processing the TBS of the PUSCH.

In order to perform the above-described embodiments of the present invention, the transmitter, the receiver, and the processor of the terminal and the base station are shown in FIGS. 7 and 8, respectively. In order to accomplish the first to seventh embodiments, a base station and a mobile station transmit / receive method are shown. To do this, a base station and a receiver, a processor, and a transmitter of the mobile station must operate according to the embodiments, respectively.

7 is a block diagram illustrating an internal structure of a UE according to an embodiment of the present invention. 7, the terminal of the present invention may include a terminal receiving unit 700, a terminal transmitting unit 704, and a terminal processing unit 702. The terminal receiving unit 700 and the terminal may be collectively referred to as a transmitting unit 704 in the embodiment of the present invention. The transmitting and receiving unit can transmit and receive signals to and from the base station. The signal may include control information and data. To this end, the transmitting and receiving unit may include an RF transmitter for up-converting and amplifying the frequency of a transmitted signal, an RF receiver for low-noise amplifying the received signal and down-converting the frequency. The transceiving unit may receive a signal through a wireless channel, output the signal to the terminal processing unit 702, and transmit the signal output from the terminal processing unit 702 through a wireless channel. The terminal processing unit 702 can control a series of processes so that the terminal can operate according to the embodiment of the present invention described above.

8 is a block diagram illustrating an internal structure of a base station according to an embodiment of the present invention. 8, the base station of the present invention may include a base station receiving unit 801, a base station transmitting unit 805, and a base station processing unit 803. [ The base station receiving unit 801 and the base station transmitting unit 805 may be collectively referred to as a transmitting and receiving unit in the embodiment of the present invention. The transmitting and receiving unit can transmit and receive signals to and from the terminal. The signal may include control information and data. To this end, the transmitting and receiving unit may include an RF transmitter for up-converting and amplifying the frequency of a transmitted signal, an RF receiver for low-noise amplifying the received signal and down-converting the frequency. The transceiving unit may receive a signal through a wireless channel, output the signal to the base station processing unit 803, and transmit the signal output from the terminal processing unit 803 through a wireless channel. The base station processor 803 can control a series of processes so that the base station can operate according to the above-described embodiment of the present invention.

It should be noted that the embodiments of the present invention disclosed in the present specification and drawings are only illustrative of the present invention in order to facilitate the understanding of the present invention and are not intended to limit the scope of the present invention. That is, it will be apparent to those skilled in the art that other modifications based on the technical idea of the present invention are possible. Also, one or more of the above embodiments may be combined with each other as needed. For example, the first embodiment and the third embodiment of the present invention may be combined with each other so that the base station and the terminal can be operated.

Claims (15)

1. A method for identifying a transport block size (TBS) of a terminal of a wireless communication system,

   Receiving control information for scheduling from a base station;

   Checking the number of temporary information bits based on the control information for the scheduling;

   Checking the TBS based on the control information for the scheduling and the number of temporary information bits; And

   And decoding the received downlink data based on the identified TBS,

   Wherein the TBS is a multiple of 8 and a number of temporary code blocks (CB) based on the control information for the scheduling.
2. 2. The method of claim 1, wherein when the code rate determined based on the scheduling information is equal to or less than 0.25, if the number of temporary information bits is N,

   

   Based on the TBS information.
3. 2. The method of claim 1, wherein if the code rate checked based on the scheduling information is greater than 0.25 and the number of temporary information bits is greater than 8424, if the number of temporary information bits is N,

   

   Based on the TBS information.
4. The method of claim 1, wherein if the number of temporary information bits is less than or equal to 8424, the number of temporary CBs is one.
5. A method for checking a transport block size (TBS) of a base station of a wireless communication system,

   Checking control information for scheduling;

   Transmitting control information for scheduling to a terminal;

   Checking the number of temporary information bits based on the control information for the scheduling;

   Checking the TBS based on the control information for the scheduling and the number of temporary information bits; And

   And transmitting downlink data based on the identified TBS,

   Wherein the TBS is a multiple of 8 and a number of temporary code blocks (CB) based on the control information for the scheduling.
6. 6. The method of claim 5, wherein if the code rate determined based on the scheduling information is less than or equal to 0.25, if the number of temporary information bits is N,

   

   Based on the TBS information.
7. 6. The method of claim 5, wherein when the code rate is greater than 0.25 and the number of temporary information bits is greater than 8424 based on the scheduling information, if the number of temporary information bits is N,

   

   Based on the TBS information.
8. 6. The method of claim 5, wherein if the number of temporary information bits is less than or equal to 8424, the number of temporary CBs is one.
9. A terminal for confirming a transport block size (TBS) of a wireless communication system,

   A transmission / reception unit; And

   Receives control information for scheduling from a base station, checks the number of temporary information bits based on the control information for scheduling, checks the TBS based on the control information for scheduling and the number of temporary information bits And a controller coupled to the transceiver for controlling decoding of received downlink data based on the identified TBS,

   Wherein the TBS is a multiple of 8 and a number of temporary code blocks (CB) based on the control information for the scheduling.
10. The method of claim 9, wherein when the code rate determined based on the scheduling information is equal to or less than 0.25, if the number of temporary information bits is N,

    

    Based on the identification information.
11. The method as claimed in claim 9, wherein when the code rate determined based on the scheduling information is greater than 0.25 and the number of temporary information bits is greater than 8424, if the number of temporary information bits is N,

    

    Based on the identification information.
12. 10. The terminal of claim 9, wherein when the number of temporary information bits is less than or equal to 8424, the number of temporary temporary CBs is 1. [
13. A base station for confirming a transport block size (TBS) of a wireless communication system,

    A transmission / reception unit; And

    The control information for scheduling is transmitted to the mobile station, the control information for scheduling is transmitted, the number of temporary information bits is checked based on the control information for scheduling, and the control information for scheduling and the temporary information bits And a controller connected to the transmitting and receiving unit for controlling the TBS to transmit downlink data based on the checked TBS,

    Wherein the TBS is a multiple of 8 and a number of temporary code blocks (CB) based on the control information for scheduling.
14. 14. The method of claim 13, wherein when the code rate determined based on the scheduling information is equal to or less than 0.25, if the number of temporary information bits is N,

    

    Is identified based on the base station.
15. 14. The method of claim 13, wherein if the code rate determined based on the scheduling information is greater than 0.25 and the number of temporary information bits is greater than 8424, if the number of temporary information bits is N,

    

    , &Lt; / RTI &gt;

    Wherein if the number of temporary information bits is less than or equal to 8424, then the number of temporary CBs is one.

Images