Deorthogonalization of ODS-CDMA QPSK by AM/PM Nonlinearity

When using a conventional demodulator, a sufficient condition to maintain ODS-CDMA codeword orthogonality is constant relative channel amplitude over the codeword duration. When transmitted over a memoryless, AM/PM nonlinearity channel, the chip-to-chip fluctuating amplitude of a composite ODS-CDMA QPSK waveform produces a chip-to-chip fluctuating phase that deorthogonalizes the ODS-CDMA codewords, resulting in an additional multiple access self-interference similar to that found in asynchronous DS-CDMA. For ODS-CDMA QPSK in an AM/PM nonlinearity channel, we utilize the Central Limit Theorem, derive, and evaluate: (i) an expression for the signal-to-distortion ratio at the demodulator output, (ii) an expression for the uncoded bit error probability, and (iii) an upper bound on the convolutionally-coded bit error probability. We find that the degradation to BER depends on both the AM/PM nonlinearity slope and the ODS-CDMA channel loading.     

Symmetries of Integrable Difference Equations on the Quad-Graph

This paper describes symmetries of all integrable difference equations that belong to the famous Adler–Bobenko–Suris classification. For each equation, the characteristics of symmetries satisfy a functional equation, which we solve by reducing it to a system of partial differential equations. In this way, all five-point symmetries of integrable equations on the quad-graph are found. These include mastersymmetries, which allow one to construct infinite hierarchies of local symmetries. We also demonstrate a connection between the symmetries of quad-graph equations and those of the corresponding Toda type difference equations.     

Trace norm estimates for products of integral operators and diffusion semigroups

We give trace norm estimates for products of integral operators and for diffusion semigroups. These are applied to differences of heat semigroups. A natural example of an integral operator with finite trace which is not trace class is given.     

Long wavelength quantum well lasers: Synopsis of the RACE “AQUA” project: MOVPE/MBE/GSMBE for InGaAsP/InP and InGaAlAs/InP high speed MQW DFB lasers

The technological limits for ultra high speed devices are now rapidly expanding due to the use of quantum well (QW) materials. This new class of materials gives the opportunity of tailoring materials parameters by controlling geometries on an atomic scale. They look very promising as materials for lasers, detectors and transistors suitable even above 10 Gb/s. It will be demonstrated that state of the art MQW structures can be realized in both material systems, InGaAsP/InP and InGaAlAs/InP. Parallel lateral laser structures (e.g. SIBH, BRS and TBH) have been designed to take full benefit of QW technology. Ultimate reduction of parasitics, whilst using potential low cost fabrication technologies is the basis for achieving high bitrate (10 Gb/s) MQW lasers, even with the stronger damping in QW material. Using the DFB-SIBH laser structure 10 Gb/s large signal experiments are successfully performed with bulk, MQW and SLMQW lasers. Extremely low fall times of 44 ps are achieved. Additional MQW based improvements are observed such as: −3 times higher differential gain, increased output power (>110 mW), 2.5 times lower chirp (Δλ_−20dB = 0.40 nm at 10 Gb/s modulation), and 2 dB gain in power budget at 10 Gb/s digital transmission.     

Improved modeling and solution methods for the multi-resource routing problem

This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies.