Analogue switch for very low-voltage applications

A new analogue switch suitable for operation at very low-voltage supply in a standard CMOS technology is presented. The proposed switch is based on 'quasi-floating-gate' transistors and has a simple and compact structure. For illustrative purposes, two sample-and-hold circuits operating from a single supply voltage close to the threshold voltage of a transistor, and using the proposed technique, are presented. Experimental results obtained from prototypes in a 1.5 /spl mu/m CMOS technology are provided.     

An investigation of sugar extraction methods and the use of microwave power for date syrup processing: efficiency and color related considerations.

This study investigates the effect of extraction methods on the color of date syrup and the potential use of microwave power for syrup processing. Sugar solutions were extracted from dates by boiling, soaking and blending. Color and sugar content of the extracted solutions were measured, and the percentage of sugar extracted form the total fruit sugar determined. Boiling was found to be the most efficient method of extraction whereby 74% of total samples sugar was extracted. In contrast, only 54.2% of fruit sugar was extracted by blending and 42% by soaking. In addition, solutions extracted by soaking and blending had a foaming problem in the subsequent concentration process. The extraction method had no effect on the product final color. The extracted solution was concentrated using two heating methods: conventional and microwave heating at a 600 W capacity and a frequency of 2450 MHz applied at three power levels: 10, 7, and 6. In the heating process, 180 minutes were needed to achieve a 77% degrees Brix using convective heating, while it took 81, 138, and 166 minutes of microwave heating at power level 10, 7, and 6, respectively to achieve the same concentration. Water activity of the syrup was measured within a sugar content range of 50 to 80% degrees Brix and the sugar concentration at which the product is shelf stable was determined at 76%.     

Hf-doped and NH/sub 3/-nitrided high-K gate dielectric thin film with least drain current degradation and flatband voltage shift

A novel technique to form high-K dielectric of HfSiON by doping base oxide with Hf and nitridation with NH/sub 3/, sequentially, is proposed. The HfSiON gate dielectric demonstrates excellent device performances such as only 10% degradation of saturation drain current and almost 45 times of magnitude reduction in gate leakage compared with conventional SiO/sub 2/ gate at the approximately same equivalent oxide thickness. Additionally, negligible flatband voltage shift is achieved with this technique. Time-dependent dielectric breakdown tests indicate that the lifetime of HfSiON is longer than 10 years at V/sub dd/=2 V.     

A universal matrix solver for integral-equation-based problems

A new method has been developed for compressing the matrices that occur in most integral-equation-based computer programs. This method is easy to interface with existing computer programs, and allows them to run significantly faster and with significantly less memory. This method applies not only to electromagnetic and acoustic computation, but also to most programs involving a Green's function or any integral equation with a kernel having some smoothness properties. Our numerical computations, running on a high-end personal computer, have achieved compression ratios of fifty times, and compressed inversion of the matrices fifty times faster than by previous methods. For larger problems, solved on high-performance computers, these ratios would improve to about one thousand to one for larger moment method problems.     

A simple impulsiveness correction factor for control of electromagnetic interference in dynamic wireless applications

The emerging software defined radio technologies will be an enabler for a new generation of dynamic wireless systems. It will also open up the possibility of allocating frequencies in a, more dynamic way than today. From an intersystem-interference point of view, this can cause unforeseen problems to occur due to the increased complexity in such applications. In such applications, a measure indicating whether or not a frequency band is possible to use from an electromagnetic interference point of view, must be found. A simple approach is to use the measured total average interference power within the receiver band. Since the interference impact on modern digital communication systems from an interference signal does not only depend on the power but also on the actual waveform of the interference signal, some kind of quality measure of the average-power approach would be convenient to use. In this paper, we introduce a simple quality measure of the average-power approach so that a rough adjustment for the interference-waveform properties can be done.     

Quadrature Mismatch Shaping for Digital-to-Analog Converters

Quadrature sigma-delta analog-to-digital converters require a feedback path for both the I and the Q parts of the complex feedback signal. If two separate multibit feedback digital-to-analog converters (DACs) are used, mismatch among the unit DAC elements leads to additional mismatch noise in the output spectrum as well as an I/Q imbalance. This paper proposes new quadrature bandpass (QBP) mismatch shaping techniques. In our approach, the I and Q DACs are merged into one complex DAC, which leads to near-perfect I/Q balance. To select the unit DAC elements of the complex multibit DAC, the well-known butterfly shuffler and tree structure are generalized towards a complex structure, and necessary constraints for their correct functioning are derived. Next, a very efficient first-order QBP shaper implementation is proposed. Finally, the newly presented complex structures are simulated to prove their effectiveness and are compared with each other with respect to performance     

Estimating and reducing the memory requirements of signal processing codes for embedded systems

Most embedded systems have limited amount of memory. In contrast, the memory requirements of the digital signal processing (DSP) and video processing codes (in nested loops, in particular) running on embedded systems is significant. This paper addresses the problem of estimating and reducing the amount of memory needed for transfers of data in embedded systems. First, the problem of estimating the region associated with a statement or the set of elements referenced by a statement during the execution of nested loops is analyzed. For a fixed execution ordering, a quantitative analysis of the number of elements referenced is presented; exact expressions for uniformly generated references and a close upper and lower bound for nonuniformly generated references are derived. Second, in addition to presenting an algorithm that computes the total memory required, this paper also discusses the effect of transformations (that change the execution ordering) on the lifetimes of array variables, i.e., the time between the first and last accesses to a given array location. The term maximum window size is introduced, and quantitative expressions are derived to compute the maximum window size. A detailed analysis of the effect of unimodular transformations on data locality, including the calculation of the maximum window size, is presented.     

Bandpass filters with reconfigurable transmission zeros using varactor-tuned tapped stubs

In this letter, bandpass filters with one or two tunable transmission zeros are proposed. The reconfigurable transmission zeros are implemented through varactors in combination with tapped quarter-wavelength stubs. Based on mixed mode simulations including EM simulation and circuit simulation, the proposed filters were designed and fabricated on low-cost FR4 board. The measurement results verified the design concepts.     

Nash equilibria of packet forwarding strategies in wireless ad hoc networks

In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example, nodes have to forward packets for each other in order to enable multihop communication. In recent years, incentive mechanisms have been proposed to give nodes incentive to cooperate, especially in packet forwarding. However, the need for these mechanisms was not formally justified. In this paper, we address the problem of whether cooperation can exist without incentive mechanisms. We propose a model,based on game theory and graph theory to investigate equilibrium conditions of packet forwarding strategies. We prove theorems about the equilibrium conditions for both cooperative and noncooperative strategies. We perform simulations to estimate the probability that the conditions for a cooperative equilibrium hold in randomly generated network scenarios.. As the problem is involved, we deliberately restrict ourselves to a static configuration. We conclude that in static ad hoc networks where the relationships between the nodes are likely to be stab le-cooperation needs to be encouraged.     

Computation of Running Averages

This brief presents and compares several recursive and nonrecursive techniques for the efficient computation of the running average of discrete signals. First of all, the standard recursive algorithm is considered and its long-term accuracy is assessed when the floating-point arithmetic is employed. A cheap refreshing strategy is proposed as a means of keeping the computed value close enough to the exact one. Then, two alternative nonrecursive algorithms, requiring only log₂N additions, are developed, which are as reliable and accurate as the direct implementation