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.     

Coplanar Waveguide Fed Printed Antenna with Compact Size for Broadband Wireless Applications

A novel and simple coplanar waveguide fed compact antenna is introduced in this paper. The antenna structure combines the advantages of CPW with those of the broadband antenna and simplifies the structure of the antenna by reducing the number of metallization level to construct uni-planar antenna. Prototype of the proposed antenna have been constructed and studied experimentally. The measured results agrees well with the simulated prediction and shows a broad bandwidth of 6 GHz ranging from 3.5 GHz to 9.5 GHz with VSWR ≤2 (return loss ≤−10 dB), which is equivalent to 92.3% impedance bandwidth centered at 6.5 GHz. The proposed antenna shows stable radiation characteristics, gain and axial ratio of less than 1 dB over the whole operating bandwidth. Furthermore, an extensive parametric study was performed to realize the relationship between the resonance frequencies of the broadband antennas and different parameters which is helpful for advancement of the antenna design.     

Fabrication of Sub‐10 nm Metallic Lines of Low Line‐Width Roughness by Hydrogen Reduction of Patterned Metal–Organic Materials

The fabrication of very narrow metal lines by the lift‐off technique, especially below sub‐10 nm, is challenging due to thinner resist requirements in order to achieve the lithographic resolution. At such small length scales, when the grain size becomes comparable with the line‐width, the built‐in stress in the metal film can cause a break to occur at a grain boundary. Moreover, the line‐width roughness (LWR) from the patterned resist can result in deposited metal lines with a very high LWR, leading to an adverse change in device characteristics. Here a new approach that is not based on the lift‐off technique but rather on low temperature hydrogen reduction of electron‐beam patterned metal naphthenates is demonstrated. This not only enables the fabrication of sub‐10 nm metal lines of good integrity, but also of low LWR, below the limit of 3.2 nm discussed in the International Technology Roadmap for Semiconductors. Using this method, sub‐10 nm nickel wires are obtained by reducing patterned nickel naphthenate lines in a hydrogen‐rich atmosphere at 500 °C for 1 h. The LWR (i.e., 3 σ_LWR) of these nickel nanolines was found to be 2.9 nm. The technique is general and is likely to be suitable for fabrication of nanostructures of most commonly used metals (and their alloys), such as iron, cobalt, nickel, copper, tungsten, molybdenum, and so on, from their respective metal–organic compounds.     

All-optical 6- and 8-channel demultiplexers based on photonic crystal multilayer ring resonators in Si/C rods

In this paper, we employed multilayer ring resonators in a silicon rod base structure to realize 6-channel and 8-channel demultiplexers based on two-dimensional photonic crystals. Both the main rings and basic structures are composed of silicon rods, and the interior rings of the multilayer rings are composed of carbon. Employing silicon and carbon rods of different radii in multilayer ring resonators enhanced the coupling efficiency between the rings and waveguides. The average quality factor and power transmission efficiency were 4320 and 93%, respectively. Crosstalk values from \(-11\) to ?46 dB in conjunction with the mentioned characteristics suggest the use of the device for optical communication applications. The compact size of the proposed structure and the materials used make the proposed demultiplexer suitable for optical integrated circuits.     

Implicit polynomial representation through a fast fitting error estimation

This paper presents a simple distance estimation for implicit polynomial fitting. It is computed as the height of a simplex built between the point and the surface (i.e., a triangle in 2-D or a tetrahedron in 3-D), which is used as a coarse but reliable estimation of the orthogonal distance. The proposed distance can be described as a function of the coefficients of the implicit polynomial. Moreover, it is differentiable and has a smooth behavior . Hence, it can be used in any gradient-based optimization. In this paper, its use in a Levenberg-Marquardt framework is shown, which is particularly devoted for nonlinear least squares problems. The proposed estimation is a generalization of the gradient-based distance estimation, which is widely used in the literature. Experimental results, both in 2-D and 3-D data sets, are provided. Comparisons with state-of-the-art techniques are presented, showing the advantages of the proposed approach.     

Robust weighted graph transformation matching for rigid and nonrigid image registration

This paper presents an automatic point matching algorithm for establishing accurate match correspondences in two or more images. The proposed algorithm utilizes a group of feature points to explore their geometrical relationship in a graph arrangement. The algorithm starts with a set of matches (including outliers) between the two images. A set of nondirectional graphs is then generated for each feature and its K nearest matches (chosen from the initial set). Using the angular distances between edges that connect a feature point to its K nearest neighbors in the graph, the algorithm finds a graph in the second image that is similar to the first graph. In the case of a graph including outliers, the algorithm removes such outliers (one by one, according to their strength) from the graph and re-evaluates the angles until the two graphs are matched or discarded. This is a simple intuitive and robust algorithm that is inspired by a previous work. Experimental results demonstrate the superior performance of this algorithm under various conditions, such as rigid and nonrigid transformations, ambiguity due to partial occlusions or match correspondence multiplicity, scale, and larger view variation.     

Comparative study of two CPU router time management algorithms in cellular IP networks

Providing good quality of service (QoS) in cellular IP networks is an important requirement for performance improvement of the cellular IP network. Resource reservation is one of the methods used in achieving this goal and is proven to be effective. The main resources to be reserved in a cellular IP network are bandwidth, buffer and central processing unit (CPU) cycles. Router CPU cycle is the time taken by the router to process the packet of the flow before forwarding it to the next router (hop). This paper proposes a model for CPU cycle optimization of routers for real‐time flows in a cellular IP network. The model applies both genetic algorithm (GA) and particle swarm optimization (PSO) as soft computing tools to optimize the CPU cycles and reduces the flow processing time at each router in the route taken by a flow. Simulation experiments illustrate a comparative study of the model.     

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.     

A new learning automata based approach for increasing utility of service providers

Utility is an important factor for serviceproviders, and they try to increase their utilities through adopting different policies and strategies. Because of unpredictable failures in systems, there are many scenarios in which the failures may cause random losses for service providers. Loss sharing can decrease negative effects of unexpected random losses. Because of capabilities of learning automata in random and stochastic environments, in this paper, a new learning automaton based method is presented for loss sharing purpose. It is illustrated that the loss sharing can be useful for service providers and helps them to decrease negative effect of the random losses. The presented method can be used especially in collaborative environments such as federated clouds. Results of the conducted experiments show the usefulness of the presented approach to improve utility of service providers.     

Multi-Stage CMOS OTA Frequency Compensation: Genetic algorithm approach

Multistage amplifiers have become appropriate choices for high-speed electronics and data conversion. Because of the large number of high-impedance nodes, frequency compensation has become the biggest challenge in the design of multistage amplifiers. The new compensation technique in this study uses two differential stages to organize feedforward and feedback paths. Five Miller loops and a 500-pF load capacitor are driven by just two tiny compensating capacitors, each with a capacitance of less than 10 pF. The symbolic transfer function is calculated to estimate the circuit dynamics and HSPICE and TSMC 0.18 μm. CMOS technology is used to simulate the proposed five-stage amplifier. A straightforward iterative approach is also used to optimize the circuit parameters given a known cost function. According to simulation and mathematical results, the proposed structure has a DC gain of 190 dB, a gain bandwidth product of 15 MHz, a phase margin of 89°, and a power dissipation of 590 μW.