• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1463-1469
• /
• 1996

교차된 불완전 하이퍼큐브 구조는 노드나 링크의 추가없이 일반적인 구조의 복잡도를 그대로 유지하면서 직경을 약 50% 정도 감소시킨 교차된 하이퍼큐브 구조를 기반으로 하여 임의 노드의 갯수로 확장할 수 있는 향상된 구조이다. 본 연구에서는 이 구조에 적합한 오류 발생시 대처가능한 오류허용 적응적 경로배정 알고리즘과 방송 알고리즘을 제안하였으며, 이에 대한 성능 평가 실행으로 성능이 30% 향상됨을 입증하였다.

• 전자공학회논문지B
• /
• 제30B권4호
• /
• pp.27-36
• /
• 1993

This paper proposes a shortest path allocation algorithm over the processors on the hypercube system based on the message passing techniques with the optimized module allocation. On multiprocessor systems, how to divide one task into multiple tasks efficiently is an important issue due to the hardness of the life cycle estimation of each process. To solve the life cycle discrepancies, the appropriate task assignment to each processor and the flexible communications among the processors are indispensible. With the concurrent program execution on hypercube systems, each process communicaties to others with the method of message passing. And, each processor has its own memory. The proposed algorithm generates a callable tree out of the module, assigns the weight factors, constructs the allocation graph, finds the shortest path allocation tree, and maps them with hypercube.

• 전자공학회논문지B
• /
• 제32B권11호
• /
• pp.153-162
• /
• 1995

When vector quantization is used in low rate image coding (e.g., R<0.5), the primary problem is the tremendous computational complexity which is required to search the whole codebook to find the closest codevector to an input vector. Since the number of code vectors in a vector quantizer is given by an exponential function of the dimension. i.e., L=2$^{nR}$ where Rn. To alleviate this problem, a multiple shell structure of hypercube feature maps (MSSHFM) is proposed. A binary HFM of k-dimension is composed of nodes at hypercube vertices and a multiple shell architecture is constructed by surrounding the k-dimensional hfm with a (k+1)-dimensional HFM. Such a multiple shell construction of nodes inherently has a complete tree structure in it and an efficient partial search scheme can be applied with drastically reduced computational complexity, computer simulations of still image coding were conducted and the validity of the proposed method has been verified.

• 한국통신학회논문지
• /
• 제31권8B호
• /
• pp.701-706
• /
• 2006

System-level diagnosis plays an important technique for fault detection in multi-processor systems. Efficient diagnosis is very important for real time systems as well as multiprocessor systems. Feng(1) proposed two adaptive diagnosis algorithms HADA and IHADA for hypercube system. The diagnosis cost, measured by diagnosis time and the number of test links, depends on the number and location of the faults. In this paper, we propose an adaptive diagnosis algorithm using the syndrome analysis. This removes unnecessary overhead generated in HADA and IHADA algorithm sand give a better performance compared to Feng's Method.

• 예술인문사회 융합 멀티미디어 논문지
• /
• 제8권8호
• /
• pp.825-834
• /
• 2018

방송은 상호연결망에서 사용되는 가장 기본적인 정보전달 기법으로 크게 일-대-다 방송과 다-대-다 방송으로 나눌 수 있다. 일-대-다 방송은 메시지를 갖고 있는 한 노드에서 다른 모든 노드로 메시지를 전송하는 것이고, 다-대-다 방송은 메시지를 갖고 있는 각각의 노드들이 다른 모든 노드들로 메시지를 전송하는 것이다. 그리고 단위 시간 당 전송 포트를 사용하는 방법에 따라 단일 포트 통신 방식(SLA)과 멀티 포트 통신 방식(MLA)으로 나눌 수 있다. 단일 포트 통신 방식은 단위 시간에 메시지를 가지고 있는 노드가 이웃한 다른 하나의 노드로만 메시지를 전송하는 것이고, 멀티 포트 통신 방식은 단위 시간에 메시지를 가지고 있는 노드가 이웃한 모든 노드로 메시지를 전송하는 것이다. 매트릭스 하이퍼큐브는 하이퍼큐브와 동일한 노드 개수를 가지면서 하이퍼큐브보다 망비용이 개선된 연결망이다. 본 논문에서는 매트릭스 하이퍼큐브의 방송 기법을 분석한다. 먼저 매트릭스 하이퍼큐브에서의 일-대-다 방송 알고리즘과 다-대-다 방송 알고리즘을 제안한다. 그리고 SLA 기법을 이용한 일-대-다 방송 시간이 2n+1임과 MLA 기법을 이용한 일-대-다 방송 시간이 $2{\lceil}{\frac{n}{2}}{\rceil}+1$임을 보인다. 또한 SLA 기법을 이용한 다-대-다 방송 시간이 $5{\times}2^{\frac{n}{2}}-2$(n=짝수), $5{\times}2^{\frac{n-1}{2}}+2$(n=홀수)임을 증명한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 하계종합학술대회 논문집(1)
• /
• pp.163-166
• /
• 2004

In this paper, we consider the embedding problem of postorder Fibonacci circulants. We show that Fibonacci cubes and Hypercube are a subgraph of postorder Fibonacci circulants. And the postorder Fibonacci circulants of order n can be embedded into the Fibonacci cubes of order n with expansion 1, dilation n-2 and congestion O (n-1), the Hypercube of order n-2 with expansion $\frac{f_n}{2^{n-2}}$, dilation n-2 and congestion O(n-2).

• 한국지능시스템학회논문지
• /
• 제2권2호
• /
• pp.34-41
• /
• 1992

A robust and reliable learning and reasoning mechanism is addressed based upon fuzzy set theory and fuzzy associative memories. The mechanism stores a priori an initial knowledge base via approximate learning and utilizes this information for decision-making systems via fuzzy inferencing. We called this fuzzy computer architecture a 'fuzzy hypercube' processing all the rules in one clock period in parallel. Fuzzy hypercubes can be applied to control of a class of complex and highly nonlinear systems which suffer from vagueness uncertainty. Moreover, evidential aspects of a fuzzy hypercube are treated to assess the degree of certainty or reliability together with parameter sensitivity.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• pp.59-62
• /
• 2000

In this paper, We propose the new interconnection network which is designed to edge numbering method using inorder traversal a Fibonacci trees and its jump sequence is Fibonacci numbers. It has a simple (shortest path)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube on interconnection network measrtes.

• 전자공학회논문지B
• /
• 제31B권12호
• /
• pp.1-10
• /
• 1994

In this paper, we propose a processor allocation algorithm using the PGG(Packed Gray code Group) for the MIMD hypercube. The number of k-D subcubes in an n-cube is C(n.k) en-k. When the PGG is employed in the processor allocation, C(n, k) PGG's are required to recognize all the k-D subcubes in an n-cube. from the simulation we find that the capability of processor allocation using only 40% of C(n, k) PGG's is about the same as that of the allocation using all the PGG's.

• 한국지진공학회논문집
• /
• 제19권6호
• /
• pp.293-302
• /
• 2015

ASCE 4 requires that a hard stop be built around the seismic isolation system in nuclear power plants. In order to maintain the function of the isolation system, this hard stop is required to have clearance-to-stop, which should be no less than the 90th-percentile displacements for 150% Design Basis Earthquake (DBE) shaking. Huang et al. calculated clearance-to-stop by using a Latin Hypercube Sampling technique, without considering the rocking behavior of the isolated structure. This paper investigates the effects on estimation of clearance-to-stop due to 1) rocking behavior of the isolated structure and 2) sampling technique for considering the uncertainties of isolation system. This paper explains the simplified analysis model to consider the rocking behavior of the isolated structure, and the input earthquakes recorded at Diablo Canyon in the western United States. In order to more accurately approximate the distribution tail of the horizontal displacement in the isolated structure, a modified Latin Hypercube Sampling technique is proposed, and then this technique was applied to consider the uncertainty of the isolation system. Through the use of this technique, it was found that rocking behavior has no significant effect on horizontal displacement (and thus clearance-to-stop) of the isolated structure, and the modified Latin Hypercube Sampling technique more accurately approximates the distribution tail of the horizontal displacement than the existing Latin Hypercube Sampling technique.