• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.77-80
• /
• 2002

In this paper, we analyze a physical layer of W-CDMA .system and design a transmitter and receiver by using ADS (Advanced Design System). Also, we simulated a link level performance with different channel estimation algorithm in Jakes fading channel environment. For the channel estimator, we used the WMSA(Weighted Multi-Slot Averaging) algorithm, EGE(Equal Gain Estimation) algorithm and SSE(Symbol-to-Symbol Estimation) algorithm. This study will be useful in the analysis and design of W-CDMA system.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.1
• /
• pp.24-32
• /
• 2010

This paper introduces a B-spline based branch & bound algorithm for global optimization. The branch & bound is a well-known algorithm paradigm for global optimization, of which key components are the subdivision scheme and the bound calculation scheme. For this, we consider the B-spline hypervolume to approximate an objective function defined in a design space. This model enables us to subdivide the design space, and to compute the upper & lower bound of each subspace where the bound calculation is based on the LHS sampling points. We also describe a search tree to represent the searching process for optimal solution, and explain iteration steps and some conditions necessary to carry out the algorithm. Finally, the performance of the proposed algorithm is examined on some test problems which would cover most difficulties faced in global optimization area. It shows that the proposed algorithm is complete algorithm not using heuristics, provides an approximate global solution within prescribed tolerances, and has the good possibility for large scale NP-hard optimization.

• Journal of Platform Technology
• /
• v.6 no.4
• /
• pp.26-33
• /
• 2018

In this paper, we propose an image retrieval algorithm for real-time processing and design it as hardware. The proposed method is based on the classification of BoWs(Bag of Words) algorithm and proposes an image search algorithm using bit stream. K-fold cross validation is used for the verification of the algorithm. Data is classified into seven classes, each class has seven images and a total of 49 images are tested. The test has two kinds of accuracy measurement and speed measurement. The accuracy of the image classification was 86.2% for the BoWs algorithm and 83.7% the proposed hardware-accelerated software implementation algorithm, and the BoWs algorithm was 2.5% higher. The image retrieval processing speed of BoWs is 7.89s and our algorithm is 1.55s. Our algorithm is 5.09 times faster than BoWs algorithm. The algorithm is largely divided into software and hardware parts. In the software structure, C-language is used. The Scale Invariant Feature Transform algorithm is used to extract feature points that are invariant to size and rotation from the image. Bit streams are generated from the extracted feature point. In the hardware architecture, the proposed image retrieval algorithm is written in Verilog HDL and designed and verified by FPGA and Design Compiler. The generated bit streams are stored, the clustering step is performed, and a searcher image databases or an input image databases are generated and matched. Using the proposed algorithm, we can improve convenience and satisfaction of the user in terms of speed if we search using database matching method which represents each object.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.9 no.1
• /
• pp.122-130
• /
• 2001

In order to improve the efficiency of the design process and the quality of the resulting design, this study proposes a design method for determining design variables of an automotive wheel-bearing unit of double-row angular-contact ball bearing type by using a genetic algorithm. The desired performance of the wheel-bearing unit is to maximize system life while satisfying geometrical and operational constraints without enlarging mounting spae. The use of gradient-based optimization methods for the design of the unit is restricted because this design problem is characterized by the presence of discrete design variables such as the number of balls and standard ball diameter. Therefore, the design problem of rolling element bearings is a constrained discrete optimization problem. A genetic algorithm using real coding and dynamic mutation rate is used to efficiently find the optimum discrete design values. To effectively deal with the design constraints, a ranking method is suggested for constructing a fitness function in the genetic algorithm. A computer program is developed and applied to the design of a real wheel-bearing unit model to evaluate the proposed design method. Optimum design results demonstrate the effectiveness of the design method suggested in this study by showing that the system life of an optimally designed wheel-bearing unit is enhanced in comparison with that of the current design without any constraint violations.

• Proceedings of the KIEE Conference
• /
• 1999.07a
• /
• pp.253-255
• /
• 1999

In this paper, a shape optimization algorithm of superconducting magnet using finite element method is presented. Since the superconductor loses its superconductivity over the critical magnetic field and critical current density, this material property should be taken into account in the design process. Trial and error approach of repeating the change of the design variables costs much time and it sometimes does not guarantee an optimal design. This paper presents a systematic and efficient design algorithm for the superconducting magnet. We employ the sensitivity analysis based on finite element formulation. As for optimization algorithm, the inequality constraint for the superconducting state is removed by modifying the objective function and the nonlinear equality constraint of constant volume is satisfied by the gradient projection method. This design algorithm is applied to an optimal design problem of a solenoid air-cored superconducting magnet that has a design objective of the maximum energy storage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.468-475
• /
• 2003

In this Paper, we design an optimal binary phase computer generated hologram for Pattern generation using combined genetic algorithm and simulated annealing algorithm together. To design an optimal binary phase computer generated hologram, in searching process of the proposed method, the simple genetic algorithm is used to get an initial random transmittance function of simulated annealing algorithm. Computer simulation shows that the proposed algorithm has better performance than the genetic algorithm or simulated annealing algorithm of terms of diffraction efficiency

• Journal of Information Processing Systems
• /
• v.20 no.3
• /
• pp.409-417
• /
• 2024

Excellent apparel design can increase market competitiveness. This article briefly introduced the theory of fractals and its application in the field of apparel design. The convolutional neural network (CNN) algorithm was used to assist in the evaluation of apparel designs. In the case analysis, the accuracy of the evaluation was validated by comparing the CNN algorithm with two other intelligent algorithms, support vector machine (SVM) and back propagation (BP). The evaluation of the proposed design showed that compared with SVM and BP algorithms, the CNN algorithm had higher accuracy in evaluating apparel designs. The evaluation result of the proposed apparel design not only further verifies the effectiveness of the CNN algorithm, but also demonstrates that the theory of fractals can be effectively applied in apparel design to provide more innovative designs.

• Steel and Composite Structures
• /
• v.18 no.2
• /
• pp.305-324
• /
• 2015

In this study, two common types of laterally supported castellated beams are considered as design problems: beams with hexagonal openings and beams with circular openings. The main goal of manufacturing these beams is to increase the moment of inertia and section modulus, which results in greater strength and rigidity. These types of open-web beams have found widespread use, primarily in buildings, because of great savings in materials and construction costs. Hence, the minimum cost is taken as the design objective function and the Colliding Bodies Optimization (CBO) method is utilized for obtaining the solution of the design problem. The design methods used in this study are consistent with BS5950 Part 1 and Part 3, and Euro Code 3. A number of design examples are considered to optimize by CBO algorithm. Comparison of the optimal solution of the CBO algorithm with those of the Enhanced Charged System Search (ECSS) method demonstrate the capability of CBO in solving the present type of design problem. It is also observed that optimization results obtained by the CBO algorithm for three design examples have less cost in comparison to the results of the ECSS algorithm. From the results obtained in this paper, it can be concluded that the use of beam with hexagonal opening requires smaller amount of steel material and it is superior to the cellular beam from the cost point of view.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.3
• /
• pp.237-250
• /
• 2003

Since an orthotropic steel deck bridge has large number of design variables and shows complex structural behavior, it would be very difficult and impractical to directly use a Conventional Single Level (CSL) optimization algorithm for its optimum design. Thus, in this paper, an Improved Multi Level Design Synthesis (IMLDS) optimization algorithm is proposed to improve the computational efficiency. In the proposed IMLDS algorithm, a coordination method is introduced to divide the bridge into main girders and orthotropic steel deck with preserving the characteristics of the structural behavior. For an efficient optimization of the bridge, the IMLDS algorithm incorporates the various crucial approximation techniques such as constraints deletion, Automatic Differentiation (AD), stress reanalysis, and etc. In the case of orthotropic steel deck system, optimum design problems are characterized by mixed continuous discrete variables and discontinuous design space. Thus, a modified Genetic Algorithm (GA) is also applied to optimize discrete member design for orthotropic steel deck. From the numerical example, the efficiency and convergency of the IMLDS algorithm proposed in this paper is investigated. It may be positively stated that the IMLDS algorithm will lead to more effective and practical design compared with previous algorithms.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.10
• /
• pp.192-199
• /
• 2000

The design of multi-stage gear drives is a time-consuming process because it includes more complicated problems, which are not considered in the design of single-stage gear drives. The designer has no determine the number of reduction stages and the gear ratios of each reduction stage. In addition, the design problems include not only dimensional design but also configuration design of gear drive elements. There is no definite rule or principle for these types of design problems. Thus the design practices largely depend on the sense and the experiences of the designer, and consequently result in undesirable design solution. A new and generalized design algorithm has been proposed to support the designer at the preliminary phase of the design of multi-stage gear drives. The proposed design algorithm automates the design process by integrating the dimensional design and the configuration design process. The algorithm consists of four steps. In the first step, the user determines the number of reduction stages. In the second step, gear ratios of every stage are chosen using the random search method. The values of the basic design parameters of a gear are chose in the third step by using the generate and test method. Then the values of the dimensions, such as pitch diameter, outer diameter and face width, are calculated for the configuration design in the next step. The strength and durability of each gear is guaranteed by the bending strength and the pitting resistance rating practices by using AGMA rating formulas. In the final step, the configuration design is carried out using simulated annealing algorithm. The positions of gears and shafts are determined to minimize the geometrical volume (size) of a gearbox while avoiding interferences between them. These steps are carried out iteratively until a desirable solution is acquired. The proposed design algorithm is applied to the preliminary design of four-stage gear drives in order to validate the availability. The design solution has considerably good results in both aspects of the dimensional and the configuration design.