• 디지털산업정보학회논문지
• /
• 제10권1호
• /
• pp.113-120
• /
• 2014

In this paper, I present a new echo canceller using the adaptive cascade system identification (CSI) method, which a system response is divided into several responses so that each response is adaptively estimated and combined. Echo cancellation is required for a dual-duplex DSL, in order to allow each individual loop to operate in a full duplex fashion. Echo cancellation was one of the most difficult aspects of DSL design, requiring high linearity and total echo return loss in excess of 70 dB. Especially, for a fickle response, if the response is estimated by an adaptive filter, the filter needs more taps and the performance is decreased. But the response is divided into several responses, the computation complexities are decreased and the performance is increased. For the stage constant n, which represents the number of stages, if the response is not divided (n=1), the computation complexity of multiply is $2N^2$. And if the response is divided into two responses (n=2), the computation complexity of multiply is $2N^2$. Also, if n=3, the computation complexity is ${\frac{2}{3}}N^2$. Therefore, it is known that the computation complexity is decreased as n is increased. Finally, this proposed method is verified through simulation of echo canceller for digital subscriber line (DSL) application.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2282-2303
• /
• 2021

To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

• ETRI Journal
• /
• 제38권4호
• /
• pp.695-702
• /
• 2016

A hierarchical approach for fast bi-dimensional empirical mode decomposition (B-EMD) is proposed. The presented approach utilizes an efficient window size determination scheme that enables the multi-level computation of the order statistics filter (OSF). Our detailed experiments show that the proposed OSF computation approach allows a significantly faster computation of an EMD without degrading the decomposition accuracy.

• International Journal of Control, Automation, and Systems
• /
• 제1권1호
• /
• pp.127-133
• /
• 2003

This paper proposes a new numerical method to check the stability of a general class of time delay systems. The proposed method checks whether there are characteristic roots whose real values are nonnegative through two steps. Firstly, rectangular bounds of characteristic roots whose real values are nonnegative are computed. Secondly, the existence of roots inside the bounds are checked using the numerical computation of argument principles. An adaptive discretization is proposed for the numerical computation of argument principles.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(2)
• /
• pp.250-253
• /
• 2000

In this paper, we Implement a new arithmetic computation for MPEG audio data to overcome the limitations of real number processing in the fixed-point arithmetics, such as: overheads in processing time and power consumption. We aims at efficiently dealing with real numbers by extending the fixed-point arithmetic manipulation for floating-point numbers in MPEG audio data, and implementing the DSP libraries to support the manipulation and computation of real numbers with the fixed-point resources.

• 대한교통학회지
• /
• 제12권1호
• /
• pp.75-84
• /
• 1994

In this paper we address the issue of how an optimal sample size computation relates the level of precision required for travel demand estimations and transportation planning. We approach the problem by 1) deriving a theoretical solution, 2) developing a computational procedure (algorithm) to implement the theoretical solution, and 3) demonstrating a practical application. Ultimately, we construct a formal scheme of optimal sample size computation for use in travel data collection processe.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1994년도 하계학술대회 논문집 A
• /
• pp.532-534
• /
• 1994

In this paper, the program for the train operation from the train characteristics and motion equation is presented. By the decision of the operation condition, the computation system for train operation(CSTO) can be developed successively. As some applications, the computation examples of the rheostatic- and the inverter-train are demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.431-443
• /
• 2016

Secure multi-party computation (MPC) has been a research focus of cryptography in resent studies. However, hiding the topology of the network in secure computation is a rather novel goal. Inspired by a seminal paper [1], we proposed a topology-hiding broadcast protocol based on NTRUEncrypt and secret sharing. The topology is concealed as long as any part of the network is corrupted. And we also illustrated the merits of our protocol by performance and security analysis.

• Communications for Statistical Applications and Methods
• /
• 제23권1호
• /
• pp.21-32
• /
• 2016

We study asymptotic expansion formulae for numerical computation of Greeks (i.e. sensitivity) in finance. Our approach is based on the integration-by-parts formula of the Malliavin calculus. We propose asymptotic expansion of Greeks for a stochastic volatility model using the Greeks formula of the Black-Scholes model. A singular perturbation method is applied to derive asymptotic Greeks formulae. We also provide numerical simulation of our method and compare it to the Monte Carlo finite difference approach.

• 제어로봇시스템학회논문지
• /
• 제13권4호
• /
• pp.309-314
• /
• 2007

This paper presents an adaptive neural computation algorithm for multi-layered neural networks which are applied to identify the characteristic function of dynamic systems. The main feature of the proposed algorithm is that the initial learning rate for the employed neural network is assigned systematically, and also the assigned learning rate can be adjusted empirically for effective neural leaning. By employing the approach, enhanced modeling of dynamic systems is possible. The effectiveness of this approach is veri tied by simulations.