• 전자공학회논문지C
• /
• 제36C권5호
• /
• pp.1-12
• /
• 1999

본 논문에서는 스위치-레벨 회로의 검증(verification)을 위해서 이진 결정 다이어그램(BDD : Binary Decision Diagram)을 구현하는 새로운 알고리즘을 제안한다. 스위치-레벨에서 기능(function)들은 스위치들의 직$\cdot$병렬 연결에 의해서 결정되며, 결과 논리 값은 논리 '0'과 '1'뿐만 아니라, 초기 상태, 고 임피던스와 불안정 상태를 가진다. 따라서, 본 논문에서는 "스위치-레벨 이진 결정 다이어그램(SLBDD : Switch- Level Bianary Decision Diagram)"으로 정의한 비 사이클 그래프(acyclic graph)들을 사용해서 스위치-레벨 회로의 가능들을 표현하도록 BDD를 확장하였다. 그러나, 그래프의 기능적 표현을 최악의 경우 입력 변수들의 수에 지수 함수적이 되므로, 결정 다이어그램의 변수 순서(ordering)는 그래프 크기에 주된 역할을 하게된다. 따라서, 패스-트랜지스터와 도미노-논리가 존재하는 사전에 충전하는 회로(Precharging circuitry)에서 그래프 크기에서의 효율성을 위한 입력 순서 알고리즘을 제안한다. 그리고, 실험 결과는 여러 가지 벤치-마크 회로에서 여러 번의 실험을 통해서 제안된 알고리즘이 스위치-레벨에서의 기능적 시뮬레이션, 전력 측정과 결점 시뮬레이션에 적용될 수 있을 만큼 충분히 효율적임을 보여준다.율적임을 보여준다.

• 한국융합학회논문지
• /
• 제8권8호
• /
• pp.27-32
• /
• 2017

복수 개의 웨어러블 디바이스는 휴대성 때문에 유선으로 통신하는 것이 적합하지 않다. 복수 개의 웨어러블 디바이스가 서로 통신 할 때 우수한 통신 품질과 그룹 활동 특징 때문에 무선통신 방법을 이용한다. 본 논문에서 복수 개의 웨어러블 디바이스들의 그룹형 디스플레이를 위한 그룹결정 알고리즘을 제안하였다. 이것은 무선통신 환경에서 여러 개의 웨어러블 디바이스들이 단체동작 디스플레이를 할 때 거리측정을 통하여 그룹멤버로 인지하는 그룹결정 알고리즘을 의미한다. 실험결과 복수 개의 웨어러블 디바이스들의 그룹 디스플레이가 단일 웨어러블 디스플레이의 한계를 극복하였음을 보여주었다.

• 한국산학기술학회논문지
• /
• 제10권12호
• /
• pp.3702-3707
• /
• 2009

본 논문은 Gray 부호화된 QAM (Quadrature Amplitude Modulation) 신호를 I 축 상에서 M개의 심벌을 갖는 M-PAM (Pulse Amplitude Modulation)과 Q 축 상에서 N개의 심벌을 갖는 N-PAM으로 분리한다. 수신된 심벌 신호를 비트 연판정 값으로 변환하기 위하여 Euclidean 거리를 이용한 근사화된 MAP (Maximum a Posteriori) 알고리듬을 제시한다. 기존의 Max-Log-MAP 방식은 일반 MAP 방식에서 사용하는 지수함수 혹은 로그함수 대신 심벌간 거리 비교를 통하여 구현 복잡도를 낮추었다. 그러나 심벌의 수가 증가 할수록 비교대상이 많아지므로 구현 복잡도가 증가하게 된다. 제안된 알고리듬은 사칙 연산에 의해 계산이 되기 때문에 직관적으로 구현복잡도가 낮아짐을 알 수 있다.

• Journal of information and communication convergence engineering
• /
• 제7권2호
• /
• pp.193-198
• /
• 2009

The H.264/ AVC video coding standard supports the intra prediction with various block sizes for luma component and a 8x8 block size for chroma components. This new feature of H.264/AVC offers a considerably higher improvement in coding efficiency compared to previous compression standards. In order to achieve this, H.264/AVC uses the Rate-distortion optimization (RDO) technique to select the best intra prediction mode for each block size, and it brings about the drastic increase of the computation complexity of H.264 encoder. In this paper, a fast block size decision algorithm is proposed to reduce the computation complexity of the intra prediction in H.264/AVC. The proposed algorithm computes the smoothness based on AC and DC coefficient energy for macroblocks and compares with the nonparametric criteria which is determined by considering information on neighbor blocks already reconstructed, so that deciding the best probable block size for the intra prediction. Also, the use of non-parametric criteria makes the performance of intra-coding not be dependent on types of video sequences. The experimental results show that the proposed algorithm is able to reduce up to 30% of the whole encoding time with a negligible loss in PSNR and bitrates and provides the stable performance regardless types of video sequences.

• 한국통신학회논문지
• /
• 제36권8C호
• /
• pp.516-521
• /
• 2011

이 논문에서는 심각한 다중경로 페이딩 왜곡과 충격성 잡음을 극복하기 위해 결정궤환 구조를 갖추고 오차의 영확률을 최대화하는 비선형 알고리듬(MZEP-DF)를 제안하였다. 제안된 MZEP-DF 알고리듬은 충격성 잡음에 강인성을 보였고 궤환구조 영역에서 잔여 심볼간 간섭을 제거하는 능력을 보였다. 기존 LMS 알고리듬이 정상상태 오차 전력에 대해 -3 dB 이하로 수렴하지 못했던 심각한 다중경로 페이딩과 충격성 잡음 환경에 대해 제안한 알고리듬은 선형 MZEP 알고리듬과 비교하였을 때, 10 dB 이상 성능향상을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.1128-1139
• /
• 2012

With the development of three-dimensional display and related technologies, depth video coding becomes a new topic and attracts great attention from industries and research institutes. Because (1) the depth video is not a sequence of images for final viewing by end users but an aid for rendering, and (2) depth video is simpler than the corresponding color video, fast algorithm for depth video is necessary and possible to reduce the computational burden of the encoder. This paper proposes a fast mode decision algorithm for depth video coding based on depth segmentation. Firstly, based on depth perception, the depth video is segmented into three regions: edge, foreground and background. Then, different mode candidates are searched to decide the encoding macroblock mode. Finally, encoding time, bit rate and video quality of virtual view of the proposed algorithm are tested. Experimental results show that the proposed algorithm save encoding time ranging from 82.49% to 93.21% with negligible quality degradation of rendered virtual view image and bit rate increment.

• 경영과학
• /
• 제24권2호
• /
• pp.157-176
• /
• 2007

Fuzzy cognitive map(FCM) has long been used as an effective way of constructing the human's decision making process explicitly. By taking advantage of this feature, FCM has been extensively used in providing what-if solutions to a wide variety of business decision making problems. In contrast, the goal-seeking analysis mechanism by using the FCM is rarely observed in literature, which remains a research void in the fields of FCM. In this sense, this study proposes a new type of the FCM-based goal-seeking analysis which is based on utilizing the genetic algorithm. Its main recipe lies in the fact that the what-if analysis as well as goal-seeking analysis are enabled very effectively by incorporating the genetic algorithm into the FCM-driven inference process. To prove the empirical validity of the proposed approach, valid questionnaires were gathered from a number of experts on software sales, and analyzed statistically. Results showed that the proposed approach is robust and significant.

• 대한안전경영과학회지
• /
• 제7권5호
• /
• pp.1-8
• /
• 2005

The consequences of rapid industrial advancement, diversified types of business and unexpected industrial accidents have caused a lot of damage to many unspecified persons both in a human way and a material way Although various previous studies have been analyzed to prevent industrial accidents, these studies only provide managerial and educational policies using frequency analysis and comparative analysis based on data from past industrial accidents. The main objective of this study is to find an optimal algorithm for data analysis of industrial accidents and this paper provides a comparative analysis of 4 kinds of algorithms including CHAID, CART, C4.5, and QUEST. Decision tree algorithm is utilized to predict results using objective and quantified data as a typical technique of data mining. Enterprise Miner of SAS and AnswerTree of SPSS will be used to evaluate the validity of the results of the four algorithms. The sample for this work chosen from 19,574 data related to construction industries during three years ($2002\sim2004$) in Korea.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.3165-3181
• /
• 2019

Spherical videos, which are also called 360-degree videos, have become increasingly popular due to the rapid development of virtual reality technology. However, the large amount of data in such videos is a huge challenge for existing transmission system. To use the existing encode framework, it should be converted into a 2D image plane by using a specific projection format, e.g. the equi-rectangular projection (ERP) format. The existing high-efficiency video coding standard (HEVC) can effectively compress video content, but its enormous computational complexity makes the time spent on compressing high-frame-rate and high-resolution 360-degree videos disproportionate to the benefits of compression. Focusing on the ERP format characteristics of 360-degree videos, this work develops a fast decision algorithm for predicting the coding unit depth interval and adaptive mode decision for intra prediction mode. The algorithm makes full use of the video characteristics of the ERP format by dealing with pole and equatorial areas separately. It sets different reference blocks and determination conditions according to the degree of stretching, which can reduce the coding time while ensuring the quality. Compared with the original reference software HM-16.16, the proposed algorithm can reduce time consumption by 39.3% in the all-intra configuration, and the BD-rate increases by only 0.84%.

• Journal of Information Processing Systems
• /
• 제17권3호
• /
• pp.615-629
• /
• 2021

With the development of mobile edge computing, how to utilize the computing power of edge computing to effectively and efficiently offload data and to compute offloading is of great research value. This paper studies the computation offloading problem of multi-user and multi-server in mobile edge computing. Firstly, in order to minimize system energy consumption, the problem is modeled by considering the joint optimization of the offloading strategy and the wireless and computing resource allocation in a multi-user and multi-server scenario. Additionally, this paper explores the computation offloading scheme to optimize the overall cost. As the centralized optimization method is an NP problem, the game method is used to achieve effective computation offloading in a distributed manner. The decision problem of distributed computation offloading between the mobile equipment is modeled as a multi-user computation offloading game. There is a Nash equilibrium in this game, and it can be achieved by a limited number of iterations. Then, we propose a distributed computation offloading algorithm, which first calculates offloading weights, and then distributedly iterates by the time slot to update the computation offloading decision. Finally, the algorithm is verified by simulation experiments. Simulation results show that our proposed algorithm can achieve the balance by a limited number of iterations. At the same time, the algorithm outperforms several other advanced computation offloading algorithms in terms of the number of users and overall overheads for beneficial decision-making.