Phase-only adaptive nulling with a genetic algorithm

This paper describes a new approach to adaptive phase-only nulling with phased arrays. A genetic algorithm adjusts some of the least significant bits of the beam steering phase shifters to minimize the total output power. Using small adaptive phase values results in minor deviations in the beam steering direction and small perturbations in the sidelobe level in addition to constraining the search space of the genetic algorithm. Various results are presented to show the advantages and limitations of this approach, in general, the genetic algorithm proves to be better than previous phase-only adaptive algorithms     

A low-resistance self-aligned T-shaped gate for high-performancesub-0.1-μm CMOS

This paper describes the high performance of T-shaped-gate CMOS devices with effective channel lengths in the sub-0.1-μm region. These devices were fabricated by using selective W growth, which allows low-resistance gates smaller than 0.1 μm to be made without requiring fine lithography alignment. We used counter-doping to scale down the threshold voltage while still maintaining acceptable short-channel effects. This approach allowed us to make ring oscillators with a gate-delay time as short as 21 ps at 2 V with a gate length of 0.15 μm. Furthermore, we experimentally show that the high circuit speed of a sub-0.1-μm gate length CMOS device is mainly due to the PMOS device performance, especially in terms of its drivability     

Quick estimation of rare events in stochastic networks

This paper presents a method for fast estimation of probabilities of rare events in stochastic networks, with a particular emphasis on coherent reliability systems. The method is based on the concepts of likelihood-ratios (LR), change of probability measure and the bottleneck-cut in the network. Both polynomial and exponential-time Monte Carlo estimators are defined, and conditions under which the time complexity of the proposed LR estimators is bounded by a polynomial are discussed. The accuracy of the method depends only on the size (cardinality) of the bottleneck-cut, not on the topology and actual size of the network. Supporting numerical results are presented, with the cardinality of the bottleneck-cut ⩽20     

Influence of quantum capture and tunneling mechanisms on the dark current of bound-to-continuum quantum-well infrared photodetectors

We present a theoretical model for the dark current of bound-to-continuum quantum-well infrared photodetectors (QWIPs), by considering the field-induced mixing effect, tunneling rate and phonon scattering rate between bound and continuum states. Using this model, we can see clearly how these mechanisms significantly influence the Fermi levels of bound and continuum electrons, and thus, the dark current. Nonlinear temperature dependence of the dark current at low temperature is predicted and discussed in detail. The simulated dark currents exhibit good agreement with the experimental results, without use of parameter fitting techniques.     

Quadratic interpolation for image resampling

Nearest-neighbor, linear, and various cubic interpolation functions are frequently used in image resampling. Quadratic functions have been disregarded largely because they have been thought to introduce phase distortions. This is shown not to be the case, and a family of quadratic functions is derived. The interpolating member of this family has visual quality close to that of the Catmull-Rom cubic, yet requires only 60% of the computation time.     

Error-resilience improvement for block-transform video coders

An algorithm is presented to enhance the resilience of block-based video-coding algorithms against channel errors. The error-resilience algorithm described suggests the use of fixed length coding to alleviate the effect of Huffman coding on the synchronisation of the decode under erroneous conditions. The proposed mechanism modifies the order of transmission of the fixed-length video parameters to increase the chance of their arrival. Synchronisation words are sent at fixed-length intervals within the bit stream to reduce the possibility of the decoder falling on similar bit patterns within the bit stream. To limit the effect of error accumulation, the motion prediction process is halted and the differential coding of motion vectors is not applied. FEC techniques are applied on some error-sensitive segments of the reordered video bitstream. The effectiveness of the proposed error-resilience algorithm is evidenced by both subjective and objective results     

Four-channel polarization-insensitive optically transparent wavelength converter

Multichannel wavelength converters may be important components in the cross-connects in future wavelength-division multiplexed (WDM) transport networks. We demonstrate a multichannel, polarization-insensitive, optically transparent wavelength converter, based on four-wave mixing in two semiconductor optical amplifiers in a polarization-diversity arrangement. Bit-error-rate (BER) measurements with four input 2.5-Gb/s WDM channels, spaced by 2 nm, show penalties for wavelength conversion less than 2.6 dB at 10/sup -9/ BER. Changes in the state of polarization of the input signals cause the output power to change by less than 1.2 dB, and the corresponding power penalties change by less than 0.9 dB.     

Wavelet packet modulation for orthogonally multiplexedcommunication

Utilizing multidimensional signaling techniques, a generalized multirate wavelet-based modulation format for orthogonally multiplexed communication systems is presented. Wavelet packet modulation (WPM) employs the basis functions from an arbitrary pruning of a dyadic tree structured filter bank as orthogonal pulse shapes for conventional quadrature amplitude modulation (QAM) symbols. This generalized framework affords an entire library of basis sets with increased flexibility in time-frequency (T-F) partitioning. The bandwidth efficiency and power spectral density figures of merit for the general signal are derived and shown to be that of standard QAM     

`Minting' electronic cash

Electronic equivalents of traditional cash payment systems are being launched worldwide. Electronic cash can combine the benefits of traditional cash with those of payment by debit and credit card, while circumventing both their shortcomings. As with traditional cash, electronic cash should have high acceptability and be suitable for low value payment from person to person. With the possible exception of online payment platforms such as the Internet, it is preferred that payments be verifiable offline, without the bank's involvement, for reasons of cost effectiveness and speed. To facilitate electronic cash payments over the phone and the Internet, physical proximity of payer and payee should not be necessary. Moreover, electronic cash should offer privacy of payments. In particular, payments by an honest payer should be untraceable, and information about transaction content should remain privy to payer and payee. Yet a payer ought to always be able to trace the payee; traceability suits electronic cash and is as open to extortion, money laundering, and bribery as a check or wire transfer. Lastly, as with payments by debit and credit card, electronic cash should be convenient to store and transport, while protecting users against loss, theft, and accidental destruction