A global convergence criterion for discrete-time multivariable adaptive systems

The paper deals with the basic problem of adjusting a matrix gain in a discrete-time linear multivariable system. The object is to obtain a global convergence criterion, i.e. conditions under which a specified error signal asymptotically approaches zero and other signals in the system remain bounded for arbitrary initial conditions and for any bounded input to the system. It is shown that for a class of up-dating algorithms for the adjustable gain matrix, global convergence is crucially dependent on a transfer matrix G(z) which has a simple block diagram interpretation. When w(z)G(z) is strictly discrete positive real for a scalar w(z) such that w-1(z) is strictly proper with poles and zeros within the unit circle, an augmented error scheme is suggested and is proved to result in global convergence. The solution avoids feeding back a quadratic term as recommended in other schemes for single-input single-output systems.

Systematic Construction of Linear Transform Based Full-Diversity, Rate-One Space-Time Frequency Codes

In this paper, we generalize the existing rate-one space frequency (SF) and space-time frequency (STF) code constructions. The objective of this exercise is to provide a systematic design of full-diversity STF codes with high coding gain. Under this generalization, STF codes are formulated as linear transformations of data. Conditions on these linear transforms are then derived so that the resulting STF codes achieve full diversity and high coding gain with a moderate decoding complexity. Many of these conditions involve channel parameters like delay profile (DP) and temporal correlation. When these quantities are not available at the transmitter, design of codes that exploit full diversity on channels with arbitrary DIP and temporal correlation is considered. Complete characterization of a class of such robust codes is provided and their bit error rate (BER) performance is evaluated. On the other hand, when channel DIP and temporal correlation are available at the transmitter, linear transforms are optimized to maximize the coding gain of full-diversity STF codes. BER performance of such optimized codes is shown to be better than those of existing codes.

Linear time geometrical design rule checker based on quadtree representation of VLSI mask layouts

An efficient geometrical design rule checker is proposed, based on operations on quadtrees, which represent VLSI mask layouts. The time complexity of the design rule checker is O(N), where N is the number of polygons in the mask. A pseudoPascal description is provided of all the important algorithms for geometrical design rule verification.

Time dependence of effective slip on textured hydrophobic surfaces

In this paper, we present results on water flow past randomly textured hydrophobic surfaces with relatively large surface features of the order of 50 µm. Direct shear stress measurements are made on these surfaces in a channel configuration. The measurements indicate that the flow rates required to maintain a shear stress value vary substantially with water immersion time. At small times after filling the channel with water, the flow rates are up to 30% higher compared with the reference hydrophilic surface. With time, the flow rate gradually decreases and in a few hours reaches a value that is nearly the same as the hydrophilic case. Calculations of the effective slip lengths indicate that it varies from about 50 µm at small times to nearly zero or “no slip” after a few hours. Large effective slip lengths on such hydrophobic surfaces are known to be caused by trapped air pockets in the crevices of the surface. In order to understand the time dependent effective slip length, direct visualization of trapped air pockets is made in stationary water using the principle of total internal reflection of light at the water-air interface of the air pockets. These visualizations indicate that the number of bright spots corresponding to the air pockets decreases with time. This type of gradual disappearance of the trapped air pockets is possibly the reason for the decrease in effective slip length with time in the flow experiments. From the practical point of usage of such surfaces to reduce pressure drop, say, in microchannels, this time scale of the order of 1 h for the reduction in slip length would be very crucial. It would ultimately decide the time over which the surface can usefully provide pressure drop reductions. ©2009 American Institute of Physics

Multi Pattern Dynamic Time Warping For Automatic Speech Recognition

We are addressing the problem of jointly using multiple noisy speech patterns for automatic speech recognition (ASR), given that they come from the same class. If the user utters a word K times, the ASR system should try to use the information content in all the K patterns of the word simultaneously and improve its speech recognition accuracy compared to that of the single pattern based speech recognition. T address this problem, recently we proposed a Multi Pattern Dynamic Time Warping (MPDTW) algorithm to align the K patterns by finding the least distortion path between them. A Constrained Multi Pattern Viterbi algorithm was used on this aligned path for isolated word recognition (IWR). In this paper, we explore the possibility of using only the MPDTW algorithm for IWR. We also study the properties of the MPDTW algorithm. We show that using only 2 noisy test patterns (10 percent burst noise at -5 dB SNR) reduces the noisy speech recognition error rate by 37.66 percent when compared to the single pattern recognition using the Dynamic Time Warping algorithm.

Analysis of randomly time varying systems by gaussian closure technique

The Gaussian probability closure technique is applied to study the random response of multidegree of freedom stochastically time varying systems under non-Gaussian excitations. Under the assumption that the response, the coefficient and the excitation processes are jointly Gaussian, deterministic equations are derived for the first two response moments. It is further shown that this technique leads to the best Gaussian estimate in a minimum mean square error sense. An example problem is solved which demonstrates the capability of this technique for handling non-linearity, stochastic system parameters and amplitude limited responses in a unified manner. Numerical results obtained through the Gaussian closure technique compare well with the exact solutions.

The effects of sliding velocity and sliding time on nanocrystalline tribolayer development and properties in copper

The growth of the nanocrystalline tribolayer produced in oxygen free high conductivity copper after sliding against 440C stainless steel was studied. Tests were conducted on a pin-on-disk tribometer at sliding velocities of 0.05 and 1.0 m/s and sliding times of 0.1 to 10,000 s. Subsurface deformation and the growth of the tribolayer as a function of time were studied with the use of transmission electron microscopy and ion induced secondary electron microscopy. A continuous nanocrystalline tribolayer was produced after as little as 10 s of sliding at both sliding velocities. The tribolayer produced by sliding at 0.05 m/s continued to grow at sliding times up to 10,000 s and developed texture. Dynamic recrystallization of the tribolayer at a sliding velocity of 1.0 m/s inhibited the growth of a continuous anocrystalline tribolayer.

Influence of Solvent on Photoinduced Electron-Transfer Reaction: Time-Resolved Resonance Raman Study

Time-resolved resonance Raman spectroscopy (TR3) has been used to study the effect of solvent polarity on the mechanism and nature of intermediates formed in photoinduced electron-transfer reaction between triplet flouranil ((FL)-F-3) and tetramethylbenzene (TMB). Comparison of the TR3 spectra in polar, nonpolar, and medium polar media suggests that formation of radical anion due to electron-transfer reaction between (FL)-F-3 and TMB is favored in more polar solvents, whereas ketyl radical formation is more favored in less polar media. Compared to ketyl radical, the extent of radical anion formation is negligible in nonpolar solvents. Therefore, it is inferred that in nonpolar media ketyl radical is mainly generated by hydrogen-transfer reaction in the encounter complex between (FL)-F-3 and TMB. In solvents of medium polarity, the ion-pair decay leads to the formation of both ketyl radical and ketyl radical formed from the encounter between triplet state and the donor. Thus, competition between the formation of ketyl radical and ion pair is influenced by the solvent polarity. The nature of the ion pair in different solvent polarity has been investigated from the changes observed in the vibrational frequency of (fluoranil) FL part of the complex.

Space-Time Codes Achieving the DMD Tradeoff of the MIMO-ARQ Channel

For the quasi-static, Rayleigh-fading multiple-input multiple-output (MIMO) channel with n(t) transmit and n(r) receive antennas, Zheng and Tse showed that there exists a fundamental tradeoff between diversity and spatial-multiplexing gains, referred to as the diversity-multiplexing gain (D-MG) tradeoff. Subsequently, El Gamal, Caire, and Damen considered signaling across the same channel using an L-round automatic retransmission request (ARQ) protocol that assumes the presence of a noiseless feedback channel capable of conveying one bit of information per use of the feedback channel. They showed that given a fixed number L of ARQ rounds and no power control, there is a tradeoff between diversity and multiplexing gains, termed the diversity-multiplexing-delay (DMD) tradeoff. This tradeoff indicates that the diversity gain under the ARQ scheme for a particular information rate is considerably larger than that obtainable in the absence of feedback. In this paper, a set of sufficient conditions under which a space-time (ST) code will achieve the DMD tradeoff is presented. This is followed by two classes of explicit constructions of ST codes which meet these conditions. Constructions belonging to the first class achieve minimum delay and apply to a broad class of fading channels whenever n(r) >= n(t) and either L/n(t) or n(t)kslashL. The second class of constructions do not achieve minimum delay, but do achieve the DMD tradeoff of the fading channel for all statistical descriptions of the channel and for all values of the parameters n(r,) n(t,) L.