Minimum-Error-Probability CFO Estimation for Multiuser MIMO-OFDM Systems

We consider carrier frequency offset (CFO) estimation in the context of multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems over noisy frequency-selective wireless channels with both single- and multiuser scenarios. We conceived a new approach for parameter estimation by discretizing the continuous-valued CFO parameter into a discrete set of bins and then invoked detection theory, analogous to the minimum-bit-error-ratio optimization framework for detecting the finite-alphabet received signal. Using this radical approach, we propose a novel CFO estimation method and study its performance using both analytical results and Monte Carlo simulations. We obtain expressions for the variance of the CFO estimation error and the resultant BER degradation with the single- user scenario. Our simulations demonstrate that the overall BER performance of a MIMO-OFDM system using the proposed method is substantially improved for all the modulation schemes considered, albeit this is achieved at increased complexity.

Weakly corrected numerical solutions to stochastically driven nonlinear dynamical systems

A method to weakly correct the solutions of stochastically driven nonlinear dynamical systems, herein numerically approximated through the Eule-Maruyama (EM) time-marching map, is proposed. An essential feature of the method is a change of measures that aims at rendering the EM-approximated solution measurable with respect to the filtration generated by an appropriately defined error process. Using Ito's formula and adopting a Monte Carlo (MC) setup, it is shown that the correction term may be additively applied to the realizations of the numerically integrated trajectories. Numerical evidence, presently gathered via applications of the proposed method to a few nonlinear mechanical oscillators and a semi-discrete form of a 1-D Burger's equation, lends credence to the remarkably improved numerical accuracy of the corrected solutions even with relatively large time step sizes. (C) 2015 Elsevier Inc. All rights reserved.

Discovering compressing serial episodes from event sequences

Most pattern mining methods yield a large number of frequent patterns, and isolating a small relevant subset of patterns is a challenging problem of current interest. In this paper, we address this problem in the context of discovering frequent episodes from symbolic time-series data. Motivated by the Minimum Description Length principle, we formulate the problem of selecting relevant subset of patterns as one of searching for a subset of patterns that achieves best data compression. We present algorithms for discovering small sets of relevant non-redundant episodes that achieve good data compression. The algorithms employ a novel encoding scheme and use serial episodes with inter-event constraints as the patterns. We present extensive simulation studies with both synthetic and real data, comparing our method with the existing schemes such as GoKrimp and SQS. We also demonstrate the effectiveness of these algorithms on event sequences from a composable conveyor system; this system represents a new application area where use of frequent patterns for compressing the event sequence is likely to be important for decision support and control.