Energy Efficiency and Asymptotic Performance Evaluation of Beamforming Structures in Doubly Massive MIMO mmWave Systems

Future cellular systems based on the use of millimeter waves will heavily rely on the use of antenna arrays both at the transmitter and at the receiver. For complexity reasons and energy consumption issues, fully digital precoding and postcoding structures may turn out to be unfeasible, and thus suboptimal structures, making use of simplified hardware and a limited number of RF chains, have been investigated. This paper considers and makes a comparative assessment, both from a spectral efficiency and energy efficiency point of view, of several suboptimal precoding and postcoding beamforming structures for a cellular multiuser MIMO (MU-MIMO) system with large number of antennas. Analytical formulas for the asymptotic achievable spectral efficiency and for the global energy efficiency of several beamforming structures are derived in the large number of antennas regime. Using the most recently available data for the energy consumption of phase shifters and switches, we show that fully-digital beamformers may actually achieve a larger energy efficiency than lower-complexity solutions, as well as that low-complexity beam-steering purely analog beamforming may in some cases represent a good performance-complexity trade-off solution.Comment: Submitted to IEEE Transactions on Green Communications and Networkin

Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multi-Channel Wireless Networks with Low Complexity: A Practical Greedy Scheduling Policy

In this paper, we focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in fourth generation (4G) OFDM-based cellular networks. Our goal is to design practical scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity. While a class of $O(n^{2.5} \log n)$-complexity hybrid scheduling policies are recently developed to guarantee both rate-function delay optimality (in the many-channel many-user asymptotic regime) and throughput optimality (in the general non-asymptotic setting), their practical complexity is typically high. To address this issue, we develop a simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with a \lower complexity $2n^2+2n$, and rigorously prove that D-SSG not only achieves throughput optimality, but also guarantees near-optimal asymptotic delay performance. Specifically, we show that the rate-function attained by D-SSG for any delay-violation threshold $b$, is no smaller than the maximum achievable rate-function by any scheduling policy for threshold $b-1$. Thus, we are able to achieve a reduction in complexity (from $O(n^{2.5} \log n)$ of the hybrid policies to $2n^2 + 2n$) with a minimal drop in the delay performance. More importantly, in practice, D-SSG generally has a substantially lower complexity than the hybrid policies that typically have a large constant factor hidden in the $O(\cdot)$ notation. Finally, we conduct numerical simulations to validate our theoretical results in various scenarios. The simulation results show that D-SSG not only guarantees a near-optimal rate-function, but also empirically is virtually indistinguishable from delay-optimal policies.Comment: Accepted for publication by the IEEE/ACM Transactions on Networking, February 2014. A preliminary version of this work was presented at IEEE INFOCOM 2013, Turin, Italy, April 201

Traced communication complexity of cellular automata

We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of the central cell will follow a given evolution, by communicating as little as possible between each other. We present some links with classical dynamical concepts, especially equicontinuity, expansiveness, entropy and give the asymptotic communication complexity of most elementary cellular automata.Comment: submitted to TC

Theory of weakly nonlinear self sustained detonations

We propose a theory of weakly nonlinear multi-dimensional self sustained detonations based on asymptotic analysis of the reactive compressible Navier-Stokes equations. We show that these equations can be reduced to a model consisting of a forced, unsteady, small disturbance, transonic equation and a rate equation for the heat release. In one spatial dimension, the model simplifies to a forced Burgers equation. Through analysis, numerical calculations and comparison with the reactive Euler equations, the model is demonstrated to capture such essential dynamical characteristics of detonations as the steady-state structure, the linear stability spectrum, the period-doubling sequence of bifurcations and chaos in one-dimensional detonations and cellular structures in multi- dimensional detonations