• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1257-1260
• /
• 2005

This paper is related to optimization in the image data format, which can make a great effect in performance of data compression and is based on the wavelet transform and JPEG2000. This paper established a criterion to decide the data format to be used in wavelet transform, which is on the bases of the data errors in frequency transform and quantization. This criterion has been used to extract the optimal data format experimentally. The result were (1, 9) of 10-bit fixed-point format for filter coefficients and (9, 7) of 16-bit fixed-point data format for wavelet coefficients and their optimality was confirmed.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.257-258
• /
• 2006

In this paper, we address several issues in the real time implementation of MPEG-1 Layer II decoder on a fixed-point digital signal processor (DSP), especially TMS320C6416. There is a trade-off between processing speed and the size of program/data memory for the optimal implementation. In a view of the speed optimization, we first convert the floating point operations into fixed point ones with little degradation in audio quality, and then the look-up tables used for the inverse quantization of the audio codec are forced to be located into the internal memory of the DSP. And then, window functions and filter coefficients in the decoder are precalculated and stored as constant, which makes the decoder faster even larger memory size is required. It is shown from the real-time experiments that the fixed-point implementation enables us to make the decoder with a sampling rate of 48 kHz operate with 3 times faster than real-time on TMS320C6416 at a clock rate of 600 MHz.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1831-1844
• /
• 2016

In this paper, we improve the full-Newton step infeasible interior-point algorithm proposed by Mansouri et al. [6]. The algorithm takes only one full-Newton step in a major iteration. To perform this step, the algorithm adopts the largest logical value for the barrier update parameter ${\theta}$. This value is adapted with the value of proximity function ${\delta}$ related to (x, y, s) in current iteration of the algorithm. We derive a suitable interval to change the parameter ${\theta}$ from iteration to iteration. This leads to more flexibilities in the algorithm, compared to the situation that ${\theta}$ takes a default fixed value.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.4E
• /
• pp.137-141
• /
• 2006

This paper presents HE-AAC decoder optimization on TMS320C55x fixed-point DSP core using a DSP-C like FFR code, which provides fast and flexible porting to a DSP core. Our optimization efforts are focused on methodologies that include general optimization methods of FFR code suitable for general DSP or RISC platform in high-level language and software optimization methods in assembly language level. The implementation result requires 48 MIPS and 135 Kbytes memory space to decode 48 Kbps stereo using real Korean S-DMB data.

• International Journal of Fluid Machinery and Systems
• /
• v.4 no.1
• /
• pp.14-24
• /
• 2011

In this paper, design optimization for mixed-flow pump impellers and diffusers has been studied using a commercial computational fluid dynamics (CFD) code and DOE (design of experiments). We also discussed how to improve the performance of the mixed-flow pump by designing the impeller and diffuser. Geometric design variables were defined by the vane plane development, which indicates the blade-angle distributions and length of the impeller and diffusers. The vane plane development was controlled using the blade-angle in a fixed meridional shape. First, the design optimization of the defined impeller geometric variables was achieved, and then the flow characteristics were analyzed in the point of incidence angle at the diffuser leading edge for the optimized impeller. Next, design optimizations of the defined diffuser shape variables were performed. The importance of the geometric design variables was analyzed using $2^k$ factorial designs, and the design optimization of the geometric variables was determined using the response surface method (RSM). The objective functions were defined as the total head and the total efficiency at the design flow rate. Based on the comparison of CFD results between the optimized pump and base design models, the reason for the performance improvement was discussed.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.2
• /
• pp.37-43
• /
• 2009

In this study, multi-channel digital hearing aid algorithm for low power system is proposed. First, MDCT(Modified Discrete Cosine Transform) method converts time domain of input speech signal into frequency domain of it. Output signal from MDCT makes a group about each channel, and then each channel signal adjusts a gain using LCF(Loudness Compensation Function) table depending on hearing loss of an auditory person. Finally, compensation signal is composed by TDAC and IMDCT. Its all of process make progress 16-bit fixed-point operation. We use fast-MDCT instead of MDCT for reducing system complexity and previously computed tables instead of log computation for estimating a gain. This algorithm evaluate through computer simulation.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.3
• /
• pp.553-568
• /
• 2022

In this paper, we introduce and study two different iterative hybrid projection algorithms for solving a fixed point problem of nonexpansive mappings. The first algorithm is generated by the combination of the inertial method and the hybrid projection method. On the other hand, the second algorithm is constructed by the convex combination of three updated vectors and the hybrid projection method. The strong convergence of the two proposed algorithms are proved under very mild assumptions on the scalar control. For illustrating the advantages of these two newly invented algorithms, we created some numerical results to compare various numerical performances of our algorithms with the algorithm proposed by Dong and Lu [11].

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.03a
• /
• pp.330-339
• /
• 2008

Ground-based interceptors(GBI) comprise a major element of the strategic defense against hostile targets like Intercontinental Ballistic Missiles(ICBM) and reentry vehicles(RV) dispersed from them. An optimum design of the subsystems is required to increase the performance and reliability of these GBI. Propulsion subsystem design and optimization is the motivation for this effort. This paper describes an effort in which an entire GBI missile system, including a multi-stage solid rocket booster, is considered simultaneously in a Genetic Algorithm(GA) performance optimization process. Single goal, constrained optimization is performed. For specified payload and miss distance, time of flight, the most important component in the optimization process is the booster, for its takeoff weight, time of flight, or a combination of the two. The GBI is assumed to be a multistage missile that uses target location data provided by two ground based RF radar sensors and two low earth orbit(LEO) IR sensors. 3Dimensional model is developed for a multistage target with a boost phase acceleration profile that depends on total mass, propellant mass and the specific impulse in the gravity field. The monostatic radar cross section (RCS) data of a three stage ICBM is used. For preliminary design, GBI is assumed to have a fixed initial position from the target launch point and zero launch delay. GBI carries the Kill Vehicle(KV) to an optimal position in space to allow it to complete the intercept. The objective is to design and optimize the propulsion system for the GBI that will fulfill mission requirements and objectives. The KV weight and volume requirements are specified in the problem definition before the optimization is computed. We have considered only continuous design variables, while considering discrete variables as input. Though the number of stages should also be one of the design variables, however, in this paper it is fixed as three. The elite solution from GA is passed on to(Sequential Quadratic Programming) SQP as near optimal guess. The SQP then performs local convergence to identify the minimum mass of the GBI. The performance of the three staged GBI is validated using a ballistic missile intercept scenario modeled in Matlab/SIMULINK.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.5
• /
• pp.869-885
• /
• 2021

In this article, we define Picard's three-step iteration process for the approximation of fixed points of Zamfirescu operators in an arbitrary Banach space. We prove a convergence result for Zamfirescu operator using the proposed iteration process. Further, we prove that Picard's three-step iteration process is almost T-stable and converges faster than all the known and leading iteration processes. To support our results, we furnish an illustrative numerical example. Finally, we apply the proposed iteration process to approximate the solution of a mixed Volterra-Fredholm functional nonlinear integral equation.

• Industrial Engineering and Management Systems
• /
• v.12 no.3
• /
• pp.198-206
• /
• 2013

The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by $T_{max}$ that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score $S_i$. The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time $t_{ij}$ needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.