Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

A polymeric regenerative optical bus for board-level optical interconnections

A scalable polymer waveguide-based regenerative optical bus architecture for use in board-level communications is presented. As a proof-of-principle demonstration, a 4-channel polymer bus formed on a FR4 substrate providing 10 Gb/s/channel data transmission is reported. © 2012 OSA.

Polymer waveguide-based backplanes for board-level optical interconnects

Optical interconnects are increasingly considered for use in high-performance electronic systems. Multimode polymer waveguides are a promising technology for the formation of optical backplane as they enable cost-effective integration of optical links onto standard printed circuit boards. In this paper, two different types of polymer waveguide-based optical backplanes are presented. The first one implements a passive shuffle architecture enabling non-blocking on-board optical interconnection between different cards/modules, while the second one deploys a regenerative bus architecture allowing the interconnection of an arbitrary number of electrical cards over a common optical bus. The polymer materials and the multimode waveguide components used to form the optical backplanes are presented, while details of the interconnection architectures and design of the backplanes are described. Proof-of-principle demonstrators fabricated onto low-cost FR4 substrates, including a 10-card 1 Tb/s-capacity passive shuffle router and 4-channel 3-card polymeric bus modules, are reported and their optical performance characteristics are presented. Low-loss, low-crosstalk on-board interconnection is achieved and error-free (BER10 12) 10 Gb/s communication between different card/module interfaces is demonstrated in both polymeric backplane systems. © 2012 IEEE.

Advanced schemes for optical datacommunications

The demand for high-speed optical links within local-area networks and storage-area networks continues to grow rapidly, with standards under development that demand single-wavelength solutions at data rates of 30 Gb/s and beyond. Robust low-cost schemes are required, with a particular emphasis on multimode-fibre links using optical transceivers based on vertical-cavity surface-emitting lasers. © 2012 IEEE.

Coexistence of high-bit-rate quantum key distribution and data on optical fiber

Quantum key distribution (QKD) uniquely allows distribution of cryptographic keys with security verified by quantum mechanical limits. Both protocol execution and subsequent applications require the assistance of classical data communication channels. While using separate fibers is one option, it is economically more viable if data and quantum signals are simultaneously transmitted through a single fiber. However, noise-photon contamination arising from the intense data signal has severely restricted both the QKD distances and secure key rates. Here, we exploit a novel temporal-filtering effect for noise-photon rejection. This allows high-bit-rate QKD over fibers up to 90 km in length and populated with error-free bidirectional Gb/s data communications. With high-bit rate and range sufficient for important information infrastructures, such as smart cities and 10 Gbit Ethernet, QKD is a significant step closer towards wide-scale deployment in fiber networks.

Mode division multiplexing of modes with the same azimuthal index

The design of an SLM-based mode demultiplexer is discussed and mode division multiplexing is performed using the LP0,1 and LP 0,2 modes, representing the first demonstration to propagate channels on modes with the same azimuthal index. Mode multiplexed transmission over 2 km of 50-μm OM2 fiber demonstrates a modal selectivity of 16 dB and an OSNR penalty of 1.5 dB for the transmission of 2×56 Gb/s QPSK signals. © 2012 IEEE.

Reconstruction of arbitrary biochemical reaction networks: A compressive sensing approach

Reconstruction of biochemical reaction networks (BRN) and genetic regulatory networks (GRN) in particular is a central topic in systems biology which raises crucial theoretical challenges in system identification. Nonlinear Ordinary Differential Equations (ODEs) that involve polynomial and rational functions are typically used to model biochemical reaction networks. Such nonlinear models make the problem of determining the connectivity of biochemical networks from time-series experimental data quite difficult. In this paper, we present a network reconstruction algorithm that can deal with ODE model descriptions containing polynomial and rational functions. Rather than identifying the parameters of linear or nonlinear ODEs characterised by pre-defined equation structures, our methodology allows us to determine the nonlinear ODEs structure together with their associated parameters. To solve the network reconstruction problem, we cast it as a compressive sensing (CS) problem and use sparse Bayesian learning (SBL) algorithms as a computationally efficient and robust way to obtain its solution. © 2012 IEEE.

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.

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

Analysis of interconnected oscillators by dissipativity theory

This paper employs dissipativity theory for the global analysis of limit cycles in particular dynamical systems of possibly high dimension. Oscillators are regarded as open systems that satisfy a particular dissipation inequality. It is shown that this characterization has implications for the global stability analysis of limit cycle oscillations: i) in isolated oscillators, ii) in interconnections of oscillators, and iii) for the global synchrony analysis in interconnections of identical oscillators. © 2007 IEEE.

Feedback mechanisms for global oscillations in Lure systems

The paper presents two mechanisms for global oscillations in feedback systems, based on bifurcations in absolutely stable systems. The external characterization of the oscillators provides the basis for a (energy-based) dissipativity theory for oscillators, thereby opening new possibilities for rigorous stability analysis of high-dimensional systems and interconnected oscillators. © 2004 Elsevier B.V. All rights reserved.

Dissipativity characterization of a class of oscillators and networks of oscillators

This paper uses dissipativity theory to provide the system-theoretic description of a basic oscillation mechanism. Elementary input-output tools are then used to prove the existence and stability of limit cycles in these "oscillators". The main benefit of the proposed approach is that it is well suited for the analysis and design of interconnections, thus providing a valuable mathematical tool for the study of networks of coupled oscillators.

Orthogonal multipulse modulation for 64 Gigabit Fibre Channel

Real-time orthogonal multipulse modulation is demonstrated at 56 Gb/s with transmission over 500 m of single-mode fiber. Up to 2 dBo power budget advantage is predicted relative to alternatives such as PAM4. © 2013 OSA.

Orthogonal multipulse modulation in optical datacommunications

Optical datacommunication links are now required at rates beyond 40 Gb/s. Achieving robust low-cost transmission at these rates necessitates consideration of advanced modulation formats. This paper concentrates on schemes using multiple orthogonal pulses and outlines the advantages relative to alternatives such as multilevel modulation. Recent real-time experimental results at 56 Gb/s are described. © 2013 IEEE.

Orthogonal multipulse modulation for 64 gigabit fibre channel

Real-time orthogonal multipulse modulation is demonstrated at 56 Gb/s with transmission over 500 m of single-mode fiber. Up to 2 dBo power budget advantage is predicted relative to alternatives such as PAM4. © 2013 OSA.