• Journal of Korea Water Resources Association
• /
• v.32 no.4
• /
• pp.489-499
• /
• 1999

This research investigated the applicapability of an improved algorithm to calculate the topographic index, ln($\alpha$/tan B), for the topography of Korea employing channel initiation threshold area(CIT) and an exponent for the gradient(H). hanjaechun subwatershed in Cheongdochun and Dongok subwatershed in Wichun test watershed were selected as study areas. The digital elevation models(DEM) of study areas have been made with the resolution from 10m to 100m. Application of CIT to the traditional algorithm provide reasonable computation method in considering channel pixel impact. Introduction of the gradient exponent(H) made it possible to obtain better flow convergence effect in concave topography comparing with the traditional multiple flow direction algorithm. The improved algorithm shows the capability to relax the overestimation problem of rising limb of hydrograph through reducing overestimated high value of topographic index.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2A
• /
• pp.102-109
• /
• 2003

In this paper, the new multiplicative algorithm using standard basis over GF(2m) is proposed. The multiplicative process is simplified by data select method in proposed algorithm. After multiplicative operation, the terms of degree greater than m can be expressed as a polynomial of standard basis with degree less than m by irreducible polynomial. For circuit implementation of proposed algorithm, we design the circuit using multiplexer and show the example over GF(24). The proposed architectures are regular and simple extension for m. Also, the comparison result show that the proposed architecture is more simple than privious multipliers. Therefore, it well suited for VLSI realization and application other operation circuits.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.370-373
• /
• 2005

We have developed Hybrid algorithm for yellow sand detection. Hybrid algorithm is composed of three methods using infrared bands. The first method used the differential absorption in brightness temperature difference between $11\mu m\;and\;12\mu m$ (BID _1), through which help distinguish the yellow sand from various meteorological clouds. The second method uses the brightness temperature difference between $3.7\mu m\;and\;11\mu m$ (BID_2). The technique would be most sensitive to dust loading during the day when the BID _2 is enhanced by reflection of $3.7\mu m$ solar radiation. The third one is a newly developed algorithm from our research, the so-called surface temperature variation method (STY). We have applied the three methods to MODIS for derivation of the yellow sand dust and in conjunction with the Principle Component Analysis (PCA), a form of eigenvector statistical analysis. PCI shows better results for yellow sand detection in comparison with the results from individual method. The comparison between PCI and MODIS aerosols optical depth (AOD) shows remarkable good correlations during daytime and relatively good correlations over the land.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.228-233
• /
• 2010

In this paper, the iteration localization algorithm that NLOS signal is iteratively removed to get the exact location in the wireless sensor network is proposed. To evaluate the performance of the proposed algorithm, TDOA location estimation method is used, and readers are located on every 150m intervals with rectangular shape in $300m{\times}300m$ searching field. In that searching field, the error distance is analyzed according to increasing the number of iteration, sub-blink and the estimated sensor node locations which are located in the iteration range. From simulation results, the error distance is diminished according to increasing the number of the sub-blink and iteration with the proposed location estimation algorithm in NLOS environment. Therefore, to get more accurate location information in wireless sensor network in NLOS environments, the proposed location estimation algorithm removing NLOS signal effects through iteration scheme is suitable.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.4
• /
• pp.373-382
• /
• 2016

In this study, an EKF (Extended Kalman Filter) based database reference navigation using both gravity gradient and terrain data was performed to complement the weakness of using only one type of geophysical DB (Database). Furthermore, a new algorithm which combines the EKF and profile matching was developed to improve the stability and accuracy of the positioning. On the basis of simulations, it was found that the overall navigation performance was improved by the combination of geophysical DBs except the two trajectories in which the divergence of TRN (Terrain Referenced Navigation) occurred. To solve the divergence problem, the profile matching algorithm using the terrain data is combined with the EKF. The results show that all trajectories generate the stable performance with positioning error ranges between 14m to 23m although not all trajectories positioning accuracy is improved. The average positioning error from the combined algorithm for all nine trajectories is about 18 m. For further study, a development of a switching geophysical DB or algorithm between the EKF and the profile matching to improve the navigation performance is suggested.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1848-1857
• /
• 2001

This paper proposes the ETEO and MTEO burst signal detector based on TEO algorithm. These algorithms must be used after STR and AGC operation, but are not related to phase and frequency offset. ETEO algorithm is extended version of original TEO, and MTEO algorithm is proposed for improving the output characteristics of ETEO. Also, modified ETEO and MTEO algorithm are proposed for detection of PREAMBLE64. Optimal threshold value is determined and miss and false alarm probability and FER performance are evaluated by computer simulation. Finally, this paper proposes MTEO algorithm with M=3 to guarantee the Performance that FER is less than 10$\^$-2/.

• Structural Engineering and Mechanics
• /
• v.88 no.1
• /
• pp.43-52
• /
• 2023

This paper handles the results of an extensive parametric study on the rotational stiffness of the flexible base connection using ABAQUS program. The results of the parametric study show the relation between the applied moment and the relative rotation for 96 different base connections. The configurations of the studied connections considered different numbers, diameters, and spacing of the anchor bolts along with different thicknesses of the base plate to investigate the effect of these parameters on the rotational stiffness behavior. The results of the previous parametric research used through the whale optimization algorithm (WOA) to detect different equation formulation of the moment-rotation (M-Ɵ_r) equation to detect optimum equation simulates the general nonlinear rotational behavior of the flexible base connection considering all variables used in the parametric study. WOA is a relatively new promising algorithm, which is used in different types of optimization problems. For more verification, the classical genetic algorithm (GA) is used to make a comparison with WOA results. The results show that WOA is capable of getting an optimum equation of the M-Ɵ_r relation, which can be used to simulate the actual rotational stiffness of the flexible base connections. The rotational stiffness at H/150 can be calculated using WOA (1) method and be used as a design aid for engineering design.

• Journal of Satellite, Information and Communications
• /
• v.7 no.2
• /
• pp.97-103
• /
• 2012

A very low complexity QRD-M algorithm based on limited search area is proposed for MIMO systems. The conventional QRD-M algorithm calculates Euclidean distance between all constellation symbols and the temporary detection symbol at each layer. We found that performance will not be degraded even if we adaptively restrict the search area of the candidate symbols only to the neighboring points of temporary detection symbol according to the channel condition at each layer. As a channel condition indicator, we employ the channel gain ratio among the layers without necessity of SNR estimation. The simulation results show that the proposed scheme effectively achieves near optimal performance while maintaining the overall average computation complexity much smaller than the conventional QRD-M algorithm.

• Korean Journal of Remote Sensing
• /
• v.33 no.6_1
• /
• pp.961-970
• /
• 2017

Despite of large demand for high spatial resolution products of aerosol properties from satellite remote sensing, it has been very difficult due to the weak signal by a single pixel and higher noise from clouds. In this study, aerosol retrieval algorithm with the high spatial resolution ($500m{\times}500m$) was developed using Geostationary Ocean Color Imager (GOCI) data during the Korea-US Air Quality (KORUS-AQ) period in May-June, 2016.Currently, conventional GOCI Yonsei aerosol retrieval(YAER) algorithm provides $6km{\times}6km$ spatial resolution product. The algorithm was tested for its best possible resolution of 500 m product based on GOCI YAER version 2 algorithm. With the new additional cloud masking, aerosol optical depth (AOD) is retrieved using the inversion method, aerosol model, and lookup table as in the GOCI YAER algorithm. In some cases, 500 m AOD shows consistent horizontal distribution and magnitude of AOD compared to the 6 km AOD. However, the 500 m AOD has more retrieved pixels than 6 km AOD because of its higher spatial resolution. As a result, the 500 m AOD exists around small clouds and shows finer features of AOD. To validate the accuracy of 500 m AOD, we used dataset from ground-based Aerosol Robotic Network (AERONET) sunphotometer over Korea. Even with the spatial resolution of 500 m, 500 m AOD shows the correlation coefficient of 0.76 against AERONET, and the ratio within Expected Error (EE) of 51.1%, which are comparable to the results of 6 km AOD.