• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.1
• /
• pp.60-63
• /
• 2009

In this paper, Designed and implemented about module that generate division signal for uplink section and downlink section for controlling Tx/Rx antenna of 2.3-2.7GHz WiMAX TDD repeater. It is consisted of RF block and Baseband block, and because function of this module is that synchronize with WiMAX signal and create division signal for uplink section and downlink section, this module was designed only received path. And because of manufacturing of most RF block by one chip, this module could minimize area. And in baseband block, used the WiMAX Modem to detect Preamble and DL-MAP information of WiMAX signal. This design can process about 2.3-2.7GHz WiMAX.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1021-1024
• /
• 2009

현재 사용되고 있는 통행시간 분류방법은 하나의 통행시간을 대푯값으로 가지고 있다. 이에 문제점은 고속도로 특성으로 규정 속도 이상의 속도로 주행하는 차량, 규정 속도 및 휴게소 이용차량, 운전자의 운전 습성, 통행 목적, 피로의 정도, 운전자 성향과 도로상황에 따라 통행시간이 다르게 나타나는 점이다. TCS(Toll Collection System) 자료는 고속도로의 다양한 특성이 포함되어 있으며, 대상 구간의 거리가 멀수록 목적지에 도달하는 통행시간의 분산이 커지는 특성 또한 보인다. 따라서 이를 처리하기 위한 효율적인 통행시간 분류, 구간대표통행시간 추출 알고리즘이 필요하다. 기존의 방법은 전체 통행차량의 통행시간을 감안한 방법으로 통행시간 예측시 정확성이 저하된다. 본 연구에서는 TCS 자료를 Fuzzy c-means 알고리즘을 이용하여 일일 고속도로 통행시간의 시간별 주행특성을 고려한 대푯 값을 추출하는 알고리즘을 제안하였다. 실제 서울-청주 구간을 운행한 TCS 자료를 가지고 실시한 실험으로, 주행특성 및 도로상황을 고려한 Fuzzy c-means를 이용한 통행시간 분류방법과 기존의 통행시간 분류 방법을 통한 통행시간을 PIFAB를 사용 TCS 자료의 실제 통행시간과 경로통행시간을 비교 평가하였다. 평가한 결과 본 연구에서 제안하는 Fuzzy c-means기법은 기존 방법인 MAD기법보다 75%, 신뢰구간(95%) 추출법 대비 81%의 정확성을 제고하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2221-2229
• /
• 2006

Optimal path search algorithm which is a killer application of mobile device to utilize location information should consider traffic flows of the roads as well as the distance between a departure and destination. The existing path search algorithms, however, are net able to cope efficiently with the change of the traffic flows. In this paper, we propose a new optimal path search algorithm. The algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road network into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and Ar algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.6
• /
• pp.2985-2991
• /
• 2013

Train radio system has been constructed in the second stage of Kyung-bu high speed railway adopting TETRA(Terrestial trunk radio) standard at 851MHz frequency band. The base stations of the train radio system should be located along railway track to ensure seamless communication between train and wayside taking the path loss of train radio propagation into consideration. This paper provides a quantitative analysis of the path loss characteristics based on the measurement results of the train radio propagation along the high speed railway. The free space propagation model and Okumura-Hata model are generally used for base station design, but they predicted 10dB lower or 20dB higher than the measured path loss. Linear regression of the field measured data by applying the log-distance model shows path loss exponent is in the 2.8-3.2 range, which can be used to predict the path loss of the train radio propagation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.137-141
• /
• 2005

Optimal path search algorithm should consider traffic flows of the roads as well as the distance between a departure and destination, The existing path search algorithms, however, usually don't apply the continuously changed traffic flows. In this paper, we propose a new optimal path search algorithm. the algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road networks into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and $A^*$ algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.42-46
• /
• 2006

As the next generation internet (NGI) is supporting High-speed in Gbps rate with the appearance of advanced network technologies, various applications that require high data rates. have been experimented and operated. By using high speed application services, many kinds of problems can be generated but we cannot easily grasp their reasons. However, if the user monitors the end-to-end one's flow data information (path and data rate in each router, state of each router) he can find them more accurately Until now, we have found out the fact that systems which can network-widely monitor end-to-end flow have not be developed yet, only simple systems which can monitor user's individual flow data at just one node are developed In this study, we suggest and materialize a system which can analyze bandwidth in real time by searching routing paths and measuring packet transfer rate between end-to-end flow data and supported flow traffic of using IPv6.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.147-154
• /
• 2007

In this paper, we propose a new parallel search algorithm to acquire synchronization for UWB(Ultra Wideband) systems that reduces computation of the correlation. The conventional synchronization acquisition algorithms check all the possible signal phases simultaneously using multiple correlators. However it reduces the acquisition time, it makes high power consumption owing to increasing of correlation. The proposed algorithm divides the preamble signal to input the correlator into an m-bit bunch. We check the result of the correlation at first stage of an m-bit bunch data and predict whether it has some synchronization acquisition information or not. Thus, it eliminates the unnecessary operation and save the number of correlation. We evaluate the proposed algorithm under the AWGN and the multi-Path channel model with MATLAB. The proposed parallel search scheme reduces number of the correlation 65% on the AWGN and 20% on the multi-path fading channel.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.11
• /
• pp.1269-1274
• /
• 2010

Wireless communication channels with the most severe multipath fading phenomenon that appears each time a different delay is caused by the frequency selective fading. At this time, ISI due to the performance degradation of wireless communication channels and data transfer speed gives the constraints. OFDM technique can remove ISI inserting longer guard interval than channel delay spread of channel between symbol. However, the multi-path delay of the channel to be serious with the guard interval can not eliminate ISI. In this case, using the equalizer must compensate. Especially, use of equalizer is need absolutely as data rate becomes high speed. In this paper, we analyze the BER performance with pre-equalization for MIMO-OFDM over fading channel. The results of this paper can be applied to MIMO-OFDM system with equalization.

• Journal of Korea Game Society
• /
• v.11 no.1
• /
• pp.93-100
• /
• 2011

Cinematic camera techniques are being increasingly applied to the game development these days. In this study, the object movement and camera effect for the game development using the curve in the 3D space were discussed. The Catmull-Rom spline algorithm follows the curve more closely than the other curve algorithms. With the algorithm proposed in this study, the Catmull-Rom spline was dynamically created according to the user's input in multiple sections in the 3D space, and objects smoothly passed along the route. In addition, Cut-Scene section is specified using the Catmull-Rom spline and the object movement can be observed. The results of the study on the accuracy and efficiency of the curve showed that the Catmull-Rom spline is very efficient not only for the object movement but also for the cinematic camera technique.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2002.02a
• /
• pp.494-500
• /
• 2002

본 연구의 목적은 DGPS와 자이로 센서를 장착하여 무인으로 콤바인을 직선주행, 선회 및 곡선주행, 직진주행 중 1 m 오프셋(offset) 주행시켰을 때, 무인 자율주행의 성능을 분석하고 개선하는데 있다. 콤바인의 무인자율주행 시스템은 콤바인의 현재위치를 인식하고, 주행하고 있는 콤바인의 주행방향을 감지하여 미리 설정된 경로를 따라 자율적으로 주행하며, 주행 중에 장애물이 검출되면 정지할 수 있도록 개발하였다. 콤바인의 무인 자율주행시스템은 DGPS의 입력 신호로부터 콤바인의 현재위치를 결정하고, 자이로 센서의 입력신호로부터 주행방향을 알 수 있다. 또한 장애물의 감지를 위한 초음파 센서, 콤바인의 주행방향을 조정하는 유압 작동부, 좌.우의 조향레버를 조정하는 서보모터 시스템, 마이크로 컴퓨터로 구성된 제어기와 입출력 인터페이스로 구성되어 있다. 콤바인 자율주행시스템의 프로그램은 DGPS 신호, 자이로 센서 등을 수신하는 수신 프로그램, DGPS 신호등으로부터 관련 변수들을 분석하여 콤바인의 조향수준을 결정하고, 유압실린더 등을 제어하는 제어 프로그램과 콤바인의 이동경로를 저장하는 저장 프로그램으로 구성되어 있다. 콤바인의 무인주행 실험결과 RMS 오차는 50 m 직선주행에서 7.52 cm, 20 m 직선주행 후 1 m 오프셋 된 30 m의 직선주행에서 21.85 cm, 20 m 직선주행 후 90$^{\circ}$선회하여 25 m 직선주행에서 7.55 cm, 반지름 23 m의 원주 사분면 곡선주행에서는 25.98 cm로 각각 나타났다. 소 구획의 포장에서 벼는 가로 방향으로 25~30 cm, 세로 방향으로 15~20 cm의 간격으로 심어져 있다. DGPS 신호에 의한 위치 결정을 할 때 자체 오차 10 cm를 고려하여도 콤바인이 직선구간 및 선회구간을 주행하며 수확작업이 가능함을 알 수 있었다. 그러나 곡선구간에서는 최대오차가 65.5 cm로 매우 크게 나타나, 콤바인을 무인 자율주행으로 수확하기에는 어려움이 있는 것으로 나타났다. 실제 포장은 이론적인 완전한 직선보다는 작은 굴곡이 있는 곡선의 형태가 이루어져 있으므로 주행 오차를 감소하기 위해서는 기계시각을 이용하면 보다 정밀한 조향을 이룰 수 있을 것으로 예상된다. 포장에서 DGPS 신호, 자이로 센서 등을 이용한 콤바인의 무인주행 장치는 무인 수확작업을 위한 가능성을 보여주었고, 일부의 센서의 기능을 개선하면 만족한 성능을 나타낼 수 있을 것으로 판단된다.