• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.344-350
• /
• 2009

In this paper, we propose a new interconnection network, hierarchical odd network HON($C_d,C_d$), which used the odd network as basic modules. We investigate various topological properties of HON($C_d,C_d$), including connectivity, routing algorithm, diameter and broadcasting. We show that HON($C_d,C_d$) outperforms the three networks, i.e. the odd network, HCN(m,m), and HFN(m,m).

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.7
• /
• pp.318-326
• /
• 2008

In this paper, we will analyze embedding among Folded Hypercube, Even Network and Odd Network to further improve the network cost of Hypercube. We will show Folded Hypercube $FQ_n$ can be embedded into Even Network $E_{n-1}$ with dilation 2, congestion 1 and Even Network $E_d$ can be embedded into Folded Hypercube $FQ_{2d-3}$ with dilation 1. Also, we will prove Folded Hypercube $FQ_n$ can be embedded into Odd Network $O_{n-1}$ with dilation 2, congestion 1 and Odd Network $O_d$ can be embedded into Folded Hypercube $FQ_{2d-3}$ with dilation 2, congestion 1. Finally, we will show Even Network $E_d$ can be embedded into Odd Network $O_d$ with dilation 2, congestion 1 and Odd Network $O_d$ can be embedded into Folded Hypercube $E_{d-1}$ with dilation 2, congestion 1.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.429-436
• /
• 2009

Odd network was introduced as one model of graph theory. In [1], it was introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties such as simple routing algorithms, maximal fault tolerance, node axsjoint path, etc. In this paper, we sauw a construction algorithm of edge-axsjoint spanning trees in Odd network $O_d$. Also, we prove that edge-disjoint spanning tree generated by our algorithm is optimal edge-disjoint spanning tree.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.856-858
• /
• 2008

Odd networks were introduced in the context of graph theory. However, their potential as fault-tolerant multiprocessor networks has been shown. Broadcasting is one of the most important communication primitives used in multiprocessor networks. In this letter, we introduce efficient one-to-all broadcasting schemes of odd networks for one-port and all-port models. We show the broadcasting time of the former is 2d-2 and that of the latter is d-1. The total time steps taken by the proposed algorithms are optimal.

• Journal of electromagnetic engineering and science
• /
• v.15 no.4
• /
• pp.258-265
• /
• 2015

A de-embedding method for multiport networks, especially for coupled odd interconnection lines, is presented in this paper. This method does not require a conversion from S-parameters to T-parameters, which is widely used in the de-embedding technique of multiport networks based on cascaded simple two-port relations, whereas here, we apply an operation to the S-matrix to generate all the uncoupled and coupled coefficients. The derivation of the method is based on the relations of incident and reflected waves between the input of the entire network and the input of the intrinsic device under test (DUT). The characteristics of the intrinsic DUT are eventually achieved and expressed as a function of the S-parameters of the whole network, which are easily obtained. The derived coefficients constitute ABCD-parameters for a convenient implementation of the method into cascaded multiport networks. A validation was performed based on a spice-like circuit simulator, and this verified the proposed method for both uncoupled and coupled cases.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.05a
• /
• pp.351-351
• /
• 2004

For greeting the era of ubiquitous network, data storage devices have been essentially attached to mobile data devices. As a result, the minimization of the storage device has arisen as major interests in the next generation data storage technology. So, there are many researches for the small form factor ODD. In this paper, we propose a pick up that consists of a linear VCM and 2-wire focusing actuator for a small form factor ODD. For the sake of checking performance of the coarse actuator, PID controller is designed. Experiment with controller and DSP board shows its propriety as a fine tracking actuator. And, 2-wire suspension actuator is designed in order to be contained in a coarse actuator and to satisfy the thickness of a PCMCIA type. Through the experiment of designed actuator, It verifies performance as a focusing actuator.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.659-662
• /
• 2007

알고리즘의 설계에 있어서 주어진 연결망을 다른 연결망으로 임베딩하는 것은 알고리즘을 활용하는 중용한 방법중의 하나이다. 본 논문에서는 하이퍼큐브보다 망비용이 개선된 이븐 연결망과 오드 연결망 사이의 임베딩을 분석하고, 이븐 연결망이 이분할 연결망임을 보인다. 이븐 연결망을 오드 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보이고, 오드 연결망을 이븐 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.663-666
• /
• 2007

본 논문에서는 하이퍼큐브보다 망비용이 개선된 Folded 하이퍼큐브 연결망과 오드 연결망 사이의 임베딩을 분석한다. Folded 하이퍼큐브 $FQ_n$을 오드 연결망 $O_{2n+1}$에 연장율 2, 밀집율 1에 임베딩 가능함을 보이고, 오드 연결망 $O_d$을 Folded 하이퍼큐브 $FQ_{2d-1}$에 연장율 2, 밀집율 1에 임베딩 가능함을 보인다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.88-94
• /
• 1994

Inverse Chebyshev function can realize the same order of Chebyshev function nuder the same specification. In general, inverse Chebyshev function has the preferable characteristics in terms of the delay characteristics and the time-domain performances compare with Chebyshev function. However, for the even order n, inverse Chebyshev function does not realize in the doubly-terminated ladder network which has preferable sensitivity characteristics because of the finite value at ${\omega}={\infty}$. In this paper, the modified inverse Chebyshev function with $\mid$H($j^{\infty}$$\mid$=0 s proposed to realize the passive doubly-terminated ladder network for the n even or odd. The modified inverse Chebyshev function characteristics ars studied in the frequency and time domain, and then, realize the passive doubly-terminated ladder network.

• The Proceedings of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.13 no.2
• /
• pp.212-212
• /
• 1999

This paper proposed a high impedance fault detection method using a neural network on distribution lines. The v-I characteristic curve was obtained by high impedance fault data tested in various soil conditions. High impedance fault was simulated using EMTP. The pattern of High Impedance Fault on high density pebbles was taken as the learning model, and the neural network was valuated on various soil conditions. The average values after analyzing fault current by FFT of evenr·odd harmonics and fundamental rms were used for the neural network input. Test results were verified the validity of the proposed method.