On the synergy between electrical and photonic switching

This article focuses on the values of electrical switching vs. photonic switching in the context of telecom transport networks. In particular, we show that the requirement of providing agility at the optical layer in the face of traffic forecast uncertainties is served better through photonic switching. On the other hand, some of the network-level functions, such as fast protection, subwavelength aggregation, and flexible client connectivity, require electrical switching. We further argue that additional values are achieved with hybrid photonic and electrical switching, which do not exist when either of these options is used in isolation.     

Thermal conductivity of doped PbTe-based solid solutions with off-center impurities

The coefficients of thermopower and electrical and thermal conductivity in the PbTe_0.8Se_0.1 S _0.1 solid solution with electron concentration (4.6–54) × 10¹⁸ cm^?3 are studied in the range of 85–300 K (and in some cases up to 700 K). The temperature dependences of electrical and thermal conductivity indicate that the low-temperature electron and phonon scattering initiated by the off-center impurity of sulfur exists. The temperature dependences of the electronic and lattice components of thermal conductivity are calculated in the approximation of a parabolic spectrum and electron scattering by acoustic phonons and neutral substitutional impurities. The lattice thermal conductivity is found to have a feature in the form of a shallow minimum in the range of 85–250 K. A similar feature, while not so clearly pronounced, is found to exist also in Pb_1?x Sn_xTe_1?x Se_x alloys (x≥0.15) with an off-center tin impurity. An analysis of the possible origins of this effect suggests that, at low temperatures, the Lorentz numbers L of the materials under study are smaller than the L₀ numbers employed which correspond to the above scattering mechanisms. The cause of the decrease in L is related to electron scattering at two-level systems, a mechanism whose effect grows with increasing electron energy. An analysis of experimental data obtained at high temperatures, as well as on undoped samples with the lowest possible carrier concentrations, yields the values of L for samples with different electron densities. The minimum value L/L₀ = 0.75 is obtained for a lightly doped sample at ～130 K.     

A left-handed composite medium based on waveguiding structures with a bianisotropic filling

A new composite medium based on waveguiding structures loaded with bianisotropic gratings of planar double split rings (PDSRs) and planar helices is considered. The microwave transmission spectra of this medium are studied experimentally. The effective parameters of the medium are determined theoretically, and its passbands are investigated. The characteristics of the medium are compared to those of infinite homogeneous bianisotropic media. A relationship between the spectral transmission characteristics and the type of resonance excitation is established. The transparency bands and overforbidden bands of the composite medium are revealed. The combinations of the medium’s effective parameters that correspond to these bands are determined. It is shown that the transparency bands where the medium is characterized simultaneously by negative permittivity and negative permeability can be identified.     

Discrete Chaos-I: Theory

We propose a definition of the discrete Lyapunov exponent for an arbitrary permutation of a finite lattice. For discrete-time dynamical systems, it measures the local (between neighboring points) average spreading of the system. We justify our definition by proving that, for large classes of chaotic maps, the corresponding discrete Lyapunov exponent approaches the largest Lyapunov exponent of a chaotic map when M/spl rarr//spl infin/, where M is the cardinality of the discrete phase space. In analogy with continuous systems, we say the system has discrete chaos if its discrete Lyapunov exponent tends to a positive number, when M/spl rarr//spl infin/. We present several examples to illustrate the concepts being introduced.     

SR ARQ packet delay statistics on markov channels in the presence of variable arrival rate

In this letter we investigate the packet delay statistics of a fully reliable selective repeat ARQ scheme by considering a discrete time Markov channel with non-instantaneous feedback and assigned round-trip delay m. Our focus is on studying the impact of the arrival process on the delay experienced by a packet. An exact model is introduced to represent the system constituted by the transmitter buffer, the m round-trip slots, and the channel state. By means of this model, we evaluate and discuss the delay statistics and we analyze the impact of the system parameters, in particular the packet arrival rate, on the delay statistics     

Estimating and reducing the memory requirements of signal processing codes for embedded systems

Most embedded systems have limited amount of memory. In contrast, the memory requirements of the digital signal processing (DSP) and video processing codes (in nested loops, in particular) running on embedded systems is significant. This paper addresses the problem of estimating and reducing the amount of memory needed for transfers of data in embedded systems. First, the problem of estimating the region associated with a statement or the set of elements referenced by a statement during the execution of nested loops is analyzed. For a fixed execution ordering, a quantitative analysis of the number of elements referenced is presented; exact expressions for uniformly generated references and a close upper and lower bound for nonuniformly generated references are derived. Second, in addition to presenting an algorithm that computes the total memory required, this paper also discusses the effect of transformations (that change the execution ordering) on the lifetimes of array variables, i.e., the time between the first and last accesses to a given array location. The term maximum window size is introduced, and quantitative expressions are derived to compute the maximum window size. A detailed analysis of the effect of unimodular transformations on data locality, including the calculation of the maximum window size, is presented.     

Nondiffusive weak localization in two-dimensional systems with spin-orbit splitting of the spectrum

The effect of spin splitting caused by structural asymmetry (Rashba’s contribution) and bulk asymmetry (Dresselhaus’s contribution) on the magnetoconductance of two-dimensional structures with high mobility of charge carriers is studied. The theory of weak localization with regard to both of the contributions is developed. The theory is valid in the entire region of classically low magnetic fields for arbitrary relations between the frequencies of spin precession and elastic collisions. The suppression of the correction for antilocalization is demonstrated in the case of equal contributions of structural anisotropy and bulk anisotropy to the spin splitting. The effect of the contribution, cubic in the wave vector, to the spin splitting on the quantum magnetoresistance is studied.     

Improved-performance noncoherent weighted-coefficients diversity combiner for DPSK and NC-FSK signals in nonidentical Nakagami fading channels

It is well-known that noncoherent equal-gain combining (NC-EGC) is the simplest combining technique for noncoherent and differentially coherent communication systems. However, for nonidentical Nakagami-m channels (channels having nonuniform multipath intensity profile (MIP) and/or arbitrary non-integer fading parameters), the use of NC-EGC has three main disadvantages. First, its performance serves as a lossy upper bound to that of the optimum diversity combiner. Second, it results in complicated expressions for the system average error performance. Third, it incurs noncoherent combining loss (does not aid the use of diversity) at relatively low average signal-to-noise ratio (SNR). In this letter, we propose a modified version of the NC-EGC, which is a noncoherent combiner with weighting coefficients, to overcome the disadvantages of the conventional one. We show that this alternative combiner does provide improvements over the conventional N.C-EGC for all values of average SNRs, it does not incur any noncoherent combining loss, and it leads to a design of the receiver whose average error performance can be evaluated easily.     

Nash equilibria of packet forwarding strategies in wireless ad hoc networks

In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example, nodes have to forward packets for each other in order to enable multihop communication. In recent years, incentive mechanisms have been proposed to give nodes incentive to cooperate, especially in packet forwarding. However, the need for these mechanisms was not formally justified. In this paper, we address the problem of whether cooperation can exist without incentive mechanisms. We propose a model,based on game theory and graph theory to investigate equilibrium conditions of packet forwarding strategies. We prove theorems about the equilibrium conditions for both cooperative and noncooperative strategies. We perform simulations to estimate the probability that the conditions for a cooperative equilibrium hold in randomly generated network scenarios.. As the problem is involved, we deliberately restrict ourselves to a static configuration. We conclude that in static ad hoc networks where the relationships between the nodes are likely to be stab le-cooperation needs to be encouraged.     

Computation of Running Averages

This brief presents and compares several recursive and nonrecursive techniques for the efficient computation of the running average of discrete signals. First of all, the standard recursive algorithm is considered and its long-term accuracy is assessed when the floating-point arithmetic is employed. A cheap refreshing strategy is proposed as a means of keeping the computed value close enough to the exact one. Then, two alternative nonrecursive algorithms, requiring only log₂N additions, are developed, which are as reliable and accurate as the direct implementation