New Classes of Toda Soliton Solutions

We provide a detailed investigation of limits of N–soliton solutions of the Toda lattice as N tends to infinity. Our principal results yield new classes of Toda solutions including, in particular, new kinds of soliton–like (i.e., reflectionless) solutions. As a byproduct we solve an inverse spectral problem for one–dimensional Jacobi operators and explicitly construct tri–diagonal matrices that yield a purely absolutely continuous spectrum in (-1,1) and give rise to an eigenvalue spectrum that includes any prescribed countable and bounded subset of . Received: 16 October 1995/Accepted: 23 July 1996     

Characterisation and modelling of VBR video traffic

The impact of VBR video traffic characteristics on broadband network performance is analysed. In particular, the authors compare in a queue the behaviour of several models that adjust different statistical parameters of actual MPEG traces. It is proved that a good fit of the probability density function (PDF) is essential to approximate queuing behaviour while the effects of short range dependence (SRD) are of secondary importance and those of long range dependence (LRD) could be neglected for practical purposes if realistic scenarios, with strict QoS requirements, are considered     

Enhanced electron emission from phosphorus-doped diamond-cladsilicon field emitter arrays

Undoped and phosphorus (P)-doped diamond-clad Si field emitter arrays have been successfully fabricated using microwave plasma chemical vapor deposition (MPCVD) technology. The electron emission from the blunt diamond-clad microtips are much higher than those for the pure Si tips with sharp curvature due to a lower work function. Furthermore, the characteristics of emission current against applied voltage for the P-doped diamond-clad tips show superior emission at lower field to the undoped ones. After the examination of Auger electron spectroscopy (AES) and electrical characteristics of as-grown diamond, such a significant enhancement of the electron emission from the P-doped diamond-clad tips is attributed to a higher electron conductivity and defect densities     

Short-pulse, eye-safe Nd:YAG laser using cavity-dumping

A short-pulse 1.444-μm laser based on Nd:YAG technology has been demonstrated. The 1.444-μm is eye-safe. With the cavity-dump technique, a pulse of 50 m× and 14 ns was obtained. The beam quality was excellent with an M² of 1.6 by the use of a telescopic resonator. Silicon-window polarizers were used to suppress the 1.06-μm radiation but showed 1.444-μm absorption as well     

Simplified 0.35-μm flash EEPROM process using high-temperatureoxide (HTO) deposited by LPCVD as interpoly dielectrics and peripheraltransistors gate oxide

A simplified flash EEPROM process was developed using high-temperature LPCVD oxide both as flash cells interpoly dielectrics and as peripheral transistors gate oxide (decoding logic). An O₂ anneal at 850°C lowers charge trapping and interface trap density induced by Fowler-Nordheim injection. However, electron trapping remains slightly higher than with dry thermal oxide. Similar memory charge loss and write-erase endurance are obtained as for ONO-insulated cells. HTO thus proves to have the required quality and reliability to be used in flash EEPROMs     

Evaluation of multicast routing algorithms for real-timecommunication on high-speed networks

Multicast (MC) routing algorithms capable of satisfying the quality of service (QoS) requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. Each algorithm is judged based on the quality of the MC trees it generates and its efficiency in managing the network resources. Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks. Simulations also reveal that one of the unconstrained algorithms, reverse path multicasting (RPM), is quite inefficient when applied to asymmetric networks. We study how combining routing with resource reservation and admission control improves the RPM's efficiency in managing the network resources. The performance of one semiconstrained heuristic, MSC, three constrained Steiner tree (CST) heuristics, Kompella, Pasquale, and Polyzos (1992), constrained adaptive ordering (CAO), and bounded shortest multicast algorithm (BSMA), and one constrained shortest path tree (CSPT) heuristic, the constrained Dijkstra heuristic (CDKS) are also studied. Simulations show that the semiconstrained and constrained heuristics are capable of successfully constructing MC trees which satisfy the QoS requirements of real-time traffic. However, the cost performance of the heuristics varies. The BSMA's MC trees are lower in cost than all other constrained heuristics. Finally, we compare the execution times of all algorithms, unconstrained, semiconstrained, and constrained     

Mathematical analysis of dynamic channel selection in indoor mobilewireless communication systems

Dynamic channel selection (DCS) is an algorithm for flexible resource sharing in mobile radio systems. The digital enhanced cordless telecommunications (DECT) standard implements a version of DCS based on time as well as frequency multiplexing. In this paper, mathematical models are developed to evaluate the probabilities of channel availability, desired carrier power, and the carrier-to-interference ratio (CIR) for a constant traffic load. These results can be used to compute the call setup blocking probability. The models reported in this study are based on a decentralized DCS according to the DECT standard specifications. The results show that blocking due to availability of a channel (resource blocking), not interference blocking, generally is the most important factor in overall call blocking. Furthermore, it is seen that resource blocking is sensitive to the implementation of portable sets. Also, with homogeneous static traffic, this type of DCS ran be as good as fixed channel allocation (FCA) with respect to resource blocking     

The effect of surface roughness on the radiative properties ofpatterned silicon wafers

The radiative properties of patterned silicon wafers have a major impact on the two critical issues in rapid thermal processing (RTP), namely wafer temperature uniformity and wafer temperature measurement. The surface topography variation of the die area caused by patterning and the roughness of the wafer backside can have a significant effect on the radiative properties, but these effects are not well characterized. We report measurements of room temperature reflectance of a memory die, logic die, and various multilayered wafer backsides. The surface roughness of the die areas and wafer backsides is characterized using atomic force microscopy (AFM). These data are subsequently used to assess the effectiveness of thin film optics in providing approximations for the radiative properties of patterned wafers for RTP applications     

An OFDM scheme with a half complexity

The paper deals with an OFDM (orthogonal frequency division multiplexing) system based on filter-bank architecture. The known implementation uses a DFT (discrete Fourier transform) processor and a polyphase network (PPN). Even if it is based on complex components, in the final step it operates the real part extraction of the incoming signal. This leads to redundant operations in the DFT processor and in the PPN. Specifically, for the transmission of N complex symbol sequences at a given rate ½F, an N-point DFT processor and an N-branch PPN, both working at the rate F, are required. This implementation can be improved with a complexity reduction by a factor of two. In fact, in the paper an architecture is presented based on an N-point DFT processor and N-branch PPN at the rate F, for the transmission of 2N (in place of N) complex symbol sequences at the rate ½F     

Algorithm for cosine transform of Toeplitz matrices

An algorithm for calculating the 2D cosine transform of a Toeplitz matrix is presented. The algorithm is based on the application of 1D cosine transforms. More specifically, four 1D cosine transforms of size N are needed to obtain the transform of a Toeplitz matrix of size N×N. This is an improvement over previously published algorithms. The algorithm is also simple and regular