• Title/Summary/Keyword: Vector code generator

Search Result 9, Processing Time 0.024 seconds

A Predictive Model of the Generator Output Based on the Learning of Performance Data in Power Plant (발전플랜트 성능데이터 학습에 의한 발전기 출력 추정 모델)

  • Yang, HacJin;Kim, Seong Kun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.12
    • /
    • pp.8753-8759
    • /
    • 2015
  • Establishment of analysis procedures and validated performance measurements for generator output is required to maintain stable management of generator output in turbine power generation cycle. We developed turbine expansion model and measurement validation model for the performance calculation of generator using turbine output based on ASME (American Society of Mechanical Engineers) PTC (Performance Test Code). We also developed verification model for uncertain measurement data related to the turbine and generator output. Although the model in previous researches was developed using artificial neural network and kernel regression, the verification model in this paper was based on algorithms through Support Vector Machine (SVM) model to overcome the problems of unmeasured data. The selection procedures of related variables and data window for verification learning was also developed. The model reveals suitability in the estimation procss as the learning error was in the range of about 1%. The learning model can provide validated estimations for corrective performance analysis of turbine cycle output using the predictions of measurement data loss.

Support vector ensemble for incipient fault diagnosis in nuclear plant components

  • Ayodeji, Abiodun;Liu, Yong-kuo
    • Nuclear Engineering and Technology
    • /
    • v.50 no.8
    • /
    • pp.1306-1313
    • /
    • 2018
  • The randomness and incipient nature of certain faults in reactor systems warrant a robust and dynamic detection mechanism. Existing models and methods for fault diagnosis using different mathematical/statistical inferences lack incipient and novel faults detection capability. To this end, we propose a fault diagnosis method that utilizes the flexibility of data-driven Support Vector Machine (SVM) for component-level fault diagnosis. The technique integrates separately-built, separately-trained, specialized SVM modules capable of component-level fault diagnosis into a coherent intelligent system, with each SVM module monitoring sub-units of the reactor coolant system. To evaluate the model, marginal faults selected from the failure mode and effect analysis (FMEA) are simulated in the steam generator and pressure boundary of the Chinese CNP300 PWR (Qinshan I NPP) reactor coolant system, using a best-estimate thermal-hydraulic code, RELAP5/SCDAP Mod4.0. Multiclass SVM model is trained with component level parameters that represent the steady state and selected faults in the components. For optimization purposes, we considered and compared the performances of different multiclass models in MATLAB, using different coding matrices, as well as different kernel functions on the representative data derived from the simulation of Qinshan I NPP. An optimum predictive model - the Error Correcting Output Code (ECOC) with TenaryComplete coding matrix - was obtained from experiments, and utilized to diagnose the incipient faults. Some of the important diagnostic results and heuristic model evaluation methods are presented in this paper.

Analysis of Code Sequence Generating Algorism and Implementation of Code Sequence Generator using Boolean Functions (부울함수를 이용한 부호계열 발생알고리즘 분석 부호계열발생기 구성)

  • Lee, Jeong-Jae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.13 no.4
    • /
    • pp.194-200
    • /
    • 2012
  • In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.

Minimum Row Weight and Polar Spectrum Based Puncture Polar Codes Construction Algorithm

  • Liu Daofu;Guo Rui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2157-2169
    • /
    • 2023
  • In order to handle the problem that puncture patterns will change the position distribution of original information bits and frozen bits in polar codes, which affects performance of puncture polar codes further, a minimum row weight and polar spectrum based puncture polar codes construction algorithm (called PA-MRWP) is proposed in this paper. The algorithm calculates row weight of generator matrix and sorts the row weight in ascending order first. Next, the positions with the minimum row weight are selected as initial puncture positions. If the rows with the same row weight cannot all be punctured, polar spectrum based auxiliary puncture scheme is used. In sub-channels with the same row weight, rows corresponding to the polarized sub-channels with higher reliability are selected as puncture positions to construct puncture vector, and the reliability is calculated based on polar spectrum. It is actually a two-step selection strategy, the proposed minimum row weight puncture (MRWP) algorithm is used for primary selection and polar spectrum based auxiliary puncture is used for adjustment. Simulation results show that, compared with worst quality puncture (WQP) algorithm, the proposed PA-MRWP algorithm and Gaussian approximation-aided minimum row weight puncture (GA-MRWP) algorithm provide gains of about 0.46 dB and 0.29 dB at bit error rate (BER) of 10-4, respectively when code length N=400, code rate R=1/2. In addition, the proposed puncture algorithms improve the BER performance significantly with respect to quasi-uniform puncture (QUP) algorithm.

A Study on Design of High-Speed Parallel Multiplier over GF(2m) using VCG (VCG를 사용한 GF(2m)상의 고속병렬 승산기 설계에 관한 연구)

  • Seong, Hyeon-Kyeong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.3
    • /
    • pp.628-636
    • /
    • 2010
  • In this paper, we present a new type high speed parallel multiplier for performing the multiplication of two polynomials using standard basis in the finite fields GF($2^m$). Prior to construct the multiplier circuits, we design the basic cell of vector code generator(VCG) to perform the parallel multiplication of a multiplicand polynomial with a irreducible polynomial and design the partial product result cell(PPC) to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial with VCG circuits. The presented multiplier performs high speed parallel multiplication to connect PPC with VCG. The basic cell of VCG and PPC consists of one AND gate and one XOR gate respectively. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields GF($2^4$). Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper uses the VCGs and PPCS repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSL.

MONITORING SEVERE ACCIDENTS USING AI TECHNIQUES

  • No, Young-Gyu;Kim, Ju-Hyun;Na, Man-Gyun;Lim, Dong-Hyuk;Ahn, Kwang-Il
    • Nuclear Engineering and Technology
    • /
    • v.44 no.4
    • /
    • pp.393-404
    • /
    • 2012
  • After the Fukushima nuclear accident in 2011, there has been increasing concern regarding severe accidents in nuclear facilities. Severe accident scenarios are difficult for operators to monitor and identify. Therefore, accurate prediction of a severe accident is important in order to manage it appropriately in the unfavorable conditions. In this study, artificial intelligence (AI) techniques, such as support vector classification (SVC), probabilistic neural network (PNN), group method of data handling (GMDH), and fuzzy neural network (FNN), were used to monitor the major transient scenarios of a severe accident caused by three different initiating events, the hot-leg loss of coolant accident (LOCA), the cold-leg LOCA, and the steam generator tube rupture in pressurized water reactors (PWRs). The SVC and PNN models were used for the event classification. The GMDH and FNN models were employed to accurately predict the important timing representing severe accident scenarios. In addition, in order to verify the proposed algorithm, data from a number of numerical simulations were required in order to train the AI techniques due to the shortage of real LOCA data. The data was acquired by performing simulations using the MAAP4 code. The prediction accuracy of the three types of initiating events was sufficiently high to predict severe accident scenarios. Therefore, the AI techniques can be applied successfully in the identification and monitoring of severe accident scenarios in real PWRs.

IMPLEMENTATION OF FULL WEB-BASED GRAPHIC USER INTERFACE PROCESSOR FOR CFD SOFTWARE (웹 기반 CFD s/w용 GUI 프로세서의 구현)

  • Juraeva Makhsuda;Ivanov Evgeny G.;Song Dong Joo
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2004.10a
    • /
    • pp.121-125
    • /
    • 2004
  • The preprocessor - solver - postprocessor software for 2D/Axisymmetric CSCM Upwind Flux Difference Splitting Navier-Stokes code has been developed for undergraduate educational purpose. This computational fluid dynamics (CFD) software allows students to setup, solve, visualize and control dynamically server for their own fluid problems via Internet. The preprocessor Is capable of generating geometry and grid, initial solution data and required solver control parameters. The postprocessor shows vector plot and contour plot with different options while residual plot shows root-mean-square (RMS) error history graphically and retrieves the data from solver interactively. Special feature of the preprocessor is grid generation part which is based on MFC/Visual C++ application and FORTRAN single block grid generator process. Many users can access solver via Internet from client computers and solve desired problems using locally installed pre- and postprocessor and remote powerful solver part.

  • PDF

Realtime Compensation of PCC Voltage Variation by Injection of Required Reactive Power in a Grid Connected Variable Speed Wind Turbine (계통 연계형 가변속 풍력발전기의 무효전력 주입을 통한 PCC 전압 변동량 실시간 보상)

  • Im, Ji-Hoon;Song, Seung-Ho
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.15 no.1
    • /
    • pp.69-74
    • /
    • 2010
  • In a grid connected variable speed wind turbine, the PCC voltage and the wind power fluctuate as the wind velocity changed. And this voltage variation is changed due to location of PCC. This paper calculate the value of PCC voltage variation which is proportional to the product of the line impedance from the ideal generator to the PCC and the wind turbine output current. And to reduce this PCC voltage variation, this paper calculate the required reactive power analytically using the vector diagram method. Output reactive current is changed, if the reactive current is limited by inverter capacity or grid code have the margin of voltage variation. If the grid connected inverter is controlled by proposed algorithm, the PCC voltage variation is minimized though the wind turbine output change at random. To verify calculated voltage variation and required reactive power, this paper utilized Matlab and PSCAD/EMTDC simulation and real small wind turbine and power system in Sapsido, island in the Yellow Sea.

Design of Bit-Parallel Multiplier over Finite Field $GF(2^m)$ (유한체 $GF(2^m)$상의 비트-병렬 곱셈기의 설계)

  • Seong, Hyeon-Kyeong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.7
    • /
    • pp.1209-1217
    • /
    • 2008
  • In this paper, we present a new bit-parallel multiplier for performing the bit-parallel multiplication of two polynomials in the finite fields $GF(2^m)$. Prior to construct the multiplier circuits, we consist of the vector code generator(VCG) to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial after performing the parallel multiplication of a multiplicand polynomial with a irreducible polynomial. The basic cells of VCG have two AND gates and two XOR gates. Using these VCG, we can obtain the multiplication results performing the bit-parallel multiplication of two polynomials. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields $GF(2^4)$. Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper use the VCGs with the basic cells repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSI.