Patent Description:
To meet the demand for wireless data traffic having increased since the deployment of <NUM> communication systems, efforts have been made to develop an improved <NUM> or pre-<NUM> communication system. Therefore, the <NUM> or pre-<NUM> communication system is also called a "beyond <NUM> network" or a "post long term evolution (LTE) system. " A <NUM> communication system is considered to be implemented in high frequency (mmWave) bands, e.g., <NUM> bands, so as to accomplish high data rates. To decrease propagation loss of radio waves and increase transmission distance, beamforming, massive multiple-input multiple-output (MIMO), full dimensional MIMO (FD-MIMO), array antenna, analog beam forming, and large scale antenna techniques are discussed in <NUM> communication systems. In a <NUM> system, hybrid frequency shift keying (FSK) and Feher's quadrature amplitude (QAM) modulation (FQAM) and sliding window superposition coding (SWSC) as an advanced coding modulation (ACM), filter bank multi carrier (FBMC), non-orthogonal multiple access (NOMA), and sparse code multiple access (SCMA) as an advanced access technology have been developed.

The Internet of everything (IoE), which is a combination of the loT technology and Big Data processing technology through connection with a cloud server, has emerged. As technology elements, such as sensing technology, wired/wireless communication and network infrastructure, service interface technology, and security technology have been demanded for loT implementation, a sensor network, a machine-to-machine (M2M) communication, machine type communication (MTC), and so forth have been recently researched. Such an loT environment may provide intelligent Internet technology services that create new value for human life by collecting and analyzing data generated among connected things.

In line with this, various attempts have been made to apply <NUM> communication systems to loT networks. Application of a cloud RAN as the above-described Big Data processing technology may also be considered to be an example of convergence between <NUM> technology and loT technology.

In a communication/broadcasting system, link performance can be significantly degraded by various noise, fading phenomena, and inter-symbol interference (ISI) of a channel. Therefore, in order to implement high-speed digital communication/broadcasting systems requiring high data throughput and reliability such as next-generation mobile communication, digital broadcasting, and portable Internet, it is required to develop a technique for overcoming noise, fading, and intersymbol interface. As part of the research to overcome noise, etc., recent research on error correcting codes has been actively carried out as a method for improving the reliability of communication by efficiently restoring information distortion. In similar regards, publication "<NPL>relates to approaches and methods for determining Transfer Block Size (TBS) in communication over New Radio Access Technology, and publication "<NPL> relates to approaches and methods for determining TBS for PDSCH in a New Radio communication.

An aspect of the present disclosure provides a method and apparatus for transmitting a coded bit, which may support various input lengths and coding rates.

Another non-claimed aspect of the present disclosure is to provide a method for configuring a base graph of a low-density parity-check (LDPC) code used for data channel transmission and a method and apparatus for segmenting a transport block (TB) using the LDPC code.

Another non-claimed aspect of the present disclosure is to provide a method and apparatus for segmenting uplink control information (UCI) into multiple polar code blocks and transmitting the UCI.

In accordance with an embodiment of the present disclosure, a method by a terminal in a wireless communication system is provided. The method corresponds to the appended claims.

In accordance with another embodiment of the present disclosure, a method by a base station in a wireless communication system is provided. The method corresponds to the appended claims.

In accordance with another embodiment of the present disclosure, a terminal in a wireless communication system is provided. The terminal includes a transceiver; and a controller configured corresponding to the appended claims.

In accordance with another embodiment of the present disclosure, a base station in a wireless communication system is provided. The base station includes a transceiver; and a controller configured corresponding to the appended.

All claims fall under embodiment <NUM>-<NUM>; other embodiments recited in the description do not fall under the scope of the claims but are useful for understanding the invention.

An aspect of the present disclosure is to satisfy various service requirements of a next-generation mobile communication system by using an LDPC code which can be applied to a variable length and a variable rate.

Another aspect of the present disclosure is to support an efficient operation of LDPC coding which is a data channel coding method.

Another aspect of the present disclosure is to support a method of performing channel coding after segmenting uplink control information into one or more code blocks.

The above and other aspects, features, and advantages of the present disclosure will be more apparent from the following detailed description, taken in conjunction with the accompanying drawings, in which:.

Hereinafter, embodiments are described in detail with reference to the accompanying drawings.

In describing the embodiments, a description of technical contents which are well known in the art to which the present disclosure belongs and are not directly connected with the present disclosure is omitted. This is to more clearly describe the present disclosure by omitting an unnecessary description.

For the same reason, some components are elaborated, omitted, or schematically illustrated in the accompanying drawings. Further, the size of each component may not exactly reflect its actual size. In each accompanying drawing, the same or corresponding components are denoted by the same reference numerals.

Various advantages and features of the present disclosure and methods accomplishing the same will become apparent from the following detailed description of embodiments with reference to the accompanying drawings. However, the present disclosure is not intended to be limited to the embodiments disclosed herein but may be implemented in various forms that are different from each other. Descriptions of embodiments of the present disclosure are provided so that those skilled in the art can easily understand the present disclosure. However, the present disclosure is not intended to be limited by an embodiment but is defined by the appended claims and their equivalents. Like reference numerals throughout the present disclosure refer to like elements.

In this case, it may be understood that each block of processing flowcharts and combinations of flowcharts may be performed by computer program instructions. Since computer program instructions may be mounted in processors for a general-purpose computer, a special-purpose computer, or other programmable data processing apparatuses, these instructions executed by the processors for the computer or the other programmable data processing apparatuses create means performing functions described in the block(s) of the flowcharts. Since computer program instructions may also be stored in a computer-usable or computer-readable memory that can direct a computer or other programmable data processing apparatuses in order to implement the functions in a specific scheme, the computer program instructions stored in the computer-usable or computer-readable memory may also produce manufacturing articles including instruction means performing the functions described in the block(s) of the flowcharts. Since computer program instructions may also be mounted on the computer or the other programmable data processing apparatuses, the instructions performing a series of operation steps on the computer or the other programmable data processing apparatuses to create processes executed by the computer to thereby execute the computer or the other programmable data processing apparatuses may also provide steps for performing the functions described in the block(s) of the flowcharts.

In addition, each block may indicate some of modules, segments, or codes including one or more executable instructions for executing a certain logical function(s). Further, it is to be noted that functions mentioned in the blocks occur regardless of a sequence in some alternative embodiments. For example, two blocks that are illustrated as being contiguous may be performed simultaneously or in reverse sequence depending on corresponding functions.

Here, the term "unit" used in the present disclosure indicates software or hardware components such as a field programmable logic array (FPGA) and an application specific integrated circuit (ASIC) and the unit performs any role. However, the term "unit" is not intended to be limited to software or hardware. The term "unit" may indicate an entity configured to be in a storage medium that may be addressed and may also be configured to reproduce one or more processors. Accordingly, for example, the term "unit" includes components such as software components, object oriented software components, class components, and task components and processors, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, a circuit, data, a database, data structures, tables, arrays, and variables. The functions provided in the components and the units may be combined with a smaller number of components and the units or may be further separated into additional components and units. In addition, the components and the units may also be implemented to reproduce one or more central processing units (CPUs) within a device or a security multimedia card. Further, in an embodiment, the term "unit" may include one or more processors.

A wireless communication system has been developed from a wireless communication system providing a voice centered service in an early stage toward broadband wireless communication systems providing high-speed, high-quality packet data services, such as communication standards of high speed packet access (HSPA), LTE or evolved universal terrestrial radio access (E-UTRA), and LTE-A of the 3rd generation partnership program (3GPP), high rate packet data (HRPD) and ultra mobile broadband (UMB) of 3GPP2, and Institute of Electrical and Electronics Engineers (IEEE) standard <NUM>. 16e or the like. In addition, the <NUM> or new radio/next radio (NR) communication standards are being produced as a <NUM> wireless communication system.

In a wireless communication system including <NUM>, at least one service of enhanced mobile broadband (eMBB), massive machine type communications (mMTC), and ultra-reliable and low latency communications (URLLC) may be provided to a terminal. The services may be provided to the same terminal during the same time period. In the following embodiments, the eMBB is a high speed transmission of high capacity data, the mMTC is terminal power minimization and connection of a plurality of terminals, and the URLLC may be a service aiming at high reliability and low latency, which is not limited thereto. The three services may be a major scenario in an LTE system or in systems such as <NUM>/NR since the LTE. In the embodiment, a coexistence method of eMBB and URLLC, a coexistence method of mMTC and URLLC, and an apparatus using the same are described.

When a base station schedules data corresponding to the eMBB service in a certain transmission time interval (TTI) to any terminal, if a situation occurs where the URLLC data must be transmitted in the TTI, some of the eMBB data are not transmitted in a frequency bandwidth in which the eMBB data are already scheduled and transmitted and the URLLC data are transmitted in the frequency band. The terminal that receives the scheduled eMBB and the terminal that receives the scheduled URLLC may be the same terminal or may be different terminals. In this case, since a part occurs where some of the eMBB data that are scheduled and transmitted in advance are not transmitted, the eMBB data is highly likely to be damaged. Therefore, in the above case, it is necessary to determine a method for processing a signal received from a terminal that receives scheduling for eMBB or a terminal that receives scheduling for URLLC and a signal receiving method. Therefore, according to an embodiment, when the information according to the eMBB and the URLLC is scheduled by sharing some or all of the frequency band, the information according to the mMTC and the URLLC is scheduled simultaneously, the information according to the mMTC and the eMBB is scheduled simultaneously, or the information according to the eMBB, the URLLC, and the mMTC B is scheduled simultaneously, a coexistence method between heterogeneous services that can transmit the information according to each service is described.

Hereinafter, embodiments of the present disclosure are described in detail with reference to the accompanying drawings. Where a detailed description of a known function or a configuration related to the present disclosure may obscure the present disclosure, a detailed description therefor is omitted. Further, the following terms are defined in consideration of the functions in the present disclosure and may be construed in different ways by the intention or practice of users and operators. Therefore, the definitions thereof should be construed based on the contents throughout the present disclosure. Hereinafter, a base station is a subject performing resource allocation of a terminal and may be at least one of an eNodeB, a NodeB, a base station (BS), a wireless access unit, a base station controller, and a node on a network. The UE may include a user equipment (UE), a mobile station (MS), a terminal, a cellular phone, a smart phone, a computer, or a multimedia system performing a communication function. In the present disclosure, a downlink (DL) indicates a radio transmission path of a signal from a base station to a terminal and an uplink (UL) indicates a radio transmission path through which the terminal is transmitted to the base station. Further, as an example of LTE or an LTE-A system, an embodiment is described below, but the embodiment may be applied to other communication systems having a similar technical background or a channel form. For example, <NUM> mobile communication technologies (<NUM>, NR) developed after the LTE-A could be included. Further, embodiments may be applied even to other communication systems by partially being changed without departing from the scope of the present disclosure under the decision of those skilled in the art.

As an example of a broadband wireless communication system, the LTE system has adopted an orthogonal frequency division multiplexing (OFDM) scheme in a DL and a single carrier frequency division multiple access (SC-FDMA) scheme in a UL. A UL refers to a radio link through which a terminal (e.g., a UE) or an MS transmits data or a control signal to a base station (eNodeB or BS) and the DL refers to a radio link through which a base station transmits data or a control signal to a terminal. The multiple access scheme as described above normally allocates and operates time-frequency resources on which data or control information is transmitted to prevent the time-frequency resources from overlapping with each other, that is, establish orthogonality, thereby dividing the data or the control information of each user.

If a decoding failure occurs upon initial transmission, the LTE system has adopted a hybrid automatic repeat request (HARQ) scheme of retransmitting the corresponding data in a physical layer. If a receiver does not accurately decode data, the HARQ scheme enables the receiver to transmit information (e.g., a negative acknowledgement (NACK)) informing of the decoding failure to a transmitter to thereby enable the transmitter to retransmit the corresponding data in the physical layer. The receiver combines the data retransmitted by the transmitter with the data that are not decoded previously, thereby increasing reception performance of the data. Further, if the receiver accurately decodes the data, information (e.g., an acknowledgement (ACK)) notifying of a decoding success is transmitted to the transmitter so that the transmitter may transmit new data.

Hereinafter, a higher layer signal described in the present disclosure is a signal such as a system information block (SIB), a radio resource control (RRC), and a medium access control element (MACCE) that supports a certain control operation of a terminal quasi-statically and statically. A physical signal such as an L1 signal dynamically supports a certain control operation of a terminal in the form of terminal common downlink control information or terminal specific downlink control information.

<FIG> is a diagram illustrating a basic structure of a time-frequency domain that is a radio resource area to which data or a control channel is transmitted in a downlink of an LTE system or a system similar thereto.

Referring to <FIG>, an abscissa represents a time domain and an ordinate represents a frequency domain. A minimum transmission unit in the time domain is an OFDM symbol, in which one slot <NUM> is configured by collecting Nsymb OFDM symbols and one subframe <NUM> is configured by collecting two slots. The slot length is <NUM> and the subframe length is <NUM>. Further, a radio frame <NUM> is a time domain interval consisting of <NUM> subframes. A minimum transmission unit in a frequency domain is a sub-carrier, in which the entire system transmission bandwidth consists of a total of NBW sub-carriers <NUM>. However, such values may vary.

A basic unit of resources in the time-frequency domain is a resource element (RE) <NUM> and may be represented by an OFDM symbol index and a sub-carrier index. A resource block (RB) <NUM> (or physical resource block (PRB)) is defined by the Nsymb continued OFDM symbols in the time domain and NRB continued sub-carriers <NUM> in the frequency domain. Thus, one RB <NUM> in one slot may include Nsymb × NRB REs <NUM>. In general, the minimum frequency-domain allocation unit of data is the RB <NUM>, and in the LTE system, generally Nsymb = <NUM> and NRB = <NUM>, and the NBW and NRB can be proportional to the bandwidth of the system transmission band. A data rate is increased in proportion to the number of RBs <NUM> scheduled for the terminal. An LTE system may be operated by defining six transmission bandwidths. In a frequency division duplex (FDD) system operated by dividing the downlink and the uplink based on a frequency, a downlink transmission bandwidth and an uplink transmission bandwidth may be different from each other. A channel bandwidth represents a radio frequency (RF) bandwidth corresponding to the system transmission bandwidth. Table <NUM> below shows a correspondence relationship between system transmission bandwidth and channel bandwidth that are defined in the LTE system. For example, the LTE system that has a channel bandwidth of <NUM> is configured of a transmission bandwidth including <NUM> RBs.

The downlink control information may be transmitted within first N OFDM symbols within a subframe. In an embodiment, generally, N = {<NUM>, <NUM>, <NUM>}. Therefore, the N value may variably apply to each subframe depending on the amount of control information to be transmitted to the current subframe.

The transmitted downlink control information may include a control channel transmission interval indicator representing over how many OFDM symbols the control information is transmitted, scheduling information on downlink data or uplink data, information on HARQ ACK/NACK, or the like.

In the LTE system, the scheduling information on the downlink data or the uplink data is transmitted from a base station to a terminal through downlink control information (DCI). The DCI is defined depending on various formats. Depending on each format, it may be represented whether the DCI is scheduling information (UL grant) on the uplink data or scheduling information (DL grant) on the downlink data, whether the DCI is a compact DCI having small-sized control information, whether to apply spatial multiplexing using a multiple antenna, whether the DCI is a DCI for controlling power, or the like. For example, DCI format <NUM> that is the scheduling control information (DL grant) on the downlink data may include at least one of the following control information:.

The DCI is subjected to a channel coding and modulation process and then may be transmitted on a physical downlink control channel (PDCCH) (or control information, which is interchangeably used below) or an enhanced PDCCH (EPDCCH) (or enhanced control information, which is interchangeably used below).

Generally, each DCI is independently scrambled with a certain radio network temporary identifier (RNTI) (or a terminal identifier) for each terminal to be added with a cyclic redundant check (CRC), subjected to channel coding, and then configured independently and transmitted through a PDCCH. In the time domain, the PDCCH is transmitted while being mapped during the control channel transmission section. A mapping location in the frequency domain of the PDCCH may be determined by identifiers (IDs) of each terminal and transmitted over the entire system transmission bandwidth.

The downlink data may be transmitted on a physical downlink shared channel (PDSCH) that is a physical channel for downlink data transmission. The PDSCH may be transmitted after the control channel transmission section, and the scheduling information on the certain mapping location in the frequency domain, the modulation scheme, or the like may be determined based on the DCI transmitted through the PDCCH.

By the MCS among the control information configuring the DCI, the base station notifies of the modulation scheme applied to the PDSCH to be transmitted to the terminal and a data size (transport block size (TBS)) to be transmitted. In an embodiment, the MCS may consist of <NUM> bits, more than <NUM> bits, or less than <NUM> bits. The TBS corresponds to a size before channel coding for error correction is applied to data (e.g., a TB) to be transmitted by a base station.

The modulation scheme supported in the LTE system is quadrature phase shift keying (QPSK), <NUM> QAM, and 64QAM, in which each modulation order Qm corresponds to <NUM>, <NUM>, and <NUM>. That is, in the case of the QPSK modulation, <NUM> bits per symbol may be transmitted; in the case of the 16QAM modulation, <NUM> bits per symbol may be transmitted; and in the case of the 64QAM modulation, <NUM> bits per symbol may be transmitted. Further, the modulation scheme above <NUM> QAM may be used depending on the system modification.

<FIG> is a diagram illustrating a basic structure of a time-frequency domain that is a radio resource region in which data or a control channel is transmitted in the uplink in an LTE system.

Referring to <FIG>, an abscissa represents a time domain and an ordinate represents a frequency domain. The minimum transmission unit in the time domain is an SC-FDMA symbol, and the NsymbUL SC-FDMA symbols are gathered to form one slot <NUM>. Two slots are gathered to form one subframe <NUM>. The minimum transmission unit in the frequency domain is a subcarrier, in which the entire system transmission bandwidth <NUM> includes a total of NBW subcarriers. The NBW may have a value proportional to the system transmission bandwidth.

A basic unit of resources in the time-frequency domain is an RE <NUM> and may be defined by an SC-FDMA symbol index and a subcarrier index. An RB pair may be defined by NsymbUL continued SC-FDMA symbols in the time domain and NscRB continued subcarriers in the frequency domain. Accordingly, one RB <NUM> consists of NsymbUL × NscRB REs. In general, the minimum transmission unit of the data or the control information is the RB unit. The PUCCH is mapped to a frequency domain corresponding to <NUM> RB and transmitted for one subframe.

In the LTE system, a timing relationship between a PUCCH or a PUSCH is defined, with the PUCCH or the PUSCH being an uplink physical channel to which an HARQ ACK/NACK corresponding to a PDSCH as a physical channel for downlink data transmission or a PDCCH/EPDDCH including a semi-persistent scheduling (SPS) release is transmitted. For example, in an LTE system operated by FDD, the HARQ ACK/NACK corresponding to the PDSCH transmitted in an n-<NUM>-th subframe or the PDCCH/EPDCCH including the SPS release may be transmitted to the PUCCH or the PUSCH in an n-th subframe.

In the LTE system, the downlink HARQ has adopted an asynchronous HARQ scheme in which data retransmission time is not fixed. That is, if for initial transmission data transmitted by the base station, the HARQ NACK is fed back from the terminal, the base station freely determines transmission time of retransmission data based on the scheduling operation. The terminal performs buffering on data determined as an error as a result of decoding the received data for an HARQ operation and then performs combining with the next retransmission data.

If the terminal receives the PDSCH including the downlink data transmitted from the base station in subframe n, the terminal transmits the uplink control information including the HARQ ACK or the NACK of the downlink data to the base station through the PUCCH or PUSCH in subframe n + k. Then, k is defined differently depending on the FDD or time division duplex (TDD) of the LTE system and the configuration thereof. For example, in the case of the FDD LTE system, k is fixed as <NUM>. Meanwhile, in the case of the TDD LTE system, k may be changed depending on the subframe configuration and the subframe number. In addition, the value of k may be applied differently depending on the TDD configuration of each carrier at the time of data transmission through a plurality of carriers.

In the LTE system, unlike the downlink HARQ, the uplink HARQ has adopted a synchronous HARQ scheme in which the data transmission time is fixed. That is, an uplink/downlink timing relationship of the PUSCH that is the physical channel for uplink data transmission, the PDCCH that is the downlink control channel preceding the PUSCH, and a physical hybrid indicator channel (PHICH) that is a physical channel to which the downlink HARQ ACK/NACK corresponding to the PUSCH is transmitted may be transmitted/received depending on the following rules.

If in the subframe n, the terminal receives the PDCCH including the uplink scheduling control information transmitted from the base station or the PHICH to which the downlink HARQ ACK/NACK are transmitted, the terminal transmits the uplink data corresponding to the control information on the PUSCH in subframe n + k. Then, k is defined differently depending on the FDD or TDD of the LTE system and the configuration thereof. For example, in the case of the FDD LTE system, k is fixed as <NUM>. In addition, in the case of the TDD LTE system, k may be changed depending on the subframe configuration and the subframe number. In addition, the value of k may be applied differently depending on the TDD configuration of each carrier at the time of data transmission through a plurality of carriers.

Further, if the terminal receives the PHICH including information associated with the downlink HARQ ACK/NACK from the base station in subframe i, the PHICH corresponds to the PUSCH that the terminal transmits in subframe i - k. Then, k is defined differently depending on the FDD or the TDD of the LTE system and the setting thereof. For example, in the case of the FDD LTE system, k is fixed as <NUM>. In addition, in the case of the TDD LTE system, k may be changed depending on the subframe configuration and the subframe number. In addition, the value of k may be applied differently depending on the TDD configuration of each carrier at the time of data transmission through a plurality of carriers.

Table <NUM> above shows a supportable DCI format type according to each transmission mode under a condition configured by the C-RNTI. The terminal assumes that the corresponding DCI format exists and performs searching and decoding in a control area section according to a predetermined transmission mode. In other words, when the terminal is instructed to transmit mode <NUM>, the terminal searches DCI format 1A in a common search space and a UE-specific search space and searches DCI format 2B only in the UE-specific search space.

The description of the wireless communication system is based on the LTE system, but the present disclosure is not intended to be limited to the LTE system but may be applied to various wireless communication systems such as NR and <NUM>. In addition, in a case where the present disclosure is applied to another wireless communication system, the k value may be changed and applied to a system using a modulation scheme corresponding to FDD.

In a communication/broadcasting system, link performance may deteriorate significantly due to various types of noise, a fading phenomenon, and ISI of a channel. Therefore, to implement high-speed digital communication/broadcasting systems requiring high data throughput and reliability like next-generation mobile communications, digital broadcasting, and portable Internet, there is a need to develop technologies to overcome noise, fading, and inter-symbol interference. As part of studies to overcome noise, etc., a study on an error correcting code which is a method for increasing reliability of communications by efficiently recovering distorted information has been actively conducted recently.

An object of the preset disclosure provides a method and an apparatus for encoding/decoding that is capable of supporting various input lengths and coding rates. Further, the present disclosure provides a method for configuring a base graph of an LDPC code used for data channel transmission and a method and apparatus for segmenting a TB using the LDPC code.

The LDPC code is a kind of linear block code which includes a process of determining a codeword that satisfies conditions of the following Equation (<NUM>).

In Equation (<NUM>) above, H represents the parity-check matrix, c represents the codeword, ci represents an i-th codeword bit, Nldpc represents a codeword length, and hi represents an i-th column of the parity-check matrix H.

The parity-check matrix H consists of the Nldpc columns that are equal to the number of LDPC codeword bits. Equation (<NUM>) above represents that since a sum of a product of the i-th column hi and the i-th codeword bit ci of the parity-check matrix becomes "<NUM>', the i-th column hi has a relationship with the i-th codeword bit ci.

To easily implement the parity-check matrix used in a communication and broadcasting system, generally, a quasi-cyclic LDPC (QC-LDPC) code () using the parity-check matrix of a quasi-cyclic form is mainly used.

The QC-LDPC code has the parity-check matrix consisting of a zero matrix (<NUM>-matrix) having a small square matrix form or circulant permutation matrices.

A permutation matrix P = (Pij) of size Z × Z is defined as shown in Equation (<NUM>) below.

In Equation (<NUM>) above, Pij (<NUM> ≤ i, j < Z) indicates entries of an i-th row and a j-th column in the matrix P. The permutation matrix P as described above is the circulant permutation matrix in the form in which each entry of an identify matrix having the size of Z × Z is circularly shifted in a right direction i times in (<NUM> ≤ i < Z).

The parity-check matrix H of the simplest QC-LDPC code may be expressed by the following Equation (<NUM>).

If P-<NUM> is defined as the <NUM>-matrix having the size of Z×Z, each exponent ajj of the circulant permutation matrices or the <NUM>-matrix in Equation (<NUM>) above has one of {-<NUM>, <NUM>, <NUM>, <NUM>,. , Z-<NUM>} values. Further, the parity-check matrix H of the Equation (<NUM>) above has n column blocks and m row blocks and therefore has a size of Z×Z.

Generally, a binary matrix having a size of m×n obtained by replacing each of the circulant permutation matrices and the <NUM>-matrix in the parity-check matrix of Equation (<NUM>) above with <NUM> and <NUM>, respectively, is called a mother matrix M(H) of the parity-check matrix H and an integer matrix having a size of m×n obtained by the following Equation (<NUM>) by selecting only exponents of each of the a size of m×n or the <NUM>-matrix is referred to as an exponential matrix E(H) of the parity-check matrix H.

In addition, the performance of the LDPC codes may be determined depending on the parity-check matrix. Therefore, there is a need to design the parity-check matrices of the LDPC codes having excellent performance. Further, a method for LDPC encoding and decoding capable of supporting various input lengths and code rates is required.

For an efficient design of QC-LDPC codes, a method known as lifting is used. Lifting is a method for efficiently designing a very large parity check matrix by setting a Z value for deciding a size of a cyclic permutation matrix or a <NUM>-matrix from a small mother matrix according to a certain rule. Features of the existing lifting method and the QC-LDPC code designed through the lifting are described below.

First, S QC-LDPC codes designed through the lifting method for an LDPC code C<NUM> are referred to as C<NUM>, C<NUM>,. , CS (similarly Ck for <NUM> ≤ k ≤ S), the parity check matrix of the QC-LDPC code Ck is referred to as Hk, and a value corresponding to the size of a row block and a column block of a cyclic matrix constituting the parity check matrix is referred to as Zk. In this case, C<NUM> corresponds to the smallest LDPC code having a mother matrix of C<NUM>,. , Cs codes as the parity check matrix, a Z<NUM> value corresponding to the sizes of the row block and the column block is <NUM>, and Zk < Zk+<NUM> for <NUM> ≤ k ≤ S-<NUM>. Further, the parity check matrix Hk of each code Ck has an m × n exponent matrix E(Hk) = ai,j(k), and each index ai,j(k) is selected as one of {-<NUM>, <NUM>, <NUM>, <NUM>,. , Zk - <NUM>} values. The lifting consists of the same steps as C0 → C1 →. → CS and has the same characteristics as Zk+<NUM> = qk+<NUM>Zk (qk+<NUM> is a positive integer, k = <NUM>, <NUM>,. , S-<NUM>). Further, if only a parity check matrix HS of Cs is stored according to the characteristics of the lifting process, all of the QC-LDPC codes can be represented C<NUM>, C<NUM>,. , Cs by using Equation (<NUM>) or Equation (<NUM>) below according to the lifting scheme. <MAT> <MAT>.

The scheme may be most generalized and expressed as shown in Equation (<NUM>) below.

In Equation (<NUM>) above, f(x, y) denotes an arbitrary function having x and y as input values. Vi,j indicates an element corresponding to an i-th row and a j-th column of the exponent matrix of the parity check matrix corresponding to the LDPC code having a largest size (for example, corresponding to Cs in the above description). Pij denotes an element corresponding to the i-th row and j-th column of the exponent matrix of the parity check matrix for an arbitrary-sized LDPC code (e.g., corresponding to Ck in the above description) and Z denotes the sizes of the row block and the column of the cyclic matrix constituting the parity check matrix of the corresponding LDPC code. Therefore, when Vi,j is defined, the parity check matrix for the LDPC code having an arbitrary size may be defined.

In the description below of present disclosure, the notation described above is defined as follows:.

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

In the next-generation mobile communication system, there may be multiple maximum exponential matrices defined in order to ensure optimal performance for code blocks having various lengths. For example, there may be M different maximum exponent matrices corresponding thereto, which may be expressed as follows: <MAT>.

There may be multiple maximum exponent matrix elements corresponding thereto, which may be expressed as follows: <MAT>.

In Equation (<NUM>) above, a maximum exponent matrix element (Vi,j)m corresponds to (i, j) of a maximum exponent matrix E(Hs)m. In the following description, the parity check matrix for the LDPC code is described by using the maximum exponent matrix defined above. This may be applied similarly as expressed by using the maximum exponent matrix element.

Turbo code based code block segmentation and CRC attachment methods are described below.

The input bit sequence to the code block segmentation is denoted by b<NUM>, b<NUM>, b<NUM>, b<NUM>,. , bB-<NUM>, where B > <NUM>. If B is larger than the maximum code block size Z, segmentation of the input bit sequence is performed and an additional CRC sequence of L = <NUM> bits is attached to each code block. The maximum code block size is:.

If the number of filler bits F calculated below is not <NUM>, filler bits are added to the beginning of the first block. Note that if B < <NUM>, filler bits are addedto the beginning of the code block.

The filler bits shall be set to <NULL> at the input to the encoder.

Total number of code blocks Cis determined by:
<IMG>.

The bits output from code block segmentation, for C ≠ <NUM>, are denoted by cr<NUM>, cr<NUM>, cr<NUM>, cr<NUM>,. ,cr(K-<NUM>), where r is the code block number, and Kr is the number of bits for the code block numberr. Number of bits in each code block (applicable for C ≠ <NUM> only):
First segmentation size: K+ = minimum K in table <NUM>. <NUM>-<NUM> such that C · K ≥ B'
<IMG>
<IMG>
The sequence cr<NUM>,cr<NUM>,cr<NUM>,cr<NUM>,. ,cr(K+-L-<NUM>) is used to calculate the CRC parity bits Pr<NUM>,Pr<NUM>,Pr<NUM>,. ,Pr(L-<NUM>) according to section <NUM>. <NUM> with the generator polynomial gCRC24B (D). For CRC calculation it is assumed that filler bits, if present, have the value <NUM>.

<NUM> and next-generation communication systems use the LDPC code in data channels unlike LTE. In addition, even in a situation of applying the LDPC code, one transport block may be segmented into multiple code blocks and some code blocks of the segmented code blocks may form one code block group. Further, the number of code blocks of respective code block groups may be all the same as or different from each other. Bitwise interleaving may be applied to individual code blocks, code block groups or transport blocks.

<FIG> is a diagram illustrating a base structure of a mother matrix (or base graph) of an LDPC code according to an embodiment.

Referring to <FIG>, two base-graph <NUM> base structures 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 <NUM><NUM> and a maximum horizontal length of <NUM><NUM> and the base-graph structure of the second LDPC code has a matrix structure with a maximum vertical length of <NUM><NUM> and a maximum horizontal length of <NUM><NUM>. The base-graph structure of the first LPDC code may support a coding rate of at least <NUM>/<NUM> to a maximum of <NUM>/<NUM> and the base-graph structure of the second LDPC code may support a coding rate of at least <NUM>/<NUM> to a maximum of <NUM>/<NUM>.

The LDPC code consists of six sub-matrix structures <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, and <NUM>.

A first sub-matrix structure <NUM> includes system bits. A second sub-matrix structure <NUM> is a square matrix and includes parity bits. A third sub-matrix structure <NUM> is a zero matrix. A fourth sub-matrix structure <NUM> and a fifth sub-matrix structure <NUM> include the parity bits. A sixth sub-matrix structure <NUM> is a unitary matrix.

In the base-graph structure of the first LDPC code, the horizontal length <NUM> of the first sub-matrix <NUM> has a value of <NUM> and the vertical length <NUM> has a value of <NUM> or <NUM>. Both the horizontal length <NUM> and the vertical length <NUM> of the second sub-matrix <NUM> have the value of <NUM> or <NUM>. The horizontal length <NUM> of the third sub-matrix <NUM> has a value of <NUM> or <NUM> and the vertical length <NUM> has the value of <NUM> or <NUM>. The vertical length <NUM> of the fourth sub-matrix <NUM> has the value of <NUM> or <NUM> and the horizontal length <NUM> has the value of <NUM>. The horizontal length <NUM> of the fifth sub-matrix <NUM> has the value of <NUM> or <NUM> and the vertical length <NUM> has the value of <NUM> or <NUM>. Both the horizontal length <NUM> and the vertical length <NUM> of the sixth sub-matrix <NUM> have the value of <NUM> or <NUM>.

In the base-graph structure of the second LDPC code, the horizontal length <NUM> of the first sub-matrix <NUM> has a value of <NUM> and the vertical length <NUM> has a value of <NUM>. Both the horizontal length <NUM> and the vertical length <NUM> of the second sub-matrix <NUM> have the value of <NUM>. The horizontal length <NUM> of the third sub-matrix <NUM> has a value of <NUM> and the vertical length <NUM> has the value of <NUM>. The vertical length <NUM> of the fourth sub-matrix <NUM> has the value of <NUM> and the vertical length <NUM> has the value of <NUM>. The horizontal length <NUM> of the fifth sub-matrix <NUM> has the value of <NUM> and the vertical length <NUM> has the value of <NUM>. Both the horizontal length <NUM> and the vertical length <NUM> of the sixth sub-matrix <NUM> have the value of <NUM>.

One code block size that may be supported in the base-graph structure of the first LDPC code is <NUM> × Z (where Z = a × <NUM>j, Z is configured by Table <NUM> below, one code block size that may be maximally supported is <NUM>, and one code block size which may be minimally supported is <NUM>. For reference, in Table <NUM> below, as a candidate of the Z value, some or all of <NUM>, <NUM>, <NUM>, and <NUM> may be additionally reflected.

One code block size that may be supported in the base-graph structure of the first LDPC code is as follows:
<NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, (<NUM>, <NUM>, <NUM>, <NUM>).

In this case, <NUM>, <NUM>, <NUM>, and <NUM> may be additionally included.

Further, a total of M maximum exponential matrices <MAT> are additionally defined based on the base-graph (BG #<NUM>) of the first LDPC code. For example, M may have a value of <NUM> or a predetermined natural number value and i may have a value from <NUM> to M. The terminal performs downlink data decoding or uplink data encoding using the matrices <MAT>. The matrices <MAT> have certain element values shifted from the base-graph (BG #<NUM>) of the first LDPC code. That is, the matrices <MAT> may have different shift values.

One code block size that may be supported in the base-graph structure of the second LDPC code is <NUM> × Z (where Z = a × 2j, Z is configured by Table <NUM> below, one code block size that may be maximally supported is <NUM> (or <NUM>), and one code block size which may be minimally supported is <NUM>. For reference, in Table <NUM> above, as a candidate of the Z value, some or all of <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, and <NUM> may be additionally reflected.

One code block size that may be supported in the base-graph structure of the second LDPC code is as follows:
<NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>,<NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM> (<NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>).

In this case, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, and <NUM> may be additionally included.

Further, a total of M maximum exponential matrices <MAT> are additionally defined based on the base-graph (BG #<NUM>) of the second LDPC code. Typically, M may have a value of <NUM> or a predetermined natural number value and i may have a value from <NUM> to M. The terminal performs downlink data decoding or uplink data encoding using the matrices <MAT>. The matrices <MAT> have certain element values shifted from the base-graph (BG #<NUM>) of the second LDPC code. That is, the matrices <MAT> may have different shift values.

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

When receiving downlink data information through downlink control information from the base station, the terminal supporting type <NUM> determines that the base-graph applied to the transport block containing the downlink data information continuously adopts the first base-graph and applies the maximum exponent matrix <MAT> in data encoding or decoding. When receiving downlink data information through downlink control information from the base station, the terminal supporting type <NUM> determines that the base-graph applied to the transport block containing the downlink data information continuously adopts the second base-graph and applies the maximum exponent matrix <MAT> in data encoding or decoding.

When receiving the downlink data information from the base station through the downlink control information, the terminal supporting type <NUM> is configured the base-graph applied to the transport block containing the downlink data information in advance from the base station through the higher layer signaling such as SIB, RRC or MAC CE or configured the base-graph through the downlink control information transferred to a terminal group common or a terminal (cell) common or a terminal specific control channel. The downlink control information may or may not include the scheduling information for the transport block.

When receiving the downlink data information from the base station through the downlink control information, the terminal supporting type <NUM> is configured which maximum exponent matrix of <MAT> and <MAT> applied to the transport block containing the downlink data information is applied in advance from the base station through the higher layer signaling such as SIB, RRC or MAC CE or configured which maximum exponent matrix of <MAT> and <MAT> applied to the transport block containing the downlink data information is applied through the downlink control information transferred to a terminal group common or a terminal (cell) common or a terminal specific control channel. The downlink control information may or may not include the scheduling information for the transport block.

<FIG> is a flowchart of a data receiving process of a terminal according to an embodiment.

Referring to <FIG>, the terminal receives the downlink control information through the terminal common downlink control channel, the terminal group common downlink control channel, or the terminal-specific downlink control channel in step <NUM>.

The terminal determines one or two or more combinations of the following conditions through the reception of the downlink control information in step <NUM>.

In a case where the RNTI scrambled to the CRC of the downlink control information is an random access RNTI (RA-RNTI), a paging RNTI (P-RNTI), a system information RNTI (SI-RNTI), a single cell RNTI (SC-RNTI), or a group RNTI (G-RNTI) based on condition A, the terminal determines the case as condition <NUM> and performs operation <NUM> in step <NUM>.

In a case where the RNTI scrambled to the CRC of the downlink control information is an RA-RNTI, a P-RNTI, an SI-RNTI, an SC-RNTI, or a G-RNTI based on condition A, the terminal determines the case as condition <NUM> and performs operation <NUM> in step <NUM>.

In a case where the size including the transport block and the CRC included in the downlink control information is greater than or equal to a predetermined threshold value Δ<NUM> based on condition B, the terminal determines the case as condition <NUM> and performs operation <NUM> in step <NUM>.

In a case where the size including the transport block and the CRC included in the downlink control information is less than or equal to a predetermined threshold value Δ<NUM> based on condition B, the terminal determines the case as condition <NUM> and performs operation <NUM> in step <NUM>.

The threshold value Δ<NUM> or the threshold value Δ<NUM> may adopt a fixed value of <NUM> (or <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, or <NUM> or any other value). The threshold value Δ<NUM> or the threshold value Δ<NUM> may have the same value or different values.

Alternatively, the threshold value Δ<NUM> or the threshold value Δ<NUM> may be a value previously set through the higher layer signaling such as SIB, RRC, or MAC CE, or may be a value previously set through the downlink control information of the terminal group common, terminal common, or terminal specific downlink control channel. In this case, a value fixed to <NUM> (or <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, or <NUM> or any other value) may be used as a default threshold value Δ before the threshold value Δ is set. A time before the threshold value Δ<NUM> or the threshold value Δ<NUM> is determined depending on whether the CRC of the downlink control information of the terminal is scrambled to the RA-RNTI, P-RNTI, SI-RNTI, SC-RNTI, or G-RNTI.

In a case where a minimum code block length (Kmin) belongs to the first base-graph, of code block lengths K which may be supported in the first base-graph and code block lengths K which may be supported in the second base-graph satisfying K > (transport block size + CRC size) while the size including the transport block and the CRC included in the downlink control information is smaller than <NUM> (or <NUM>) (alternatively, simultaneously, when the size is greater than <NUM> or <NUM>) based on condition B, the terminal determines the case as condition <NUM> and performs operation <NUM> in step <NUM>.

In a case where a minimum code block length (K) belongs to the second base-graph, of code block lengths K which may be supported in the first base-graph and code block lengths K which may be supported in the second base-graph satisfying K > (transport block size + CRC size) while the size including the transport block and the CRC included in the downlink control information is smaller than <NUM> (or <NUM>) (alternatively, simultaneously, when the size is larger than <NUM> or <NUM>) based on condition B, the terminal determines the case as condition <NUM> and performs operation <NUM> in step <NUM>.

This may be expressed as follows: <MAT> where K ∈ K<NUM> or K ∈ K<NUM>; <MAT>.

Alternatively, this may be expressed as follows:.

Alternatively, when TB + CRC is less than V<NUM>, the terminal performs decoding or encoding by applying one of the maximum exponential matrices <MAT> and when TB + CRC is greater than V<NUM>, the terminal performs decoding or encoding by applying one of the maximum exponential matrices <MAT>.

It is usually possible that the values described above are used when all or some of the values above are omitted when the value is less than or equal to M. The value of M may be selected as <NUM>, <NUM>, or another value.

K<NUM> represents the set of code block lengths that may be supported in the second base-graph (or the maximum exponent matrix <MAT>) and the types of the sets may be one or two or more of some combinations.

When the base-graph indicator included in the downlink control information indicates the value of <NUM> (or <NUM>) based on condition C, the terminal determines that condition <NUM> is satisfied and performs operation <NUM> in step <NUM>.

When MCS, RV, NDI, or frequency or time resource allocation values among the scheduling-related values included in the downlink control information indicate the specific information based on condition D, the terminal determines that condition <NUM> is satisfied and performs operation <NUM> in step <NUM>.

When the terminal performs operation <NUM> in step <NUM>, the terminal performs an operation for one or two or more combinations of the following:.

When the terminal performs operation <NUM> in step <NUM>, the terminal performs an operation for one or two or more combinations of the following.

Numbers in parentheses in the present disclosure indicate that the corresponding values may or may not be included.

In the present disclosure, the number of information bits may indicate the amount of data to be transmitted from the higher layer or the TBS of the TB. The TBS is generally transmitted during one TTI, but may also be transmitted over several TTIs. In the present disclosure, the TBS may be represented by N.

A first terminal in the present disclosure may be a terminal that is configured to perform decoding using the maximum exponential matrix <MAT> at the time of data transmission, a terminal that may not perform decoding using the maximum exponent matrix <MAT> at the time of data transmission, or a terminal that supports type <NUM> in Table <NUM> above.

A second terminal in the present disclosure may be a terminal that is configured to perform decoding using the maximum exponential matrix <MAT> at the time of data transmission, a terminal that may not perform decoding using the maximum exponent matrix <MAT> at the time of data transmission, or a terminal that supports type <NUM> in Table <NUM> above.

A third terminal in the present disclosure may be a terminal that is configured to perform decoding using the maximum exponential matrix <MAT> or <MAT> at the time of data transmission or a terminal that supports type <NUM> in Table <NUM> above. The terminal performs determination based on one or more of TBS, MCS, and transmission modes to decide which maximum exponent matrix to use.

The values written in parentheses in the tables described in the present disclosure are values of which all or some may be included in the table or may not be included in the table.

<FIG> is a diagram illustrating a method for segmenting a TB into code blocks according to an embodiment.

<FIG> illustrates a transport block <NUM> of length N <NUM> and a CRC <NUM> of length L <NUM> are inserted and a transport block (TB-CRC) <NUM> into which a CRC having a total length of B <NUM> is inserted may be configured.

The CRC inserted in the TB transmission used to determine whether decoding of the TB is successful after decoding the TB in the receiver may have at least two possible values of length L. That is, when the transport block is transmitted while being segmented into two or more code blocks, a long CRC is used. In contrast, when the transport block is transmitted as one code block, a short CRC may be used.

When the LDPC code is used for encoding in the mobile communication system, since the LDPC code has a parity check function as a code itself, the LDPC code has a function of determining whether the decoding is successful to some degree without CRC insertion. In the case of using the LDPC code in a certain mobile communication system and obtaining an additional decoding success determination rate of a predetermined level or greater, a technique of determining the final decoding success by inserting the CRC in addition to the parity check function of the LDPC code may be used and, by using such a method, an error rate level of the desired decoding success determination may be obtained. For example, if the decoding error rate required by the system is <NUM> ^ -<NUM> and the determination error rate which may be obtained by the LDPC code parity check function is <NUM> ^ -<NUM>, a CRC with the determination error rate of <NUM> ^ -<NUM> is additionally inserted, so that the final determination error rate of <NUM> ^ -<NUM> may be achieved. Generally, the longer the length of the CRC, the lower the determination error rate of decoding success or failure. When the transport block is transmitted while being segmented into two or more code blocks, the TB is concatenated with the LDPC code and the parity check function of the LDPC code itself may not be used. In contrast, when the transport block is one code block, the parity check function of the LDPC code may be used. Therefore, in a certain system, it is possible to insert a CRC having a long or short length into the TB and use the inserted CRC according to the number of code blocks in the transport block. In the embodiments of the present disclosure, it is assumed that a long length L+ or a short length L- may be used as a length L of the CRC inserted into the TB depending on whether the TB is segmented into two or more code blocks. In addition, an example of a possible value for L+ is <NUM>, which is used in the case of LTE, and as an example for L-, it is possible to recycle any of the shorter lengths but using <NUM> in the LTE control channel. However, the present disclosure is not limited to <NUM>, which is an example of the L- value.

Whether a certain TB is segmented into multiple code blocks is determined depending on whether a given TB may be transmitted in one code block, whether the certain TB is segmented into multiple code blocks may be determined as follows.

In this case, Kmax represents the largest code block size among the possible code block sizes.

In the following description of the present disclosure, it is assumed that as the CRC length included in the TB, L+ is used when the TB-CRC is transmitted while being segmented into multiple code blocks. That is, if the base station/terminal determines that the TB is segmented even if whether the TB is segmented is determined based on N + L-, the TB it is divided based on B = (N + L+).

The transport block decoding process of the downlink data channel of the terminal described in the present disclosure may be sufficiently applied to the transport block encoding process of the uplink data channel.

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

In the present disclosure, the CRC inserted in the TB transmission used to determine whether the decoding of the TB is successful after decoding the TB in the receiver may have at least two possible values. That is, when the transport block is transmitted while being divided into two or more code blocks, a long (L+) CRC is used. In contrast, when the transport block is transmitted as one code block, a short (L-) CRC may be used. L- is a natural number with a value less than L+. In the embodiments of the present disclosure, a long length L+ or a short length L- may be used as the length of the CRC inserted into the TB depending on whether TB is divided into two or more code blocks. In addition, an example of a possible value for L+ is <NUM>, which is used in the case of LTE, and as an example for L-, it is possible to recycle any of the shorter lengths but use <NUM> in the LTE control channel. However, the embodiment of the present disclosure is not limited to <NUM>, which is an example of the L- value.

Embodiment <NUM> provides a method for determining an H matrix and performing channel coding when the number of information bits is less than or equal to a predetermined value. For example, the number N of information bits may be less than a value of Nx_max or less than or equal to the value of Nx_max or N + L- may be less than the value of Nx_max or less than or equal to the value of Nx_max. Nx_max may be an arbitrary value and a value for explaining the above example.

If N + L- is less than or equal to N1_max in the first terminal, which is a terminal that may use or is configured to use only the maximum exponent matrix <MAT> (i = <NUM>, <NUM>,. , <NUM>), the TB may be transmitted by using one code block. N1_max may be <NUM> in the above example. In this case, Z used for channel coding and H matrix determination is selected from among the Z values shown in Table <NUM> above, which is the minimum among Z values satisfying Kb × Z ≥ N + L-. In the above example, Kb may be set to <NUM>. In this case, filler bits of Kb × Z - (N + L-) may be added to the CRC of the information bits and L-bits before the information bits or between the information bits and the CRC, or at the end. In the present disclosure, the filler bit may be set to <NUM> or <NUM>.

If N + L- is less than or equal to N2_max and the coding rate is less than or equal to <NUM>/<NUM>, <NUM>, <NUM>, or <NUM> in the second terminal, which is a terminal that may use or is configured to use only the maximum exponent matrix <MAT> (i = <NUM>, <NUM>,. , <NUM>), the TB may be transmitted by using one code block. N2_max may be <NUM> in the above example. In this case, Kb may be determined as follows. Kb is <NUM> if N + L-> N2_t1, Kb is <NUM> if N2_t1 ≥ N + L- > N2_t2, Kb is <NUM> if N2_t2 ≥ N + L-> N2_t3, and Kb is <NUM> otherwise. In the above example, N2_t1 may be <NUM>, N2_t2 may be <NUM>, and N2_t3 may be <NUM>. The above example may be expressed by the following pseudo-code:
<IMG>
<IMG>.

Alternatively, Kb may be determined as shown in Table <NUM> below.

In this case, the Z value used for channel coding and used for H matrix determination is selected from the Z values shown in Table <NUM> above, which is the minimum among Z values satisfying Kb × Z ≥ N + L-. Next, the filler bits of Kb × Z - (N + L-) may be added to the CRC of the information bits and L-bits before the information bits or between the information bits and the CRC, or at the end. In the present disclosure, the filler bit may be set to <NUM> or <NUM>.

For a third terminal, which is a terminal that may perform decoding or is configured to perform decoding using both the maximum exponential matrices <MAT> and <MAT>, each BG may be configured to use different transport block lengths and coding rates. For example, if the length TBS of the transport block plus the length of the CRC corresponding to the transport block is less than or equal to a certain value N2_max or <NUM> and the coding rate is less than or equal to a certain value <NUM>/<NUM>, the third terminal may use the second BG (BG #<NUM>) and, otherwise, the third terminal may use the first BG (BG #<NUM>). In the above example, BG #<NUM> is optimized for the case where the length of the transport block is longer than <NUM> or the coding rate is <NUM>/<NUM> or more and BG #<NUM> is optimized in the opposite case. The use of BG #<NUM> in the above description is equivalent to using one of the maximum exponential matrices <MAT> (i = <NUM>, <NUM>,. , <NUM>) and similarly, the use of BG #<NUM> is equivalent to using one of the maximum exponential matrices <MAT> (i = <NUM>, <NUM>,. Further, the coding rate may be easily derived from an MCS value that the base station indicates to the terminal. In the present disclosure, the coding rate <NUM>/<NUM> may be changed to <NUM>, <NUM>, or <NUM> and applied. In the above description, when N + L- is less than or equal to a certain value N2_max, Kb is determined according to the Pseudo-code <NUM> above or Table <NUM> above, and, thus, as the Z value used for channel coding and determining the H matrix, a minimum Z value is selected among the Z values satisfying Kb × Z ≥ N + L- among the Z values shown in Table <NUM> above. Next, the filler bits of Kb × Z - (N + L-) may be added to the CRC of the information bits and L-bits before the information bits or between the information bits and the CRC, or at the end. In the present disclosure, the filler bit may be set to <NUM> or <NUM>. In the above description, Z used for channel coding when N + L- is greater than or greater than or equal to a certain value N2_max and Z used for H matrix determination is selected as Z among the Z values shown in Table <NUM> above, which is the minimum among Z values satisfying Kb × Z ≥ N + L-. In the above example, Kb may be set to <NUM>. In this case, filler bits of Kb × Z - (N + L-) may be added to the CRC of the information bits and L-bits before the information bits or between the information bits and the CRC, or at the end.

Embodiment <NUM> provides a method for determining the size of the code block, determining an H matrix, and performing channel coding when the number of information bits is less than or equal to a predetermined value. For example, the number N of information bits may be less than a value of Nx_max or less than or equal to the value of Nx_max or N + L- may be less than the value of Nx_max or less than or equal to Nx_max. In the above example, the Nx_max may be an arbitrary value and a value for explaining the above example.

When the TBS, which is the amount of data to be transmitted, is N, the terminal may preferentially select the minimum value among the K values satisfying K ≥ N + L-, among the K values that may have one value in the set of specific values. For example, the value between the values in a particular set of values that may be a K value may be defined as in Table <NUM> below.

Table <NUM> above indicates that when <NUM> <= K <= <NUM>, the interval of possible values of K is <NUM>, so <NUM>, <NUM>, <NUM>, <NUM>, <NUM>,. , when <NUM> <= K <= <NUM> is included in the set of values, the interval of the value that may be a K value is <NUM>, so <NUM>, <NUM>, <NUM>,. , <NUM> are included in the set of certain values that may be K values. Therefore, the set of values that may be the K value is obtained from Table <NUM> above. The filler bits of K - (N + L-) may be added to the CRC of the information bits and L-bits before the information bits or between the information bits and the CRC, or at the end. In the present disclosure, the filler bit may be set to <NUM> or <NUM>. In the above example, the K value is determined to be one of the values determined by Table <NUM> above, but in another example, a method for determining the K value among the integers that are multiples of <NUM> may be applied.

If K is less than or equal to N1_max in the first terminal, which is a terminal that may use or is configured to use only the maximum exponent matrix <MAT> (i = <NUM>, <NUM>,. , <NUM>), the TB may be transmitted by using one code block. N1_max may be <NUM> in the above. In this case, Z used for channel coding and used for H matrix determination is selected as Z among the Z values shown in Table <NUM> above, which is the minimum among Z values satisfying Kb × Z ≥ K. In the above example, Kb may be set to <NUM>. In this case, filler bits of Kb × Z - K may be added to the obtained K bits before or at the end. In the present disclosure, the filler bit may be set to <NUM> or <NUM>.

If K is less than or equal to N2_max and the coding rate is less than or equal to <NUM>/<NUM>, <NUM>, <NUM>, or <NUM> in the second terminal, which is a terminal that may use or is configured to use only the maximum exponent matrix <MAT> (i = <NUM>, <NUM>,. , <NUM>), the TB may be transmitted by using one code block. N2_max may be <NUM> in the above example. In this case, Kb may be determined as follows. Kb is <NUM> if K > N2_t1, Kb is <NUM> if N2_t1 ≥ K > N2_t2, Kb is <NUM> if N2_t2 ≥ K> N2_t3, and Kb is <NUM> otherwise. In the above example, N2_t1 may be <NUM>, N2_t2 may be <NUM>, and N2_t3 may be <NUM>. The above example may be expressed by the following pseudo-code.

Alternatively, Kb may be determined as shown in Table <NUM> above. In this case, the Z value used for channel coding and used for H matrix determination is selected as Z among the Z values shown in Table <NUM> above, which is the minimum among Z values satisfying Kb × Z ≥ K. Next, the filler bits of Kb × Z - K may be added to the CRC of the information bits and L-bits before the information bits or between the information bits and the CRC, or at the end. In the present disclosure, the filler bit may be set to <NUM> or <NUM>.

For a third terminal, which is a terminal that may perform decoding or is configured to perform decoding using both the maximum exponential matrices <MAT> and <MAT>, each base-graph (BG) may be configured to use different transport block lengths and coding rates. For example, if the length TBS of the transport block plus the length of the CRC corresponding to the transport block is less than or equal to a specific value N2_max or <NUM> and the coding rate is less than or equal to a specified value <NUM>/<NUM>, the second BG (BG #<NUM>) may be used and otherwise, the first BG (BG #<NUM>) may be used. In the above example, BG #<NUM> is optimized for the case where the length of the transport block is longer than <NUM> or the coding rate is <NUM>/<NUM> or more and BG #<NUM> is optimized in the opposite case. The use of BG #<NUM> in the above description is equivalent to using one of the maximum exponential matrices <MAT> (i = <NUM>, <NUM>,. , <NUM>) and similarly, the use of BG #<NUM> is equivalent to using one of the maximum exponential matrices <MAT> (i = <NUM>, <NUM>,. Further, the coding rate may be easily derived from an MCS value that the base station indicates to the terminal. In the present disclosure, the coding rate <NUM>/<NUM> may be changed to <NUM>, <NUM>, or <NUM> and applied. In the above description, when K is less than or equal to a certain value N2_max, Kb is determined according to Pseudo-code <NUM> above or Table <NUM> above, and thus as the Z value used for the channel coding and determining the H matrix, a minimum Z value is selected among the Z values satisfying Kb × Z ≥ K among the Z values shown in Table <NUM> above. In this case, filler bits of Kb × Z - K may be added to the CRCs of the information bits and the L-bits before or at the end. In the present disclosure, the filler bit may be set to <NUM> or <NUM>. In the above description, Z used for channel coding when K is greater than or greater than or equal to a certain value N2_max and Z used for H matrix determination is selected from among the Z values shown in Table <NUM> above, which is the minimum among Z values satisfying Kb × Z ≥ K. In the above example, Kb may be set to <NUM>. In this case, the filler bits of Kb × Z - K may be added to the K bits before or at the end.

Embodiment <NUM> provides a method for performing channel coding by segmenting the number of information bits into one or more parts and determining an H matrix when the number of information bits is greater than or equal to a predetermined value. In the present embodiment, channel coding of one or more segmented information bit blocks is performed using the same H matrix. That is, the present embodiment provides a method of segmenting a transport block into a code block. For example, the number N of information bits may be greater than a value of Nx_max or N + L- may be greater than the value of Nx_max. In the above example, the Nx_max may be an arbitrary value and a value for explaining the above example.

<FIG> is a diagram illustrating a method of segmenting a TB into a code block according to Embodiments <NUM> and <NUM> of the present disclosure.

Referring to <FIG>, a transport block <NUM> has a length N <NUM>, and a CRC <NUM> having a length L <NUM> is inserted to configure a transport block TB-CRC <NUM> inserted with a CRC having a total length B <NUM>. <FIG> shows an example in which the TB-CRC <NUM> having length B is segmented into a total of C CBs (CB#<NUM><NUM>, CB#<NUM><NUM>, to CB#C <NUM>). The segmented code blocks may have a code block size K, and each code block may be inserted with a CRC <NUM> having a length L <NUM>. The length L value of the CRC inserted in the CBs (CB#<NUM><NUM>, CB#<NUM><NUM>, to CB#C <NUM>) may be different from the L value of the CRC inserted into the TB <NUM>. In addition, the value of the CRC inserted into the CB may be different from the value of the CRC inserted into the TB. The CRC inserted into the TB can be denoted by L- or L +, and L- is an integer less than L +. For example, L- may be <NUM> and L + may be <NUM>. The CRC inserted into the CB may be denoted by LCB.

<FIG> is a flowchart of a method of segmenting a transport block according to an embodiment.

Referring to <FIG>, Embodiment <NUM> may include the following steps:.

Hereinafter, the above steps are described in greater detail.

In step <NUM>, the transmitter may determine the total number C of code blocks for segmenting one transport block. First, if N + L- ≤ Kmax, C = <NUM>. Herein, N is a TBS value. If N + L- > Kmax, it is defined as B = N + L +, and the transmitter may calculate the number C of code blocks in the same manner as in Equation (<NUM>) below. In the above example, B is a value obtained by adding CRC bits to the TBS by L +. For example, when a value obtained by adding L- to the size of the TBS is greater than a certain value, the transport block is segmented into two or more code blocks, which is based on adding the CRC bits to the TBS by L+. Hereinabove, L- and L+ are different values. Alternatively, when N is greater than Kmax - L-, the TBS and L+ CRC bits are segmented into two or more code blocks.

It is possible to minimize the number of code blocks generated after segmentation for the transport block by the operation of Equation (<NUM>) above. In this case, the value of Kmax may have, for example, a value of <NUM>.

In step <NUM>, based on the number of code blocks determined in step <NUM>, the transmitter may determine the total block size B' after the expected code block segmentation. For example, this may be determined based on Equation (<NUM>) below.

According to Equation (<NUM>) above, the predicted total block size B' may be determined by a size B obtained by combining CRCs for the transport block before code block segmentation and the transport block after code block segmentation and a size C · LCB of total CRCs added after code block segmentation.

In step <NUM>, the transmitter may determine the code block size. The size of the code block is determined by Kb × Z and is given by Kb = <NUM>. A Z value for determining an H matrix to be used for channel coding may be obtained as shown in Equation (<NUM>) below.

That is, a minimum Z value satisfying C × Kb × Z >= B' may be selected from the Z values included in Table <NUM> above.

The transmitter may select the code block size closest to the entire length B' after the segmentation through the operation of Equation (<NUM>) above.

In step <NUM>, the transmitter may determine the number of filler bits. For example, the following Equation (<NUM>) may be determined.

In step <NUM>, the transmitter may insert F filler bits determined in step <NUM> into a certain code block. In the method of inserting the filler bits, a method of inserting all filler bits having a size F into one certain code block may be used. The certain code block may correspond to, for example, a first code block among the code blocks generated after code block segmentation.

As another example of inserting the filler bits, the filler bits having the size F may be distributed and inserted in all code blocks as equally as possible. More specifically, filler bits having a first filler bit size may be inserted into first N code blocks of the total C code blocks, and filler bits having a second filler bit size may be inserted into the remaining M code blocks. For example, N, M, the first filler bit size F+, and the second filler bit size F- may be determined by Equation (<NUM>) below.

Equation (<NUM>) is characterized in that a difference between the first filler bit size and the second filler bit size may be minimized to <NUM>. Therefore, there is an advantage that insertion of the most uniform filler bit may be guaranteed.

As another example of inserting the filler bits, the filler bits having the size F may be distributed and inserted to all code blocks having the first code block size as equally as possible. More specifically, it is possible to insert filler bits having a first filler bit size F+ to first N. code blocks among all C. code blocks having the first code block size and insert filler bits having a second filler bit size F- to the remaining M+ code blocks. For example, N, M, the first filler bit size F+, and the second filler bit size F- may be determined by Equation (<NUM>) below.

To describe the above example again, it is possible to insert filler bits having a size F into all the code blocks as uniformly as possible. For example, the transmitter may perform channel coding for each of the code blocks by including filler bits of <MAT> bits or <MAT> bits at the front and rear of each code block. In this case, <MAT> code blocks or (F mod C) code blocks may have filler bits of <MAT> bits, and the remaining code blocks may have <MAT> bits or <MAT> filler bits. The <MAT> operation in the present disclosure is a function corresponding to the largest integer, which is less than or equal to a real number x in the descending operation for x.

As another example of inserting the filler bits, the filler bits having the size F may be distributed and inserted to all code blocks having the second code block size as equally as possible. More specifically, it is possible to insert filler bits having a first filler bit size F+ to first N- code blocks among all C- code blocks having the second code block size and insert filler bits having a second filler bit size F- to the remaining M- code blocks. For example, N-, M-, the first filler bit size F+, and the second filler bit size F- may be determined by Equation (<NUM>) below.

In the above example, the first code block size and the second code block size may be determined according to the TBS and the number of code blocks.

An example of the present embodiment may also be expressed by the following Pseudo-code <NUM>. Hereinafter, "a<NUM>, a<NUM>, a<NUM>,. , aA-<NUM>" may be data corresponding to TB. "A" may be TBS.

In the Pseudo-code <NUM> above, pk-A may be a CRC calculated from Ak. In addition, LTB,<NUM> and LTB,<NUM> may be values corresponding to L- and L+, respectively, and LTB,<NUM> and LCB may be the same value. For example, LTB,<NUM> and LTB,<NUM> are <NUM> and <NUM>, respectively, and LCB may be <NUM>. However, the above embodiment is not limited to the above-mentioned values.

Embodiment <NUM> provides a method for performing channel coding by segmenting the number of information bits into one or more parts and determining an H matrix when the number of information bits is greater than or equal to a predetermined value. In the present embodiment, channel coding of one or more segmented information bit blocks is performed using two types of H matrixes.

As described above, <FIG> is a diagram illustrating a method of segmenting a transport block TB into a code block according to an embodiment of the present disclosure. As described above, <FIG> shows the transport block <NUM> having the length N <NUM>, and the CRC <NUM> having the length L <NUM> is inserted to configure the transport block TB-CRC <NUM> inserted with the CRC having the total length B <NUM>. <FIG> shows an example in which the TB-CRC <NUM> having the length B is segmented into a total of C CBs (CB#<NUM><NUM>, CB#<NUM><NUM>, to CB#C <NUM>. The segmented code blocks may have a code block size K, and each code block may be inserted with a CRC <NUM> having a length L <NUM>. The length L value of the CRC inserted in the CBs (CB#<NUM><NUM>, CB#<NUM><NUM>, to CB#C <NUM>) may be different from the L value of the CRC inserted in the TB <NUM>. In addition, the value of the CRC inserted in the CB may be different from the value of the CRC inserted in the TB. The CRC inserted into the TB can be denoted by L- or L +, where L- is an integer less than L+. For example, L- may be <NUM> and L + may be <NUM>. The CRC inserted into the CB may be denoted by LCB.

The method of segmenting the transport block according to Embodiment <NUM> of the present disclosure may include the following steps. Alternatively, values of B' and C may be calculated by Pseudo-code <NUM> described above.

Hereinafter, the steps above are described in greater detail below.

Referring to <FIG>, Embodiment <NUM> of the present disclosure may include the following steps:.

In step <NUM>, the transmitter may determine the total number of C code blocks for segmenting one transport block. First, if N + L- ≤ Kmax, C = <NUM>. Herein, N is a TBS value. If N + L- > Kmax, it is defined as B = N + L+, and the number C of code blocks may be calculated in the same manner as in Equation (<NUM>) above. In the above example, B is a value obtained by adding CRC bits to the TBS by L+. It is possible to minimize the number of code blocks generated by segmentation for the transport block by the operation of Equation (<NUM>) above. In this case, the value of Kmax may have, for example, a value of <NUM>.

The above process may be expressed as Pseudo-code <NUM> as follows.

In the above, Kcb may indicate Kmax, or may be <NUM>. In the above example, A may be the number of information bits and may be an amount of data transmitted from the higher layer. In the Pseudo-code <NUM> above, pk-A may be a CRC calculated from Ak. In addition, LTB,<NUM> and LTB,<NUM> may be values corresponding to L- and L+, respectively, and LTB,<NUM> and LCB may be the same value. For example, LTB,<NUM> and LTB,<NUM> are <NUM> and <NUM>, respectively, and LCB may be <NUM>. However, the above embodiment is not limited to the above-mentioned values. Hereinabove, L is a value indicating the LCB and is a length of the CRC that may be added to each code block.

In step <NUM>, based on the number C of code blocks determined in step <NUM>, the transmitter may determine the total block size B' after the expected code block segmentation. For example, this may be determined based on Equation (<NUM>) below.

According to Equation (<NUM>) above, the total block size B' may be determined by a size B obtained by combining CRCs for the transport block before code block segmentation and the transport block after code block segmentation and a size C·LCB of total CRCs added after code block segmentation.

In steps <NUM> and <NUM>, the transmitter may determine a size K+ of a large code block and a size K- of a small code block. K+ and K- are determined as values satisfying the following Equations (<NUM>) and (<NUM>), respectively, among a set of values produced by the above Table <NUM>. <MAT> <MAT>.

In steps <NUM> and <NUM>, the transmitter may determine the number of C- code blocks having the size of K+ and the number of C- code blocks having the size of K- as follows. <MAT> <MAT>.

Hereinabove, ΔK is defined as ΔK = K+ - K-.

Each of the C+ code blocks has K+ bits, and each of the C- code blocks has K-bits, and each of the K+ bits and the K- bits may include filler bits. The sum of total filler bits may be C+ × K+ +C- × K- - B'. These filler bits may be segmented equally into all code blocks, may be segmented equally into C+ code blocks having K+ bits, may be equally segmented into C- code blocks having K- bits, or may be all included in one code block.

After step <NUM>, the transmitter may determine the code block size. The size of the code block is determined by Kb × Z and is given by Kb = <NUM>. A Z value for determining an H matrix to be used for channel coding may be obtained as shown in Equation (<NUM>) below.

That is, a minimum Z value satisfying Kb × Z >= K+ may be selected from the Z values included in Table <NUM> above.

The transmitter may select the code block size closest to K+ through the operation of Equation (<NUM>) above.

In step <NUM>, the transmitter may determine the number of filler bits. For example, the number of filler bits of each code block may be determined from Equation (<NUM>) or Equation (<NUM>) below. <MAT> <MAT>.

In step <NUM>, the transmitter may insert F+ or F- filler bits determined in step <NUM> into a certain code block. For example, the F+ filler bits are added to a code block having a code block size of K+, and the F+ filler bits may be added to a code block having a code block size of K-. In the method of inserting the filler bits, all filler bits having a size F+ or F- may be inserted into one certain code block. The certain code block may correspond to, for example, a first code block among the code blocks generated after code block segmentation.

Embodiment <NUM>-<NUM> provides a method for performing channel coding by segmenting the number of information bits into one or more parts and determining H matrixes when the number of information bits is greater than or equal to a predetermined value. In the present embodiment, channel coding of one or more segmented information bit blocks is performed using two types of H matrixes.

Embodiment <NUM>-<NUM> of the present disclosure may include the following steps:.

Hereinafter, the steps above are described in detail.

In step <NUM>, the transmitter may determine the total number of C code blocks for segmenting one transport block. First, if N + L- ≤ Kmax, C = <NUM>. Herein, N is a TBS value. If N + L- > Kmax, the transmitter may define B = N + L+ and calculate the number of C code blocks in the same manner as Equation (<NUM>) above. In the above, B is a value obtained by adding CRC bits to the TBS by L+. It is possible to minimize the number of code blocks generated after segmentation for the transport block by the operation of Equation (<NUM>). In this case, the value of Kmax may have, for example, a value of <NUM>.

In step <NUM>, based on the number C of code blocks determined in step <NUM>, the transmitter may determine the total block size B' after the expected code block segmentation. For example, the following Equation (<NUM>) may be followed. According to Equation (<NUM>), the total block size B' may be determined by a size B obtained by combining CRCs for the transport block before code block segmentation and the transport block after code block segmentation and a size C·LCB of total CRCs added after code block segmentation.

In step <NUM>, the code block size K may be determined. K is determined as a value satisfying Equation (<NUM>) below.

Each of the C code blocks has K bits of data bits, and the K bits may include filler bits. The sum of total filler bits may be C × K - B'. These filler bits may be segmented into all code blocks as equally as possible, or may be all included in one code block. The filler bits associated with steps <NUM> and <NUM> may be referred to as first-step filler bits.

The transmitter may select the code block size closest to K through the operation of Equation (<NUM>) above.

In step <NUM>, the transmitter may determine the number of filler bits. For example, the number of filler bits of each code block may be determined from Equation (<NUM>) below.

In step <NUM>, the transmitter may insert the F filler bits determined in step <NUM> into each of the code blocks. For example, F filler bits may be added to a code block having a K code block size. The filler bits associated with steps <NUM> and <NUM> may be referred to as second-step filler bits.

In Embodiment <NUM>-<NUM>, a method of calculating and determining a TBS by a base station and a terminal is described below.

The base station may allocate frequency-time resources to the terminal for scheduling and count how many REs may be used for data transmission. For example, if the base station allocates <NUM> PRBs of a first PRB to a <NUM>-th PRB and allocates <NUM> OFDM symbols for data transmission, a total of 10x12x7 or <NUM> REs are included in the allocated frequency-time resources. Among the <NUM> REs, except for REs used as a demodulation reference signal (DMRS), REs used as channel state information reference signals (CSI-RSs), REs used for control channels that may exist, and the like, the remaining REs may be used to map data signals. Thus, the base station and the terminal may know from the allocation of frequency-time resources how REs are used for data transmission. The frequency-time resources may be transmitted to the terminal through physical layer or higher layer signaling.

In addition, the base station may inform the UE of modulation and channel coding information for scheduling. For example, information about which modulation such as QPSK, <NUM>-QAM, <NUM>-QAM, <NUM>-QAM, and <NUM>-QAM data transmission is performed through and information on the coding rate may be included. This may be referred to as an MCS, values are defined in a predetermined table, and the base station may transmit a DCI including only an index for the MCS to the terminal. It is also possible to transmit information on a modulation order among the modulation information. The modulation orders of QPSK, <NUM>-QAM, <NUM>-QAM, <NUM>-QAM, and <NUM>-QAM is <NUM>, <NUM>, <NUM>, <NUM>, and <NUM>, respectively.

The base station calculates the final TBS value in the following steps:.

In step <NUM>, the base station may calculate the temporary TBS per layer as follows:.

The temporary TBS per layer may be calculated as described above. The value indicated in the MCS table may be a value reflecting the coding rate and the MCS order.

In step <NUM>, as the final TBS, selected is the largest value from values which are less than or equal to the calculated temporary TBS value per layer, among the values that are able to be the TBS according to Table <NUM> below.

In the above Table <NUM>, TBS, may be a small integer such as <NUM> or <NUM>. TBS<NUM> may be an integer such as <NUM>. TBSC may be a multiple of C × <NUM> larger than (C-<NUM>) × (Kmax -LCB)-LTB,<NUM>, or the least common multiple of C and <NUM>. Alternatively, the TBSC may be ceil(((C-<NUM>) ×<NUM> + <NUM>)/LCM(<NUM>,C)) × LCM(<NUM>,C) - <NUM>. In the above, ceil {x} may be a minimum integer greater than or equal to x. LCM (a,b) is the least common multiple of a and b. For example, the TBS may be given as Table <NUM> as follows:.

According to Table <NUM> above, in the case where the TB is segmented into C code blocks and the number of bits of information included in each code block is the same, the number of bits of information included in each code block may be determined in units of <NUM>. Therefore, the granularity of TBS which may be a TBS value according to a given range of a TBS value may be determined as shown in Table <NUM> above. Alternatively, the granularity of TBS may be determined as shown in Table <NUM> below.

In the above, LCM(C, <NUM>) indicates the least common multiple of C and <NUM>. For example, if C is <NUM>, then the LCM(C, <NUM>), i.e., the least common multiple of <NUM> and <NUM>, is <NUM>.

Alternatively, the values that are able to be TBS may be represented by the TBS obtained from Pseudo-code <NUM> below.

In the above, LCM(a,b) is the least common multiple of a and b. Some of the values obtained by Pseudo-code <NUM> may include values given in Table <NUM> below. The following Table <NUM> may include candidates for TBS obtained from the values given with C up to <NUM> in Pseudo-code <NUM> above.

According to the Pseudo-code <NUM>, the candidate values which are able to be TBS may include some or all of the values of TBS+ LTB,<NUM> which is a multiple of <NUM> and a multiple of the number of C code blocks. Alternatively, according to the Pseudo-code <NUM>, the candidate values which are able to be TBS may include some or all of the values of TBS+ LTB,<NUM> which is a multiple of <NUM>*C. In addition, it is also possible to determine the TBS among the values including some or all of the TBS candidate values in Table <NUM> above. The candidate values of the TBS may be TBS values per layer or TBS values corresponding to the entire layer.

Alternatively, it is possible to determine the TBS among the values including some or all of the TBS candidate values in Table <NUM> below. The candidate values of the TBS may be TBS values per layer or TBS values corresponding to the entire layer.

The values which are able to be the TBS are not limited to TBS values determined in Table <NUM>, Table <NUM>, Table <NUM>, Table <NUM>, Table <NUM>, and Table <NUM> above, and special TBS values may be added for another purpose. That is, the values which are able to be the TBS may include values determined in Table <NUM>, Table <NUM>, Table <NUM>, Table <NUM>, Table <NUM>, or Table <NUM> above, and the values which are able to be the TBS may be referred to as a TBS candidate set.

In addition, if the temporary TBS value per layer calculated in step <NUM> is <NUM>, <NUM>, which is the largest value among values less than <NUM>, is selected as the final TBS per layer. This may be the purpose of the base station to secure an actual coding rate less than or equal to a target coding rate.

Step <NUM> may be a step of making the temporary TBS value per layer obtained in step <NUM> be a multiple of a certain integer. For example, the final TBS value may be determined as N × ceil (temporary TBS/N per layer) or according to the invention N × floor (temporary TBS/N per layer) to make the temporary TBS value per layer be a multiple of N. In the above, ceil(X) and floor(X) may indicate a minimum integer greater than X and a maximum integer less than X, respectively. In the above, N may be fixed to an integer such as <NUM>. The N may be determined by considering the case where data transmitted from the higher layer such as MAC or RRC is transmitted in multiples of N.

In step <NUM>, the final TBS may be obtained by multiplying the final TBS per layer selected in step <NUM> by the number of layers.

In the above, the TBS candidate set may vary in an element, a maximum value, and the like depending on a system frequency band, a subcarrier spacing, and the number of OFDM symbols per slot. In addition, the TBS candidate set may be promised in advance by the base station and the terminal, or can be set as the higher signaling for data transmission.

In the above description, the final TBS is obtained by multiplying the number of calculated TBSs per layer and the number of layers. However, such a process may adopt a process of approximating the TBS to the value which is able to be the TBS in a step B, after calculating the TBS considering the number of layers in a step A. Step A may be calculated as follows:.

That is, the base station may calculate the temporary TBS by additionally considering the number of layers in the calculation of the step <NUM>.

Step B may be similar to step <NUM>, as the process of obtaining the final TBS by considering the TBS candidate set from the TBS value obtained in step A.

Embodiment <NUM> provides a method for performing channel coding by segmenting uplink control information into two or more blocks and transmitting the channel coding. In the present embodiment, uplink control information (UCI) may include channel measurement information, HARQ-ACK/NACK information, scheduling request bits, and the like.

When there are N bits of the UCI, the UCI may be segmented into two or more blocks if the UCI is greater than N_max - L. In the above, N_max is a unit in which channel coding such as a polar code is performed, and may be regarded as a maximum length of a channel coding block. That is, N_max may be a maximum value of information bits that may be included in one code block in the polar code. In the above, L may be a length of a CRC check bit for checking whether the information is correct when performing channel code decoding using the polar code, etc. For example, L may be a value of <NUM>, <NUM>, or the like. If the number of code blocks used for channel coding of the UCI is C, C may be obtained as follows: <MAT>.

The <MAT> operation is a function corresponding to the smallest integer that is greater than or equal to a real number x in the rounding operation for x. C+ code blocks of the C code blocks each includes the UCI of the <MAT> bit, and the C- code blocks each includes the UCI of the <MAT> bit. In the above, C+ may be obtained as <MAT>. Also, C- may be obtained as C - C+.

For example, assuming that the number of UCI bits to be transmitted by the terminal is <NUM> bits, the length of the maximum code block taken by the polar code is <NUM> and the length of the CRC is <NUM> bits, C may be determined as <MAT>. Also, C+ is <MAT> and C- is <NUM>-<NUM> = <NUM>. That is, a total of <NUM> UCls are segmented into <NUM> code blocks, one code block thereof may include <MAT> bits in the UCI, and the remaining <NUM> code blocks may be segmented to include <NUM> bits of each UCI.

<FIG> is a block diagram illustrating a structure of a terminal according to an embodiment.

Referring to <FIG>, the terminal according to the embodiment of the present disclosure may include a receiver <NUM>, a transmitter <NUM>, and a processor <NUM>. The receiver <NUM> and the transmitter <NUM> are collectively referred to as a transceiver. The transceiver may transmit/receive a signal to/from a base station. The signal may include downlink control information and data. To this end, the transceiver may include an RF transmitter that up-converts and amplifies a frequency of the transmitted signal, an RF receiver that low-noise-amplifies the received signal and down-converts the frequency, or the like. Further, the transceiver may receive a signal through a radio channel and output the received signal to the processor <NUM> and transmit the signal output from the processor <NUM> on the radio channel.

The processor <NUM> may control a series process to operate the terminal according to the embodiment of the present disclosure as described above.

In addition, the processor <NUM> may be referred to as a controller. In the present disclosure, the controller may be defined as a circuit, an application specific integrated circuit, or at least one processor.

The controller may control the overall operation of the terminal according to an embodiment of the present disclosure. For example, the controller may control a signal flow between each block to perform the operation according to the above-described flowchart.

<FIG> is a block diagram illustrating a structure of a base station according to an embodiment.

Referring to <FIG>, the base station may include at least one of a receiver <NUM>, a transmitter <NUM>, and a processor <NUM>. The receiver <NUM> and the transmitter <NUM> are collectively referred to as a transceiver in an embodiment of the present disclosure. The transceiver may transmit/receive a signal to/from a terminal. The signal may include downlink control information and data. To this end, the transceiver may include an RF transmitter that up-converts and amplifies a frequency of the transmitted signal, an RF receiver that low-noise-amplifies the received signal and down-converts the frequency, or the like. Further, the transceiver may receive a signal on a radio channel and output the received signal to the processor <NUM> and transmit the signal output from the processor <NUM> on the radio channel.

The processor <NUM> may control a series process so that the base station may be operated according to an embodiment of the present disclosure as described above.

The processor <NUM> may be referred to as a controller. In the present disclosure, the controller may be defined as a circuit, an application specific integrated circuit, or at least one processor.

The embodiments of the present disclosure and the accompanying drawings have been provided only as examples in order to assist in understanding the present disclosure and are not intended to limit the scope of the present disclosure. That is, it is obvious to those skilled in the art to which the present disclosure pertains that other examples based on the present disclosure may be made without departing from the scope of the present disclosure. Further, each embodiment may be combined and operated as needed. For example, some of the first to fifth embodiments of the present disclosure may be combined to operate a base station and a terminal. In addition, although the above embodiments are presented based on the NR system, other modifications based on the present disclosure may be applicable to other systems such as the FDD or TDD LTE systems.

In addition, in the accompanying drawings illustrating the method of the present disclosure, the order of description may not necessarily correspond to the order of execution, and the posterior relationship may be changed or executed in parallel.

Alternatively, in the accompanying drawings illustrating the method of the present disclosure, some of the elements may be omitted and only some of the elements may be included without impairing the present disclosure.

In addition, in the method of the present disclosure, some or all of the contents included in each embodiment may be combined and executed without departing from the scope of the present disclosure.

Claim 1:
A method performed by a terminal in a wireless communication system, the method comprising:
receiving, from a base station, downlink control information, DCI, including modulation and coding scheme, MCS, information and resource allocation information;
identifying a first temporary transport block size, TBS, based on an MCS order and a coding rate indicated by the MCS information, a number of resource elements, REs, allocated to data transmission, and a number of layers, the number of REs being determined based on the resource allocation information;
identifying a second TBS based on a floor function, in which an input is the first temporary TBS; and
identifying a TBS based on the second TBS and a TBS candidate set,
wherein the TBS candidate set includes values separated by an interval among a plurality of intervals, each of the plurality of intervals being <NUM> or a multiple of <NUM>,
wherein a first interval between first consecutive values included in the TBS candidate set is larger than a second interval between second consecutive values included in the TBS candidate set, and
wherein the first consecutive values are greater than or equal to a predetermined value, and the second consecutive values are less than the predetermined value.