This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how the capacity scales with increasing SNR for a large but practical number, n, of antenna elements at both transmitter and receiver.

We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared to the baseline n = 1 case, which by Shannon‘s classical formula scales as one more bit/cycle for every 3 dB of signal-to-noise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take the cases n = 2, 4 and 16 at an average received SNR of 21 dB. For over 99% of the channels the capacity is about 7, 19 and 88 bits/cycle respectively, while if n = 1 there is only about 1.2 bit/cycle at the 99% level. For say a symbol rate equal to the channel bandwith, since it is the bits/symbol/dimension that is relevant for signal constellations, these higher capacities are not unreasonable. The 19 bits/cycle for n = 4 amounts to 4.75 bits/symbol/dimension while 88 bits/cycle for n = 16 amounts to 5.5 bits/symbol/dimension. Standard approaches such as selection and optimum combining are seen to be deficient when compared to what will ultimately be possible. New codecs need to be invented to realize a hefty portion of the great capacity promised.

/pdf/on-limits-of-wireless-communications-in-a-fading-environment-2nxyevgur3.pdf

On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

The quintessential goal of sensor array signal processing is the estimation of parameters by fusing temporal and spatial information, captured via sampling a wavefield with a set of judiciously placed antenna sensors. The wavefield is assumed to be generated by a finite number of emitters, and contains information about signal parameters characterizing the emitters. A review of the area of array processing is given. The focus is on parameter estimation methods, and many relevant problems are only briefly mentioned. We emphasize the relatively more recent subspace-based methods in relation to beamforming. The article consists of background material and of the basic problem formulation. Then we introduce spectral-based algorithmic solutions to the signal parameter estimation problem. We contrast these suboptimal solutions to parametric methods. Techniques derived from maximum likelihood principles as well as geometric arguments are covered. Later, a number of more specialized research topics are briefly reviewed. Then, we look at a number of real-world problems for which sensor array processing methods have been applied. We also include an example with real experimental data involving closely spaced emitters and highly correlated signals, as well as a manufacturing application example.

Two decades of array signal processing research: the parametric approach

Wireless indoor positioning systems have become very popular in recent years. These systems have been successfully used in many applications such as asset tracking and inventory management. This paper provides an overview of the existing wireless indoor positioning solutions and attempts to classify different techniques and systems. Three typical location estimation schemes of triangulation, scene analysis, and proximity are analyzed. We also discuss location fingerprinting in detail since it is used in most current system or solutions. We then examine a set of properties by which location systems are evaluated, and apply this evaluation method to survey a number of existing systems. Comprehensive performance comparisons including accuracy, precision, complexity, scalability, robustness, and cost are presented.

Survey of Wireless Indoor Positioning Techniques and Systems

The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is an

Convergence of probability measures

Many popular direction-of-arrival (DOA) estimators rely on the fact that the array response vector of the array is Vandermonde, for example, that of a uniform linear array (ULA). Array interpolation is a preprocessing technique to transform the array response vector of a planar array of arbitrary geometry to that of a ULA over an angular sector. While good approximation within the target sector is attained with the various existing array interpolation approaches, the response of the interpolated array in the out-of-sector region is at best partially controlled. Accordingly, out-of-sector signals, especially those highly correlated with the in-sector signals, can degrade significantly the performance of DOA estimators that rely on the Vandermonde form to work correctly. Recently, we proposed an improved array interpolation approach that takes into account the array response over the full azimuth. In this paper, we develop the idea further and present a simple data-adaptive array interpolation scheme that can provide significantly better accuracy in the DOA estimates. We present examples to demonstrate the effectiveness of our proposal.

/pdf/data-adaptive-array-interpolation-for-doa-estimation-in-4s3rgfzgco.pdf

Data-adaptive array interpolation for DOA estimation in correlated signal environments

The problem of estimating parameters of multiple narrowband emitter signals from sensor array data is considered. Under the assumption of Gaussian distributed emitter signals, the stochastic maximu ...

Stochastic maximum likelihood estimation in sensor arrays by weighted subspace fitting

We study the downlink of a multicell MIMO system where clusters of multi-antenna base stations jointly serve multiple single-antenna users, commonly referred to as a network MIMO system. Most of the previous studies on network MIMO have only considered the azimuth pattern of the antenna, while ignoring the elevation pattern. In this paper, we consider both the azimuth and the elevation patterns and investigate the impact of the elevation angle tuning parameter, denoted as the antenna tilt, on the performance of such systems. Using system simulations, it is shown that the promised performance gains of network MIMO systems over conventional non-coordinated systems, crucially depend on the choice of the right tilt setting including the tilt type, i.e., mechanical or electrical, and the tilt angle. In particular, for tilt angles smaller than the optimum, network MIMO with intra-site coordination performs almost as well as the conventional system; while for tilt angles larger than the optimum, the performance of network MIMO with intra-site is similar to that of network MIMO with inter-site coordination.

http://publications.lib.chalmers.se/records/fulltext/163664/local_163664.pdf

Impact of Base Station Antenna Tilt on the Performance of Network MIMO Systems

Today most arrays have a very high mechanical and electrical accuracy Our aim is to allow for larger errors (low manufacturing cost), while keeping the calibration grid sparse (low calibration cost) To be able to handle the imperfections causing scan dependent errors (like position errors), we suggest a new array receive calibration method based on local models The results show that our method performs much better than linear interpolation or global (direction independent) calibration regarding direction of arrival estimation using MUSIC for arrays with large position errors In beamforming for eg communication, however, the global calibration performs better (lower side lobes) since it is optimized for the whole calibration region, while the local calibration is optimized for one direction

Calibrating an Array with Scan Dependent Errors Using a Sparse Grid

This paper discusses resolution enhancement of a set of images with varying exposure durations, having a high combined dynamic range. So far, little has been said in relation to the Human Visual System when it comes to Super-Resolution and High Dynamic Range fusion, unlike the case for traditional Super-Resolution where errors are measured with respect to human perception in the pixel domain. We propose a Super-Resolution method in the L*a*b* domain to bridge that gap and present some image reconstruction results.

http://publications.lib.chalmers.se/records/fulltext/154967/local_154967.pdf

Mats Viberg

Papers

Data-adaptive array interpolation for DOA estimation in correlated signal environments

Stochastic maximum likelihood estimation in sensor arrays by weighted subspace fitting

Impact of Base Station Antenna Tilt on the Performance of Network MIMO Systems

Calibrating an Array with Scan Dependent Errors Using a Sparse Grid

Regularized optimization for joint super-resolution and high dynamic range image reconstruction in a perceptually uniform domain