Adaptive MAP error concealment for dispersively packetized wavelet-coded images

In this paper, we present an adaptive maximum a posteriori (MAP) error concealment algorithm for dispersively packetized wavelet-coded images. We model the subbands of a wavelet-coded image as Markov random fields, and use the edge characteristics in a particular subband, and regularity properties of subband/wavelet samples across scales, to adapt the potential functions locally. The resulting adaptive MAP estimation gives PSNR advantages of up to 0.7 dB compared to the competing algorithms. The advantage is most evident near the edges, which helps improve the visual quality of the reconstructed images.     

Quadrature Mismatch Shaping for Digital-to-Analog Converters

Quadrature sigma-delta analog-to-digital converters require a feedback path for both the I and the Q parts of the complex feedback signal. If two separate multibit feedback digital-to-analog converters (DACs) are used, mismatch among the unit DAC elements leads to additional mismatch noise in the output spectrum as well as an I/Q imbalance. This paper proposes new quadrature bandpass (QBP) mismatch shaping techniques. In our approach, the I and Q DACs are merged into one complex DAC, which leads to near-perfect I/Q balance. To select the unit DAC elements of the complex multibit DAC, the well-known butterfly shuffler and tree structure are generalized towards a complex structure, and necessary constraints for their correct functioning are derived. Next, a very efficient first-order QBP shaper implementation is proposed. Finally, the newly presented complex structures are simulated to prove their effectiveness and are compared with each other with respect to performance     

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.     

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.     

Bandpass filters with reconfigurable transmission zeros using varactor-tuned tapped stubs

In this letter, bandpass filters with one or two tunable transmission zeros are proposed. The reconfigurable transmission zeros are implemented through varactors in combination with tapped quarter-wavelength stubs. Based on mixed mode simulations including EM simulation and circuit simulation, the proposed filters were designed and fabricated on low-cost FR4 board. The measurement results verified the design concepts.     

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