• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.34-44
• /
• 1995

One of the most important problems faced by software developers and users is the prediction of the size of programming system and its development effort. This article define the identical characteristics for structured specification which is consisted of Data Flow Diagram, Data Dictionary and Mini Specification and apply quantitative estimation factor of structured specification to program code metrics, Moreover, concerning DFD which is made up of component element of structured specification executed quantitative estimation experiment. In the result, we propose man/month prediction model of lower progression with production on analysis phase of upper progression.

• Wind and Structures
• /
• v.5 no.2_3_4
• /
• pp.379-392
• /
• 2002

Numerical flow computations around an aeroelastic 3D square cylinder immersed in the turbulent boundary layer are shown. Present computational code can be characterized by three numerical aspects which are 1) the method of artificial compressibility is adopted for the incompressible flow computations, 2) the domain decomposition technique is used to get better grid point distributions, and 3) to achieve the conservation law both in time and space when the flow is computed a with moving and transformed grid, the time derivatives of metrics are evaluated using the time-and-space volume. To provide time-dependant inflow boundary conditions satisfying prescribed time-averaged velocity profiles, a convenient way for generating inflow turbulence is proposed. The square cylinder is modeled as a 4-lumped-mass system and it vibrates with two-degree of freedom of heaving motion. Those blocks which surround the cylinder are deformed according to the cylinder's motion. Vigorous oscillations occur as the vortex shedding frequency approaches cylinder's natural frequencies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.426-432
• /
• 2007

The MAP algorithm is designed and implemented through the sliding window method for turbo decoding. First, the implementation issues, which are the length of the sliding window and the normalization method of state metrics are reviewed, and their optimal values are obtained by the simulation. All component schemes of the decoder including the branch metric evaluator are also presented. The proposed MAP architecture can be easily redesigned according to the size of sliding window, that is, sub-frame length because of its simplicity on buffer control.

• Annual Conference of KIPS
• /
• 2002.11c
• /
• pp.1991-1994
• /
• 2002

본 논문은 기존에 작성된 자바 프로그램이나 현재 구현 중인 자바 프로그램을 대상으로 메트릭 정보를 측정하는 자동화 도구의 설계 및 구현 결과를 논한다. 이러한 도구의 구현을 위해 필요한 가장 핵심적인 기능은 자바코드에 대한 분석 기능이다. 본 논문의 내용은 한국전자통신연구원의 컴포넌트 공학 연구팀 주관으로 EJB(Enterprise Java Beans) 기술을 기반으로 컴포넌트를 개발하기 위한 환경인 COBALT(Component Based Application devlopment Tool) 시스템의 부 시스템으로 구현된 자바코드 메트릭 측정 도구의 설계 및 구현 결과를 다룬다. 본 논문에서 구현된 자바 코드 메트릭 측정 도구을 통하여 클래스의 적절한 분할, 클래스 멤버 자원의 적절한 배치, 상속 트리의 적절한 조직 등을 이룰 수 있다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.70-77
• /
• 2002

This paper describes a design driven approach to drive intelligent test plan generation based on adaptive use case (3,5). Its foundation is an object-oriented software design approach which partitions design schema into design architecture of functional components called “design component”. A use case software development methodology of adaptive use case approach developed in I.I .T is employed which preserves this unit architecture on through to the actual code structure. Based on the partition design schema produced during the design phase of this methodology, a test plan is generated which includes a set of component and scenario based test. A software metric is introduced which produces an ordering of this set to enhance productivity and both promote and capitalize on test case reusability, This paper contains an application that illustrates the proposed approach.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.3
• /
• pp.517-526
• /
• 2000

In this paper, we propose the trellis coded spread spectrum communication system with one channel signal selection of the subset by the PN code. This paper proposes the Viterbi decoder that have the squared Euclidean distance of the order phase difference as well as 1st order phase difference as the branch metrics by using the multiple symbol detection method. TCM method was developed to overcome limited power and bandwidth efficiently in digital communication. we multiply one of convolution code's output data to PN code for applying TCM to the spread spectrum. We investigated the performance of the direct sequence/spread spectrum communication system with trellis coded modulation. In this system, we could improved the coding gain in the spread spectrum.

• Journal of IKEEE
• /
• v.4 no.2 s.7
• /
• pp.257-265
• /
• 2000

Turbo Code decoder is an iterate decoding technology, which extracts extrinsic information from the bit to be decoded by calculating both forward and backward metrics in each decoding step, and uses the information to the next decoding step. Viterbi decoder, which is for a convolutional code, runs continuous mode, while Turbo Code decoder runs by block unit. There are algorithms used in a decoder : which are MAP(maximum a posteriori) algorithm requiring very complicated calculation and SOVA(soft output Viterbi algorithm) using Viterbi algorithm suggested by Hagenauer, and it is known that the decoding performance of MAP is better. The result of this make experimentation shows that the performance of SOVA, which has half complex algorithm compare to MAP, is almost same as the performance of MAP when the SOVA decoding performance is supplemented with Robust equalization techniques.

• Journal of Digital Convergence
• /
• v.11 no.7
• /
• pp.165-171
• /
• 2013

Coding patterns that appeared frequently in the source code is a typical piece of code. The functionality that difficult to modularize, such as logging or synchronization processing, and the useful sentences in programming is extracted in software as codding pattern. Large-scale software could not be analyzed fully because the number of coding pattern that can be manually investigated is limited. In this paper, the characteristics of coding patterns perform the evaluation. The goal is to extract for codding-pattern to analyzed by developer. We was selected 6 indicators and performed analysis of 4 open-source. Matrix relations between the values and characteristics of the actual pattern analysis, pattern instances, the width of the distribution of instances, the pattern repeating structure of the elements included in the rates should be analyzed for patterns and indicators that help in choosing was confirmed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.77-82
• /
• 2005

Partial response maximum likelihood (PRML) detection using the Viterbi algorithm involves the calculation of likelihood metrics that determine the most likely sequence of decoded data. In general, it is assumed that branches at each node in the trellis diagram have same probabilities. If modulation code with minimum and maximum run-length constraints is used, the occurrence ratio (Ro) of each particular pattern is different, and therefore the assumption is not true. We present a calculation scheme of the likelihood metrics for the PRML detection using the occurrence ratio. In simulation, we have tested the two (1,7) run-length-limited codes and calculated the occurrence ratios as the orders of PR targets are changed. We can identify that the PRML detections using the occurrence ratio provide more than about 0.5dB gain compared to conventional PRML detections at 10/sup -5/ BER in high-density magnetic recording and optical recording channels.

• KIISE Transactions on Computing Practices
• /
• v.23 no.9
• /
• pp.535-541
• /
• 2017

Today, the scale of the computer software market has increased, and massive sized software has been developed to satisfy diverse requirements. In this context, software complexity is increasing and the quality of software is becoming more difficult to manage. In particular, software reuse is important for the improvement of the environments of legacy systems and new system development. In this paper, we propose a method to reuse modules that are certified by quality. Reusable levels are divided into code area (method, class, and component), project domain, and business levels. Based on the coupling and cohesion of software complexity, we propose a reusable module extraction mechanism with reusability metrics, which constructs a visualization of the "reusable module's chunk" based on the method and class levels. By applying reverse engineering to legacy projects, it is possible to identify reusable modules/objects/chunks. If these modules/objects/chunks are to be reused to develop an extension system or similar new system, we need to ensure software reliability in order to reduce the time and cost of software development.