• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10A
• /
• pp.1123-1130
• /
• 2004

This paper proposes the fast OVSF code generation method using the multi-stage spreading scheme based on the single code indexing scheme. The conventional OVSF indexing scheme based on the code-tree structure uses two numbers as the codeword indices, the layer number and the code number of the corresponding layer. However, the single code index number implicitly includes the information of the spreading factor as well as the code number. Since the binary representation of the single code indices shows the pattern of the codeword, the orthogonality between two different codewords can be determined by comparing their code indices instead of much longer codewords. The above useful property also makes the codeword can be generated directly kom its single code index. In this paper, the multi-stage spreading scheme is applied to generate the long code by spreading two shorter codewords with the appropriate code indices. The proposed fast code generation algorithm is designed for 3GPP UMTS systems and verified by the simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.857-865
• /
• 2020

This paper presents a method for code generation of UML sequence diagrams based on message patterns. In the sequence diagrams, it is shown that messages are some types of forms typically. This paper classifies according to type as three patterns, and construct meta-information for code generation analysing structural infomation for each patterns. The meta-message of structural information (MetaMessage) is stored in the MetaMessage datastore and the meta-method information from the MetaMessage is stored in the MetaMethod datastore. And then, the structural information of MetaClass and MetaObject is constructed in each datastore too. For each pattern, this paper presents a method for code generation based on the meta information of message patterns and the syntax of target progamming language. Also, branching and looping that has been seldom handled integratedly in the previous works are handled as same as the basic patterns by classifying the branching pattern and the looping pattern for code generation integratedly.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.8
• /
• pp.1221-1230
• /
• 1990

This paper presents a code generation method and an effective handling algorithm of ingeger constant multiplication for RISC machines in compiler design. As RISC Architectures usually use faster and more simply formed instructions than CISC's and most RISC processors do not have an integer multiplication instruction, it is required an effective algorithm to process integer multiplication. For the proposed code generator, Portable C Compiler(PCC) is redesigned to be suitable for an RISC machine, and composed an addition chain is built up to allow fast execution of constant multiplication, a part of integer one whicch appears very frequency in code generation phase.

• Journal of computational fluids engineering
• /
• v.20 no.2
• /
• pp.23-36
• /
• 2015

The $2^{nd}$ generation ice accretion analysis program has been developed and validated for various icing conditions. The essential feature of the $2^{nd}$ generation code lies in its capability of handling general 3-D geometry and improved accuracy. The entire velocity fields are obtained based on Navier-Stokes equations in order to take the massively separated flow field into account. Unlike $1^{st}$ generation code, the droplet trajectories are calculated using Eulerian approach, which is adopted to yield appropriate collection efficiency even in the shadow region. For improved thermodynamic analysis on the surfaces, water film model and modified Messinger model are newly included in the present analysis. The ice shape for a given time step is obtained by considering the exact amount of ice accreted on the surface. Each module of the icing analysis code has been seamlessly integrated on the OpenFOAM platform. The developed code was validated against available experimental data for 2D airfoils and 3D DLR-F4. Due to the lack of experimental data, the computed results of DLR-F4 were compared with those obtained from FENSAP-ICE, which is state-of-the-art 3D icing analysis code. It was clearly shown that the present code produces comparable results to those of FENSAP-ICE, in terms of prediction accuracy and the capability of handling general 3-D geometries.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.121-125
• /
• 2007

This paper proposes automatic generation method of proxy client code to automation of web service selection process through a monitoring agent. The technique of this paper help service consumer to provide source code of proxy client as it bring an attribute value of specific element of WSDL document using template rule. Namely, a XSLT script file provide code frame of dynamic invocation interface model. The automatic code generation technique need to solving starvation status of selection architecture. It is required to creating request HTTP message for every service on the result of search. The created proxy client program code generate dummy message about services. The proposed client code generation method show us a possibility of application in the automatic generation programming domain.

• IE interfaces
• /
• v.15 no.1
• /
• pp.20-25
• /
• 2002

In this research, a nameplate engraving system for images and texts downloaded through Internet on nameplate is developed. The system consists of two subsystems: thinning algorithm and NC code generation module. In the thinning algorithm, the concept of connectivity is used and center lines of images and texts, which will be used as NC tool paths, can be obtained successfully. Because the center lines are composed of a lot of pixels, NC code would be too long. In the NC code generation module, many useless pixel data are removed and linear interpolation algorithm is applied to only the remaining pixels. By performing actual experiments, the thinning algorithm and the NC code generation module are verified.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.384-395
• /
• 2008

Random network coding can be viewed as a single block code applied to all source packets. To manage the concomitant high coding complexity, source packets can be partitioned into generations; block coding is then performed on each set. To reach a better performance-complexity tradeoff, we propose a novel concatenated network code which mixes generations while retaining the desirable properties of generation-based coding. Focusing on the code's erasure performance, we show that the probability of successfully decoding a generation on erasure channels can increase substantially for any erasure rate. Using both analysis (for small networks) and simulations (for larger networks), we show how the code's parameters can be tuned to extract best performance. As a result, the probability of failing to decode a generation is reduced by nearly one order of magnitude.

• Journal of Internet Computing and Services
• /
• v.4 no.3
• /
• pp.57-67
• /
• 2003

Software product lines are to attain the rapid development of qualify applications by concretizing the general components populated in software assets and assembling them according to the predefined architectures. For supporting the construction of the software product lines, this paper proposes a component code generation techniques based on GenVoca architecture and XML/XSLT technologies, In addition, CompGenX(Component Generator using XML), a component code generation system, is proposed on the basis of this techniques. By providing reconfigurability of component at the time of code generation, CompGenX allows the reusers to create the component source code that is appropriate to their purpose, In this system, the process of the component development is divided into two tasks which are the component family construction task and the component reuse task, For the component family construction, CompGenX provides the feature modeling tool for domain analysis and the domain architecture definition tool. Also, it provides the tool for building the component configuration know1edge specification and the code templates, For the component reuse task, it offers the component family search tool. the component customizing tool and the component code generator. Component code generation techniques and system in this paper should be applicable as basic technology to build the component-based software product lines.

• Nuclear Engineering and Technology
• /
• v.53 no.9
• /
• pp.2788-2802
• /
• 2021

Multigroup cross section (MG XS) generation by the UNIST in-house Monte Carlo (MC) code MCS for fast reactor analysis using nodal diffusion codes is reported. The feasibility of the approach is quantified for two sodium fast reactors (SFRs) specified in the OECD/NEA SFR benchmark: a 1000 MW_th metal-fueled SFR (MET-1000) and a 3600 MW_th oxide-fueled SFR (MOX-3600). The accuracy of a few-group XSs generated by MCS is verified using another MC code, Serpent 2. The neutronic steady-state whole-core problem is analyzed using MCS/RAST-K with a 24-group XS set. Various core parameters of interest (core k_eff, power profiles, and reactivity feedback coefficients) are obtained using both MCS/RAST-K and MCS. A code-to-code comparison indicates excellent agreement between the nodal diffusion solution and stochastic solution; the error in the core k_eff is less than 110 pcm, the root-mean-square error of the power profiles is within 1.0%, and the error of the reactivity feedback coefficients is within three standard deviations. Furthermore, using the super-homogenization-corrected XSs improves the prediction accuracy of the control rod worth and power profiles with all rods in. Therefore, the results demonstrate that employing the MCS MG XSs for the nodal diffusion code is feasible for high-fidelity analyses of fast reactors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.511-517
• /
• 1998

In this paper a new technique to generate spreading code sequences in the CDMA communication is introduced. It is an effective method to generate optimal code sequences using the orthogonality of wavelet packet basis set of subspaces. With a three-stage Quadrature Mirror Filter(QMF), generation of optimal code sequences has been demonstrated. Since these generated optimal code sequences are non-binary and have an arbitrary waveform which is different from that of the conventional PN-based Gold code sequences, a strong security against the intended interceptor is feasible. Encouraging good correlation properties are also achieved with this new method.