• ETRI Journal
• /
• v.19 no.3
• /
• pp.242-258
• /
• 1997

The Qualcomm code excited linear prediction (QCELP) speech coder was adopted to increase the capacity of the CDMA Mobile System (CMS). In this paper, we implemented the QCELP speech coding algorithm by using TMS320C50 fixed point DSP chip. Also the fixed point simulation was done with C language. The computation complexity of QCELP on TMS320C50 was 10k words and data memory was 4k words. In the normal call test on the CMS, where mobile to mobile call test was done in the bypass mode without double vocoding, mean opinion score for the speech quality was he Qualcomm code excited linear prediction (QCELP) speech quality was 3.11.

• Korean Journal of Mathematics
• /
• v.27 no.2
• /
• pp.297-327
• /
• 2019

In this paper, we introduce and study a general iterative algorithm to approximate a common solution of split generalized equilibrium problem, variational inequality problem and fixed point problem for a finite family of nonexpansive mappings in real Hilbert spaces. Further, we prove a strong convergence theorem for the sequences generated by the proposed iterative scheme. Finally, we derive some consequences from our main result. The results presented in this paper extended and unify many of the previously known results in this area.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.663-684
• /
• 2021

In this paper, we present some fixed point results for a general class of nonexpansive mappings in the framework of Banach space and also proposed a new iterative scheme for approximating the fixed point of this class of mappings in the frame work of uniformly convex Banach spaces. Furthermore, we establish some basic properties and convergence results for our new class of mappings in uniformly convex Banach spaces. Finally, we present an application to nonlinear integral equation and also, a numerical example to illustrate our main result and then display the efficiency of the proposed algorithm compared to different iterative algorithms in the literature with different choices of parameters and initial guesses. The results obtained in this paper improve, extend and unify some related results in the literature.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.149-167
• /
• 2022

In this paper, we propose a viscosity iterative algorithm for approximating a common solution of finite family of variational inequality problem and fixed point problem for finite family of multi-valued type-one demicontractive mappings in real Hilbert spaces. A strong convergence result of the aforementioned problems were proved and some consequences of our result was also displayed. In addition, we discuss an application of our main result to convex minimization problem. The result presented in this article complements and extends many recent results in literature.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2365-2371
• /
• 1998

Discrete cosine transform (DCT) has wide applications in speech and image coding. In this paper, we propose a novel fast dCT scheme with the property of reduced multiplication stages and the smaller number of additions and multiplications. This exploits the symmetry property of the DCT kernel to decompose the N-point dCT to N/2 point, and can be generally applied recursively to $2^{m}$-point. The proposed algorithm has a structure that most of multiplications tend to be performed at final stage, and this reduces propagation of truncation error which could occur in the fixed-point computation. Also the minimization of the multiplication stages further decreases the error.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1763-1766
• /
• 2003

Millimeter-wave networking is composed of narrow beam link. it is very substantial that beam connecting point to point is fixed in right direction. It is major requirement in the beam network to keep the beam in best direction. In this paper, We propose the method to find a best suited direction of the antenna's beam using the Genetic Algorithm (GA) in point-to-point link. Proposed method presume that each station knows his direction ${\theta}_1$ , ${\theta}_2$ at every step of GA, then it can be expected that GA is possible to search the ideal solution. Intensity of the received signal is evaluated by the multiplication of lengths to the point which the lobe meets with the horizontal line.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.1
• /
• pp.1-11
• /
• 2023

Deep-learning-based image segmentation is one of the most widely employed lane detection approaches, and it requires a post-process for extracting the key points on the lanes. A general approach for key-point extraction is using a fixed threshold defined by a user. However, finding the best threshold is a manual process requiring much effort, and the best one can differ depending on the target data set (or an image). We propose a novel key-point extraction algorithm that automatically adapts to the target image without any manual threshold setting. In our adaptive key-point extraction algorithm, we propose a line-level normalization method to distinguish the lane region from the background clearly. Then, we extract a representative key point for each lane at a line (row of an image) using a kernel density estimation. To check the benefits of our approach, we applied our method to two lane-detection data sets, including TuSimple and CULane. As a result, our method achieved up to 1.80%p and 17.27% better results than using a fixed threshold in the perspectives of accuracy and distance error between the ground truth key-point and the predicted point.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5C
• /
• pp.386-394
• /
• 2008

For digital holographic video system, it is important to generate digital hologram as fast as possible. This paper proposed a fixed-point method and fast generation method that can calculate the Fresnel hologram using operation of whole-coordinate recursive addition. To compute the digital hologram, 3D object is assumed to be a collection of depth-map point generated using a PC. Our algorithm can compute a phase on a hologram by recursive addition with fixed-point format at a high speed. When we operated this algorithm on a personal computer, we could maximally compute digital hologram about 70% faster than conventional method and about 30% faster than of [3]'s method.

• East Asian mathematical journal
• /
• v.36 no.5
• /
• pp.571-581
• /
• 2020

In this paper, an equilibrium problems involving a finite family of maximal monotone operators and inverse-strongly monotone operators are introduced and investigated. A strong convergence theorem of common solutions is obtained in Hilbert spaces.

• Kyungpook Mathematical Journal
• /
• v.59 no.3
• /
• pp.445-464
• /
• 2019

In this paper, we propose a new iterative algorithm generated by a finite family of accretive operators in a q-uniformly smooth Banach space. We prove the strong convergence of the proposed iterative algorithm. The results presented in this paper are interesting extensions and improvements of known results of Qin et al. [Fixed Point Theory Appl. 2014(2014): 166], Kim and Xu [Nonlinear Anal. 61(2005), 51-60] and Benavides et al. [Math. Nachr. 248(2003), 62-71].