Apparatus and method for estimating downlink channel in wireless communication system

Abstract

The present disclosure relates to a 5G or pre-5G communication system to be provided to support a higher data transmission rate beyond the 4G communication system, such as LTE. The present invention provides a method for estimating a downlink channel by a receiver in a wireless communication system, the method comprising: estimating the downlink channel on the basis of a reference signal to recover an information bit, and checking whether the information bit recovery has succeeded; and when the information bit recovery has not succeeded, selecting at least one of the received signals as a virtual reference signal on the basis of the accuracy of the data reconstructed at a related resource location and the correlation between the related resource location and a resource location related to the reference signal, and estimating the downlink channel on the basis of at least one virtual reference signal.

Claims

1. A method for estimating a downlink channel by a receiver in a wireless communication system, the method comprising: removing an orthogonal pattern from a reference signal among received signals; recovering information bits by estimating a downlink channel based on the reference signal from which the orthogonal pattern is removed; in response that the recovery of information bits is failed, selecting a virtual reference signal based on at least one of accuracy of data recovered at a position of a resource carrying each of the received signals, a correlation between the position of the resource carrying each of the received signals and a position of a resource carrying the reference signal, and an average error of a channel estimated at the position of the resource carrying each of the received signals; and estimating the downlink channel based on the selected virtual reference signal.

2. The method of claim 1, wherein the selecting of the virtual reference signal comprises selecting a signal having a highest accuracy of recovered data and a highest correlation from among the received signals.

3. The method of claim 2, wherein the position of the resource carrying the signal having the highest accuracy of recovered data and the highest correlation is determined by the following equation, $\stackrel{\_}{}\left(n\right)=\frac{1}{1-\frac{{.Math.{\stackrel{\_}{d}}_1^{\left(n\right)}.Math.}^2{}_1^{\left(n\right)}}{\underset{i=1}{\overset{N_i}{.Math.}}{}_f^{\left(n\right)}}}+\frac{1}{1-{.Math.C_{\tilde{h},\tilde{g}}.Math.}^2}$ where the first term on the right side of the equation represents the accuracy of recovered data, the second term represents the correlation, represents power of a transmission signal, i represents a user terminal index, d.sub.1 represents a data signal for a first user terminal, and .sub.i represents E(d.sub.i).sup.2 of an i.sup.th user terminal.

4. The method of claim 1, wherein the selection of the virtual reference signal comprises selecting a signal having a smallest average error of the estimated channel.

5. The method of claim 4, wherein a position of a resource carrying the signal having the smallest average error of the estimated channel is determined by the following equation, $\begin{array}{c}\left(n\right)=E{.Math.\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right]-\left[\begin{array}{c}\sqrt{}{\hat{h}}_1\\ \sqrt{}{\hat{g}}_1\end{array}\right].Math.}^2\\ =\mathrm{tr}(\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right]\right)-\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right)\\ {\mathrm{Cov}\left(\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right)}^{-1}\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right))\end{array}$ where represents power of a transmission signal, h.sub.1 represents a channel for a first user terminal, and g.sub.1 represents a channel at a resource position related to a virtual reference signal for the first user terminal.

6. The method of claim 1, wherein the reference signal {tilde over (y)}.sub.t.sup.(1) free of the orthogonal pattern is represented as the following equation, ${\tilde{y}}_1^{\left(1\right)}=\frac{1}{2}\begin{array}{cc}[p_1^{*}& p_2^{*}]\left[\begin{array}{c}{y}_1^{\left(1\right)}\\ y_1^{\left(2\right)}\end{array}\right]=\end{array}\sqrt{}{h}_1^{\left(1\right)}{w}_1+\frac{1}{2}{p}_1^{*}{n}_1^{\left(1\right)}+\frac{1}{2}{p}_2^{*}{n}_1^{\left(2\right)}$ where p.sub.1 represents a reference signal allocated to a first resource, p.sub.2 represents a reference signal allocated to a second resource, y.sub.1 represents a received signal of a first user terminal, represents power of a transmission signal, h.sub.1 represents a channel for the first user terminal, w.sub.1 represents a precoding vector for the first user terminal, and n.sub.1 represents Gaussian noise for the first user terminal.

7. The method of claim 1, further comprising removing an interference signal and a data signal of another user terminal from the virtual reference signal, wherein the virtual reference signal {tilde over (z)} free of the interference signal and the data signal of the another user terminal is represented as the following equation, $\begin{array}{c}\stackrel{\stackrel{\_}{~}}{z}={\stackrel{\_}{D}}_1^H\left(z-\sqrt{}\underset{j=2}{\overset{N_t-1}{.Math.}}{\stackrel{\_}{D}}_j{\hat{g}}_j\right)\\ =\sqrt{}{\stackrel{\_}{D}}_1^H{D}_1{\tilde{g}}_1+\sqrt{}{\stackrel{\_}{D}}_1^H\underset{j=2}{\overset{N_t-1}{.Math.}}(D_j\left({\tilde{g}}_j-{\hat{g}}_j\right)+\left(D_j-{\stackrel{\_}{D}}_j{\hat{g}}_j\right)+v_1\end{array}$ where represents power of a transmission signal, j represents a user terminal index, D.sub.j represents a signal for another user terminal, for example, a j.sup.th user terminal, detected by a multi-user detector, g represents a valid channel g.sub.1w.sub.1, .sub.j represents a channel value for another user terminal, for example, the j.sup.th user terminal, obtained during previous channel estimation, and v.sub.1 represents a noise signal at a position related to the virtual reference signal.

8. An apparatus for estimating a downlink channel in a wireless communication system, the apparatus comprising: a receiver configured to receive signals; and a processor coupled with the receiver and configured to: remove an orthogonal pattern from a reference signal among the received signals, recover information bits by estimating a downlink channel based on the reference signal from which the orthogonal pattern is removed, in response that the recovery of information bits is failed, select a virtual reference signal based on at least one of accuracy of data recovered at a position of a resource carrying each of the received signals, a correlation between the position of the resource carrying each of the received signals and a position of a resource carrying the reference signal, and an average error of a channel estimated at the position of the resource carrying each of the received signals, and estimate the downlink channel based on the selected virtual reference signal.

9. The apparatus of claim 8, wherein the processor is further configured to select a signal having a highest accuracy of recovered data and a highest correlation from among the received signals.

10. The apparatus of claim 9, wherein a position of a resource carrying the signal having the highest accuracy of recovered data and the highest correlation is determined by the following equation, $\stackrel{\_}{}\left(n\right)=\frac{1}{1-\frac{{.Math.{\stackrel{\_}{d}}_1^{\left(n\right)}.Math.}^2{}_1^{\left(n\right)}}{\underset{i=1}{\overset{N_t}{.Math.}}{}_i^{\left(n\right)}}}+\frac{1}{1-{.Math.C_{\tilde{h},\tilde{g}}.Math.}^2}$ where the first term on the right side of the equation represents the accuracy of recovered data, the second term represents the correlation, represents power of a transmission signal, i represents a user terminal index, d.sub.1 represents a data signal for a first user terminal, and .sub.i represents E(d.sub.i).sup.2 of an i.sup.th user terminal.

11. The apparatus of claim 8, wherein the processor is further configured to select a signal having a smallest average error of the estimated channel.

12. The apparatus of claim 11, wherein a position of a resource carrying the signal having the smallest average error of the estimated channel is determined by the following equation, $\begin{array}{c}\left(n\right)=E{.Math.\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right]-\left[\begin{array}{c}\sqrt{}{\hat{h}}_1\\ \sqrt{}{\hat{g}}_1\end{array}\right].Math.}^2\\ =\mathrm{tr}(\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right]\right)-\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right)\\ {\mathrm{Cov}\left(\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right)}^{-1}\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right))\end{array}$ where represents power of a transmission signal, h.sub.1 represents a channel for a first user terminal, and g.sub.1 represents a channel at a resource position related to a virtual reference signal for the first user terminal.

13. The apparatus of claim 8, wherein the reference signal {tilde over (y)}.sub.1.sup.(1) free of the orthogonal pattern is represented as the following equation, ${\tilde{y}}_1^{\left(1\right)}=\frac{1}{2}\begin{array}{cc}[p_1^{*}& p_2^{*}]\left[\begin{array}{c}{y}_1^{\left(1\right)}\\ y_1^{\left(2\right)}\end{array}\right]=\end{array}\sqrt{}{h}_1^{\left(1\right)}{w}_1+\frac{1}{2}{p}_1^{*}{n}_1^{\left(1\right)}+\frac{1}{2}{p}_2^{*}{n}_1^{\left(2\right)}$ where p.sub.1 represents a reference signal allocated to a first resource, p.sub.2 represents a reference signal allocated to a second resource, y.sub.1 represents a received signal of a first user terminal, represents power of a transmission signal, h.sub.1 represents a channel for the first user terminal, w.sub.1 represents a precoding vector for the first user terminal, and n.sub.1 represents Gaussian noise for the first user terminal.

14. The apparatus of claim 8, wherein the processor is further configured to remove an interference signal and a data signal of another user terminal from the virtual reference signal, and the virtual reference signal {tilde over (z)} free of the interference signal and the data signal of the another user terminal is represented as the following equation, $\begin{array}{c}\stackrel{\stackrel{\_}{~}}{z}={\stackrel{\_}{D}}_1^H\left(z-\sqrt{}\underset{j=2}{\overset{N_t-1}{.Math.}}{\stackrel{\_}{D}}_j{\hat{g}}_j\right)\\ =\sqrt{}{\stackrel{\_}{D}}_1^H{D}_1{\tilde{g}}_1+\sqrt{}{\stackrel{\_}{D}}_1^H\underset{j=2}{\overset{N_t-1}{.Math.}}(D_j\left({\tilde{g}}_j-{\hat{g}}_j\right)+\left(D_j-{\stackrel{\_}{D}}_j{\hat{g}}_j\right)+v_1\end{array}$ where represents power of a transmission signal, j represents a user terminal index, D.sub.j represents a signal for another user terminal, for example, a j.sup.th user terminal, detected by a multi-user detector, {tilde over (g)}.sub.j represents a valid channel g.sub.1w.sub.1, .sub.j represents a channel value for another user terminal, for example, the j.sup.th user terminal, obtained during previous channel estimation, and v.sub.1 represents a noise signal at a position related to the virtual reference signal.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this application, illustrate embodiments of the disclosure and together with the description serve to explain the principle of the disclosure. In the drawings:

(2) FIG. 1 is a block diagram of a receiver for estimating a downlink (DL) channel in a general multi-user multiple input multiple output (MU-MIMO) system;

(3) FIG. 2 is a view illustrating exemplary DL channel estimation in the general MU-MIMO system;

(4) FIG. 3 is a view illustrating the positions of reference signals (RSs) and the positions of data signals in resource blocks in the general MU-MIMO system;

(5) FIG. 4 is a block diagram of a receiver for estimating a DL channel in an MU-MIMO system according to an embodiment of the present disclosure;

(6) FIG. 5 is a block diagram of a channel estimator for estimating a DL channel in the MU-MIMO system according to an embodiment of the present disclosure;

(7) FIG. 6 is a view illustrating the positions of RSs and the positions of virtual RSs in a resource block in the MU-MIMO system according to an embodiment of the present disclosure;

(8) FIG. 7 is a flowchart illustrating an operation of a receiver for estimating a DL channel in the MU-MIMO system according to an embodiment of the present disclosure;

(9) FIG. 8 is a graph illustrating the performance of a receiver using a single-user detection scheme and the performance of a receiver using a multi-user detection scheme in the MU-MIMO system according to an embodiment of the present disclosure; and

(10) FIG. 9 is another graph illustrating the performance of a receiver using a single-user detection scheme and the performance of a receiver using a multi-user detection scheme in an MU-MIMO system according to an embodiment of the present disclosure.

(11) It is to be noted that similar reference numerals are used to denote the same or similar elements, features, and structures throughout the drawings.

BEST MODE FOR CARRYING OUT THE INVENTION

(12) Embodiments of the present disclosure will be described in detail with reference to the attached drawings. Only a part required to understand operations according to the embodiments of the present disclosure will be described below, and a description of the other parts will be avoided lest it should obscure the subject matter of the present disclosure. Although terms as described below are defined in consideration of functions in the present disclosure, the terms may be changed according to the intention of a user or an operator, or customs. Therefore, the present disclosure should be understood, not simply by the actual terms used but by the meanings of each term lying within.

(13) The present disclosure may be subjected to various modifications and have various embodiments. Specific embodiments of the present disclosure are described with reference to the accompanying drawings. However, the embodiments are not intended to limit the present disclosure, and it is to be understood that the present disclosure covers various modifications, equivalents, and/or alternatives to the embodiments.

(14) Unless otherwise specified in the context, singular expressions such as a and the may include plural referents. For example, a component surface covers one or more component expressions.

(15) Ordinal terms such as first or second may be used to describe, not limiting, various components. These expressions are used to distinguish one component from another component. For example, a first component may be referred to as a second component, and vice versa without departing from the scope of the present disclosure. The term and/or includes one or a combination of two or more of a plurality of enumerated items.

(16) The terms as used in the present disclosure are provided to describe merely specific embodiments, not intended to limit the scope of other embodiments. It is to be understood that singular forms include plural referents unless the context clearly dictates otherwise. In the present disclosure, the term include or have signifies the presence of a specific feature, number, step, operation, component, part, or a combination thereof, not excluding the presence of one or more other features, numbers, steps, operations, components, parts, or a combination thereof.

(17) Unless otherwise defined, the terms and words including technical or scientific terms used in the following description and claims may have the same meanings as generally understood by those skilled in the art. The terms as generally defined in dictionaries may be interpreted as having the same or similar meanings as or to contextual meanings of related technology. Unless otherwise defined, the terms should not be interpreted as ideally or excessively formal meanings.

(18) FIG. 1 is a block diagram of a receiver for estimating a downlink (DL) channel in a multi-user multiple input multiple output (MU-MIMO) system.

(19) Referring to FIG. 1, the receiver includes a fast Fourier transform (FFT) processor 102, a resource demapper 104, a log likelihood ratio (LLR) generator 106, a decoder 108, and a channel estimator 110.

(20) In the MU-MIMO system, a transmitter has N.sub.t antennas, whereas a receiver has a single antenna. The FFT processor 102 receives a signal through a single antenna, and outputs an FFT signal to the resource demapper 104 and the channel estimator 110.

(21) The resource demapper 104 detects a received signal y mapped to a related resource region in the input received signal, and provides the detected received signal y to the LLR generator 106. While not shown, the resource demapper 104 may include a physical resource demapper and a logical resource demapper. The physical resource demapper detects a received signal mapped to a physical resource region in the input received signal, and the logical resource demapper detects a received signal mapped to a logical resource region in the input received signal.

(22) The LLR generator 106 calculates LLR values L.sub.e of symbols to be recovered from the detected received signal y, and provides the calculated LLR values L.sub.e to the decoder 108. The decoder 108 recovers information bits by performing channel decoding at a coding rate used in an encoder of a transmitter based on the calculated LLR values L.sub.e. Further, a signal output from the decoder 108 is provided to the LLR generator 106, as prior probability information L.sub.a for iterative decoding.

(23) Meanwhile, the channel estimator 110 estimates a DL channel based on the input received signal, and provides an estimated channel value to the LLR generator 106.

(24) In the MU-MIMO system, a signal y.sub.i received at a specific i.sup.th user may be expressed as [Equation 1].

(25) $\begin{array}{cc}{y}_i=\sqrt{}{h}_i{w}_i{s}_i+\sqrt{}{h}_i\underset{j=0,ji}{\overset{N_t-1}{.Math.}}{w}_j{s}_j+n_i& \left[\mathrm{Equation}1\right]\end{array}$

(26) In [Equation 1], represents the power of a transmission signal, h.sub.i represents a channel for the i.sup.th user, w.sub.i represents a precoding vector for the i.sup.th user, s.sub.i represents a symbol for the i.sup.th user, w.sub.j represents a precoding vector for a j.sup.th user, s.sub.j represents a symbol for the j.sup.th user, and n.sub.i represents Gaussian noise for the i.sup.th user.

(27) On the assumption of beams formed based on accurate channel information, the product between the channel h.sub.i of the i.sup.th user and the precoding vector of the j user is 0, that is, h.sub.iw.sub.j=0. Thus, the i.sup.th user receives a signal from which interference from the j.sup.th user has been canceled and in which only Gaussian noise remains. For this perfect interference cancellation, the transmitter should have knowledge of accurate channel information of all users.

(28) However, since an estimation error generated during channel estimation at the receiver and quantization-incurred information loss during feedback of channel information to the transmitter are inevitable, it is not easy for the transmitter to have knowledge of accurate channel information of all users, making it difficult to perfectly cancel interference signals from other users in a received signal.

(29) FIG. 2 illustrates an example of estimating a DL channel in the general MU-MIMO system.

(30) FIG. 2 is based on the assumption that two users are allocated to two resource elements and receive reference signals (RSs) in the allocated elements. In this case, a signal received by a first user may be expressed as [Equation 2]. y.sub.1.sup.(1) represents a signal received in a resource element 202, and y.sub.1.sup.(2) represents a signal received in a resource element 204.
y.sub.1.sup.(1)={square root over ()}h.sub.1.sup.(1)w.sub.1p.sub.1+{square root over ()}h.sub.1.sup.(1)w.sub.2p.sub.1+n.sub.1.sup.(1)
y.sub.1.sup.(2)={square root over ()}h.sub.1.sup.(2)w.sub.1p.sub.2{square root over ()}h.sub.1.sup.(2)w.sub.2p.sub.2+n.sub.1.sup.(2)[Equation 2]

(31) In [Equation 2], represents the power of a transmission signal, h.sub.1 represents a channel for the first user, w.sub.1 represents a precoding vector for the first user, p.sub.1 represents an RS allocated to a first resource element, w.sub.2 represents a precoding vector for a second user, p.sub.2 represents an RS allocated to a second resource element, and n.sub.1 represents Gaussian noise for the first user. As noted from [Equation 2], RSs transmitted to two users are the same signal transmitted with different codes.

(32) Channel estimation based on the signal received by the first user may be expressed as [Equation 3]. p.sub.2*y.sub.1.sup.(1) represents channel estimation based on the signal received in the resource element 202, and p.sub.2*y.sub.1.sup.(2) represents channel estimation based on the signal received in the resource element 204.
p.sub.1*y.sub.1.sup.(1)={square root over ()}h.sub.1.sup.(1)w.sub.1+{square root over ()}h.sub.1.sup.(1)w.sub.2+p.sub.1*n.sub.1.sup.(1)
p.sub.2*y.sub.1.sup.(2)={square root over ()}h.sub.1.sup.(2)w.sub.1{square root over ()}h.sub.1.sup.(2)w.sub.2+p.sub.2*n.sub.1.sup.(2)[Equation 3]

(33) In [Equation 3], represents the power of the transmission signal, h.sub.1 represents the channel for the first user, w.sub.1 represents the precoding vector for the first user, p.sub.1 represents the RS allocated to the first resource element, w.sub.2 represents the precoding vector for the second user, p.sub.2 represents the RS allocated to the second resource element, and n.sub.1 represents Gaussian noise for the first user.

(34) If it is assumed that the channel of the first user is not changed at the positions of the RSs, the RSs of the first user may be represented as [Equation 4].

(35) $\begin{array}{cc}\sqrt{}{h}_1{w}_1\frac{1}{2}\left(p_1^{*}{y}_1^{\left(1\right)}+p_2^{*}{y}_1^{\left(2\right)}\right)& \left[\mathrm{Equation}4\right]\end{array}$

(36) In [Equation 4], represents the power of the transmission signal, h.sub.1 represents the channel for the first user, w.sub.1 represents the precoding vector for the first user, p.sub.1 represents the RS allocated to the first resource element, p.sub.2 represents the RS allocated to the second resource element, and y.sub.1 represents the received signal of the first user.

(37) FIG. 3 is a view illustrating the positions of RSs and the positions of data signals in resource blocks in the general MU-MIMO system.

(38) Referring to FIG. 3, two resource blocks are shown, and it is assumed that each of the resource blocks includes a plurality of resource elements.

(39) Each resource block includes 7 orthogonal frequency division multiplexing (OFDM) symbols along the horizontal axis by 12 subcarriers along the vertical axis, and each resource element carries one of a cell-specific RS 302, a first demodulation RS 304, a second demodulation RS 305, a control signal 306, and a data signal 308. FIG. 3 is based on the assumption that four antennas are grouped into two groups each including two antennas. Therefore, the first demodulation RS 304 means a first demodulation RS group, and the second demodulation RS 305 means a second demodulation RS group.

(40) A DL channel is estimated based on the first and second demodulation RSs 304 and 305, and channel estimation based on the first demodulation RS 304 will be described below as an example.

(41) A receiver estimates a channel based on the first demodulation RS 304 received at a first position 310, and estimates channel information at second, third, and fourth positions 312, 314, and 316 using the channel information estimated at the first position 310. That is, the receiver estimates the channel information at the second and third positions 312 and 314 by applying interpolation or linear interpolation to the channel information estimated at the first position 310 along the frequency axis, and estimates the channel information at the fourth position 316 by applying interpolation or linear interpolation to the channel information estimated at the first position 310 along the time axis.

(42) Further, the receiver estimates channel information at a fifth position 318 by applying interpolation or linear interpolation to the estimated channel information at the second position 312 along the time axis. In another method, the receiver estimates the channel information at the fifth position 318 by applying interpolation or linear interpolation to the estimated channel information at the fourth position 316 along the frequency axis.

(43) Further, the receiver estimates channel information at a sixth position 320 by applying interpolation or linear interpolation to the estimated channel information at the third position 314 along the time axis. In another method, the receiver estimates the channel information at the sixth position 320 by applying interpolation or linear interpolation to the estimated channel information at the fourth position 316 along the frequency axis.

(44) While not described with reference to FIG. 3, channel estimation based on the second demodulation RS 305 may also be performed in the same manner as channel estimation based on the first demodulation RS 304. That is, a channel may be estimated based on the second demodulation RS 305 received at a specific position, and channel information for the second demodulation RS 305 at a different position may be estimated using the channel information estimated at the measurement position.

(45) Meanwhile, the receiver calculates the LLR values of a data signal based on the estimated channel information, and recovers information bits by performing channel decoding through a decoder. If the receiver fails in recovering the information bits, the receiver re-estimates a channel using an output value of the decoder. Herein, the channel re-estimation may be repeated until the information bits are successfully recovered, or a decoding repetition number may be predetermined and the channel estimation may be repeated as many times as the predetermined decoding repetition number.

(46) FIG. 4 is a block diagram of a receiver for estimating a DL channel in an MU-MIMO system according to an embodiment of the present disclosure.

(47) Referring to FIG. 4, the receiver includes an FFT processor 402, a resource demapper 404, an LLR generator 406, a decoder 408, and a channel estimator 410.

(48) In the MU-MIMO system, a transmitter has N.sub.t antennas, whereas a receiver has a single antenna. The FFT processor 402 receives a signal through a single antenna, and outputs an FFT signal to the resource demapper 404 and the channel estimator 410.

(49) The resource demapper 404 detects a received signal y mapped to a related resource region in the input received signal, and provides the detected received signal y to the LLR generator 406. Herein, it is assumed that the received signal mapped to the related resource region is an RS. While not shown, the resource demapper 404 may include a physical resource demapper and a logical resource demapper. The physical resource demapper detects a received signal mapped to a physical resource region in the input received signal, and the logical resource demapper detects a received signal mapped to a logical resource region in the input received signal.

(50) The LLR generator 406 calculates LLR values L.sub.e of symbols to be recovered from the detected received signal y, and provides the calculated LLR values L.sub.e to the decoder 408. The LLR values L.sub.e provided to the decoder 408 are calculated by [Equation 5].

(51) $\begin{array}{cc}L=\ln \frac{\mathrm{Pr}\left(b_1^{\left(i+\right)}|y_1^{\left(i\right)}\right)}{\mathrm{Pr}\left(b_1^{\left(i-\right)}|y_1^{\left(i\right)}\right)}=\underset{\underset{L_a}{}}{\ln \frac{\mathrm{Pr}\left(b_1^{\left(i+1\right)}\right)}{\mathrm{Pr}\left(b_1^{\left(i-\right)}\right)}}+\underset{\underset{L_e}{}}{\ln \frac{\underset{b_1^{\left(i+\right)}}{.Math.}\mathrm{Pr}\left(y_1^{\left(i\right)}|d_1^{\left(i+\right)}\right)\mathrm{Pr}\left(b_1^{\left(i\right)}\right)}{\underset{b_1^{\left(i-\right)}}{.Math.}\mathrm{Pr}\left(y_1^{\left(i\right)}|d_1^{\left(i-1\right)}\right)\mathrm{Pr}\left(b_1^{\left(i\right)}\right)}}& \left[\mathrm{Equation}5\right]\end{array}$

(52) In [Equation 5], L.sub.a represents an LLR value generated by the decoder in a previous channel estimation operation, b.sub.1.sup.(i+) represents a case in which the logical value of an i.sup.th information bit among information bits for a first user is 1, b.sub.1.sup.(i) represents a case in which the logical value of the i.sup.th information bit among the information bits for the first user is 0, d.sub.1.sup.(i+) represents a data signal in the case of b.sub.1.sup.(i+), d.sub.1.sup.(i) represents a data signal in the case of b.sub.1.sup.(i), and b.sub.1.sup.(i) represents the remaining information bits except for the i.sup.th information bit.

(53) The decoder 408 recovers information bits by performing channel decoding in a decoding scheme corresponding to an encoding scheme used in an encoder of a transmitter based on the calculated LLR values L.sub.e. Further, the decoder 408 provides the LLR values L.sub.a generated during channel estimation to the channel estimator 410.

(54) Meanwhile, the channel estimator 410 estimates a DL channel based on the input received signal and provides an estimated channel value to the LLR generator 406. Herein, the channel estimator selects and generates a virtual RS using the output of the decoder 408, and then performs channel re-estimation based on the virtual RS, thereby achieving more accurate channel information.

(55) In addition, the LLR generator 406 also estimates a data signal channel received from another user and calculates the LLR value of the data signal in order to process an interference signal received from the user. Herein, the interference signal may be, for example, an interference stream, and the data signal may be, for example, a desired stream. However, since it is very difficult to decode the data signal of another user, a virtual RS for the user used during channel re-estimation is generated from the calculated LLR value.

(56) With reference to FIG. 5, the operation of the channel estimator 410 illustrated in FIG. 4 will be described in detail.

(57) FIG. 5 is a block diagram of a channel estimator for estimating a DL channel in the MU-MIMO system according to an embodiment of the present disclosure.

(58) Referring to FIG. 5, the channel estimator includes a soft symbol generation unit 502, a resource mapping unit 504, a virtual pilot signal (VPS) selection unit 506, and a channel estimation unit 508.

(59) An LLR value, L.sub.a generated from the decoder is input to the soft symbol generation unit 502, and the soft symbol generation unit 502 generates a soft symbol based on the LLR value L.sub.a by [Equation 6].

(60) $\begin{array}{cc}{\stackrel{\_}{d}}_1^{\left(i\right)}=E\left[d_1^{\left(i\right)}\right]=\underset{}{.Math.}\underset{m=1}{\overset{Q}{.Math.}}\mathrm{Pr}\left(b_1^{\left(i,m\right)}\right)=\underset{}{.Math.}\underset{m=1}{\overset{Q}{.Math.}}\frac{1}{2}\left(1+b_1^{\left(i,m\right)}\tanh \left(\frac{1}{2}{L}_a\left(b_1^{\left(i,m\right)}\right)\right)\right)& \left[\mathrm{Equation}6\right]\end{array}$

(61) In [Equation 6], represents one of symbols in a symbol set , and Q represents the number of information bits in one symbol.

(62) If quadrature phase shift keying (QPSK) is used as a modulation scheme, [Equation 7] may be calculated at a second moment.

(63) $\begin{array}{cc}{}_1^{\left(i\right)}=E\left[{.Math.d_1^{\left(i\right)}.Math.}^2\right]=\underset{}{.Math.}{.Math..Math.}^2\underset{m=1}{\overset{Q}{.Math.}}\mathrm{Pr}\left(b_1^{\left(i,m\right)}\right)=\underset{}{.Math.}{.Math..Math.}^2\underset{m=1}{\overset{Q}{.Math.}}\frac{1}{2}\left(1+b_1^{\left(i,m\right)}\tanh \left(\frac{1}{2}{L}_a\left(b_1^{\left(i,m\right)}\right)\right)\right)& \left[\mathrm{Equation}7\right]\end{array}$

(64) In [Equation 7], represents one of symbols in the symbol set , and Q represents the number of information bits in one symbol.

(65) The resource mapping unit 504 receives the received signal y and soft symbols output from the soft symbol generation unit 502, re-orders the values of the received soft symbols, and provides the re-ordered values of the soft symbols to the VPS selection unit 506. The VPS selection unit 506 selects a virtual RS in consideration of the accuracy of data recovered at resource positions at which DL signals are received respectively, and the correlations between the resource positions and the position of a resource carrying an RS. That is, the VPS selection unit 506 selects, as a virtual RS, a signal which has a high accuracy of recovered data and has been received at a resource position having a highest correlation, and provides the selected virtual RS to the channel estimation unit 508. The accuracy of recovered data and the correlations may be calculated by later-described [Equation 18].

(66) The channel estimation unit 508 performs channel re-estimation based on the virtual RS received from the VPS selection unit 506.

(67) FIG. 6 is a view illustrating the positions of RSs and the positions of virtual RSs in a resource block in the MU-MIMO system according to an embodiment of the present disclosure.

(68) Referring to FIG. 6, it is assumed that the MU-MIMO system includes an evolved Node B (eNB) having four antennas and four users, and the four antennas are grouped into two groups each including two antennas. It is also assumed that the four users are allocated to four resources and receive RSs in the allocated resources.

(69) In this case, a received signal y.sub.1 of a first user may be vectorized as [Equation 8].

(70) $\begin{array}{cc}\left[\begin{array}{c}{y}_1^{\left(1\right)}\\ y_1^{\left(2\right)}\\ y_1^{\left(3\right)}\\ y_1^{\left(4\right)}\\ y_1^{\left(5\right)}\\ y_1^{\left(6\right)}\end{array}\right]\left[\begin{array}{cccccccccccc}{p}_1& p_1& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0\\ p_2& -p_2& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& p_3& p_3& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& p_4& -p_4& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& d_1^{\left(5\right)}& d_2^{\left(5\right)}& d_3^{\left(5\right)}& d_4^{\left(5\right)}& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0& d_1^{\left(6\right)}& d_2^{\left(6\right)}& d_3^{\left(6\right)}& d_4^{\left(6\right)}\end{array}\right]\left[\begin{array}{c}\sqrt{}{h}_1^{\left(1\right)}{w}_1\\ \sqrt{}{h}_1^{\left(1\right)}{w}_2\\ \sqrt{}{h}_1^{\left(3\right)}{w}_3\\ \sqrt{}{h}_1^{\left(3\right)}{w}_4\\ \sqrt{}{h}_1^{\left(5\right)}{w}_1\\ \sqrt{}{h}_1^{\left(5\right)}{w}_2\\ \sqrt{}{h}_1^{\left(5\right)}{w}_3\\ \sqrt{}{h}_1^{\left(5\right)}{w}_4\\ \sqrt{}{h}_1^{\left(6\right)}{w}_1\\ \sqrt{}{h}_1^{\left(6\right)}{w}_2\\ \sqrt{}{h}_1^{\left(6\right)}{w}_3\\ \sqrt{}{h}_1^{\left(6\right)}{w}_4\end{array}\right]+\left[\begin{array}{c}{n}_1^{\left(1\right)}\\ n_1^{\left(2\right)}\\ n_1^{\left(3\right)}\\ n_1^{\left(4\right)}\\ n_1^{\left(5\right)}\\ n_1^{\left(6\right)}\end{array}\right]& \left[\mathrm{Equation}8\right]\end{array}$

(71) In [Equation 8], p.sub.1 represents an RS allocated to a first resource, p.sub.2 represents an RS allocated to a second resource, p.sub.3 represents an RS allocated to a third resource, p.sub.4 represents an RS allocated to a fourth resource, d.sub.1 represents a data signal for a first user, d.sub.2 represents a data signal for a second user, d.sub.3 represents a data signal for a third user, d.sub.4 represents a data signal for a fourth user, w.sub.1 represents a precoding vector for the first user, w.sub.2 represents a precoding vector for the second user, w.sub.3 represents a precoding vector for the third user, w.sub.4 represents a precoding vector for the fourth user, n.sub.1 represents Gaussian noise for the first user, n.sub.2 represents Gaussian noise for the second user, n.sub.3 represents Gaussian noise for the third user, and n.sub.4 represents Gaussian noise for the fourth user.

(72) Channel estimation based on the received signal of the first user may be given as [Equation 9]. p.sub.1*y.sub.1.sup.(1) represents channel estimation based on a signal received in the resource element 202 illustrated in FIG. 2, and p.sub.2*y.sub.1.sup.(2) represents channel estimation based on a signal received in the resource element 204 illustrated in FIG. 2.

(73) $\begin{array}{cc}y=P\tilde{h}+n\begin{array}{c}\hat{h}=\mathrm{Cov}\left(\tilde{h},y\right){\mathrm{Cov}\left(y,y\right)}^{-1}y\\ =\left(C_{\tilde{h},\tilde{h}}{P}^H\right){\left({\mathrm{PC}}_{\tilde{h},\tilde{h}}{P}^H+{\mathrm{PP}}^H\right)}^{-1}y\end{array}& \left[\mathrm{Equation}9\right]\end{array}$

(74) In [Equation 9], y represents a signal output from the resource demapper 404 of FIG. 4, represents a signal output from the channel estimator 410 of FIG. 4, and C.sub.{tilde over (h)},{tilde over (h)}=Cov({tilde over (h)},{tilde over (h)}).

(75) In spite of the advantage of channel estimation of a plurality of users at one time, the channel estimation according to an embodiment of the present disclosure may be difficult to implement because an increase in the number of virtual RSs leads to an exponential increase in the computation complexity of an inverse matrix for channel estimation.

(76) Therefore, to reduce the computation complexity, a method for estimating a channel after preliminarily removing an orthogonal pattern from RSs is used according to an embodiment of the present disclosure. If two users perform channel estimation using an RS group including two RSs in two resource elements, a received signal {tilde over (y)}.sub.1.sup.(1) free of an orthogonal pattern may be represented as [Equation 10].

(77) $\begin{array}{cc}{\tilde{y}}_1^{\left(1\right)}=\frac{1}{2}\begin{array}{cc}[p_1^{*}& p_2^{*}]\left[\begin{array}{c}{y}_1^{\left(1\right)}\\ y_1^{\left(2\right)}\end{array}\right]\end{array}=\sqrt{}{h}_1^{\left(1\right)}{w}_1+\frac{1}{2}{p}_1^{*}{n}_1^{\left(1\right)}+\frac{1}{2}{p}_2^{*}{n}_1^{\left(2\right)}& \left[\mathrm{Equation}10\right]\end{array}$

(78) In [Equation 10], p.sub.1 represents an RS allocated to the first resource, p.sub.2 represents an RS allocated to the second resource, y.sub.1 represents a received signal of the first user, represents the power of a transmission signal, h.sub.1 represents a channel for the first user, w.sub.1 represents a precoding vector for the first user, and n.sub.1 represents Gaussian noise for the first user.

(79) After a plurality of RSs included in an RS group are vectorized, the channel estimation of a received signal described as [Equation 10] may be given as [Equation 11].

(80) $\begin{array}{cc}\begin{array}{c}\left[\begin{array}{c}{\hat{h}}_1^{\left(1\right)}\\ {\hat{h}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]=\mathrm{Cov}\left(\left[\begin{array}{c}{\tilde{h}}_1^{\left(1\right)}\\ {\tilde{h}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1^{\left(1\right)}\\ {\tilde{y}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]\right)\\ {\mathrm{Cov}\left(\left[\begin{array}{c}{\tilde{y}}_1^{\left(1\right)}\\ {\tilde{y}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1^{\left(1\right)}\\ {\tilde{y}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]\right)}^{-1}\left[\begin{array}{c}{\tilde{y}}_1^{\left(1\right)}\\ {\tilde{y}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]\\ =E\left({\left[\begin{array}{c}{\tilde{h}}_1^{\left(1\right)}\\ {\tilde{h}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]\left[\begin{array}{c}{\tilde{y}}_1^{\left(1\right)}\\ {\tilde{y}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]}^H\right){E\left({\left[\begin{array}{c}{\tilde{y}}_1^{\left(1\right)}\\ {\tilde{y}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]\left[\begin{array}{c}{\tilde{y}}_1^{\left(1\right)}\\ {\tilde{y}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]}^H\right)}^{-1}\left[\begin{array}{c}{\tilde{y}}_1^{\left(1\right)}\\ {\tilde{y}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]\\ ={C_{\tilde{h},\tilde{h}}\left(C_{\tilde{h},\tilde{h}}+\frac{{}_n^2}{2}I\right)}^{-1}\left[\begin{array}{c}{\tilde{y}}_1^{\left(1\right)}\\ {\tilde{y}}_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]\end{array}& \left[\mathrm{Equation}11\right]\end{array}$

(81) In [Equation 11], represents the power of the transmission signal, and represents the power of a noise signal. Meanwhile, an i.sup.th virtual RS generated from a data signal may be expressed as [Equation 12].

(82) 0$\begin{array}{cc}{z}_1^{\left(i\right)}=\sqrt{}{g}_1^{\left(i\right)}{w}_1{d}_1^{\left(i\right)}+\underset{j=2}{\overset{N_t-1}{.Math.}}\sqrt{}{g}_1^{\left(i\right)}{w}_j{d}_j^{\left(i\right)}+v_1^{\left(i\right)}& \left[\mathrm{Equation}12\right]\end{array}$

(83) In [Equation 12], represents the power of the transmission signal, g.sub.1 represents a channel at a resource position related to a virtual RS for the first user, d.sub.1 represents the data signal for the first user, N.sub.t represents the number of transmission antennas, j represents a user index, W.sub.1 represents a precoding vector for the first user, and v.sub.1 represents a noise signal at a position related to a virtual RS.

(84) A virtual RS z.sub.1 in [Equation 12] may be vectorized as [Equation 13].

(85) $\begin{array}{cc}\left[\begin{array}{c}{z}_1^{\left(1\right)}\\ z_1^{\left(2\right)}\\ z_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]=\left[\begin{array}{cccc}{d}_1^{\left(1\right)}& 0& 0& \mathrm{.Math.}\\ 0& d_1^{\left(2\right)}& 0& \mathrm{.Math.}\\ 0& 0& d_1^{\left(3\right)}& \mathrm{.Math.}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \end{array}\right]\left[\begin{array}{c}\sqrt{}{g}_1^{\left(1\right)}{w}_1\\ \sqrt{}{g}_1^{\left(2\right)}{w}_1\\ \sqrt{}{g}_1^{\left(3\right)}{w}_1\\ \mathrm{.Math.}\end{array}\right]+\underset{j=2}{\overset{N_i-1}{.Math.}}\left[\begin{array}{cccc}{d}_j^{\left(1\right)}& 0& 0& \mathrm{.Math.}\\ 0& d_j^{\left(2\right)}& 0& \mathrm{.Math.}\\ 0& 0& d_j^{\left(3\right)}& \mathrm{.Math.}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \end{array}\right]\left[\begin{array}{c}\sqrt{}{g}_1^{\left(1\right)}{w}_j\\ \sqrt{}{g}_1^{\left(2\right)}{w}_j\\ \sqrt{}{g}_1^{\left(3\right)}{w}_j\\ \mathrm{.Math.}\end{array}\right]+\left[\begin{array}{c}{v}_1^{\left(1\right)}\\ v_1^{\left(2\right)}\\ v_1^{\left(3\right)}\\ \mathrm{.Math.}\end{array}\right]& \left[\mathrm{Equation}13\right]\end{array}$

(86) In [Equation 13], d.sub.1 represents the data signal for the first user, represents the power of the transmission signal, g.sub.1 represents the channel at the resource position related to the virtual RS of the first user, w.sub.1 represents the precoding vector for the first user, j represents a user index, and v.sub.1 represents the noise signal at the position related to the virtual RS.

(87) Compared to an RS from which an orthogonal pattern is removed, the virtual RS of [Equation 13] still includes interference signals and data signals of other users, and thus is subjected to purification described as [Equation 14].

(88) $\begin{array}{cc}z=\sqrt{}{D}_1{\tilde{g}}_1+\sqrt{}\underset{j=2}{\overset{N_i-1}{.Math.}}{D}_j{\tilde{g}}_j+v_j\begin{array}{c}\tilde{z}={\stackrel{\_}{D}}_1^H\left(z-\sqrt{}\underset{j=2}{\overset{N_t-1}{.Math.}}{\stackrel{\_}{D}}_j{\hat{g}}_j\right)\\ =\sqrt{}{\stackrel{\_}{D}}_1^H{D}_1{\tilde{g}}_1+\sqrt{}{\stackrel{\_}{D}}_1^H\underset{j=2}{\overset{N_t-1}{.Math.}}\\ \left(D_j\left({\tilde{g}}_j-{\hat{g}}_j\right)+\left(D_j-{\stackrel{\_}{D}}_j\right){\hat{g}}_j\right)+v_1\end{array}& \left[\mathrm{Equation}14\right]\end{array}$

(89) In [Equation 14], represents the power of the transmission signal, j represents a user index, D.sub.j represents a signal for another user, for example, a j.sup.th user, detected by a multi-user detector, {tilde over (g)}.sub.j represents a valid channel g.sub.1w.sub.1, .sub.j represents a channel value for another user, for example, the j.sup.th user, obtained during previous channel estimation, and v.sub.1 represents a noise signal at the position related to the virtual RS.

(90) Eventually, the RS and the virtual RS may be vectorized as [Equation 15].

(91) $\begin{array}{cc}\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]=\left[\begin{array}{c}\frac{1}{2}{P}^{H}y\\ {\stackrel{\_}{D}}_1^H\left(z-\sqrt{}\underset{j=2}{\overset{N_t-1}{.Math.}}{\stackrel{\_}{D}}_j{\hat{g}}_j\right)\end{array}\right]=\left[\begin{array}{c}\sqrt{}{\tilde{h}}_1\\ \sqrt{}{\stackrel{\_}{D}}_1^H{D}_1{\tilde{g}}_1\end{array}\right]+\underset{j=2}{\overset{N_t-1}{.Math.}}[\begin{array}{c}0\\ \sqrt{}{\stackrel{\_}{D}}_1^H{D}_j\left({\tilde{g}}_j-{\hat{g}}_j\right)+\sqrt{}{\stackrel{\_}{D}}_1^H\left(D_j-{\stackrel{\_}{D}}_j\right){\hat{g}}_j\end{array}]+[\begin{array}{c}\frac{1}{2}{P}^H{n}_1\\ {\stackrel{\_}{D}}_1^H{v}_1\end{array}]& \left[\mathrm{Equation}15\right]\end{array}$

(92) In [Equation 15], represents the power of the transmission signal, j represents a user index, D.sub.j represents a signal for another user, for example, a j.sup.th user, detected by the multi-user detector, {tilde over (g)}.sub.j represents the valid channel g.sub.1w.sub.1, .sub.j represents a channel value for another user, for example, the j.sup.th user, obtained during previous channel estimation, and v.sub.1 represents a noise signal at the position related to the virtual RS.

(93) Channel estimation based on the virtual RS based on the rectified received signal may be expressed as [Equation 16].

(94) $\begin{array}{cc}\begin{array}{c}\left[\begin{array}{c}\sqrt{}{\hat{h}}_1\\ \sqrt{}{\hat{g}}_1\end{array}\right]=\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right)\\ {\mathrm{Cov}\left(\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right)}^{-1}\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\\ =\left[\begin{array}{cc}{C}_{\tilde{h},\tilde{h}}& C_{\tilde{h},\tilde{g}}{}_1\\ C_{\tilde{g},\tilde{h}}& C_{\tilde{g},\tilde{g}}{}_1\end{array}\right]\\ {\left[\begin{array}{cc}{C}_{\tilde{h},\tilde{h}}+\frac{{}_n^2}{2}I& C_{\tilde{h},\tilde{g}}{}_1\\ {}_1^H{C}_{\tilde{g},\tilde{h}}& \end{array}\right]}^{-1}\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\end{array}& \left[\mathrm{Equation}16\right]\end{array}$

(95) In [Equation 16],

(96) $={}_1^2.Math.C_{\tilde{g},\tilde{g}}+\underset{j=2}{\overset{N_t-1}{.Math.}}{}_1.Math.{}_j.Math.C_{e,e}+\underset{j=2}{\overset{N_t-1}{.Math.}}{}_1.Math.\left({}_f-{\stackrel{\_}{d}}_j{\stackrel{\_}{d}}_j^H\right).Math.C_{\tilde{g},\tilde{g}}+\frac{{}_v^2}{}{}_1,$
.sub.1=diag(E(d.sub.1.sup.(1)).sup.2, E(d.sub.1.sup.(2)).sup.2, E(d.sub.1.sup.(3)).sup.2, . . . ), C.sub.e,e=Cov(({tilde over (g)}.sub.j.sub.j),({tilde over (g)}.sub.j.sub.j)), and d.sub.j=[E[d.sub.j.sup.(1)].sup.T, E[d.sub.j.sup.(2)].sup.T, E[d.sub.j.sup.(3)].sup.T, . . . ].sup.T.

(97) In order to achieve performance improvement with a virtual RS, although the accuracy of data recovered based on the virtual RS is important, the virtual RS should be closely correlated with an original RS. Further, due to the existence of interference from other users, the virtual RS should be a signal at a resource position at which the interference from other users is canceled relatively well. Accordingly, a virtual RS should be selected based on a signal having a smallest average error on a channel estimated as follows, in order to maximize the effect of channel estimation using the virtual RS.

(98) A resource position having the smallest error value on the estimated channel may be determined by [Equation 17].

(99) $\begin{array}{cc}\begin{array}{c}\left(n\right)=E{.Math.\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right]-\left[\begin{array}{c}\sqrt{}{\hat{h}}_1\\ \sqrt{}{\hat{g}}_1\end{array}\right].Math.}^2\\ =\mathrm{tr}(\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right]\right)-\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right)\\ {\mathrm{Cov}\left(\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right)}^{-1}\mathrm{Cov}\left(\left[\begin{array}{c}\sqrt{}{h}_1\\ \sqrt{}{g}_1\end{array}\right],\left[\begin{array}{c}{\tilde{y}}_1\\ {\tilde{z}}_1\end{array}\right]\right))\end{array}& \left[\mathrm{Equation}17\right]\end{array}$

(100) In [Equation 17], represents the power of the transmission signal, h.sub.1 represents the channel for the first user, and g.sub.1 represents the channel at the position related to the virtual RS for the first user.

(101) After a series of computations, it may be noted that the resource position having the smallest error value, described as [Equation 17] is identical to a resource position having a large value calculated by [Equation 18].

(102) $\begin{array}{cc}\stackrel{\_}{}\left(n\right)=\frac{1}{1-\frac{{.Math.{\stackrel{\_}{d}}_1^{\left(n\right)}.Math.}^2{}_1^{\left(n\right)}}{\underset{i=1}{\overset{N_i}{.Math.}}{}_f^{\left(n\right)}}}+\frac{1}{1-{.Math.C_{\tilde{h},\tilde{g}}.Math.}^2}& \left[\mathrm{Equation}18\right]\end{array}$

(103) In [Equation 18], represents the power of the transmission signal, i represents a user index, d.sub.1 represents the data signal for the first user, and .sub.i represents E(d.sub.i).sup.2 of the i.sup.th user. In addition, the first term represents the accuracy of recovered data at a related resource position, and the second term represents the correlation between the related resource position and the resource position of the RS in [Equation 18]. The correlation may indicate how close the related resource is to the resource of the RS on the frequency or time axis. In addition, C.sub.{tilde over (h)},{tilde over (g)} has a value between 0 and 1, and as C.sub.{tilde over (h)},{tilde over (g)} is closer to 1, the correlation is higher.

(104) FIG. 6 and [Equation 8] to [Equation 18] have been described in the context of a demodulation RS in an LTE system, by way of example. However, it is obvious that the embodiment illustrated in FIG. 6 and [Equation 8] to [Equation 18] are also applicable to an RS having a different structure as well as the demodulation RS. Apparently, the embodiment illustrated in FIG. 6 may be implemented irrespective of an antenna configuration, the number of users in a related system, and a principle of generating an RS group based on antennas.

(105) FIG. 7 is a flowchart illustrating an operation of a receiver for estimating a DL channel in the MU-MIMO system according to an embodiment of the present disclosure.

(106) Referring to FIG. 7, the receiver receives a signal and performs FFT on the received signal in operation 702. In operation 704, the receiver detects a received signal mapped to a related resource region from the received FFT signal. Herein, the received signal mapped to the related resource region is assumed to be an RS.

(107) In operation 706, the receiver estimates a DL channel based on the detected RS. The receiver then calculates the LLR of a symbol to be recovered from the detected RS in operation 708.

(108) The receiver recovers information bits by performing channel decoding based on the LLR in operation 710 and checks whether the information bits have been recovered successfully in operation 712. For the channel decoding, a decoding scheme corresponding to an encoding scheme used in an encoder is used. Herein, it is assumed that turbo decoding is used, by way of example. Various error detection schemes are available for the check operation in operation 712. Herein, it is assumed that a cyclic redundancy check (CRC) scheme is used, by way of example.

(109) If it turns out that the receiver has succeeded in recovering the information bits in the check in operation 712, the receiver ends the channel estimation operation. If it turns out that the receiver has not succeeded in recovering the information bits, the receiver generates soft symbols based on LLRs in operation 714. The receiver re-orders the soft symbol values in operation 716, and selects a virtual RS in operation 718. Herein, the virtual RS is selected based on the accuracy of data recovered at a related resource position, and the correlation between the related resource position and the position of a resource in which an RS is received, and a signal received at a resource position having a high accuracy of recovered data and a high correlation is selected as a virtual RS.

(110) Subsequently, the receiver proceeds to operation 706, and re-estimates the DL channel based on the virtual RS selected in operation 718.

(111) While channel estimation is repeated until information bits are successfully recovered in FIG. 7, by way of example, the receiver may predetermine a decoding repetition number. In this case, the receiver may perform channel estimation as many times as the predetermined decoding repetition number, and ends the channel estimation irrespective of whether information bits are successfully recovered.

(112) FIG. 8 is a graph illustrating the performance of a receiver using a single-user detection scheme and the performance of a receiver using a multi-user detection scheme in the MU-MIMO system according to an embodiment of the present disclosure.

(113) Referring to FIG. 8, it is assumed that the MU-MIMO system includes an eNB having four antennas and four users, and the four antennas are grouped into two groups each including two antennas. It is also assumed that the four users are allocated to four resources and receive RSs in the allocated resources.

(114) An extended vehicular A (EVA) model is used as a channel environment and the Doppler effect is assumed to be 70 hz. It is assumed that minimum mean square error-partial interference cancellation (MMSE-PIC) is used as an LLC calculation scheme, and 32 symbols are selected per resource block in the case of a virtual RS. Further, it is assumed that quadrature phase shift keying (QPSK ) is used as a modulation scheme and the sum of interference power amounts to 2 dB with respect to a predetermined user power.

(115) In the illustrated graph, the horizontal axis represents energy per bit to noise spectral density ratio (Eb/No), and the vertical axis represents block error rate (BER).

(116) Further, Perfect channel state information (CSI) with single user detection (SUD) is a graph illustrating the performance of a receiver using SUD, Conventional MMSE with SUD is a graph illustrating the performance of a receiver using legacy MMSE and SUD, Perfect CSI with multi-user detection (MUD) is a graph illustrating the performance of a receiver having knowledge of accurate channel information and using MUD, MMSE with MUD is a graph illustrating the performance of a receiver that estimates an interference channel by MMSE and uses MUD, and Proposed with MUD is a graph illustrating the performance of a receiver using a virtual RS.

(117) It may be noted from the graph illustrated in FIG. 8 that the receiver using a virtual RS has a performance increase of 4 dB with respect to the performance of the SUD receiver and a performance increase of 0.5 dB with respect to the performance of the MUD receiver.

(118) FIG. 9 is another graph illustrating the performance of a receiver using SUD and the performance of a receiver using MUD in the MU-MIMO system according to an embodiment of the present disclosure.

(119) Referring to FIG. 9, it is assumed that the MU-MIMO system includes an eNB having four antennas and four users, and the four antennas are grouped into two groups each including two antennas. It is also assumed that the four users are allocated to four resources and receive RSs in the allocated resources.

(120) An EVA model is used as a channel environment and the Doppler effect is assumed to be 70 hz. It is assumed that MMSE-PIC is used as an LLC calculation scheme, and 32 symbols ae selected per resource block in the case of a virtual RS. Further, it is assumed that 16QAM is used as a modulation scheme and the sum of interference power amounts to 3 dB with respect to a predetermined user power.

(121) In the illustrated graph, the horizontal axis represents Eb/No, and the vertical axis represents BER.

(122) Further, Perfect CSI with SUD is a graph illustrating the performance of a receiver which has knowledge of accurate channel information and uses SUD. Conventional MMSE with SUD is a graph illustrating the performance of a receiver using legacy MMSE and SUD, Perfect CSI with MUD is a graph illustrating the performance of a receiver having knowledge of accurate channel information and using MUD, MMSE with MUD is a graph illustrating the performance of a receiver that estimates an interference channel by MMSE and uses MUD, and Proposed with MUD is a graph illustrating the performance of a receiver using a virtual RS.

(123) It may be noted from the graph illustrated in FIG. 9 that the receiver using a virtual RS has a performance increase of 3 dB with respect to the performance of the SUD receiver and a performance increase of 1 dB with respect to the performance of the MUD receiver.

(124) While the disclosure has been shown and described with reference to specific embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the disclosure as defined by the appended claims and their equivalents.

(125) Further, the apparatus and method for estimating a downlink channel according to the embodiments of the present disclosure can be implemented in hardware, software, or a combination thereof. The software may be stored in a volatile or non-volatile storage device such as ROM irrespective of erasable or rewritable, a memory such as RAM, a memory chip, a device, or an integrated circuit (IC), or an optically or magnetically writable and machine-readable (for example, computer-readable) storage medium such as CD, DVD, a magnetic disk, or a magnetic tape. The estimating a downlink channel method according to the present disclosure can be performed by a computer or portable terminal including a controller and a memory, and the memory is an exemplary machine-readable storage medium suitable for storing a program or programs containing instructions that implement the embodiments of the present disclosure.

(126) Accordingly, the present disclosure includes a program with a code that implements an apparatus or method disclosed in the claims, and a machine-readable (computer-readable or the like) storage medium storing the program. This program may be electronically transferred on a medium such as a communication signal transmitted via a wired or wireless connection, and the present disclosure appropriately includes the equivalents.

(127) In addition, the apparatus according to embodiments of the present disclosure may receive and store a program from the downlink channel estimation apparatus. The program providing device may include a program containing instructions that control a program processor to perform a predetermined content protection method, a memory for storing information required for the content protection method, a communication unit for conducting wired or wireless communication with a processor, and a controller for transmitting the program to a transceiver upon request of the processor or automatically.