Open Access
This article is

- freely available
- re-usable

*Electronics*
**2017**,
*6*(2),
33;
https://doi.org/10.3390/electronics6020033

Article

MIMO Channel-State Estimation in the Presence of Partial Data and/or Intermittent Measurements

^{1}

Dipartimento di Ingegneria Elettrica e dell’Informazione “Maurizio Scarano” (DIEI), University of Cassino and Southern Lazio, via G. Di Biasio 43, 03043 Cassino, Italy

^{2}

ELEDIA Research Center ([email protected]), Università di Cassino e del Lazio Meridionale, via G. Di Biasio 43, 03043 Cassino, Italy

*

Correspondence: [email protected] or [email protected]; Tel.: +39-0776-299-3750

^{†}

These authors contributed equally to this work.

Academic Editors:
Hamid Bahrami,
Xu Zhu
and
Nicholas J. Kirsch

Received: 28 February 2017 / Accepted: 17 April 2017 / Published: 20 April 2017

## Abstract

**:**

We propose a method for estimating the channel matrix in MIMO communication systems from intermittent measurements based on the matrix completion technique. The method requires the minimization of the trace norm of the partially known channel matrix. The availability of fast and efficient convex minimization programs allows a numerically efficient solution of the problem. The effectiveness of the technique is numerically investigated considering different scattering environments.

Keywords:

MIMO communication systems; channel state estimation; matrix completion## 1. Introduction

MIMO communication is a key technology for the forthcoming generation of personal wireless communications. Starting from the point-to-point communication networks, the MIMO concept was extended to multi-users introducing new strategies for inter-user interference reduction such as Multi-User MIMO and Massive MIMO. The potential benefits associated to the efficient use of the spatial resources allowed by MIMO communication strategy include higher bit rate, higher reliability of the connection, lower interference level, and a larger number of subscribers in the cell [1].

All this is made possible by the knowledge of the response of the MIMO channel, i.e., the knowledge of the channel state information (CSI). The accuracy of the CSI is of paramount importance for a MIMO system, and incorrect CSI information can strongly degrade the performance of the communication system.

On the other hand, CSI estimation is an expensive process in terms of throughput of the communication system, since generally pilot signals must be sent during CSI identification, reducing the bit rate at which the payload can be transmitted.

Furthermore, CSI must be refreshed at a rate depending on the correlation time of the channel. While in relatively stationary channels associated to low-mobile devices in almost stationary environments (as for example lap-top connection in a library) the overload due to CSI is small, in fast-changing environments (such as a mobile phone connection in a moving car) the CSI update process can cause a significant loss of performance of the system.

Degradation of MIMO throughput is particularly relevant in presence of deep fading, since the CSI process must be repeated many times before obtaining full CSI identification.

The increase of the number of antennas in MIMO systems makes these problems more and more relevant since the number of measurements as well as the probability of data missing due to deep fading linearly increase with the number of antennas at the receiver/transmitters.

The aim of this paper is to investigate a method able to estimate the CSI from incomplete data. The idea at the basis of this method was briefly sketched for the first time in [2] and takes advantage of some recent results regarding the connections between electromagnetic theory and information theory. These results allow relating some properties of the channel matrix to the ones of the electromagnetic radiation operator [3]. As a consequence, in the presence of partially known channel matrix the remaining elements can be estimated considering the minimum rank solution among all the channel matrices compatible with the available data using the matrix completion theory developed in the framework of information theory and signal processing [4,5].

## 2. Number of Subchannels of MIMO Communication Systems and Rank of the Radiation Operator

Let us consider a MIMO communication channel with N transmitter antennas, and M receiving antennas. Without loss of generality, we suppose that the channel has unit bandwith (i.e., 1 Hz) and is of flat frequency over this bandwidth. Let ${W}_{x}$ be the total average energy available at the transmitter over a symbol period, that in our specific case is also equal to the total average transmitted power. Given the channel transfer matrix $\mathbf{H}\in {\mathbb{C}}^{M\times N}$ the input–output relation for the MIMO communication system is [1]:
where $\mathbf{y}\in {\mathbb{C}}^{M\times 1}$ is the received signal vector, $\mathbf{x}\in {\mathbb{C}}^{N\times 1}$ is the transmitted signal vector, and $\mathbf{n}$ is the noise vector. The supposed zero mean circular symmetric complex Gaussian (ZMCSCG) with covariance matrix $\mathcal{E}\left\{\mathbf{n}{\mathbf{n}}^{H}\right\}={N}_{0}\mathbf{I}$, $\mathbf{I}$ being the unit $M\times M$ matrix. We suppose that the transmitted signal vector has zero mean, and the trace of its covariance matrix ${\mathbf{R}}_{xx}=\mathcal{E}\left\{\mathbf{x}{\mathbf{x}}^{H}\right\}$ is equal to N in order to verify the constraint on the total energy.

$$\mathbf{y}=\sqrt{\frac{{W}_{s}}{N}}\mathbf{H}\mathbf{x}+\mathbf{n}$$

As is well known, the channel capacity of the MIMO channel is [1]:

$$C=\underset{\mathrm{Tr}\left({\mathbf{R}}_{\mathbf{xx}}\right)}{max}{log}_{2}det\left(\mathbf{I}+\frac{{W}_{s}}{N{N}_{0}}\mathbf{H}{\mathbf{R}}_{xx}{\mathbf{H}}^{H}\right)\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\mathrm{bps}/\mathrm{Hz}$$

An insight of the role of the channel matrix $\mathbf{H}$ in the channel capacity can be obtained by expanding the matrix using singular value decomposition (SVD),
wherein $\mathbf{U}\in {\mathbb{C}}^{M\times M}$ and $\mathbf{V}\in {\mathbb{C}}^{N\times N}$ are unitary matrices whose column vectors $\left\{{u}_{k}\right\}$ and $\left\{{v}_{k}\right\}$ are the left and right singular vectors of the matrix, and $\Sigma $ is a matrix whose elements are all nulls except the first r elements $\{{\sigma}_{1},{\sigma}_{2},...,{\sigma}_{r}\}$, called singular values, placed along the main diagonal of the $min(M,N)\times min(M,N)$ upper-left submatrix. Accordingly, we have:
wherein $<\xb7,\xb7>$ stands for the inner product.

$$\mathbf{H}=\mathbf{U}\Sigma {V}^{H}$$

$$\mathbf{y}=\sqrt{\frac{{W}_{s}}{N}}\sum _{k=1}^{r}{\sigma}_{k}<\mathbf{x},{\mathbf{v}}_{k}>{\mathbf{u}}_{k}+\mathbf{n}$$

The channel capacity can be represented as the sum of the channel capacity of r parallel SISO channels:
wherein ${\gamma}_{k}$ is the optimal energy allocation along each SISO subchannel, obtained by the waterpouring algorithm.

$$C=\sum _{k=1}^{r}{log}_{2}\left(1+\frac{{W}_{s}{\gamma}_{k}}{N{N}_{0}}{\sigma}_{k}^{2}\right)\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\mathrm{bps}/\mathrm{Hz}$$

As indicated above, this analysis in terms of subchannels highlights the importance of the channel matrix structure. The large increase of the channel capacity of MIMO systems arises from the presence of several communication subchannels, each of them able to transmit statistically independent information. The number of such subchannels is bounded by the rank r of the channel matrix. The number of effectively used subchannels depends on the available average energy (or equivalently on the average transmitted power) [1]. The number of subchannels conveying reliable information is called the effective degrees of freedom of the MIMO system.

In order to maximize the throughput of a MIMO system it is of paramount importance to estimate the channel matrix $\mathbf{H}$. As described in the Introduction, this step, known as channel state information, generally requires the transmission of known signals and causes a decrease of the throughput of the system. Consequently, it is of great interest to estimate the channel state from incomplete data avoiding the repetition of the CSI in case of intermittent received data.

A commonly adopted model for the channel capacity is the Gaussian random matrix. Since Gaussian matrices are low structured, this seems to prevent an effective estimation of missed elements. However, in real cases the channel matrix is much more structured as a consequence of the underlying physical processes involved in MIMO propagation.

In order to clarify this point let us consider a harmonic electromagnetic source placed in a domain D bounded by a surface $\Xi $ (see Figure 1). The field, observed on the domain $\Omega $ (supposed as not intersecting $\Xi $) is [6,7]:
wherein $\mathbf{r}\in \Omega $, $\mathbf{J}$ is the source current density, $\mathbf{G}$ is the dyadic Green’s function and · denotes the matrix-vector product.

$$\begin{array}{c}\hfill \mathbf{E}\left(\mathbf{r}\right)={\int}_{D}\mathbf{G}(\mathbf{r},{\mathbf{r}}^{\prime})\xb7\mathbf{J}\left({\mathbf{r}}^{\prime}\right)d{\mathbf{r}}^{\prime}\end{array}$$

It is possible to recast the problem in functional spaces using standard functional analysis tools. We consider $\mathbf{J}$ as an element x of the set X, $\mathbf{E}$ an element y of the set Y and $\mathcal{H}:X\to Y$ the radiation operator mapping X onto Y, whose elements are the values of the electric field $\mathbf{E}$ on the observation surface $\Omega $ [3]. In the following discussion we suppose that the currents and the fields belong to separable Hilbert spaces equipped with ${L}_{2}$ norm. Furthermore, the set of the currents is supposed to be bounded with the unit ${L}_{2}$ radius.

Since the operator $\mathcal{H}$ is completely continuous (also called compact) [8] and X is bounded, $\mathcal{H}$ can be represented by the Hilbert–Schmidt decomposition [3,8]:
wherein n takes into account additive noise or uncertainty on the observed quantity, $({\sigma}_{k},{u}_{k},{v}_{k})$ is the singular system of $\mathcal{H}$, and ${\sigma}_{1}\ge {\sigma}_{2}\ge {\sigma}_{n}\ge ...$ are the singular values of the operator.

$$\begin{array}{c}\hfill y=\mathcal{H}x=\sum _{k=0}^{\infty}{\sigma}_{k}<x,{v}_{k}>{u}_{k}+n\end{array}$$

By comparing Equation (7) to Equation (4) we can note a strong similarity. Indeed, the electromagnetic model is a continuous version of a MIMO system, and in fact in the case of discrete sources (i.e., radiating arrays) and discrete observation points the continuous model can be straightforwardly modified considering finite-dimensional Euclidean spaces; in this case $\mathcal{H}$ turns out to be the channel matrix $\mathbf{H}$, while the Hilbert–Schmidt expansion becomes the well known singular value decomposition of a matrix.

The range of the radiation operator $\mathcal{H}$, i.e., the set of the radiated fields, can be approximated with a finite dimensional space at any degree of accuracy. The number of dimensions of the range of the operator is equal to the effective number of singular values of the operator. This number is the effective rank of the operator, also known as the number of degrees of freedom of the electromagnetic field (NDF) [9].

Analysis of the NDF in scattering environments has been carried out in [10], showing that in the case of dense scattering environment and receivers surrounding the source the maximum NDF is limited by the value of the NDF of the field in free space and depends on the electrical dimension of the source. However, this condition is rarely obtained and in practical cases the observation surface, i.e., the surface where the receivers are placed, is a limited portion of the surface surrounding the source, causing a decrease of the NDF.

Comparing Equation (7) to Equation (4) we can note that the MIMO channel matrix is a discretized version of the radiation operator, and its rank is limited by the NDF of the field. Consequently, in case of a large number of radiating elements the MIMO channel matrix has generally low rank, with a number of communication subchannels that is lower than the number of RX/TX antennas. This suggests estimating the channel matrix in case of lost matrix elements using this low-rank property. The basic idea is that in presence of lost data it is reasonable to find the channel matrix having lower rank. This is equivalent to identifying the ’simplest’ multipath scenario, i.e., the scenario giving the smallest number of subchannels.

## 3. MIMO Channel Matrix Estimation from Incomplete and Noisy Data

As discussed in the previous section, the basic idea in order to estimate an incomplete MIMO channel matrix is to identify the matrix having the smallest effective rank. Let us consider an $M\times N$ MIMO system and let us suppose that deep fading conditions occurred during the channel state identification procedure causing the loss of a number of entries of the channel matrix. As a consequence of the fading, only a part of (the noise-affected) entries of the channel matrix is available in the CSI process.

Let $\mathbf{H}\in {\mathbb{C}}^{M\times N}$ be the channel matrix. The available $p<MN$ data are collected in the vector $\mathbf{e}\in {\mathbb{C}}^{p}$. As above recalled, in order to estimate the channel matrix from the p entries we can use a rank minimization strategy:
where $\mathcal{A}$ is the linear map: ${\mathbb{C}}^{M\times N}\to {\mathbb{C}}^{p\times 1}$ that selects the p available entries of the channel matrix among the $MN$ entries of the matrix , while $\epsilon $ depends on the noise level affecting the measured data $\mathbf{e}$. The problem (8), known as matrix completion [4], is a very hard non-convex problem, and requires an exhaustive search or global minimization algorithms. However, recent literature has shown that the trace norm (also called Schatten 1-norm or nuclear norm), defined as:
(wherein ${\sigma}_{k}$ is k-th singular values of $\mathbf{H}$) can be effectively used as a surrogate of the rank in minimization algorithms [4,5].

$$\underset{\mathbf{H}\in {\mathbb{C}}^{M\times N}}{min}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\mathrm{rank}\left(\mathbf{H}\right)\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\mathrm{subject}\phantom{\rule{0.166667em}{0ex}}\mathrm{to}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}{\parallel \mathcal{A}\left(\mathbf{H}\right)-\mathbf{e}\parallel}_{2}\le \epsilon $$

$$\begin{array}{c}\hfill {\parallel \mathbf{H}\parallel}_{*}=\sum _{k=1}^{r}{\sigma}_{k}\end{array}$$

The nuclear norm can be seen as a relaxed version of the rank norm: while the rank function counts the number of non-zero singular values, the nuclear norm sums their amplitude. Consequently, in some way the nuclear norm is to the rank functional what the convex ${\ell}_{1}$-norm is to the ${\ell}_{0}$-norm in the sparse recovery area. In order to clarify this point, let us recall that in sparse recovery the goal is to identify the sparsest vector (i.e., the vector having the largest number of null components) compatible with the available data [11]. This requires minimization of the so called ${\ell}_{0}$ norm, wherein ${\ell}_{0}$ is the number of non null elements of the unknown vector. Such a minimization is a challenging non-convex problem. For the sake of simplicity, let us consider a three-entry vector, $\mathbf{x}=\{x,y,z\}$. The vector is supposed to be 1-sparse, i.e., only one of the three entries of the vector is different from zero. Let us consider the convex hull of the 1-sparse vectors. Such a convex hull turns out to be the unit ball of the ${\ell}_{1}$ norm, wherein the ${\ell}_{1}$ norm is ${\parallel \mathbf{x}\parallel}_{1}=\left|x\right|+\left|y\right|+\left|z\right|$. A graphical picture of the unit ${\ell}_{1}$ ball is drawn in Figure 2a. The solution of the ${\ell}_{1}$ minimization (red point in Figure 2a is the tangent point between the affine space associated to the available data (drawn as a red line in Figure 2a) and the scaled convex hull.

Now, let us consider the problem of matrix completion. Paralleling the approach followed for sparse recovery, we build the convex hull of the (unit-norm) rank-one matrices, obtaining the nuclear norm ball, shown in Figure 2b as a cylinder. The solution of the completion problem (red point in Figure 2b) is given by the tangent point between the affine space associated to the available data (drawn as a red line in Figure 2b) and the scaled convex hull. Consequently, both methods are based on the construction of a proper convex hull, that turns out to be the unit ball in a suitable norm.

As discussed above, the rank minimization problem is non-polynomial (NP). Instead, the trace norm minimization is a convex problem and consequently can be solved using efficient convex programming algorithms [12].

In fact, the trace minimization problem is equivalent to the following problem [13]:

$$\begin{array}{cc}\hfill & \underset{\mathbf{X},\mathbf{Y},\mathbf{Z}}{min}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\mathrm{Trace}\left(\mathbf{Y}\right)+\mathrm{Trace}\left(\mathbf{Z}\right)\\ \hfill & \mathrm{subject}\phantom{\rule{0.166667em}{0ex}}\mathrm{to}\left\{\begin{array}{c}{\parallel \mathcal{A}\left(\mathbf{X}\right)-\mathbf{e}\parallel}_{2}\le \u03f5\hfill \\ \left[\begin{array}{cc}\mathbf{Y}& \mathbf{X}\\ {\mathbf{X}}^{*}& \mathbf{Z}\end{array}\right]\u2ab00\hfill \end{array}\right.\end{array}$$

The solution can be numerically found using a semidefinite programming solver. The examples shown in this paper were obtained using the CVX software [14] that calls an interior point optimizer. It allows specification of constraints and objectives in standard MatLab expression syntax. For example, the minimization (8) turns out in the following simple CVX instructions, originally reported in [13]:

- minimize(trace(Y) + trace(Z))
- subject to
- norm(X(ind)-e ,2) <= epsilon;
- [Y,X;X’,Z] >= 0;

CVX is based on MatLab, and hence it is not optimized for speed. The results showed in this paper required the following times of elaboration on an i5 Mac Airbook (evaluated by the CVS time estimation algorithm):

- $3\times 3$ channel matrix: 130 ms;
- $5\times 5$ channel matrix: 150 ms;
- $7\times 7$ channel matrix: 170 ms;
- $9\times 9$ channel matrix: 240 ms;
- $19\times 19$ channel matrix: 410 ms.

However, implementation on FPGA is possible taking into account that the dimension of the matrix is fixed. This should give a large improvement in the elaboration time.

## 4. Numerical Examples

In order to study the effectiveness of the MIMO channel estimation technique, let us consider a simple MIMO communication system consisting in two linear arrays of half-wavelength equispaced wire antenna elements. The number of elements of the transmitting antenna, N, is supposed equal to the number of elements of the receiving antenna (M) for the sake of simplicity. In all the following examples the measured data are affected by 20-dB noise level, i.e., Gaussian random noise with power 20 dB below the signal power. It is understood that such a noise level limits the dynamic of estimated singular values to around 20 dB also in case of no loss of channel matrix elements.

For example let us consider a $9\times 9$ MIMO system in an environment with randomly placed perfectly conducting point-like scatterering objects, with a distance $d=30\lambda $ between the transmitter and the receiver. In the numerical analysis we considered non light of sight (NLOS) propagation, i.e., the line of sight (LOS) component was neglected.

The mean error of the reconstruction is evaluated as:
wherein ${\mathbf{H}}_{k}^{exact}$ and ${\mathbf{H}}_{k}^{estimated}$ are respectively the exact channel matrix and estimated channel matrix of the $k-th$ trial and ${\parallel \xb7\parallel}_{F}$ is the Frobenius norm of the matrix.

$$Err=20{log}_{2}\left[{\mathrm{mean}}_{k}\phantom{\rule{4pt}{0ex}}\left(\frac{\parallel {\mathbf{H}}_{k}^{exact}-{\mathbf{H}}_{k}^{estimated}{\parallel}_{F}}{\parallel {\mathbf{H}}_{k}^{exact}{\parallel}_{F}}\right)\right]$$

We consider the mean reconstruction error varying the signal-to-noise ratio (SNR) from 0 to 30 dB with 3 matrix elements missed; a number of 10 and 90 scatterers and 50 trials (i.e., 50 random environments) for each value of SNR were considered. The reconstruction error [dB] is plotted in Figure 3 showing a good estimation of the channel matrix both in case of poor and rich scattering environment.

The mean reconstruction error in case of 90 scatterers and 1, 3, and 5 lost elements as a function of the SNR is shown in Figure 4, showing again a good reconstruction of the matrix

The proposed method is particularly useful in case of large MIMO systems, in which the probability of losing an element is significant. However, it can be used also in smaller MIMO systems, as in IEEE 802.11n radios, that can use up to four radiating elements. In order to investigate the use of the technique in small MIMO systems, the average error (dB) is plotted as a function of the percentage of the missed elements of the channel matrix in case of small ($3\times 3$, $5\times 5$, $7\times 7$, $9\times 9$) and large ($15\times 15$, $19\times 19$) MIMO systems supposing 10 scatterers and a noise level equal to −15 dB and −20 dB in Figure 5 and Figure 6 respectively. The plots show that also in case of small MIMO systems we have an interesting performance of the technique.

Now, let us show a more realistic scenario, consisting of the corridor shown in Figure 7d, with a $9\times 9$ MIMO communication system. The model is 3D, and the height of the corridor is 3.0 m. The position of the transmitting antenna and receiving antenna is indicated as a green square and a blue circle respectively. Each antenna consists of an array of nine half-wavelength wire antenna radiating elements parallel to the z axis of the figure working at 2.4 GHz.

The channel matrix was obtained using a 3D ray-tracing algorithm. The algorithm is based on image theory method and considers the dielectric properties of the walls, the roof and the floor, that were supposed to be made by dry bricks with permittivity $\epsilon =4-j0.05$ [15]. The simulations were carried out considering a single reflection.

The amplitude and the phase of the channel matrix of the MIMO system are shown in Figure 7a and Figure 8a. Two missed elements and 20 dB noise level are assumed during the CSI measurement process. The measured data are affected by 20-dB noise level. The amplitude and the phase of the available data are shown in Figure 7b and Figure 8b. The data were elaborated using the proposed algorithm, and amplitude and phase of the estimated channel matrix are shown in Figure 7c and Figure 8c. The singular values of the exact channel matrix and of the estimated channel matrix are shown in Figure 8d respectively as blue circles and green squares. The figures show a good estimation of the channel matrix.

In order to give a more complete view of the performance of the method, in Figure 9 the error affecting the estimated channel matrix is plotted versus the percentage of the missed elements in case of MIMO systems ranging from $3\times 3$ to $15\times 15$ elements. The figure shows that the method gives acceptable results also in case of small MIMO systems. However, it is useful to stress that the same value of percentage of missed elements are associated to different absolute number in case of different MIMO systems.

In this example the short distance between transmitter and receiver gives a quite rich channel matrix in terms of number of subchannels, as shown by the relatively slow decrease of the singular values.

The position of the receiver was moved along the corridor to study the performance of the estimation algorithm in different situations. As an example, the results obtained in two other receiving positions are shown. The positions are reported in Figure 10d and Figure 11d. The amplitudes of the channel matrices of the MIMO system are shown in Figure 10a and Figure 11a while the phases are shown in Figure 12a and Figure 13a. The amplitude of the measured channel matrices, with 25% of the entries lost and the remaining entries affected by 20 dB noise level is shown in Figure 10b and Figure 11b while the phase is shown in Figure 12b and Figure 13b. Finally the amplitude of the estimated channel matrices is shown in Figure 10c and Figure 11c while the phase is shown in Figure 12c and Figure 13c. The singular values of the exact channel matrices and of the estimated channel matrices are shown in Figure 12d and Figure 13d respectively as blue circles and green squares, confirming the effectiveness of the technique.

In order to further investigate the technique, in Figure 14 the estimation error (dB) of the channel matrix in the three positions of the receiving antenna is plotted versus the percentage of the missed elements up to 25%. The figure shows that the best performance is obtained in position 3. This result well matches the electromagnetic model describing the spatial channel. In fact, the number of effective singular values of the radiation operator, and hence the number of MIMO spatial subchannels, becomes smaller when the distance between sources (including scatterers) and receiver increases. Consequently, the channel matrix in case of receiver position 3 is highly rank deficient, making the estimation algorithm more effective. This behavior is confirmed by the error affecting the singular values of the channel matrix, shown in Figure 15 (first four singular values normalized to the first singular value).

## 5. Conclusions

A method to estimate the channel matrix in presence of lost data and noisy measurements is proposed. The method takes advantage of the low-rank properties that channel matrices show in many real environments. Following the recent literature on the rank minimization, the problem is relaxed using trace norm minimization as convex surrogate of trace norm. This allows use of fast and efficient convex minimization algorithms. Numerical results confirm the effectiveness of the proposed technique. In particular, a 3D ray-tracing simulation in a corridor confirms that the technique is able to estimate the channel matrix both in rich and poor scattering environments as well as in case of both small and large MIMO systems.

## Author Contributions

Marco Donald Migliore, Daniele Pinchera, Mario Lucido, Fulvio Schettino and Gaetano Panariello contributed equally to this work.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

- Tse, D.; Viswanath, P. Fundamentals of Wireless Communications; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar]
- Migliore, M.D. Minimum Trace Norm Regularization (MTNR) in Electromagnetic Inverse Problems. IEEE Trans. Antennas Propag.
**2016**, 64, 630–639. [Google Scholar] [CrossRef] - Migliore, M.D. On Electromagnetics and Information Theory. IEEE Trans. Antennas Propag.
**2008**, 56, 3188–3200. [Google Scholar] - Candes, E.J.; Tao, T. The Power of Convex Relaxation: Near-Optimal Matrix Completion. IEEE Trans. Inf. Theory
**2010**, 56, 2053–2080. [Google Scholar] [CrossRef] - Keshavan, R.H.; Montanari, A.; Oh, S. Matrix Completion From a Few Entries. IEEE Trans. Inf. Theory
**2010**, 56, 2980–2998. [Google Scholar] [CrossRef] - Jones, D.S.J. Methods in Electromagnetic Wave Propagation, 2nd ed.; IEEE Press: Cambridge, UK, 1994. [Google Scholar]
- Migliore, M.D. On the role of the number of degrees of freedom of the field in MIMO channels. IEEE Trans. Antennas Propag.
**2006**, 54, 620–628. [Google Scholar] [CrossRef] - Kolmogorov, A.N.; Fomin, S.V. Elements of the Theory of Functions and Functional Analysis; Dover: Mineola, NY, USA, 1999. [Google Scholar]
- Bucci, O.M.; Franceschetti, G. On the degrees of freedom of scattered fields. IEEE Trans. Antennas Propag.
**1989**, 37, 918–926. [Google Scholar] [CrossRef] - Franceschetti, M.; Migliore, M.D.; Minero, P.; Schettino, F. The Information Carried by Scattered Waves: Near-Field and Nonasymptotic Regimes. IEEE Trans. Antennas Propag.
**2015**, 63, 3144–3157. [Google Scholar] [CrossRef] - Migliore, M.D. A simple introduction to compressed sensing/sparse recovery with applications in antenna measurements. IEEE Antennas Propag. Mag.
**2014**, 56, 14–26. [Google Scholar] [CrossRef] - Boyd, S.; Vandenberghe, L. Convex Optimization; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar]
- Fuchs, B.; LeCoq, L.; Migliore, M.D. Interpolation of Electromagnetic Near Field Radiated by Unknown Antennas. IEEE Trans. Antennas Propag.
**2017**, in press. [Google Scholar] - Grant, M.; Boyd, S. CVX: Matlab Software for Disciplined Convex Programming. Version 2.1. 2004. Available online: http://cvxr.com/cvx (1 March 2017).
- Bertoni, H. Radio Propagation for Modern Wireless Systems; Prentice Hall PTR: Upper Saddle RIves, NJ, USA, 2000. [Google Scholar]

**Figure 2.**(

**a**) Geometrical picture of the ${\ell}_{1}$ minimization; (

**b**) Geometrical picture of the trace norm minimization.

**Figure 3.**Error (dB) of the singular values estimation versus the signal-to-noise ratio (SNR) in the case of 10 and 90 scatterers (average value on 50 trials); 3 lost elements; measured data affected by the 20-dB noise level.

**Figure 4.**Error (dB) of the singular values estimation versus the SNR in the case of 90 scatterers (average value on 50 trials); 1, 3 and 5 lost elements; measured data affected by the 20-dB noise level.

**Figure 5.**Error (dB) versus the percentage of missed data in case of $3\times 3$, $5\times 5$, $7\times 7$, $9\times 9$, $15\times 15$ and $19\times 19$ MIMO system, 10 scatterers and SNR equal to −15 dB.

**Figure 6.**Error (dB) versus the percentage of missed data in the case of $3\times 3$, $5\times 5$, $7\times 7$, $9\times 9$, $15\times 15$ and $19\times 19$ MIMO system, 10 scatterers and SNR equal to −20 dB.

**Figure 7.**$9\times 9$ MIMO system in a corridor; amplitude of the exact (noise-free) (

**a**), measured (

**b**) and estimated (

**c**) channel matrix; (

**d**) the geometry of the problem: the position of the transmitting and receiving MIMO systems are plotted as green square and blue circle respectively.

**Figure 8.**$9\times 9$ MIMO system in a corridor, in phase of the channel matrix; (

**a**) exact (noise-free); (

**b**) measured; (

**c**) estimated; (

**d**) singular value of the exact (circles) and estimated (squares) matrices; the geometry of the problem is shown in Figure 7d.

**Figure 9.**Error (dB) versus the percentage of missed data in case of the $3\times 3$, $5\times 5$, $7\times 7$, $9\times 9$ and $15\times 15$ MIMO system; receiver in position 1; SNR equal to −20 dB; the geometry of the problem is shown in Figure 7d.

**Figure 10.**$9\times 9$ MIMO system in a corridor; amplitude of the exact (noise-free) (

**a**), measured (

**b**,

**c**) estimated (

**c**) channel matrix; (

**d**) geometry of the problem: the position of the transmitting and receiving MIMO systems are plotted as green square and blue circle respectively.

**Figure 11.**$9\times 9$ MIMO system in a corridor; amplitude of the exact (noise-free) (

**a**), measured (

**b**,

**c**) estimated (

**c**) channel matrix; (

**d**) geometry of the problem: the position of the transmitting and receiving MIMO systems are plotted as green square and blue circle respectively.

**Figure 12.**$9\times 9$ MIMO system in a corridor, phase of the channel matrix; (

**a**) exact (noise-free); (

**b**) measured; (

**c**) estimated; (

**d**) singular value of the exact (circles) and estimated (squares) matrices; the geometry of the problem is shown in Figure 10d.

**Figure 13.**$9\times 9$ MIMO system in a corridor, in amplitude of the channel matrix; (

**a**) exact (noise-free); (

**b**) measured; (

**c**) estimated; (

**d**) singular value of the exact (circles) and estimated (squares) matrices; the geometry of the problem is shown in Figure 11d.

© 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).