Search

This paper addresses the problem of distributed detection in the case where, under the signal-present hypothesis, the signal-to-noise ratio (SNR) is unknown and/or observations are correlated. We assume that each local detector makes a (binary) decision while meeting a local false alarm constraint; it then transmits its decision to a fusion center. The unknown SNR at each local detector induces an unknown probability of detection and, hence, the optimal detector at the fusion center does not exist. We begin with the case most often considered in the literature: independent observations. In this case, we derive the asymptotically optimal separating function estimation test (AOSFET) and the generalized likelihood ratio test (GLRT). Moreover, we propose a method to set the local false alarm rates to achieve the maximum probability of detection at the fusion center (while meeting a constraint on the global probability of false alarm). The second part of this paper considers the case of correlated observations. We show that the AOSFET for this problem does not exist. As alternatives, we propose three suboptimal SFETs: based on an approximation to the AOSFET, the Kullback–Leibler divergence, and the Euclidean distance of the estimated probability mass function (pmf) of the observations under each hypotheses. Finally, we propose two methods to improve the performance of the estimation of the pmfs using a library of training labeled data based on the maximum likelihood estimation and expected maximization methods. [ABSTRACT FROM AUTHOR]

The availability of accurate channel state information (CSI) is essential in multiuser massive multiple-input multiple-output (MIMO) systems. However, most published works focus on frequency-flat channel estimation which requires that the estimation must be repeated for every frequency slot, e.g., subcarrier, in a broadband system. Since the channels in the frequency-domain are the Fourier transform of a small set of time-domain channel coefficients, the time-domain channel estimation requires that fewer parameters be estimated. In this paper, we propose a semi-blind, time-domain, channel estimation technique for frequency-selective massive MIMO systems. Our solution depends on the subspace spanned by the signal eigenvectors of the received signal covariance matrix. Importantly, since the receiver samples at the symbol rate, time-domain-based estimation inherently has available enough samples for an accurate matrix estimate. To avoid asymptotic assumptions, we express each channel vector as a linear combination of the signal eigenvectors. We estimate the linear combination using a set of training symbols. Given the many samples of the received signal in the time-domain, we obtain a better channel estimate compared to conventional subcarrier-wise frequency-domain channel estimation. Unlike the previous published results, in this paper, we do not assume orthogonality of users’ channels or knowledge of large-scale fading coefficients. In addition, our estimation procedure does not require orthogonality between the training symbols of the users in all cells. [ABSTRACT FROM AUTHOR]

The distributed power control algorithms available in this paper assume perfect estimation of interference power at the receivers and often, the availability of perfect local channel state information (CSI). However, perfect estimation of interference power or acquisition of channel information is impractical. In this paper, we consider a generic class of distributed power control algorithms and analyze the resulting performance loss when faced with errors in CSI and/or interference level estimation. We approximate such power control algorithms with linearized state space dynamics wherein the errors in the estimation of received interference or the CSI, can be modeled as additive observation noise. Based on the proposed model, we derive lower bounds on the norm of the errors in the transmit power vector and receive signal-to-interference-plus-noise ratio (SINR) vector. Our analysis suggests that when the target SINR vector approaches the Pareto-optimal bound, the errors in the transmit vectors could grow without bound. As a consequence, to maintain a performance loss within an acceptable range, either much longer estimation times or lower target SINRs are required. Our numerical results confirm the validity of our analysis and the validity of the proposed bounds. [ABSTRACT FROM PUBLISHER]

The recent advancements in digital control of the waveforms transmitted by radar systems has enabled implementation of multiple-input multiple-output radar systems. In such radars, each element is capable of transmitting a different waveform; in this paper, we focus on modifying a multiplicative weight at each transmitter to improve detection performance. Several authors have considered the problem of optimizing the transmit weights and the receive filter generally to maximize the output signal-to-interference-plus-noise ratio. Crucially, these previous works assumed a priori knowledge of the required second-order statistics. In this regard, we make two key contributions: First, we formulate and solve an optimization problem to estimate these required statistics using only signals received in previous coherent processing intervals (CPIs). Essentially, we estimate the transmit interference covariance matrix using receive data. The estimation does not assume any specific structure for the clutter covariance matrix. By using the most recent CPIs in the design, our approach makes it possible to track changes in the interference environment, and, therefore, adaptively design the transmit code in real time. Second, we introduce reduced-dimension processing for transmit adaptivity. As in the case of receive space-time adaptive processing (STAP), it is crucial to be able to perform filter design with only a limited number of available training samples. While reduced-dimension processing is well established for receive adaptivity, as we will see, transmit reduced-dimension processing requires a completely different formulation. We consider transmit code design for a single look angle-Doppler bin and also for a range of Doppler bins in the case that the target Doppler shift is unknown. Finally, we present simulation results, in the context of phase-perturbed propagation and airborne radars, to illustrate the performance of the proposed methods. [ABSTRACT FROM AUTHOR]

We consider the downlink of a two-layer heterogeneous network, comprising macrocells (MCs) and small cells (SCs). The existing literature generally assumes independent placements of the access points (APs) in different layers; in contrast, we analyze a dependent placement where SC APs are placed at locations with poor service from the MC layer. Our goal is to obtain an estimate of the number of SCs required to maintain a target outage rate. Such an analysis is trivial if the MCs are located according to a Poisson point process (PPP), which provides a lower bound on performance. Here, we consider MCs placed on a hexagonal grid, which complements the PPP model by providing an upper bound on performance. We first provide accurate bounds for the average interference within an MC when SCs are not used. Then, by obtaining the outage areas, we estimate the number of SCs required within an MC to overcome outage. If resource allocation among SCs is not used, we show that the problem of outage is not solved completely and that the residual outage area depends on whether cochannel or orthogonal SCs are used. Simulations show that a much smaller residual outage area is obtained with orthogonal SCs. [ABSTRACT FROM PUBLISHER]

We analyze the uplink of coordinated multi-point (CoMP) networks in which cooperation can be amongst $N=2$ or $N=3$ base stations (BSs). We consider a 2-D network of BSs on a regular hexagonal lattice wherein the cooperation tessellates the 2-D plane into cooperation regions (CRs); specifically, we analyze the impact of the interference between the CRs in the network. Our model accounts realistic propagation conditions, particularly including shadowing. We obtain accurate, closed-form, approximations for the user capacity coverage probability (CCP) and the ergodic capacity at each point within the CR. To provide a network-level analysis, we focus on the locations within each CR with the minimum CCP—“the worst-case point(s)”. The worst-case CCP and/or ergodic capacity can be used in parametric studies for network design. Here, the analysis is applied to obtain the relationship between cell size and CCP and, thereby, the required density of BSs to achieve a chosen target capacity coverage. The analysis also allows for a comparison between different orders of BS cooperation, quantifying the reduced required BS density from higher orders of cooperation. Comprehensive simulations are used to illustrate the accuracy of our analysis, including the approximations used for analytic tractability. [ABSTRACT FROM PUBLISHER]

Efficient optimization techniques are important to manage interference in emerging dense wireless networks. Here, we address interference management through power control as a general utility maximization problem. For the class of utility functions that are concave in the logarithm of the optimization variables, we propose a power control algorithm based on fixed-point iterations. The iterations converge to the globally optimal power vector. One key benefit is that, for a network with N transmitters and a centralized implementation of the power control algorithm, the computational complexity per iteration of the algorithm is \cal O(N^2). When implemented in a distributed fashion and allowing for a signaling complexity of N messages per iteration, the computation complexity is reduced to \cal O(N). We show that the proposed centralized and distributed versions of the algorithm converge to the optimal power vector at a linear rate. Our numerical results suggest that in most instances, the algorithm takes fewer than ten iterations to converge, even fewer if the initialization is close to the optimal power vector. The proposed algorithm is, therefore, very efficient for power control in slowly fading channels. Furthermore, unlike previous works in the literature, the proposed algorithm does not require the objective function to be separable into a sum of individual utilities. As an example, we present results for power control in a two-hop decode-and-forward cooperative relay network and illustrate the performance gains due to interference management. [ABSTRACT FROM AUTHOR]

In recent years, reconfigurable antennas have been sought to improve the performance of multiple-input multiple-output (MIMO) wireless communication systems. Their ability to dynamically reconfigure their radiation pattern adds diversity in a manner that is not possible with fixed antennas. This paper investigates the performance benefits provided by pattern reconfigurable receiving antennas with uniform beam steering capability. Their potential performance is first estimated using simulations, and for the first time, the effect of uniform beam steering on MIMO system performance is evaluated in a real indoor channel using two electrically steerable passive array radiator (ESPAR) antennas. Performance comparison is made against a pair of monopole antennas using a hardware bit error rate (BER) test-bed that incorporates statistical spatial averaging in order to assess performance improvements in a more realistic way, and analyze the effect of antenna diversity on the overall system performance. The MIMO-ESPAR system reduces BER with certain pattern combinations and excels in capacity evaluations. The ESPAR antennas improve the spatially averaged channel capacity by as much as 37% at 10 dB transmit SNR, and gain an additional 1 bit/s/Hz in peak capacity at 10 dB receive SNR from diversity gain alone. These improvements make pattern reconfigurable antennas promising options in MIMO-related applications. [ABSTRACT FROM PUBLISHER]

Abstract: A technique is proposed for the detection of abnormalities (targets) in ultrasound images using little or no a priori information and requiring little operator intervention. The scheme is a combination of the CLEAN algorithm, originally proposed for radio astronomy, and constant false alarm rate (CFAR) processing, as developed for use in radar systems. The CLEAN algorithm identifies areas in the ultrasound image that stand out above a threshold in relation to the background; CFAR techniques allow for an adaptive, semi-automated, selection of the threshold. Neither appears to have been previously used for target detection in ultrasound images and never together in any context. As a first step towards assessing the potential of this method we used a widely used method of simulating B-mode images (Field II). We assumed the use of a 256 element linear array operating at 3.0MHz into a water-like medium containing a density of point scatterers sufficient to simulate a background of fully developed speckle. Spherical targets with diameters ranging from 0.25 to 6.0mm and contrasts ranging from 0 to 12dB relative to the background were used as test objects. Using a contrast-detail analysis, the probability of detection curves indicate these targets can be consistently detected within a speckle background. Our results indicate that the method has considerable promise for the semi-automated detection of abnormalities with diameters greater than a few millimeters, depending on the contrast. [Copyright &y& Elsevier]

Presents information on a study which investigated the effects of mutual coupling between the elements of an adaptive array on direct data domain algorithms. Methods of moments analysis; Effect of mutual coupling; Elimination of mutual coupling; Conclusions.

Utilizes the Cauchy technique for the interpolation and extrapolation of frequency-domain responses. Advantages of the Cauchy method; Determination of the order of the polynomials and its coefficients; Use of total least squares to solve the resulting matrix equation.

Presents a technique based on the Fourier transform for simultaneous extrapolation in the time and frequency domain. Extrapolation based on the discrete Fourier transform; Advantages of time-domain modeling; Drawback of frequency-domain formulations.

Extrapolates time-domain responses from three-dimensional conducting objects that arise in the numerical solution of electromagnetic field problems. Use of the matrix pencil approach; Basic equations; Real part of the frequency response; Total least-squares matrix pencil; Triangle patching of a disk; Early and late-time responses.

It is well accepted that acquiring downlink channel state information in frequency division duplexing (FDD) massive multiple-input multiple-output (MIMO) systems is challenging because of the large overhead in training and feedback. In this paper, we propose a deep generative model (DGM)-based technique to address this challenge. Exploiting the partial reciprocity of uplink and downlink channels, we first estimate the frequency-independent underlying channel parameters, i.e., the magnitudes of path gains, delays, angles-of-arrivals (AoAs) and angles-of-departures (AoDs), via uplink training, since these parameters are common in both uplink and downlink. Then, the frequency-specific underlying channel parameters, specifically, the phase of each propagation path, are estimated via downlink training using a very short training signal. In the first step, we incorporate the underlying distribution of the channel parameters as a prior into our channel estimation algorithm. We use DGMs to learn this distribution. Simulation results indicate that our proposed DGM-based channel estimation technique outperforms, by a large gap, the conventional channel estimation techniques in practical ranges of signal-to-noise ratio (SNR). In addition, a near-optimal performance is achieved using only few downlink pilot measurements. [ABSTRACT FROM AUTHOR]

Hardware calibration is essential to restore the uplink/downlink channel reciprocity for multi-user massive multiple-input multiple-output (MIMO) systems operating in a time division duplexing mode. Unfortunately, due to the associated overhead, calibration cannot be performed frequently; furthermore, any calibration procedure leaves behind a residual mismatch between the uplink and downlink channels. In this paper, we study the effects of these calibration errors on the achievable rates in the downlink of a multi-cell, multi-user, and distributed massive MIMO system. Specifically, we develop accurate, yet simple, lower-bounds on the per-user achievable rate, assuming either zero-forcing (ZF) or matched filtering (MF) are used. We also introduce a performance loss coefficient as a measure of sensitivity of the performance to the calibration errors. Using this measure, we identify the conditions under which ZF precoding is more sensitive to calibration errors than MF. Finally, we consider the robust weighted sum-rate maximization problem to mitigate the degrading effects of non-ideal calibration. Our numerical experiments show that the rate lower-bounds developed in this paper accurately quantify the impacts of non-ideal calibration on performance. Also, the proposed robust beamforming scheme improves the average sum-rate by up to 42% compared with the other available schemes. [ABSTRACT FROM AUTHOR]

This paper quantifies the benefits and limitations of cooperative communications by providing a statistical analysis of the downlink in network multiple-input multiple-output (MIMO) systems. We consider an idealized model where the multiple-antenna base-stations (BSs) are distributed according to a homogeneous Poisson point process and cooperate by forming disjoint clusters. We assume that perfect channel state information is available at the cooperating BSs without any overhead. Multiple single-antenna users are served using zero-forcing beamforming with equal power allocation across the beams. For such a system, we obtain tractable, but accurate, approximations of the signal power and inter-cluster interference power distributions and derive a computationally efficient expression for the achievable per-BS ergodic sum rate using tools from stochastic geometry. This expression allows us to obtain the optimal loading factor, i.e., the ratio between the number of scheduled users and the number of BS antennas, that maximizes the per-BS ergodic sum rate. Further, it allows us to quantify the performance improvement of network MIMO systems as a function of the cooperating cluster size. We show that to perform zero-forcing across the distributed set of BSs within the cluster, the network MIMO system introduces a penalty in received signal power. Along with the inevitable out-of-cluster interference, we show that the per-BS ergodic sum rate of a network MIMO system does not approach that of an isolated cell even at unrealistically large cluster sizes. Nevertheless, network MIMO does provide significant rate improvement as compared to uncoordinated single-cell processing even at relatively modest cluster sizes. [ABSTRACT FROM PUBLISHER]

Detection using a frequency diverse (FD), distributed, radar system is investigated. Distributed sensing systems provide an inherent spatial diversity by viewing a potential target from different aspect angles. By using different frequencies at each platform, a diversity gain is obtained in addition to the advantages of spatial diversity while also avoiding mutual interference. Here, since platforms are distributed spatially, true time delay is used at each platform to align the sample look point in time. Data models for a distributed system with and without frequency diversity are developed. These models are used to analyze the corresponding signal-to-interference-plus-noise ratio (SINR) and probability of detection for the two cases in the context of space-time adaptive processing (STAP). The simulation results presented here illustrate the limitations imposed by mutual interference and the significant benefits of spatial and frequency diversity. [ABSTRACT FROM PUBLISHER]

In the multiuser downlink, power allocation for linear precoders that minimize the sum of mean squared errors under a sum power constraint is a non-convex problem. Many existing algorithms solve an equivalent convex problem in the virtual uplink and apply a transformation based on uplink-downlink duality to find a downlink solution. In this letter, we analyze the optimality criteria for the power allocation subproblem in the virtual uplink, and demonstrate that the optimal solution leads to identical power allocations in the downlink and virtual uplink. We thus extend the known duality results and, importantly, simplify the existing algorithms used for iterative transceiver design. [ABSTRACT FROM PUBLISHER]

Assuming a network of infinite extent, several researchers have analyzed small-cell networks using a Poisson point process (PPP) location model, leading to simple analytic expressions. The general assumption has been that these results apply to finite-area networks as well. However, do the results of infinite-area networks apply to finite-area networks? In this paper, we answer this question by obtaining an accurate approximation for the achievable signal-to-interference-plus-noise ratio (SINR) and user capacity in the downlink of a finite-area network with a fixed number of access points (APs). The APs are uniformly distributed within the area of interest. Our analysis shows that, crucially, the results of infinite-area networks are very different from those for finite-area networks of low-to-medium AP density. Comprehensive simulations are used to illustrate the accuracy of our analysis. For practical values of signal transmit powers and AP densities, the analytic expressions capture the behavior of the system well. As an added benefit, the formulations developed here can be used in parametric studies for network design. Here, the analysis is used to obtain the required number of APs to guarantee a desired target capacity in a finite-area network. [ABSTRACT FROM AUTHOR]

In this paper, we consider molecular communication, with information conveyed in the time of release of molecules. These molecules propagate to the transmitter through a fluid medium, propelled by a positive drift velocity and Brownian motion. The main contribution of this paper is the development of a theoretical foundation for such a communication system; specifically, the additive inverse Gaussian noise (AIGN) channel model. In such a channel, the information is corrupted by noise that follows an IG distribution. We show that such a channel model is appropriate for molecular communication in fluid media. Taking advantage of the available literature on the IG distribution, upper and lower bounds on channel capacity are developed, and a maximum likelihood receiver is derived. Results are presented which suggest that this channel does not have a single quality measure analogous to signal-to-noise ratio in the additive white Gaussian noise channel. It is also shown that the use of multiple molecules leads to reduced error rate in a manner akin to diversity order in wireless communications. Finally, some open problems are discussed that arise from the IG channel model. [ABSTRACT FROM PUBLISHER]

A base-station (BS) equipped with multiple antennas can use its spatial dimensions in three different ways: 1) to serve multiple users, thereby achieving a multiplexing gain; 2) to provide spatial diversity in order to improve user rates; and 3) to null interference in neighboring cells. This paper answers the following question: What is the optimal balance between these three competing benefits? We answer this question in the context of the downlink of a cellular network, where multi-antenna BSs serve multiple single-antenna users using zero-forcing beamforming with equal power assignment, while nulling interference at a subset of out-of-cell users. Any remaining spatial dimensions provide transmit diversity for the scheduled users. Utilizing tools from stochastic geometry, we show that, surprisingly, to maximize the per-BS ergodic sum rate, with an optimal allocation of spatial resources, interference nulling does not provide a tangible benefit. The strategy of avoiding inter-cell interference nulling, reserving some fraction of spatial resources for multiplexing, and using the rest to provide diversity, is already close-to-optimal in terms of the sum-rate. However, interference nulling does bring significant benefit to cell-edge users, particularly when adopting a range-adaptive nulling strategy where the size of the cooperating BS cluster is increased for cell-edge users. [ABSTRACT FROM AUTHOR]

We consider waveform design for colocated multiple-input, multiple-output (MIMO) radar systems where the signal phase is subject to random phase perturbations during propagation. We formulate an iterative algorithm to obtain both waveform parameters and the space-time adaptive weights to maximize the signal-to-interference-plus-noise ratio (SINR). We ensure that the impact of the chosen waveforms on the interference signal is accounted for when modeling the second-order interference statistics. The waveform design technique is then extended to include peak-to-average power constraints. An example of a clutter and target model is provided to show how the optimal waveform design improves radar detection performance in the presence of the signal phase randomization. [ABSTRACT FROM PUBLISHER]