• 로봇학회논문지
• /
• 제5권4호
• /
• pp.332-338
• /
• 2010

This paper presents a study of path-planning method for AGV(automated guided vehicle) based on path-tracking. It is important to find an optimized path among the AGV techniques. This is due to the fact that the AGV is conditioned to follow the predetermined path. Consequently, the path-planning method is implemented directly affects the whole AGV operation in terms of its performance efficiency. In many existing methods are used optimization algorithms to find optimized path. However, such methods are often prone with problems in handling the issue of inefficiency that exists in system's operation due to inherent undue time delay created by heavy load of complex computation. To solve such problems, we offer path-planning method using modified binary tree. For the purpose of our experiment, we initially designed a AGV that is equiped with laser navigation, two encoders, a gyro sensor that is meant to be operated within actual environment with given set of constrictions and layout for the AGV testing. The result of our study reflects the fact that within such environments, the proposed method showed improvement in its efficiency in finding optimized path.

• 한국군사과학기술학회지
• /
• 제17권3호
• /
• pp.358-363
• /
• 2014

In this paper, we present two constructions of the attribute-based broadcast encryption(ABBE) algorithm. Attribute-based encryption(ABE) algorithm enables an access control mechanism over encrypted data by specifying access policies among private keys and ciphertexts. ABBE algorithm can be used to construct ABE algorithm with revocation mechanism. Revocation has a useful property that revocation can be done without affecting any non-revoked uers. The main difference between our algorithm and the classical ones derived from the complete subtree paradigm which is apt for military hierarchy. Our algorithm improve the efficiency from the previously best ABBE algorithm, in particular, our algorithm allows one to select or revoke users by sending ciphertext of constant size with respect to the number of attributes and by storing logarithm secret key size of the number of users. Therefore, our algorithm can be an option to applications where computation cost is a top priority and can be applied to military technologies in the near future.

• Nuclear Engineering and Technology
• /
• 제44권7호
• /
• pp.755-766
• /
• 2012

A Binary Decision Diagram (BDD) is a graph-based data structure that calculates an exact top event probability (TEP). It has been a very difficult task to develop an efficient BDD algorithm that can solve a large problem since its memory consumption is very high. Recently, in order to solve a large reliability problem within limited computational resources, Jung presented an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. In this paper, it is first identified that Jung's BDD truncation algorithm can be improved for a more practical use. Then, a more efficient truncation algorithm is proposed in this paper, which can generate truncated BDD with smaller size and approximate TEP with smaller truncation error. Empirical results showed this new algorithm uses slightly less running time and slightly more storage usage than Jung's algorithm. It was also found, that designing a truncation algorithm with ideal features for every possible fault tree is very difficult, if not impossible. The so-called ideal features of this paper would be that with the decrease of truncation limits, the size of truncated BDD converges to the size of exact BDD, but should never be larger than exact BDD.

• 한국정보통신학회논문지
• /
• 제10권3호
• /
• pp.413-420
• /
• 2006

본 논문에서는 현재 900MHz 대역의 RRD에서 사용하는 ISO18000-6의 규격 중 Type-B의 전송 프로토콜과 충돌방지 알고리즘을 개선해보고자 FPGA를 이용하여 RFID 시스템을 설계 및 구현하였고 그 성능을 측정하였다 제안한 RFID 시스템에서의 충돌 방지 알고리즘을 기존의 이진 트리 알고리즘 및 bit-by-bit 알고리즘과 성능을 비교 분석하였다. 태그의 개수가 증가할수록 제안한 알고리즘이 기존 알고리즘보다 우수한 성능을 보임을 OPNET 모의실험을 통하여 검증하였다. 개선한 Type-B의 전송 프로토콜과 충돌 방지 알고리즘은 Xilinx사의 FPGA 디자인 툴인 ISE7.1i를 사용하여 설계 하였으며 Xilinx사의 FPGA 디바이스인 Spartan2칩에 구현하였다.

• 대한전자공학회논문지TC
• /
• 제42권10호
• /
• pp.25-30
• /
• 2005

본 논문에서는 신호공간 검출의 개념을 일반화하여 하나의 심볼 구간에서 하나 이상의 심볼들의 블록에 대한 검출을 수행하는 고정지연 트리 검색 신호검출기의 구성을 제안한다. 제안된 기법은 고속의 구현에 적합하다. 두 가지의 접근방법이 논의되며 이들은 모두 효율적인 신호공간 분할에 기반을 두고 있다. 첫 번째 방법에서는 심볼의 검출이 다중 클래스 분할에 기반을 둔다. 이 방법은 2개의 클래스에 기반을 둔 이진 심볼 검출방법을 일반화한 접근방법을 사용한다. 두 번째 방법에서는 이진 신호 검출이 look-ahead 기법과 결합된 고도의 병렬처리 신호검출 구조를 활용한다.

• 대한전자공학회논문지SP
• /
• 제44권5호
• /
• pp.94-102
• /
• 2007

잠음감소에 있어서 웨이브렛 임계처리 알고리즘은 미니맥스 관점에서 거의 최적의 성능을 보이는 것으로 알려져 있다. 그러나 웨이브렛 임계처리 알고리즘은 웨이브렛 함수의 복잡성으로 인해 FPGA와 같은 하드웨어 상에 구현이 어렵다. 본 논문에서는 이진트리 구조 필터뱅크에서 전체 신호전력에 대한 각 부밴드 신호 전력비에 기반한 새로운 잡음감소 기법을 제안한다. 그리고 이 기법을 FPGA 상에 구현한다. 간단한 구현을 위해 필터뱅크는 하다마드 변환 계수로 설계된다. 시뮬레이션과 하드웨어 실험결과 제안방법이 간단하지만 웨이브렛에 기반한 소프트 임계처리 잡음감소 알고리즘과 성능이 유사함을 보인다.

• 정보처리학회논문지C
• /
• 제9C권6호
• /
• pp.817-822
• /
• 2002

전자문서의 안전한 전송과 법적인 시점확인을 위하여 안전하고. 효율적인 타임스탬프 방법이 요구된다. 된 논문은 H-이진트리에서 작성되는 타임스탬프 구조를 이용하여, 간단하고 효율적인 전자문서 패킷을 작성할 수 있는 프로토콜을 제안한다. 기존 전자서명에이용되고 있는 RSA 프로토콜은 비도면에서 취약하기 때문에, 강한 타임스탬프 구조가 요구된다. 이러한 문제점을 보완하기 위해서 이론적으로 트리구조를 갖는 형태이며 H-이진트리O(logn) 시간복잡도를 갖는, 전자문서에 대한 타임스탬프 프로토콜을 설계하고 기존의 프로토콜 방식과 비교 분석한다.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.629-640
• /
• 2000

this paper present an efficient line-drawing algorithm that reduces the amount of space required, Because of its efficiency , this line-drawing algorithm is faster than the Bresenham algorithm or the recursive bisection method. this efficiency was achieved through a new data structure; namely , the modified segment tree (MST). Using the modified segment tree and the distribution rule suggested in this paper, we dra lines without generating the recursive calls used in [3] and without creating the binary operation used in [4]. we also show that line accuracy improves in proportion to the display resolution . In practice, we can significantly improve the algorithm's performance with respect to time and space, This improvement offer an increase in speed, specially with lines at or near horizontal, diagonal. or vertical ; that is, this algorithm requires the time complexity of (n) and the space complexity O(2k+1), where n is the number of pixels and k is a level of the modified segment tree.

• Journal of Communications and Networks
• /
• 제12권5호
• /
• pp.475-479
• /
• 2010

The clipping value, defined as the log-likelihood ratio (LLR) in the case wherein all the list of candidates have the same binary value, is investigated, and an effective method to estimate it is presented for iterative tree search detection. The basic principle behind the method is that the clipping value of a channel bit is equal to the LLR of the maximum probability of correct decision of the bit to the corresponding probability of erroneous decision. In conjunction with multilevel bit mappings, the clipping value can be calculated with the parameters of the number of transmit antennas, $N_t$; number of bits per constellation point, $M_c$; and variance of the channel noise, $\sigma^2$, per real dimension in the Rayleigh fading channel. Analyses and simulations show that the bit error performance of the proposed method is better than that of the conventional fixed-value method.

• 한국경영과학회지
• /
• 제33권2호
• /
• pp.103-114
• /
• 2008

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members' sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.