• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.11a
• /
• pp.173-174
• /
• 2010

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8A
• /
• pp.820-826
• /
• 2007

This paper proposes an enhanced degree computationless modified Euclid's(E-DCME) algorithm and its architecture for Reed-Solomon decoders. The proposed E-DCME algorithm has shorter critical path delay that is $T_{mult}+T_{add}+T_{mux}$ compared with the existing modified Euclid's algorithm and the degree computationless modified Euclid's(DCME) algorithm since it uses new initial conditions. The proposed E-DCME architecture employing a systolic array requires only 2t-1 clock cycles to solve the key equation without initial latency. In addition, the E-DCME architecture consisting of 3t basic cells has regularity and scalability since it uses only one processing element. The E-DCME architecture using the $0.18{\mu}m$ Samsung standard cell library consists of 18,000 gates.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.60 no.3
• /
• pp.126-132
• /
• 2011

A conventional LDO(Low Dropout Regulator) uses one OPAMP and one signal path. This means that OPAMP's DC Gain and Bandwidth can't optimize simultaneously within usable power. This also appears that regulation property and settling time of LDO can't improve at the same time. Based on this idea, a proposed LDO uses two OPAMP and has two signal path. To improve regulation property, OPAMP where is used in the path which qualities DC gain on a large scale, bandwidth designed narrowly. To improve settling time, OPAMP where is used in the path which qualities DC gain small, bandwidth designed widely. A designed LDO used 0.5um 1P2M process and provided 200mA of output current. A line regulation and load regulation is 12.6mV/V, 0.25mV/mA, respectively. And measured settling time is 1.5us in 5V supply voltage.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.05a
• /
• pp.287-288
• /
• 2012

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.10a
• /
• pp.385-386
• /
• 2009

• Journal of Digital Contents Society
• /
• v.19 no.2
• /
• pp.407-413
• /
• 2018

In this paper, we present a scalable data delivery infrastructure for such IoT computing environment where we need a common platform where data providers share their diverse sensing data and applications can easily access and receive such data from providers. For efficient data delivery, this paper proposes a new delivery path management technique that take advantage of diverse consumer QoS when building bandwidth-efficient delivery paths. We perform primitive experiments on the path construction and reconstruction which may be major overhead of the scalable infrastructure. The results show that the proposed infrastructure achieves a high level of scalability, and demonstrates that the management overhead is not significant.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.59-63
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a given polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. Two points of a polygon P are said to be L-visible from each other if they can be joined by a simple chain of at most two rectilinear line segments contained in P completely. An L-visible polygon P is a polygon such that there is a point from which every point of P is L-visible. We present the customized optimal shortest path algorithm for an L-visible polygon. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls and operations for convex polygons, so it is easy to implement and runs very fast in linear time.

• Journal of Advanced Navigation Technology
• /
• v.23 no.2
• /
• pp.151-157
• /
• 2019

In geostationary satellite communications, which are widely used for broadcasting and communication, there is a path loss where the signal power on the path is largely reduced. It is important to consider rain attenuation when calculating link budget because the Ka band frequency is vulnerable to rain attenuation. In this study, rainfall trends were analyzed by using rainfall data from the year 2000 in four regions of Korea (Seoul, Incheon, Busan, Jeju) and the rainfall attenuation was calculated. This was used to analyse the satellite link budget and receiving performance for the down-link of the korea satellite COMS. In this study, the calculated G/T for the rainfall intensity of 0.5% per year using the rainfall data for 18 years increased by approximately $8.5dBK^{-1}$ compared to the ITU's zone-K rain model, and decreased by approximately $1dBK^{-1}$ compared to the precipitation data for 13 years from the TTA(Korea Telecommunications Technology Association). The results of this study can be used for the design of G/T in domestic-installed satellite ground station.

• Proceedings of the KSME Conference
• /
• 2001.06a
• /
• pp.274-279
• /
• 2001

Creep-fatigue crack growth behavior was experimentally measured particularly when a crack was located in the heat affected region of 1Cr-0.5Mo steel. Load hold times of the tests for trapezoidal fatigue waveshapes were varied among 0, 30, 300 and 3,600 seconds. Time-dependent crack growth rates were characterized by the $C_t$-parameter. It was found that the crack growth rates were the highest when the crack path was located along the fine-grained heat affected zone(FGHAZ). Cracks located in other heat affected regions had a tendency to change the crack path eventually to FGHAZ. Creep-fatigue crack growth law of the studied case is suggested in terms of $(da/dt)_{avg}$ vs. $(C_t)_{avg}$ for residual life assessment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.106-108
• /
• 2014

본 논문에서는 노드의 로드밸런싱 속성을 이용하여 분산경로를 설정하는 L.T(Load Tolerance)알고리즘을 제안한다. 모바일 애드 혹 네트워크(Mobile Ad hoc Network)는 유동성을 가진 노드들로 구성된 네트워크로 토폴로지의 변화가 빈번하여, 기존 알고리즘에서는 라우팅 경로를 유지하기 위한 계층적 네트워크연구가 진행되어 왔다. 하지만 계층적 네트워크에서 특정 클러스터 헤드노드에게 로드밸런싱이 집중될 경우, 클러스터 헤드노드의 제한된 로드밸런싱을 초과되어 통신이 단절된다. 본 논문에서 제안한 알고리즘은 유효한 통신 반경 안에 존재하는 클러스터 헤드노드들의 로드밸런싱을 측정한다. 클러스터 헤드노드의 로드밸런싱이 높을 경우, 소속된 클러스터 멤버노드는 클러스터 헤드노들의 로드밸런싱과 동적속성을 분석하여 L.T 속성을 계산하며, 계산된 L.T 속성을 이용하여, 노드의 분산경로를 설정한다. 모의실험을 통해 클러스터 헤드노드의 로드 밸런싱이 높을 경우, 로드밸런싱이 낮은 분산 경로를 제공함에 따라 향상된 패킷 전송률을 보일 것으로 기대된다.