Effect of channel aging on the sum rate of uplink massive MIMO systems

This paper investigates the achievable sum-rate of uplink massive multiple-input multiple-output (MIMO) systems considering a practical channel impairment, namely, aged channel state information (CSI). Taking into account both maximum ratio combining (MRC) and zero-forcing (ZF) receivers at the base station, we present tight closed-form lower bounds on the sum-rate for both receivers, which provide efficient means to evaluate the sum-rate of the system. More importantly, we characterize the impact of channel aging on the power scaling law. Specifically, we show that the transmit power of each user can be scaled down by 1/√(M), which indicates that aged CSI does not affect the power scaling law; instead, it causes only a reduction on the sum rate by reducing the effective signal-to-interference-and-noise ratio (SINR).

Achievable sum-rate of multiuser massive MIMO downlink in ricean fading channels

We investigate the achievable ergodic sum-rate of multi-user multiple-input multiple-output systems in Ricean fading channels. We first derive a lower bound on the average signal-to-leakage-and-noise ratio by utilizing the Mullen's inequality, which is then used to analyze the effect of channel mean information on the achievable sum-rate. With these results, a novel statistical-eigenmode space-division multipleaccess downlink transmission scheme is proposed. For this scheme, we derive an exact closed-form expression for the achievable ergodic sum-rate. Our results show that the achievable ergodic sum-rate converges to a saturation value in the high signal-to-noise ratio (SNR) region and reaches to a lower limit value in the lower Ricean K-factor range. In addition, we present tractable upper and lower bounds, which are shown to be tight for any SNR and Ricean K-factor value. Finally, the theoretical analysis is validated via numerical simulations.

Finite Sampling Exponential Bounds

Thesis (Ph.D.)--University of Washington, 2016-08

When the total is more than the sum of parts : infrastructure complementarities

Este trabajo muestra evidencia sobre la complementariedad en la infraestructura y la magnitud de sus impactos en los indicadores sociales de hogares peruanos (nivel de ingresos, los gastos y la capacidad de ahorro). Con el fin de probar la hipótesis, se evalúa el impacto para tener acceso a cada uno de los servicios básicos en las variables que reflejan las condiciones de los hogares peruanos. El conjunto de datos consiste en la información obtenida a partir de la Encuesta Nacional de Hogares (ENAHO) para 2006 y 2013, con el objetivo de la comparación de los efectos entre los beneficiarios de la infraestructura y no beneficiarios, y utilizando metodologías como la propensión a juego Score al emparejar las doble diferencias. Los variables de infraestructura obtenidos a partir de la ENAHO son el acceso al agua de los hogares, saneamiento, electricidad y telecomunicaciones. Los resultados demuestran efectos positivos en los aspectos complementarios de infraestructura para los hogares peruanos, en el sentido que beneficia de tener más utilidades de juntas (2, 3 o 4) son ventajas individuales de la recapitulación mayor que de cada utilidad

State sum models for quantum gravity

This paper reviews the construction of quantum field theory on a 4-dimensional spacetime by combinatorial methods, and discusses the recent developments in the direction of a combinatorial construction of quantum gravity.

Exact Solution of Bayes and Minimax Change-Detection Problems

The challenge of detecting a change in the distribution of data is a sequential decision problem that is relevant to many engineering solutions, including quality control and machine and process monitoring. This dissertation develops techniques for exact solution of change-detection problems with discrete time and discrete observations. Change-detection problems are classified as Bayes or minimax based on the availability of information on the change-time distribution. A Bayes optimal solution uses prior information about the distribution of the change time to minimize the expected cost, whereas a minimax optimal solution minimizes the cost under the worst-case change-time distribution. Both types of problems are addressed. The most important result of the dissertation is the development of a polynomial-time algorithm for the solution of important classes of Markov Bayes change-detection problems. Existing techniques for epsilon-exact solution of partially observable Markov decision processes have complexity exponential in the number of observation symbols. A new algorithm, called constellation induction, exploits the concavity and Lipschitz continuity of the value function, and has complexity polynomial in the number of observation symbols. It is shown that change-detection problems with a geometric change-time distribution and identically- and independently-distributed observations before and after the change are solvable in polynomial time. Also, change-detection problems on hidden Markov models with a fixed number of recurrent states are solvable in polynomial time. A detailed implementation and analysis of the constellation-induction algorithm are provided. Exact solution methods are also established for several types of minimax change-detection problems. Finite-horizon problems with arbitrary observation distributions are modeled as extensive-form games and solved using linear programs. Infinite-horizon problems with linear penalty for detection delay and identically- and independently-distributed observations can be solved in polynomial time via epsilon-optimal parameterization of a cumulative-sum procedure. Finally, the properties of policies for change-detection problems are described and analyzed. Simple classes of formal languages are shown to be sufficient for epsilon-exact solution of change-detection problems, and methods for finding minimally sized policy representations are described.

On the extension complexity of combinatorial polytopes

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete problems including subset-sum and three dimensional matching. We then obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cubic planar graphs.

Measurement of the doubly-polarized He3→(γ→,n)pp reaction at 16.5 MeV and its implications for the GDH sum rule

We report new measurements of the double-polarized photodisintegration of 3He at an incident photon energy of 16.5 MeV, carried out at the High Intensity γ-ray Source (HIγS) facility located at Triangle Universities Nuclear Laboratory (TUNL). The spin-dependent double-differential cross sections and the contribution from the three-body channel to the Gerasimov–Drell–Hearn (GDH) integrand were extracted and compared with the state-of-the-art three-body calculations. The calculations, which include the Coulomb interaction and are in good agreement with the results of previous measurements at 12.8 and 14.7 MeV, deviate from the new cross section results at 16.5 MeV. The GDH integrand was found to be about one standard deviation larger than the maximum value predicted by the theories.

Branching dendrites with resonant membrane: a "sum-over-trips" approach

Dendrites form the major components of neurons. They are complex branching structures that receive and process thousands of synaptic inputs from other neurons. It is well known that dendritic morphology plays an important role in the function of dendrites. Another important contribution to the response characteristics of a single neuron comes from the intrinsic resonant properties of dendritic membrane. In this paper we combine the effects of dendritic branching and resonant membrane dynamics by generalising the "sum-over-trips" approach [Abbott, L.F., Fahri, E., Gutmann, S.: The path integral for dendritic trees. Biological Cybernetics 66, 49--60 (1991)]. To illustrate how this formalism can shed light on the role of architecture and resonances in determining neuronal output we consider dual recording and reconstruction data from a rat CA1 hippocampal pyramidal cell. Specifically we explore the way in which an $I_{h}$ current contributes to a voltage overshoot at the soma.

Extremal graphs for the sum of the two largest signless Laplacian eigenvalues

Let G be a simple graph on n vertices and e(G) edges. Consider the signless Laplacian, Q(G) = D + A, where A is the adjacency matrix and D is the diagonal matrix of the vertices degree of G. Let q1(G) and q2(G) be the first and the second largest eigenvalues of Q(G), respectively, and denote by S+ n the star graph with an additional edge. It is proved that inequality q1(G)+q2(G) e(G)+3 is tighter for the graph S+ n among all firefly graphs and also tighter to S+ n than to the graphs Kk _ Kn−k recently presented by Ashraf, Omidi and Tayfeh-Rezaie. Also, it is conjectured that S+ n minimizes f(G) = e(G) − q1(G) − q2(G) among all graphs G on n vertices.