• Proceedings of the KAIS Fall Conference
• /
• 2010.11a
• /
• pp.402-405
• /
• 2010

본 논문에서는 소스 코드에 자주 나타나는 코딩 패턴을 자동으로 추출하기 위하여 소스 코드를 분석하고 특성을 평가한다. 기존에 소스 코드에 대한 패턴 마이닝을 이용한 코딩 패턴 감지 방법이 제안되었지만, 수동으로 조사 가능한 코딩 패턴의 수는 한정되어 있기 때문에 대규모 소프트웨어 등에 대한 충분한 분석은 할 수 없었다. 따라서 본 논문에서는 개발자가 분석하고자 하는 코딩 패턴에 대한 자동 추출을 목표로 코딩 패턴의 특성 평가 지표를 선정하여 소스 코드에 대한 분석을 수행한다.

• 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.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.3
• /
• pp.31-31
• /
• 2001

최근 VHDL 코딩 및 합성방법에 의한 설계가 널리 사용되고 있다. 집적도가 증가함에 따라 VHDL에 의한 설계 또한 그 분량이 증가하여 많은 코딩오류가 발생하고 있으며, 이를 검색하는데 많은 시간과 노력이 소요되고 있다. 본 논문에서는 VHDL 행위-레벨 설계를 대상으로 코딩오류를 검색하는 방법을 제안하였다. 그 방법에 있어서는 검색패턴을 생성하여 오류가 없는 응답과 설계의 응답을 비교함으로써 설계오류를 찾는 방법을 택하였다. 따라서 본 논문에서는 코딩오류를 검색하기 위한 검색패턴을 생성하는 알고리듬을 제안하였다. 검색패턴 생성은 각 코드에 대해 수행하며, 할당오류와 조건오류를 구분하여 수행하였다. 패턴생성을 위해 VHDL 코드를 CDFG로 변환하여 사용하며, CDFG상의 경로를 탐색하여 패턴생성에 필요한 정보를 추출한다. 경로탐색은 오류가 발생하였다고 가정한 지점으로부터 역방향 탐색과 정방향 탐색을 수행하여 패턴을 생성한다. 제안한 알고리듬은 C-언어로 구현하였다. 펜티엄-Ⅱ 400MHz의 환경에서 여러 가지 VHDL 행위-레벨 설계를 대상으로 제안한 알고리듬을 적용하였다. 그 결과, 고려한 모든 설계의 모든 코드에 대한 검색패턴을 생성할 수 있었으며, 가정한 모든 오류를 검색할 수 있었다. 검색패턴 생성에 소요되는 시간은 고려한 모든 대상 설계에서 1초 미만의 CPU 시간을 보여 속도면에서도 매우 우수함을 나타내었다. 따라서 본 논문에서 제안한 검색방법은 VHDL에 의한 설계에서 설계검증에 필요한 시간과 노력을 상당히 감소시킬 것으로 기대된다.

• Electronics and Telecommunications Trends
• /
• v.32 no.4
• /
• pp.31-39
• /
• 2017

뇌에 관한 연구는 상당히 오랫동안 이루어져 왔음에도, 뇌는 여전히 미지의 세계로 남아 있다. 미국에서 2013년 Brain Initiative를 발표한 이후 뇌를 이해하기 위한 연구가 활발히 이루어져 왔다. 최근에는 인간의 생각을 뇌의 활성 패턴 분석을 통해 읽어 내려고 시도하였으며, 심지어는 잠자는 동안 꾸는 꿈을 뇌 활성 패턴 측정을 통해 읽어 내려는 시도도 이루어졌다. 본고에서는 브레인 디코딩을 위해 어떤 기술들이 필요하며, 현재 어떤 연구들이 이루어져 왔는지에 대하여 살펴보고, 향후 브레인 디코딩 기술이 어떻게 발전할 것인지 전망해 본다.

• Journal of IKEEE
• /
• v.17 no.3
• /
• pp.352-359
• /
• 2013

This paper proposes an entropy coding unit for H.264/AVC baseline profile. Entropy coding requires code tables for macroblock encoding. There are patterns in codewords of each code tables. In this paper, the patterns between codewords are analyzed to reduce the hardware cost. The entropy coding unit consists of Exp-Golomb unit and CAVLC unit. The Exp-Golomb unit can process five code types in a single unit. It can perform Exp-Golomb processing using only two adders. While typical CAVLC units use various code tables which require large amounts of resources, the sizes of the tables are reduced to about 40% or less of typical CAVLC units using relationships between table elements in the proposed CAVLC unit. After the Exp-Golomb unit and the CAVLC unit generate code values, the entropy unit uses a small size shifter for bit-stream generation while typical methods are barrel shifters.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.3
• /
• pp.185-197
• /
• 2001

Recently, the design method by VHDL coding and synthesis has been used widely. As the integration ratio increases, the amount design by VHDL at a time also increases so many coding errors occur in a design. Thus, lots of time and effort is dissipated to detect those coding errors. This paper proposed a method to verify the coding errors in VHDL behavioral-level designs. As the methodology, we chose the method to detect the coding error by applying the generated set of verifying patterns and comparing the responses from the error-free case(gold unit) and the real design. Thus, we proposed an algorithm to generate the verifying pattern set for the coding errors. Verifying pattern generation is peformed for each code and the coding errors are classified as two kind: condition errors and assignment errors. To generate the patterns, VHDL design is first converted into the corresponding CDFG(Control & Data Flow Graph) and the necessary information is extracted by searching the paths in CDFG. Path searching method consists of forward searching and backward searching from the site where it is assumed that coding error occurred. The proposed algorithm was implemented with C-language. We have applied the proposed algorithm to several example VHDL behavioral-level designs. From the results, all the patterns for all the considered coding errors in each design could be generated and all the coding errors were detectable. For the time to generate the verifying patterns, all the considered designed took less than 1 ［sec］ of CPU time in Pentium-II 400MHz environments. Consequently, the verification method proposed in this paper is expected to reduce the time and effort to verify the VHDL behavioral-level designs very much.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.24-26
• /
• 1998

본 논문에서는 그래프 구조 퍼지 시스템을 유전자 알고리즘을 이용하여 최적화할 때, 해개체를 직접 코딩함으로써 발생되는 해개체 길이의 폭발적 증가 문제를 해결하기 위하여 문법 코딩 기법을 이용한 그래프 구조 퍼지 시스템을 제안한다. 문법적 코딩 기법은 퍼지 소속 함수와 퍼지 규칙의 상호 연관적인 규칙을 유전형으로 표현하여 퍼지 규칙의 반복적 패턴 혹은 재귀적 특성을 문법 규칙에 반영시킴으로써 유전자 알고리즘의 탐색공간을 효율적으로 줄인다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.231-238
• /
• 2009

DNA sequences are the fundamental information for each species and a comparison between DNA sequences of different species is an important task. Since DNA sequences are very long and there exist many species, not only fast matching but also efficient storage is an important factor for DNA sequences. Thus, a fast string matching method suitable for encoded DNA sequences is needed. In this paper, we present a fast string matching method for encoded DNA sequences which does not decode DNA sequences while matching. We use four-characters-to-one-byte encoding and combine a suffix approach and a multi-pattern matching approach. Experimental results show that our method is about 5 times faster than AGREP and the fastest among known algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.7
• /
• pp.4405-4410
• /
• 2015

Two-dimensional displacements are obtained from the sandwiched patterns, which superpose two linearly-periodic patterns orthogonally, respectively. The transparent top pattern is identified by deflection of the laser beam due to a difference of refractivity and the opaque bottom pattern is identified by deviation of the beam intensity due to a difference of reflectance. In the sample setup, the top pattern made up of build-up film is manufactured by UV laser machining and the bottom pattern is manufactured by ultra-precision trench machining and deposition for aluminum plate. The proposed decoding method is verified experimentally using the $10{\mu}m$ equally spaced sample patterns and the devised optical system. The Korea Academia-Industrial cooperation Society.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.6
• /
• pp.492-505
• /
• 2022

This study is a study on the results of improving the logic to effectively transmit and decode compressed data in real time by improving the encoding and decoding performance of BL-beta codes that can be used for lossless real-time transmission of IoT sensing data. The encoding process of BL-beta code includes log function, exponential function, division and square root operation, etc., which have relatively high computational burden. To improve them, using bit operation, binary number pattern analysis, and initial value setting of Newton-Raphson method using bit pattern, a new regularity that can quickly encode and decode data into BL-beta code was discovered, and by applying this, the encoding speed of the algorithm was improved by an average of 24.8% and the decoding speed by an average of 5.3% compared to previous study.