On the capacities of bipartite Hamiltonians and unitary gates

We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.     

High-resolution photonics-based interference suppression filter with wide passband

A new topology for a photonic signal processor, which overcomes the basic recursive frequency response problem that limits the passband range, is presented. The structure is based on a new multiple-wavelength offset-cavity structure that is cascaded with a series of unbalanced delay line structures. This not only can synthesize a very narrow notch response with good shape factor but also permits a multifold extension of the free spectral range (FSR) and passband width. Results on the interference mitigation filter demonstrate a stopband of 1% of center frequency and a fourfold increase in the FSR and passband width, while also having a very small shape factor, in excellent agreement with predictions.     

Geometric derivation of expectation-maximization and generalized successive interference cancellation algorithms with applications to CDMA channel estimation

The expectation-maximization (EM) algorithm is well established as a computationally efficient method for separable signal parameter estimation. Here, a new geometric derivation and interpretation of the EM algorithm is given that facilitates the understanding of EM convergence properties. Geometric considerations lead to an alternative separable signal parameter estimator based on successive cancellation. The new generalized successive interference cancellation (GSIC) algorithm is then applied to multiuser delay and channel estimation for code-division multiple access (CDMA) radiolocation and communication. The radiolocation application uses a handshaking protocol in which multiple reference nodes transmit acknowledge (ACK) CDMA packets to a master node, which then computes round-trip travel times (RTTs). Simulation results comparing EM and GSIC are presented for the CDMA channel-estimation problem.     

Gas adsorption in mcm-41 porous silicas dynamic measurements using sans

The European Physical Journal E - The isothermal gas adsorption of two hexane isomers (n-hexane and cyclohexane) in the mesopores of MCM-41 silica have been investigated by small angle neutron...     

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%.     

Modeling subthreshold SOI logic for static timing analysis

A simple, yet realistic physics-based model is introduced to describe the subthreshold drain current of a MOSFET taking into account the body- and drain-voltage dependencies, including the short channel effects. This model, verified by SPICE simulations, describes adequately the pseudotriode and pseudosaturation regions of MOS transistors operated below V/sub T/. It can be applied for predicting bulk- or partially depleted (PD) SOI CMOS circuit operation. Analytical expressions derived for the logic switching threshold and delay are applied to predict the performance of CMOS-SOI inverters.     

Algebraic theory of optimal filterbanks

We introduce an optimality theory for finite impulse response (FIR) filterbanks using a general algebraic point of view. We consider an admissible set /spl Lscr/ of FIR filterbanks and use scalability as the main notion based on which performance of the elements in /spl Lscr/are compared. We show that quantification of scalability leads naturally to a partial ordering on the set /spl Lscr/. An optimal solution is, therefore, represented by the greatest element in /spl Lscr/. It turns out that a greatest element does not necessarily exist in /spl Lscr/. Hence, one has to settle with one of the maximal elements that exist in /spl Lscr/. We provide a systematic way of finding a maximal element by embedding the partial ordering at hand in a total ordering. This is done by using a special class of order-preserving functions known as Schur-convex. There is, however, a price to pay for achieving a total ordering: there are infinitely many possible choices for Schur-convex functions, and the optimal solution specified in /spl Lscr/ depends on this (subjective) choice. An interesting aspect of the presented algebraic theory is that the connection between several concepts, namely, principal component filterbanks (PCFBs), filterbanks with maximum coding gain, and filterbanks with good scalability, is clearly revealed. We show that these are simply associated with different extremal elements of the partial ordering induced on /spl Lscr/ by scalability.