• Title/Summary/Keyword: Simulated Algorithm

Search Result 1,795, Processing Time 0.025 seconds

Improved Convolutional Neural Network Based Cooperative Spectrum Sensing For Cognitive Radio

  • Uppala, Appala Raju;Narasimhulu C, Venkata;Prasad K, Satya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2128-2147
    • /
    • 2021
  • Cognitive radio systems are being implemented recently to tackle spectrum underutilization problems and aid efficient data traffic. Spectrum sensing is the crucial step in cognitive applications in which cognitive user detects the presence of primary user (PU) in a particular channel thereby switching to another channel for continuous transmission. In cognitive radio systems, the capacity to precisely identify the primary user's signal is essential to secondary user so as to use idle licensed spectrum. Based on the inherent capability, a new spectrum sensing technique is proposed in this paper to identify all types of primary user signals in a cognitive radio condition. Hence, a spectrum sensing algorithm using improved convolutional neural network and long short-term memory (CNN-LSTM) is presented. The principle used in our approach is simulated annealing that discovers reasonable number of neurons for each layer of a completely associated deep neural network to tackle the streamlining issue. The probability of detection is considered as the determining parameter to find the efficiency of the proposed algorithm. Experiments are carried under different signal to noise ratio to indicate better performance of the proposed algorithm. The PU signal will have an associated modulation format and hence identifying the presence of a modulation format itself establishes the presence of PU signal.

Multiaxial ratcheting assessment of Z2CND18.12N steel using modified A-V hardening rule

  • Xiaohui Chen;Yang Zhou;Wenwu Liu;Xu Zhao
    • Steel and Composite Structures
    • /
    • v.49 no.1
    • /
    • pp.1-17
    • /
    • 2023
  • Based on Ahmadzadeh-Varvani hardening rule (A-V model), multiaxial ratcheting effect of Z2CND18.12N austenitic stainless steel is simulated by ABAQUS with user subroutine UMAT. The results show that the predicted results of the origin multiaxial A-V model are lower than the experimental data, and it is difficult to control ratcheting strain rate. In order to improve the predicted capability of A-V model, the A-V model is modified. In this study. Moreover, under the assumption of the von Mises yield criterion and normal plasticity flow rule, we develop a numerical algorithm of plastic strain with the improved model to implement the finite element calculation of the model. Internal iteration in the numerical algorithm was implemented with the Euler backward method, which calculated the trial strain for each equilibrium iteration using the consistent tangent matrix. With a user subroutine, the proposed model is programmed into ABAQUS for a user - executable version. By simulating the uniaxial ratcheting of a round bar made of Z2CND18.12N austenitic stainless steel, we observe that the predicted results simulated by ABAQUS with UMAT are compared with the experimental data. The predicted results of the improved multiaxial A-V model are consistent well with the experimental data.

Simulated Annealing for Two-Agent Scheduling Problem with Exponential Job-Dependent Position-Based Learning Effects (작업별 위치기반 지수학습 효과를 갖는 2-에이전트 스케줄링 문제를 위한 시뮬레이티드 어닐링)

  • Choi, Jin Young
    • Journal of the Korea Society for Simulation
    • /
    • v.24 no.4
    • /
    • pp.77-88
    • /
    • 2015
  • In this paper, we consider a two-agent single-machine scheduling problem with exponential job-dependent position-based learning effects. The objective is to minimize the total weighted completion time of one agent with the restriction that the makespan of the other agent cannot exceed an upper bound. First, we propose a branch-and-bound algorithm by developing some dominance /feasibility properties and a lower bound to find an optimal solution. Second, we design an efficient simulated annealing (SA) algorithm to search a near optimal solution by considering six different SAs to generate initial solutions. We show the performance superiority of the suggested SA using a numerical experiment. Specifically, we verify that there is no significant difference in the performance of %errors between different considered SAs using the paired t-test. Furthermore, we testify that random generation method is better than the others for agent A, whereas the initial solution method for agent B did not affect the performance of %errors.

Implementation of Rijndael Block Cipher Algorithm

  • Lee, Yun-Kyung;Park, Young-Soo
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.164-167
    • /
    • 2002
  • This paper presents the design of Rijndael crypto-processor with 128 bits, 192 bits and 256 bits key size. In October 2000 Rijndael cryptographic algorithm is selected as AES(Advanced Encryption Standard) by NIST(National Institute of Standards and Technology). Rijndael algorithm is strong in any known attacks. And it can be efficiently implemented in both hardware and software. We implement Rijndael algorithm in hardware, because hardware implementation gives more fast encryptioN/decryption speed and more physically secure. We implemented Rijndael algorithm for 128 bits, 192 bits and 256 bits key size with VHDL, synthesized with Synopsys, and simulated with ModelSim. This crypto-processor is implemented using on-the-fly key generation method and using lookup table for S-box/SI-box. And the order of Inverse Shift Row operation and Inverse Substitution operation is exchanged in decryption round operation of Rijndael algorithm. It brings about decrease of the total gate count. Crypto-processor implemented in these methods is applied to mobile systems and smart cards, because it has moderate gate count and high speed.

  • PDF

Finite Element Analysis of Forming Processes With Free Surface Contact Algorithm (성형공정의 자유 경계면 접촉에 관한 유한요소 해석)

  • 한영원;임용택
    • Transactions of Materials Processing
    • /
    • v.4 no.1
    • /
    • pp.48-58
    • /
    • 1995
  • In this study, a contact algorithm for the finite element analysis of free surface contact problem in materials forming is presented. The proposed contact algorithm consists of two parts. The first is the contact searching part, and the second, the constraint part. The contact searching algorithm does not require any a priori knowledge of the pairs of contact nodes or segments and the impenetrability constraint is satisfied using the penalty function scheme. void colsure in open-die forging was simulated to verify the accuracy and capability of the currently developed contact algorithm. The simulation results, obtained from ABAQUS simulation, were compared well to the experimental data available in the literature.

  • PDF

Fast Algorithm for Design of Spiral Inductor using Genetic Algorithm with Distributed Computing (유전 알고리듬과 분산처리기법을 이용한 스파이럴 인덕터의 고속설계 기법)

  • Sa, Ki-Dong;Ahn, Chang-Hoi
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.3
    • /
    • pp.446-452
    • /
    • 2008
  • To design a spiral inductor a genetic algorithm is applied with fast computing technique. For the inductance extraction of the given geometry the fast multipole method is used, also the distributed computing technique using 10 personal computers is introduced for the massive computation of the genetic algorithm. A few important design parameters are used as genes for the optimization in the genetic algorithm. The target function is chosen as mean square error of the inductance at several sampling frequency points. A large-scaled inductor is fabricated and compared with the simulated data.

Nonlinear Blind Equalizer Using Hybrid Genetic Algorithm and RBF Networks

  • Han, Soo-Whan;Han, Chang-Wook
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1689-1699
    • /
    • 2006
  • A nonlinear channel blind equalizer by using a hybrid genetic algorithm, which merges a genetic algorithm with simulated annealing, and a RBF network is presented. In this study, a hybrid genetic algorithm is used to estimate the output states of a nonlinear channel, based on the Bayesian likelihood fitness function, instead of the channel parameters. From these estimated output states, the desired channel states of the nonlinear channel are derived and placed at the center of a RBF equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a conventional genetic algorithm(GA) and a simplex GA, and the relatively high accuracy and fast convergence of the method are achieved.

  • PDF

An Enhanced Compensation Algorithm for the CT Saturation Using Interpolation-based LSQ(Least Square) Fitting Method (내삽법 기반의 최소자승법을 이용한 개선된 CT 포화 복원 알고리즘)

  • Ryu, Ki-Chan;Kang, Sang-Hee;Lee, Bong-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 2006.07a
    • /
    • pp.14-15
    • /
    • 2006
  • A saturation of magnetic flux in the core may occur when a large primary current flows when the iron-cored current transformer is used. This saturation makes the distorted secondary current of the CT. the distorted secondary current may cause the mal-operation or operation time delay of protective relays. CT compensation algorithm using The LSQ(Least Square) fitting method has a problem. It needs to acquire enough data for executing this algorithm without an error. In this paper, an enhanced algorithm using interpolation based LSQ(Least Square) Fitting Method is proposed. The Lagrange Interpolation Method is used for the interpolation and CT is simulated by EMTP. The results show that the proposed algorithm can accurately compensate a distorted secondary current more than existing Algorithm when the saturation severely occurs.

  • PDF

Model-Based Tabu Search Algorithm for Free-Space Optical Communication with a Novel Parallel Wavefront Correction System

  • Li, Zhaokun;Zhao, Xiaohui;Cao, Jingtai;Liu, Wei
    • Journal of the Optical Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.45-54
    • /
    • 2015
  • In this study, a novel parallel wavefront correction system architecture is proposed, and a model-based tabu search (MBTS) algorithm is introduced for this new system to compensate wavefront aberration caused by atmospheric turbulence in a free-space optical (FSO) communication system. The algorithm flowchart is presented, and a simple hypothetical design for the parallel correction system with multiple adaptive optical (AO) subsystems is given. The simulated performance of MBTS for an AO-FSO system is analyzed. The results indicate that the proposed algorithm offers better performance in wavefront aberration compensation, coupling efficiency, and convergence speed than a stochastic parallel gradient descent (SPGD) algorithm.

Fault Location Algorithm with Ground Capacitance Compensation for Long Parallel Transmission Line (장거리 병렬 송전선로용 대지 정전용량 보상에 의한 고장점 표정 알고리즘)

  • Park, Chul-Won;Kim, Sam-Ryong;Shin, Myong-Chul
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.54 no.4
    • /
    • pp.163-170
    • /
    • 2005
  • This paper deals with an improved fault location algorithm with compensation ground capacitance through distributed parameter for a long parallel T/L. For the purpose of fault locating algorithm non-influenced by source impedance and fault resistance, the loop method was used in the system modeling analysis. This algorithm uses a positive and negative sequence of the fault current for high accuracy of fault locating calculation. Power system model of 160km and 300km long parallel T/L was simulated using EMTP software. To evaluate of the proposed algorithm, we used the several different cases 64 sampled data per cycle. The test results show that the proposed algorithm was minimized the error factor and speed of fault location estimation.