• Title/Summary/Keyword: 오드 연결망

Search Result 8, Processing Time 0.01 seconds

Hierarchical Odd Network(HON): A New Interconnection Network based on Odd Network (계층적 오드 연결망(HON) : 오드 연결망을 기반으로 하는 새로운 상호연결망)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • 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).

Embedding Algorithms between Even network and Odd network (이븐 연결망과 오드 연결망 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.659-662
    • /
    • 2007
  • 알고리즘의 설계에 있어서 주어진 연결망을 다른 연결망으로 임베딩하는 것은 알고리즘을 활용하는 중용한 방법중의 하나이다. 본 논문에서는 하이퍼큐브보다 망비용이 개선된 이븐 연결망과 오드 연결망 사이의 임베딩을 분석하고, 이븐 연결망이 이분할 연결망임을 보인다. 이븐 연결망을 오드 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보이고, 오드 연결망을 이븐 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보인다.

Embedding Algorithms between Folded Hypercube network and Even network (Folded하이퍼큐브 연결망과 이븐연결망 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.667-670
    • /
    • 2007
  • 알고리즘의 설계에 있어서 주어진 연결망을 다른 연결망으로 임베딩하는 것은 알고리즘을 활용하는 중용한 방법중의 하나이다. 본 논문에서는 하이퍼큐브보다 망비용이 개선된 이븐 연결망과 오드 연결망 사이의 임베딩을 분석하고, 이븐 연결망이 이분할 연결망임을 보인다. 이븐 연결망을 오드 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보이고, 오드 연결망을 이븐 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보인다.

Embedding Algorithms among Folded hypercube Network and Odd network (Folded 하이퍼큐브 연결망과 오드 연결망 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • 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에 임베딩 가능함을 보인다.

Embedding Algorithm among Folded Hypercube, Even Network and Odd Network (폴디드 하이퍼큐브와 이븐연결망, 오드연결망 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Sim, Hyun;Lee, Hyeong-Ok
    • 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.

Constructing Algorithm for Optimal Edge-Disjoint Spanning Trees in Odd Interconnection Network $O_d$ (오드 연결망 $O_d$에서 에지 중복 없는 최적 스패닝 트리를 구성하는 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok;Kim, Sung-Won
    • 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.

Symmetry and Embedding Algorithm of Interconnection Networks Folded Hyper-Star FHS(2n,n) (상호연결망 폴디드 하이퍼-스타 FHS(2n,n)의 대칭성과 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok;Kim, Sung-Won
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.501-508
    • /
    • 2009
  • In this paper, we prove that folded hyper-star network FHS(2n,n) is node-symmetric and a bipartite network. We show that FHS(2n,n) can be embedded into odd network On+1 with dilation 2, congestion 1 and Od can be embedded into FHS(2n,n) with dilation 2 and congestion 1. Also, we show that $2n{\time}n$ torus can be embedded into FHS(2n,n) with dilation 2 and congestion 2.

A 2 GHz Compact Analog Phase Shifter with a Linear Phase-Tune Characteristic (2 GHz 선형 위상 천이 특성을 갖는 소형 아날로그 위상천이기)

  • Oh, Hyun-Seok;Choi, Jae-Hong;Jeong, Hae-Chang;Heo, Yun-Seong;Yeom, Kyung-Whan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.1
    • /
    • pp.114-124
    • /
    • 2011
  • In this paper, we present a 2 GHz compact analog phase shifter with linear phase-tune characteristic. The compact phase shifter was designed base on a lumped all pass network and implemented using a ceramic substrate fabricated with thin-film technique. For a linear phase-tune characteristic, a capacitance of the varactor diode for a tuning voltage was linearized by connecting series capacitor and subsequently produced an almost linear capacitance change. The inductor and bias circuit in the all pass network was implemented using a spiral inductors for small size, which results in the size reduction to $4\;mm{\times}4\;mm$. In order to measure the phase shifter using the probe station, two CPW pads are included at the input and output. The fabricated phase shifter showed an insertion loss of about 4.2~4.7 dB at 2 GHz band and a total $79^{\circ}$ phase change for DC control voltage from 0 to 5 V, and showed linear phase-tune characteristic as expected in the design.