Method for transmitting control information in wireless communication system and apparatus therefor

Abstract

A method for transmitting information data by using a Reed-Muller coding scheme in a wireless communication system is disclosed. The method includes configuring a number of resource elements for transmitting the information data; dividing the information data to first information data and second information data if a bit size O of the information data is equal to or larger than a predetermined number; applying RM coding on each of the first information data and the second information data; concatenating the coded first information data and the coded second information data, and transmitting the concatenated data by using the predetermined number of resource elements, wherein a minimum value Q′_min for the number of resource elements is defined by a sum of a minimum value Q′_{min_1} for the number of resource elements corresponding to the first information data and a minimum value Q′_{min_2} for the number of resource elements corresponding to the second information data.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

The related art channel coding method is realized under the assumption that a single carrier environment is given. However, in case a multiple carrier method is applied, as in the LTE-A system, since it is generally known that the UCI corresponding to each component carrier, i.e., the ACK/NACK or RI data are combined by a component carrier order, the UCI size may also increase in proportion to a number of aggregated component carriers. Most particularly, in case of the RI, the convention single carrier may have a maximum information data size of 3 bits. However, in an environment wherein 5 component carriers can be aggregated, the maximum information data size may be equal to 15 bits. Therefore, since a maximum of 11 bits of information data can be coded by using the currently realized RM coding scheme, a new scheme (or method) capable of decoding the UCI in a multiple carrier environment is required. Hereinafter, a coding method and a rate matching method for each UCI size will now be specifically proposed.

First Embodiment

When the Information Data Size is Less than or Equal to 11 Bits

In a single carrier environment and a multiple carrier environment, since RM coding is used, when the RI or ACK/NACK having the size of 3 bits or more, the coded output data has a bit size of 32 bits. However, in case the channel status is excellent, and when the number of resource elements is calculated by using Equation 1 and Equation 2, only an extremely small number of resource elements may be allocated based upon the bit size of the information data. In this case, during the rate matching step, which is performed by using Equation 4, the coded codewords may be excessively punctured due to the RM coding, thereby causing the performance to be degraded.

More specifically, in order to perform robust transmission regardless of the channel status, since the RI or ACK/NACK transmits codewords, which are coded by the RI or ACK/NACK by using the RM coding scheme, by using only the constellation points of corner points, instead of using all of the constellations so as perform modulation, it is generally known that only 2 bits are mapped to a single resource element. Therefore, in order to transmit all of the codewords coded to 32 bits, a total of 16 resource elements are required. And, at this point, if the calculated number of resource elements is smaller than 16, puncturing may be performed on the codewords as the rate matching process. However, when performing the puncturing process, a receiving end may determine the process as an error. Therefore, even if the codeword has a value of 16, which corresponds to the maximum value for the minimum distance between codes of the RM code, when puncturing a portion of the data corresponding 4 symbols, the performance cannot be ensured. Also, since the puncturing process is sequentially performed in 2-bit units starting from the very last bit of the codeword, in order to maintain the performance of the puncturing process, the degrading of the performance may be increased. Hereinafter, as a first embodiment of the present invention, the present invention proposes a method for preventing such degrading of the performance caused by the above-described puncturing process.

1) When the ACK/NACK or RI has an information data size corresponding to a specific number of bits, i.e., when the ACK/NACK or RI corresponds to information data having a size equal to or larger than 3 bits, the first embodiment of the present invention proposes a method of configuring a minimum value as the number of resource elements being allocated to the ACK/NACK or RI. For example, when the information data size of the ACK/NACK or RI is equal to or greater than 3 bits, the number of resource elements allocated for transmitting the information data of the ACK/NACK or RI is configured to be equal to a minimum number of 16 bits. Herein, it is preferable that the minimum value of the number of resource elements, which is allocated to the ACK/NACK or RI, is equal to or greater than half the number of bits corresponding to the information data size. More specifically, the number of REs being allocated to the ACK/NACK and the RI, i.e., the number of coded modulation symbols may be calculated by using Equation 6 and Equation 7 shown below.

$\begin{array}{cc}{Q}^{\prime }=\max \left(Q_{min}^{\prime },\min \left(Q_{\mathrm{temp}}^{\prime },4·M_{\mathrm{sc}}^{\mathrm{PUSCH}}\right)\right)& \left[\mathrm{Equation}5\right]\\ Q_{\mathrm{temp}}^{\prime }=\lceil \frac{\left(\begin{array}{c}O·M_{\mathrm{sc}}^{\mathrm{PUSCH}-\mathrm{initial}\left(1\right)}·N_{\mathrm{symb}}^{\mathrm{PUSCH}-\mathrm{initial}\left(1\right)}·\\ M_{\mathrm{sc}}^{\mathrm{PUSCH}-\mathrm{initial}\left(2\right)}·N_{\mathrm{symb}}^{\mathrm{PUSCH}-\mathrm{initial}\left(2\right)}·{\beta }_{\mathrm{offset}}^{\mathrm{PUSCH}}\end{array}\right)}{\left(\begin{array}{c}\underset{r=0}{\sum ^{C^{\left(1\right)}-1}}{K}_r^{\left(1\right)}·M_{\mathrm{sc}}^{\mathrm{PUSCH}-\mathrm{initial}\left(2\right)}·N_{\mathrm{symb}}^{\mathrm{PUSCH}-\mathrm{initial}\left(2\right)}+\\ \underset{r=0}{\sum ^{C^{\left(2\right)}-1}}{K}_R^{\left(2\right)}·M_{\mathrm{sc}}^{\mathrm{PUSCH}-\mathrm{initial}\left(1\right)}·N_{\mathrm{symb}}^{\mathrm{PUSCH}-\mathrm{initial}\left(1\right)}\end{array}\right)}\rceil & \left[\mathrm{Equation}6\right]\end{array}$

A minimum value Q′_min for the number of resource elements being allocated to the ACK/NACK or RI may be decided according to Equation 7 shown below.

$\begin{array}{cc}{Q}_{min}^{\prime }=\lceil \frac{2\times O}{Q_m}\rceil & \left[\mathrm{Equation}7\right]\end{array}$

Herein, O represents a bit size of the information data of the ACK/NACK or RI, and Q_m corresponds to a bit size per symbol according to the modulation order. In case of the QPSK, Q_m is equal to 2, in case of the 16QAM, Q_m is equal to 4, and, in case of the 64QAM, Q_m is equal to 6.

Meanwhile, in case of the ACK/NACK and the RI, the standard of a coding rate for the RM coding process is ⅓. Accordingly, the minimum value Q′_min for the number of resource elements being allocated to the ACK/NACK or RI may be decided by using Equation 8 to Equation 10 shown below.

$\begin{array}{cc}{Q}_{min}^{\prime }=\lceil \frac{3\times O}{Q_m}\rceil & \left[\mathrm{Equation}8\right]\\ Q_{min}^{\prime }-\lceil \frac{2\times O}{Q_m}-\frac{1}{2}\rceil & \left[\mathrm{Equation}9\right]\\ \text{or}& \\ Q_{min}^{\prime }-\lceil \frac{2\times O-Q_m/2}{Q_m}\rceil & \\ Q_{min}^{\prime }=\lceil \frac{2\times O}{Q_m}-\frac{3}{4}\rceil & \left[\mathrm{Equation}10\right]\\ \text{or}& \\ Q_{min}^{\prime }=\lceil \frac{2\times O-\left(3Q_m/4\right)}{Q_m}\rceil & \end{array}$

Table 4 to Table 7 shown below respectively correspond to examples of calculating the minimum value Q′_min for the number of resource elements being allocated to the ACK/NACK or RI by using Equation 7 to Equation 10 presented above.

TABLE 4
	Info.	REs	REs	REs
	bit size	for QPSK	for 16 QAM	for 64 QAM
	3	3	2	1
	4	4	2	2
	5	5	3	2
	6	6	3	2
	7	7	4	3
	8	8	4	3
	9	9	5	3
	10	10	5	4
	11	11	6	4

TABLE 5
	Info.	REs	REs	REs
	bit size	for QPSK	for 16 QAM	for 64 QAM
	3	3	1	1
	4	4	2	1
	5	5	2	2
	6	6	3	2
	7	7	3	2
	8	8	4	3
	9	9	4	3
	10	10	5	3
	11	11	5	4

TABLE 6
	Info.	REs	REs	REs
	bit size	for QPSK	for 16 QAM	or 64 QAM
	3	5	3	2
	4	6	3	2
	5	8	4	3
	6	9	5	3
	7	11	6	4
	8	12	6	4
	9	14	7	5
	10	15	8	5
	11	17	9	6

TABLE 7
	Info.	REs	REs	REs
	bit size	for QPSK	for 16 QAM	for 64 QAM
	3	2	2	1
	4	3	2	1
	5	3	2	1
	6	6	3	2
	7	6	3	2
	8	6	3	2
	9	6	3	2
	10	6	3	2
	11	9	5	3

2) Also, in the first embodiment of the present invention, after the ACK/NACK or RI codes the RM coding, when the ACK/NACK or RI is punctured by the rate matching process, it may be considered to perform puncturing by a predetermined and specific order. More specifically, when the ACK/NACK or RI is allocated to a given number of resource elements, the allocation order may be decided by grouping the ACK/NACK or RI in 1-bit or 2-bit units or in units of a specific number of bits, so that the ACK/NACK or RI can be allocated to the resource elements by the decided order. For example, if the output data having the ACK/NACK or RI coded correspond to c₀, c₁, Λ, c₃₁, the output data are realigned through a permutation function π(i), i=0, 1, Λ, 31, which corresponds to a predetermined rule, so that an optimal performance can be demonstrated when performing the puncturing process. Then, in accordance with the permuted order, the resource elements may be sequentially allocated, or the puncturing process may be sequentially performed, by the index order or by an inverse index order. More specifically, when 8 coded output data are allocated to the resource elements, the located data becomes c_π(0), c_π(1), Λ, c_π(7), instead of c₀, c₁, Λ, c₇.

3) Furthermore, according to the first embodiment of the present invention, different β_offset^PUSCH offset values may be used depending upon the information data size respective to the ACK/NACK and the RI. When puncturing the coded output data, i.e., the codeword by using the RM coding scheme, the influence of the puncturing process may vary depending upon the bit size of the information data. Therefore, depending upon the level of influence affecting the minimum distance of the codeword caused by the puncturing process, the β_offset^PUSCH value may be configured differently. For example, when puncturing the codeword, a comparatively large β_offset^PUSCH value is set up for the fastest bit size of the information data to have its minimum distance value be equal to 0.

Although the above-described processes 1) to 3) describe the process of setting up the minimum value of the number of resource elements being allocated to the UCI, in order to achieve the same object, a minimum bit size value of the coded output data after processing rate matching may also be set up. More specifically, the minimum value Q′_min shown in Equation 5 may be configured in the number of resource elements as the minimum bit size value of the output data, as shown in Equation 11 below.
Q′_min=2O   [Equation 11]

Second Embodiment

When the Information Data Size is Equal to or Greater than 12 Bits

In case the information data size of the ACK/NACK and the RI is equal to or greater than 12 bits, the PUSCH groups the information data to the same bit size or to a different bit size, which corresponds to at least two or more data sets. And, channel coding may be performed on each of the divided information data groups by using a (32,0) RM coding scheme, which is used in each PUSCH.

More specifically, when multiplexing the UCI, such as the RI or ACK/NACK, and the data in a multiple carrier environment, the information data bits of the UCI are divided into at least two or more group, and each group may be coded as a single codeword. In this case, since a (32,0) RM coding scheme using Table 1 may be applied, when a range of the bit size of the information data is between 3 bits and 11 bits, if the bit size of the information data included in each group is between 6 bits and 10 bits, then the (32,0) RM coding scheme, i.e., a dual RM coding scheme may be applied for each group. Hereinafter, a method for dividing the information data into group will first be described, and then a method for calculating the number of resource elements for allocating the coded information data and a method for performing rate matching, i.e., a coding chain, when applying the dual (32,0) RM coding scheme, will be described afterwards. Thereafter, a method for calculating a minimum number of resource elements that can be allocated for each codeword when applying the dual (32,0) RM coding scheme according to the first embodiment of the present invention will be described.

1) Information Data Grouping Method when Performing Dual RM Coding

First of all, a method of dividing information data having the size of 12 bits or more into groups in order to apply the dual (32,0) RM coding scheme will be described with reference to FIG. 18 and FIG. 19.

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

Referring to FIG. 18, the whole (or entire) information data may be sequentially allocated as the input data of each encoder used for the dual (32,0) RM coding scheme. For example, when the 12-bit information data d₀, d₁, d₂, Λ, d₁₁ is coded by two RM encoders, the information data being inputted to a first RM encoder may correspond to 6 bits d₀, d₂, d₄, Λ, d₁₀, which correspond to even-numbered information data bits. And, the information data being inputted to a second (32,0) RM encoder may correspond to 6 bits d₁, d₃, d₃, Λ, d₁₁, which correspond to odd-numbered information data bits.

More specifically, in case the given information data corresponds to o₀, o₁, o₂, Λ, o_Q-1, among the input data of the RM encoder b₀, b₁, b₂, Λ, b_Q-1, if b₀, b₁, b₂, Λ, b_┌Q/1┐, b_┌Q/2┐, b_┌Q/2┐+1, b_┌Q/2┐+2, Λ, b_Q-1 are respectively inputted to the first RM encoder and the second RM encoder, when i is an even number then b_i/2=o_i. And, when i is an odd number then b_{┌Q/2┐+(i−1)/2}=o_i.

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

Referring to FIG. 19, a first half of the whole information data may be allocated as the information data being inputted to the first RM encoder, and a second half of the whole information data may be allocated as the information data being inputted to the second RM encoder. For example, when the 12-bit information data d₀, d₁, d₂, Λ, d₁₁ is coded by two RM encoders, 6 bits d₀, d₁, d₂, Λ, d₅ of the information data may be inputted to the first RM encoder, and 6 bits d₆, d₇, d₈, Λ, d₁₁ of the information data may be inputted to the second RM encoder.

Meanwhile, collectively referring to FIG. 18 and FIG. 19, when the bit size O of the whole information data corresponds to an odd number, (O+1)/2 bits may be allocated as the information data being inputted to the first RM encoder, and (O−1)/2 bits may be allocated as the information data being inputted to the second RM encoder. Alternatively, (O−1)/2 bits may be allocated as the information data being inputted to the first RM encoder, and (O+1)/2 bits may be allocated as the information data being inputted to the second RM encoder.

(3) Among the component carriers, information data corresponding to primary component carriers (primary CCs) may be configured as one group, and information data corresponding to other component carriers (CCs) may be configured as another group. Herein, the primary component carrier may correspond to a component carrier having a most significant index or a least significant index, or may correspond to a predetermined index. Alternatively, a component carrier having a most favorable channel status or having a least favorable channel status may also be configured as the primary component carrier. Furthermore, a component carrier having a largest bit size or a smallest bit size of the information data may be configured as the primary component carrier. And, in the aspects of coding rates and modulation orders, the primary component carrier may be configured by using the same method.

2) Coding Chain when Applying the Dual RM Coding Scheme

(1) Hereinafter, a method for calculating a number of resource elements for allocating coded information data, when applying the dual RM coding scheme, will now be defined. When calculating the number of resource elements, the present invention proposes a method of calculating the number of resource elements by using Equation 1 and Equation 2, based upon the bit size of the whole information data, instead of the bit size of the information data being divided into a plurality of groups. More specifically, when the ACK/NACK and the RI are coded by using the dual RM coding scheme, the number of resource elements being allocated to each RM codeword is allocated by equally the number of resource elements, which is calculated from the given bit size O of the whole information data.

Accordingly, when the number of resource elements Q′ calculated from the given bit size O of the whole information data corresponds to an even number, Q′/2 number of resource elements may be allocated to each codeword, each codeword being generated in accordance with the dual RM coding scheme.

Also, when the number of resource elements Q′ calculated from the given bit size O of the whole information data corresponds to an odd number, (Q′+1)/2 number of resource elements may be allocated to a 1^st codeword, which is generated in accordance with the dual RM coding scheme, and (Q′−1)/2 number of resource elements may be allocated to a 2^nd codeword, which is also generated in accordance with the dual RM coding scheme. Alternatively, (Q′−1)/2 number of resource elements may be allocated to a 1^st codeword, and (Q′+1)/2 number of resource elements may be allocated to a codeword.

(2) However, in the rate matching step using Equation 4, rate matching, i.e., puncturing may be individually performed on each codeword, each codeword being generated in accordance with the dual RM coding scheme, while matching the number and modulation order of the resource elements, wherein the resource elements are allocated to each codeword as described in 2).

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

Referring to FIG. 20, the coding chain for the dual RM coding according to the present invention may be recapitulated as a method of performing the dual RM coding scheme, which is proposed in the present invention, wherein a single resource element calculation is combined with individual rate matching processes.

More specifically, in case the information data size of the ACK/NACK and the RI is equal to or greater than 12 bits, the dual (32,0) RM coding scheme of the present invention may be applied, and, as described in 1), the whole information data may be grouped and divided into first (1^st) information data and second (2^nd) information data.

Subsequently, as described in (1) of 2), when calculating the number of resource elements that are to be allocated, the corresponding number of resource elements may be calculated based upon the bit size of the whole information data, instead of the bit size of the information data being divided into a plurality of groups. Then, the calculated number of resource elements is distributed to each RM encoder. Afterwards, rate matching may be performed on the codewords outputted from each encoder, in accordance with the given resource size. Thereafter, the processed data may be concatenated. Furthermore, although an interleaver may be applied to the concatenated data, the interleaver may be omitted in some cases.

3) Method for Deciding the Minimum Number of Resource Elements when Applying the Dual RM Coding Scheme

Meanwhile, as described in the first embodiment of the present invention, in the dual RM coding scheme, a minimum value is also required to be configured in the number of resource elements being allocated to the UCI, i.e., the ACK/NACK or RI. Therefore, in the dual RM coding scheme according to the present invention, the minimum value for the number of resource elements being allocated to the ACK/NACK and the RI may be configured by adding the minimum number of resource elements corresponding to each of the grouped information data bits.

More specifically, if the equations for calculating the minimum number of resource elements respective to O bits of the information data, i.e., Equation 5 to Equation 7 are referred to as f(O) for simplicity, the equation for calculating the minimum number of resource elements that are to be allocated to each codeword, during the dual RM coding process, may correspond to f(O/2). And, the minimum number of resource elements that are allocated to the whole (or entire) ACK/NACK and RI may correspond to f(O/2)+f(O/2). As a simple example, the minimum number of resource elements that are allocated to the 12-bit sized information data corresponds to f(6)+f(6), instead of f(12).

Meanwhile, in case the size of the information data corresponds to an odd number, the size of each information data group that is used for calculating the minimum number of resource elements may be allocated with (O+1)/2 bits for the first codeword and may be allocated with (O−1)/2 bits for the second codeword. Alternatively, the minimum number of resource elements may be allocated with (O−1)/2 bits for the first codeword and may be allocated with (O+1)/2 bits for the second codeword. In this case, the minimum number of resource elements being allocated to the whole ACK/NACK and RI corresponds to f((O+1)/2)+f((O−1)/2) For example, the minimum number of resource elements being calculated for the 13-bit information data corresponds to f(7)+f(6), instead of f(13)

Therefore, Equation 7 may be changed to Equation 12 and Equation 13 shown below.

$\begin{array}{cc}\begin{array}{c}{Q}_{min}^{\prime }=2\times \lceil \frac{2\times \lceil \frac{O}{2}\rceil }{Q_m}\rceil \\ =2\times \lceil \frac{O}{Q_m}\rceil \text{(wherein O is an even number)}\end{array}& \left[\mathrm{Equation}12\right]\\ \begin{array}{c}{Q}_{min}^{\prime }=\lceil \frac{2\times \frac{O+1}{2}}{Q_m}\rceil +\lceil \frac{2\times \frac{O-1}{2}}{Q_m}\rceil \\ =\lceil \frac{O+1}{Q_m}\rceil +\lceil \frac{O-1}{Q_m}\rceil \left(\mathrm{wherein}O\mathrm{is}\mathrm{an}\mathrm{odd}\mathrm{number}\right)\end{array}& \left[\mathrm{Equation}13\right]\end{array}$

A combination of Equation 12 and Equation 13 may be expressed as Equation 14 shown below.

$\begin{array}{cc}\begin{array}{c}{Q}_{min}^{\prime }=\lceil \frac{2\times \lceil O/2\rceil }{Q_m}\rceil +\lceil \frac{2\times \left(O-\lceil O/2\rceil \right)}{Q_m}\rceil \\ =\lceil \frac{2\times \lceil O/2\rceil }{Q_m}\rceil +\lceil \frac{2\times \lceil \frac{O}{2}\rceil }{Q_m}\rceil \end{array}& \left[\mathrm{Equation}14\right]\end{array}$

If the whole information data are divided into N number of groups so that the RM coding scheme can be individually applied, and if the size of the information data being inputted during each RM coding process is referred to as O_i, the minimum number of resource elements being allocated to the ACK/NACK and the RI corresponds to

$\underset{i=0}{\sum ^{N-1}}f\left(O_i\right).$

Meanwhile, among the modulation orders of the transmission block, wherein the PUSCH transmission is performed, Q_m may correspond to a lower modulation order. More specifically, when the modulation order of the first transmission block (TB) is QPSK, and when the modulation order of the second TB is 16QAM, Q_m is equal to 2, which corresponds to a QPSK value respective to the lower modulation order among the modulation orders of two transmission blocks. Alternatively, Q_m may correspond to an average value of the modulation order values of the transmission block, wherein the PUSCH transmission is performed. More specifically, when the modulation order of the first transmission block (TB) is QPSK, and when the modulation order of the second TB is 16QAM, Q_m is equal to 3, which corresponds to the average value of the modulation orders of the two transmission blocks. Furthermore, among the modulation orders of the transmission block, wherein the PUSCH transmission is performed, Q_m may correspond to a higher modulation order. More specifically, when the modulation order of the first transmission block (TB) is QPSK, and when the modulation order of the second TB is 16QAM, Q_m is equal to 4, which corresponds to a 16QAM value respective to the higher modulation order among the modulation orders of two transmission blocks.

Third Embodiment

Method of Mapping Coded Information Data to the Resource Elements

When mapping the coded UCI to the PUSCH according to the first embodiment and the second embodiment of the present invention, each of the coded codewords may be mapped to one resource element or to a specific number of resource elements by a virtual carrier order.

When performing sequential mapping, the coded codeword is mapped from a least significant (or lowest) index of the virtual subcarrier in an increasing direction of the index. For example, when performing dual RM coding, the first codeword may be mapped starting from an odd-numbered virtual subcarrier of the least significant index to each odd-numbered virtual subcarrier. And, the second codeword may be mapped starting from an even-numbered virtual subcarrier of the least significant index to each even-numbered virtual subcarrier.

Additionally, a mapping method may also be performed in a time-based order. For example, when the allocated resource elements correspond to the 2^nd, 4^th, 9^th, and 11^th symbols, respectively, the first codeword may be mapped to the 2^nd and 9^th symbols, and the second codeword may be mapped to the 4^th and 11^th symbols. Alternatively, the first codeword may be mapped to resource elements corresponding to two symbols, and the second codeword may be mapped to resource elements corresponding to the remaining symbols.

FIG. 21 illustrates a block view showing a structure of a communication apparatus according to an embodiment of the present invention.

Referring to FIG. 21, a communication apparatus 2100 includes a processor 2110, a memory 2120, an RF module 2130, a display module 2140, and a user interface module 2150.

The communication apparatus 2100 is an exemplary illustration provided to simplify the description of the present invention. Also, the communication apparatus 2100 may further include necessary modules. Also, in the communication apparatus 2100 some of the modules may be divided into more segmented modules. Referring to FIG. 21, an example of the processor 2110 is configured to perform operations according to the embodiment of the present invention. More specifically, for the detailed operations of the processor 2110, reference may be made to the description of the present invention shown in FIG. 1 to FIG. 20.

The memory 2120 is connected to the processor 2110 and stores operating systems, applications, program codes, data, and so on. The RF module 2130 is connected to the processor 2110 and performs a function of converting baseband signals to radio (or wireless) signals or converting radio signals to baseband signals. In order to do so, the RF module 2130 performs analog conversion, amplification, filtering, and frequency uplink conversion or inverse processes of the same. The display module 2140 is connected to the processor 2110 and displays diverse information. The display module 2140 will not be limited only to the example given herein. In other words, generally known elements, such as Liquid Crystal Display (LCD), Light Emitting Diode (LED), Organic Light Emitting Diode (OLED) may also be used as the display module 2140. The user interface module 2150 is connected to the processor 2110, and the user interface module 2150 may be configured of a combination of generally known user interfaces, such as keypads, touchscreens, and so on.

The above-described embodiments of the present invention correspond to predetermined combinations of elements and features and characteristics of the present invention. Moreover, unless mentioned otherwise, the characteristics of the present invention may be considered as optional features of the present invention. Herein, each element or characteristic of the present invention may also be operated or performed without being combined with other elements or characteristics of the present invention. Alternatively, the embodiment of the present invention may be realized by combining some of the elements and/or characteristics of the present invention. Additionally, the order of operations described according to the embodiment of the present invention may be varied. Furthermore, part of the configuration or characteristics of any one specific embodiment of the present invention may also be included in (or shared by) another embodiment of the present invention, or part of the configuration or characteristics of any one embodiment of the present invention may replace the respective configuration or characteristics of another embodiment of the present invention. Furthermore, it is apparent that claims that do not have any explicit citations within the scope of the claims of the present invention may either be combined to configure another embodiment of the present invention, or new claims may be added during the amendment of the present invention after the filing for the patent application of the present invention.

In the description of the present invention, the embodiments of the present invention have been described by mainly focusing on the data transmission and reception relation between the base station and the terminal (or user equipment). Occasionally, in the description of the present invention, particular operations of the present invention that are described as being performed by the base station may also be performed by an upper node of the base station. More specifically, in a network consisting of multiple network nodes including the base station, it is apparent that diverse operations that are performed in order to communicate with the terminal may be performed by the base station or b network nodes other than the base station. Herein, the term ‘Base Station (BS)’ may be replaced by other terms, such as fixed station, Node B, eNode B (eNB), Access Point (AP), and so on.

The above-described embodiments of the present invention may be implemented by using a variety of methods. For example, the embodiments of the present invention may be implemented in the form of hardware, firmware, or software, or in a combination of hardware, firmware, and/or software.

In case of implementing the embodiments of the present invention in the form of hardware, the method according to the embodiments of the present invention may be implemented by using at least one of Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), processors, controllers, micro controllers, micro processors, and so on.

In case of implementing the embodiments of the present invention in the form of firmware or software, the method according to the embodiments of the present invention may be implemented in the form of a module, procedure, or function performing the above-described functions or operations. A software code may be stored in a memory unit and driven by a processor. Herein, the memory unit may be located inside or outside of the processor, and the memory unit may transmit and receive data to and from the processor by using a wide range of methods that have already been disclosed.

As described above, the method for transmitting control information in wireless communication system and apparatus therefore according to the present invention are advantageous in that, in a wireless communication system, a transmitting end may effectively encode the control information according to the present invention. Also, the method for transmitting control information in wireless communication system and apparatus therefore according to the present invention may be applied to wireless communication systems. Most particularly, the present invention may be applied to wireless mobile communication apparatuses that are used for cellular systems.

The present invention may be realized in another concrete configuration (or formation) without deviating from the scope and spirit of the essential characteristics of the present invention. Therefore, in all aspect, the detailed description of present invention is intended to be understood and interpreted as an exemplary embodiment of the present invention without limitation. The scope of the present invention shall be decided based upon a reasonable interpretation of the appended claims of the present invention and shall come within the scope of the appended claims and their equivalents.

Therefore, it will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the inventions. Thus, it is intended that the present invention covers the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents.

Claims

1. A method for transmitting uplink control information (UCI) at a user equipment in a wireless communication system, the method comprising:

dividing the UCI into a first sub-UCI and a second sub-UCI, a bit size (O) of the UCI equal to or larger than a predetermined number;

encoding each of the first sub-UCI and the second sub-UCI by using a Reed-Muller (RM) coding scheme;

concatenating the encoded first sub-UCI and the encoded second sub-UCI; and

transmitting the concatenated first sub-UCI and second sub-UCI to a base station using modulation symbols,

wherein a number of the modulation symbols is determined based on O,

wherein a minimum number (Q′_min) of the modulation symbols is defined by a sum of a minimum number of the modulation symbols corresponding to the first sub-UCI (Q′_{min_1}) and a minimum number of the modulation symbols corresponding to the second sub-UCI (Q′_{min_2}),

wherein Q′_{min_1} and Q′_{min_2} are defined by using the following Equations:

2. The method of claim 1, wherein the concatenated first sub-UCI and second sub-UCI transmitted via a Physical uplink Shared Channel (PUSCH).

3. The method of claim 1, wherein the predetermined number corresponds to 12 bits.

4. A user equipment (UE) of a wireless communication system, the UE comprising:

a processor configured to:

divide uplink control information (UCI) into a first sub-UCI and a second sub-UCI, to;

encode each of the first sub-UCI and the second sub-UCI by using a Reed-Muller (RM) coding scheme, and to concatenate the encoded first sub-UCI and the second sub-UCI, wherein a bit size (O) of the UCI is equal to or larger than a predetermined number; and

concatenate the encoded first sub-UCI and the second sub-UCI; and

a transmitter configured to transmit the concatenated first sub-UCI and second sub-UCI using modulation symbols to a base station,

wherein a number of the modulation symbols is determined based on O,

wherein a minimum number (Q′_min) of the modulation symbols is defined by a sum of a minimum number of the modulation symbols corresponding to the first sub-UCI (Q′_{min_1}) and a minimum number of the modulation symbols corresponding to the second sub-UCI (Q′_{min_2}),

wherein Q′_{min_1} and Q′_{min_2} are defined by using the following Equations:

5. The UE of claim 4, wherein the concatenated first sub-UCI and second sub-UCI transmitted via a Physical uplink Shared Channel (PUSCH).

6. The UE of claim 4, wherein the predetermined number corresponds to 12 bits.

7. The method of claim 1, wherein the UCI comprises a rank indicator (RI) or an acknowledgement/negative-acknowledgement (ACK/NACK).

8. The user equipment of claim 4, wherein the UCI comprises a rank indicator (RI) or an acknowledgement/negative-acknowledgement (ACK/NACK).