• 제목/요약/키워드: Code generation

Search Result 1,017, Processing Time 0.022 seconds

An Approach to Estimation of Radiological Source Term for a Severe Nuclear Accident using MELCOR code (MELCOR 코드를 이용한 원자력발전소 중대사고 방사선원항 평가 방법)

  • Han, Seok-Jung;Kim, Tae-Woon;Ahn, Kwang-Il
    • Journal of the Korean Society of Safety
    • /
    • v.27 no.6
    • /
    • pp.192-204
    • /
    • 2012
  • For a severe accident of nuclear power plant, an approach to estimation of the radiological source term using a severe accident code(MELCOR) has been proposed. Although the MELCOR code has a capability to estimate the radiological source term, it has been hardly utilized for the radiological consequence analysis mainly due to a lack of understanding on the relevant function employed in MELCOR and severe accident phenomena. In order to estimate the severe accident source term to be linked with the radiological consequence analysis, this study proposes 4-step procedure: (1) selection of plant condition leading to a severe accident(i.e., accident sequence), (2) analysis of the relevant severe accident code, (3) investigation of the code analysis results and post-processing, and (4) generation of radiological source term information for the consequence analysis. The feasibility study of the present approach to an early containment failure sequence caused by a fast station blackout(SBO) of a reference plant (OPR-1000), showed that while the MELCOR code has an integrated capability for severe accident and source term analysis, it has a large degree of uncertainty in quantifying the radiological source term. Key insights obtained from the present study were: (1) key parameters employed in a typical code for the consequence analysis(i.e., MACCS) could be generated by MELCOR code; (2) the MELOCR code simulation for an assessment of the selected accident sequence has a large degree of uncertainty in determining the accident scenario and severe accident phenomena; and (3) the generation of source term information for the consequence analysis relies on an expert opinion in both areas of severe accident analysis and consequence analysis. Nevertheless, the MELCOR code had a great advantage in estimating the radiological source term such as reflection of the current state of art in the area of severe accident and radiological source term.

A Study on the Compressed Code for Biological Signal (생체신호 데이터의 압축코드 알고리즘에 관한 연구)

  • Hong, Seung-Hong;Son, Chang-Il;Min, Hong-Gi
    • Journal of Biomedical Engineering Research
    • /
    • v.5 no.1
    • /
    • pp.93-102
    • /
    • 1984
  • In this paper, the real-time compressed code generation method for the biological signal data, especially for the Electrocardiogram, is studied. For this purpose, variable length code is introduced. And from this code, we get a exactly the same reconstructed signal data as the original. Experimental results show that this program reduces the data rate by a factor of about 8, and codes the result in a form convenient for analysis.

  • PDF

Rapid Data Allocation Technique for Multiple Memory Bank Architectures (다중 메모리 뱅크 구조를 위한 고속의 자료 할당 기법)

  • 조정훈;백윤홍;최준식
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.196-198
    • /
    • 2003
  • Virtually every digital signal processors(DSPs) support on-chip multi- memory banks that allow the processor to access multiple words of data from memory in a single instruction cycle. Also, all existing fixed-point DSPs have irregular architecture of heterogeneous register which contains multiple register files that are distributed and dedicated to different sets of instructions. Although there have been several studies conducted to efficiently assign data to multi-memory banks, most of them assumed processors with relatively simple, homogeneous general-purpose resisters. Therefore, several vendor-provided compilers fer DSPs were unable to efficiently assign data to multiple data memory banks. thereby often failing to generate highly optimized code fer their machines. This paper presents an algorithm that helps the compiler to efficiently assign data to multi- memory banks. Our algorithm differs from previous work in that it assigns variables to memory banks in separate, decoupled code generation phases, instead of a single, tightly-coupled phase. The experimental results have revealed that our decoupled algorithm greatly simplifies our code generation process; thus our compiler runs extremely fast, yet generates target code that is comparable In quality to the code generated by a coupled approach

  • PDF

Neutronic simulation of the CEFR experiments with the nodal diffusion code system RAST-F

  • Tran, Tuan Quoc;Lee, Deokjung
    • Nuclear Engineering and Technology
    • /
    • v.54 no.7
    • /
    • pp.2635-2649
    • /
    • 2022
  • CEFR is a small core-size sodium-cooled fast reactor (SFR) using high enrichment fuel with stainless-steel reflectors, which brings a significant challenge to the deterministic methodologies due to the strong spectral effect. The neutronic simulation of the start-up experiments conducted at the CEFR have been performed with a deterministic code system RAST-F, which is based on the two-step approach that couples a multi-group cross-section generation Monte-Carlo (MC) code and a multi-group nodal diffusion solver. The RAST-F results were compared against the measurement data. Moreover, the characteristic of neutron spectrum in the fuel rings, and adjacent reflectors was evaluated using different models for generation of accurate nuclear libraries. The numerical solution of RAST-F system was verified against the full core MC solution MCS at all control rods fully inserted and withdrawn states. A good agreement between RAST-F and MCS solutions was observed with less than 120 pcm discrepancies and 1.2% root-mean-square error in terms of keff and power distribution, respectively. Meanwhile, the RAST-F result agreed well with the experimental values within two-sigma of experimental uncertainty. The good agreement of these results indicating that RAST-F can be used to neutronic steady-state simulations for small core-size SFR, which was challenged to deterministic code system.

Random PRF Pulse Design for Signal Processing Unit of Small Tracking Radar (소형 추적 레이더 신호처리기용 Random PRF 펄스 설계)

  • Hong-Rak Kim;Man-Hee Lee;Sung-Ho Park;Youn-Jin Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.2
    • /
    • pp.59-64
    • /
    • 2024
  • The small tracking radar randomly changes the transmission period to avoid deceptive signals such as RGPO (Range Gaet Pull Off) operated on the target. Since the code repeats after a specific section, it becomes difficult to avoid a deceptive signal when the repetition is exposed. In this paper, a more realistic transmission pulse code is generated by adding random code generation through FPGA and system white noise. We present the research results of code generation that generates PRF that can avoid repetition while using pseudo-random code in EPROM using FPGA. Also, the result of designing random PRF pulse was confirmed by applying it to tracking radar.

A Programming Model for USN Applications based on Nano-Qplus (Nano-Qplus기반의 USN 응용 프로그래밍 모델)

  • Lee, Woo-Jin;Kim, Ju-Il;Lee, Kwang-Yong;Chong, Ki-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.4
    • /
    • pp.378-387
    • /
    • 2006
  • A programming model for ubiquitous sensor network (USN) applications based on Nano-Qplus is proposed. USN applications mean programs of nodes which are components of sensor network such as sensor, router, sink and actuator. Developers can automatically generate programs of USN applications by setting attributes values of nodes using a script after they model a sensor network. A script for setting attributes values of a node is proposed in this paper. The algorithm of automatic code generation is also described. Developers can easily implement USN applications even if they do not know details of low-level communication, data sharing, and collective operations because the applications are automatically generated from a script. They set only attributes values of nodes using the script. Efforts for USN applications development also are reduced because of automatic code generation. Furthermore, developers can correct errors of applications in the early stage of development through ear]y test based on rapid code generation.

Application of TULIP/STREAM code in 2-D fast reactor core high-fidelity neutronic analysis

  • Du, Xianan;Choe, Jiwon;Choi, Sooyoung;Lee, Woonghee;Cherezov, Alexey;Lim, Jaeyong;Lee, Minjae;Lee, Deokjung
    • Nuclear Engineering and Technology
    • /
    • v.51 no.8
    • /
    • pp.1871-1885
    • /
    • 2019
  • The deterministic MOC code STREAM of the Computational Reactor Physics and Experiment (CORE) laboratory of Ulsan National Institute of Science and Technology (UNIST), was initially designed for the calculation of pressurized water reactor two- and three-dimensional assemblies and cores. Since fast reactors play an important role in the generation-IV concept, it was decided that the code should be upgraded for the analysis of fast neutron spectrum reactors. This paper presents a coupled code - TULIP/STREAM, developed for the fast reactor assembly and core calculations. The TULIP code produces self-shielded multi-group cross-sections using a one-dimensional cylindrical model. The generated cross-section library is used in the STREAM code which solves eigenvalue problems for a two-dimensional assembly and a multi-assembly whole reactor core. Multiplication factors and steady-state power distributions were compared with the reference solutions obtained by the continuous energy Monte-Carlo code MCS. With the developed code, a sensitivity study of the number of energy groups, the order of anisotropic PN scattering, and the multi-group cross-section generation model was performed on the keff and power distribution. The 2D core simulation calculations show that the TULIP/STREAM code gives a keff error smaller than 200 pcm and the root mean square errors of the pin-wise power distributions within 2%.

Multiple Access Interference Rejection Code: LS Code

  • Roh, Dong-Wook;Kim, Dong-Ku
    • Journal of Communications and Networks
    • /
    • v.5 no.1
    • /
    • pp.19-24
    • /
    • 2003
  • A new code, LS code, was proposed for the IMT-2000 CDMA system. The code has special properties during a specific time interval: 1) perfect autocorrelation, and 2) perfect crosscorrelation. Perfect autocorrelation means maximum autocorrelation for zero time-offset and zero autocorrelation for all other times during a specific time interval. Moreover, perfect crosscorrelation means that the crosscorrelation has zero value during a certain time, you can remove all the MAI within that time. However, the detailed properties of LS code and its exact generation method have been previously unknown. Therefore, we investigate the LS code in regards to its exact generating method, properties, and performances in this paper.

Serialized Multitasking Code Generation from Dataflow Specification (데이타 플로우 명세로부터 직렬화된 멀티태스킹 코드 생성)

  • Kwon, Seong-Nam;Ha, Soon-Hoi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.9_10
    • /
    • pp.429-440
    • /
    • 2008
  • As embedded system becomes more complex, software development becomes more important in the entire design process. Most embedded applications consist of multi -tasks, that are executed in parallel. So, dataflow model that expresses concurrency naturally is preferred than sequential programming language to develop multitask software. For the execution of multitasking codes, operating system is essential to schedule multi-tasks and to deal with the communication between tasks. But, it is needed to execute multitasking code without as when the target hardware platform cannot execute as or target platforms are candidates of design space exploration, because it is very costly to port as for all candidate platforms of DSE. For this reason, we propose the serialized multitasking code generation technique from dataflow specification. In the proposed technique, a task is specified with dataflow model, and generated as a C code. Code generation consists of two steps: First, a block in a task is generated as a separate function. Second, generated functions are scheduled by a multitasking scheduler that is also generated automatically. To make it easy to write customized scheduler manually, the data structure and information of each task are defined. With the preliminary experiment of DivX player, it is confirmed that the generated code from the proposed framework is efficiently and correctly executed on the target system.

Automatic C Source Code Generation Technique for DirectShow Programming (DirectShow 프로그래밍을 위한 C 소스 코드 자동 생성 기법)

  • 동지연;박선화;엄성용
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.114-124
    • /
    • 2004
  • In this paper, we present an automatic C source code generation system for DirectShow based multimedia application programming. In this system, C source code is automatically synthesized from the filter connection graph edited with GraphEdit, a utility tool provided with DirectShow SDK package from Microsoft. In traditional DirectShow programming environments, program design and brief testing steps are usually done with GraphEdit tool just by inserting filters and connecting them properly, while actual implementation of the program should be done separately. The filter connection graph information from GraphEdit is used just as a reference in such the implementation step. Therefore, our system which automatically generates C source code directly from the filter connection graph of GraphEdit seems very useful and many programmers can develop DirectShow based multimedia application programs more effectively and quickly using our system. In addition, our system supports more various media stream control functions for the generated application programs than the existing system such as Wizard which supports limited and fixed number of media control functions only. This feature allows more flexibility in the user interface of the generated source program and makes our system more practical for DirectShow based programming.