• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1197-1205
• /
• 2007

An adaptive K-best detection scheme is proposed for MIMO systems. The proposed scheme changes the number of survivor paths, K based on the degree of the reliability of Zero-Forcing (ZF) estimates at each K-best step. The critical drawback of the fixed K-best detection is that the correct path's metric may be temporarily larger than K minimum paths metrics due to imperfect interference cancellation by the incorrect ZF estimates. Based on the observation that there are insignificant differences among path metrics (ML distances) when the ZF estimates are incorrect, we use the ratio of the minimum ML distance to the second minimum as a reliability indicator for the ZF estimates. So, we adaptively select the value of K according to the ML distance ratio. It is shown that the proposed scheme achieves the significant improvement over the conventional fixed K-best scheme. The proposed scheme effectively achieves the performance of large K-best system while maintaining the overall average computation complexity much smaller than that of large K system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.618-627
• /
• 2010

In this paper, we propose an adaptive K-best algorithm in which the number K of candidates is changed according to the differences of level radii. We also compare the bit error performance and complexity of the proposed algorithm with those of several conventional K-best algorithms, where the complexity is defined as the total number of candidates of which partial Euclidean distances have to be calculated. The proposed algorithm adaptively decides K at each level by eliminating the symbols, whose differences of radii are larger than a threshold, from the set of candidates, and the maximum or average value of differences can be adopted as the threshold. The proposed decoding algorithm shows the better bit error performance and the lower complexity than a conventional K-best decoding algorithm with a constant K, and also has a similar bit error performance and the lower complexity than other adaptive K-best algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.1-7
• /
• 2006

Lattice decoding concept has been proposed for the implementation of the Maximum-Likelihood detection which is the optimal receiver from the viewpoint of the BER (Bit Error Rate) performance for MIMO (Multiple Input Multiple Output) systems. Sphere decoding algorithm and K-best decoding algorithm are based on the lattice decoding concept. A K-best decoding algorithm shows a good BER performance with relatively low complexity. However, with small K value, the error propagation effect severely degrades the performance. In this paper, we propose an adaptive K-best decoding algorithm which has lower average complexity and better BER performance than conventional K-best decoding algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.862-869
• /
• 2009

We propose a new adaptive K-best Sphere Decoding (SD) algorithm for Multiple Input Multiple Output (MIMO) systems where the number of survivor paths, K is changed based on the characteristics of path metrics which contain the instantaneous channel condition. In order to overcome a major drawback of Maximum Likelihood Detection (MLD) which exponentially increases the computational complexity with the number of transmit antennas, the conventional adaptive K-best SD algorithms which achieve near to MLD performance have been proposed. However, they still have redundant computation complexity since they only employ the channel fading gain as a channel condition indicator without instantaneous Signal to Noise Ratio (SNR) information. hi order to complement this drawback, the proposed algorithm use the characteristics of path metrics as a simple channel indicator. It is found that the ratio of the minimum path metric to the other path metrics reflects SNR information as well as channel fading gain. By adaptively changing K based on this ratio, the proposed algorithm more effectively reduce the computation complexity compared to the conventional K-best algorithms which achieve same performance.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.6
• /
• pp.669-681
• /
• 2006

In this work, a new method of design adaptive controllers for SISO systems based on multiple models and switching is presented. The controller selects the model from a given set, according to a switching rule based on output prediction errors. The goal is to design, at each sample instant, a predictive control law that ensures the robust stability of the closed-loop system and achieves the best performance for the current operating point. At each sample the proposed control scheme identifies a set of linear models that best characterizes the dynamics of the current operating region. Then, it carries out an automatic reconfiguration of the controller to achieve the best possible performance whilst providing a guarantee of robust closed-loop stability. The results are illustrated by simulations a nonlinear continuous and stirred tank reactor.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.693-695
• /
• 1997

This paper deals with the tracking control problem of robotic manipulators with unknown or changing dynamics. The torque input applied to the joint actuators is determined at every instance by the identification model that best approximates the robot dynamics. The best of the identified model is chosen by the proposed switching mechanism with fuzzy inference of the manipulator in an indirect adaptive controller architecture. Simulation results are also included to demonstrate the improvement in the tracking performance when the proposed method is used.

• Environmental Engineering Research
• /
• v.23 no.1
• /
• pp.107-113
• /
• 2018

Air quality and pollution have recently become a major concern; vehicle emissions significantly pollute the air, especially in large and crowded cities. There are various factors that affect vehicle emissions; this research aims to find the most influential factors affecting $CO_2$ and $NO_x$ emissions using Adaptive Neural Fuzzy Inference System (ANFIS) as well as a systematic approach. The modified ANFIS (MANFIS) was developed to enhance modelling and Root Mean Square Error was used to evaluate the model performance. The results show that percentages of $CO_2$ from trucks represent the best input combination to model. While for $NO_x$ modelling, the best pair combination is the vehicle delay and percentage of heavy trucks. However, the final MANFIS structure involves two inputs, three membership functions and nine rules. For $CO_2$ modelling the triangular membership function is the best, while for $NO_x$ the membership function is two-sided Gaussian.

• Structural Engineering and Mechanics
• /
• v.15 no.5
• /
• pp.579-608
• /
• 2003

This paper deals with adaptive finite element analysis of linearly elastic structures using different error estimators based on flux projection (or best guess stress values) and residual methods. Presentations are given on a typical h-type adaptive analysis, a mesh refinement scheme and the coupling of adaptive finite element analysis with automatic mesh generation. Details about different error estimators are provided and their performance, reliability and convergence are studied using six node quadratic triangular elements. Several examples are presented to demonstrate the reliability of different error estimators.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.7-12
• /
• 1993

This paper presents a generalized truncated least, squares adaptive algorithm and a two-stage design method. The proposed algorithm is directly derived from the normal equation of the generalized truncated least squares method (GTLSM). The special case of the GTLSM, the truncated least squares (TLS) adaptive algorithm, has a distinct features which includes the case of minimum steps estimator. This algorithm seemed to be best in the deterministic case. For real applications in the presence of disturbances, the GTLS adaptive algorithm is more effective. The two-stage design method proposed here combines the adaptive control system design with a conventional control design method and each can be treated independently. Using this method, the validity of the presented algorithms are examined by the simulation studies of an indirect adaptive control.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.3
• /
• pp.1146-1155
• /
• 2017

Normally, the artificial intelligence algorithms are widely applied to the optimal controller design. Then, it is expected that the best output performance is achieved. Unfortunately, when resulting controller parameters are implemented by using the practical devices, the output performance cannot be the best as expected. Therefore, the paper presents the optimal controller design using the combination between the state-space averaging model and the adaptive Tabu search algorithm with the new criteria as two penalty conditions to handle the mentioned problem. The buck-boost converter regulated by the cascade PI controllers is used as the example power system. The results show that the output performance is better than those from the conventional design method for both input and load variations. Moreover, it is confirmed that the reported controllers can be implemented using the realistic devices without the limitation and the stable operation is also guaranteed. The results are also validated by the simulation using the topology model of MATLAB and also experimentally verified by the testing rig.