Hot-carrier reliability of 20V MOS transistors in 0.13 μm CMOS technology

This paper presents results of reliability investigation of 20 V N-Drift MOS transistor in 0.13 μm CMOS technology. Due to high performances required for CMOS applications, adding high voltage devices becomes a big challenge to guarantee the reliability criteria. In this context, new reliability approaches are needed. Safe Operating Area are defined for switch, V_ds limited and V_gs limited applications in order to improve circuit designs. For V_ds limited applications, deep doping dose effects in drift area are investigated in correlation to lifetime evaluations based on device parameter shifts under hot carrier stressing. To further determine the amount and locations of hot carriers injections, accurate 2D technological and electrical simulations are performed and permit to select the best compromise between performance and reliability for N-Drift MOS transistor.     

Autoscan: a scan design without external scan inputs or outputs

We propose a design-for-testability technique for synchronous sequential circuits called autoscan. Autoscan uses scan chains similar to conventional scan. However, it gives up the external scan inputs and outputs in order to eliminate the test data volume associated with them. Scan operations under autoscan improve the circuit testability by allowing the circuit state to be modified through shifting. Due to the removal of the scan inputs and outputs, synthesis of scan chains under autoscan does not have to satisfy all the constraints imposed on conventional scan chains. We describe a synthesis procedure for autoscan chains, and demonstrate that autoscan allows us to detect almost all the faults that are detectable using conventional scan. We use random sequences in order to show that sequential test generation is not necessary under autoscan. We also describe a test generation procedure, and discuss the effect of autoscan on fault diagnosis.     

Modelling biological processes under anaerobic conditions through integrating titrimetric and off-gas measurements-applied to EBPR systems.

An innovative method for modelling biological processes under anaerobic conditions is presented and discussed. The method is based on titrimetric and off-gas measurements. Titrimetric data is recorded as the addition rate of hydroxyl ions or protons that is required to maintain pH in a bioreactor at a constant level. An off-gas analysis arrangement measures, among other things, the transfer rate of carbon dioxide. The integration of these signals results in a continuous signal which is solely related to the biological reactions. When coupled with a mathematical model of the biological reactions, the signal allows a detailed characterisation of these reactions, which would otherwise be difficult to achieve. Two applications of the method to the enhanced biological phosphorus removal processes are presented and discussed to demonstrate the principle and effectiveness of the method.     

Fast numerically stable computation of orthogonal Fourier?Mellin moments

An efficient algorithm for the computation of the orthogonal Fourier-Mellin moments (OFMMs) is presented. The proposed method computes the fractional parts of the orthogonal polynomials, which consist of fractional terms, recursively, by eliminating the number of factorial calculations. The recursive computation of the fractional terms makes the overall computation of the OFMMs a very fast procedure in comparison with the conventional direct method. Actually, the computational complexity of the proposed method is linear O(p) in multiplications, with p being the moment order, while the corresponding complexity of the direct method is O(p²). Moreover, this recursive algorithm has better numerical behaviour, as it arrives at an overflow situation much later than the original one and does not introduce any finite precision errors. These are the two major advantages of the algorithm introduced in the current work, establishing the computation of the OFMMs to a very high order as a quite easy and achievable task. Appropriate simulations on images of different sizes justify the superiority of the proposed algorithm over the conventional algorithm currently used     

Reduction of optical beat interference using gain-saturated RSOA in upstream WDM/SCM optical links

A new scheme for reducing optical beat interference (OBI) noise in optical network units is proposed for subcarrier multiplexing-based access network applications. The optical spectrum of the transmit lasers is broadened by using a radio frequency (RF) clipping tone with a modulation depth greater than one. This reduces the impact of the OBI noise. The distortions caused by an RF clipping tone are also suppressed by introducing a gain-saturated reflective optical amplifier, which shows the characteristics of high-pass filter. The proposed scheme has been verified by measuring the error vector magnitude of 16QAM signal with 20 Mbps. Error-free transmission has been achieved even when the light of OBI-noise-causing lasers is stronger than that of the signal laser by 7 dB     

Inference of message sequence charts

Software designers draw message sequence charts for early modeling of the individual behaviors they expect from the concurrent system under design. Can they be sure that precisely the behaviors they have described are realizable by some implementation of the components of the concurrent system? If so, can we automatically synthesize concurrent state machines realizing the given MSCs? If, on the other hand, other unspecified and possibly unwanted scenarios are "implied" by their MSCs, can the software designer be automatically warned and provided the implied MSCs? In this paper, we provide a framework in which all these questions are answered positively. We first describe the formal framework within which one can derive implied MSCs and then provide polynomial-time algorithms for implication, realizability, and synthesis.     

Itemset trees for targeted association querying

Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn these groups into business-oriented rules. Previous research has focused predominantly on how to obtain exhaustive lists of such associations. However, users often prefer a quick response to targeted queries. For instance, they may want to learn about the buying habits of customers that frequently purchase cereals and fruits. To expedite the processing of such queries, we propose an approach that converts the market-basket database into an itemset tree. Experiments indicate that the targeted queries are answered in a time that is roughly linear in the number of market baskets, N. Also, the construction of the itemset tree has O(N) space and time requirements. Some useful theoretical properties are proven.