• Progress in Medical Physics
• /
• 제18권4호
• /
• pp.226-232
• /
• 2007

We studied a Monte Carlo simulation of the proton beam delivery system at the National Cancer Center (NCC) using the Geant4 Monte Carlo toolkit and tested its feasibility as a dose verification framework. The Monte Carlo technique for dose calculation methodology has been recognized as the most accurate way for understanding the dose distribution in given materials. In order to take advantage of this methodology for application to external-beam radiotherapy, a precise modeling of the nozzle elements along with the beam delivery path and correct initial beam characteristics are mandatory. Among three different treatment modes, double/single-scattering, uniform scanning and pencil beam scanning, we have modeled and simulated the double-scattering mode for the nozzle elements, including all components and varying the time and space with the Geant4.8.2 Monte Carlo code. We have obtained simulation data that showed an excellent correlation to the measured dose distributions at a specific treatment depth. We successfully set up the Monte Carlo simulation platform for the NCC proton therapy facility. It can be adapted to the precise dosimetry for therapeutic proton beam use at the NCC. Additional Monte Carlo work for the full proton beam energy range can be performed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2012년도 춘계학술대회
• /
• pp.237-240
• /
• 2012

Binary sequences of period $N=2^k-1$ are widely used in many areas of engineering and sciences. Some well-known applications include code-division multiple-access (CDMA) communications and stream cipher systems. In this paper, we analyze the equation $(x+1)^d=x^d+1$ over finite fields. The $d$ of the equation is used to analyze cross-correlation of binary sequences.

• 전자공학회논문지 IE
• /
• 제44권2호
• /
• pp.14-20
• /
• 2007

This paper presents quaternary D flip-flop with advanced performance. Quaternary D flip-flop is composed of the components such as thermometer code output circuit, EX-OR gate, bias inverter, transmission gate and binary D flip-flop circuit. The designed circuit is simulated by HSPICE in $0.35{\mu}m$ one-poly six-metal CMOS process parameters with a single +3.3V supply voltage. In the simulations, sampling frequencies is measured around 100MHz. The PDP parameters and FOM we estimated to be 59.3fJ, 33.7 respectively.

• Journal of computational fluids engineering
• /
• 제19권2호
• /
• pp.24-29
• /
• 2014

In this study, a parallel performance of CUPID-code has been investigated for both Ethernet and Infiniband network system to examine the effect of cache memory and network-speed. Bi-conjugate gradient solver of CUPID-code has been parallelised by using domain decomposition method and message passing interface (MPI). It is shown that the parallel performance of Ethernet-network system is worse than that of Infiniband-network system due to the slow network-speed and a small cache memory. It is also found that the parallel performance of each system deteriorates for a small problem due to the communication overhead, but the performance of Infiniband-network system is better than Ethernet-network system due to a much faster network-speed. For a large problem, the parallel performance depends less on network system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제39A권10호
• /
• pp.569-573
• /
• 2014

Holographic data storage is a strong contender to become the next-generation data storage method. Its major weaknesses are two-dimensional intersymbol interference between neighboring pixels and interpage interference caused by storing multiple pages in a single volume of hologram. In this paper, we present a trellis encoding scheme of 6/8 balanced modulation code, to address the two weaknesses. The proposed modulation coding scheme captures on characteristics of the balanced code: the scheme relaxes IPI and enables error correction by exploiting the trellis structure. The proposed method showed improved SNR over the conventional 6/8 modulation code.

• Journal of the Institute of Electronics and Information Engineers
• /
• 제54권6호
• /
• pp.11-16
• /
• 2017

Multi-level holographic data storage requires modulation codes for avoiding two dimensional inter-symbol interference (2D-ISI). Modulation codes can remove the fatal ISI pattern of neighboring the largest and the smallest symbols. In this paper, we propose a 4-level 4/6 modulation code and its trellis encoding for error correction. The proposed 4/6 modulation code prevents that the symbol 0 and 3 are not adjacent in any direction. Also, we compare the proposed modulation code with the same code rate modulation codes for four-level holographic data storage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제15권2호
• /
• pp.112-123
• /
• 1990

This paper presents a vertex-detecting of Hanguel patterns using nested contour shape. Inputed binary character patterns are transformed by distance transformation method and make a new file of transferred data by analysis of charactersitcs. A new vertex-detecting algorithm for recognizing Hanguel patterns using the two data files is proposed. This algorithm is able to reduce the projecting parts of Hanguel pattern, separate the connecting parts between different strokes, set the code number by transformed value of coorked features. It makes the output of results in order to apply the Hanguel recognition.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제21권2호
• /
• pp.71-82
• /
• 2011

Live data in physical memory can be acquired by live forensics but not by harddisk file-system analysis. Therefore, in case of forensic investigation, live forensics is widely used these days. But, existing live forensic methods, that use command line tools in live system, have many weaknesses; for instance, it is not easy to re-analyze and results can be modified by malicious code. For these reasons, in this paper we explain the Windows kernel architecture and how to analyze physical memory dump files to complement weaknesses of traditional live forensics. And then, we design and implement the Physical Memory Dump Explorer, and prove the effectiveness of our tool through test results.

• Journal of Korea Multimedia Society
• /
• 제7권1호
• /
• pp.73-79
• /
• 2004

In this paper, we propose an efficient soft decision decoding algorithm for linear block codes. A conventional soft decision decoder have to invoke a hard decision decoder several times to estimate its soft decision values. However, in this method, we may not have candidate codewords, thus it is very difficult to produce soft decision values. We solve this problem by introducing an efficient algorithm to search candidate codewords. By using this, we can highly reduce the cases we cannot find candidate codewords. We estimate the performance of the proposed algorithm by using the computer simulations. The simulation is performed for binary (63, 36) BCH code in fading channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제27권4A호
• /
• pp.364-370
• /
• 2002

In this paper, we propose a VLSI array architecture for high speed processing of FBMA. First of all, the sequential FBMA is transformed into a single assignment code by using the index space expansion, and then the dependance graph is obtained from it. The two dimensional VLSI array is derived by projecting the dependance graph along the optimal direction. Since the candidate blocks in the search range are overlapped with columns as well as rows, the processing elements of the VLSI array are designed to reuse the overlapped data. As the results, the number of data inputs is reduced so that the processing performance is improved. The proposed VLSI array has (N$^2$+1)${\times}$(2p+1) processing elements and (N+2p) input ports where N is the block size and p is the maximum search range. The computation time of the rat reference block is (N$^2$+2(p+1)N+6p), and the block pipeline period is (3N+4p-1).