• ETRI Journal
• /
• v.43 no.6
• /
• pp.978-990
• /
• 2021

This article presents techniques for improved estimation of symbol timing offset (STO) and carrier frequency offset (CFO) for dual-polarization (DP) orthogonal frequency division multiplex (DP-OFDM) systems. Recently, quaternion multiple-input multiple-output OFDM has been proposed for high spectral efficiency communication systems, which can flexibly explore different types of diversities such as space, time, frequency, and polarization. This article focuses on synchronization techniques for DP-OFDM systems using a cyclic prefix, where the application of quaternion algebra leads to new improved estimators. Simulations performed for DP system methods show faster reduction of STO estimator variance with a double-slope line in the logvariance line versus signal-to-noise ratio (SNR) plot compared with singlepolarization (SP) counterparts, and simulations for CFO estimates show a 3-dB gain of DP over SP estimates for same SNR values defined, respectively, for quaternion-valued or complex-valued signals. Cramer-Rao bounds for STO and CFO are derived for the synchronization methods, correlating with the observed gains of DP over SP OFDM systems.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.1
• /
• pp.41-53
• /
• 2009

A primal-dual interior point method(IPM) not only is the most efficient method for a computational point of view but also has polynomial complexity. Most of polynomialtime interior point methods(IPMs) are based on the logarithmic barrier functions. Peng et al.([14, 15]) and Roos et al.([3]-[9]) proposed new variants of IPMs based on kernel functions which are called self-regular and eligible functions, respectively. In this paper we define a new kernel function and propose a new IPM based on this kernel function which has $O(n^{\frac{2}{3}}log\frac{n}{\epsilon})$ and $O(\sqrt{n}log\frac{n}{\epsilon})$ iteration bounds for large-update and small-update methods, respectively.

• Journal of Positioning, Navigation, and Timing
• /
• v.11 no.1
• /
• pp.35-44
• /
• 2022

In this paper, a dual foot (DF)-PDR system is proposed for the fusion of integration (IA)-based PDR systems independently applied on both shoes. The horizontal positions of the two shoes estimated from each PDR system are fused based on a particle filter. The proposed method bounds the position error even if the walking time increases without an additional sensor. The distribution of particles is a non-Gaussian distribution to express the lateral error due to systematic drift. Assuming that the shoe position is the pedestrian position, the multi-modal position distribution can be fused into one using the Gaussian sum. The fused pedestrian position is used as a measurement of each particle filter so that the position error is corrected. As a result, experimental results show that position of pedestrians can be effectively estimated by using only the inertial sensors attached to both shoes.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.127-133
• /
• 2012

We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.3
• /
• pp.189-202
• /
• 2009

In this paper we propose new primal-dual interior point algorithms for $P_*(\kappa)$ linear complementarity problems based on a new class of kernel functions which contains the kernel function in [8] as a special case. We show that the iteration bounds are $O((1+2\kappa)n^{\frac{9}{14}}\;log\;\frac{n{\mu}^0}{\epsilon}$) for large-update and $O((1+2\kappa)\sqrt{n}log\frac{n{\mu}^0}{\epsilon}$) for small-update methods, respectively. This iteration complexity for large-update methods improves the iteration complexity with a factor $n^{\frac{5}{14}}$ when compared with the method based on the classical logarithmic kernel function. For small-update, the iteration complexity is the best known bound for such methods.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.23 no.2
• /
• pp.27-32
• /
• 1986

This paper describes an application of the adaptive finite element computations to a free surface flow problem in a canal. A-posteriori error estimates for the adaptive finite element computations are based on the dual extremum principles. Previously the dual extremum principles were applied to compute the upper and lower bounds of the added mass of two-dimensional cylinders in a canal[1,2]. However, the present method improves the convergence of the computed results by utilizing the local error estimates and by applying the adaptive meshes in the finite element computations. In a test result using triangular elements it is shown that the numerical error in the adaptive finite elements reduces quadratically compared with that in a uniform mesh subdivision.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.625-634
• /
• 2014

This paper studies a dual-hop multiple-access relay network where two independent source nodes transmit information to a common destination node with the aid of multiple single-antenna amplify-and-forward relays. Each relay node is subject to an individual power constraint. We focus on the design of distributed beamforming schemes for the relays to support the transmission rate requirements of the two sources. To this end, we first characterize the achievable rate region for this network via solving a sequence of corner point optimization problems proposed in this paper. We also develop several low-complexity suboptimal schemes in closed form. Two inner bounds of the achievable rate region are theoretically shown to be approximately optimal in two special scenarios. Finally, numerical results demonstrate the effectiveness of our proposed approaches.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.7
• /
• pp.4918-4924
• /
• 2015

In this paper, we consider the capacity improvement of systems exploiting dual-polarized antennas for two-user transmission. To this end, we analyze the upper bounds of ergodic capacities for multicast and unicast data services in the systems, and propose the condition for adjusting the complex cross-polarization discriminations (XPDs) to maximize the ergodic capacities. In addition, we present the adjustment condition of the complex XPDs that can achieve spectral efficiencies close to the maximum ergodic capacities with lower system complexity. Lastly simulation results demonstrate that the systems using the proposed conditions can obtain higher spectral efficiencies than the ones employing different adjustment conditions including the exiting adjustment condition.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.45-52
• /
• 2015

We propose a hybrid prefix caching scheme to enable high speed IP address lookup. All prefixes loaded in a prefix cache should not be overlapped in address range for correct IP lookup. So, every non-leaf prefix needs to be expanded not so as to be overlapped. The shorter expanded prefix is more preferable because it can cover wider address range just as an single entry in a prefix cache. We exploits advantages of two dynamic prefix expansion techniques, bounded prefix expansion technique and bitmap-based prefix expansion technique. The proposed scheme uses dual bound values whereas just one bound value is used in bounded prefix expansion. Our elaborated technique make the dual bound values be associated with several subtries flexibly using bitmap information, rather than with fixed subtries. We evaluate the performance of the proposed scheme in terms of the average length of the expanded prefixes and cache miss ratio. The experiment results show the proposed scheme has lower cache miss ratio than other previous schemes including both bounded prefix expansion and bitmap-based expansion irrespective of the cache size.

• Management Science and Financial Engineering
• /
• v.14 no.2
• /
• pp.67-87
• /
• 2008

Data envelopment analysis (DEA) has proven to be a useful tool for assessing efficiency or productivity of organizations which is of vital practical importance in managerial decision making. While DEA assumes exact input and output data, the development of imprecise DEA (IDEA) broadens the scope of applications to efficiency evaluations involving imprecise information which implies various forms of ordinal and bounded data possibly or often occurring in practice. The primary purpose of this article is to characterize the variable efficiency in IDEA. Since DEA describes a pair of primal and dual models, also called envelopment and multiplier models, we can basically consider two IDEA models: One incorporates imprecise data into envelopment model and the other includes the same imprecise data in multiplier model. The issues of rising importance are thus the relationships between the two models and how to solve them. The groundwork we will make includes a duality study which makes it possible to characterize the efficiency solutions from the two models. This also relates to why we take into account the variable efficiency and its bounds in IDEA that some of the published IDEA studies have made. We also present computational aspects of the efficiency bounds and how to interpret the efficiency solutions.