Language model combination and adaptation using weighted finite state transducers

In speech recognition systems language model (LMs) are often constructed by training and combining multiple n-gram models. They can be either used to represent different genres or tasks found in diverse text sources, or capture stochastic properties of different linguistic symbol sequences, for example, syllables and words. Unsupervised LM adaptation may also be used to further improve robustness to varying styles or tasks. When using these techniques, extensive software changes are often required. In this paper an alternative and more general approach based on weighted finite state transducers (WFSTs) is investigated for LM combination and adaptation. As it is entirely based on well-defined WFST operations, minimum change to decoding tools is needed. A wide range of LM combination configurations can be flexibly supported. An efficient on-the-fly WFST decoding algorithm is also proposed. Significant error rate gains of 7.3% relative were obtained on a state-of-the-art broadcast audio recognition task using a history dependently adapted multi-level LM modelling both syllable and word sequences. ©2010 IEEE.

Fixed-lag blind equalization and sequence estimation in digital communications systems using sequential importance sampling

We present methods for fixed-lag smoothing using Sequential Importance sampling (SIS) on a discrete non-linear, non-Gaussian state space system with unknown parameters. Our particular application is in the field of digital communication systems. Each input data point is taken from a finite set of symbols. We represent transmission media as a fixed filter with a finite impulse response (FIR), hence a discrete state-space system is formed. Conventional Markov chain Monte Carlo (MCMC) techniques such as the Gibbs sampler are unsuitable for this task because they can only perform processing on a batch of data. Data arrives sequentially, so it would seem sensible to process it in this way. In addition, many communication systems are interactive, so there is a maximum level of latency that can be tolerated before a symbol is decoded. We will demonstrate this method by simulation and compare its performance to existing techniques.

First real-time experimental demonstrations of 11.25Gb/s optical OFDMA PONs with adaptive dynamic bandwidth allocation.

End-to-end real-time experimental demonstrations are reported, for the first time, of aggregated 11.25Gb/s over 26.4km standard SMF, optical orthogonal frequency division multiple access (OOFDMA) PONs with adaptive dynamic bandwidth allocation (DBA). The demonstrated intensity-modulation and direct-detection (IMDD) OOFDMA PON system consists of two optical network units (ONUs), each of which employs a DFB-based directly modulated laser (DML) or a VCSEL-based DML for modulating upstream signals. Extensive experimental explorations of dynamic OOFDMA PON system properties are undertaken utilizing identified optimum DML operating conditions. It is shown that, for simultaneously achieving acceptable BERs for all upstream signals, the OOFDMA PON system has a >3dB dynamic ONU launch power variation range, and the BER performance of the system is insusceptible to any upstream symbol offsets slightly smaller than the adopted cyclic prefix. In addition, experimental results also indicate that, in addition to maximizing the aggregated system transmission capacity, adaptive DBA can also effectively reduce imperfections in transmission channel properties without affecting signal bit rates offered to individual ONUs.

Mismatched shaping schemes for bit-interleaved coded modulation

We consider bit-interleaved coded modulation (BICM) schemes where, instead of the true bit or symbol probabilities and the constellation used at the transmitter, the decoder uses arbitrary probabilities or reference constellations. We study the corresponding low- and high- signal-to-noise-ratio regimes and show that even in the presence of this extra sources of mismatch, BICM has a negligible penalty with respect to coded modulation. © 2012 IEEE.

Boundary integral technique for the numerical modelling of the air flow for the Aaberg exhaust system

A boundary integral technique has been developed for the numerical simulation of the air flow for the Aaberg exhaust system. For the steady, ideal, irrotational air flow induced by a jet, the air velocity is an analytical function. The solution of the problem is formulated in the form of a boundary integral equation by seeking the solution of a mixed boundary-value problem of an analytical function based on the Riemann-Hilbert technique. The boundary integral equation is numerically solved by converting it into a system of linear algebraic equations, which are solved by the process of the Gaussian elimination. The air velocity vector at any point in the solution domain is then computed from the air velocity on the boundary of the solution domains.

Kernelized sorting

Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we develop an approach which is able to perform matching by requiring a similarity measure only within each of the classes. This is achieved by maximizing the dependency between matched pairs of observations by means of the Hilbert Schmidt Independence Criterion. This problem can be cast as one of maximizing a quadratic assignment problem with special structure and we present a simple algorithm for finding a locally optimal solution.

Distribution matching for transduction

Many transductive inference algorithms assume that distributions over training and test estimates should be related, e.g. by providing a large margin of separation on both sets. We use this idea to design a transduction algorithm which can be used without modification for classification, regression, and structured estimation. At its heart we exploit the fact that for a good learner the distributions over the outputs on training and test sets should match. This is a classical two-sample problem which can be solved efficiently in its most general form by using distance measures in Hilbert Space. It turns out that a number of existing heuristics can be viewed as special cases of our approach.

Contraction and observer design on cones

We consider the problem of positive observer design for positive systems defined on solid cones in Banach spaces. The design is based on the Hilbert metric and convergence properties are analyzed in the light of the Birkhoff theorem. Two main applications are discussed: positive observers for systems defined in the positive orthant, and positive observers on the cone of positive semi-definite matrices with a view on quantum systems. © 2011 IEEE.