Design of high-speed two-stage cascode-compensated operational amplifiers based on settling time and open-loop parameters

Settling behavior of operational amplifiers is of great importance in many applications. In this paper, an efficient methodology for the design of high-speed two-stage operational amplifiers based on settling time is proposed. Concerning the application of the operational amplifier, it specifies proper open-loop circuit parameters to obtain the desired settling time and closed-loop stability. As the effect of transfer function zeros has been taken into account, the proposed methodology becomes more accurate in achieving the desired specifications. Simulation results are presented to show the effectiveness of the methodology.     

DSKMS: a dynamic smart key management system based on fuzzy logic in wireless sensor networks

Wireless Networks - Wireless sensor networks include a large number of sensor nodes which are developed in an environment. These networks have military, commercial, industrial, and medical...     

Robust Recursive Inverse Adaptive Algorithm in Impulsive Noise

The recently proposed Recursive Inverse (RI) algorithm has shown a significant performance improvement compared to that of the Recursive Least Squares (RLS) algorithm, in various noise environments. However, both algorithms fail to converge in certain impulsive noise environments, especially if the Signal-to-Noise Ratio (SNR) is low. In this paper, a Robust RI algorithm is proposed. Analytical results show that robustness against impulsive noise is achieved by choosing the weights on the basis of the L ₁ norms of the autocorrelation matrix and the cross-correlation vector. Simulation results confirm that the proposed algorithm provides an improved performance, with a reduction in computational complexity, compared to those of the RLS and the Robust RLS in white and correlated impulsive noise.     

RFID Transponder Collision Control Algorithm

Transponder collision problem can be significant when a large number of RFID (radio frequency identification) transponders exist in field. Most existing anti-collision algorithms can solve this problem. However, problem arises when all or part of these transponders are having identical UID (unique identification). This paper proposes a new transponder collision control algorithm to overcome overlapping that occurs among transponders with identical UID in RFID large scale deployment (e.g., in a large warehouse), so that the RFID reader can successfully identify the quantity of transponders for each particular UID with high identification accuracy. The proposed anti-collision algorithm adopts a modified version of frequency domain method by adding stochastic delays in time domain. The obtained results show that the proposed method can achieve optimum frequency bandwidth utilization and at the same time poses high identification accuracy (almost 100%) with low identification delay.     

Utility-based adaptive radio resource allocation in OFDM wireless networks with traffic prioritization

In this letter, a joint transmit scheduling and dynamic sub-carrier and power allocation method is proposed to exploit multi-user diversity in downlink packet transmission in an OFDM wireless network with mixed real-time and non-real-time traffic patterns. To balance efficiency and fairness and to satisfy the QoS requirements of real-time users, we utilize a utility-based framework and propose a polynomial-time heuristic algorithm to solve the formulated optimization problem. The distinguishing feature of the proposed method is that it gives in one shot, the transmission scheduling, the sub-carriers assigned to each user, and the power allocated to each sub-carrier, based on a fair and efficient framework while satisfying the delay requirements of real-time users.     

Synthesis,characterization, and supercapacitor studies of manganese (IV) oxide nanowires

One-dimensional manganese (IV) oxide (MnO₂) (～20 nm in average diameter) were synthesized by cathodic electrodeposition and heat treatment. The mechanism of electrodeposition and nanowire formation were discussed. The product was characterized by X-ray diffraction (XRD), scanning electron microscopy (SEM), transmission electron microscopy (TEM) and Fourier transform infrared (FT-IR). Nanowires with varying lengths and diameters were found in TEM and SEM images of the sample. The results of N₂ adsorption–desorption analysis indicated that the BET surface area of the MnO₂ nanowires was 157 m² g^?1 and the pore size distributions were 2.5 and 4.5 nm. The electrochemical performances of the prepared MnO₂ as an electrode material for supercapacitors were evaluated by cyclic voltammetry and galvanostatic charge/discharge measurements in a solution of 0.5 M Na₂SO₄. The higher specific capacitance of 318 F g^?1 and good capacity retention of 86% were achieved after 1000 charge–discharge cycles had been observed for the MnO₂ nanowires electrode.     

Steady-state analysis of quantized distributed incremental LMS algorithm without Gaussian restriction

In this paper, we analyze the steady-state performance of the distributed incremental least mean-square (DILMS) algorithm when it is implemented in finite-precision arithmetic. Our analysis in this paper does not consider any distribution of input data. We first formulate the update equation for quantized DILMS algorithm, and then we use a spatial-temporal energy conservation argument to derive theoretical expressions that evaluate the steady-state performance of individual nodes in the network. We consider mean-square error, excess mean-square error, and mean-square deviation as the performance criteria. Simulation results are generated by using two types of signals, Gaussian and non-Gaussian distributed signals. As the simulation results show, there is a good match between the theory and simulation.     

Velocity-image model for online signature verification.

In general, online signature capturing devices provide outputs in the form of shape and velocity signals. In the past, strokes have been extracted while tracking velocity signal minimas. However, the resulting strokes are larger and complicated in shape and thus make the subsequent job of generating a discriminative template difficult. We propose a new stroke-based algorithm that splits velocity signal into various bands. Based on these bands, strokes are extracted which are smaller and more simpler in nature. Training of our proposed system revealed that low- and high-velocity bands of the signal are unstable, whereas the medium-velocity band can be used for discrimination purposes. Euclidean distances of strokes extracted on the basis of medium velocity band are used for verification purpose. The experiments conducted show improvement in discriminative capability of the proposed stroke-based system.     

Collision avoidance slot allocation scheme for multi-cluster wireless sensor networks

This paper introduces a collision avoidance slot allocation scheme for Time Division Multiple Access (TDMA) based Medium Access Control (MAC) in multi-cluster wireless sensor networks. TDMA MAC protocols have built-in active-sleep duty cycle that can be leveraged for limiting idle listening. Also, they can overcome the overhearing problem, thus have better energy efficiency. Enabling concurrent intra-cluster communications using a single radio channel is a key issue in TDMA MAC protocols. Using orthogonal frequency channels or different Code Division Multiple Access codes for different adjacent clusters can solve the problem at the expense of cost. In this paper, we propose a new distributed slot allocation protocol called  Coordinated   Time   Slot   Allocation (CTSA) that can reduce collisions significantly using a single radio channel. We use simulations to study the effects of different system parameters on the performance of our proposed protocol. Simulation results show that applying CTSA over clustering protocols can significantly reduce collisions. It also shows fast convergence for our proposed CTSA protocol. In this paper we apply our CTSA scheme to the Low Energy Adaptive Clustering Hierarchy protocol which forms the basis for many cluster based routing protocols. CTSA is also compared with the SRSA algorithm proposed by Wu and Biswas (Wirel Netw 13(5):691–703, 2007) by means of simulation.