Optimal Design of FIR Digital Filter Using Genetic Algorithm

１ＩｎｔｒｏｄｕｃｔｉｏｎＧｅｎｅｔｉｃａｌｇｏｒｉｔｈｍ（ＧＡ）ｆｏｕｎｄｂｙＪ．Ｈ．Ｈｏｌａｎｄ［１］ｉｓａｒｏｂｕｓｔａｎｄｅｆｉｃｉｅｎｔｏｐｔｉｍｉｚａｔｉｏｎｐｒｏｃｅｄｕｒｅｗｈｉｃｈｉｓｃａｐａｂｌｅｏｆｆｉｎｄｉｎｇｔｈｅｇｌｏｂａ...     

A Design Example of a Fractional-Order Kerwin–Huelsman–Newcomb Biquad Filter with Two Fractional Capacitors of Different Order

Design, realization and performance studies of continuous-time fractional order Kerwin–Huelsman–Newcomb (KHN) biquad filters have been presented. The filters are constructed using two fractional order capacitors (FC) of orders α and β (0<α, β≤1). The frequency responses of the filters, obtained experimentally have been compared with simulated results using MATLAB/SIMULINK and also with PSpice (Cadence PSD 14.2), where the fractional order capacitor is approximated by a domino ladder circuit. It has been observed that fractional order filters can give better performance in certain aspects compared to integer order filters. The effects of the exponents (α and β) on bandwidth and stability of the realized filter have been examined. Sensitivity analysis of the realized fractional order filter has also been carried out to investigate the deviation of the performance due to the parameter variation.     

A Design of Observers for a Discrete Chaotic System

1　ＩｎｔｒｏｄｕｃｔｉｏｎＳｉｎｃｅ 1 990’ｓ,ｔｈｅｃｈａｏｔｉｃｓｙｎｃｈｒｏｎｉｚａｔｉｏｎａｎｄｃｈａｏｔｉｃｃｏｎｔｒｏｌｌｉｎｇｈａｖｅｂｅｅｎｔｈｅｈｏｔｓｐｏｔｉｎｔｈｅｒｅ ｓｅａｒｃｈｏｆｎｏｎ ｌｉｎｅａｒｓｙｓｔｅｍｆｉｅｌｄ .Ｓｏｍｅｉｍｐｏｒｔａｎｔｍｅｔｈｏｄｓ[1～ 5] ｏｆｃｈａｏｔｉｃｓｙｎｃｈｒｏｎｉｚａｔｉｏｎａｎｄｃｈａｏｔｉｃｃｏｎｔｒｏｌｌｉｎｇａｒｅｓｔａｔｅｆｅｅｄｂａｃｋｃｏｎｔｒｏｌｌｉｎｇｍｅｔｈｏｄｓ,ｆｏｒｅｘａｍｐｌｅ ,ＰｅｃｏｒａａｎｄＣ…     

Scheduling of Iterative Algorithms with Matrix Operations for Efficient FPGA Design—Implementation of Finite Interval Constant Modulus Algorithm

This paper deals with the optimization of iterative algorithms with matrix operations or nested loops for hardware implementation in Field Programmable Gate Arrays (FPGA), using Integer Linear Programming (ILP). The method is demonstrated on an implementation of the Finite Interval Constant Modulus Algorithm. It is an equalization algorithm, suitable for modern communication systems (4G and behind). For the floating-point calculations required in the algorithm, two arithmetic libraries were used in the FPGA implementation: one based on the logarithmic number system, the other using floating-point number system in the standard IEEE format. Both libraries use pipelined modules. Traditional approaches to the scheduling of nested loops lead to a relatively large code, which is unsuitable for FPGA implementation. This paper presents a new high-level synthesis methodology, which models both, iterative loops and imperfectly nested loops, by means of the system of linear inequalities. Moreover, memory access is considered as an additional resource constraint. Since the solutions of ILP formulated problems are known to be computationally intensive, an important part of the article is devoted to the reduction of the problem size.

On the Realization of Multiphase Oscillators Using?Fractional-Order Allpass Filters

In this paper multiphase oscillators built using fractional-order allpass filters are presented. We examine the theory behind their operation and demonstrate their usefulness in the design of both multiphase and quadrature oscillators. Case design examples are given for various scenarios, while PSPICE and experimental results verify their operation     

Design and Implementation of a Bandpass–Bandpass Diplexer Using Coupled Structures

Wireless Personal Communications - In this paper, a bandpass–bandpass two channels diplexer with operating frequencies of 1.7 GHz and 2.1 GHz is designed and fabricated on RT/duroid...     

Application of a Hybrid Taguchi-Genetic Algorithm to the Multiobjective Design Optimization of Yagi–Uda Antennas

In this paper, a hybrid Taguchi-genetic algorithm (HTGA) is used to optimize Yagi–Uda antennas. The method combines the traditional genetic algorithm, known to have a powerful global exploration capability, with the Taguchi method, which can exploit the optimum offspring and consequently, enhance the genetic algorithm. The aim is to devise antenna geometrical parameters that allow the antenna to simultaneously improve multiple performances such as gain, sidelobe level, and input impedance. Thus, not only will a new antenna configuration be found, but the demonstration of the ability of the HTGA method to design antenna structures with more than one goal is investigated as well.     

Bioinspired Fractal Design of Waste Biomass-Derived Solar–Thermal Materials for Highly Efficient Solar Evaporation

Solar evaporation is considered a promising technology to address the issue of fresh water scarcity. Although many efforts have been directed towards increasing the solar–thermal conversion efficiency, there remain challenges to develop efficient and cost-effective solar–thermal materials from readily available raw materials. Furthermore, further structural modification of the original biomass structure, particularly at multiple length scales, are seldom reported, which may further improve the solar–thermal performance of these material systems. Herein, a novel low-cost system is developed based on a common bio-waste, pomelo peels (PPs), through a bioinspired fractal structural design strategy, fractal carbonized pomelo peels (FCPP). This FCPP system shows an extremely high solar spectrum absorption of ≈98%, and marvelous evaporation rate of 1.95 kg m⁻² h⁻¹ with a solar–thermal efficiency of 92.4%. In addition, the mechanisms of the evaporation enhancement by fractal structural design are identified by numerical and experimental methods. Moreover, using FCPP in solar desalination shows great superiority in terms of cost and its potential in sewage treatment is also studied. The present work is an insightful attempt on providing a novel proposal to develop bio-waste-derived solar–thermal materials and construct biomimetic structures for efficient solar evaporation and applications.     

Pilot Tones Optimization Using Artificial Bee Colony Algorithm for MIMO–OFDM Systems

How to design the pilot tones that are used in channel estimation has a significant effect on the estimation performance. To achieve good performance in least square (LS) algorithm, we propose the artificial bee colony (ABC) algorithm for optimizing the placement of pilot tones in MIMO–OFDM systems. We also derive the upper bound of mean square error of LS estimation with the help of Gerschgorin disc theorem for fitness function of ABC algorithm. The results show that designing pilot tones using the ABC algorithm outperforms other considered placement strategies in terms of high system performance and low computational complexity.     

Optimum Trans–Receiver Scheme Using Cross Layer Design for Acoustic Communication

The main objective of this work is to reduce the packet loss due to packet error rate and buffer overflow for under water sensor network. In this work, a system is mapped into various states based on channel condition, buffer space, and available energy level. The set of policies are defined in terms of transmission power level, adaptive modulation scheme, and various transmission rate. We have proposed Optimum Trans–Receiver Scheme (OTRS), in which the problem is formulated as per Markov decision process model and solution is sought in terms of optimum policy identification for an individual state of the system. We have evaluated the performance of OTRS by extensive simulation with existing Adaptive Modulation Power Adaption, Power Adaption with 2 Ary Frequency Shift Keying and Power Adaption with 8 Ary Frequency Shift Keying for various performance matrices like Net Bit Rate and number of packet loss for various state of the system.

     

Efficient Hybrid Linear Massive MIMO Detector Using Gauss–Seidel And Successive Over-Relaxation

The initial solution of a massive multiple-input multiple-output (M-MIMO) detector for uplink (UL) is greatly influence the balance between the bit error rate (BER) performance and the computational complexity. Although the maximum likelihood (ML) detector obtains the best BER performance, it has an extremely high computational complexity. Iterative linear minimum mean square error (MMSE) detector based on the Gauss–Seidel (GS), the successive over-relaxation (SOR), and the Jacobi (JA), obtains a good performance-complexity profile when the base station (BS)-to-user-antenna-ratio (BUAR) is large. However, when the BUAR is small, the system suffers from a considerable performance loss. In this paper, a hybrid detector based on the joint GS and SOR methods is proposed where the initial solution is determined by the first iteration of GS method. Numerical results show a considerable complexity reduction and performance enhancement using the proposed GS-SOR method over all methods when the BUAR is small.

     

Analysis and Optimum Design of Differential Inductors Using Distributed Capacitance Model

A distributed capacitance model for monolithic inductors is developed to predict the equivalently parasitical capacitances of the inductor.The ratio of the self-resonant frequency (fSR) of the differential-driven symmetric inductor to the fSR of the single-ended driven inductor is firstly predicted and explained.Compared with a single-ended configuration,experimental data demonstrate that the differential inductor offers a 127% greater maximum quality factor and a broader range of operating frequencies.Two differential inductors with low parasitical capacitance are developed and validated.     

Design of Time–Frequency Optimal Three-Band Wavelet Filter Banks with Unit Sobolev Regularity Using Frequency Domain Sampling

In this paper, we design three-band time–frequency-localized orthogonal wavelet filter banks having single vanishing moment. We propose new expressions to compute mean and variances in time and frequency from the samples of the Fourier transform of the asymmetric band-pass compactly supported wavelet functions. We determine discrete-time filter of length eight that generates the time–frequency optimal time-limited scaling and wavelet functions using cascade algorithm. Time–frequency product (TFP) of a function is defined as the product of its time variance and frequency variance. The TFP of the designed functions is close to 0.25 with unit Sobolev regularity. Three-band filter banks are designed by minimizing a weighted combination of TFPs of wavelets and scaling functions. Interestingly, empirical results show that time–frequency optimal, filter banks of length nine, designed with the proposed methodology, have unit Sobolev regularity, which is maximum achievable with single vanishing moment. Design examples for length six and length nine filter banks are given to demonstrate the effectiveness of the proposed design methodology.     

Design and Realization of CPW Circuits Using EC-ANN Models for CPW Discontinuities

将一种精确高效的等效电路训练人工神经网络模型引入共面波导不连续性结构建模.该建模算法继承了等效电路模型和电磁仿真人工神经网络模型的优点.此次开发并得到验证的共面波导不连续性结构模型包括:台阶段、叉指电容、对称十字节和螺旋电感.这些模型嵌入CAD仿真工具可以完成电路的设计、仿真和优化,最后通过一个GaAs工艺的共面波导带通滤波器的设计与实现验证了模型的有效性.     

An Algorithm for the Design of a Cost-Optimized Topology for the Fixed Part of a GSM Network

1　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｆｉｒｓｔＧＳＭｍｏｂｉｌｅｎｅｔｗｏｒｋｓｃａｍｅｉｎｔｏｏｐ ｅｒａｔｉｏｎｉｎｔｈｅｅａｒｌｙｎｉｎｔｉｅｓ.Ｓｉｎｃｅｔｈｅｎ ,ｔｈｅｒｅｈａｓｂｅｅｎａｔｒｅｍｅｎｄｏｕｓｉｎｃｒｅａｓｅｏｆｓｕｂｓｃｒｉｂｅｒｓａｎｄａｃｏｎ ｔｉｎｕｏｕｓｅｘｐａｎｓｉｏｎｏｆｔｈｅｎｅｔｗｏｒｋｉｎｆｒａｓｔｒｕｃｔｕｒｅ .Ａｍｏｎｇｓｍａｌｌｅｒｎｏｄｅｓｆｏｒｓｕｂｓｃｒｉｂｅｒｓａｎｄｅｑｕｉｐ ｍｅｎｔａｄｍｉｎｉｓｔｒａｔｉｏｎ .Ｔｈｅｓｗｉｔｃｈｉｎｇｐ…     

Design and Optimization of Quasi–Optical Frequency Multipliers

This paper presents a full–wave algorithm for the design and the optimization of quasi–optical frequency multipliers and discusses its implementation in a specialized computer code, able to simulate as a whole the non–linear device, the planar antenna and the embedding layered structure. The electromagnetic analysis of the multiplier is performed under the simplifying approximation of an infinite array excited by a uniform plane wave incident from the broadside direction. The array parameters are deduced from a full–wave analysis, based on the Method of the Moments, while the solution of the non–linear circuit is found by the Harmonic Balance Method.     

Automata Based Hybrid PSO–GWO Algorithm for Secured Energy Efficient Optimal Routing in Wireless Sensor Network

The main objective in wireless sensor networks is to exploit efficiently the sensor nodes and to prolong the lifetime of the network. The discussion of energy is a significant concern to extend the lifetime of the network. Moreover, a nature inspired hybrid optimization approach called hybrid Particle Swarm Optimization–Grey Wolf Optimizer (PSO–GWO) is used in this work to efficiently utilize the energy and to transmit the data securely in an augmented path. A Learning Dynamic Deterministic Finite Automata (LD²FA) has been innovated and initiated to learn the dynamic role of the environment. LD²FA is mainly used to provide the learned and accepted string to hybrid PSO–GGWO so that the routes are optimized. Hybrid PSO–GWO is used to choose the optimal next node for each path to obtain the optimal route. The simulation results are obtained in MATLAB for 100–700 sensor nodes in a region of 500 × 500 m² which demonstrate that the proposed LD²FA based Hybrid PSO–GWO algorithm obtains better results when compared with existing algorithms. It is observed that LD²FA based Hybrid PSO–GWO has an increase of 18% and 48% betterment in lifetime of the network than PSO and GLBCA, nearly 57% and 75% increase in network lifetime when compared with GA and LDC respectively. It also shows an improvement of 24% increase compared to cluster-based IDS, nearly a rise of 90% throughput when compared with lightweight IDS. The consumption of energy is reduced by 13% and 15% than PSO and GA and an increase of 15% utilization of energy than LDC. Therefore, LD²FA based Hybrid PSO–GWO is been considered to efficiently utilize energy in an optimal route.

     

An Efficient Particle Filter–based Tracking Method Using Graphics Processing Unit (GPU)

Particle filter has been proven very robust in handling non-linear and non-Gaussian problems and has been widely used in the area of object tracking. One of the main problems in particle filter-based object tracking is, however, its high computational cost induced by the most time-consuming stage of measurement model computation. This paper makes progress in resolving the problem by proposing an efficient particle filter-based tracking algorithm using color information. First, a compact color cooccurrence histogram is presented, which considers both spatial and color information and can effectively represent color distribution with a very small number of histogram bins. The paper also introduces integral images by which the cooccurrence histogram can be obtained with simple array reference operations. However, the construction of the integral images on the CPU may be computationally expensive. Hence, this paper develops parallel algorithms on a desktop Graphics Processing Unit (GPU), which accomplishes the integral images construction and cooccurrence histogram computation after bin index determination. The resulting algorithm is quite efficient and has better performance than the traditional histogram-based tracking algorithm. The tracking time of the proposed algorithm increases insignificantly with the growth of particle number, and it remains consistent among varying image sequences and stable throughout all frames in the same image sequence due to its irrelevance to object size. Experiments in diverse image sequences validate our conclusions.