QR factoring to compute the GCD of univariate approximate polynomials

We present a stable and practical algorithm that uses QR factors of the Sylvester matrix to compute the greatest common divisor (GCD) of univariate approximate polynomials over /spl Ropf/[x] or /spl Copf/[x]. An approximate polynomial is a polynomial with coefficients that are not known with certainty. The algorithm of this paper improves over previously published algorithms by handling the case when common roots are near to or outside the unit circle, by splitting and reversal if necessary. The algorithm has been tested on thousands of examples, including pairs of polynomials of up to degree 1000, and is now distributed as the program QRGCD in the SNAP package of Maple 9.     

The effects of nonlocal impact ionization on the speed of avalanche photodiodes

The nonlocal enhancement in the velocities of charge carriers to ionization is shown to outweigh the opposing effects of dead space, increasing the avalanche speed of short avalanche photodiodes (APDs) over the predictions of a conventional local model which ignores both of these effects. The trends in the measured gain-bandwidth product of two short InAlAs APDs reported in the literature support this result. Relatively large speed benefits are predicted to result from further small reductions in the lengths of short multiplication regions.     

Analysis of feedback for higher order polarization-mode dispersion mitigation of NRZ 40-Gb/s optical transmission

First-order polarization-mode dispersion (PMD) compensation by means of a polarization controller and a differential delay line is not sufficient to guarantee error-free transmission for 40-Gb/s channels when higher order effects severely increase signal distortion. Higher order mitigation is possible by cascading more than one first-order block. However, only two-stage or three-stage devices remain simple enough to be actually controlled. The performance of such higher order PMD compensators is evaluated by means of numerical simulations. Two different feedback signals have been used, demonstrating that first-order and higher order PMD distortion of nonreturn-to-zero (NRZ) pulses at 40 Gb/s can be strongly mitigated for instantaneous values of the differential group delay (DGD) up to the bit slot, when the compensator is properly controlled.     

Search for high-performance probe-fed stacked patches using optimization

High-performance circular probe-fed stacked patch antenna designs are explored through the use of numerical optimization. New trends are sought to aid understanding and to suggest novel solutions. We describe the optimization technique, present a new design trend relating efficiency and bandwidth to the choice of substrate dielectric, and propose and demonstrate a novel, optimized antenna achieving 33% bandwidth whilst maintaining greater than 80% surface wave efficiency.     

End-to-end congestion control schemes: utility functions, random losses and ECN marks

We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience noncongestion-related losses. We first show that there exists an additive-increase-multiplicative-decrease scheme using only end-to-end measurable losses such that a socially optimal solution can be reached. We incorporate round-trip delay in this model, and show that one can generalize observations regarding TCP-type congestion avoidance to more general window flow control schemes. We then consider explicit congestion notification (ECN) as an alternate mechanism (instead of losses) for signaling congestion and show that ECN marking levels can be designed to nearly eliminate losses in the network by choosing the marking level independently for each node in the network. While the ECN marking level at each node may depend on the number of flows through the node, the appropriate marking level can be estimated using only aggregate flow measurements, i.e., per-flow measurements are not required.     

Miniaturized coplanar waveguide stop band filters based on multiple tuned split ring resonators

A novel compact stop band filter consisting of a 50 /spl Omega/ coplanar waveguide (CPW) with split ring resonators (SRRs) etched in the back side of the substrate is presented. By aligning SRRs with the slots, a high inductive coupling between line and rings is achieved, with the result of a sharp and narrow rejection band in the vicinity of the resonant frequency of the rings. In order to widen the stop band of the filter, several ring pairs tuned at equally spaced frequencies within the desired gap are cascaded. The frequency response measured in the fabricated prototype device exhibits pronounced slopes at either side of the stop band and near 0 dBs insertion loss outside that band. Since SRR dimensions are much smaller than signal wavelength, the proposed filters are extremely compact and can be used to reject frequency parasitics in CPW structures by simply patterning properly tuned SRRs in the back side metal. Additional advantages are easy fabrication and compatibility with MMIC or PCB technology.     

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.     

NEXUS — Resilient Intelligent Middleware

Service-oriented computing is the latest software paradigm brought about by the computing revolution. The different viewpoint and granularity of software components used in technologies based on the service-oriented architecture paradigm, compared to traditional object-oriented methodologies makes them better suited to many of the efforts that are being made in the pervasive and ubiquitous computing world. In the NEXUS project we are seeking ways of fusing the SOA and pervasive computing paradigms in order to build intelligent, robust and resilient networks connecting dynamic islands of service resources.     

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.     

Joint scheduling and power control supporting multicasting in wireless ad hoc networks

This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem.