KR101846166B1 - Method for transmitting control information in wireless communication system and apparatus therefor - Google Patents

Abstract

The present application discloses a method for transmitting information data using a Reed-Muller coding scheme in a wireless communication system. Specifically, the method comprises: setting a number of resource elements for transmitting the information data; if the bit size of the information data is equal to or greater than a predetermined number, assigning the even data of the information data as first information data Assigning odd-numbered data of the information data as second information data, applying RM coding to each of the first information data and the second information data, and coding the first information data and the second information data, Combining the second information data, and transmitting using the set number of resource elements.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for transmitting control information in a wireless communication system,

The present invention relates to a wireless communication system. More particularly, the present invention relates to a method for transmitting control information in a wireless communication system and an apparatus therefor.

In a mobile communication system, a user equipment can receive information from a base station through a downlink, and a user equipment can also transmit information through an uplink. The information transmitted or received by the user equipment includes data and various control information, and various physical channels exist depending on the type of information transmitted or received by the user equipment.

1 is a view for explaining physical channels used in a 3rd Generation Partnership Project (3GPP) LTE (Long Term Evolution) system, which is an example of a mobile communication system, and a general signal transmission method using the same.

The user equipment that is powered on again after the power is turned off or a new user enters the cell performs an initial cell search operation such as synchronizing with the base station in step S101. To this end, the user equipment receives a Primary Synchronization Channel (P-SCH) and a Secondary Synchronization Channel (S-SCH) from a base station and synchronizes with the base station and acquires information such as a cell ID have. Thereafter, the user equipment can receive the physical broadcast channel from the base station and obtain the in-cell broadcast information. Meanwhile, the UE may receive a downlink reference signal (DLRS) in the initial cell search step to check the downlink channel state.

Upon completion of the initial cell search, the user equipment receives a physical downlink control channel (PDCCH) and a physical downlink control channel (PDSCH) according to the physical downlink control channel information in step S102 More specific system information can be obtained.

On the other hand, the user equipment that has not completed the connection with the base station can perform a random access procedure such as steps S103 to S106 to complete the connection to the base station. To this end, the user equipment transmits a feature sequence as a preamble through a physical random access channel (PRACH) (S103), and transmits the physical sequence through a physical downlink control channel and a corresponding physical downlink shared channel A response message for the random access may be received (S104). In the case of the contention-based random access except for the handover, there is a conflict resolution such as transmission of an additional physical random access channel (S105) and physical downlink control channel and corresponding physical downlink shared channel reception (S106) (Contention Resolution Procedure).

The user equipment that has performed the above-described procedure then transmits physical downlink control channel / physical downlink shared channel reception (S107) and physical uplink shared channel (PUSCH) as general uplink / downlink signal transmission procedures, / Physical uplink control channel (PUCCH) transmission (S108).

2 is a diagram for explaining a signal processing procedure for a user equipment to transmit an uplink signal.

The scrambling module 210 of the user equipment may use the user equipment specific scrambling signal to scramble the transmitted signal to transmit the uplink signal. The scrambled signal is input to the modulation mapper 220 and is converted into a complex signal by BPSK (Binary Phase Shift Keying), QPSK (Quadrature Phase Shift Keying) or 16QAM (Quadrature Amplitude Modulation) And is then modulated into a complex symbol. The modulated complex symbol is then processed by the transform precoder 230 and then input to a resource element mapper 240 which transforms the complex symbol into a time-frequency resource element . ≪ / RTI > The signal thus processed can be transmitted to the base station via the antenna via the SC-FDMA signal generator 250. [

3 is a diagram for explaining a signal processing procedure for a base station to transmit a downlink signal.

In a 3GPP LTE system, a base station can transmit one or more code words in a downlink. Thus, the one or more codewords may be processed as complex symbols through the scrambling module 301 and the modulation mapper 302, respectively, as in the uplink of FIG. 2, And each layer is multiplied by a precoding matrix selected according to a channel state by the precoding module 304 and allocated to each transmission antenna. Each of the transmission signals for each antenna thus processed is mapped to a time-frequency resource element to be used for transmission by the resource element mapper 305, and then transmitted through an OFDM (Orthogonal Frequency Division Multiple Access) Lt; / RTI >

In a mobile communication system, when a user equipment transmits a signal in an uplink, a Peak-to-Average Ratio (PAPR) may be more problematic than a case where a base station transmits a downlink signal. Therefore, unlike the OFDMA scheme used for downlink signal transmission, the uplink signal transmission uses a single carrier-frequency division multiple access (SC-FDMA) scheme as described above with reference to FIG. 2 and FIG.

4 is a diagram for explaining an SC-FDMA scheme for uplink signal transmission and an OFDMA scheme for downlink signal transmission in a mobile communication system.

A user equipment for uplink signal transmission and a base station for downlink signal transmission are connected to a serial-to-parallel converter 401, a subcarrier mapper 403, an M-point IDFT module 404, Cyclic Prefix) < / RTI >

The user equipment for transmitting signals in the SC-FDMA scheme additionally includes a parallel-to-serial converter 405 and an N-point DFT module 402, and the N-point DFT module 402 Is characterized in that the transmission signal has a single carrier property by canceling a part of the IDFT processing influence of the M-point IDFT module 404 by a certain amount. 5 is a view for explaining a signal mapping method in a frequency domain for satisfying a single carrier characteristic in the frequency domain. In FIG. 5, (a) shows a localized mapping method, and (b) shows a distributed mapping method. Currently, the 3GPP LTE system defines a local type mapping method.

Meanwhile, a modified version of SC-FDMA, clustered SC-FDMA, will be described. The clustered SC-FDMA sequentially divides the DFT process output samples into sub-groups in the sub-carrier mapping process between the DFT process and the IFFT process, and separates the sub- And maps the data to a subcarrier area. The data may include a filtering process and a cyclic extension process.

In this case, the subgroup can be named as a cluster, and the cyclic extension is a scheme in which the maximum delay spread of the channel between consecutive symbols in order to prevent mutual intersymbol interference (ISI) while each subcarrier symbol is transmitted through a multipath channel (Guard Interval) is inserted.

The present invention provides a method for transmitting control information in a wireless communication system in a wireless communication system and an apparatus therefor

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory and are not restrictive of the invention, unless further departing from the spirit and scope of the invention as defined by the appended claims. It will be possible.

A method of transmitting information data using a Reed-Muller coding scheme in a wireless communication system, which is an aspect of the present invention, includes the steps of: setting a number of resource elements for transmitting the information data; Assigning even-numbered data of the information data as first information data and allocating odd-numbered data of the information data as second information data when the bit size of the information data is a predetermined number or more; Applying RM coding to each of the first information data and the second information data; And combining the encoded first information data and the second information data, and transmitting the combined information using the set number of resource elements.

According to another aspect of the present invention, a transmitting apparatus in a wireless communication system calculates the number of resource elements for transmitting information data, and when the bit size of the information data is equal to or greater than a predetermined number, Numbered data is assigned as first information data, odd-numbered data of the information data is assigned as second information data, RM coding is applied to each of the first information data and the second information data, A processor for combining the encoded first information data and second encoded information data; And a transmission module for transmitting the combined first information data and second information data using the set number of resource elements.

Here, the predetermined number is 12 bits, and the bit sizes of the encoded first information data and second encoded information data are 32 bits.

Preferably, the information data is uplink control information (UCI), and the uplink control information is transmitted through an uplink physical shared channel (PUSCH). More preferably, the uplink control information includes Hybrid Automatic Retransmission Request (HARQ) -Ack / NACK (Acknowledgment / Negative Acknowledgment) data or an RI (Rank Indicator).

이고, RM 부호기의 입력 데이터가

인 경우, 제 1 정보 데이터에 대응하는 입력 데이터

및 제 2 정보 데이터에 대응하는 입력 데이터

는 아래 수학식에 따라 결정되는 것을 특징으로 한다.More specifically, if the information data is

And the input data of the RM encoder is

, The input data corresponding to the first information data

And input data corresponding to the second information data

Is determined according to the following equation.

≪ Equation &

(단, i는 짝수)

( I is an even number)

(단, i는 홀수)

(Where i is an odd number)

In a wireless communication system, a transmitting end can effectively encode control information according to the present invention.

The effects obtained by the present invention are not limited to the above-mentioned effects, and other effects not mentioned can be clearly understood by those skilled in the art from the following description will be.

BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of the specification, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the invention.
1 is a view for explaining a physical channel used in a 3GPP LTE system, which is an example of a mobile communication system, and a general signal transmission method using the same.
2 is a diagram for explaining a signal processing procedure for a user equipment to transmit an uplink signal.
3 is a diagram for explaining a signal processing procedure for a base station to transmit a downlink signal.
4 is a diagram for explaining an SC-FDMA scheme for uplink signal transmission and an OFDMA scheme for downlink signal transmission in a mobile communication system.
5 is a view for explaining a signal mapping method in a frequency domain for satisfying a single carrier characteristic in the frequency domain.
6 is a diagram illustrating a signal processing process in a cluster SC-FDMA according to an embodiment of the present invention in which DFT process output samples are mapped to a single carrier.
FIGS. 7 and 8 are diagrams illustrating a signal processing process in a cluster SC-FDMA according to an embodiment of the present invention in which DFT process output samples are mapped to multi-carriers.
9 is a diagram illustrating a signal processing process in a segment SC-FDMA system according to an embodiment of the present invention.
10 is a diagram for explaining a signal processing procedure for transmitting a reference signal (hereinafter, referred to as RS) in the uplink.
11 is a diagram showing a structure of a subframe for transmitting RS in the case of a standard cyclic prefix (normal CP).
12 is a diagram showing the structure of a subframe for transmitting RS in the case of an extended CP (extended CP).
FIG. 13 is a block diagram illustrating a process of a transmission channel for a UL shared channel; FIG.
14 is a diagram for explaining a mapping method of physical resources for transmission of uplink data and control channel.
15 is a flowchart illustrating a method of efficiently multiplexing data and control channels on an uplink shared channel.
16 is a block diagram illustrating a method of generating transmission signals of data and control channels.
17 is a diagram for explaining a codeword-to-layer mapping method.
18 is a diagram for explaining a method of dividing information data into groups for applying a dual RM coding scheme in a second embodiment of the present invention.
19 is another diagram for explaining a method of dividing information data into groups in order to apply the dual RM coding scheme in the second embodiment of the present invention.
20 is a diagram showing a coding chain for dual RM coding according to a second embodiment of the present invention.
21 is a block diagram illustrating a communication apparatus according to an embodiment of the present invention.

The configuration, operation and other features of the present invention can be easily understood by the preferred embodiments of the present invention described with reference to the accompanying drawings. The embodiments described below are examples in which the technical features of the present invention are applied to a system using a plurality of orthogonal subcarriers. For convenience, the present invention will be described using an IEEE 802.16 system. However, the present invention can be applied to various wireless communication systems including 3GPP (3rd Generation Partnership Project) system.

In addition, the specific terms used in the following description are provided to aid understanding of the present invention, and the use of such specific terms may be changed into other forms without departing from the technical idea of the present invention.

6 is a diagram illustrating a signal processing process in a cluster SC-FDMA according to an embodiment of the present invention in which DFT process output samples are mapped to a single carrier. 7 and 8 are diagrams illustrating a signal processing process in which DFT process output samples are mapped to multi-carriers in cluster SC-FDMA according to an embodiment of the present invention.

FIG. 6 illustrates an example in which cluster SC-FDMA is applied in an intra-carrier, and FIGS. 7 and 8 correspond to an example in which cluster SC-FDMA is applied in an inter-carrier. 7 illustrates a case where a contiguous component carrier is allocated in a frequency domain and a signal is generated through a single IFFT block when subcarrier spacing between adjacent component carriers is aligned And FIG. 8 shows a case in which signals are generated through a plurality of IFFT blocks because component carriers are not adjacent in a situation where component carriers are allocated non-contiguously in the frequency domain.

In the segment SC-FDMA, the number of IFFTs is the same as that of any number of DFTs. As the relationship between the DFT and the IFFT has a one-to-one relationship, the DFT spreading of the existing SC-FDMA and the frequency sub- It may be expressed as NxSC-FDMA or NxDFT-s-OFDMA as an extension. In the present invention, this is referred to as a segmented SC-FDMA. 9 is a diagram illustrating a signal processing process in a segment SC-FDMA system according to an embodiment of the present invention. As shown in FIG. 9, the segment SC-FDMA groups all the time-domain modulation symbols into N groups (N is an integer larger than 1) to perform a DFT process on a group basis in order to relax a single carrier characteristic condition .

10 is a diagram for explaining a signal processing procedure for transmitting a reference signal (hereinafter, referred to as RS) as an uplink. As shown in FIG. 10, the data is generated in a time domain and frequency-mapped through a DFT precoder, and then transmitted through an IFFT, whereas the RS skips the process through a DFT precoder, (S11), and is transmitted after sequentially performing the localization mapping S12, the IFFT (S13) process, and the cyclic prefix (CP) attaching process (S14).

FIG. 11 illustrates a structure of a subframe for transmitting RS in the case of a standard cyclic prefix (normal CP), and FIG. 12 illustrates a structure of a subframe for transmitting RS in an extended cyclic prefix Fig. 11, the RS is transmitted through the fourth and eleventh OFDM symbols, and the RS is transmitted through the third and ninth OFDM symbols in FIG.

The processing structure of the uplink shared channel as a transport channel will be described below. FIG. 13 is a block diagram illustrating a process of a transmission channel for a UL shared channel; FIG. As shown in FIG. 13, the data information to be multiplexed together with the control information includes a cyclic redundancy check (TB) CRC (Cyclic Redundancy Check) 130 attached to a transport block (TB) ), And is divided into a plurality of code blocks (hereinafter referred to as "CB") according to TB size, and a CRC for CB is attached to several CBs (131). Channel encoding is performed on the resultant value (132). In addition, the channel-coded data are subjected to Rate Matching 133, and then the CBs are combined again (S134), and the combined CBs are subjected to CQI / PMI (Channel Quality Information / Precoding Matrix Index) (135).

Meanwhile, the CQI / PMI is separately channel-encoded with the data (136). The channel encoded CQI / PMI is multiplexed with the data (135).

Also, RI (Rank Indication) is channel-encoded separately from data (137).

In case of ACK / NACK (Acknowledgment / Negative Acknowledgment), channel coding is performed separately from data, CQI / PMI and RI (138). The multiplexed data and the CQI / PMI, separately channel-encoded RI, and ACK / NACK are channel interleaved to generate an output signal (139).

Meanwhile, in a LTE uplink system, a physical resource element (hereinafter referred to as RE) for data and a control channel will be described.

14 is a diagram for explaining a mapping method of physical resources for transmission of uplink data and control channel.

As shown in FIG. 14, the CQI / PMI and data are mapped to RE on a time-first basis. The encoded ACK / NACK is punctured around a demodulation reference signal (DM RS) symbol, and the RI is mapped to an RE next to the RE where the ACK / NACK is located. The resources for RI and ACK / NACK can occupy up to four SC-FDMA symbols. When data and control information are simultaneously transmitted on the uplink shared channel, the order of the mapping is the sequence of RI, CQI / PMI, concatenation of data, and ACK / NACK. That is, after the RI is mapped first, the CQI / PMI and the data concatenation are mapped to the RE excluding the RE to which the RI is mapped in a time priority manner. The ACK / NACK is mapped while puncturing the concatenation of data with the already mapped CQI / PMI.

As described above, a single carrier characteristic can be satisfied by multiplexing data and uplink control information (UCI) such as CQI / PMI. Therefore, uplink transmission maintaining a low CM (Cubic Metric) can be achieved.

In a system in which an existing system is improved (for example, LTE Rel-10), at least one transmission method of SC-FDMA and cluster DFTs OFDMA on each component carrier for each user equipment performs uplink transmission And can be applied together with UL-MIMO (Uplink-MIMO) transmission.

15 is a flowchart illustrating a method of efficiently multiplexing data and control channels on an uplink shared channel.

As shown in FIG. 15, the user equipment recognizes a rank of data of a Physical Uplink Shared Channel (PUSCH) (S150). Then, the user equipment transmits uplink control channel (the control channel refers to uplink control information (UCI) such as CQI, ACK / NACK, and RI) at the same rank as the rank of the data. (S151). Further, the user equipment multiplexes the data and the control information (S152). Then, after mapping the data and the CQI in a time-first manner, mapping the RI to the designated RE and mapping the ACK / NACK to puncturing the RE around the DM- Interleaving (channel interleaving) may be performed (S153).

Thereafter, the data and the control channel may be modulated into QPSK, 16QAM, 64QAM or the like according to the MCS table (S154). At this time, the modulation step may move to another position (for example, the modulation block is movable before the data and control channel multiplexing step). Channel interleaving may also be performed on a codeword-by-codeword basis or on a layer-by-codeword basis.

16 is a block diagram illustrating a method of generating transmission signals of data and control channels. The position of each block can be changed in the way of application.

Assuming two codewords, channel coding is performed for each codeword (160) and rate matching is performed (161) according to the given MCS level and the size of the resource. The encoded bits may then be scrambled 162 in a cell-specific or UE-specific or codeword-specific manner.

A codeword to layer mapping is then performed 163. In this process, the operation of layer shift or permutation may be included.

17 is a diagram for explaining a codeword-to-layer mapping method. The codeword-to-layer mapping may be performed using the rules shown in FIG. The precoding position in FIG. 17 may be different from the precoding position in FIG.

Control information such as CQI, RI, and ACK / NACK is channel encoded (165) according to a given specification. At this time, the CQI, RI, and ACK / NACK may be encoded using the same channel code for all codewords, and may be encoded using different channel codes for each codeword.

The number of encoded bits may then be changed by the bit size control (166). The bit size control unit may be unified with the channel coding block 165. The signal output from the bit size control unit is scrambled (167). At this time, the scrambling may be performed cell-specific, layer-specific, codeword-specific, or UE-specific

The bit size control unit can operate as follows.

(1) The controller recognizes the rank (n_rank_pusch) of data for the PUSCH.

(N_rank_control = n_rank_pusch), and the number of bits (n_bit_ctrl) for the control channel is multiplied by the rank of the control channel so that the number of bits (n_rank_control) .

One way to do this is simply copy and repeat the control channel. At this time, the control channel may be an information level before channel coding, or may be an encoded bit level after channel coding. That is, for example, in the case of control channels [a0, a1, a2, a3] with n_bit_ctrl = 4 and n_rank_pusch = 2, the number of extended bits (n_ext_ctrl) is [a0, a1, a2, a3, a0, a1, a2, a3].

When the bit size control unit and the channel encoding unit are configured as one unit, the encoded bits can be generated by applying channel coding and rate matching defined in the existing system (for example, LTE Rel-8).

In addition to the bit size control unit, bit level interleaving may be performed to further randomize each layer. Or equivalently, interleaving at the modulation symbol level may be performed.

The data for the CQI / PMI channel and the two codewords may be multiplexed by a data / control multiplexer (164). Then, the channel interleaver maps the CQI / PMI according to the time priority mapping scheme, while allowing ACK / NACK information to be mapped to REs around the uplink DM-RS in both slots in the subframe.

Then, modulation is performed for each layer (169), and DFT precoding (170), MIMO precoding (171), RE mapping (172), and the like are sequentially performed. Then, an SC-FDMA signal is generated and transmitted through the antenna port (173).

The functional blocks are not limited to the positions shown in FIG. 16, and their positions may be changed in some cases. For example, the scrambling blocks 162 and 167 may be located after the channel interleaving block. In addition, the codeword-to-layer mapping block 163 may be located after the channel interleaving block 168 or after the modulation mapper block 169.

In the present invention, a UCI channel coding method and a resource allocation and transmission scheme for UCI such as CQI, ACK / NACK, and RI are transmitted on a PUSCH. Although the present invention is basically based on transmission in an SU-MIMO environment, it can be applied to a single antenna transmission, which is a special case of SU-MIMO.

When the UCI and data are transmitted on the PUSCH on the current SU-MIMO, they are transmitted using the following technique. The location of the UCI on the PUSCH will be described.

The CQI is mapped to the RE by using the same modulation order and constellation as the data to the RE excluding the RE to which the RI is mapped in the time-first mapping scheme. In the case of SU-MIMO, the CQI is spread and transmitted in one codeword , The codeword to which the CQI is transmitted is transmitted to the codeword 0 when the codeword of the two codewords is a codeword having a high MCS level and the codeword MCS level is the same. The ACK / NACK is arranged while puncturing the concatenation of CQI and data already mapped to symbols located on both sides of the reference signal. Since the reference signal is located in the 3 < th >Lt; RTI ID = 0.0 > subcarrier < / RTI > In this case, the ACK / NACK symbols are mapped in order of 2, 11, 9, and 4 symbols. The RI is mapped to a symbol located next to the ACK / NACK and is mapped first among all information (data, CQI, ACK / NACK, RI) transmitted to the PUSCH. Specifically, RI is mapped upward starting from the lowest subcarrier of the 1 st, 5 th, 8 th, and 12 th symbols. At this time, the RI symbols are mapped in order of the 1 st, 12 th, 8 th, and 5 th symbols. In particular, ACK / NACK and RI are mapped in the same manner as QPSK using only four corners of the constellation diagram when the size of information bits is 1 bit or 2 bits, and for information bits of 3 bits or more, Can be mapped using all constellations of degree. In addition, ACK / NACK and RI transmit the same information using the same resources at the same position in all layers.

Next, a method of calculating the number of resource elements for UCI on the PUSCH will be described. First, the number of resource elements for CQI and ACK / NACK (or RI) transmitted on the PUSCH can be calculated according to the following equations (1) and (2), respectively.

Here, the number of resource elements for CQI and ACK / NACK (or RI) may be expressed by the number of coded modulation symbols.

를 아래 표 1을 이용한 RM(Reed-Muller) 코딩이 적용되어 32 비트의 출력 시퀀스를 생성한다. 또한, CQI의 페이로드 사이즈가 11 비트를 초과하는 경우라면, 8bit의 CRC를 덧붙인 후 TBCC(Tail biting convolutional coding)이 적용될 수 있다.Next, a channel coding method for UCI transmitted on the PUSCH will be described. First, in the case of CQI, if the payload size is 11 bits or less, the input sequence (i.e., information data)

(Reed-Muller) coding using Table 1 below to generate a 32-bit output sequence. In addition, if the payload size of the CQI exceeds 11 bits, Tail biting convolutional coding (TBCC) may be applied after 8-bit CRC is added.

라면 아래 표 2와 같이 변조 차수에 따라 채널 코딩이 수행된다. 또한, ACK/NACK과 RI의 정보 데이터 사이즈가 2 비트라면, 즉 입력 시퀀스가

인 경우라면, 아래 표 3과 같이 변조 차수에 따라 채널 코딩이 수행된다. 특히 표 3에서

는 코드워드 0을 위한 ACK/NACK 또는 RI 데이터에 대응하고,

는 코드워드 1을 위한 ACK/NACK 또는 RI 데이터에 대응하며,

은

이다. 특히 표 2 및 표 3에서 x는 1의 값을, y는 앞의 값의 반복을 의미한다.ACK / NACK transmitted on the PUSCH and channel coding of RI will be described. If the information data size of ACK / NACK and RI is 1 bit, that is, if the input sequence is

Channel coding is performed according to the modulation order as shown in Table 2 below. If the information data size of ACK / NACK and RI is 2 bits, that is, if the input sequence is

Channel coding is performed according to the modulation order as shown in Table 3 below. In particular,

Corresponds to ACK / NACK or RI data for code word 0,

Corresponds to ACK / NACK or RI data for codeword 1,

silver

to be. In particular, in Table 2 and Table 3, x denotes a value of 1, and y denotes a repetition of the previous value.

However, if the information data size of ACK / NACK and RI is 3 bits or more and 11 bits or less, RM (Reed-Muller) coding using Table 1 below is applied to generate a 32-bit output sequence.

는 아래 수학식 3과 같이 표현되며, B=32이다.In particular, in the case of RM (Reed-Muller) coding using Table 1,

Is expressed by the following equation (3), and B = 32.

개의 자원 요소에 맵핑시키기 위하여 아래 수학식 4에 따라 레이트 매칭을 수행할 수 있다.Finally, the BCI-encoded UCI, i.e. ACK / NACK or RI data, is calculated according to Equations 1 and 2

Rate mapping may be performed according to Equation (4) below.

Conventional channel coding is implemented assuming a single carrier environment. However, when a multi-carrier scheme such as the LTE-A system is applied, UCI corresponding to each component carrier, that is, ACK / NACK or RI data is generally combined in the order of component carriers. Therefore, as many as the number of aggregated component carriers The size of the UCI may also increase proportionally. In particular, in the case of RI, an information data size of up to 3 bits can be obtained in an existing single carrier, but an information data size can be up to 15 bits in an environment in which five component carriers can be aggregated. Therefore, since a maximum of 11 bits of information data can be encoded by the currently implemented RM coding scheme, a new technique capable of decoding UCI in a multicarrier environment is needed. Hereinafter, the encoding scheme and the rate matching scheme are classified according to the size of the UCI.

≪ First Embodiment - When the information data size is 11 bits or less >

In case of RI or ACK / NACK having an information data size of 3 bits or more even in a single carrier environment or a multicarrier environment, the encoded output data has a bit size of 32 bits in size. However, when the number of resource elements is calculated according to equations (1) and (2), only a very small number of resource elements may be allocated according to the bit size of the information data. In this case, in the rate matching step performed by Equation (4), codewords encoded by RM coding may be excessively punctured and performance degradation may occur.

Specifically, the RI or ACK / NACK uses only the constellation points of the corner points instead of modulating the codewords in which RI or ACK / NACKs are encoded with RM coding using all the constellation diagrams for robust transmission regardless of channel conditions It is common to map only two bits to one resource element. Therefore, a total of 16 resource elements are required to transmit all 32-bit encoded codewords. If the number of calculated resource elements is smaller than 16, puncturing is applied to code words as rate matching. However, since puncturing can be judged as an error on the receiving side, even if the codeword has the maximum value 16 of the minimum distance between codes of the RM code, if the data of four symbols are punctured, Can not be guaranteed. In order to maintain the performance of the puncturing, puncturing is sequentially performed in units of two bits from the last bit in the code word, so that the performance deterioration can be further increased. Hereinafter, as a first embodiment of the present invention, a method for preventing deterioration in performance due to the purging is proposed.

1) In the first embodiment of the present invention, when ACK / NACK or RI has information data sizes of a specific number, that is, information data having a size of 3 bits or more, ACK / NACK or resource elements It is proposed to set the minimum value to the number. For example, when the information data size of ACK / NACK or RI is 3 bits or more, the number of resource elements to be allocated to transmit ACK / NACK or RI is set to at least 16. Here, the minimum value of the number of resource elements allocated to ACK / NACK or RI is preferably half or more of the number of bits of information data size. That is, the number of REs allocated to ACK / NACK and RI, that is, the number of coded modulation symbols, can be calculated by Equation (5) and Equation (6).

은 다음 수학식 7과 같이 정해질 수 있다.The minimum value of the number of resource elements allocated to ACK / NACK or RI

Can be determined as shown in Equation (7).

는 ACK/NACK 또는 RI의 정보 데이터의 비트 사이즈이고,

은 변조 차수에 따른 심볼 당 비트 사이즈로 QPSK 인 경우 2, 16QAM인 경우 4, 64QAM인 경우 6이다.At this time,

Is the bit size of ACK / NACK or RI information data,

Is 2 bits for QPSK, 4 for 16QAM, and 6 for 64QAM according to the modulation order.

은 다음 수학식 8 내지 수학식 10과 같이 정해질 수 있다.On the other hand, in case of ACK / NACK and RI, the criterion of the code rate of RM coding is 1/3. Therefore, the minimum number of resource elements allocated to ACK / NACK or RI

Can be defined by the following equations (8) to (10).

을 구한 예이다.Tables 4 to 7 below show the minimum number of resource elements allocated to ACK / NACK or RI using Equation 7 to Equation 10,

.

라면, 이를 펑처링 시 최적의 성능을 낼 수 있도록 기 설정된 규칙인 퍼뮤테이션 함수

을 통하여 재정렬 한 후, 퍼뮤테이션된 순서에 따라 인덱스 순서대로 또는 인덱스의 역순으로 순차적으로 자원 요소에 할당하거나 혹은 순차적으로 펑처링을 수행할 수 있다. 즉, 8 개의 부호화된 출력 데이터가 자원 요소에 할당되는 경우, 할당되는 데이터는

이 아닌

이 된다.2) In the first embodiment, when ACK / NACK or RI is punctured through a rate matching process after RM coding is encoded, puncturing may be performed in a predetermined specific sequence. Specifically, when ACK / NACK or RI is allocated to a given number of resource elements, allocation order can be determined by allocating 1 bit, 2 bits, or a specific number of bits to each resource element. For example, ACK / NACK or RI-encoded output data

In order to achieve optimum performance in puncturing, a permutation function

And sequentially allocate the resource elements in the index order or in the reverse order of the index according to the permutated order, or sequentially perform puncturing. That is, when eight coded output data are allocated to a resource element, the allocated data is

is not

.

값을 사용할 수 있다. RM 코딩 기법으로 부호화한 출력 데이터 즉, 코드워드를 펑처링하는 경우, 그 영향은 정보 데이터의 비트 사이즈에 따라 다르다. 따라서, 펑처링에 의한 코드워드의 최소 거리가 영향을 받는 정도에 따라,

값을 다르게 설정 할 수 있다. 예를 들어, 코드워드를 펑처링하는 경우, 최소 거리가 빨리 0이 되는 정보 데이터의 비트 사이즈에 대해서는 비교적 큰

값을 설정하는 것이다.3) In addition, in the first embodiment, different ACK / NACK and RI information data sizes

Value can be used. When puncturing the output data encoded by the RM coding scheme, that is, the codeword, the influence depends on the bit size of the information data. Therefore, depending on the degree to which the minimum distance of the code word due to puncturing is affected,

Values can be set differently. For example, when puncturing a code word, the bit size of the information data in which the minimum distance quickly becomes 0 is relatively large

Value.

은 아래 수학식 11과 같이 출력 데이터의 비트 사이즈 최소값으로 설정할 수 있다.It is also possible to set the minimum bit size of the encoded output data after rate matching in order to achieve the same purpose . That is, in Equation (5), the minimum value

Can be set to the minimum bit size of the output data as shown in Equation (11) below.

≪ Second Embodiment - When the information data size is 12 bits or more >

When the information data size of ACK / NACK and RI is 12 bits or more, the PUSCH groups information data into two or more pieces of data of the same bit size or different bit sizes, and uses the divided pieces of information data on the PUSCH (32 , 0) RM coding scheme to perform channel coding.

That is, when data is multiplexed with UCI such as RI or ACK / NACK under a multicarrier environment, the information data bits of UCI are divided into two or more groups of RI, and each group can be encoded into one code word . In this case, if the bit size of the information data is 3 to 11 bits, the (32, 0) RM coding scheme using Table 1 can be applied, so that the bit size of the information data included in each group is 6 to 10 bits (32,0) RM coding scheme, that is, a dual RM coding scheme can be applied to each group. Hereinafter, a method of dividing information data into groups will be described first, and a method of calculating the number of resource elements for allocating encoded information data when applying the dual (32, 0) RM coding scheme and rate matching A coding chain (Coding Chain) will be described. A description will now be made of a method of calculating the minimum number of resource elements that can be allocated per codeword when applying the dual (32, 0) RM coding scheme as in the first embodiment.

1) Information data grouping method in dual RM coding

First, a method of dividing information data of 12 bits or more into groups for applying a dual (32, 0) RM coding scheme will be described with reference to FIGS. 18 and 19. FIG.

(1) FIG. 18 is a diagram for explaining a method of dividing information data into groups in order to apply the dual (32,0) RM coding scheme in the second embodiment of the present invention.

를 2개의 RM 부호기에서 부호화하는 경우, 첫 번째 RM 부호기에 입력되는 정보 데이터는 상기

에서 짝수 번째 정보 데이터인

6비트가 할당되고 두 번째 (32,0) RM 부호기에 입력되는 정보 데이터는 홀수 번째 정보 데이터인 6 비트의

이 할당될 수 있다.Referring to FIG. 18, all information data can be sequentially allocated as input data of each encoder used in the dual (32,0) RM coding scheme. For example, 12-bit information data

Is encoded by the two RM encoders, the information data input to the first RM encoder is

Numbered pieces of information data

6 bits and the information data to be input to the second (32, 0) RM encoder are 6-bit

Can be assigned.

인 경우, RM 부호기의 입력 데이터

중

와

가 각각 첫 번째 RM 부호기와 두 번째 RM 부호기로 입력된다면,

가 짝수일 때는

,

가 홀수 일 때는

의 관계가 성립한다.That is, given information data

, The input data of the RM encoder

medium

Wow

Are input to the first RM encoder and the second RM encoder, respectively,

Is an even number

,

Is odd

.

(2) FIG. 19 is another diagram for explaining a method of dividing information data into groups in order to apply the dual (32, 0) RM coding scheme in the second embodiment of the present invention.

을 2개의 RM 부호기에서 부호화하는 경우, 첫 번째 RM 부호기에 입력되는 정보 데이터는 6 비트의

이 할당되고, 두 번째 RM 부호기에 입력되는 정보 데이터는 6 비트의

이 할당될 수 있다.Referring to FIG. 19, the information data input to the first RM encoder can allocate the former half of the entire information data, and the information data input to the second RM encoder can allocate the other half of the entire information data. For example, 12-bit information data

Is encoded by two RM encoders, the information data input to the first RM encoder is a 6-bit

And the information data to be input to the second RM encoder is 6 bits

Can be assigned.

가 홀수인 경우 첫 번째 RM 부호기에 입력되는 정보 데이터는

비트가 할당 되고, 두 번째 RM 부호기에 입력되는 정보 데이터는

비트가 할당 될 수 있다. 또는, 첫 번째 RM 부호기에 입력되는 정보 데이터는

비트가 할당 되고, 두 번째 RM 부호기에 입력되는 정보 데이터는

비트가 할당되는 것으로 구현할 수도 있다.On the other hand, in both of Figs. 18 and 19, the bit size

Is odd, the information data to be input to the first RM encoder is

Bits, and the information data to be input to the second RM encoder is

Bit can be assigned. Alternatively, the information data input to the first RM encoder is

Bits, and the information data to be input to the second RM encoder is

Bits may be allocated.

(3) Information data corresponding to a primary CC among the component carriers may be set as one group, and information data corresponding to other component carriers may be divided into different groups. Here, the main component carrier may be a component carrier of the highest or lowest index, or may be a predetermined index. Alternatively, the component carrier having the best channel condition or the worst channel condition may be set as the main component carrier. Further, the main component carrier can be set to a component carrier having the largest or smallest bit size of the information data, and the main component carrier can be set in the same manner in terms of coding rate and modulation order.

2) When applying dual RM coding technique, coding chain (Coding Chain)

로부터 계산된 자원 요소의 개수를 균등하기 나누어 할당한다.(1) Next, a method of calculating the number of resource elements for allocating coded information data when applying the dual RM coding scheme is defined. In the present invention, when calculating the number of resource elements, it is proposed to calculate the number of resource elements using Equation 1 and Equation 2 based on the bit size of the entire information data instead of the information data bit size divided into groups . That is, when ACK / NACK and RI are coded using the dual RM coding scheme, the number of resource elements allocated to each RM codeword is determined by the bit size

And allocates the number of resource elements calculated by dividing the number of resource elements equally.

로부터 계산된 자원 요소의 개수

가 짝수인 경우, 듀얼 RM 코딩 기법에 따라 생성된 두 코드워드 각각에

개의 자원 요소가 할당될 수 있다.Therefore, the bit size of the given total information data

The number of resource elements calculated from

Is an even number, in each of the two code words generated according to the dual RM coding technique

Lt; RTI ID = 0.0 > resource < / RTI >

로부터 계산된 자원 요소의 개수

가 홀수인 경우, 듀얼 RM 코딩 기법에 따라 생성된 1 번째 코드워드에

개의 자원 요소가 할당되고 2번째 코드워드에

개의 자원 요소가 할당될 수 있다. 혹은 1 번째 코드워드에

개의 자원 요소가 할당되고 2번째 코드워드에

개의 자원 요소가 할당되는 것으로 구현할 수도 있다.Further, the bit size of the given whole information data

The number of resource elements calculated from

Is odd, the first codeword generated according to the dual RM coding technique

Are allocated and the second code word

Lt; RTI ID = 0.0 > resource < / RTI > Or the first codeword

Are allocated and the second code word

It is also possible to implement the resource element to be allocated.

(2) However, in the rate matching step using Equation (4), for each codeword generated according to the dual RM coding scheme, the number of resource elements allocated to each codeword and the modulation order Accordingly, rate matching or puncturing can be individually performed.

(3) FIG. 20 is a diagram showing a coding chain for dual RM coding according to a second embodiment of the present invention.

Referring to FIG. 20, the dual RM coding according to the present invention can be summarized into a coding chain. In the dual RM coding scheme proposed in the present invention, a single resource element calculation and individual rate matching are combined.

That is, when the information data size of the ACK / NACK and the RI is 12 bits or more, the dual (32,0) RM coding of the present invention is applied, and the whole information data is divided into the first information data and the second information Data is grouped and separated.

Next, the number of resource elements to be allocated is calculated not by the information data bit size divided into groups as described in (1) of 2), but by calculating the number of resource elements to be allocated based on the bit size of the entire information data And the codewords output from the encoders are rate-matched according to the size of a given resource, and are then combined. Subsequently, the interleaver may be applied to the combined data, but the interleaver may be omitted in some cases.

3) How to determine the number of minimum resource elements when applying dual RM coding scheme

On the other hand, in the dual RM coding scheme, it is necessary to set the minimum value in the number of resource elements allocated to UCI, i.e., ACK / NACK or RI, as in the first embodiment. Therefore, in the dual RM coding scheme of the present invention, the minimum value for the number of resource elements allocated to ACK / NACK and RI can be set to a value obtained by adding the number of minimum resource elements of each grouped information data bit.

비트의 정보 데이터에 대한 최소 자원 요소의 개수를 계산하는 수학식 5 내지 수학식 7을 간략하게

라 하면, 듀얼 RM 코딩에서 각각의 코드워드에 할당되는 최소 자원 요소의 개수를 계산하는 식은

가 되고, 전체 ACK/NACK 및 RI에 할당되는 최소 자원 요소의 개수는

이 된다. 간단한 예로 12 비트 사이즈의 정보 데이터에 할당되는 최소 자원 요소의 개수는

가 아닌

이 된다.In other words,

Equations (5) to (7) for calculating the minimum number of resource elements for the information data of bits are briefly described

, The equation for calculating the minimum number of resource elements allocated to each codeword in the dual RM coding

And the total number of the minimum resource elements allocated to the ACK / NACK and RI is

. As a simple example, the minimum number of resource elements allocated to 12-bit size information data is

Not

.

비트가, 두 번째 코드워드를 위하여

비트가 할당 될 수 있다. 또한 첫 번째 코드워드를 위하여

비트가, 두 번째 코드워드를 위하여

비트가 할당 될 수 있다. 이 경우 전체 ACK/NACK 및 RI에 할당되는 최소 자원 요소의 개수는

이 된다. 예를 들어, 13 비트의 정보 데이터에 대하여 계산되는 최소 자원 요소의 개수는

가 아닌

가 된다.On the other hand, when the size of the information data is an odd number, the size of the information data for each group used for calculating the minimum number of resource elements is

Bit, for the second code word

Bit can be assigned. Also for the first codeword

Bit, for the second code word

Bit can be assigned. In this case, the total number of resource elements allocated to the entire ACK / NACK and RI is

. For example, the number of the minimum resource elements calculated for the 13-bit information data is

Not

.

Therefore, Equation (7) can be modified as shown in Equations (12) and (13) below.

(12) and (13) can be summarized as the following Equation (14).

개의 그룹으로 구분하여 RM 코딩 기법을 개별적으로 적용하고, 각각의 RM 코딩 시 입력되는 정보 데이터의 사이즈를

라 하면, ACK/NACK 및 RI에 할당되는 최소 자원 요소의 개수는

가 된다.If the entire information data

The RM coding scheme is separately applied, and the size of the information data input when each RM coding is divided into

, The number of the minimum resource elements allocated to ACK / NACK and RI is

.

은 PUSCH 전송이 이루어지는 전송 블록의 변조 차수 중 낮은 변조 차수 일 수 있다. 즉, 첫 번째 전송 블록의 변조 차수가 QPSK이고 두 번째 TB의 변조 차수가 16QAM이면

은 두 전송 블록의 변조 차수 중 낮은 변조 차수인 QPSK의 값인 2가 된다. 또는,

은 PUSCH 전송이 이루어지는 전송 블록의 변조 차수 값의 평균일 수 있다. 즉, 첫 번째 전송 블록의 변조 차수가 QPSK이고 두 번째 전송 블록의 변조 차수가 16QAM이면

은 두 전송 블록의 변조 차수의 평균인 3이 될 수 있다. 또는,

은 PUSCH 전송이 이루어지는 전송 블록의 변조 차수 중 높은 변조 차수일 수 있다. 즉, 첫 번째 전송 블록의 변조 차수가 QPSK이고 두 번째 전송 블록의 변조 차수가 16QAM이면

은 두 전송 블록의 변조 차수 중 높은 변조 차수인 16QAM의 값인 4가 된다.Meanwhile,

May be a lower modulation order than the modulation order of the transmission block in which the PUSCH transmission is performed. That is, if the modulation order of the first transport block is QPSK and the modulation order of the second TB is 16QAM

Becomes 2, which is the value of QPSK, which is the low modulation order of the modulation orders of the two transport blocks. or,

May be an average of the modulation order values of the transmission block in which the PUSCH transmission is performed. That is, if the modulation order of the first transmission block is QPSK and the modulation order of the second transmission block is 16QAM

Can be 3, which is the average of the modulation orders of the two transport blocks. or,

May be a higher modulation order than the modulation order of the transmission block in which the PUSCH transmission is performed. That is, if the modulation order of the first transmission block is QPSK and the modulation order of the second transmission block is 16QAM

Is a value of 16QAM which is a high modulation order of modulation orders of two transmission blocks.

≪ Third Embodiment - Method of mapping encoded information data to resource elements >

When the UCI encoded according to the first and second embodiments is mapped to the PUSCH, each encoded codeword is mapped to one resource element or a specific number of resource elements in the order of virtual subcarriers .

In case of sequential mapping, the encoded codeword is mapped in the direction of increasing the index from the virtual subcarrier of the lowest index. For example, in dual RM coding, a first codeword is mapped from odd-numbered virtual subcarriers of the lowest index to odd-numbered virtual subcarriers, and a second codeword is mapped from even-numbered virtual subcarriers of the lowest index to every even virtual subcarrier .

It is also possible to map in time order. For example, when the allocated resource element corresponds to the 2 nd, 4 th, 9 th, and 11 th symbols, the first code word is mapped to the resource element corresponding to the 2 nd and 9 th symbols, The second codeword may be mapped to the resource element. Or the first codeword may be mapped to the resource element corresponding to the two symbols, and the second codeword may be mapped to the resource element corresponding to the remaining symbols.

21 illustrates a block diagram of a communication apparatus according to an embodiment of the present invention.

21, the communication device 2100 includes a processor 2110, a memory 2120, an RF module 2130, a display module 2140, and a user interface module 2150.

The communication device 2100 is shown for convenience of explanation, and some modules may be omitted. In addition, the communication device 2100 may further include necessary modules. Also, some of the modules in the communication device 2100 can be divided into more subdivided modules. The processor 2110 is configured to perform operations according to embodiments of the invention illustrated with reference to the figures. Specifically, the detailed operation of the processor 2110 may refer to the contents described in Figs. 1 to 20.

The memory 2120 is connected to the processor 2110 and stores an operating system, an application, a program code, data, and the like. The RF module 2130 is connected to the processor 2110 and performs a function of converting a baseband signal into a radio signal or a radio signal into a baseband signal. To this end, the RF module 2130 performs analog conversion, amplification, filtering, and frequency up-conversion, or inverse thereof. Display module 2140 is coupled to processor 2110 and displays various information. Display module 2140 may use well-known elements such as, but not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED), and an Organic Light Emitting Diode (OLED). The user interface module 2150 is connected to the processor 2110 and may be configured as a combination of well known user interfaces such as a keypad, a touch screen, and the like.

The embodiments described above are those in which the elements and features of the present invention are combined in a predetermined form. Each component or feature shall be considered optional unless otherwise expressly stated. Each component or feature may be implemented in a form that is not combined with other components or features. It is also possible to construct embodiments of the present invention by combining some of the elements and / or features. The order of the operations described in the embodiments of the present invention may be changed. Some configurations or features of certain embodiments may be included in other embodiments, or may be replaced with corresponding configurations or features of other embodiments. It is clear that the claims that are not expressly cited in the claims may be combined to form an embodiment or be included in a new claim by an amendment after the application.

In this document, the embodiments of the present invention have been mainly described with reference to the data transmission / reception relationship between the terminal and the base station. The specific operation described herein as being performed by the base station may be performed by its upper node, in some cases. That is, it is apparent that various operations performed for communication with a terminal in a network including a plurality of network nodes including a base station can be performed by a network node other than the base station or the base station. A 'base station' may be replaced by terms such as a fixed station, a Node B, an eNode B (eNB), an access point, and the like. The term 'terminal' may be replaced with terms such as User Equipment (UE), Mobile Station (MS), and Mobile Subscriber Station (MSS).

Embodiments in accordance with the present invention may be implemented by various means, for example, hardware, firmware, software, or a combination thereof. In the case of hardware implementation, an embodiment of the present invention may include one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs) field programmable gate arrays, processors, controllers, microcontrollers, microprocessors, and the like.

In the case of an implementation by firmware or software, an embodiment of the present invention may be implemented in the form of a module, a procedure, a function, or the like which performs the functions or operations described above. The software code can be stored in a memory unit and driven by the processor. The memory unit may be located inside or outside the processor, and may exchange data with the processor by various well-known means.

It will be apparent to those skilled in the art that the present invention may be embodied in other specific forms without departing from the spirit of the invention. Accordingly, the above description should not be construed in a limiting sense in all respects and should be considered illustrative. The scope of the present invention should be determined by rational interpretation of the appended claims, and all changes within the scope of equivalents of the present invention are included in the scope of the present invention.

The present invention can be applied to a wireless communication system. Specifically, the present invention can be applied to a wireless mobile communication device used for a cellular system.

Claims (12)

A method of transmitting information data using a Reed-Muller coding scheme in a wireless communication system,
Setting a number of resource elements for transmitting the information data;
Rearranges the information data so that odd-numbered bits of the information data are located after even-numbered bits of the information data when the bit size of the information data is equal to or greater than a predetermined number, Sets the bits of the lower half of the rearranged information data as second information data, applies RM coding to each of the first information data and the second information data, and encodes the first information data and the second information data by applying RM coding step; And
Combining the encoded first information data and second encoded information data and transmitting the combined information using the set number of resource elements,
When the information data

(only,

Is the bit size of the information data), and the rearranged information data

Is defined according to Equation (1) below,
The first information data

, And the second information data corresponds to

Lt; RTI ID = 0.0 >
Information data transmission method.
&Quot; (1) "

( I is an even number)

(Where i is an odd number) The method according to claim 1,
The information data is uplink control information (UCI)
The uplink control information is transmitted through an uplink physical shared channel (PUSCH)
Wherein the uplink control information includes Hybrid Automatic Retransmission Request (HARQ) -Ack / NACK (acknowledgment / negative acknowledgment) data or RI (Rank Indicator)
Information data transmission method. The method according to claim 1,
The predetermined number is 12 bits,
Wherein the bit size of each of the encoded first information data and the second information data is 32 bits.
Information data transmission method. delete The method according to claim 1,
The minimum value of the number of resource elements

silver,
A minimum value of the number of resource elements corresponding to the first information data

And a minimum value of the number of resource elements corresponding to the second information data

, ≪ / RTI >
When the bit size of the information data is

, The minimum value of the number of resource elements corresponding to the first information data

And a minimum value of the number of resource elements corresponding to the second information data

Lt; RTI ID = 0.0 > (2) < / RTI >
Information data transmission method.
&Quot; (2) "

And

(only,

Indicates a bit size of the information data,

Indicates the bit size per symbol according to the modulation order) A transmitting apparatus in a wireless communication system,
Wherein the number of resource elements for transmitting information data is set so that odd-numbered bits of the information data are positioned after even-numbered bits of the information data when the bit size of the information data is equal to or greater than a predetermined number, Rearranging the information data, setting the upper half bits of the rearranged information data as first information data, and setting the lower half bits of the rearranged information data as second information data, A processor for applying RM coding to each of the first information data, the second information data, and the second information data, and combining the encoded first information data and the second information data; And
And a transmission module for transmitting the combined first information data and second information data using the set number of resource elements,
When the information data

(only,

Is the bit size of the information data), and the rearranged information data

Is defined according to Equation (1) below,
The first information data

, And the second information data corresponds to

Lt; RTI ID = 0.0 >
Transmitting apparatus.
&Quot; (1) "

( I is an even number)

(Where i is an odd number) The method according to claim 6,
The information data is uplink control information (UCI)
The uplink control information is transmitted through an uplink physical shared channel (PUSCH)
Wherein the uplink control information includes Hybrid Automatic Retransmission Request (HARQ) -Ack / NACK (acknowledgment / negative acknowledgment) data or RI (Rank Indicator)
Transmitting apparatus. The method according to claim 6,
The predetermined number is 12 bits,
Wherein the bit size of each of the encoded first information data and the second information data is 32 bits.
Transmitting apparatus. delete The method according to claim 6,
The minimum value of the number of resource elements

silver,
A minimum value of the number of resource elements corresponding to the first information data

And a minimum value of the number of resource elements corresponding to the second information data

, ≪ / RTI >
When the bit size of the information data is

, The minimum value of the number of resource elements corresponding to the first information data

And a minimum value of the number of resource elements corresponding to the second information data

Lt; RTI ID = 0.0 > (2) < / RTI >
Transmitting apparatus.
&Quot; (2) "

And

(only,

Indicates a bit size of the information data,

Indicates the bit size per symbol according to the modulation order) delete delete

Images