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.     

Higher Stability Limits for the Symplectic FDTD Method by Making Use of Chebyshev Polynomials

A new scheme is introduced for obtaining higher stability performance for the symplectic finite-difference time-domain (FDTD) method. Both the stability limit and the numerical dispersion of the symplectic FDTD are determined by a function zeta. It is shown that when the zeta function is a Chebyshev polynomial the stability limit is linearly proportional to the number of the exponential operators. Thus, the stability limit can be increased as much as possible at the cost of increased number of operators. For example, the stability limit of the four-exponential operator scheme is 0.989 and of the eight-exponential operator scheme it is 1.979 for fourth-order space discretization in three dimensions, which is almost three times the stability limit of previously published symplectic FDTD schemes with a similar number of operators. This study also shows that the numerical dispersion errors for this new scheme are less than those of the previously reported symplectic FDTD schemes     

Electrical and photoelectric properties of electrochemically fabricated SnO2/Cd0.4Zn0.6S/CdTe solar cells

Solar cells based on SnO₂/Cd_0.4Zn_0.6S/CdTe heterostructures are fabricated by electrochemical deposition, and the dependences of their electrical and photoelectric properties on the thermal annealing conditions are studied. It is shown that thermal annealing reduces the tunnel currents by almost two orders of magnitude. The best conditions of thermal annealing are determined (t = 300°C and τ = 9 min). These conditions provide the highest photosensitivity of the heterostructures under study (I _sc ≈ 21.2 mA/cm², U _oc ≈ 813 mV, and η = 14.7%).     

High Rate Data Synchronization in GALS SoCs

Globally asynchronous, locally synchronous (GALS) systems-on-chip (SoCs) may be prone to synchronization failures if the delay of their locally-generated clock tree is not considered. This paper presents an in-depth analysis of the problem and proposes a novel solution. The problem is analyzed considering the magnitude of clock tree delays, the cycle times of the GALS module, and the complexity of the asynchronous interface controllers using a timed signal transition graph (STG) approach. In some cases, the problem can be solved by extracting all the delays and verifying whether the system is susceptible to metastability. In other cases, when high data bandwidth is not required, matched-delay asynchronous ports may be employed. A novel architecture for synchronizing inter-modular communications in GALS, based on locally delayed latching (LDL), is described. LDL synchronization does not require pausable clocking, is insensitive to clock tree delays, and supports high data rates. It replaces complex global timing constraints with simpler localized ones. Three different LDL ports are presented. The risk of metastability in the synchronizer is analyzed in a technology-independent manner     

All-optical seed pulse extraction for packet synchronization based on self-induced effects in a vertical-cavity semiconductor gate

Self-induced effects in a passive polarization-independent vertical-cavity semiconductor gate are investigated numerically and experimentally. We demonstrate all-optical seed-pulse extraction for synchronization of differential phase-shift keying and ON-OFF keying packets at 10 Gb/s. Our results provide evidence that vertical-cavity gates, exploiting saturable absorption in semiconductor quantum-wells, exhibit attractive performances in terms of efficiency, power consumption, and polarization independency.     

The colored revolution of bioimaging

This paper provides an overview of the main aspects of modern fluorescence microscopy. It covers the principles of fluorescence and highlights the key discoveries in the history of fluorescence microscopy. The paper also discusses the optics of fluorescence microscopes and examines the various types of detectors. It also discusses the signal and image processing challenges in fluorescence microscopy and highlights some of the present developments and future trends in the field.     

Alternating-direction implicit (ADI) formulation of the finite-difference time-domain (FDTD) method: algorithm and material dispersion implementation

The alternating-direction implicit finite-difference time-domain (ADI-FDTD) technique is an unconditionally stable time-domain numerical scheme, allowing the /spl Delta/t time step to be increased beyond the Courant-Friedrichs-Lewy limit. Execution time of a simulation is inversely proportional to /spl Delta/t, and as such, increasing /spl Delta/t results in a decrease of execution time. The ADI-FDTD technique greatly increases the utility of the FDTD technique for electromagnetic compatibility problems. Once the basics of the ADI-FDTD technique are presented and the differences of the relative accuracy of ADI-FDTD and standard FDTD are discussed, the problems that benefit greatly from ADI-FDTD are described. A discussion is given on the true time savings of applying the ADI-FDTD technique. The feasibility of using higher order spatial and temporal techniques with ADI-FDTD is presented. The incorporation of frequency dependent material properties (material dispersion) into ADI-FDTD is also presented. The material dispersion scheme is implemented into a one-dimensional and three-dimensional problem space. The scheme is shown to be both accurate and unconditionally stable.