# Patent

## Title
Method and apparatus for feedback in multi-user multiple-input multiple-output (MU-MIMO) communication system

## Abstract

Provided is a feedback method and apparatus in a multiple-input multiple-output (MIMO) communication system. A terminal may determine a preferred pre-coding matrix for a neighboring terminal, based on a reference rank determined by a base station and a preferred pre-coding matrix of the terminal. The terminal may calculate a channel quality indicator (CQI) based on the preferred precoding matrix for the neighboring terminal, and may feed the CQI back to the base station.

## Background
CROSS-REFERENCE TO RELATED APPLICATION(S)
This application claims the benefit under 35 U.S.C. §119(e) of a U.S. Provisional Application Nos. 61/387,645 and 61/407,070, filed on Sep. 29, 2010, and Oct. 27, 2010, respectively, in the U.S. Patent and Trademark Office, and the benefit under 35 U.S.C. §119(a) of Korean Patent Application No. 10-2011-0011995, filed on Feb. 10, 2011, in the Korean Intellectual Property Office, the entire disclosures of which are incorporated herein by reference for all purposes.


BACKGROUND
1. Field
The following description relates to a method and apparatus for feedback in a multi-user multiple-input multiple-output (MIMO) communication system.
2. Description of Related Art
A multiple-input multiple-output (MIMO) communication system may use a plurality of channels in a spatial domain and may provide various multimedia services with high quality such as a voice service, a data service, and the like, in the wireless communication environment.
In the MIMO communication system, a base station and one or more terminals may share channel information, and may use a codebook to generate an optimal pre-coding matrix. For example, the base station and the terminals may share the channel information using codewords that are included in the codebook, and may generate a pre-coding matrix.
A space may be quantized to a plurality of codewords. The plurality of codewords generated by quantizing the space may be stored, as the codebook, in the base station and the terminals. For example, each codeword may be a vector or a matrix.
SUMMARY
In one general aspect, there is provided a communication method of a terminal in a multiple-input multiple-output (MIMO) communication system including a base station and the terminal, the method including receiving a reference rank determined by the base station, selecting a preferred first pre-coding matrix for the terminal, based on a preferred rank of the terminal, extracting at least one preferred second pre-coding matrix for at least one neighboring terminal corresponding to the preferred first pre-coding matrix, based on the reference rank and the preferred rank of the terminal, generating at least one channel quality indicator (CQI) of the terminal, based on the preferred first pre-coding matrix and the at least one preferred second pre-coding matrix, and feeding the at least one CQI back to the base station.
The extracting may include calculating a rank of the at least one neighboring terminal based on the reference rank and the preferred rank of the terminal, and extracting the at least one preferred second pre-coding matrix based on the rank of the at least one neighboring terminal.
The extracting may include extracting the at least one preferred second pre-coding matrix using a predetermined table which includes pairs of first pre-coding matrix candidates and second pre-coding matrix candidates.
The extracting may include extracting the at least one preferred second pre-coding that is orthogonal to the preferred first pre-coding matrix.
The generating may include generating the at least one CQI based on interference due to the at least one preferred second pre-coding matrix.
The selecting may include selecting the preferred first pre-coding matrix for the terminal based on a codebook corresponding to the preferred rank of the terminal.
The extracting may include extracting the at least one preferred second pre-coding matrix based on a codebook corresponding to the preferred rank of the terminal.
The extracting may include extracting the at least one preferred second pre-coding matrix based on a codebook corresponding to the reference rank.
The extracting based on the codebook corresponding to the reference rank may include selecting a codeword corresponding to the preferred first pre-coding matrix from a plurality of codewords that are included in the codebook corresponding to the reference rank, and determining the at least one preferred second pre-coding matrix based on the selected codeword.
The determining may include selecting, as the at least one preferred second pre-coding matrix, remaining columns excluding a column included in the preferred first pre-coding matrix from columns included in the selected codeword.
In another general aspect, there is provided a terminal in a multiple-input multiple-output (MIMO) communication system including a base station and the terminal, the terminal including a receiving unit configured to receive a reference rank determined by the base station, a first pre-coding matrix selecting unit configured to select a preferred first pre-coding matrix for the terminal, based on a preferred rank of the terminal, a second pre-coding matrix extracting unit configured to extract at least one preferred second pre-coding matrix for at least one neighboring terminal corresponding to the preferred first pre-coding matrix, based on the reference rank and the preferred rank of the terminal, a CQI generating unit configured to generate at least one channel quality indicator (CQI) of the terminal, based on the preferred first pre-coding matrix and the at least one preferred second pre-coding matrix, and a transmitting unit configured to feed the at least one CQI back to the base station.
The second pre-coding matrix extracting unit may calculate a rank for the at least one neighboring terminal based on the reference rank and the preferred rank of the terminal, and may extract the at least one preferred second pre-coding matrix using the at least one neighboring terminal.
The terminal may further include a memory configured to store a predetermined table including pairs of first pre-coding matrix candidates and second matrix pre-coding matrix candidates, and the second pre-coding matrix extracting unit may extract the at least one preferred second pre-coding matrix based on the table.
The CQI generating unit may generate the at least one CQI based on interference due to the at least one preferred second pre-coding matrix.
The first pre-coding matrix selecting unit may select the preferred first pre-coding matrix for the terminal, based on a codebook corresponding to the preferred rank of the terminal.
The second pre-coding matrix extracting unit may extract the at least one preferred second pre-coding matrix, based on a codebook corresponding to the preferred rank of the terminal or a codebook corresponding to the reference rank.
Example embodiments may provide a terminal that may determine a preferred pre-coding matrix for a neighboring terminal, based on a reference rank determined by a base station and a precoding matrix of the terminal, may calculate a CQI of the terminal based on the preferred pre-coding matrix for the neighboring terminal, and may feed the CQI back to the base station. The base station may flexibly schedule terminals, and the CQI may be more accurately predicted in the MIMO communication system.
In another aspect, there is provided a terminal in a multiple-input multiple-output (MIMO) communication system, the terminal including a receiver configured to receive a reference rank of the terminal from a base station, a controller configured to determine a preferred rank of the terminal and to determine information to feed back to the base station based on the reference rank of the terminal and the preferred rank of the terminal, and a transmitter configured to transmit the determined feedback information to the base station.
In response to the preferred rank of the terminal being greater than the reference rank of the terminal, the controller may determine to transmit feedback information comprising a rank indicator (RI) indicating a preferred rank that is restricted to being less than or equal to the reference rank, a pre-coding matrix indicator (PMI) indicating a preferred codeword selected by the terminal, and at least one channel quality indicator (CQI) of the terminal.
In response to the preferred rank of the terminal being less than the reference rank of the terminal, the controller may determine to transmit feedback information comprising a best companion channel quality indicator (CQI) comprising information that is associated with interference of at least one neighboring terminal.
In response to the preferred rank of the terminal being the same as the reference rank of the terminal, the controller may determine not to transmit feedback information to the base station.
Other features and aspects may be apparent from the following detailed description, the drawings, and the claims.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a diagram illustrating an example of a closed-loop multiple-input multiple-output (MIMO) communication system.
FIG. 2 is a flowchart illustrating an example of communication between a base station and a terminal in a closed-loop MIMO communication system.
FIG. 3 is a diagram illustrating an example of a feedback method based on a reference rank and a preferred rank of a terminal.
FIG. 4 is a diagram illustrating an example of a terminal in an MIMO communication system including a base station and the terminal.
FIG. 5 is a flowchart illustrating a communication method of a terminal in an MIMO communication system including a base station and the terminal.



Throughout the drawings and the detailed description, unless otherwise described, the same drawing reference numerals should be understood to refer to the same elements, features, and structures. The relative size and depiction of these elements may be exaggerated for clarity, illustration, and convenience.
DETAILED DESCRIPTION
The following detailed description is provided to assist the reader in gaining a comprehensive understanding of the methods, apparatuses and/or systems described herein. Accordingly, various changes, modifications, and equivalents of the methods, apparatuses, and/or systems described herein may be suggested to those of ordinary skill in the art. Also, descriptions of well-known functions and constructions may be omitted for increased clarity and conciseness.
FIG. 1 illustrates an example of a closed-loop multiple-input multiple-output (MIMO) communication system.
Referring to FIG. 1, the closed-loop MIMO communication system includes a base station 110 and terminals 120 and 130. The example of FIG. 1 is an example of a multi-user MIMO communication system. It should be appreciated that the examples herein are also applicable to a single user MIMO (SU-MIMO) communication system. In the closed-loop, a terminal 120 and a terminal 130 may feed channel information back to the base station 110. The base station 110 may perform pre-coding based on the channel information that is fed back from the terminals.
The base station 110 may include a plurality of transmission antennas, for example, two transmission antennas, four transmission antennas, eight transmission antennas, and the like. The terminal 120 and 130 may include at least one reception antenna. A channel may be formed between the base station 110 and the terminal 120, and a channel may be formed between the base station 110 and the terminal 130. In this example, the terminal 120 and the terminal 130 may feed back information that is associated with a respective channel to the base station 110. Based on the information associated with the channels that is fed back, the base station 110 may transmit a signal to the terminals 120 and 130 to increase or improve performance of the system.
FIG. 2 illustrates an example of communication between a base station and a terminal in a closed-loop MIMO communication system.
It should be appreciated that the base station may operate in conjunction with a plurality of terminals in a closed-loop MIMO system, however, an operation between the base station and a single terminal is described for ease of description.
Referring to FIG. 2, the base station transmits a pilot signal to the terminal, in 210. For example, the pilot signal may be a signal that is known by both the base station and the terminal. The terminal estimates a channel between the base station and the terminal based on the pilot signal transmitted from the base station, in 220. For example, channel information that is obtained by estimating the channel may include a channel matrix H and/or a channel covariance matrix HHH.
Based on the channel matrix or the channel covariance matrix HHH, the terminal determines a pre-coding matrix indicator (PMI) of the terminal and a preferred rank indicator (RI) of the terminal, and calculates a channel quality indicator (CQI) of the terminal, in 230.
The PMI is an indicator indicating a preferred codeword selected by the terminal from codewords that are included in a codebook. For example, each of the codewords may be expressed as a matrix, and the preferred codeword selected by the terminal may be a pre-coding matrix candidate recommended to the base station. A matrix includes one or more rows and one or more columns. If the matrix includes a single row or a single column, the matrix may be referred to as a vector. The RI is an indicator indicating a preferred rank of the terminal that may be determined based on one or more channel conditions.
The terminal feeds back the channel information, such as the RI, the PMI, and the CQI, to the base station, in 240, such that the base station may obtain the channel information.
The base station generates an optimal pre-coding matrix based on the channel information that is fed back, in 250. The base station performs pre-coding of data streams to be transmitted, based on the pre-coding matrix, in 260. The pre-coded data streams are transmitted to the terminal, in 270.
In the closed-loop MIMO communication system of FIG. 2, the PMI, RI, and CQI that are fed back may be obtained without taking into account a neighboring terminal scheduled with the terminal and interference due to the neighboring terminal. The PMI, RI, and the CQI may be channel information that is appropriate for a single user, that is, an SU-MIMO communication system. Hereinafter, the PMI, the RI, and the CQI may be referred to as an SU-MIMO PMI, an SU-MIMO RI, and an SU-MIMO CQI, respectively. The feedback of the channel information, such as the SU-MIMO PMI, the SU-MIMO RI, and the SU-MIMO CQI, may be referred to as an SU-MIMO report.
The base station may support an MU-MIMO scheme based on the SU-MIMO report. In this example, the single user information is obtained without taking into account interference between terminals, thus, performance may be deteriorated.
Therefore, additional channel information associated with the neighboring terminal may be provided, for a dynamic switching between the SU-MIMO scheme and an MU-MIMO scheme. Feedback of the additional channel information may be referred to as an MU-MIMO report. Two examples for the dynamic switching between the SU-MIMO scheme and the MU-MIMO scheme are described.
1. Rank Restricted Feedback Mode
In the example of the rank restricted feedback mode, a terminal may perform an SU-MIMO report in a restricted rank. When an SU-MIMO scheme is assumed to be used, feedback of a PMI, a CQI, and an RI with respect to a rank 1 and a rank 2 may be used to generate pre-coding information and to predict a CQI when multiple users are scheduled. For example, i) an SU-MIMO report without rank restriction and ii) an SU-MIMO report with a restricted rank for improving performance of an MU-MIMO scheme may be time-multiplexed. As an example, i) the SU-MIMO report without rank restriction may be performed based on a shorter term period, and ii) the SU-MIMO report with the restricted rank may be performed based on a longer term period.
2. Best Companion CQI Mode
Feedback of a best companion CQI may be used to provide improved feedback for an MU-MIMO scheme. A best companion PMI may inform a base station of information that is associated with a null-space with respect to a predetermined terminal. The information may be used when the base station generates an MU-MIMO pre-coding matrix.
The best companion CQI may indicate interference between terminals with respect to a given number of interference layers, based on the assumption that a pre-coding matrix corresponding to the best companion PMI is used as a pre-coding matrix for interference layers or interference terminals. If a plurality of best companion PMIs exists, a plurality of best companion CQIs may also exist.
A terminal may transmit an additional PMI to more additionally explain a signal space, in comparison to transmitting an additional PMI, such as the best companion PMI indicating the null space.
In various examples, the pre-coding matrix corresponding to the best companion PMI may be orthogonal to a preferred pre-coding matrix. The best companion CQI may be calculated based on the assumption that the terminals are allocated to orthogonal pre-coders. The best companion CQI calculated in this example may be referred to as a unitary pre-coding CQI or a per user unitary rate control (PU2RC) CQI.
In this example, the best companion PMI may not be fed back and only the best companion CQI may be fed back. According to an example embodiment, an additional best companion CQI that is obtained by assuming an RI, a PMI, and a CQI of a basic SU-MIMO report, and the orthogonal precoder to be used may each be fed back.
In the two methods, the CQI may be calculated by assuming a predetermined transmission rank expressed as a reference rank to be used, that is, by assuming a number of layers expected to be transmitted by the base station. The reference rank may be determined by the base station. Information associated with the reference rank may be transmitted from the base station to the terminal using a downlink channel so that terminal may feed back appropriate information.
According to the two example methods, the base station i) may perform flexible scheduling, and ii) may more accurately predict a CQI when multiple users are scheduled.
An example of a method of applying the two methods to a unified framework and a method of feeding above described information back over a control channel are further described herein. A method of the terminal that calculates the best companion CQI and a process thereof is further described herein.
Feedback Relying on Reference Rank and Preferred Rank of Terminal
FIG. 3 illustrates an example of a feedback method based on a reference rank and a preferred rank of a terminal.
Referring to FIG. 3, the two methods described in the example of FIG. 2, which are referred to as the rank restricted feedback mode and the best companion CQI mode, may be applied to different scenarios.
The rank restricted feedback mode may be applied to a case in which the preferred rank of the terminal is greater than or equal to the reference rank. The best companion CQI mode may be applied to a case in which the reference rank is greater than or equal to the preferred rank of the terminal.
The rank restricted feedback may be used to show that a preferred pre-coding matrix corresponding to an SU-MIMO PMI may quantize a wide space, and columns of the preferred pre-coding matrix may not need to accurately approximate a dominant eigenvector of a space.
A best companion QCI and a best companion PMI may be applied to a scenario in which a terminal is scheduled together with neighboring terminals. The terminal may include information that is associated with interference in the best companion CQI, by approximating an interference precoder.
Statistically, the best companion PMI may be orthogonal to the SU-MIMO PMI and thus, the best companion PMI may not be fed back. In this example, the best companion CQI that is obtained on the assumption that orthogonal pre-coders are used may be fed back.
Therefore, if the preferred rank of the terminal is less than the reference rank (best companion CQI mode), an additional PMI may not be fed back. However, if the preferred rank of the terminal is greater than the reference rank (rank restricted feedback mode), the additional PMI may be fed back.
According to an example embodiment, the type of information fed back by the terminal may vary based on i) the preferred rank of the terminal and ii) the reference rank.

    
    
        For example, if the preferred rank of the terminal is greater than the reference rank (rank restricted feedback mode), the terminal may feed back i) a rank indicator corresponding to a preferred rank that is restricted to being less than or equal to the reference rank, ii) a PMI, and iii) at least one CQI relaying on a number of codewords. While the feedback is similar to an SU-MIMO report, the feedback includes a feature that the preferred rank is less than or equal to the reference rank.
        As another example, if the preferred rank of the terminal is less than the reference rank (best companion CQI mode), the terminal may feed at least one best companion CQI back to a base station, on the assumption that pre-coding matrices used for scheduling of terminals are orthogonal to each other.
        As another example, if the preferred rank of the terminal is equal to the reference rank, the terminal may not perform an MU-MIMO report.
    
    


Best Companion CQI
As described herein, the best companion CQI may describe MU-MIMO interference that is obtained based on the assumption that the orthogonal pre-coders are used. With respect to each of a preferred rank of a terminal and a reference rank, an example of a method of calculating the best companion CQI is described.
<A Case in which a Base Station Includes Four Antennas (4Tx)>
To calculate the best companion CQI, the terminal may use several best companion PMIs. For example, the terminal may calculate a receive filter based on the given best companion PMIs and an SU-MIMO PMI that is a preferred PMI of the terminal, and may calculate the best companion CQI based on interference that is generated due to the best companion PMIs. Two examples of methods of determining the best companion PMI and an example of a method of calculating the best companion CQI are described herein.
When the base station uses the four antennas, a pre-coding matrix W may be selected from Table 1 or from a subset of Table 1. For example, Table 1 may be a codebook that is used when the base station uses four antennas in a 3GPP LTE system. When the system is changed, the codebook may be changed. However, a general process may be the same. Wn{s} is a matrix defined by columns given, by a set [s], from Wn=I−2unH/unHun. I denotes a 4×4 unit matrix and un is given in Table 1.









TABLE 1







Codebook

Number of layers ν












index
un
1
2
3
4















1
u0 = [1 −1 −1 −1]T
W0{1}
W0{14}/{square root over (2)}
W0{124}/{square root over (3)}
W0{1234}/2


2
u1 = [1 −j 1 j]T
W1{1}
W1{12}/{square root over (2)}
W1{123}/{square root over (3)}
W1{1234}/2


3
u2 = [1 1 −1 1]T
W2{1}
W2{12}/{square root over (2)}
W2{123}/{square root over (3)}
W2{3214}/2


4
u3 = [1 j 1 −j]T
W3{1}
W3{12}/{square root over (2)}
W3{123}/{square root over (3)}
W3{3214}/2


5
u4 = [1 (−i − j)/{square root over (2)} − j (1 − j)/{square root over (2)}]T
W4{1}
W4{14}/{square root over (2)}
W4{124}/{square root over (3)}
W4{1234}/2


6
u5 = [1 (1 − j)/{square root over (2)} j (−1 − j)/{square root over (2)}]T
W5{1}
W5{14}/{square root over (2)}
W5{124}/{square root over (3)}
W5{1234}/2


7
u6 = [1 (1 + j)/{square root over (2)} − j (−1 + j)/{square root over (2)}]T
W6{1}
W6{13}/{square root over (2)}
W6{134}/{square root over (3)}
W6{1324}/2


8
u7 = [1 (−1 + j)/{square root over (2)} j (1 + j)/{square root over (2)}]T
W7{1}
W7{13}/{square root over (2)}
W7{134}/{square root over (3)}
W7{1324}/2


9
u8 = [1 −1 1 1]T
W8{1}
W8{12}/{square root over (2)}
W8{124}/{square root over (3)}
W8{1234}/2


10
u9 = [1 −j −1 −j]T
W9{1}
W9{14}/{square root over (2)}
W9{134}/{square root over (3)}
W9{1234}/2


11
u10 = [1 1 1 −1]T
W10{1}
W10{13}/{square root over (2)}
W10{123}/{square root over (3)}
W10{1324}/2


12
u11 = [1 j −1 j]T
W11{1}
W11{13}/{square root over (2)}
W11{134}/{square root over (3)}
W11{1324}/2


13
u12 = [1 −1 −1 1]T
W12{1}
W12{12}/{square root over (2)}
W12{123}/{square root over (3)}
W12{1234}/2


14
u13 = [1 −1 1 −1]T
W13{1}
W13{13}/{square root over (2)}
W13{123}/{square root over (3)}
W13{1324}/2


15
u14 = [1 1 −1 −1]T
W14{1}
W14{13}/{square root over (2)}
W14{123}/{square root over (3)}
W14{3214}/2


16
u15 = [1 1 1 1]T
W15{1}
W15{12}/{square root over (2)}
W15{123}/{square root over (3)}
W15{1234}/2









<Best Companion PMI Determining Method 1>
In the method 1, the best companion PMI may be selected from a codebook corresponding to a rank 1, that is, from a rank 1 codebook.
1. Preferred Rank of Terminal=1
Codewords corresponding to an index 1 through an index 4 may be mutually orthogonal. Codewords corresponding to index 1 through index 4 may be pre-coding matrices in a 4Tx LTE codebook, that is, an LTE codebook for a case in which the base station includes four antennas. The same principle may be applied to codewords corresponding to an index 5 through an index 8, codewords corresponding to an index 9 through an index 12, and codewords corresponding to an index 13 through an index 16. Accordingly, 16 vectors corresponding to the codewords may be classified into four sets associated with orthogonal vectors.
(1) Reference Rank=2
Best companion PMI candidates to be used for calculating the best companion CQI may be defined for each of rank 1 SU-MIMO PMIs.
For example, the best companion PMI candidates may be defined as shown in Table 2.













TABLE 2







Codeword index(=SU-MIMO PMI)
1
2
3
4









Best companion PMI candidate 1
3
4
1
2



Best companion PMI candidate 2
4
3
2
1



Best companion PMI candidate 3
2
1
4
3










Referring to Table 2, if a codeword index corresponding to the SU-MIMO PMI is 1, a best companion PMI candidate 1 is 3. The terminal may calculate the best companion CQI based on the assumption that a pre-coding matrix of the base station is [PMI—1, PMI—3], and on the assumption that a layer corresponding to PMI—3 is an interference layer and a layer corresponding to the PMI—1 is a signal layer. In this example, PMI_n denotes a codeword corresponding to an index n.
Examples of the best companion PMI candidates with respect to a codeword index 5 through a codeword index 16 are organized in Table 3 through Table 5.













TABLE 3







Codeword index
5
6
7
8









Best companion PMI candidate 1
8
7
6
5



Best companion PMI candidate 2
7
8
5
6



Best companion PMI candidate 3
6
5
8
7























TABLE 4







Codeword index
9
10
11
12






















Best companion PMI candidate 1
11
12
9
10



Best companion PMI candidate 2
12
11
10
9



Best companion PMI candidate 3
10
9
12
11























TABLE 5







Codeword index
13
14
15
16









Best companion PMI candidate 1
16
15
14
13



Best companion PMI candidate 2
15
16
13
14



Best companion PMI candidate 3
14
13
16
15










A table including a pair of codeword indices corresponding to the SU-MIMO PMI and a best companion PMI may be obtained based on combinations of the best companion PMI candidates of Table 1 through Table 5. An example of the obtained tables is provided as Table 6.























TABLE 6





Codeword index
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16







Best
3
4
1
2
7
8
5
6
12
11
10
9
14
13
16
15


companion PMI









The terminal may feed back best companion CQIs with respect to all candidates. In this example, even though feedback overhead increases, a dynamic switching between an SU-MIMO scheme and an MU-MIMO scheme may be improved.
According to another example, the terminal may feed back a single best companion CQI that is obtained based on an average of all best companion PMI candidates of the best companion CQIs. For example, if the SU-MIMO PMI is 1, the terminal may feed back a best companion CQI that is obtained as an average of three best companion CQIs such as a best companion CQI that has a best companion PMI of 2, a best companion CQI that has a best companion PMI of 3, and a best companion CQI that has a best companion PMI of 4.
(2) Reference Rank=3
Two best companion PMI candidates to be used for calculating the best companion CQI may be defined with respect to each rank 1 SU-MIMO PMI.
For example, the best companion PMI candidates may be defined as shown in Table 7.











TABLE 7





Codeword index
1
2
3
4







Best companion PMI candidate 1
2, 3
3, 4
4, 1
2, 3


Best companion PMI candidate 2
3, 4
4, 1
1, 2
3, 1


Best companion PMI candidate 3
4, 2
1, 3
2, 4
1, 2









Referring to Table 7, if a codeword index corresponding to the SU-MIMO PMI is 1, the best companion PMI candidate 1 is 2 and 3. The terminal may calculate the best companion CQI, based on the assumption that a pre-coding matrix of the base station is [PMI—1, PMI—2, PIM—3], and based on the assumption that a layer corresponding to PMI—2 and PMI—3 is an interference layer and a layer corresponding to PMI—1 is a signal layer.
The best companion PMI candidates with respect to a codeword index 5 through a codeword index 16 may be organized as shown in Table 8 through Table 10.











TABLE 8





Codeword index
5
6
7
8







Best companion PMI candidate 1
6, 7
7, 8
8, 5
5, 6


Best companion PMI candidate 2
7, 8
8, 5
5, 6
6, 7


Best companion PMI candidate 3
8, 6
5, 7
6, 8
7, 5




















TABLE 9





Codeword index
9
10
11
12







Best companion PMI candidate 1
10, 11
11, 12
12, 9 
 9, 10


Best companion PMI candidate 2
11, 12
12, 9 
 9, 10
10, 11


Best companion PMI candidate 3
12, 10
 9, 11
10, 12
11, 9 




















TABLE 10





Codeword index
13
14
15
16







Best companion PMI candidate 1
14, 15
15, 16
16, 13
13, 14


Best companion PMI candidate 2
15, 16
16, 13
13, 14
14, 15


Best companion PMI candidate 3
16, 14
13, 15
14, 16
15, 13









A table including a pair of a codeword indices corresponding to the SU-MIMO PMI and two best companion PMI candidates may be obtained based on combinations of the best companion PMI candidates as shown in Table 7 through Table 10.
(3) Reference Rank=4
Three best companion PMI candidates to be used for calculating the best companion CQI may be defined with respect to each rank 1 SU-MIMO PMI.
For example, the best companion PMI candidates may be defined as shown in Table 11 through Table 14.











TABLE 11





Codeword index
1
2
3
4







Best companion PMI candidate 1
2, 3,
3, 4,
4, 1,
1, 2,



4
1
2
3




















TABLE 12





Codeword index
5
6
7
8







Best companion PMI candidate 1
6, 7,
7, 8,
8, 5,
5, 6,



8
5
6
7




















TABLE 13





Codeword index
9
10
11
12







Best companion PMI candidate 1
10, 11,
11, 12,
12, 9,
9, 10,



12
9
10
11




















TABLE 14





Codeword index
13
14
15
16







Best companion PMI candidate 1
14, 15,
15, 16,
16, 13,
13, 14,



16
13
14
15









A table including a pair of a codeword indices corresponding to the SU-MIMO PMI and three PMIs may be obtained based on combinations of the best companion PMI candidates in Table 1 through Table 14.
—Power Allocation—
When the terminal calculates a CQI, it is assumed that the terminal allocates different powers to each codeword. For example, if the reference rank is equal to 4, the terminal may allocate 1⁄2 total power to the 1 SU-MIMO PMI, and may allocate 1⁄6 total power to each of remaining best companion PMIs. An example of candidates for power allocation may be as follows.




  
    [
    
      power
      ⁢
      
        
      
      ⁢
      of
      ⁢
      
        
      
      ⁢
      rank
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        
      
      ⁢
      SU
      ⁢
      
        -
      
      ⁢
      MIMO
      ⁢
      
        
      
      ⁢
      P
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      
        I
        /
        power
      
      ⁢
      
        
      
      ⁢
      of
      ⁢
      
        
      
      ⁢
      best
      ⁢
      
        
      
      ⁢
      companion
      ⁢
      
        
      
      ⁢
      P
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      
        I
        /
        power
      
      ⁢
      
        
      
      ⁢
      of
      ⁢
      
        
      
      ⁢
      best
      ⁢
      
        
      
      ⁢
      companion
      ⁢
      
        
      
      ⁢
      P
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      
        I
        /
        power
      
      ⁢
      
        
      
      ⁢
      of
      ⁢
      
        
      
      ⁢
      best
      ⁢
      
        
      
      ⁢
      companion
      ⁢
      
        
      
      ⁢
      P
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      I
    
    ]
  
  =
  
    
      [
      
        
          
            
              1
              2
            
            /
            
              1
              6
            
          
          /
          
            1
            6
          
        
        /
        
          1
          6
        
      
      ]
    
    ⁢
    
      
    
    ⁢
    
      or
      ⁢
      
        
      
      [
      
        
          
            
              1
              2
            
            /
            
              1
              2
            
          
          /
          0
        
        /
        0
      
      ]
    
    ⁢
    
      
    
    ⁢
    
      or
      ⁢
      
        
      
      [
      
        
          
            
              1
              2
            
            /
            0
          
          /
          
            1
            2
          
        
        /
        0
      
      ]
    
    ⁢
    
      
    
    ⁢
    
      or
      ⁢
      
        
      
      [
      
        
          
            
              1
              2
            
            /
            0
          
          /
          0
        
        /
        
          1
          2
        
      
      ]
    
    ⁢
    
      
    
    ⁢
    
      or
      ⁢
      
        
      
      [
      
        
          
            
              1
              4
            
            /
            
              1
              4
            
          
          /
          
            1
            4
          
        
        /
        
          1
          4
        
      
      ]
    
  




—Best Companion CQI—
The terminal may generate a matrix Vg=[a codeword corresponding to the SU MIMO PMI, codewords corresponding to the best companion PMIs]. The matrix Vg may be generated based on the SU-MIMO PMI and the best companion PMI. The terminal may assume that a first column of the matrix Vg is to be a pre-coding matrix for the terminal, and the remaining columns of the matrix Vg are to be interference pre-coding matrices. The terminal may calculate the best companion CQI as a signal-to-interference plus noise ratio (SINR). The first column of the matrix Vg may be a first column of a codeword corresponding to the SU-MIMO PMI and the remaining columns of the matrix Vg may be remaining columns of the codeword corresponding to the SU-MIMO PMI and codewords corresponding to the best companion PMIs. For example if the reference rank is R, the best companion CQI with respect to a terminal k may be calculated by Equation 1.




  
    
      
        
          best
          ⁢
          
            
          
          ⁢
          companion
          ⁢
          
            
          
          ⁢
          C
          ⁢
          
            
          
          ⁢
          Q
          ⁢
          
            
          
          ⁢
          I
        
        =
        
          
            
              SINR
              ⁡
              
                (
                
                  V
                  g
                
                )
              
            
            
              k
              ,
              1
            
          
          =
          
            
              
                
                
                  
                    b
                    H
                  
                  ⁢
                  
                    H
                    k
                  
                  ⁢
                  
                    
                      V
                      g
                    
                    ⁡
                    
                      (
                      1
                      )
                    
                  
                
                
              
              2
            
            
              
                
                  ∑
                  
                    
                      l
                      =
                      1
                    
                    ,
                    
                      l
                      ≠
                      1
                    
                  
                  R
                
                ⁢
                
                  
                    
                    
                      
                        b
                        H
                      
                      ⁢
                      
                        H
                        k
                      
                      ⁢
                      
                        
                          V
                          g
                        
                        ⁡
                        
                          (
                          l
                          )
                        
                      
                    
                    
                  
                  2
                
              
              +
              
                
                  R
                  p
                
                ⁢
                
                  
                    
                    b
                    
                  
                  2
                
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          1
        
        ]
      
    
  




In this example, b denotes a receive beamforming vector, such as an MMSE, and the matrix Vg(m) denotes an mth column vector of the unitary matrix Vg. Also, P denotes a total transmission power. In this example, it is assumed that same amount of power is allocated to the streams.
2. Preferred Rank of Terminal=2
If the preferred rank of the terminal is equal to 2, and the terminal is capable of performing an SU-MIMO report including two CQIs with respect to each layer and a single PMI, the terminal may be scheduled in a rank 2 SU-MIMO, in an MU-MIMO with respect to a single layer, or in an MU-MIMO with respect to two layers.
As an example, if the base station includes four antennas, the terminal may be scheduled in the MU-MIMO with respect to the single layer, based on a column of a codeword with respect to a PMI corresponding to a highest CQI.
Accordingly, if codewords with respect to the best companion PMIs are orthogonal to the column of the codeword with respect to the PMI corresponding to the highest CQI, the best companion CQI may describe a CQI of a layer corresponding to the column of the codeword with respect to the PMI corresponding to the highest CQI.
For example, a first column of a codeword with respect to a rank 2 PMI in a 4Tx LTE codebook corresponding to a rank 2 may be the same as a codeword with respect to a rank 1 PMI in a codebook corresponding to a rank 1. In this example, best companion PMI candidates to be used for the first column of the codeword with respect to the rank 1 PMI may be expressed using a table for a case in which the preferred rank of the terminal is 1.
(1) Reference Rank=3
Best companion PMI candidates of a case in which a second column of a codeword with respect to a rank 2 PMI has a highest CQI are organized as shown in Table 15 and Table 16.











TABLE 15





Rank 2 codeword index
1
2
3
4







codeword index of rank 1
11
10
11
12


codebook same as second


column of rank 2 codeword


best companion PMI
12, 9 
11, 12
12, 9 
 9, 10


candidate 1 in rank 1


codebook


best companion PMI
 9, 10
12, 9 
 9, 10
10, 11


candidate 2 in rank 1


codebook


best companion PMI
10, 12
 9, 11
10, 12
11, 9 


candidate 3 in rank 1


codebook






















TABLE 16







Rank 2 codeword index
5
6
7
8









codeword index of rank 1


5
6



codebook same as second



column of rank 2 codeword



best companion PMI
5, 7
6, 8
6, 7
7, 8



candidate 1 in rank 1



codebook



best companion PMI


7, 8
8, 5



candidate 2 in rank 1



codebook



best companion PMI


8, 6
5, 7



candidate 3 in rank 1



codebook










Referring to Table 16, a best companion PMI corresponding to a second column of a codeword corresponding to the rank 2 codeword index 5 may be PMI—5 and PMI—7 in the rank 1 codebook. The best companion PMIs may be mutually orthogonal. Another PMI candidate that is orthogonal to the second column of the codeword corresponding to the rank 2 codeword index 5 does not exist in the rank 1 codebook.
When non-orthogonal best companion PMI is used, a number of best companion PMI candidates may increase.

    
    
        For example, the second column of the codeword corresponding to the rank 2 codeword index 5 may have a relatively low correlation with PMIs corresponding to indexes 1, 2, 9, 10, 11, and 12 of the rank 1 codebook.
        A second column of a codeword corresponding to a rank 2 codeword index 6 may have a relatively low correlation with PMIs corresponding to indexes 2, 3, 10, 11, 13, and 16 of the rank 1 codebook.
    
    


Accordingly, Table 17 is obtained by adding, to Table 16, PMI candidates having relatively low correlation.











TABLE 17





Rank 2 codeword index
5
6
7
8







codeword index of rank 1


5
6


codebook same as second


column of rank 2 codeword


best companion PMI
5, 7
6, 8
6, 7
7, 8


candidate 1 in rank 1


codebook


best companion PMI
1, 2
2, 3
7, 8
8, 5


candidate 2 in rank 1


codebook


best companion PMI
 9, 10
10, 11
8, 6
5, 7


candidate 3 in rank 1


codebook


best companion PMI
11, 12
13, 16


candidate 4 in rank 1


codebook









Best companion PMI candidates with respect to remaining rank 2 codeword indexes are organized as shown in Table 18 and Table 19.











TABLE 18





Rank 2 codeword index
9
10
11
12







codeword index of rank 1
1
4
9
10


codebook same as second


column of rank 2 codeword


best companion PMI
2, 3
2, 3
10, 11
11, 12


candidate 1 in rank 1


codebook


best companion PMI
3, 4
3, 1
11, 12
12, 9 


candidate 2 in rank 1


codebook


best companion PMI
4, 2
1, 2
12, 10
 9, 11


candidate 3 in rank 1


codebook




















TABLE 19





Rank 2 codeword index
13
14
15
16







codeword index of rank 1
14
16
13
15


codebook same as second


column of rank 2 code word


best companion PMI
15, 16
13, 14
14, 15
16, 13


candidate 1 in rank 1


codebook


best companion PMI
16, 13
14, 15
15, 16
13, 14


candidate 2 in rank 1


codebook


best companion PMI
13, 15
15, 13
16, 14
14, 16


candidate 3 in rank a


codebook









A table including a pair of a rank 2 codeword indices with respect to the reference rank of 3 and two rank 1 best companion PMIs may be obtained based on combinations of best companion PMI candidates in Table 15, Table 16, Table 18, and/or Table 19. The table may also be obtained based on a combination of Table 15, 17, 18, and/or 19.
(2) Reference Rank=4
Even when the reference rank is 4, the best companion PMI candidates with respect to the rank 2 codeword may be expressed using codewords of the rank 1 codebook.













TABLE 20







Rank 2 codeword index
1
2
3
4









Codeword index of rank 1
11
10
11
12



codebook same as second



column of rank 2 codeword



Best companion PMI
12, 9,
9, 11,
12, 9,
9, 10,



candidate 1 in rank 1
11
12
10
11



codebook





















TABLE 21





Rank 2 codeword index
5
6
7
8







codeword index of rank 1


5
6


codebook same as second


column of rank 2 codeword


best companion PMI
1, 5, 7
2, 6, 8
6, 7, 8
7, 8, 5


candidate 1 in rank 1


codebook


best companion PMI
2, 5, 7
3, 6, 8


candidate 2 in rank 1


codebook


best companion PMI
9, 5, 7
10, 6, 8


candidate 3 in rank 1


codebook


best companion PMI
10, 5, 7
11, 6, 8


candidate 4 in rank 1


codebook


Best companion PMI
11, 5, 7
13, 6, 8


candidate 5 in rank 1


codebook


Best companion PMI
12, 5, 7
16, 6, 8


candidate 6 in rank 1


codebook




















TABLE 22





Rank 3 codeword index
9
10
11
12







Codeword index of rank 1
1
4
9
10


codebook same as second


column of rank 2 codeword


Best companion PMI
2, 3, 4
1, 2, 3
10, 11, 12
9, 11, 12


candidate 1 in rank 1


codebook




















TABLE 23





Rank 2 codeword index
13
14
15
16







Codeword index of rank 1
14
16
13
15


codebook same as second


column of rank 2 codeword


best companion PMI
13, 15,
13, 14,
14, 15,
16, 13,


candidate 1 of rank
16
15
16
14


1 codebook









A table including a pair of rank 2 codeword indices with respect to the reference rank of 4 and three rank 1 best companion PMIs may be obtained based on combinations of Table 20 through Table 23.
A best companion CQI with respect to a case in which the preferred rank of the terminal is 2 may be calculated similarly as in Equation 1.
<Best Companion PMI Determining Method 2>
In the method 2, the best companion PMI may be determined based on a codebook corresponding to a reference rank.
1. Preferred Rank of Terminal=1
The terminal may select a PMI from the rank 1 codebook. With respect to a given reference rank, codewords with respect to the best companion PMI may be determined based on columns of a pre-coding matrix that have a codeword with respect to the PMI selected by the terminal, as a first column. For example, the pre-coding matrix may be included in a codebook corresponding to the reference rank.
(1) Reference Rank=2
A second column of a codeword with respect to a rank 2 PMI that has an index that is the same as the rank 1 PMI selected by the terminal may be the best companion PMI. As described herein, a first column of the codeword with respect to the rank 1 PMI may be the same as the codeword with respect to the rank 1 PMI selected by the terminal. Accordingly, the rank 1 PMI selected by the terminal may be orthogonal to the best companion PMI, examples of which are organized in Table 24 and Table 25.















TABLE 24





Rank 1 codeword index
1
2
3
4
5
6
7
8







second column of rank 2
1
2
3
4
5
6
7
8


codeword corresponding to










corresponding index is










codeword with respect










to best companion PMI
























TABLE 25





Rank 1 codeword index
9
10
11
12
13
14
15
16







second column of rank 2
9
10
11
12
13
14
15
16


codeword corresponding to










corresponding index is










codeword with respect










to best companion PMI









(2) Reference Rank=3
A second column and a third column of a codeword with respect to a rank 3 PMI that has an index that is same as the rank 1 PMI may be the best companion PMIs, examples of which are organized in Table 26 and Table 27.















TABLE 26





Rank 1 codeword index
1
2
3
4
5
6
7
8







second and third columns of
1
2
3
4
5
6
7
8


codeword of rank 3










corresponding to










corresponding index are










codewords with respect to










best companion PMI
























TABLE 27





Rank 1 codeword index
9
10
11
12
13
14
15
16







second and third columns of
9
10
11
12
13
14
15
16


codeword of rank 3










corresponding to










corresponding index are










codewords with respect to










best companion PMI









(2) Reference Rank=4
A second column, a third column, and a fourth column of a codeword with respect to a rank 4 PMI that has an index that is the same as the rank 1 PMI may be the best companion PMIs, examples of which are organized in Table 28 and Table 29.















TABLE 28





Rank 1 codeword index
1
2
3
4
5
6
7
8







second, third, fourth columns
1
2
3
4
5
6
7
8


of codeword of rank 4










corresponding to










corresponding index are










codewords with respect to










best companion PMI
























TABLE 29





Rank 1 codeword index
9
10
11
12
13
14
15
16







second, third, fourth column
9
10
11
12
13
14
15
16


of codeword of rank 4










corresponding to










corresponding index are










codewords with respect to










best companion PMI









2. Preferred Rank of Terminal=2
When the preferred rank of terminal is 2, and codewords with respect to best companion PMIs are orthogonal to a column of a codeword that has a highest CQI in an SU-MIMO report, the best companion CQI may describe a CQI of a layer corresponding to the column of the codeword having the highest CQI in the SU-MIMO report.
(1) Reference Rank=2
In some examples, the best companion CQI and an SU-MIMO CQI may overlap each other and may provide the same information. Therefore, the terminal may not feed back an additional best companion CQI.
(2) Reference Rank=3
Two best companion PMIs to be used for calculating the best companion CQI may be defined with respect to each rank 2 SU-MIMO PMI.

    
    
        A first best companion PMI may correspond to a column of a codeword with respect to a rank 2 SU-MIMO PMI having a lowest CQI.
        A second best companion PMI may correspond to a column that is different from a codeword with respect to the rank 2 SU-MIMO PMI from among columns of a rank 3 PMI that have the same index as the rank 2 SU-MIMO PMI.
    
    


Examples of which are organized in Table 30 and Table 31.















TABLE 30





Rank 2 codeword index
1
2
3
4
5
6
7
8







best companion PMI corresponds
1
2
3
4
5
6
7
8


to column that is excluded










from rank 2 PMI among columns










of codeword with respect to










rank 3 PMI
























TABLE 31





Rank 2 codeword index
9
10
11
12
13
14
15
16







best companion PMI corresponds
9
10
11
12
13
14
15
16


to column that is excluded










from rank 2 PMI among columns










of codeword with respect to










rank 3 PMI









(3) Reference Rank=4
As yet another example, three best companion PMIs to be used for calculating the best companion CQI may be defined for each rank 2 SU-MIMO PMI.

    
    
        A first best companion PMI may correspond to a column of a codeword with respect to a rank 2 SU-MIMO PMI that has a lowest CQI.
        A second best companion PMI and a third best companion PMI may correspond to columns that are different from a codeword with respect to the rank 2 SU-MIMO PMI from among columns of a rank 4 PMI that have an index that is the same as the rank 2 SU-MIMO PMI.
    
    


Example of which are organized in Table 32 and Table 33.















TABLE 32





Rank 2 codeword index
1
2
3
4
5
6
7
8







best companion PMI corresponds
1
2
3
4
5
6
7
8


to columns that are excluded










from rank 2 PMI among columns










of codeword with respect to










rank 4 PMI
























TABLE 33





Rank 2 codeword index
9
10
11
12
13
14
15
16







best companion PMI corresponds
9
10
11
12
13
14
15
16


to columns that are excluded










from rank 2 PMI among columns










of codeword with respect to










rank 4 PMI









<A Case in which a Base Station Includes Eight Antennas (8Tx)>
If the base station includes eight antennas, the foregoing methods may be applied based on an LTE-A codebook. Codebooks to be used when the base station includes eight antennas may be provided as shown in Table 34 through Table 41. In this example, φn=ejπn/2 and νm=[1ej2πm/32ej4πm/32ej6πm/32]T.








TABLE 34








i2















i1
0
1
2
3
4
5
6
7





0-15
W2i1,0(1)
W2i1,1(1)
W2i1,2(1)
W2i1,3(1)
W2i1+1,0(1)
W2i1+1,1(1)
W2i1+1,2(1)
W2i1+1,3(1)












i2















i1
8
9
10
11
12
13
14
15





0-15
W2i1+2,0(1)
W2i1+2,1(1)
W2i1+2,2(1)
W2i1+2,3(1)
W2i1+3,0(1)
W2i1+3,1(1)
W2i1+3,2(1)
W2i1+3,3(1)









  
    where
    ⁢
    
      
    
    ⁢
    
      W
      
        m
        ,
        n
      
      
        (
        1
        )
      
    
  
  =
  
    
      1
      
        8
      
    
    ⁡
    
      [
      
        
          
            
              v
              m
            
          
        
        
          
            
              
                φ
                n
              
              ⁢
              
                v
                m
              
            
          
        
      
      ]
    
  










Table 34 is an example of a codebook for 1-layer CSI feedback.








TABLE 35








i2











i1
0
1
2
3





0-15
W2i1,2i1,0(2)
W2i1,2i1,1(2)
W2i1+1,2i1+1,0(2)
W2i1+1,2i1+1,1(2)












i2











i1
4
5
6
7





0-15
W2i1+2,2i1+2,0(2)
W2i1+2,2i1+2,1(2)
W2i1+3,2i1+3,0(2)
W2i1+3,2i1+3,1(2)












i2











i1
8
9
10
11





0-15
W2i1,2i1+1,0(2)
W2i1,2i1+1,1(2)
W2i1+1,2i1+2,0(2)
W2i1+1,2i1+2,1(2)












i2











i1
12
13
14
15





0-15
W2i1,2i1+3,0(2)
W2i1,2i1+3,1(2)
W2i1+1,2i1+3,0(2)
W2i1+1,2i1+3,1(2)









  
    where
    ⁢
    
      
    
    ⁢
    
      W
      
        m
        ,
        
          m
          ′
        
        ,
        n
      
      
        (
        2
        )
      
    
  
  =
  
    
      1
      4
    
    ⁡
    
      [
      
        
          
            
              v
              m
            
          
          
            
              v
              
                m
                ′
              
            
          
        
        
          
            
              
                φ
                n
              
              ⁢
              
                v
                m
              
            
          
          
            
              
                -
                
                  φ
                  n
                
              
              ⁢
              
                v
                
                  m
                  ′
                
              
            
          
        
      
      ]
    
  










Table 35 is an example of a codebook for 2-layer CSI feedback








TABLE 36








i2











i1
0
1
2
3





0-3
W8i1,8i1,8i1+8(3)
W8i1+8,8i1,8i1+8(3)
{tilde over (W)}8i1,8i1+8,8i1+8(3)
{tilde over (W)}8i1+8,8i1,8i1(3)












i2











i1
4
5
6
7





0-3
W8i1+2,8i1+2,4i1+10(3)
W8i1+10,8i1+2,8i1+10(3)
{tilde over (W)}8i1+2,8i1+10,8i1+10(3)
{tilde over (W)}8i1+10,8i1+2,8i1+2(3)












i2











i1
8
9
10
11





0-3
W8i1+4,8i1+4,8i1+12(3)
W8i1+12,8i1+4,8i1+12(3)
{tilde over (W)}8i1+4,8i1+12,8i1+12(3)
{tilde over (W)}8i1+12,8i1+4,8i1+4(3)












i2











i1
12
13
14
15





0-3
W8i1+6,8i1+6,8i1+14(3)
W8i1+14,8i1+6,8i1+14(3)
{tilde over (W)}8i1+6,8i1+14,8i1+14(3)
{tilde over (W)}8i1+14,8i1+6,8i1+6(3)









  
    
      where
      ⁢
      
        
      
      ⁢
      
        W
        
          m
          ,
          
            m
            ′
          
          ,
          
            m
            ′′
          
        
        
          (
          3
          )
        
      
    
    =
    
      
        1
        
          24
        
      
      ⁡
      
        [
        
          
            
              
                v
                m
              
            
            
              
                v
                
                  m
                  ′
                
              
            
            
              
                v
                
                  m
                  ′′
                
              
            
          
          
            
              
                v
                m
              
            
            
              
                -
                
                  v
                  
                    m
                    ′
                  
                
              
            
            
              
                -
                
                  v
                  
                    m
                    ′′
                  
                
              
            
          
        
        ]
      
    
  
  ,






  
    
      W
      ~
    
    
      m
      ,
      
        m
        ′
      
      ,
      
        m
        ′′
      
    
    
      (
      3
      )
    
  
  =
  
    
      1
      
        24
      
    
    ⁡
    
      [
      
        
          
            
              v
              m
            
          
          
            
              v
              
                m
                ′
              
            
          
          
            
              v
              
                m
                ′′
              
            
          
        
        
          
            
              v
              m
            
          
          
            
              v
              
                m
                ′
              
            
          
          
            
              -
              
                v
                
                  m
                  ′′
                
              
            
          
        
      
      ]
    
  










Table 36 is an example of a codebook for 3-layer CSI feedback.








TABLE 37








i2











i1
0
1
2
3





0-3
W8i1,8i1+8,0(4)
W8i1,8i1+8,1(4)
W8i1+2,8i1+10,0(4)
W8i1+2,8i1+10,1(4)












i2











i1
4
5
6
7





0-3
W8i1+4,8i1+12,0(4)
W8i1+4,8i1+12,1(4)
W8i1+6,8i1+14,0(4)
W8i1+6,8i1+14,1(4)









  
    where
    ⁢
    
      
    
    ⁢
    
      W
      
        m
        ,
        
          m
          ′
        
        ,
        n
      
      
        (
        4
        )
      
    
  
  =
  
    
      1
      
        32
      
    
    [
    
      
        
          
            v
            m
          
        
        
          
            v
            
              m
              ′
            
          
        
        
          
            v
            m
          
        
        
          
            v
            
              m
              ′
            
          
        
      
      
        
          
            
              φ
              n
            
            ⁢
            
              v
              m
            
          
        
        
          
            
              φ
              n
            
            ⁢
            
              v
              
                m
                ′
              
            
          
        
        
          
            
              -
              
                φ
                n
              
            
            ⁢
            
              v
              m
            
          
        
        
          
            
              -
              
                φ
                n
              
            
            ⁢
            
              v
              
                m
                ′
              
            
          
        
      
    
    ]
  










Table 37 is an example of a codebook for 4-layer CSI.










TABLE 38










i2



i1
0







0-3




  
    W
    
      i
      1
    
    
      (
      5
      )
    
  
  =
  
    
      1
      
        40
      
    
    ⁡
    
      [
      
        
          
            
              v
              
                2
                ⁢
                
                  i
                  1
                
              
            
          
          
            
              v
              
                2
                ⁢
                
                  i
                  1
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                8
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                8
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                16
              
            
          
        
        
          
            
              v
              
                2
                ⁢
                
                  i
                  1
                
              
            
          
          
            
              -
              
                v
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                8
              
            
          
          
            
              -
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  8
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                16
              
            
          
        
      
      ]
    
  














Table 38 is an example of a codebook for 5-layer CSI feedback.








TABLE 39








i2


i1
0





0-3




  
    W
    
      i
      1
    
    
      (
      6
      )
    
  
  =
  
    
      1
      
        48
      
    
    ⁡
    
      [
      
        
          
            
              v
              
                2
                ⁢
                
                  i
                  1
                
              
            
          
          
            
              v
              
                2
                ⁢
                
                  i
                  1
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                8
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                8
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                16
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                16
              
            
          
        
        
          
            
              v
              
                2
                ⁢
                
                  i
                  1
                
              
            
          
          
            
              -
              
                v
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                8
              
            
          
          
            
              -
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  8
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                16
              
            
          
          
            
              -
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  16
                
              
            
          
        
      
      ]
    
  













Table 39 is an example of a codebook for 6-layer CSI feedback.








TABLE 40








i2


i1
0





0-3




  
    W
    
      i
      1
    
    
      (
      7
      )
    
  
  =
  
    
      1
      
        56
      
    
    ⁡
    
      [
      
        
          
            
              v
              
                2
                ⁢
                
                  i
                  1
                
              
            
          
          
            
              v
              
                2
                ⁢
                
                  i
                  1
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                8
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                8
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                16
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                16
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                24
              
            
          
        
        
          
            
              v
              
                2
                ⁢
                
                  i
                  1
                
              
            
          
          
            
              -
              
                v
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                8
              
            
          
          
            
              -
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  8
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                16
              
            
          
          
            
              -
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  16
                
              
            
          
          
            
              v
              
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
                +
                24
              
            
          
        
      
      ]
    
  













Table 40 is an example of codebook for 7-layer CSI feedback








TABLE 41








i2


i1
0





0




  
    W
    
      i
      1
    
    
      (
      8
      )
    
  
  =
  
    
      
        1
        8
      
      ⁡
      
        [
        
          
            
              
                v
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
              
            
            
              
                v
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
              
            
            
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  8
                
              
            
            
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  8
                
              
            
            
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  16
                
              
            
            
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  16
                
              
            
            
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  24
                
              
            
            
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  24
                
              
            
          
          
            
              
                v
                
                  2
                  ⁢
                  
                    i
                    1
                  
                
              
            
            
              
                -
                
                  v
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                
              
            
            
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  8
                
              
            
            
              
                -
                
                  v
                  
                    
                      2
                      ⁢
                      
                        i
                        1
                      
                    
                    +
                    8
                  
                
              
            
            
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  16
                
              
            
            
              
                -
                
                  v
                  
                    
                      2
                      ⁢
                      
                        i
                        1
                      
                    
                    +
                    16
                  
                
              
            
            
              
                v
                
                  
                    2
                    ⁢
                    
                      i
                      1
                    
                  
                  +
                  24
                
              
            
            
              
                -
                
                  v
                  
                    
                      2
                      ⁢
                      
                        i
                        1
                      
                    
                    +
                    24
                  
                
              
            
          
        
        ]
      
    
     
  













Table 41 is an example of a codebook for 8-layer CSI feedback.
A table indicating a mapping relation between a codeword index and a best companion PMI may be obtained based on the codebook. For example, the tables may be obtained based on the best companion PMI determining method 1 and method 2 in the example in which the base station includes four antennas.
<Best Companion PMI Determining Method 1>
1. Preferred Rank of Terminal=1
Best companion PMI candidates to be used for calculating a best companion CQI may be defined for each rank 1 SU-MIMO PMI and may be determined as follows.
(1) Reference Rank=2
Two options may exist.

    
    
        With respect to an i2 entry that is fixed and that is the same as an i2 index as a rank 1 SU-MIMO report, it entry candidates that enable a best companion W to be orthogonal to a rank 1 SU-MIMO PMI W are organized in table 42
    
    












TABLE 42







Codeword index i1
i1









Best Companion index candidate 1
mod(i1 + 4, 16)



Best Companion index candidate 2
mod(i1 + 8, 16)



Best Companion index candidate 3
mod(i1 + 12, 16)










    
    
        With respect to an i1 entry that is fixed and that is the same as an i1 index as the rank 1 SU-MIMO report, i2 entry candidates that enable the best companion W to be orthogonal to the rank 1 SU-MIMO PMI W are organized in Table 43.
    
    












TABLE 43







Codeword index i2
i2









Best Companion index candidate 1
mod(i2 + 2, 4)



Best Companion index candidate 2
mod(i2 + 2, 4) + 4



Best Companion index candidate 3
mod(i2 + 2, 4) + 8



Best Companion index candidate 4
mod(i2 + 2, 4) + 12










(2) Reference Rank=3
Two preferred best companion PMIs to be used for calculating a CQI may be defined with respect to each rank 1 SU-MIMO PMI as shown in Table 44.










TABLE 44







Codeword index i1
i1









Best Companion index candidate 1
mod(i1 + 4, 16),




mod(i1 + 8, 16)



Best Companion index candidate 2
mod(i1 + 8, 16),




mod(i1 + 12, 16)



Best Companion index candidate 3
mod(i1 + 12, 16),




mod(i1 + 4, 16)










(3) Reference Rank=4
Three preferred best companion PMIs to be used for calculating the CQI may be defined with respect to each rank 1 SU-MIMO PMI as shown in Table 45.










TABLE 45







Codeword index i1
i1









Best Companion index candidate 1
mod(i1 + 4, 16),




mod(i1 + 8, 16),




mod(i1 + 12, 16)










—Power Allocation—
When a terminal calculates the CQI, it is assumed that the terminal allocates different amounts of power to each codeword. For example, if the reference rank is equal to 4, it may be assumed that the terminal allocates 1⁄2 total power to the rank 1 SU-MIMO PMI, and allocates 1⁄6 total power to each of remaining best companion PMIs. Examples of candidates for power allocation may be as follows.




  
    [
    
      power
      ⁢
      
        
      
      ⁢
      of
      ⁢
      
        
      
      ⁢
      rank
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        
      
      ⁢
      SU
      ⁢
      
        -
      
      ⁢
      MIMO
      ⁢
      
        
      
      ⁢
      P
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      
        I
        /
        power
      
      ⁢
      
        
      
      ⁢
      of
      ⁢
      
        
      
      ⁢
      best
      ⁢
      
        
      
      ⁢
      companion
      ⁢
      
        
      
      ⁢
      P
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      
        I
        /
        power
      
      ⁢
      
        
      
      ⁢
      of
      ⁢
      
        
      
      ⁢
      best
      ⁢
      
        
      
      ⁢
      companion
      ⁢
      
        
      
      ⁢
      P
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      
        I
        /
        power
      
      ⁢
      
        
      
      ⁢
      of
      ⁢
      
        
      
      ⁢
      best
      ⁢
      
        
      
      ⁢
      companion
      ⁢
      
        
      
      ⁢
      P
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      I
    
    ]
  
  =
  
    
      [
      
        
          
            
              1
              2
            
            /
            
              1
              6
            
          
          /
          
            1
            6
          
        
        /
        
          1
          6
        
      
      ]
    
    ⁢
    
      
    
    ⁢
    
      or
      ⁢
      
        
      
      [
      
        
          
            
              1
              2
            
            /
            
              1
              2
            
          
          /
          0
        
        /
        0
      
      ]
    
    ⁢
    
      
    
    ⁢
    
      or
      ⁢
      
        
      
      [
      
        
          
            
              1
              2
            
            /
            0
          
          /
          
            1
            2
          
        
        /
        0
      
      ]
    
    ⁢
    
      
    
    ⁢
    
      or
      ⁢
      
        
      
      [
      
        
          
            
              1
              2
            
            /
            0
          
          /
          0
        
        /
        
          1
          2
        
      
      ]
    
    ⁢
    
      
    
    ⁢
    
      or
      ⁢
      
        
      
      [
      
        
          
            
              1
              4
            
            /
            
              1
              4
            
          
          /
          
            1
            4
          
        
        /
        
          1
          4
        
      
      ]
    
  




Feedback Mechanism Using Physical Uplink Shared Channel (PUSCH)
Examples of extensions of PUSCH modes for feedback of the best companion CQI are described. In various examples, extension of PUSCH modes for a case in which a reference rank is greater than a preferred rank of the terminal, are described.
(1) Extension of PUSCH 1-2
A plurality of subband PMIs corresponding to different subbands, a wideband CQI for each layer, and at least one wideband best companion CQI may be fed back using the same sub-frame.
(2) Extension of PUSCH 3-1
As a first option, a wideband PMI, a wideband CQI for each layer, a plurality of differential sub-band CQIs associated with a wideband CQI (the respective differential subband CQIs corresponding to different layers and different subbands), an optional best companion wideband CQI for each layer, and differential best companion sub-band CQIs for each sub-band (the differential best companion sub-band CQIs associated with a wideband CQI or a best companion wideband CQI) may be fed back using the same sub-frame.
A second option may be used to reduce overhead. For example, a wideband PMI, a wideband CQI for each layer, an optional best companion wideband for each layer, differential best companion sub-band CQIs for each sub-band (best companion sub-band CQIs associated with a wideband CQI or a best companion wideband CQI) may be fed back using the same sub-frame.
(3) Extension of PUSCH 2-2
As a first option, a wideband PMI, a wideband CQI for each layer, an optional best companion wideband for each layer, a sub-band PMI selected for best sub-bands, a differential CQI for each layer with respect to best subbands, a plurality of differential best companion sub-band CQIs with respect to the best sub-bands (differential best companion sub-band CQI associated with a wideband CQI or a best companion wideband CQI) may be fed back using the same sub-frame.
A second option may be used to reduce overhead. For example, a wideband PMI, a wideband CQI for each layer, an optional best companion wideband CQI for each layer, a sub-band PMI selected with respect to best sub-bands, a plurality of differential best companion sub-band CQIs with respect to the best subbands (differential best companion sub-band CQI associated with a wideband CQI or a best companion wideband CQI) may be fed back using the same sub-frame.
(4) Extension of PUSCH 3-2
As a first option, a plurality of sub-band PMIs corresponding to different sub-bands, a wideband CQI for each layer, an optional best companion wideband for each layer, a plurality of differential sub-band CQIs associated with a wideband CQI (respective differential sub-band CQIs corresponding to different codewords and different sub-bands), and differential best companion sub-band CQIs for each sub-band (differential best companion sub-band CQI associated with a wideband CQI or a best companion wideband CQI) may be fed back using the same sub-frame.
A second option may be used to reduce overhead. For example, a plurality of sub-band PMIs corresponding to different sub-bands, a wideband CQI for each layer, a best companion wideband CQI for each layer, differential best companion sub-band CQIs for each sub-band (differential best companion sub-band CQI associated with a wideband CQI or a best companion wideband CQI) may be fed back using the same sub-frame.
Extension of PUSCH modes for a rank restricted feedback, that is, extension of PUSCH modes for a case in which a reference rank is less than a preferred rank of a terminal, is described as follows. A wideband restricted PMI feedback is described as an example.
(1) Extension of PUSCH 1-2
As a first option, a plurality of sub-band PMIs corresponding to different sub-bands, a wideband CQI for each layer, a plurality of rank restricted PMIs respectively corresponding to different sub-bands, and a restricted wideband CQI for each layer may be fed back using the same sub-frame.
A second option may be used to reduce overhead. For example, a plurality of sub-band PMIs corresponding to different sub-bands, a wideband CQI for each layer, a wideband rank restricted PMI, and a restricted wideband CQI for each codeword may be fed back using the same sub-frame.
(2) Extension of PUSCH 3-1
A wideband PMI, a wideband CQI for each layer, a plurality of differential sub-band CQIs associated with a wideband CQI (respective differential sub-band CQI corresponding to different layers and different sub-bands), a rank restricted wideband PMI, a rank restricted wideband CQI for each layer, and a plurality of differential rank restricted CQIs associated with a rank restricted wideband CQI (the respective differential rank restricted sub-band CQIs corresponding to different layers and different sub-bands) may be fed back using the same sub-frame.
(3) Extension of PUSCH 2-2
A first option, a wideband PMI, a wideband CQI for each layer, a sub-band PMI selected with respect to best sub-bands, a differential CQI for each layer with respect to the best sub-bands, a rank restricted wideband PMI, a rank restricted wideband CQI for each layer, a rank restricted sub-band PMI selected with respect to the best sub-bands, and a rank restricted differential CQI for each layer with respect to the best sub-bands may be fed back using the same sub-frame.
As a second option, a wideband PMI, a wideband CQI for each layer, a sub-band PMI selected with respect to best sub-bands, a differential CQI for each layer with respect to the best sub-bands, a rank restricted wideband PMI, a rank restricted wideband for each layer, a rank restricted wideband CQI for each layer, and a rank restricted differential CQI for each layer with respect to the best sub-bands may be fed back using the same sub-frame.
(4) Extension of PUSCH 3-2
As a first option, a plurality of sub-band PMIs corresponding to different sub-bands, a wideband CQI for each layer, a plurality of differential sub-band CQIs associated with a wideband CQI (the respective differential sub-band CQIs corresponding to different codewords and different sub-bands), a plurality of rank restricted sub-band PMIs (respective rank restricted sub-band PMIs corresponding to different layers and different sub-bands), a plurality of rank restricted sub-band PMIs corresponding to different layers and different sub-bands, a rank restricted wideband CQI for each layer, and a plurality of rank restricted differential sub-band CQIs associated with a rank restricted wideband CQI (respective rank restricted differential sub-band CQIs corresponding to different layers and different sub-bands) may be fed back using the same sub-frame.
As a second option, a plurality of sub-band PMIs corresponding to different sub-bands, a wideband CQI for each layer, a plurality of differential sub-band CQI being associated with a wideband CQI (the respective differential sub-band CQIs corresponding to different layers and different sub-bands), a rank restricted wideband PMI, a single rank restricted wideband CQI for each layer, and a plurality of rank restricted differential sub-band CQIs associated with a rank restricted wideband CQI (respective rank restricted differential sub-band CQIs corresponding to different layers and different sub-bands) may be fed back using the same sub-frame.
FIG. 4 illustrates an example of a terminal in a MIMO communication system including a base station and the terminal.
Referring to FIG. 4, the terminal includes a receiving unit 410, a first pre-coding matrix selecting unit 420, a second pre-coding matrix extracting unit 430, a CQI generating unit 440, a transmitting unit 450, and a memory 460.
The receiving unit 410 may receive a reference rank that is determined by the base station.
The first pre-coding matrix selecting unit 420 may select, based on a preferred rank of the terminal, a preferred first pre-coding matrix for the terminal. The preferred first pre-coding matrix may be a codeword with respect to an SU-MIMO PMI of the terminal. The first pre-coding matrix selecting unit 420 may select the preferred first pre-coding matrix for the terminal based on a codebook corresponding to the preferred rank of the terminal.
The second pre-coding matrix extracting unit 430 may extract, based on a reference rank and the preferred rank of the terminal, at least one preferred second pre-coding matrix. The at least one preferred second pre-coding matrix may be a codeword with respect to a best companion PMI, for at least one neighboring terminal corresponding to the preferred first pre-coding matrix. For example, the second pre-coding matrix extracting unit 430 may calculate a rank for the at least one neighboring terminal, based on the reference rank and the preferred rank of the terminal, and may extract the at least one preferred second pre-coding matrix based on the rank for the at least one neighboring terminal.
In various examples, the second pre-coding matrix extracting unit 430 may extract the at least one preferred second pre-coding matrix based on a codebook corresponding to the preferred rank of the terminal or a codebook corresponding to the reference rank.
As another example, the second pre-coding matrix extracting unit 430 may extract the at least one preferred second pre-coding matrix, based on a table that is defined in advance and that includes pairs of first pre-coding matrix candidates and second pre-coding matrix candidates.
The CQI generating unit 440 may generate at least one channel quality indicator (CQI), that is, at least one best companion CQI, of the terminal, based on the preferred first pre-coding matrix and the at least one preferred second pre-coding matrix. For example, the CQI generating unit 440 may generate the at least one CQI based on interference due to the at least one preferred second pre-coding matrix.
The transmitting unit 450 may feed back, to the base station, the at least one CQI generated by the CQI generating unit 440.
The memory 460 may store the table that is defined in advance and that includes the pairs of the preferred first pre-coding matrix candidates and the second pre-coding matrix candidates. The memory 460 may store various codebooks.
As another example, the terminal may include a controller (not shown) that performs one or more functions of the receiving unit 410, the first pre-coding matrix 420, the second pre-coding matrix 430, the CQI generating unit 440, the transmitting unit 450, and the memory 460. For example, the controller may determine information to feedback to the base station based on the preferred rank and the reference rank.
FIG. 5 illustrates an example of a communication method of a terminal in an MIMO communication system including a base station and the terminal.
Referring to FIG. 5, the terminal obtains a reference rank determined by the base station, in 510.
The terminal selects a preferred first pre-coding matrix for the terminal, based on a preferred rank of the terminal, in 520.
The terminal may extract, based on the reference rank and the preferred rank of the terminal, at least one preferred second pre-coding matrix for at least one neighboring terminal corresponding to the preferred first pre-coding matrix, in 530. The at least one preferred second pre-coding matrix may be a codeword with respect to a best companion PMI of the terminal. The preferred first pre-coding matrix may be a codeword with respect to an SU-MIMO PMI of the terminal. In this example, the terminal may extract the at least one preferred second pre-coding matrix that is orthogonal to the preferred first pre-coding matrix.
The terminal may select a codeword corresponding to the preferred first pre-coding matrix from a plurality of codewords included in a codebook corresponding to the reference rank, and may determine the at least one preferred second pre-coding matrix based on the selected codeword. For example, remaining columns excluding a column included in the preferred first pre-coding matrix from columns included in the selected codeword may be selected as the at least one second pre-coding matrix.
The terminal generates the at least one CQI, that is, the at least one best companion CQI, of the terminal, based on the preferred first pre-coding matrix and the at least one preferred second pre-coding matrix, in 540.
The terminal feeds back the at least one CQI back to the base station, in 550.
A communication method of the terminal has been described. It should be appreciated that the examples described with reference to FIGS. 1 through 4 are applicable to the communication method of the terminal shown in FIG. 5.
In various examples herein, the rank may refer to the number of data streams to be used to transmit data from a base station to a terminal.
Program instructions to perform a method described herein, or one or more operations thereof, may be recorded, stored, or fixed in one or more computer-readable storage media. The program instructions may be implemented by a computer. For example, the computer may cause a processor to execute the program instructions. The media may include, alone or in combination with the program instructions, data files, data structures, and the like. Examples of computer-readable storage media include magnetic media, such as hard disks, floppy disks, and magnetic tape; optical media such as CD ROM disks and DVDs; magneto-optical media, such as optical disks; and hardware devices that are specially configured to store and perform program instructions, such as read-only memory (ROM), random access memory (RAM), flash memory, and the like. Examples of program instructions include machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter. The program instructions, that is, software, may be distributed over network coupled computer systems so that the software is stored and executed in a distributed fashion. For example, the software and data may be stored by one or more computer readable storage mediums. Also, functional programs, codes, and code segments for accomplishing the example embodiments disclosed herein can be easily construed by programmers skilled in the art to which the embodiments pertain based on and using the flow diagrams and block diagrams of the figures and their corresponding descriptions as provided herein. Also, the described unit to perform an operation or a method may be hardware, software, or some combination of hardware and software. For example, the unit may be a software package running on a computer or the computer on which that software is running.
As a non-exhaustive illustration only, a terminal/device/unit described herein may refer to mobile devices such as a cellular phone, a personal digital assistant (PDA), a digital camera, a portable game console, and an MP3 player, a portable/personal multimedia player (PMP), a handheld e-book, a portable lab-top PC, a global positioning system (GPS) navigation, a tablet, a sensor, and devices such as a desktop PC, a high definition television (HDTV), an optical disc player, a setup box, a home appliance, and the like that are capable of wireless communication or network communication consistent with that which is disclosed herein.
A computing system or a computer may include a microprocessor that is electrically connected with a bus, a user interface, and a memory controller. It may further include a flash memory device. The flash memory device may store N-bit data via the memory controller. The N-bit data is processed or will be processed by the microprocessor and N may be 1 or an integer greater than 1. Where the computing system or computer is a mobile apparatus, a battery may be additionally provided to supply operation voltage of the computing system or computer. It will be apparent to those of ordinary skill in the art that the computing system or computer may further include an application chipset, a camera image processor (CIS), a mobile Dynamic Random Access Memory (DRAM), and the like. The memory controller and the flash memory device may constitute a solid state drive/disk (SSD) that uses a non-volatile memory to store data.
A number of examples have been described above. Nevertheless, it should be understood that various modifications may be made. For example, suitable results may be achieved if the described techniques are performed in a different order and/or if components in a described system, architecture, device, or circuit are combined in a different manner and/or replaced or supplemented by other components or their equivalents. Accordingly, other implementations are within the scope of the following claims.

## Claims

1. A communication method of a terminal in a multiple-input multiple-output (MIMO) communication system including a base station and the terminal, the method comprising:
selecting a preferred first pre-coding matrix for the terminal based on a preferred rank of the terminal;
extracting at least one preferred second pre-coding matrix for at least one neighboring terminal corresponding to the preferred first pre-coding matrix based on a reference rank and the preferred rank of the terminal;
generating at least one channel quality indicator (CQI) of the terminal based on the preferred first pre-coding matrix and the at least one preferred second pre-coding matrix; and
feeding the at least one CQI back to the base station.

2. The method of claim 1, wherein the extracting comprises:
calculating a rank of the at least one neighboring terminal based on the reference rank and the preferred rank of the terminal; and
extracting the at least one preferred second pre-coding matrix based on the rank of the at least one neighboring terminal.

3. The method of claim 1, wherein the extracting comprises extracting the at least one preferred second pre-coding matrix using a predetermined table, and the table comprises respective pairs of first pre-coding matrix candidates and second pre-coding matrix candidates.

4. The method of claim 1, wherein the extracting comprises extracting the at least one preferred second pre-coding that is orthogonal to the preferred first pre-coding matrix.

5. The method of claim 1, wherein the generating comprises generating the at least one CQI based on interference due to the at least one preferred second pre-coding matrix.

6. The method of claim 1, wherein the selecting comprises selecting the preferred first pre-coding matrix for the terminal based on a codebook corresponding to the preferred rank of the terminal.

7. The method of claim 1, wherein the extracting comprises extracting the at least one preferred second pre-coding matrix based on a codebook corresponding to the preferred rank of the terminal.

8. The method of claim 1, wherein the extracting comprises extracting the at least one preferred second pre-coding matrix based on a codebook corresponding to the reference rank.

9. The method of claim 8, wherein the extracting based on the codebook corresponding to the reference rank comprises:
selecting a codeword corresponding to the preferred first pre-coding matrix from a plurality of codewords that are included in the codebook corresponding to the reference rank; and
determining the at least one preferred second pre-coding matrix based on the selected codeword.

10. The method of claim 9, wherein the determining comprises selecting, as the at least one preferred second pre-coding matrix, remaining columns excluding a column included in the preferred first pre-coding matrix from columns included in the selected codeword.

11. The method of claim 1, further comprising:
receiving a reference rank determined by the base station.

12. A terminal in a multiple-input multiple-output (MIMO) communication system including a base station and the terminal, the terminal comprising:
a first pre-coding matrix selecting unit configured to select a preferred first pre-coding matrix for the terminal, based on a preferred rank of the terminal;
a second pre-coding matrix extracting unit configured to extract at least one preferred second pre-coding matrix for at least one neighboring terminal corresponding to the preferred first pre-coding matrix, based on a reference rank and the preferred rank of the terminal;
a CQI generating unit configured to generate at least one channel quality indicator (CQI) of the terminal based on the preferred first pre-coding matrix and the at least one preferred second pre-coding matrix; and
a transmitting unit configured to feed the at least one CQI back to the base station.

13. The terminal of claim 12, wherein the second pre-coding matrix extracting unit is further configured to calculate a rank for the at least one neighboring terminal based on the reference rank and the preferred rank of the terminal, and extract the at least one preferred second pre-coding matrix using the at least one neighboring terminal.

14. The terminal of claim 12, further comprising:
a memory configured to store a predetermined table comprising respective pairs of first pre-coding matrix candidates and second matrix pre-coding matrix candidates,
wherein the second pre-coding matrix extracting unit is further configured to extract the at least one preferred second pre-coding matrix based on the table.

15. The terminal of claim 12, wherein the CQI generating unit is further configured to generate the at least one CQI based on interference due to the at least one preferred second pre-coding matrix.

16. The terminal of claim 12, wherein the first pre-coding matrix selecting unit is further configured to select the preferred first pre-coding matrix for the terminal based on a codebook corresponding to the preferred rank of the terminal.

17. The terminal of claim 12, wherein the second pre-coding matrix extracting unit is further configured to extract the at least one preferred second pre-coding matrix based on a codebook corresponding to the preferred rank of the terminal or a codebook corresponding to the reference rank.

18. The terminal of claim 12, further comprising:
a receiving unit configured to receive a reference rank determined by the base station.

19. A terminal in a multiple-input multiple-output (MIMO) communication system, the terminal comprising:
a receiver configured to receive a reference rank from a base station;
a controller configured to determine a preferred rank of the terminal and to determine information to feed back to the base station based on the reference rank and the preferred rank of the terminal; and
a transmitter configured to transmit the determined feedback information to the base station, wherein
in response to the preferred rank of the terminal being greater than the reference rank, the controller determines to transmit feedback information comprising a rank indicator (RI) indicating a preferred rank that is restricted to being less than or equal to the reference rank, a pre-coding matrix indicator (PMI) indicating a preferred codeword selected by the terminal, and at least one channel quality indicator (CQI) of the terminal.

20. A terminal in a multiple-input multiple-output (MIMO) communication system, the terminal comprising:
a receiver configured to receive a reference rank from a base station;
a controller configured to determine a preferred rank of the terminal and to determine information to feed back to the base station based on the reference rank and the preferred rank of the terminal; and
a transmitter configured to transmit the determined feedback information to the base station, wherein
in response to the preferred rank of the terminal being less than the reference rank, the controller determines to transmit feedback information comprising a best companion channel quality indicator (CQI) comprising information that is associated with interference of at least one neighboring terminal.

21. A terminal in a multiple-input multiple-output (MIMO) communication system, the terminal comprising:
a receiver configured to receive a reference rank from a base station;
a controller configured to determine a preferred rank of the terminal and to determine information to feed back to the base station based on the reference rank and the preferred rank of the terminal; and
a transmitter configured to transmit the determined feedback information to the base station, wherein
in response to the preferred rank of the terminal being the same as the reference rank, the controller determines not to transmit feedback information to the base station.

22. The terminal of claim 20, wherein the controller determines the best companion channel quality indicator (CQI) based on the reference rank and the preferred rank in response to the preferred rank being less than the reference rank.