Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Time-modulation is applied to an array pattern by alternating a beamformer between two sets of beamforming coefficients. These are selected so signals arriving in the sidelobes are BPSK modulated by the beam-switching while signals in the main lobe are not. This technique enables sidelobe blanking using a single beamformer, which is simpler than other approaches.
The paper proposes an application of Hybrid Taguchi-Genetic Algorithm (HTGA) on short-term reactive power dispatch scheduling. HTGA is an algorithm combining traditional genetic algorithm of powerful global search function with Taguchi algorithm of orthogonal array and signal to noise ratio data, to reduce iteration times and acquire a better near optimal solution. The reactive power scheduling is...
In this paper, an improved version of compact Genetic Algorithm (M-cGA) is proposed for thinned array synthesis. By adding suitable learning scheme between probability vectors (PVs), improved cGA can effectively control the peak sidelobe (PSL) of thinned arrays. Its performances have been compared with those of a Genetic Algorthim, used alone or in conjunction with the Almost Different Set (ADS) for...
This paper presents a relay-based algorithm for the synthesis of a finite state machine to determine the optimal state assignment with less area and power dissipations. The algorithm utilizes the experience of past runners as in a relay race by a guide and the configuration of past solutions by a relay. Combined with rough and focusing methods, it could escape local optima and achieve an effective...
In this paper, we report on our work of embedding a self-recovery algorithm into a Field Programmable Gate Array (FPGA) board, as a means of radiation pattern recovery after failure of any antenna array element. In the previous work, the principle approach was laid out and sample failure cases discussed, followed by an example of a successful recovery of the pattern using a genetic algorithm (G A)-based...
This paper proposes a new strategy for solving the service restoration problem in large-scale distribution systems (DS). Due to the presence of various conflicting objective functions and constraints, the service restoration task is a multi-objective, multi-constraint optimization problem. As a consequence, finding feasible solutions is a hard task. The proposed strategy uses a new tree encoding,...
In this paper, it is first proposed that genetic algorithm and Taguchi method can be employed in the optimal design of DC-DC converter with RCD snubber. The purpose of this optimal design is to lower the spike voltage Vdsp of power switch and hence reduce the cost in manufacturing circuit. It is of great educational value for students and engineers. For the first step, we investigate the circuit parameters...
A low cost and profile switched beam array suitable for 2.4 GHz ISM and WLAN applications is proposed in this paper. The array comprises eight wire elements lying on the horizontal plane and a set of four possible, switching, beam patterns is provided. Sufficient front gain and input impedance matching is achieved with the aid of a simple genetic algorithm.
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.