Blind equalization and sequence estimation using Markov chain Monte Carlo methods

This paper discusses the problem of restoring a digital input signal that has been degraded by an unknown FIR filter in noise, using the Gibbs sampler. A method for drawing a random sample of a sequence of bits is presented; this is shown to have faster convergence than a scheme by Chen and Li, which draws bits independently. ©1998 IEEE.

A neuro-inspired method for data rate limited feedback control

The nervous system implements a networked control system in which the plants take the form of limbs, the controller is the brain, and neurons form the communication channels. Unlike standard networked control architectures, there is no periodic sampling, and the fundamental units of communication contain little numerical information. This paper describes a novel communication channel, modeled after spiking neurons, in which the transmitter integrates an input signal and sends out a spike when the integral reaches a threshold value. The reciever then filters the sequence of spikes to approximately reconstruct the input signal. It is shown that for appropriate choices of channel parameters, stable feedback control over these spiking channels is possible. Furthermore, good tracking performance can be achieved. The data rate of the channel increases linearly with the size of the inputs. Thus, when placed in a feedback loop, small loop gains imply a low data rate. ©2010 IEEE.

Predictive coding and the slowness principle: an information-theoretic approach.

Understanding the guiding principles of sensory coding strategies is a main goal in computational neuroscience. Among others, the principles of predictive coding and slowness appear to capture aspects of sensory processing. Predictive coding postulates that sensory systems are adapted to the structure of their input signals such that information about future inputs is encoded. Slow feature analysis (SFA) is a method for extracting slowly varying components from quickly varying input signals, thereby learning temporally invariant features. Here, we use the information bottleneck method to state an information-theoretic objective function for temporally local predictive coding. We then show that the linear case of SFA can be interpreted as a variant of predictive coding that maximizes the mutual information between the current output of the system and the input signal in the next time step. This demonstrates that the slowness principle and predictive coding are intimately related.

Adaptive combustion instability control with saturation

The control of a class of combustion systems, suceptible to damage from self-excited combustion oscillations, is considered. An adaptive stable controller, called Self-Tuning Regulator (STR), has recently been developed, which meets the apparently contradictory challenge of relying as little as possible on a particular combustion model while providing some guarantee that the controller will cause no harm. The controller injects some fuel unsteadily into the burning region, thereby altering the heat release, in response to an input signal detecting the oscillation. This paper focuses on an extension of the STR design, when, due to stringent emission requirements and to the danger of flame extension, the amount of fuel used for control is limited in amplitude. A Lyapunov stability analysis is used to prove the stability of the modified STR when the saturation constraint is imposed. The practical implementation of the modified STR remains straightforward, and simulation results, based on the nonlinear premixed flame model developed by Dowling, show that in the presence of a saturation constraint, the self-excited oscillations are damped more rapidly with the modified STR than with the original STR. © 2001 by S. Evesque. Published by the American Institute of Aeronautics and Astronautics, Inc.

Multi-channel signal separation

The separation of independent sources from mixed observed data is a fundamental and challenging problem. In many practical situations, observations may be modelled as linear mixtures of a number of source signals, i.e. a linear multi-input multi-output system. A typical example is speech recordings made in an acoustic environment in the presence of background noise and/or competing speakers. Other examples include EEG signals, passive sonar applications and cross-talk in data communications. In this paper, we propose iterative algorithms to solve the n × n linear time invariant system under two different constraints. Some existing solutions for 2 × 2 systems are reviewed and compared.

Recurrent input transformations for Hidden Markov models

This paper presents a new architecture which integrates recurrent input transformations (RIT) and continuous density HMMs. The basic HMM structure is extended to accommodate recurrent neural networks which transform the input observations before they enter the Gaussian output distributions associated with the states of the HMM. During training the parameters of both HMM and RIT are simultaneously optimized according to the Maximum Mutual Information (MMI) criterion. Results are presented for the E-set recognition task which demonstrate the ability of recurrent input transformations to exploit longer term correlations in the speech signal and to give improved discrimination.

Simple adaptively modulated optical OFDM modems using subcarrier modulation with input/output reconfigurability

Three novel designs of adaptively modulated optical orthogonal frequency division multiplexing modems using subcarrier modulation (AMOOFDM-SCM) are proposed, for the first time, each of which requires a single IFFT/FFT operation. These designs has a number of salient advantages including a significantly simplified modem configuration due to the involvement of a single IFFT/FFT operation, input/output reconfigurability, dynamic bandwidth allocation capability, cost reduction and system flexibility and performance robustness to variations in transmission link conditions. Investigations show that these three modems are capable of supporting >60Gb/s AMOOFDM-SCM signal transmission over 20km, 40km and 60km single-mode fibre-based intensity modulation and direct detection transmission links without optical amplification and chromatic dispersion compensation. Copyright © 2010 The authors.

Dynamical structure function identifiability conditions enabling signal structure reconstruction

Networks of controlled dynamical systems exhibit a variety of interconnection patterns that could be interpreted as the structure of the system. One such interpretation of system structure is a system's signal structure, characterized as the open-loop causal dependencies among manifest variables and represented by its dynamical structure function. Although this notion of structure is among the weakest available, previous work has shown that if no a priori structural information is known about the system, not even the Boolean structure of the dynamical structure function is identifiable. Consequently, one method previously suggested for obtaining the necessary a priori structural information is to leverage knowledge about target specificity of the controlled inputs. This work extends these results to demonstrate precisely the a priori structural information that is both necessary and sufficient to reconstruct the network from input-output data. This extension is important because it significantly broadens the applicability of the identifiability conditions, enabling the design of network reconstruction experiments that were previously impossible due to practical constraints on the types of actuation mechanisms available to the engineer or scientist. The work is motivated by the proteomics problem of reconstructing the Per-Arnt-Sim Kinase pathway used in the metabolism of sugars. © 2012 IEEE.