• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.158-165
• /
• 2013

In this paper, a new circuit topology of an ultra-wideband (UWB) 3.1-10.6GHz CMOS low noise amplifier is presented. The proposed UWB low noise amplifier is designed utilizing RC feedback and LC filter networks which can provide good input impedance matching. In this design, the current-reused topology is adopted to reduce the power consumption and the inductor-peaking technique is applied for the purpose of bandwidth extension. The performance results of this UWB low noise amplifier simulated in $0.18-{\mu}m$ CMOS process technology exhibit a power gain of 14-14.9dB, an input matching of better than -10.8dB, gain flatness of 0.9dB, and a noise figure of 2.7-3.3dB in the frequency range of 3.1-10.6GHz. In addition, the input IP3 is -5dBm and the power consumption is 12.5mW.

• Kyungpook Mathematical Journal
• /
• v.57 no.3
• /
• pp.433-439
• /
• 2017

It is well known that an integral domain D is a Dedekind domain if and only if D is a Noetherian almost Dedekind domain. In this paper, we show that an integral domain D is a Dedekind domain if and only if D is an almost Dedekind domain such that Max(D) is a Noetherian topological space as a subspace of Spec(D) with respect to the Zariski topology. We also give a new characterization of ZPI-rings.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.5
• /
• pp.411-419
• /
• 2013

Research on developing algorithms for building modeling such as extracting outlines of the buildings and segmenting patches of the roofs using aerial images or LiDAR data are active. However, utilizing information from the building model is not well implemented yet. This study aims to propose a scheme for search identical or similar shape of buildings by utilizing graph topology pattern matching under the assumptions: (1) Buildings were modeled beforehand using imagery or LiDAR data, or (2) 3D building data from digital maps are available. Side walls, segmented roofs and footprints were represented as nodes, and relationships among the nodes were defined using graph topology. Topology graph database was generated and pattern matching was performed with buildings of various shapes. The results show that efficiency of the proposed method in terms of reliability of matching and database structure. In addition, flexibility in the search was achieved by altering conditions for the pattern matching. Furthermore, topology graph representation could be used as scale and rotation invariant shape descriptor.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.4
• /
• pp.241-246
• /
• 2013

From the numerical results of density-based topology design optimization, a CAD geometric model is constructed and fabricated using 3D printer to experimentally validate the optimal design. In the process of topology design optimization, we often experience checkerboard phenomenon and complicated branches, which could result in the manufacturing difficulty of the obtained optimal design. Sensitivity filtering and morphology methods are used to resolve the aforementioned issues. Identical volume fraction is used in both numerical and experimental models for precise validation. Through the experimental comparison of stiffness in various designs including the optimal design, it turns out that the optimal design has the highest stiffness and the experimental result of compliance matches very well with the numerical one.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.593-602
• /
• 2004

A new surface reconstruction scheme for approximating the surface from a set of unorganized 3D points is proposed. Our method, called shrink-wrapped boundary face (SWBF) algorithm, produces the final surface by iteratively shrinking the initial mesh generated from the definition of the boundary faces. Proposed method surmounts the genus-0 spherical topology restriction of previous shrink-wrapping based mesh generation technique, and can be applicable to any kind of surface topology. Furthermore, SWBF is much faster than the previous one since it requires only local nearest-point-search in the shrinking process. According to experiments, it is proved to be very robust and efficient for mesh generation from unorganized points cloud.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.5
• /
• pp.1769-1772
• /
• 2011

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.4
• /
• pp.31-38
• /
• 2009

Most 3D models found in the literature focus on theoretical topology for exterior 3D volumes. Although there are a few indoor models such as CityGML or IFC, implementing a full topology for the indoor spaces is either less practical due to the complexity or not even necessary in some application domains. Moreover, current spatial DBMSs do not support functionalities explicitly for 3D topological relations. In this study, an alternative method to build a 3D indoor model with less complexity ernativespatial DBMS is suggested. Focusnation the fact that semantic attributes can be storedion the floor surface, we suggestivemulti-layered 3D model for indoor spaces. We show the process to build the proposed model in the PostGIS, a spatial DBMS. And, then, as an example application, we illustrate the process to build and run a campus building information system.

• Journal of Digital Contents Society
• /
• v.16 no.4
• /
• pp.575-581
• /
• 2015

This paper presents the development of certain highly efficient and accurate method for computing tangent curves for three-dimensional vector fields. Unlike conventional methods, such as Runge-Kutta method, for computing tangent curves which produce only approximations, the method developed herein produces exact values on the tangent curves based upon piecewise linear variation over a tetrahedral domain in 3D. This new method assumes that the vector field is piecewise linearly defined over a tetrahedron in 3D domain. It is also required to decompose the hexahedral cell into five or six tetrahedral cells for three-dimensional vector fields. The critical points can be easily found by solving a simple linear system for each tetrahedron. This method is to find exit points by producing a sequence of points on the curve with the computation of each subsequent point based on the previous. Because points on the tangent curves are calculated by the explicit solution for each tetrahedron, this new method provides correct topology in visualizing 3D vector fields.

• ETRI Journal
• /
• v.27 no.2
• /
• pp.235-238
• /
• 2005

A new mesh reconstruction scheme for approximating a surface from a set of unorganized 3D points is proposed. The proposed method, called a shrink-wrapped boundary face (SWBF) algorithm, produces the final surface by iteratively shrinking the initial mesh generated from the definition of the boundary faces. SWBF surmounts the genus-0 spherical topology restriction of previous shrink-wrapping-based mesh generation techniques and can be applied to any type of surface topology. Furthermore, SWBF is significantly faster than a related algorithm of Jeong and others, as SWBF requires only a local nearest-point-search in the shrinking process. Our experiments show that SWBF is very robust and efficient for surface reconstruction from an unorganized point cloud.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.4
• /
• pp.77-82
• /
• 2004

Being in an internet era, the rapid transmission of 3D mesh models is getting more important and efforts toward the compression of various aspects of mesh models have been provided. Even though a mesh model usually consists of coordinates of vertices and properties such as colors and normals, topology plays the most important part in the compression of other information in the models. Despite the extensive studies on Edgebreaker, the most frequently used and rigorously evaluated topology compressor, the probability distribution of its five op-codes, C, R, E, S, and L, has never been rigorously analyzed yet. In this paper, we present probability distribution of the op-codes which is useful for both the optimization of the compression performance and a priori estimation of compressed file size.