Nearest neighbour decoding and pilot-aided channel estimation in stationary Gaussian flat-fading channels

We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbour decoding and pilot-aided channel estimation. In particular, we analyse the behaviour of these achievable rates in the limit as the signal-to-noise ratio (SNR) tends to infinity. We demonstrate that nearest neighbour decoding and pilot-aided channel estimation achieves the capacity pre-logwhich is defined as the limiting ratio of the capacity to the logarithm of SNR as the SNR tends to infinityof non-coherent multiple-input single-output (MISO) flat-fading channels, and it achieves the best so far known lower bound on the capacity pre-log of non-coherent MIMO flat-fading channels. © 2011 IEEE.

Nearest neighbour decoding with pilot-assisted channel estimation for fading multiple-access channels

This paper studies a noncoherent multiple-input multiple-output (MIMO) fading multiple-access channel (MAC). The rate region that is achievable with nearest neighbour decoding and pilot-assisted channel estimation is analysed and the corresponding pre-log region, defined as the limiting ratio of the rate region to the logarithm of the signal-to-noise ratio (SNR) as the SNR tends to infinity, is determined. © 2011 IEEE.

Characterisation and simulation of asphalt road surfaces

Accurate simulation of rolling-tyre vibrations, and the associated noise, requires knowledge of road-surface topology. Full scans of the surface types in common use are, however, not widely available, and are likely to remain so. Ways of producing simulated surfaces from incomplete starting information are thus needed. In this paper, a simulation methodology based solely on line measurements is developed, and validated against a full two-dimensional height map of a real asphalt surface. First the tribological characteristics-asperity height, curvature and nearest-neighbour distributions-of the real surface are analysed. It is then shown that a standard simulation technique, which matches the (isotropic) spectrum and the probability distribution of the height measurements, is unable to reproduce these characteristics satisfactorily. A modification, whereby the inherent granularity of the surface is enforced at the initialisation stage, is introduced, and found to produce simulations whose tribological characteristics are in excellent agreement with the measurements. This method will thus make high-fidelity tyre-vibration calculations feasible for researchers with access to line-scan data only. In addition, the approach to surface tribological characterisation set out here provides a template for efficient cataloguing of road textures, as long as the resulting information can subsequently be used to produce sample realisations. A third simulation algorithm, which successfully addresses this requirement, is therefore also presented. © 2011 Elsevier B.V.

Satellite formation in drop-on-demand printing of polymer solutions

High speed photographic images of jets formed from dilute solutions of polystyrene in diethyl phthalate ejected from a piezoelectric drop-on-demand inkjet head have been analyzed in order to study the formation and distribution of drops as the ligament collapses. Particular attention has been paid to satellite drops, and their relative separation and sizes. The effect of polymer concentration was investigated. The distribution of nearest-neighbour centre spacing between the drops formed from the ligament is better described by a 2-parameter modified gamma distribution than by a Gaussian distribution. There are (at least) two different populations of satellite size relative to the main drop size formed at normal jetting velocities, with ratios of about three between the diameters of the main drop and the successive satellite sizes. The distribution of the differences in drop size between neighbouring drops is close to Gaussian, with a small non-zero mean for low polymer concentrations, which is associated with the conical shape of the ligament prior to its collapse and the formation of satellites. Higher polymer concentrations result in slower jets for the same driving impulse, and also a tendency to form ligaments with a near-constant width. Under these conditions the mean of the distribution of differences in nearest-neighbour drop size was zero.

Properties of tetrahedral amorphous carbon prepared by vacuum arc deposition

The structural, optical, electrical and physical properties of amorphous carbon deposited from the filtered plasma stream of a vacuum arc were investigated. The structure was determined by electron diffraction, neutron diffraction and energy loss spectroscopy and the tetrahedral coordination of the material was confirmed. The measurements gave a nearest neighbour distance of 1.53 Å, a bond angle of 110 and a coordination number of four. A model is proposed in which the compressive stress generated in the film by energetic ion impact produces pressure and temperature conditions lying well inside the region of the carbon phase diagram within which diamond is stable. The model is confirmed by measurements of stress and plasmon energy as a function of ion energy. The model also predicts the formation of sp2-rich materials on the surface owing to stress relaxation and this is confirmed by a study of the surface plasmon energy. Some nuclear magnetic resonance, infrared and optical properties are reported and the behaviour of diodes using tetrahedral amorphous carbon is discussed. © 1991.

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.

In-situ deposition of sparse vertically aligned carbon nanofibres on catalytically activated stainless steel mesh for field emission applications

We report on an inexpensive, facile and industry viable carbon nanofibre catalyst activation process achieved by exposing stainless steel mesh to an electrolyzed metal etchant. The surface evolution of the catalyst islands combines low-rate electroplating and substrate dissolution. The plasma enhanced chemical vapour deposited carbon nanofibres had aspect-ratios > 150 and demonstrated excellent height and crystallographic uniformity with localised coverage. The nanofibres were well-aligned with spacing consistent with the field emission nearest neighbour electrostatic shielding criteria, without the need of any post-growth processing. Nanofibre inclusion significantly reduced the emission threshold field from 4.5 V/μm (native mesh) to 2.5 V/μm and increased the field enhancement factor to approximately 7000. © 2011 Elsevier B.V. All rights reserved.

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.

The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models

We propose a probabilistic model to infer supervised latent variables in the Hamming space from observed data. Our model allows simultaneous inference of the number of binary latent variables, and their values. The latent variables preserve neighbourhood structure of the data in a sense that objects in the same semantic concept have similar latent values, and objects in different concepts have dissimilar latent values. We formulate the supervised infinite latent variable problem based on an intuitive principle of pulling objects together if they are of the same type, and pushing them apart if they are not. We then combine this principle with a flexible Indian Buffet Process prior on the latent variables. We show that the inferred supervised latent variables can be directly used to perform a nearest neighbour search for the purpose of retrieval. We introduce a new application of dynamically extending hash codes, and show how to effectively couple the structure of the hash codes with continuously growing structure of the neighbourhood preserving infinite latent feature space.

Oxygen carrier dispersion in inert packed beds to improve performance in chemical looping combustion

Various packed beds of copper-based oxygen carriers (CuO on Al2O3) were tested over 100 cycles of low temperature (673K) Chemical Looping Combustion (CLC) with H2 as the fuel gas. The oxygen carriers were uniformly mixed with alumina (Al2O3) in order to investigate the level of separation necessary to prevent agglomeration. It was found that a mass ratio of 1:6 oxygen carrier to alumina gave the best performance in terms of stable, repeating hydrogen breakthrough curves over 100 cycles. In order to quantify the average separation achieved in the mixed packed beds, two sphere-packing models were developed. The hexagonal close-packing model assumed a uniform spherical packing structure, and based the separation calculations on a hypergeometric probability distribution. The more computationally intensive full-scale model used discrete element modelling to simulate random packing arrangements governed by gravity and contact dynamics. Both models predicted that average 'nearest neighbour' particle separation drops to near zero for oxygen carrier mass fractions of x≥0.25. For the packed bed systems studied, agglomeration was observed when the mass fraction of oxygen carrier was above this threshold. © 2013 Elsevier B.V.