KR102517960B1 - Method and apparatus for data transmission in wirelss cellular communication system - Google Patents

Abstract

The present disclosure relates to a communication technique and a system for converging a 5G communication system with IoT technology to support a higher data rate after a 4G system. This disclosure provides intelligent services based on 5G communication technology and IoT-related technologies (e.g., smart home, smart building, smart city, smart car or connected car, health care, digital education, retail, security and safety related services, etc.) ) can be applied.

Description

Data transmission method and apparatus in wireless cellular communication system

The present invention relates to a method and apparatus for performing data transmission in a wireless cellular communication system. More specifically, a method and apparatus for performing rate matching in data transmission and configuring a soft buffer of a terminal are provided.

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

In order to achieve a high data rate, the 5G communication system is being considered for implementation in a mmWave band (eg, a 60 gigabyte (60 GHz) band). In order to mitigate the path loss of radio waves and increase the propagation distance of radio waves in the ultra-high frequency band, beamforming, massive MIMO, and Full Dimensional MIMO (FD-MIMO) are used in 5G communication systems. ), array antenna, analog beam-forming, and large scale antenna technologies are being discussed.

In addition, to improve the network of the system, in the 5G communication system, an evolved small cell, an advanced small cell, a cloud radio access network (cloud RAN), and an ultra-dense network , Device to Device communication (D2D), wireless backhaul, moving network, cooperative communication, Coordinated Multi-Points (CoMP), and interference cancellation etc. are being developed.

In addition, in the 5G system, advanced coding modulation (Advanced Coding Modulation: ACM) methods FQAM (Hybrid FSK and QAM Modulation) and SWSC (Sliding Window Superposition Coding), advanced access technologies FBMC (Filter Bank Multi Carrier), NOMA (non orthogonal multiple access), SCMA (sparse code multiple access), etc. are being developed.

On the other hand, the Internet is evolving from a human-centered connection network in which humans create and consume information to an Internet of Things (IoT) network in which information is exchanged and processed between distributed components such as things. IoE (Internet of Everything) technology, which combines IoT technology with big data processing technology through connection with a cloud server, etc., is also emerging. In order to implement IoT, technical elements such as sensing technology, wired/wireless communication and network infrastructure, service interface technology, and security technology are required, and recently, sensor networks for connection between objects and machine to machine , M2M), and MTC (Machine Type Communication) technologies are being studied. In the IoT environment, intelligent IT (Internet Technology) services that create new values in human life by collecting and analyzing data generated from connected objects can be provided. IoT is a field of smart home, smart building, smart city, smart car or connected car, smart grid, health care, smart home appliances, advanced medical service, etc. can be applied to

Accordingly, various attempts are being made to apply the 5G communication system to the IoT network. For example, technologies such as sensor network, machine to machine (M2M), and machine type communication (MTC) are implemented by techniques such as beamforming, MIMO, and array antenna, and 5G communication technologies There is. The application of the cloud radio access network (cloud RAN) as the big data processing technology described above can be said to be an example of convergence of 5G technology and IoT technology.

In wireless cellular and communication and broadcasting systems, link performance can be significantly degraded by various noises of channels, fading phenomena, and inter-symbol interference (ISI). Therefore, it is required to develop a technology for overcoming noise, fading, and inter-symbol interference in order to implement high-speed digital communication/broadcasting systems that require high data throughput and reliability, such as next-generation mobile communication, digital broadcasting, and portable Internet. As part of research to overcome noise, etc., research on error correcting codes has been actively conducted recently as a method for increasing communication reliability by efficiently restoring distortion of information.

The present invention provides a method and apparatus for performing rate matching in downlink and uplink data transmission, and determining and managing a size of a soft buffer of a terminal.

The present invention for solving the above problems is a control signal processing method in a wireless communication system, comprising: receiving a first control signal transmitted from a base station; processing the received first control signal; and transmitting a second control signal generated based on the processing to the base station.

The present invention provides a rate matching method and apparatus considering the soft buffer and decoding performance of a terminal in data transmission.

1 is a diagram showing a downlink time-frequency domain transmission structure of an LTE or LTE-A system;
2 is a diagram showing an uplink time-frequency domain transmission structure of an LTE or LTE-A system.
3 is a diagram showing the basic structure of a parent matrix (or base graph) of an LDPC code.
4 is a block diagram illustrating a receiving process of a terminal.
5 is a diagram illustrating a method of segmenting a transport block (TB) into code blocks.
6 is a diagram illustrating a rate matching method after channel coding and constraints of rate matching.
7 is a flowchart illustrating operations of a base station and a terminal according to a first embodiment of the present invention.
8 is a diagram illustrating a short TTI structure in a downlink subframe using a short TTI of 2 symbols or 3 symbols in an LTE system.
9 is a diagram illustrating another short TTI structure in a downlink subframe using a short TTI of 2 symbols or 3 symbols in an LTE system.
10 is a diagram illustrating a short TTI structure in an uplink subframe using a short TTI of 2 symbols or 3 symbols in an LTE system.
11 is a diagram illustrating a short TTI structure in a downlink or uplink subframe using a short TTI of 7 symbols in an LTE system.
12 is a flowchart illustrating operations of a base station and a terminal according to a third embodiment of the present invention.
13 is a flowchart illustrating another operation of a base station and a terminal according to a third embodiment of the present invention.
14 is a block diagram illustrating a structure of a terminal according to embodiments.
15 is a block diagram illustrating the structure of a base station according to embodiments.
16 is a block diagram showing a DCI structure according to a fourth embodiment of the present invention.
17 is a block diagram illustrating the operation of a terminal according to a fourth embodiment of the present invention.
18 is a block diagram showing the operation of a base station according to a fourth embodiment of the present invention.
19 is a block diagram illustrating a downlink data receiving operation of a terminal according to a fifth embodiment of the present invention.
20 is a block diagram illustrating an uplink data transmission operation of a terminal according to a fifth embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

In describing the embodiments, descriptions of technical contents that are well known in the technical field to which the present invention pertains and are not directly related to the present invention will be omitted. This is to more clearly convey the gist of the present invention without obscuring it by omitting unnecessary description.

For the same reason, in the accompanying drawings, some components are exaggerated, omitted, or schematically illustrated. Also, the size of each component does not entirely reflect the actual size. In each figure, the same reference number is assigned to the same or corresponding component.

Advantages and features of the present invention, and methods for achieving them, will become clear with reference to the embodiments described below in detail in conjunction with the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below, but may be implemented in various different forms, and only the present embodiments make the disclosure of the present invention complete, and common knowledge in the art to which the present invention belongs It is provided to fully inform the holder of the scope of the invention, and the present invention is only defined by the scope of the claims. Like reference numbers designate like elements throughout the specification.

At this time, it will be understood that each block of the process flow chart diagrams and combinations of the flow chart diagrams can be performed by computer program instructions. These computer program instructions may be embodied in a processor of a general purpose computer, special purpose computer, or other programmable data processing equipment, so that the instructions executed by the processor of the computer or other programmable data processing equipment are described in the flowchart block(s). It creates means to perform functions. These computer program instructions may also be stored in a computer usable or computer readable memory that can be directed to a computer or other programmable data processing equipment to implement functionality in a particular way, such that the computer usable or computer readable memory The instructions stored in are also capable of producing an article of manufacture containing instruction means that perform the functions described in the flowchart block(s). The computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operational steps are performed on the computer or other programmable data processing equipment to create a computer-executed process to generate computer or other programmable data processing equipment. Instructions for performing processing equipment may also provide steps for performing the functions described in the flowchart block(s).

Additionally, each block may represent a module, segment, or portion of code that includes one or more executable instructions for executing specified logical function(s). It should also be noted that in some alternative implementations it is possible for the functions mentioned in the blocks to occur out of order. For example, two blocks shown in succession may in fact be executed substantially concurrently, or the blocks may sometimes be executed in reverse order depending on their function.

At this time, the term '~unit' used in this embodiment means software or a hardware component such as FPGA or ASIC, and '~unit' performs certain roles. However, '~ part' is not limited to software or hardware. '~bu' may be configured to be in an addressable storage medium and may be configured to reproduce one or more processors. Therefore, as an example, '~unit' refers to components such as software components, object-oriented software components, class components, and task components, processes, functions, properties, and procedures. , subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables. Functions provided within components and '~units' may be combined into smaller numbers of components and '~units' or further separated into additional components and '~units'. In addition, components and '~units' may be implemented to play one or more CPUs in a device or a secure multimedia card. Also, in an embodiment, '~ unit' may include one or more processors.

The wireless communication system has moved away from providing voice-oriented services in the early days and, for example, 3GPP's HSPA (High Speed Packet Access), LTE (Long Term Evolution or E-UTRA (Evolved Universal Terrestrial Radio Access)), LTE-Advanced (LTE-A), 3GPP2's HRPD (High Rate Packet Data), UMB (Ultra Mobile Broadband), and IEEE's 802.16e communication standards, such as the broadband wireless communication system that provides high-speed, high-quality packet data services. are doing In addition, as a 5G wireless communication system, a communication standard of 5G or NR (new radio) is being created.

Hereinafter, embodiments of the present invention will be described in detail with accompanying drawings. In addition, in describing the present invention, if it is determined that a detailed description of a related function or configuration may unnecessarily obscure the subject matter of the present invention, the detailed description will be omitted. In addition, terms to be described later are terms defined in consideration of functions in the present invention, which may vary according to the intention or custom of a user or operator. Therefore, the definition should be made based on the contents throughout this specification. Hereinafter, a base station is a subject that performs resource allocation of a terminal, and 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. The 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, downlink (DL) is a radio transmission path of a signal transmitted from a base station to a terminal, and uplink (UL) refers to a radio transmission path of a signal transmitted from a terminal to a base station. In addition, although an embodiment of the present invention is described below using an LTE or LTE-A system as an example, the embodiment of the present invention can be applied to other communication systems having a similar technical background or channel type. For example, the 5th generation mobile communication technology (5G, new radio, NR) developed after LTE-A may be included in this. In addition, the embodiments of the present invention can be applied to other communication systems through some modification within a range that does not greatly deviate from the scope of the present invention as determined by a person with skillful technical knowledge.

As a representative example of the broadband wireless communication system, in the LTE system, an Orthogonal Frequency Division Multiplexing (OFDM) method is employed in downlink (DL), and SC-FDMA (Single Carrier Frequency Division Multiplexing) in uplink (UL) Access) method is used. Uplink refers to a radio link in which a terminal (UE (User Equipment) or MS (Mobile Station)) transmits data or control signals to a base station (eNode B or base station (BS)), and downlink refers to a radio link in which a base station transmits a terminal to a terminal. A radio link that transmits data or control signals. The above multiple access scheme distinguishes data or control information of each user by allocating and operating time-frequency resources to carry data or control information for each user so that they do not overlap each other, that is, so that orthogonality is established. do.

The LTE system employs a HARQ (Hybrid Automatic Repeat request) method for retransmitting corresponding data in a physical layer when decoding failure occurs in initial transmission. In the HARQ scheme, when a receiver fails to accurately decode (decode) data, the receiver transmits Negative Acknowledgment (NACK) to the transmitter to inform the transmitter of the decoding failure so that the transmitter can retransmit the corresponding data in the physical layer. The receiver improves data reception performance by combining data retransmitted by the transmitter with previously failed data to be decoded. In addition, when the receiver correctly decodes the data, it may transmit information (ACK; Acknowledgment) notifying the transmitter of decoding success so that the transmitter can transmit new data.

1 is a diagram showing the basic structure of a time-frequency domain, which is a radio resource domain in which the data or control channel is transmitted in downlink in 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. N _symb (102) OFDM symbols are gathered to form one slot (106), and 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. Also, the radio frame 114 is a time domain section composed of 10 subframes. The minimum transmission unit in the frequency domain is a subcarrier, and the bandwidth of the entire system transmission bandwidth consists of a total of N _BW (104) subcarriers.

A basic unit of resources in the time-frequency domain is a resource element (RE), which can be represented by an OFDM symbol index and a subcarrier index. A resource block 108 (Resource Block; RB or Physical Resource Block; PRB) is defined by N _symb (102) contiguous OFDM symbols in the time domain and N _RB (110) contiguous subcarriers in the frequency domain. Accordingly, one RB 108 is composed of N _symb x N _RB REs 112 . In general, the minimum transmission unit of data is the RB unit. In an LTE system, N _symb = 7 and N _RB = 12, and N _BW and N _RB are proportional to the bandwidth of the system transmission band. The data rate increases in proportion to the number of RBs scheduled for the UE. The LTE system defines and operates six transmission bandwidths. In the case of an FDD system in which downlink and uplink are divided into frequencies and operated, a downlink transmission bandwidth and an 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 the correspondence between system transmission bandwidth and channel bandwidth defined in the LTE system. For example, in an LTE system having a 10 MHz channel bandwidth, the transmission bandwidth is composed of 50 RBs.

[Table 1]

In the case of downlink control information, it is transmitted within the first N OFDM symbols in the subframe. In general, N = {1, 2, 3}. Accordingly, the N value varies for 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 the control information is transmitted over, scheduling information for downlink data or uplink data, and a HARQ ACK/NACK signal.

In the LTE system, scheduling information for downlink data or uplink data is transmitted from a base station to a terminal through downlink control information (DCI). DCI defines various formats, whether it is scheduling information for uplink data (UL grant) or scheduling information for downlink data (DL grant), whether it is a compact DCI with a small size of control information, and using multiple antennas. Depending on whether spatial multiplexing is applied or whether DCI is used for power control, the DCI format determined is applied and operated. 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 method is type 0 or type 1. Type 0 allocates resources in RBG (resource block group) units by applying a bitmap method. In the LTE system, a basic unit of scheduling is an RB represented by time and frequency domain resources, and an RBG is composed of a plurality of RBs to become a basic unit of scheduling in the type 0 scheme. Type 1 allows a specific RB to be allocated within an RBG.

- Resource block assignment: RBs allocated for data transmission are notified. The resource to be expressed is determined according to the system bandwidth and 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 whether it is HARQ initial transmission or retransmission.

- Redundancy version: Notifies the redundancy version of HARQ.

- Transmit Power Control (TPC) command for Physical Uplink Control CHannel (PUCCH): Notifies a transmit power control command for PUCCH, which is an uplink control channel.

The DCI is a downlink physical control channel (PDCCH) (or control information, hereinafter used interchangeably) or an EPDCCH (Enhanced PDCCH) (or enhanced control information, hereinafter) that is a downlink physical control channel through channel coding and modulation processes. to be used interchangeably).

In general, the DCI is scrambled with a specific RNTI (Radio Network Temporary Identifier) (or terminal identifier) independently for each terminal, a cyclic redundancy check (CRC) is added, and after channel coding, each independent PDCCH is configured and transmitted. do. 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 an identifier (ID) of each terminal, and is spread over the entire system transmission band.

Downlink data is transmitted through a physical downlink shared channel (PDSCH) that is a physical channel for downlink data transmission. The PDSCH is transmitted after the control channel transmission period. Scheduling information such as a specific mapping position in the frequency domain and a modulation method is informed by the DCI transmitted through the PDCCH.

The base station notifies the terminal of the modulation method applied to the PDSCH to be transmitted and the size of the data to be transmitted (transport block size; TBS) through the MCS composed of 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 (transport block, TB) to be transmitted by the base station.

Modulation schemes supported by the LTE system are Quadrature Phase Shift Keying (QPSK), Quadrature Amplitude Modulation (16QAM), and 64QAM, and each modulation order corresponds to 2, 4, and 6. That is, 2 bits per symbol can be transmitted in case of QPSK modulation, 4 bits per symbol in case of 16QAM modulation, and 6 bits per symbol in case of 64QAM modulation.

2 is a diagram showing the basic structure of a time-frequency domain, which is a radio resource domain in which data or control channels are transmitted in uplink in an LTE-A system according to the prior art.

Referring to FIG. 2, 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 SC-FDMA symbol 202, and N _symb ^UL SC-FDMA symbols are gathered to form one slot 206. And two slots are gathered to form one subframe 205 . The minimum transmission unit in the frequency domain is a subcarrier, and the entire system transmission bandwidth 204 consists of a total of N _BW subcarriers. 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 pair (RB pair) 208 is defined by N _symb ^UL contiguous SC-FDMA symbols in the time domain and N _sc ^RB contiguous subcarriers in the frequency domain. Accordingly, one RB is composed of N _symb ^UL x N _sc ^RB number of REs. In general, the minimum transmission unit of data or control information is an RB unit. In the case of PUCCH, it is mapped to a frequency domain corresponding to 1 RB and transmitted during 1 subframe.

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

In the LTE system, downlink HARQ adopts an asynchronous HARQ method in which a data retransmission time point is not fixed. That is, when HARQ NACK is received from the terminal for the initial transmission data transmitted by the base station, the base station freely determines the transmission time of the retransmission data through a scheduling operation. For the HARQ operation, the terminal performs buffering on the data determined to be erroneous as a result of decoding the received data, and then combines with the next retransmitted data.

When the terminal receives the PDSCH including the downlink data transmitted from the base station in subframe n, the base station transmits uplink control information including HARQ ACK or NACK of the downlink data in subframe n+k through PUCCH or PUSCH. send to At this time, the k is defined differently according to the FDD or time division duplex (TDD) of the LTE system and its subframe configuration. For example, in the case of an FDD LTE system, k is fixed to 4. Meanwhile, in the case of a TDD LTE system, k may be changed according to subframe configuration and subframe number.

Unlike downlink HARQ in an LTE system, uplink HARQ adopts a synchronous HARQ method in which a data transmission time point is fixed. That is, PUSCH (Physical Uplink Shared Channel), which is a physical channel for uplink data transmission, PDCCH, which is a downlink control channel that precedes it, and PHICH (Physical Hybrid The uplink/downlink timing relationship of the indicator channel is fixed according to the following rules.

When the terminal receives a PDCCH including uplink scheduling control information transmitted from the base station in subframe n or a PHICH through which downlink HARQ ACK/NACK is transmitted, the terminal transmits uplink data corresponding to the control information in subframe n+k It transmits through PUSCH. At this time, the k is defined differently according to FDD or time division duplex (TDD) of the LTE system and its settings. For example, in the case of an FDD LTE system, k is fixed to 4. Meanwhile, in the case of a TDD LTE system, k may be changed according to subframe configuration and subframe number.

When the UE receives a PHICH carrying downlink HARQ ACK/NACK from the base station in subframe i, the PHICH corresponds to the PUSCH transmitted by the UE in subframe i-k. At this time, the k is defined differently depending on the FDD or TDD of the LTE system and its settings. For example, in the case of an FDD LTE system, k is fixed to 4. Meanwhile, in the case of a TDD LTE system, k may be changed according to subframe configuration and subframe number.

In addition, when data is transmitted through a plurality of carriers, a different value of k may be applied according to the TDD setting of each carrier.

[Table 2]

Table 2 above shows supportable DCI format types according to each transmission mode under the condition set by C-RNTI in 3GPP TS 36.213. The terminal assumes that the corresponding DCI format exists in the control region section according to the preset transmission mode and performs search and decoding. For example, when the UE is instructed to transmit mode 8, the UE searches for DCI format 1A in the common search space and the UE-specific search space, and only in the UE-specific search space. DCI format 2B is searched.

The description of the wireless communication system has been described based on the LTE system, and the content of the present invention is not limited to the LTE system and can be applied to various wireless communication systems such as NR and 5G. In addition, when applied to other wireless communication systems in an embodiment, the value k may be changed and applied to a system using a modulation scheme corresponding to FDD.

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

In order to achieve a high data rate, the 5G communication system is being considered for implementation in a mmWave band (eg, a 60 gigabyte (60 GHz) band). In order to mitigate the path loss of radio waves and increase the propagation distance of radio waves in the ultra-high frequency band, beamforming, massive MIMO, and Full Dimensional MIMO (FD-MIMO) are used in 5G communication systems. ), array antenna, analog beam-forming, and large scale antenna technologies are being discussed.

In addition, to improve the network of the system, in the 5G communication system, an evolved small cell, an advanced small cell, a cloud radio access network (cloud RAN), and an ultra-dense network , Device to Device communication (D2D), wireless backhaul, moving network, cooperative communication, Coordinated Multi-Points (CoMP), and interference cancellation etc. are being developed.

In addition, in the 5G system (NR, New Radio), advanced coding modulation (Advanced Coding Modulation: ACM) methods such as FQAM (Hybrid FSK and QAM Modulation) and SWSC (Sliding Window Superposition Coding) and advanced access technology FBMC (Filter Bank Multi Carrier (NOMA), non-orthogonal multiple access (NOMA), and sparse code multiple access (SCMA) are being developed.

In a communication/broadcasting system, link performance can be significantly degraded by various noise, fading, and inter-symbol interference (ISI) of a channel. Therefore, it is required to develop a technology for overcoming noise, fading, and inter-symbol interference in order to implement high-speed digital communication/broadcasting systems that require high data throughput and reliability, such as next-generation mobile communication, digital broadcasting, and portable Internet. As part of research to overcome noise, etc., research on error correcting codes has been actively conducted recently as a method for increasing communication reliability by efficiently restoring distortion of information.

The present invention provides a method and apparatus for transmitting coded bits capable of supporting various input lengths and code rates. In addition, the present invention provides a base graph setting method of LDPC code used for data channel transmission and a method and apparatus for segmentation of a transport block (TB) using the LDPC code.

Next, a low density parity check (LDPC) code will be described.

The LDPC code is a type of linear block code and includes a process of determining a codeword that satisfies the condition as shown in [Equation 1] below.

[Equation 1]

이다.in Equation 1

am.

In Equation 1, H is a parity check matrix, C is a codeword, c _i is _{the i} th bit of the codeword, and N _ldpc is the length of the codeword. Here, h _i means the 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 products of the i-th column (h _i ) of the parity check matrix and the i-th codeword bit c _i is '0', so the i-th column (h _i ) is the i-th codeword It means that it is related to bit c _i .

A parity check matrix used in communication and broadcasting systems is a quasi-cyclic LDPC code (or QC-LDPC code, hereinafter QC-LDPC code) that typically uses a quasi-cyclic parity check matrix for ease of implementation. is used a lot

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

As shown in [Equation 2] below, a Z×Z permutation matrix P=(P _ij ) is defined.

[Equation 2]

In the above [Equation 2], P _ij (0 ≤ i, j < Z) denotes an entry of an i-th row and a j-th column in the matrix P. For the permutation matrix P defined as above, (0 ≤ i < Z) is a circular permutation in the form of circular shifting each element of the identity matrix of size Z × Z in the right direction by i times. It can be seen that it is a matrix.

The parity check matrix H of the simplest QC-LDPC code can be expressed in the following [Equation 3].

[Equation 3]

If P ^-1 is defined as a 0-matrix of size Z×Z, each index a _ij of the cyclic permutation matrix or 0-matrix in [Equation 3] is {-1, 0, 1, 2, .. ., Z-1} values. In addition, since the parity check matrix H of [Equation 3] has n column blocks and m row blocks, it can be seen that it has the size Z×Z.

Typically, an m×n binary matrix obtained by replacing each cyclic permutation matrix and the 0-matrix with 1 and 0, respectively, in the parity check matrix of Equation 3 above is the model of the parity check matrix H. Let the mother matrix (or Base Graph) be M(H), and select only the index of each cyclic permutation matrix or 0-matrix to obtain an integer matrix of size m × n obtained as in [Equation 4] Let the exponent matrix E(H) of the parity check matrix H.

[Equation 4]

Meanwhile, the performance of the LDPC code may be determined according to the parity check matrix. Therefore, it is necessary to design a parity check matrix for an LDPC code having excellent performance. In addition, an LDPC encoding and decoding method capable of supporting various input lengths and code rates is required.

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 Z value that determines the size of a cyclic permutation matrix or a 0-matrix from a given small parent matrix according to a specific rule. The existing lifting method and the characteristics of the QC-LDPC code designed through lifting are briefly summarized as follows.

First, when an LDPC code C ₀ is given, S QC-LDPC codes to be designed through the lifting method are C ₁ , C ₂ , . . . , 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 size of the row block and column block of the circulant matrix constituting the parity check matrix The value corresponding to is called Z _k . Here, C ₀ corresponds to the smallest LDPC code having the parent matrix of C ₁ , ..., C _S code as a parity check matrix, and the value of Z ₀ corresponding to the size of the row block and column block is 1, and 0 ≤ k For ≤ S-1, Z _k < Z _{k + 1} . Also, for convenience, the parity check matrix H _k of each code C _k has an exponent matrix E(H _k )=a _i,j ^(k) of size m×n, and each exponent a _i,j ^(k) is {-1, 0, 1, 2, ..., Z _k - 1} is selected as one of the values. Lifting is done in 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) has the same characteristics. In addition, if only the parity check matrix _HS of C _S is stored due to the characteristics of the lifting process, the QC-LDPC code C ₀ , C ₁ , . .., C _S can all be represented.

[Equation 5]

[Equation 6]

The most generalized expression of the above method can be expressed as in [Equation 7] below.

[Equation 7]

In [Equation 7], f(x,y) means an arbitrary function having x and y as input values. V _i,j denotes an element corresponding to an i-th row and a j-th column of an exponent matrix of a parity check matrix corresponding to an LDPC code having the largest size (eg, corresponding to C _S in the above description). P _ij denotes an element corresponding to the i-th row and j-th column of an exponent matrix of a parity check matrix for an LDPC code having an arbitrary size (for example, corresponding to C _k in the above description), and Z is the corresponding LDPC code It means the size of the row block and column block of the circulant matrix constituting the parity 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 later, the notation described above is named and defined as follows and used.

[Definition 1]

The parity check matrix for an arbitrary LDPC code can be expressed using the maximum exponential matrix defined above or the elements of the maximum exponential matrix.

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

[Equation 8]

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

[Equation 9]

In [Equation 9], the maximum exponential matrix element (V _i,j ) _m corresponds to (i, j) of the maximum exponential matrix E( _HS ) _m . In the following, in defining the parity check matrix for the LDPC code in the present invention, the maximum exponential matrix defined above will be used. This can be applied in the same way as expressed using maximum exponential matrix elements.

The following is a code block segmentation and CRC addition method based on the turbo code in the LTE TS36.213 document.

Unlike LTE, 5G and next-generation communication systems use LDPC codes in data channels. In addition, even in the case of applying the LDPC code, one transport block is divided into several code blocks, and some of the code blocks may form one code block group. Also, the number of code blocks of each code block group may be all the same or have some different values. Bitwise interleaving can be applied to individual code blocks or groups of code blocks or transport blocks.

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

In FIG. 3, two basic structures of the base-graph 300 of the LDPC code supporting data channel coding in the next-generation mobile communication system are basically supported. 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), and the base-graph structure of the second LDPC code has a maximum vertical length of 42 (320) and a maximum It has a matrix structure with a horizontal length of 52 (318). The base-graph structure of the first LPDC code supports a minimum of 1/3 to a maximum of 8/9 code rate, and the base-graph structure of the second LDPC code can support a minimum of 1/5 to a maximum of 8/9 code rate. .

Basically, the LDPC code is composed of 6 sub-matrix structures. The first sub-matrix structure 302 contains 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 an identity matrix.

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

In the base-graph structure of the second LDPC code, the horizontal length 322 of the first sub-matrix 302 has a value of 10 and the vertical length 314 has a value of 7. Both the horizontal length 324 and the vertical length 314 of the second sub-matrix 304 have a value of 7. The horizontal length 326 of the third sub-matrix 306 has a value of 35, and the vertical 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 horizontal length 324 of the fifth sub-matrix 310 has a value of 7, and the vertical length 316 has a value of 35. Both the horizontal length 326 and the vertical length 316 of the sixth sub-matrix 312 have a value of 35.

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

[Table 3]

Code block sizes that can be supported in the base-graph structure of the first LDPC code are as follows.

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

However, the number of information bits capable of channel coding using BG#2 may be any natural number.

가 추가적으로 정의된다. 통상적으로 M는 8 또는 임의의 자연수 값을 가질 수 있으며, i는 1부터 M까지의 값을 가진다. 단말은 상기 행렬

들을 이용하여 하향 데이터 디코딩 또는 상향 데이터 인코딩을 수행한다. 상기 행렬

들은 첫 번째 LDPC 코드의 base-graph(BG#1)에서 특정 요소 값들이 shift된 형태를 가지고 있다. 즉,

행렬들은 서로 다른 shift 값을 가질 수 있는 형태이다. In addition, a total of M maximum exponential matrices based on the base-graph (BG#1) of the first LDPC code

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 is the matrix

Downlink data decoding or uplink data encoding is performed using . said matrix

have a shifted form of specific element values in the base-graph (BG#1) of the first LDPC code. in other words,

Matrices are of a type that can have different shift values.

The size of one code block that can be supported in the base-graph structure of the second LDPC code is 10 × Z (where Z = a × 2 ^j , and Z is composed of the following Table 4, and the maximum size of one code block that can be supported is 2560 (or 3840), and the minimum supportable code block size is 20. For reference, some of (288, 272, 304, 320, 336, 352, 368, 384) as candidates for Z values in Table 3 Or the whole may be additionally reflected.

[Table 4]

Code block sizes that can be supported in the base-graph structure of the second LDPC code are as follows.

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

However, the number of information bits capable of channel coding using BG#2 may be any natural number.

가 추가적으로 정의된다. 통상적으로 M는 8 또는 임의의 자연수 값을 가질 수 있으며, i는 1부터 M까지의 값을 가진다. 단말은 상기

행렬을 이용하여 하향 데이터 디코딩 또는 상향 데이터 인코딩을 수행한다. 상기

행렬들은 두 번째 LDPC 코드의 base-graph(BG#2)에서 특정 요소 값들이 shift된 형태를 가지고 있다. 즉,

행렬들은 서로 다른 shift 값을 가질 수 있는 형태이다.In addition, a total of M maximum exponential matrices based on the base-graph (BG#2) of the second LDPC code

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 said

Downlink data decoding or uplink data encoding is performed using a matrix. remind

The matrices have shifted values of specific elements in the base-graph (BG#2) of the second LDPC code. in other words,

Matrices are of a type that can have different shift values.

As described above, two types of base-graphs are provided in the next-generation mobile communication system. Accordingly, specific terminals may support only the first base-graph, only the second base-graph, or terminals supporting both base-graphs. This is summarized in Table 5 below.

[Table 5]

를 적용한다. 유형 2를 지원하는 단말은 기지국으로부터 하향 제어 정보를 통해 하향 데이터 정보 수신 시, 상기 하향 데이터 정보가 담긴 전송 블록에 적용된 base-graph는 두 번째 base-graph가 항상 적용된다고 판단하며, 데이터 인코딩 또는 디코딩 시, 최대 지수 행렬

를 적용한다.When receiving downlink data information from a base station through downlink control information, a terminal supporting type 1 determines that the first base-graph is always applied to the base-graph applied to a transport block containing the downlink data information, and encodes or decodes the data. hour, maximum exponential matrix

apply When a terminal supporting type 2 receives downlink data information from a base station through downlink control information, it is determined that the second base-graph is always applied to the base-graph applied to the transport block containing the downlink data information, and data encoding or decoding is performed. hour, maximum exponential matrix

apply

When a terminal supporting type 3 receives downlink data information from a base station through downlink control information, the base-graph applied to the transport block containing the downlink data information is set in advance by higher signaling such as SIB, RRC, or MAC CE from the base station. received or set through downlink control information transmitted through a terminal group common, terminal (cell) common, or terminal specific control channel. The downlink control information may or may not include the transport block scheduling information.

와

중에 어떤 것이 적용되었는지를 기지국으로부터 SIB 또는 RRC 또는 MAC CE와 같이 상위 시그널링으로 사전에 설정 받거나 또는 단말 그룹 공통 또는 단말(셀) 공통 또는 단말 특정 제어 채널로 전달되는 하향 제어 정보를 통해 설정 받는다. 상기 하향 제어 정보에는 상기 전송 블록 스케줄링 정보가 같이 포함되어 있거나 또는 포함되지 않을 수 있다.Alternatively, when a terminal supporting type 3 receives downlink data information from a base station through downlink control information, the maximum index matrix applied to a transport block containing the downlink data information is

and

Which one of them is applied is set in advance by higher signaling such as SIB, RRC, or MAC CE from the base station, or through downlink control information transmitted through a common terminal group or terminal (cell) common or 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 receiving process of a terminal according to an embodiment.

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

The terminal determines one or a combination of two or more of the following conditions through reception of the downlink control information (402).

A. RNTI scrambled to CRC of the downlink control information

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

C. Base-graph indicator included in the downlink control information

D. Scheduling-related values included in the downlink control information

When the RNTI scrambled in the CRC of the downlink control information, which is condition A, is RA-RNTI, P-RNTI, SI-RNTI, SC-RNTI, or G-RNTI, the terminal determines that this is condition 1 and performs operation 1 (404). carry out

If the RNTI scrambled in the CRC of the downlink control information, which is condition A, is RA-RNTI, P-RNTI, SI-RNTI, SC-RNTI, or G-RNTI, the terminal determines that this is condition 2 and performs operation 2 (406) carry out

When the size including the transport block and CRC included in the downlink control information, which is condition B, is equal to or greater than a predetermined threshold value (Δ ₁ ), the terminal determines that this is condition 1 and performs operation 1 (404).

When the size including the transport block and CRC included in the downlink control information, which is condition B, is less than or equal to a predetermined threshold value (Δ ₂ ), the terminal determines that this is condition 2 and performs operation 2 (406).

The threshold value Δ ₁ or the threshold value Δ ₂ may use 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 have the same value or different values.

Alternatively, the threshold value (Δ ₁ ) or the threshold value (Δ ₂ ) is a value set in advance by higher signaling such as SIB, RRC, or MAC CE, or downlink control of a UE group common, UE common, or UE specific downlink control channel in advance. It may be a value set through information. At this time, before the threshold value (Δ) is set, the default threshold value (Δ) may use a fixed value of 2560 (or 3840 or 960 or 1040 or 1120 or 170 or 640 or any other value). there is. Determination of the point in time before the threshold value (Δ ₁ ) or the threshold value (Δ ₂ ) is set is that the UE determines that the CRC of the downlink control information is RA-RNTI, P-RNTI, SI-RNTI, SC-RNTI or G-RNTI In case of scrambling.

Satisfying K > (transport block size + CRC size) when the size including the transport block and CRC included in the downlink control information, which is condition B, is smaller than 2560 (or 3840) (or larger than 160 or 640 at the same time) If the minimum code block length (K _min ) among code block lengths (K) that can be supported in the first base-graph and code block lengths (K) that can be supported in the second base-graph belongs to the first base-graph, The terminal determines that this is condition 1 and performs operation 1 (404).

Satisfying K > (transport block size + CRC size) when the size including the transport block and CRC included in the downlink control information, which is condition B, is smaller than 2560 (or 3840) (or larger than 160 or 640 at the same time) If the minimum code block length K among the code block lengths supportable in the first base-graph and the code block lengths supportable in the second base-graph belongs to the second base-graph, the terminal determines that this is condition 2 and operates. 2 (406) is performed.

This can be expressed using the following formula.

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

K* = min(K)

If K* ∈ K ¹ , condition 1 is satisfied and action 1 (404) is performed

If K* ∈ K ² , condition 2 is satisfied and action 2 (406) is performed

where K is the code block length, K* is the selected code block length, TB is the transport block size, CRC is the CRC size, K ¹ is the set of code block lengths supported by the first base-graph, K ² is the second base-graph set of code block lengths supported by

Alternatively, it can be expressed using the following formula.

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

K* = min(K)

If K* ∈ K ¹ , condition 1 is satisfied and action 1 (404) is performed

If K* ∈ K ² , condition 2 is satisfied and action 2 (406) is performed

where K is the code block length, K* is the selected code block length, TB is the transport block size, CRC is the CRC size, K ¹ is the set of code block lengths supported by the first base-graph, K ² is the second base-graph set of code block lengths supported by

)에서 지원 가능한 코드 블록 길이 집합이며, 그 집합들의 종류는 다음 중 하나 또는 2개 이상의 일부 조합이 될 수 있다. 상기 V₁은 160 또는 640이거나 그 이외의 다른 값이 될 수 있다. 상기 V₂는 2560 또는 3840 또는 960 또는 1040 또는 1120이거나 그 이외의 다른 값이 될 수 있다. The K ¹ is the first base-graph (or maximum exponential matrix

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

중 하나를 적용하여 디코딩 또는 인코딩을 수행하며, 상기 수학식에서 TB + CRC가 V₂보다 큰 경우, 최대 지수 행렬

중 하나를 적용하여 디코딩 또는 인코딩을 수행하는 것이 가능하다. Or, if TB + CRC in the above equation is less than V ₁ , the maximum exponential matrix

Decoding or encoding is performed by applying one of the above, and when TB + CRC is greater than V ₂ in the above equation, the maximum exponential matrix

It is possible to perform decoding or encoding by applying one of

1. If K is less than or equal to 2560

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

2. When K is less than or equal to 3840

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

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

44, 66, 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

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

As for the values present in the table, when the value is equal to or smaller than M, it is generally possible that all or part of the values are omitted from the table and used. The value of M may be 160 or 640 or other values.

)에서 지원 가능한 코드 블록 길이 집합이며, 그 집합들의 종류는 다음 중 하나 또는 2개 이상의 일부 조합이 될 수 있다. The K ² is the second base-graph (or maximum exponential matrix

), and the types of sets can be one of the following or some combination of two or more.

1. If K is less than or equal to 2560

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

2. When K is less than or equal to 3840

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

3. If K is less than or equal to 960

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

4. If K is less than or equal to 1040

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

5. If K is less than or equal to 1120

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

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

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

When MCS, RV, NDI, or frequency or time resource allocation values among scheduling-related values included in the downlink control information, which is condition D, indicate specific information, the terminal determines that condition 1 is satisfied and performs operation 1 (404). do.

If MCS, RV, NDI or frequency or time resource allocation values among the scheduling-related values included in the downlink control information, which is condition D, indicate specific information, the terminal determines that condition 2 is satisfied and performs operation 2 (404). do.

When performing operation 1, the terminal performs an operation for one or a combination of two or more of the following.

)에서 지원 가능한 코드 블록 길이를 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다. 1. The terminal is the first base-graph (or maximum exponential matrix

), attempts to decode the transport block indicated by the downlink control information based on the supportable code block length.

2. The UE then attempts to decode the transport block indicated by the downlink control information by referring to the supportable code block table.

44, 66, 88, 110, 132, 154, 176, 198, 220, 242, 264, 286, 308, 330, 352, 296, 440, 484, 528, 572, 616, 660, 704, 792, 880, 968, 1056, 1144, 1232, 1320, 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)

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 첫 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다. 3. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the first base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 첫 번째 base-graph 에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.4. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the first base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 첫 번째 base-graph 에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.5. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the first base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 첫 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.6. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the first base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

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

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 첫 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.7. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the first base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

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

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 첫 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.8. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the first base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

A. 242, 484, 968, 1936, 3872

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

C. 1408, 2112, 4928, 6336, 7744

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 첫 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.9. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the first base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

A. 286, 572, 1144, 2288, 4576

B. 2816, 4224, 7040

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 첫 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.10. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the first base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

A. 330, 660, 1320, 2640, 5280

B. 5632, 8448

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

1. The terminal attempts decoding of the transport block indicated by the downlink control information based on the code block length supportable in the second base-graph.

2. The UE then attempts to decode the transport block indicated by the downlink control information by referring to the supportable code block table.

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 두 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다. 3. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the second base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 두 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.4. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the second base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 두 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.5. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the second base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 두 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.6. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the second base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 두 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.7. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the second base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 두 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.8. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the second base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

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

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

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 첫 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.9. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the first base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

A. 130, 260, 520, 1040, 2080

B. 1280, 1920, (3200)

를 이용하여 단말이 인코딩 또는 디코딩 하는 코드블록들이다. 해당 코드 블록에 대해서 적어도 단말은 두 번째 base-graph에서 지원하는

행렬을 기반으로 상기 하향 제어 정보에서 지시한 전송 블록에 대해 디코딩을 시도한다.10. One or combinations of two or more of the following possible code block sets are

Code blocks encoded or decoded by the terminal using For that code block, at least the terminal supports the second base-graph

Based on the matrix, decoding of the transport block indicated by the downlink control information is attempted.

A. 150, 300, 600, 1200, 2400

B. 2560, (3840)

In the present invention, a number expressed in parentheses means that the corresponding value may or may not be included.

In the present invention, the number of information bits may mean the amount of data to be transmitted transmitted from an upper layer or the size of a transport block (TB) (transport block size; TBS). The TBS is generally transmitted during one TTI, but may be transmitted over several TTIs. In the present invention, TBS may be represented by N.

을 이용하여 디코딩을 하도록 설정 받은 단말 혹은 데이터 전송 시에 최대 지수 행렬

을 이용하여 디코딩을 할 수 없는 단말일 수 있고, 혹은 상기 [표5]의 유형 1을 지원하는 단말일 수 있다.In the present invention, the first terminal refers to the maximum exponential matrix when transmitting data.

Maximum exponential matrix when transmitting data or a terminal set to decode using

It may be a terminal that cannot decode using , or it may be a terminal that supports type 1 of [Table 5].

을 이용하여 디코딩을 하도록 설정 받은 단말 혹은 데이터 전송 시에 최대 지수 행렬

을 이용하여 디코딩을 할 수 없는 단말일 수 있고, 혹은 상기 [표5]의 유형 2를 지원하는 단말일 수 있다.In the present invention, the second terminal refers to the maximum exponential matrix at the time of data transmission.

Maximum exponential matrix when transmitting data or a terminal set to decode using

It may be a terminal that cannot decode using , or it may be a terminal that supports type 2 of [Table 5].

혹은

을 이용하여 디코딩을 하도록 설정 받은 단말일 수 있고, 혹은 상기 [표5]의 유형 3을 지원하는 단말일 수 있다. 단말은 TBS, MCS, 전송모드 중 하나 이상에 따라 판단하여 어떤 최대 지수 행렬을 이용할지 결정할 수 있다. In the present invention, the third terminal refers to the maximum exponential matrix when transmitting data.

or

It may be a terminal configured to perform decoding using , or it may be a terminal supporting type 3 of [Table 5] above. The terminal may determine which maximum index matrix to use by determining according to one or more of TBS, MCS, and transmission mode.

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

5 is a diagram illustrating a method in which one transport block (TB) is segmented into one or more code blocks (CB). Referring to FIG. 5, a CRC 503 may be added to the last or first part of one transport block 501 to be transmitted in uplink or downlink. The CRC may have 16 bits or 24 bits, a fixed number of bits in advance, or a variable number of bits according to channel conditions, etc., and may be used to determine whether channel coding is successful. Blocks 501 and 503 to which TB and CRC are added may be divided into several code blocks 507, 509, 511, and 513 (505). The code block may be divided with a predetermined maximum size. In this case, the last code block 513 may have a smaller size than other code blocks, or put 0, a random value, or 1 to have the same length as other code blocks. can fit CRCs 517, 519, 521, and 523 may be added to the divided code blocks, respectively (515). The CRC may have 16 bits or 24 bits or a pre-fixed number of bits, and 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 have different lengths depending on the type of channel code to be applied to the code block. Also, when a polar code is used, a CRC may be added or omitted. In the above division process, when there is only one CB, the CRC 517 additionally added to the CB may be omitted.

The CRC inserted into the TB transmission used to determine whether the TB has been successfully decoded after decoding the TB in the receiver has a length L and can have at least two possible values. That is, when a transport block is divided into two or more code blocks and transmitted, a long-length CRC is used, and conversely, when a transport block is transmitted as one code block, a short-length CRC may be used. When an LDPC code is used for encoding in a mobile communication system, since the LDPC code itself has a parity check function, it has a function of determining whether decoding is successful to some extent without CRC insertion. In a specific mobile communication system, when an LDPC code is used and an additional decoding success determination level is desired, a technique for determining final decoding success by inserting a CRC in addition to the parity check function of the LDPC code can be used. A desired error rate level for determining whether decoding is successful may be obtained. For example, if the decoding success or failure decision error rate 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 with a decision error rate of 10^-3 is additionally By inserting it, it is possible to achieve a final system judgment error rate of 10^-6. In general, the longer the length of the CRC, the lower the error rate in determining whether decoding is successful or not. When a transport block is divided into two or more code blocks and transmitted, the parity check function of the LDPC code itself cannot be used because the TB itself is composed of concatenation of LDPC codes. 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 specific system, it is possible to insert a long or short CRC into a TB according to the number of code blocks in a transport block. In the embodiments of the present invention, it is assumed that a long length L+ or a short length L- can be used for the length L of the CRC inserted into the TB depending on whether the TB is divided into two or more code blocks. An example of a possible value for L+ is 24, which was used in the case of LTE, and an example of L- can be any length shorter than this, but it is possible to reuse 16 used in the LTE control channel. However, in an embodiment of the present invention, the L-value is not limited to 16 as an example.

Whether a specific TB is divided into multiple code blocks depends on whether a given TB can be transmitted with one code block, so it can be determined as follows:

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

- if the N+L-value is greater than the highest possible CB length, split the TB and transmit the TB in multiple code blocks; If (N + L-) > K _max , then CB is segmented

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

In the conventional LTE system, the MCS index transmitted in the DCI and the number of assigned PRBs are used to determine the TBS. On a downlink basis, a 5-bit MCS index is transmitted in DCI, and the modulation order Qm and TBS index can be found from the table below.

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

The above table shows the TBS table when the PRB is from 1 to 10 and the TBS index is from 0 to 26, but this is used in conventional LTE when the PRB is up to 110 and even in the case of an additional TBS index. . Using the number of PRBs allocated in the table and the TBS index, the number of the corresponding column becomes the TBS understood by the base station and the terminal.

라면, 터보코드가 수행된 후의 코딩된 비트 수는

가 된다. 따라서 데이터 전송을 위해 레이트 매칭(rate matching)을 수행함에 있어서 사용되는 서큘러 버퍼 (circular buffer)의 길이는

가 될 수 있다. 상기에서 레이트 매칭이라 함은 인코딩된 비트를 실제 물리 자원에 매핑할 때에 어떠한 비트들을 매핑하여 전송할 것인지를 수행하는 과정이 될 수 있다. 기지국에서 데이터를 전송하는 하향링크의 경우에는 단말이 상기 전송된 비트에 해당하는

만큼의 log likelihood ratio (LLR) 값을 저장할 수 있는 크기의 소프트버퍼 메모리가 필요하다. 상기에서 LLR 값은 디코딩을 수행하기 위한 수신 데이터의 처리 값이라고 할 수 있다. 하지만 너무 큰 크기의 데이터 전송을 위해서는 큰 사이즈의 소프트 버퍼가 필요하므로, 이는 곧 단말의 가격 상승을 필요로 할 수 있다. 왜냐하면 더 큰 사이즈의 메모리가 요구되기 때문이다. 따라서 큰 데이터가 전송될 때는 작은 사이즈의 소프트 버퍼 메모리로도 LLR 값들이 저장될 수 있도록 하기 위하여 레이트 매칭 방법이 필요할 수 있다. 종래 LTE 시스템에서는 하나의 코드블록에서 레이트매칭을 하기 위한 circular buffer의 크기는

로 주어지며, 상기에서

은 단말의 소프트버퍼 크기인

와 HARQ process 개수 등의 파라미터로 결정될 수 있다.

는 단말의 카테코리 (UE category)에서 정의될 수 있다. 상기에서 C는 전송하고자 하는 데이터 전송블록에 포함된 코드블록의 수이다. In a conventional LTE system, a turbo code is used as channel coding for data transmission, and the code rate of the turbo code is 1/3. If the number of information bits entered into the input of the turbo code

, the number of coded bits after turbo code is performed is

becomes Therefore, the length of the circular buffer used in performing rate matching for data transmission is

can be In the above, rate matching may be a process of determining which bits are to be mapped and transmitted when encoding encoded bits are mapped to actual physical resources. In the case of downlink in which the base station transmits data, the terminal corresponds to the transmitted bit.

A soft buffer memory large enough to store as many log likelihood ratio (LLR) values is required. In the above, the LLR value may be referred to as a processing value of received data for performing decoding. However, since a large-sized soft buffer is required for data transmission of an excessively large size, this may require an increase in the price of the terminal. This is because a larger size memory is required. Therefore, when large data is transmitted, a rate matching method may be required to store LLR values even in a small-sized soft buffer memory. In the conventional LTE system, the size of the circular buffer for rate matching in one code block is

is given as, in the above

is the size of the soft buffer of the terminal.

and parameters such as the number of HARQ processes.

Can be defined in the UE category. In the above, C is the number of code blocks included in the data transport block to be transmitted.

크기(601)의 전송하고자 하는 데이터를 터보코드로 인코딩을 수행하면, (602)의 정보비트, (604)의 첫번째 패리티 비트, (606)의 두번째 패리티 비트가 생성되며 총 크기는

가 될 수 있다(608). 상기 정해진

크기의 (602), (604), (606)을 순차적으로 할당된 자원에 매핑하여 전송하는 과정이 레이트 매칭인 (610) 단계에서 수행된다. 하지만 단말의 소프트 버퍼 크기를 고려하여 레이트 매칭에 제약을 추가하면, (612)의 데이터 비트 및 (614)와 같은 일부의 패리티 비트들만 이용하여 레이트 매칭이 (622) 단계와 같이 수행될 수 있다. 상기에서 서큘러 버퍼의 크기는

가 되며(618), 이는 단말의 소프트 버퍼 크기 및 HARQ process 개수 등에 의해 결정되는

에 영향을 받는 값이 된다. 상기에서는

에 의해서 (616)에 해당하는 만큼의 패리티 비트는 단말이 저장할 수 없으므로 전송하지 않는 비트가 될 수 있다. 단말이 저장하지 못하는 비트들은 전송을 하지 않는다는 이유일 수 있다. 6 is a diagram for explaining an example in which the rate matching method varies depending on the size of the soft buffer of the terminal described above. like (600)

When data to be transmitted of size 601 is encoded with turbo code, information bits of 602, first parity bits of 604, and second parity bits of 606 are generated, and the total size is

can be (608). specified above

A process of mapping and transmitting the sizes 602, 604, and 606 to sequentially allocated resources is performed in step 610 of rate matching. However, if restrictions are added to rate matching in consideration of the size of the soft buffer of the terminal, rate matching may be performed as in step 622 using only the data bits of 612 and some parity bits such as 614. In the above, the size of the circular buffer is

Is (618), which is determined by the soft buffer size of the terminal and the number of HARQ processes, etc.

becomes the value affected by In the above

Since the terminal cannot store the number of parity bits corresponding to 616 by , they may be bits that are not transmitted. Bits that the terminal cannot store may be the reason for not transmitting.

It can be sufficiently applied to the transport block encoding process of the TBS uplink data channel for downlink data transmission of the terminal described in the present invention.

The encoding/decoding operation of the terminal described in the present invention can be sufficiently applied to the encoding/decoding operation of the base station.

In the present invention, the length of the CRC inserted into TB transmission used to determine success or failure of TB decoding after decoding the TB in the receiver can have at least two possible values. That is, when a transport block is divided into two or more code blocks and transmitted, a long length (L+) CRC is used, and conversely, when a transport block is transmitted as one code block, a short length (L-) CRC is used. can L- is a natural number with a value less than L+. In the embodiments of the present invention, it is assumed that a long length L+ or a short length L- of a CRC inserted into the TB can be used depending on whether the TB is divided into two or more code blocks. An example of a possible value for L+ is 24, which was used in the case of LTE, and an example of L- can be any length shorter than this, but it is possible to reuse 16 used in the LTE control channel. However, in an embodiment of the present invention, the L-value is not limited to 16 as an example.

In the present invention, a transport block (TB) 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 respectively indicate the maximum codeblock (CB) length when BG#1 is used and the maximum codeblock length when BG#2 is used in the LDPC code. For example, N1_max = 8448 and N2_max = 3840. However, embodiments of the present invention are not limited to the above values. In the present invention, N1_max may be mixed with N1 _max or N _1,max , and N2_max may be mixed with N2 _max or N _2,max .

In the present invention, L_{TB,16} and L_{TB,24} may be CRC lengths added to 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} can be used interchangeably with L _TB,16 , and L_{TB,24} can be used interchangeably with L _TB,24 . In the present invention, L_{CB} may be the length of the CRC added to CB, and may be used interchangeably with L _CB .

[First Embodiment]

The first embodiment provides a TBS determination method considering the maximum TBS size supported by the terminal. In this embodiment, in a specific case, when the TBS is large, it may be applied to the case where it is divided into two or more code blocks and each code block is channel-coded with an LDPC code using BG#2 and transmitted. That is, it can be applied when it is possible to transmit using BG#2 even when the TBS is large. In this embodiment, R_1 and R_2 may indicate code rates that are criteria for selecting BG#1 or BG#2 of LDPC, and may be used interchangeably with R ₁ and R ₂ , respectively. For example, R ₁ =1/4 R ₂ =2/3, but the method provided by the present invention is not limited any more. In addition, R, which is referred to as a code rate in the present invention, and R ₁ and R ₂ may be expressed and determined in various ways such as fractions and decimals. When selecting a BG among BG#1 and BG#2 during data transmission, code rate, soft buffer of the terminal, etc. may be considered.

The base station may transmit data by allocating frequency resources of an arbitrary number of PRBs and time resources of an arbitrary number of slots or symbols to the terminal, and the related scheduling information is transmitted in downlink control information (DCI) or higher signaling. It can be delivered to the terminal with the configured setting or a combination thereof. When the base station and the terminal are given scheduling information, the TBS may be determined in the following order.

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

- Step 1-2: Determining the number of temporary CBs, byte alignment (making it a multiple of 8) and making it a multiple of the number of temporary CBs (C, B)

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

- Step 1-4: Determination of the final TBS value considering the terminal capability or terminal category or the maximum TBS supported by the terminal

In step 1-1, a temporary TBS value is determined in consideration of the amount of resource regions to which data to be sent can be mapped. These include code rate (R), modulation order (Qm), the number of REs to which data is rate-matched and mapped (#RE), the number of allocated PRBs or RBs (#PRB), the number of allocated OFDM symbols, the number of allocated slots, The number of temporary information bits may be determined by a combination of one or more of reference values of the number of REs mapped in the PRB. For example, A may be determined by Equation 10 below.

[Equation 10]

는 DCI 혹은 상위 시그널링 혹은 둘의 조합으로 단말에게 전달될 수 있다. 상기에서

는 기지국이 데이터가 전송될 때 rate matching으로 매핑되는 RE 수를 이용하여 결정될 수 있으며, 자원할당 정보를 기지국과 단말이 서로 알고 있을 때 상기

는 기지국과 단말이 동일하게 이해할 수 있다.

를 계산할 때, rate matching 방식으로 데이터가 매핑되기로 하였으나, CSI-RS 혹은 URLLC 혹은 UCI 전송 등 특별한 이유로 데이터가 puncturing되어 실제로는 매핑되지 않는 RE도

에 포함되도록 계산되어진다. 이는 기지국이 단말에게 알리지 않고 임의로 매핑하기로 했던 데이터의 일부를 puncturing 방식으로 전송하지 않았을 때에도 기지국과 단말이 TBS를 동일하게 이해할 수 있도록 하기 위함일 수 있다. 일례로 하기 [표 6]과 같은 MCS table을 정의하고, 단말에게 MCS index를 전달하여 Qm과 R에 대한 정보를 전달할 수 있다. 상기에서 modulation order는 QPSK, 16QAM, 64QAM, 256QAM, 1024QAM 등의 정보를 의미한다.In the above, the modulation order, Qm, and the code rate, R, may be included in DCI and delivered to the UE. The number of layers used when transferring

may be delivered to the terminal through DCI or higher signaling or a combination of the two. from above

can be determined using the number of REs mapped by rate matching when the base station transmits data, and when the base station and the terminal know resource allocation information, the

can be equally understood by the base station and the terminal.

When calculating , data is decided to be mapped in a rate matching method, but data is punctured for special reasons such as CSI-RS, URLLC, or UCI transmission, so REs that are not actually mapped

is calculated to be included in This may be done so that the base station and the terminal can equally understand the TBS even when the base station does not transmit part of the data to be mapped arbitrarily in a puncturing manner without notifying the terminal. As an example, an MCS table as shown in [Table 6] below can be defined, and information on Qm and R can be delivered by delivering an MCS index to the UE. In the above, the modulation order means information such as QPSK, 16QAM, 64QAM, 256QAM, and 1024QAM.

[Table 6]

로 결정될 수 있다. In [Table 6], Qm and R are transmitted together as a 5-bit MCS index, but this can be transmitted in DCI as a 6-bit MCS index, or 3-bit Qm and 3-bit R are each transmitted in a bit field It can be delivered to the terminal in various ways, such as. or A= (Number of allocated PRBs) x (Number of reference REs per PRB) X

can be determined by

In step 1-2, the number of temporary code blocks (the number of temporary CBs) C is determined using the determined A, and based on this, A is made a multiple of 8 and a multiple of the number of temporary CBs. This is to ensure that the length of the CRC added to the finally determined TBS and TB is byte aligned and at the same time a multiple of CB. First, the number of temporary CBs can be determined by pseudo-code 1 below.

[pseudo-code 1]

[start]

,If R ≤ R ₁ , then

,

.Else

.

End if R

[end]

는 8448일 수 있고,

는 3840일 수 있다. 이 경우에는 pseudo-code 2에 의해 정해질 수 있지만 이에 한정되지는 않을 수 있다. In the above, R is a code rate, and as mentioned above, it may be a value transmitted in DCI. As mentioned above, R ₁ may be 1/4,

may be 8448,

may be 3840. In this case, it may be determined by pseudo-code 2, but may not be limited thereto.

[pseudo-code 2]

[start]

,If R ≤ 1/4, then

,

.Else

.

End if R

[end]

The C obtained above may be the number of temporary CBs, and CB division is performed when a TB is finally transmitted, and may be different from the actual number of CBs obtained at this time, but may be determined to be the same. Now, the value of A determined in step 1-1 is made a multiple of 8 and C to go through the process of generating B. This may be to prevent all code blocks from being transmitted with unnecessary bits or unnecessary zero padding bits. B can be calculated as shown in Equation 15 below.

[Equation 15]

혹은

혹은

로 변형되어 적용되는 것이 가능하다. 본 발명에서 mod(x,y)는 x를 y로 나눈 나머지이며,

로 변형되어 적용될 수 있다. 본 발명에서

는 x보다 큰 최소 정수를 의미하며, ceil(x)와 혼용될 수 있다.

는 x보다 작은 최대 정수를 의미하며, floor(x)와 혼용될 수 있다. 상기 수학식 15는 또한

로 변형되어 적용될 수 있으며, 이는 A에서 가장 가까운 8C의 배수를 B로 함을 의미할 수 있다. Round(x)는 x에서 가장 가까운 정수를 의미하거나 반올림을 의미할 수 있다. 상기 수학식 15는 A를 8C의 배수로 만들기 위함이지만, 8과 C의 공배수 혹은 최소공배수로 만드는 것으로 변형되어 적용될 수 있다. 따라서 상기 수학식 15는

혹은

혹은

으로 변형되어 적용되는 것이 가능할 수 있다. 상기에서

는 a와 b의 최소 공배수를 의미한다. Equation 15 above is

or

or

It is possible to transform and apply to . In the present invention, mod(x,y) is the remainder of dividing x by y,

can be modified and applied. in the present invention

means the smallest integer greater than x, and can be used interchangeably with ceil(x).

means the largest integer smaller than x, and can be used interchangeably with floor(x). Equation 15 above is also

It can be transformed into and applied, which can mean that the multiple of 8C closest to A is B. Round(x) can mean the nearest integer from x or can mean rounding. Equation 15 above is intended to make A a multiple of 8C, but it can be modified and applied to make it a common multiple or least common multiple of 8 and C. Therefore, Equation 15 above is

or

or

It may be possible to transform and apply. from above

is the least common multiple of a and b.

Up to step 1-2 above, the information bits to be transmitted in the allocated resource are obtained, and in step 1-3, the number of bits added for CRC is excluded from the previously obtained information bits to be transmitted. This can be determined by pseudo-code 3 below.

[pseudo-code 3]

[start]

If R ≤ R ₁ ,

, then TBS = B - L_TB,16 If B ≤

, then TBS = B - L _TB,16

Else TBS = B - L _TB,24 - C× L _CB

End if of B

Else

, then TBS = B - L_TB,16 If B ≤

, then TBS = B - L _TB,16

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

, then TBS = B - L _TB,24

Else TBS = B - L _TB,24 - C× L _CB

End if of B

End if R

[end]

If the values of each variable are determined and applied as described above, it is possible to apply [pseudo-code 3] as the following [pseudo-code 4], but may not be 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 R

[end]

In the above, since the CRC length applied to TB may vary depending on the size of TBS, L _TB,16 and L _TB,24 were considered, and when the number of code blocks is 1, the CRC added to CB can be omitted or added to CB It may be applied considering that the CRC length may be 0. As another example, steps 1-3 may be modified and applied as [pseudo-code 5] or [pseudo-code 6] as follows.

[pseudo-code 5]

[start]

, then TBS = B - L_TB,16 If B ≤

, 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]

In [pseudo-code 5] or [pseudo-code 6], the CRC length added to the CB is not excluded when calculating the final TBS. Therefore, when actual data is mapped and transmitted later, the actual code rate can be greater than R because the CRC length of the CB can be added to the calculated TBS.

Finally, in step 1-4, the final TBS is determined by considering the maximum TBS size supported by the terminal based on the temporary TBS value calculated up to step 1-3. Let's assume that the TBS calculated in steps 1-3 is TBS _temp . Let the maximum TBS size supported by the terminal be TBS _UE,max in the present invention. TBS _UE,max may be defined differently for each UE category, or the terminal may transmit it to the base station with its own capability, or the base station may transmit it to the terminal through higher signaling, or it may be determined by a combination of the above methods. As an example, [Table 7] below is a table defining the categories of the terminal, and in the table below, the value presented in the column marked “Maximum number of bits of a DL-SCH transport block received within a TTI” indicates that the terminal receives a transport block It can be the size value of the maximum possible TBS.

[Table 7]

The final TBS in this step 1-4 can be determined as shown in [Equation 16] below.

[Equation 16]

Final TBS = min(TBS _temp , TBS _UE,max )

In the above, min(x,y) means a smaller value among x and y values. Alternatively, it may be expressed as [pseudo-code 7] below.

[pseudo-code 7]

[start]

If TBS _temp < TBS _UE,max , final TBS = TBS _temp

Else final TBS = TBS _UE,max

[end]

Alternatively, in the TBS calculated up to steps 1-3, if TBS _UE,max is smaller than TBS _UE,max, it may be determined by replacing TBS with .

7 is a flowchart illustrating steps in which a base station and a terminal calculate TBS and transmit/receive data when scheduling and transmitting downlink or uplink data. When the scheduling and data transmission process starts (700), the base station determines scheduling information (702), and transmits the scheduling information to the terminal in a combination of one or more of DCI, system information, MAC CE, and RRC signaling (704). A temporary TBS is calculated from the determined scheduling information (706). At 706, 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 combined and performed simultaneously, or may be performed in reverse order. Based on the temporary TBS calculated above, the final TBS is determined in consideration of the maximum TBS supported by the terminal (708), which becomes steps 1-4 described above. Subsequently, using the calculated TBS, CB division and channel coding/decoding/retransmission operations are performed (710), and data scheduling and transmission may be finished (712).

The TBS determination method provided in the above embodiment can be limitedly applied only when the base station and the terminal do not have a specific combination of the MCS index and the number of assigned PRBs pre-promised. For example, if scheduling is determined by MCS index 6 and the number of PRBs is 1 at this time, TBS may be determined and transmitted as a fixed value of 328 instead of the above method. Therefore, the base station and the terminal may pre-determine and know the values of TBS to be used according to the combination of {MCS index or code rate index, number of PRBs}, and TBS can be determined by the method provided in the above embodiment only in cases other than the above combination. can

The TBS determination method in this embodiment applies only to the case of initial transmission, and in the case of retransmission, transmission and reception can be performed assuming the TBS determined in the initial transmission of the retransmission.

With the method of this embodiment, the terminal can receive data corresponding to the maximum TBS value that it can support, and can be guaranteed to receive data at the maximum transmission rate.

Steps 1-1, 1-2, and 1-3 in this embodiment do not need to be limited to the methods presented above, and may be modified and applied to other methods for calculating temporary TBS.

[Example 1-1]

Embodiment 1-1 provides a TBS determination method considering the maximum TBS size supported by a terminal.

The terminal receives control information including scheduling information, and checks resource allocation and MCS values included in the control information. The MCS value may mean a modulation order and a code rate. If the maximum frequency band that can be allocated for resource allocation is allocated and the MCS value corresponds to the highest modulation order and highest code rate, the UE assumes TBS as the maximum TBS value supported by itself instead of calculating TBS and data data You can either receive or transmit data.

The base station transmits control information including scheduling information to the terminal for data transmission and reception. By checking the resource allocation and MCS value included in the control information, if the maximum frequency band allocated to the corresponding terminal is allocated and the MCS value corresponds to the highest modulation order and highest code rate, the base station transmits Instead of calculating the TBS value, which is the amount of data, data transmission and reception may be performed by assuming TBS as the maximum TBS value supported by the corresponding terminal. The MCS value may mean a modulation order and a code rate.

[Second Embodiment]

을 결정하는 방법 및 장치를 제공한다.In the second embodiment, parameters for determining a buffer for rate matching in downlink data transmission

A method and apparatus for determining are provided.

은 하기 방법1, 방법2, 방법3 혹은 방법4으로 결정될 수 있을 것이다. 본 실시예에서 레이트 매칭에 제약이 생긴다고 함은, 레이트 매칭에 있어서 똑 같은 정보를 담은 비트가 두 번 이상 매핑되어 전송됨을 의미할 수 있다. 혹은 레이트 매칭에 제약이 생기는 경우는 LBRM(limited buffer rate matching)이 걸린 경우라고 할 수 있을 것이다.

may be determined by Method 1, Method 2, Method 3 or Method 4 below. In this embodiment, that rate matching is restricted may mean that bits containing the same information are mapped and transmitted two or more times in rate matching. Alternatively, if there is a restriction in rate matching, it can be said that LBRM (limited buffer rate matching) is applied.

이 하기 [수학식 17]로 결정될 수 있을 것이다. in method 1

This may be determined by [Equation 17] below.

[Equation 17]

은 초기 전송에서 전송되는 코딩된 비트 혹은 전송되는 자원 수에 modulation order를 곱한 값이 될 수 있다. 본 방법1을 적용함으로써, 초기 전송에서는 데이터의 레이트 매칭이 제약이 생기는 경우가 없도록 함일 수 있다. 상기에서 N은 정수일 필요는 없을 것이다. In the above, N may be determined by being fixed to a value such as 1 or 2, or it may be delivered to the terminal through signaling from a higher level.

may be a value obtained by multiplying the number of coded bits transmitted in the initial transmission or transmitted resources by the modulation order. By applying the method 1, in the initial transmission, rate matching of data may not be restricted. In the above, N will not need to be an integer.

이 하기 [수학식 18]로 결정될 수 있을 것이다. in method 2

This may be determined by [Equation 18] below.

[Equation 18]

In the above, N may be determined by being fixed to a value such as 1 or 2, or it may be delivered to the terminal through signaling from a higher level. Alternatively, it may be the reciprocal of the code rate of the H matrix to which channel coding is applied. TBS may be the size of a transmitted data transport block. By applying the present method 2, in the initial transmission, rate matching of data may not be restricted. In the above, N will not need to be an integer.

이 하기 [수학식 19]로 결정될 수 있을 것이다. in method 3

This may be determined by [Equation 19] below.

[Equation 19]

는

을 계산하기 위한 기준 TBS 값일 수 있다. 상기

는 해당 단말이 지원하는 최대 TBS 크기로 약속될 수 있거나 혹은 상위에서 전달되는 값일 수 있다.

는

을 계산하기 위한 기준 코드레이트 값일 수 있다. 상기

는 해당 단말이 지원하는 코드 레이트 중에서 하나로 약속될 수 있다. 혹은 상기 TBS가 채널코딩될 때 사용된 BG에 따라 결정될 수 있을 것이다. 일례로, BG#1의 LDPC 코드로 전송되었다면 2/3, BG#2의 LDPC 코드로 전송되었다면 2/5로 결정될 수 있을 것이다. 본 방법3을 적용함으로써, 특정 TBS를 기준으로 그 이하의 TBS에 대해서는 초기 전송 혹은 첫 번째 재전송까지는 데이터의 레이트 매칭이 제약이 생기는 경우가 없도록 함일 수 있다.from above

Is

It may be a reference TBS value for calculating . remind

may be promised as the maximum TBS size supported by the corresponding terminal or may be a value transmitted from above.

Is

It may be a reference code rate value for calculating . remind

can be promised to one of the code rates supported by the corresponding terminal. Alternatively, it may be determined according to the BG used when the TBS is channel-coded. For example, if it is transmitted with the LDPC code of BG#1, it may be determined as 2/3, and if it is transmitted with the LDPC code of BG#2, it may be determined as 2/5. By applying the present method 3, it may be possible to ensure that there is no restriction in rate matching of data until the initial transmission or the first retransmission for a TBS lower than a specific TBS.

이 하기 [수학식 20]으로 결정될 수 있을 것이다. Method 4 is a combination of Method 1, Method 2, or Method 3 provided above, and can be provided with the minimum value among the values determined in the methods,

This may be determined by [Equation 20] below.

[Equation 20]

은 초기 전송에서 전송되는 코딩된 비트 혹은 전송되는 자원 수에 modulation order를 곱한 값이 될 수 있다. 상기에서

는

을 계산하기 위한 기준 TBS 값일 수 있다. 상기

는 해당 단말이 지원하는 최대 TBS 크기로 약속될 수 있거나 혹은 상위에서 전달되는 값일 수 있다.

는

을 계산하기 위한 기준 코드레이트 값일 수 있다. 상기

는 해당 단말이 지원하는 코드 레이트 중에서 하나로 약속될 수 있다. 혹은 상기 TBS가 채널코딩될 때 사용된 BG에 따라 결정될 수 있을 것이다. 일례로, BG#1의 LDPC 코드로 전송되었다면 2/3, BG#2의 LDPC 코드로 전송되었다면 2/5로 결정될 수 있을 것이다. 본 방법4를 사용함으로써, 최대한 단말이 소프트버퍼의 크기를 작게 설정할 수 있으면서도 초기 전송에서는 최대한 레이트 매칭에 제약이 안 걸리는 경우가 되도록 할 수 있을 것이다. In the above, min(a, b) means a smaller value between a and b. In the above, N may be determined by being fixed to a value such as 1 or 2, or it may be delivered to the terminal through signaling from a higher level.

may be a value obtained by multiplying the number of coded bits transmitted in the initial transmission or transmitted resources by the modulation order. from above

Is

It may be a reference TBS value for calculating . remind

may be promised as the maximum TBS size supported by the corresponding terminal or may be a value transmitted from above.

Is

It may be a reference code rate value for calculating . remind

can be promised to one of the code rates supported by the corresponding terminal. Alternatively, it may be determined according to the BG used when the TBS is channel-coded. For example, if it is transmitted with the LDPC code of BG#1, it may be determined as 2/3, and if it is transmitted with the LDPC code of BG#2, it may be determined as 2/5. By using the present method 4, the terminal can set the size of the soft buffer as small as possible, and it will be possible to make the case where rate matching is not restricted as much as possible in the initial transmission.

을 계산하여 단말은 하나의 전송블록에 대해

비트에 해당하는 만큼의 소프트 버퍼 메모리를 점유하여 송수신 성능을 올릴 수 있을 것이다. provided in this example

By calculating , the terminal for one transport block

By occupying the soft buffer memory as much as the number of bits, transmission/reception performance can be increased.

를 이용하여 하기의 [수학식 21]과 같이

가 계산될 수 있다.provided above

As shown in [Equation 21] below using

can be calculated.

[Equation 21]

값은 정보비트를 채널코딩으로 인코딩하여 생성된 모든 패리티가 더해진 비트수이며, LTE의 경우라고 가정하면 정보비트의 약 3배가 될 수 있다. C는 전송하고자 하는 전송블록을 송수신하기 위해 필요한 코드블록의 수이다. 이후에 레이트 매칭은 하기 [pseudo-code 7]와 같이 수행될 수 있을 것이다.from above

The value is the number of bits to which all parities generated by encoding the information bits with channel coding are added, and assuming that this is the case of LTE, it can be about three times the information bits. C is the number of code blocks required to transmit and receive a transport block to be transmitted. Afterwards, rate matching may be performed as in [pseudo-code 7] below.

[pseudo-code 7]

[start]

Denoting by E the rate matching output sequence length for the r -th coded block, and rv _idx the redundancy version number for this transmission ( rv _idx = 0, 1, 2 or 3), the rate matching output bit sequence is e _k , k = 0,1, ..., E-1.

Define by G the total number of bits available for the transmission of one transport block. Here, G can be said to be the number of resources to which data is mapped.

where Q _m is equal to 2 for QPSK, 4 for 16QAM, 6 for 64QAM and 8 for 256QAM, and whereSet

where Q _m is equal to 2 for QPSK, 4 for 16QAM, 6 for 64QAM and 8 for 256QAM, and where

-For transmit diversity:

- N _L is equal to 2,

- Otherwise:

- N _L is equal to the number of layers a transport block is mapped onto

, 여기에서 C는 해당 데이터 전송을 위해 필요한 코드블록 수 Set

, where C is the number of code blocks required to transmit the data.

if

set

else

set

end if

- Here, k ₀ can be considered as a rate matching starting point determined by the RV value, and this value may be a value that is pre-promised and known to the base station and the terminal.

Set k = 0 and j = 0

while { k < E }

if

k = k + 1

end if

j = j +1

end while

[end]

를 수행함으로써

에 의해 레이트 매칭에 제약이 생기는 것으로 볼 수 있고, [수학식 21]과 같이

는

에 의해 영향을 받을 수 있으므로, 이는 결국

에 의해 레이트 매칭에 제약이 생기는 것으로 볼 수 있다. In [pseudo-code 7], w _j means the j th bit among the values to which all parity bits are added after the r th code block is encoded, and e _k is the rate matched k after the r th code block is encoded. means the second bit.

by doing

It can be seen that rate matching is restricted by , and as shown in [Equation 21]

Is

can be affected by

It can be seen that there is a restriction in rate matching due to .

가 구해진 이후의 레이트 매칭 과정의 일례이며 상기 [pseudo-code 7]에 제한될 필요는 없을 것이다.The above [pseudo-code 7] is

This is an example of a rate matching process after .

Although this embodiment has been described in the case of downlink data transmission, it may also be applied to uplink data transmission.

[Third Embodiment]

을 결정하는 방법 및 장치를 제공한다.In the third embodiment, in a terminal configured to be able to schedule with a short TTI or a TTI length of a slot or subslot in an LTE system, parameters for determining a buffer for rate matching when scheduling with a short TTI or subslot

A method and apparatus for determining are provided.

Based on a frequency division duplexing (FDD) system, conventional LTE systems perform transmission and reception based on subframes of 1 ms. However, a method in which the terminal monitors the control channel in units of 2 symbols, 3 symbols, or 7 symbols, transfers scheduling information, and transmits/receives data may be used.

8 and 9 are diagrams illustrating examples of structures of sTTI having a length of 2 symbols or 3 symbols in downlink. 8 shows sTTI 0 (804), sTTI 1 (806), sTTI 2 (808), sTTI 3 (810) by dividing 14 symbols in one subframe 802 by 2, 3, 2, 2, 2, 3 symbols, respectively. ), sTTI 4 (812), and sTTI 5 (816) are mapped. The sTTI pattern of FIG. 8 is applied when the conventional LTE PDCCH is mapped to 2 OFDM symbols. 9 shows sTTI 0 (904), sTTI 1 (906), sTTI 2 (908), and sTTI 3 (910) by dividing 14 symbols in one subframe 902 into 3, 2, 2, 2, 2, 3 symbols, respectively. ), sTTI 4 (912), and sTTI 5 (916) are mapped. The sTTI pattern of FIG. 9 is applied when the conventional LTE PDCCH is mapped to 1 or 3 OFDM symbols.

10 is a diagram showing an example of a structure of sTTI having a length of 2 symbols or 3 symbols in uplink. sTTI 0 (1004), sTTI 1 (1006), sTTI 2 (1008), sTTI 3 (1010), sTTI 4 (1012) and sTTI 5 (1016) are mapped.

11 is a diagram showing an example of a structure of sTTI having a length of 7 symbols in downlink and uplink. sTTI 0 (1104) and sTTI 1 (1106) are mapped to 7 symbols and 7 symbols of 14 symbols in one subframe 1102, respectively.

The shortened-TTI transmission described below may be referred to as first-type transmission, and the normal-TTI transmission may be referred to as second-type transmission. The first type transmission is a method in which a control signal, a data signal, or a control and data signal is transmitted in a period shorter than 1 ms, and a second type transmission is a method in which a control signal, a data signal, or a control and data signal is transmitted in a period shorter than 1 ms. the way it is transmitted. Meanwhile, hereinafter, shortened-TTI transmission and first-type transmission are used together, and normal-TTI transmission and second-type transmission are used together. The first type terminal may support both the first type transmission and the second type transmission, or may support only the first type transmission. The second type terminal supports the second type transmission and cannot perform the first type transmission. In the present invention, for convenience, the term "for a first-type terminal" may be interpreted as being for a first-type transmission. If normal-TTI and longer-TTI exist instead of shortened-TTI and normal-TTI, normal-TTI transmission may be referred to as first-type transmission and longer-TTI transmission may be referred to as second-type transmission. In the present invention, first-type reception and second-type reception may refer to a process of receiving first-type transmission and second-type transmission signals, respectively.

Unless otherwise noted below, a terminal configured for shortened-TTI transmission may be referred to as a first-type terminal, and a normal-TTI terminal without shortened-TTI transmission may be referred to as a second-type terminal. The first type terminal may include a terminal capable of transmitting control information, data, or control information and data in a transmission time interval of 1 ms or shorter than 1 ms, and the second type terminal is capable of transmitting control information in a transmission time interval of 1 ms. It may include a terminal capable of transmitting information, data, or control information and data. Meanwhile, hereinafter, a shortened-TTI terminal and a first-type terminal are used together, and a normal-TTI terminal and a second-type terminal are used together. Also, in the present invention, shortened-TTI, shorter-TTI, shortened TTI, shorter TTI, short TTI, and sTTI are used interchangeably with the same meaning. In addition, in the present invention, normal-TTI, normal TTI, subframe TTI, and legacy TTI have the same meaning and are used interchangeably.

In the present invention, a transmission time interval in downlink may mean a unit in which a control signal and a data signal are transmitted, or a unit in which a data signal is transmitted. For example, in the downlink of the existing LTE system, the transmission time interval becomes a subframe that is a time unit of 1 ms. Meanwhile, in the present invention, a transmission time interval in uplink may mean a unit in which a control signal or a data signal is transmitted, or a unit in which a data signal is transmitted. A transmission time period in the uplink of the existing LTE system is a subframe that is a time unit of 1 ms, which is the same as that of the downlink.

In addition, in the present invention, the shortened-TTI mode is when the terminal or base station transmits and receives a control signal or data signal in units of shortened TTI, and the normal-TTI mode is when the terminal or base station transmits and receives a control signal or data signal in units of subframes. am.

Also, in the present invention, shortened-TTI data means data transmitted on a PDSCH or PUSCH transmitted and received in units of shortened TTIs, and normal-TTI data means data transmitted on a PDSCH or PUSCH transmitted and received in units of subframes. In the present invention, the downlink control channel for shortened-TTI means a physical channel through which control signals for operation in the shortened-TTI mode are transmitted, and is referred to as sPDCCH. signifies. For example, the downlink control channel for normal-TTI may be PCFICH, PHICH, PDCCH, EPDCCH, etc. in the existing LTE system. Similarly, in the present invention, the uplink control channel for shortened-TTI may be called sPUCCH, and may include one or more of HARQ-ACK/NACK information, channel status information, and scheduling request information of data transmitted through downlink. .

In the present invention, the terms of a physical channel and a signal in a conventional LTE or LTE-A system may be used interchangeably with data or control signals. For example, PDSCH is a physical channel through which normal-TTI data is transmitted, but in the present invention, PDSCH can be referred to as normal-TTI data, and sPDSCH is a physical channel through which shortened-TTI data is transmitted. However, in the present invention, sPDSCH is shortened -This can be referred to as TTI data. Similarly, in the present invention, shortened-TTI data transmitted in downlink and uplink are referred to as sPDSCH and sPUSCH.

As described above, the present invention defines a transmission/reception operation between a shortened-TTI terminal and a base station, and proposes a specific method for operating an existing terminal and a shortened-TTI terminal together in the same system. In the present invention, a normal-TTI terminal refers to a terminal that transmits and receives control information and data information in units of 1 ms or one subframe. The control information for the normal-TTI UE is transmitted on a PDCCH mapped to up to 3 OFDM symbols in one subframe or on an EPDCCH mapped to a specific resource block in an entire subframe. A shortened-TTI terminal refers to a terminal that may transmit/receive in units of subframes like a normal-TTI terminal or may transmit/receive in units smaller than a subframe. Alternatively, it may be a terminal supporting only transmission and reception of a unit smaller than a subframe.

이 하기 [수학식 22]와 같이 결정되었다. 상기에서

는 8로 고정되어 있다. In a conventional LTE system using a subframe of 1 ms as a TTI,

This was determined as in [Equation 22] below. from above

is fixed at 8.

[Equation 22]

로

를 대신하여 사용하는 것이 가능할 것이다. When the terminal for which Short TTI is set receives scheduling with short TTI, it is calculated as shown in [Equation 23] below.

as

It will be possible to use instead of

[Equation 23]

는 16으로 미리 약속되어 사용될 수 있다. 상기 값 16은 예시이며 이에 한정될 필요는 없을 것이다.

는 혹은 상위 시그널링으로 단말에게 설정되는 값일 수 있다. from above

is pre-promised to 16 and can be used. The value 16 is an example and will not need to be limited thereto.

may be a value set to the terminal through higher signaling.

을 이용하여 레이트 매칭을 수행한다. 만약 slot 혹은 subslot 등의 short TTI로 스케줄링이 되었다면, (1212)와 같이 상기 [수학식 23]에서 제시하는 방법으로 결정되는

을 이용하여 레이트 매칭을 수행한다. 혹은 [수학식 22]에서

대신

를 사용하거나

가 slot 혹은 subslot 등의 short TTI로 스케줄링된 경우 혹은 sPDSCH (short TTI로 전송되는 데이터 채널)의 경우에는 16으로 정의될 수 있다. 혹은 2 혹은 3심볼의 sTTI 혹은 subslot 전송이 설정된 단말에게, sPDSCH와 관련된 DL-SCH (downlink shared channel)에 있어서는,

=16으로 정의되어

계산에 사용되고, 그 이외의 경우에는

=8으로 정의되어

계산에 사용된다. 이는 2 혹은 3심볼의 sTTI 혹은 subslot 전송이 설정된 단말이 과도하게 큰 크기의 소프트버퍼가 없이도 동작할 수 있도록 하기 위함일 수 있다. 상기에서는 sTTI용

를 16으로 제시하였지만, 이에 한정되지 않고 8보다 큰 값이면 적용될 수 있을 것이다. 이에 따르는 기지국 및 단말의 동작은 도13에 도시되어 있다. 12 is a flowchart illustrating a method of rate matching in a data transmission/reception process in a terminal for which a short TTI is set. At 1200, data scheduling and transmission/reception steps begin. The base station configures the terminal to enable short TTI transmission, the base station determines scheduling information, and the terminal checks the scheduling information transmitted from the base station (1202, 1204, 1206). The scheduling information may include MCS, modulation order, coding rate or code rate, resource allocation information, number of layers, and the like, and may be transmitted through a physical control channel and higher signaling. The base station and the terminal check whether the scheduling is performed in short TTI such as slot or subslot (1208). If it is scheduled in a subframe of 1 ms unit, it is determined by the method presented in [Equation 22] as shown in (1210)

Rate matching is performed using If it is scheduled by short TTI such as slot or subslot, it is determined by the method presented in [Equation 23] as shown in (1212)

Rate matching is performed using Or in [Equation 22]

instead

or use

In the case of scheduling with short TTI such as slot or subslot, or in the case of sPDSCH (data channel transmitted with short TTI), it can be defined as 16. Or, in a downlink shared channel (DL-SCH) related to sPDSCH to a UE configured for sTTI or subslot transmission of 2 or 3 symbols,

=16 is defined as

used in calculations, and in other cases

= 8 is defined as

used in calculations This may be for the purpose of allowing a terminal configured for sTTI or subslot transmission of 2 or 3 symbols to operate without an excessively large soft buffer. In the above, for sTTI

Although presented as 16, it is not limited thereto and any value greater than 8 may be applied. Operations of the base station and the terminal according to this are shown in FIG.

[Fourth Embodiment]

A fourth embodiment provides a method and apparatus for selecting a base-graph of an LDPC code in downlink data transmission and reception.

As described above, the base station and the terminal must determine which base-graph to perform channel coding and decoding by selecting one of two base-graphs, that is, BG#1 and BG#2, in the LDPC code.

When performing downlink scheduling, the base station transmits control information including 1 bit of base-graph information to the terminal, and the terminal decodes assuming a DCI format including 1 bit of base-graph information when decoding the corresponding control information, The base-graph type can be known from the control information, and decoding is performed using the base-graph indicated by the control information.

The method may be to ensure base-graph information during retransmission compared to when the base-graph is determined only by the code rate and TBS by transmitting the base-graph information in the control information (DCI). However, since there is no case of retransmission when data including system information is transmitted, there is no need to include base-graph information in control information and transmit it. Accordingly, it is possible to determine whether to include base-graph information in control information for scheduling the corresponding data according to the type of downlink data to be transmitted.

For example, base-graph information is included in DCI for scheduling data delivered only to specific terminals, but base-graph information may not be included in DCI for scheduling data delivered to multiple terminals. In the above, data transmitted to various terminals may include system information.

16 is a diagram showing whether a BG indication is included according to the type of RNTI masked in the CRC. DCI (1602) masked with C-RNTI includes BG indication (1606), but DCI (1604) masked with SI-RNTI does not include BG identification, but instead is padded with 0 (1610) if necessary, DCI is configured. do. In the present invention, the fact that the RNTI is masked in the CRC means that some or all of the bits of the RNTI and the CRC (1608, 1612), bit by bit, XOR operation or modula 2 addition or addition and then determining the remainder after dividing by 2 (1614 , 1616). This can be described as follows using conditions in the process of explaining DCI. In the present invention, base-graph information may be delivered through a base-graph indicator.

[Start DCI format description]

[DCI format x]

…

BG indication - 0 or 1 bit. This bit field exists as 1 bit only when DCI is masked with C-RNTI and transmitted.

[End of DCI format description]

In the present invention, the classification of the transmission method to a specific terminal has been described as C-RNTI, but it is possible to classify according to the type of search space or CORESET. For example, a DCI mapped to a common search space may not include base-graph information, and a DCI mapped to a UE specific search space may include base-graph information. In addition, a DCI mapped to a CORESET commonly set for multiple terminals may not include base-graph information, and a DCI mapped to a CORESET set for a specific terminal may include base-graph information.

17 and 18 are diagrams illustrating operations of a terminal and a base station. As a more specific example, when the terminal performs control information decoding and CRC check (1702), it determines whether base-graph information is included in the control information according to the type of RNTI masked to the CRC (1708) (1710, 1712) Thus, the control information can be decoded. For example, when the terminal performs control information decoding (1702) and performs a CRC check, masking is performed with C-RNTI to pass the CRC check, knowing that base-graph information is present in the corresponding DCI and corresponding base-graph information. Graph information is checked (1712), and if masking is performed with SI-RNTI and the CRC check is passed, it is assumed that there is no base-graph information in the corresponding DCI and the remaining DCI information is checked (1710). When configuring control information (1802), the base station determines whether the control information is transmitted only to the corresponding terminal (1808), and if the control information is transmitted only to a specific terminal, configures the control information including the base-graph indicator (1812). ), if the control information is transmitted to several terminals, the DCI is configured without including the base-graph indicator (1810). The base station transmits data according to the control information determined above (1814).

[Fifth Embodiment]

The fifth embodiment provides a method and apparatus for operating a base station and a terminal when a base-graph indicator of an LDPC code is included in control information in downlink and uplink data transmission and reception and corresponding data scheduling.

When the terminal decodes the downlink control information, when the corresponding control information is for retransmission and the base-graph indicator included in the control information is different from the base-graph indicator included in the control information for initial transmission, the terminal in the initial transmission HARQ combining of the received data and the data received in retransmission is not performed, and decoding of the corresponding transport block is performed using only the data received in retransmission. For example, in the control information of the initial transmission of a specific transport block, the base-graph indicator points to BG#1, but even in the control information of the retransmission of the transport block, if the base-graph indicator points to BG#1, the terminal performs HARQ combing Try to decode by performing On the other hand, in the control information of the initial transmission of a specific transport block, the base-graph indicator points to BG#1, but even in the control information of the retransmission of the transport block, if the base-graph indicator points to BG#2, the terminal does not perform HARQ combing. Instead, decoding is attempted using only the data received in retransmission. A detailed example is illustrated in FIGS. 19 and 20, respectively, of the operation of the terminal for transmitting and receiving downlink and uplink data.

[Sixth Embodiment]

The sixth embodiment provides a TBS determination method according to CB-CRC and BG selection. In this embodiment, in a specific case, when the TBS is large, it may be applied to the case where it is divided into two or more code blocks and each code block is channel-coded with an LDPC code using BG#2 and transmitted. That is, it can be applied when it is possible to transmit using BG#2 even when the TBS is large. In this embodiment, R_1 and R_2 may indicate code rates that are criteria for selecting BG#1 or BG#2 of LDPC, and may be used interchangeably with R ₁ and R ₂ , respectively. For example, R ₁ =1/4 R ₂ =2/3, but the method provided by the present invention is not limited any more. In addition, R, which is referred to as a code rate in the present invention, and R ₁ and R ₂ may be expressed and determined in various ways such as fractions and decimals. When selecting a BG among BG#1 and BG#2 during data transmission, code rate, soft buffer of the terminal, etc. may be considered. In this embodiment, it may be characterized in that a process for adjusting TBS to a multiple of 8 or a multiple of the number of CBs, or a common multiple or least common multiple of 8 and the number of CBs is performed at the end of the TBS calculation.

The base station may transmit data by allocating frequency resources of an arbitrary number of PRBs and time resources of an arbitrary number of slots or symbols to the terminal, and the related scheduling information is transmitted in downlink control information (DCI) or higher signaling. It can be delivered to the terminal with the configured setting or a combination thereof. When the base station and the terminal are given scheduling information, the TBS may be determined in the following order.

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

- Step 2: Determine the number of temporary CBs (C) using the determined A, and accordingly, the value obtained by adding the length of TB-CRC to TBS is byte alignment (process of making it a multiple of 8) and the number of temporary CBs. Adjusting Rock A to determine TBS

), 할당된 PRB 혹은 RB 수(#PRB), 할당된 OFDM 심볼수, 할당된 슬롯수, 한 PRB내에서 매핑되는 RE 수의 기준값 중 하나 이상의 조합으로 임시 정보 비트수를 결정할 수 있다. 예컨대 A는 상기 수학식 10인

에 의해 결정될 수 있다. 상기에서 modulation order인 Qm과 code rate인 R은 DCI에서 포함되어 단말에게 전달될 수 있다. 전송될 때 사용되는 레이어 수

는 DCI 혹은 상위 시그널링 혹은 둘의 조합으로 단말에게 전달될 수 있다. 상기에서

는 기지국이 데이터가 전송될 때 rate matching으로 매핑되는 RE 수를 이용하여 결정될 수 있으며, 자원할당 정보를 기지국과 단말이 서로 알고 있을 때 상기

는 기지국과 단말이 동일하게 이해할 수 있다.

를 계산할 때, rate matching 방식으로 데이터가 매핑되기로 하였으나, CSI-RS 혹은 URLLC 혹은 UCI 전송 등 특별한 이유로 데이터가 puncturing되어 실제로는 매핑되지 않는 RE도

에 포함되도록 계산되어진다. 이는 기지국이 단말에게 알리지 않고 임의로 매핑하기로 했던 데이터의 일부를 puncturing 방식으로 전송하지 않았을 때에도 기지국과 단말이 TBS를 동일하게 이해할 수 있도록 하기 위함일 수 있다. 혹은

는 실제 가용한 RE수를 이용하여 계산한 값이 될 수 있다. 상기 계산에는 quantization이 포함될 수 있다. 일례로 단말에게 MCS index를 전달하여 Qm과 R에 대한 정보를 전달할 수 있다. 상기에서 modulation order는 QPSK, 16QAM, 64QAM, 256QAM, 1024QAM 등의 정보를 의미하며, QPSK의 경우 Qm=2, 16QAM의 경우 Qm=4, 64QAM의 경우 Qm=6, 256QAM의 경우 Qm=8, 1024QAM의 경우 Qm=10이 될 수 있다. 즉, Qm은 modulation된 심볼에서 전달 가능한 비트수를 의미할 수 있다. 상기 일례에서는 5비트의 MCS index로 Qm과 R을 함께 전달하였지만, 이는 6비트 MCS index로 DCI에서 전달될 수 있거나, 혹은 3비트의 Qm과 3비트의 R이 각각 비트필드에서 전달되는 등 다양한 방법으로 단말에게 전달될 수 있다. 혹은 A= (할당된 PRB 수) x (1 PRB당 기준 RE 수) X

로 결정될 수 있다. In step 1, a temporary TBS value is determined in consideration of the amount of resource regions to which data to be sent can be mapped. This is code rate (R), modulation order (Qm), and the number of REs mapped by rate matching (

), the number of allocated PRBs or RBs (#PRB), the number of allocated OFDM symbols, the number of allocated slots, and the reference value of the number of REs mapped in one PRB. For example, A is Equation 10

can be determined by In the above, the modulation order, Qm, and the code rate, R, may be included in DCI and delivered to the UE. The number of layers used when transferring

may be delivered to the terminal through DCI or higher signaling or a combination of the two. from above

can be determined using the number of REs mapped by rate matching when the base station transmits data, and when the base station and the terminal know resource allocation information, the

can be equally understood by the base station and the terminal.

When calculating , data is decided to be mapped in a rate matching method, but data is punctured for special reasons such as CSI-RS, URLLC, or UCI transmission, so REs that are not actually mapped

is calculated to be included in This may be done so that the base station and the terminal can equally understand the TBS even when the base station does not transmit part of the data to be mapped arbitrarily in a puncturing manner without notifying the terminal. or

may be a value calculated using the number of actually available REs. The calculation may include quantization. For example, information on Qm and R may be delivered by delivering an MCS index to the UE. In the above, the modulation order means information such as QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, etc. In case of QPSK, Qm = 2, in case of 16QAM, Qm = 4, in case of 64QAM, Qm = 6, in case of 256QAM, Qm = 8, 1024QAM In the case of can be Qm = 10. That is, Qm may mean the number of bits that can be delivered in a modulated symbol. In the above example, Qm and R are transmitted together as a 5-bit MCS index, but this can be transmitted in DCI as a 6-bit MCS index, or in various ways such as 3-bit Qm and 3-bit R are transmitted in bitfields respectively. can be delivered to the terminal. or A= (Number of allocated PRBs) x (Number of reference REs per PRB) X

can be determined by

Step 2 may be performed as [pseudo-code 8] or [pseudo-code 9] below.

[pseudo-code 8]

[start]

If R ≤ R ₁ ,

, If A ≤

,

.C=1 and TBS =

.

Else

TBS =

End if of A

Else

,If A ≤

,

.C=1 and TBS =

.

Else

TBS =

End if of A

End if R

[end]

[pseudo-code 9]

[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 R

[end]

는 3840,

는 8448일 수 있으나 이에 한정되지 않는다. 상기에서 계산한, C는 해당 TB에 포함된 코드블록 개수를 계산한 값일 수 있다. 상기에서 계산한 C가 1보다 크고, 최종적으로 계산된 TBS + CRC길이 값을 최대 코드블록 길이로 나누었을 때의 값보다 작을 경우, 최종적으로 계산된 TBS는

혹은

로 결정될 수 있다. 상기에서 TBS + CRC길이 값을 최대 코드블록 길이로 나누었을 때의 값은 BG#1을 사용하는 LDPC 코드를 적용하는 경우에는

혹은

가 되고, BG#2를 사용하는 LDPC 코드를 적용하는 경우에는

혹은

가 될 수 있다. 본 발명에서

는 코드블록 정보에 추가되는 CRC의 길이이며, 이 값은 24일 수 있다. 본 발명에서

는 TB에 추가되는 CRC의 길이이며, 이 값은 24일 수 있다. 본 발명에서

는 TB에 추가되는 CRC의 길이이며, 이 값은 16일 수 있다. 상기에서의 TBS는 최종 TBS가 아닐 수 있고, 아래와 같은 [pseudo-code 10]이를 통해 최종적으로 TBS 값이 계산될 수 있다. from above

is 3840,

may be 8448, but is not limited thereto. C, calculated above, may be a value obtained by calculating the number of code blocks included in the corresponding TB. If C calculated above is greater than 1 and smaller than the value obtained by dividing the finally calculated TBS + CRC length value by the maximum code block length, the finally calculated TBS is

or

can be determined by In the case of applying the LDPC code using BG#1, the value obtained by dividing the TBS + CRC length value by the maximum code block length is

or

, and when the LDPC code using BG#2 is applied,

or

can be in the present invention

is the length of the CRC added to the code block information, and this value may be 24. in the present invention

is the length of the CRC added to TB, and this value may be 24. in the present invention

is the length of the CRC added to TB, and this value may be 16. The TBS in the above may not be the final TBS, and the TBS value can be finally calculated through the following [pseudo-code 10].

[pseudo-code 10]

[start]

For BG1 LDPC,

,If C <

,

Then, final TBS is

For BG2 LDPC,

,If C <

,

Then, final TBS is

[end]

The above [pseudo-code 10] is to make the number of code blocks C when the number of code blocks differs from the previously calculated C in the process of making TBS with an arbitrary integer multiple including the previously calculated C. can

In order to perform the above embodiments of the present invention, a transmitting unit, a receiving unit, and a processing unit of a terminal and a base station are shown in FIGS. 14 and 15, respectively. From the first embodiment to the third embodiment, a transmission/reception method between the base station and the terminal is shown in order to determine a rate matching method when the base station and the terminal transmit and receive data and perform operations accordingly. To perform this, the base station and the terminal The receiving unit, the processing unit, and the transmitting unit of each should operate according to the embodiment.

Specifically, Fig. 14 is a block diagram showing the internal structure of a terminal according to an embodiment of the present invention. As shown in FIG. 14, the terminal of the present invention may include a terminal receiving unit 1400, a terminal transmitting unit 1404, and a terminal processing unit 1402. The terminal receiving unit 1400 and the terminal transmitting unit 1404 may be collectively referred to as a transmitting/receiving unit in an embodiment of the present invention. The transmitting/receiving unit may transmit/receive signals with the base station. The signal may include control information and data. To this end, the transceiver may include an RF transmitter for up-converting and amplifying the frequency of a transmitted signal, and an RF receiver for low-noise amplifying a received signal and down-converting its frequency. In addition, the transceiver may receive a signal through a wireless channel, output the signal to the terminal processing unit 1402, and transmit the signal output from the terminal processing unit 1402 through a wireless channel. The terminal processing unit 1402 can control a series of processes so that the terminal can operate according to the above-described embodiment of the present invention.

Fig. 15 is a block diagram showing the internal structure of a base station according to an embodiment of the present invention. As shown in FIG. 15, the base station of the present invention may include a base station receiving unit 1501, a base station transmitting unit 1505, and a base station processing unit 1503. The base station receiving unit 1501 and the base station transmitting unit 1505 may collectively be referred to as transceivers in an embodiment of the present invention. The transmission/reception unit may transmit/receive signals with the terminal. The signal may include control information and data. To this end, the transceiver may include an RF transmitter for up-converting and amplifying the frequency of a transmitted signal, and an RF receiver for low-noise amplifying a received signal and down-converting its frequency. In addition, the transceiver may receive a signal through a radio channel, output the signal to the base station processor 1503, and transmit the signal output from the base station processor 1503 through a radio channel. The base station processing unit 1503 can control a series of processes so that the base station can operate according to the above-described embodiment of the present invention.

On the other hand, the embodiments of the present invention disclosed in the present specification and drawings are only presented as specific examples to easily explain the technical content of the present invention and help understanding of the present invention, and are not intended to limit the scope of the present invention. That is, it is obvious to those skilled in the art that other modifications based on the technical idea of the present invention can be implemented. In addition, parts of the above embodiments may be operated in combination with each other as needed. For example, a base station and a terminal can be operated by combining the first embodiment and the second embodiment of the present invention. In addition, although the above embodiments have been presented based on 5G or new radio (NR) or LTE systems, other modifications based on the technical idea of the above embodiments may be implemented in other systems.

Claims (16)

In a method performed by a terminal in a wireless communication system,
Confirming that limited buffer rate matching (LBRM) is set;
encoding information bits to generate encoded bits;
performing rate matching on the coded bits based on the LBRM; and
Transmitting the rate-matched coded bits to a base station;
The size of the circular buffer for the rate matching, N _cb , is

is determined based on, and
TBS _ref is a value of a reference transport block size (TBS) for the LBRM, C is the number of code blocks of the coded bits, and R _ref is a reference code rate for the LBRM Characterized in that How to. According to claim 1,
characterized in that the reference code rate is 2/3. delete According to claim 1,
The size of the circular buffer, N _cb , is determined by the equation below:

,
Here, Kw is the number of bits encoded by low density parity check (LDPC) coding, and
Characterized in that the rate matching is performed based on the size of the circular buffer. In a terminal in a wireless communication system,
Transmitting and receiving unit for transmitting and receiving signals; and
Including a control unit connected to the transceiver,
The control unit,
Check that LBRM (limited buffer rate matching) is set,
Encoding information bits to generate coded bits;
Performing rate matching on the coded bits based on the LBRM;
Set to transmit the rate-matched coded bits to a base station,
The size of the circular buffer for the rate matching, N _cb , is

is determined based on, and
TBS _ref is a value of a reference transport block size (TBS) for the LBRM, C is the number of code blocks of the coded bits, and R _ref is a reference code rate for the LBRM Characterized in that do, terminal. According to claim 5,
Characterized in that the reference code rate is 2/3, the terminal. delete According to claim 5,
The size of the circular buffer, N _cb , is determined by the equation below:

,
Here, Kw is the number of bits encoded by low density parity check (LDPC) coding, and
Characterized in that the rate matching is performed based on the size of the circular buffer. In a method performed by a base station in a wireless communication system,
Confirming that limited buffer rate matching (LBRM) is set;
encoding information bits to generate encoded bits;
performing rate matching on the coded bits based on the LBRM; and
Transmitting the rate-matched coded bits to a terminal,
The size of the circular buffer for the rate matching, N _cb , is

is determined based on, and
TBS _ref is a value of a reference transport block size (TBS) for the LBRM, C is the number of code blocks of the coded bits, and R _ref is a reference code rate for the LBRM Characterized in that How to. According to claim 9,
characterized in that the reference code rate is 2/3. delete According to claim 9,
The size of the circular buffer, N _cb , is determined by the equation below:

,
Here, Kw is the number of bits encoded by low density parity check (LDPC) coding, and
Characterized in that the rate matching is performed based on the size of the circular buffer. In a base station in a wireless communication system,
Transmitting and receiving unit for transmitting and receiving signals; and
Including a control unit connected to the transceiver,
The control unit,
Check that LBRM (limited buffer rate matching) is set,
Encoding information bits to generate coded bits;
Performing rate matching on the coded bits based on the LBRM;
Set to transmit the rate-matched coded bits to a terminal,
The size of the circular buffer for the rate matching, N _cb , is

is determined based on, and
TBS _ref is a value of a reference transport block size (TBS) for the LBRM, C is the number of code blocks of the coded bits, and R _ref is a reference code rate for the LBRM Characterized in that Do, base station. According to claim 13,
Characterized in that the reference code rate is 2/3, the base station. delete According to claim 13,
The size of the circular buffer, N _cb , is determined by the equation below:

,
Here, Kw is the number of bits encoded by low density parity check (LDPC) coding, and
The base station, characterized in that the rate matching is performed based on the size of the circular buffer.

Images