Nonlinear phenomena in thermoacoustics: A comparison between single-mode and multi-mode methods

Nonlinear analysis of thermoacoustic instability is essential for prediction of frequencies and amplitudes of limit cycles. In frequency domain analyses, a quasi-linear transfer function between acoustic velocity and heat release rate perturbations, called the flame describing function (FDF), is obtained from a flame model or experiments. The FDF is a function of the frequency and amplitude of velocity perturbations but only contains the heat release response at the forcing frequency. While the gain and phase of the FDF provide insight into the nonlinear dynamics of the system, the accuracy of its predictions remains to be verified for different types of nonlinearity. In time domain analyses, the governing equations of the fully coupled problem are solved to find the time evolution of the system. One method is to discretize the governing equations using a suitable basis, such as the natural acoustic modes of the system. The number of modes used in the discretization alters the accuracy of the solution. In our previous work we have shown that predictions using the FDF are almost exactly the same as those obtained from the time-domain using only one mode for the discretization. We call this the single-mode method. In this paper we compare results from the single-mode and multi-mode methods, applied to a thermoacoustic system of a premixed flame in a tube. For some cases, the results differ greatly in both amplitude as well as frequency content. This study shows that the contribution from higher and subharmonics to the nonlinear dynamics can be significant and must be considered for an accurate and comprehensive analysis of thermoacoustic systems. Hence multi-mode simulations are necessary, and the single-mode method or the FDF may be insufficient to capture some of the complex nonlinear behaviour in fhermoacoustics.

The cross-entropy method for blind multiuser detection

We consider the problem of blind multiuser detection. We adopt a Bayesian approach where unknown parameters are considered random and integrated out. Computing the maximum a posteriori estimate of the input data sequence requires solving a combinatorial optimization problem. We propose here to apply the Cross-Entropy method recently introduced by Rubinstein. The performance of cross-entropy is compared to Markov chain Monte Carlo. For similar Bit Error Rate performance, we demonstrate that Cross-Entropy outperforms a generic Markov chain Monte Carlo method in terms of operation time.

A simple combinatorial method aiding research on single-walled carbon nanotube growth on substrates

Establishing fabrication methods of carbon nanotubes (CNTs) is essential to realize many applications expected for CNTs. Catalytic growth of CNTs on substrates by chemical vapor deposition (CVD) is promising for direct fabrication of CNT devices, and catalyst nanoparticles play a crucial role in such growth. We have developed a simple method called "combinatorial masked deposition (CMD)", in which catalyst particles of a given series of sizes and compositions are formed on a single substrate by annealing gradient catalyst layers formed by sputtering through a mask. CMD enables preparation of hundreds of catalysts on a wafer, growth of single-walled CNTs (SWCNTs), and evaluation of SWCNT diameter distributions by automated Raman mapping in a single day. CMD helps determinations of the CVD and catalyst windows realizing millimeter-tall SWCNT forest growth in 10 min, and of growth curves for a series of catalysts in a single measurement when combined with realtime monitoring. A catalyst library prepared using CMD yields various CNTs, ranging from individuals, networks, spikes, and to forests of both SWCNTs and multi-walled CNTs, and thus can be used to efficiently evaluate self-organized CNT field emitters, for example. The CMD method is simple yet effective for research of CNT growth methods. © 2010 The Japan Society of Applied Physics.

A new method for the acquisition of ultrasonic strain image volumes.

This article presents a new method for acquiring three-dimensional (3-D) volumes of ultrasonic axial strain data. The method uses a mechanically-swept probe to sweep out a single volume while applying a continuously varying axial compression. Acquisition of a volume takes 15-20 s. A strain volume is then calculated by comparing frame pairs throughout the sequence. The method uses strain quality estimates to automatically pick out high quality frame pairs, and so does not require careful control of the axial compression. In a series of in vitro and in vivo experiments, we quantify the image quality of the new method and also assess its ease of use. Results are compared with those for the current best alternative, which calculates strain between two complete volumes. The volume pair approach can produce high quality data, but skillful scanning is required to acquire two volumes with appropriate relative strain. In the new method, the automatic quality-weighted selection of image pairs overcomes this difficulty and the method produces superior quality images with a relatively relaxed scanning technique.

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.