Jamming Resistant Receivers for Massive MIMO

We design jamming resistant receivers to enhance the robustness of a massive MIMO uplink channel against jamming. In the pilot phase, we estimate not only the desired channel, but also the jamming channel by exploiting purposely unused pilot sequences. The jamming channel estimate is used to construct the linear receive filter to reduce impact that jamming has on the achievable rates. The performance of the proposed scheme is analytically and numerically evaluated. These results show that the proposed scheme greatly improves the rates, as compared to conventional receivers. Moreover, the proposed schemes still work well with stronger jamming power.Comment: Accepted in the 42nd IEEE Int. Conf. Acoust., Speech, and Signal Process. (ICASSP2017

Self-consistent theory of large amplitude collective motion: Applications to approximate quantization of non-separable systems and to nuclear physics

The goal of the present account is to review our efforts to obtain and apply a ``collective'' Hamiltonian for a few, approximately decoupled, adiabatic degrees of freedom, starting from a Hamiltonian system with more or many more degrees of freedom. The approach is based on an analysis of the classical limit of quantum-mechanical problems. Initially, we study the classical problem within the framework of Hamiltonian dynamics and derive a fully self-consistent theory of large amplitude collective motion with small velocities. We derive a measure for the quality of decoupling of the collective degree of freedom. We show for several simple examples, where the classical limit is obvious, that when decoupling is good, a quantization of the collective Hamiltonian leads to accurate descriptions of the low energy properties of the systems studied. In nuclear physics problems we construct the classical Hamiltonian by means of time-dependent mean-field theory, and we transcribe our formalism to this case. We report studies of a model for monopole vibrations, of $^{28}$Si with a realistic interaction, several qualitative models of heavier nuclei, and preliminary results for a more realistic approach to heavy nuclei. Other topics included are a nuclear Born-Oppenheimer approximation for an {\em ab initio} quantum theory and a theory of the transfer of energy between collective and non-collective degrees of freedom when the decoupling is not exact. The explicit account is based on the work of the authors, but a thorough survey of other work is included.Comment: 203 pages, many figure

Real-Time 6DOF Pose Relocalization for Event Cameras with Stacked Spatial LSTM Networks

We present a new method to relocalize the 6DOF pose of an event camera solely based on the event stream. Our method first creates the event image from a list of events that occurs in a very short time interval, then a Stacked Spatial LSTM Network (SP-LSTM) is used to learn the camera pose. Our SP-LSTM is composed of a CNN to learn deep features from the event images and a stack of LSTM to learn spatial dependencies in the image feature space. We show that the spatial dependency plays an important role in the relocalization task and the SP-LSTM can effectively learn this information. The experimental results on a publicly available dataset show that our approach generalizes well and outperforms recent methods by a substantial margin. Overall, our proposed method reduces by approx. 6 times the position error and 3 times the orientation error compared to the current state of the art. The source code and trained models will be released.Comment: 7 pages, 5 figure

Multivariate texture discrimination based on geodesics to class centroids on a generalized Gaussian Manifold

A texture discrimination scheme is proposed wherein probability distributions are deployed on a probabilistic manifold for modeling the wavelet statistics of images. We consider the Rao geodesic distance (GD) to the class centroid for texture discrimination in various classification experiments. We compare the performance of GD to class centroid with the Euclidean distance in a similar context, both in terms of accuracy and computational complexity. Also, we compare our proposed classification scheme with the k-nearest neighbor algorithm. Univariate and multivariate Gaussian and Laplace distributions, as well as generalized Gaussian distributions with variable shape parameter are each evaluated as a statistical model for the wavelet coefficients. The GD to the centroid outperforms the Euclidean distance and yields superior discrimination compared to the k-nearest neighbor approach

Two novel evolutionary formulations of the graph coloring problem

We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such orientations as individuals and evolves them with the aid of evolutionary operators that are very heavily based on the structure of the graph and its acyclic orientations. The second formulation, unlike the first one, does not tackle one graph at a time, but rather aims at evolving a `program' to color all graphs belonging to a class whose members all have the same number of nodes and other common attributes. The heuristics that result from these formulations have been tested on some of the Second DIMACS Implementation Challenge benchmark graphs, and have been found to be competitive when compared to the several other heuristics that have also been tested on those graphs.Comment: To appear in Journal of Combinatorial Optimizatio