• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2349-2354
• /
• 1996

Convergence analysis on Godard's quartic (GQ) algorithm used forblind equalization is accomplished in this paper. The first main result is an explanation of the lacal behavior of the GQ algorithm around the global minimum point of the average performance functio, from which we can determine the adaptation gain. It is show that the normalized adaptation gain of the GQ algorithm should be smaller than that of the decision directed (DD) algorithm. In addition, it is observed that the GQ algorithm converges faster than the DD equalization algorithm.

• Proceedings of the KIEE Conference
• /
• 1996.07a
• /
• pp.458-460
• /
• 1996

In this study, the full-state flux observer is designed in the synchronous DQ-frame and the speed adaptation rule is derived by using the MRAS(Model Reference Adaptive System) theory. In this rule, the induction motor becomes a reference model and the flux observer is taken as a adjustable model. A guideline of the adaptation gain is investigated for the precise and stable speed adaptation and the proposed scheme is compared with the conventional one designed in the stationary DQ-frame.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.8
• /
• pp.1167-1177
• /
• 1989

In this paper, a generalized adaptive law is proposed which uses a rational function type operator for parameter adjustment. To satisfy the passivity condition of the adaptation block, we introduce a constant feedback gain into the adaptation block. This adaptation scheme is applied to the model reference adaptive control of a continuous-time, linear time-invariant, minimum-phase system whose relative degree is 1. We prove the asymptotic stability of the output error of this adaptive system by hyperstability method. It is shown that by digital computer simulations this law can give a better output error transient response in some cases than the conventional gradient adaptive law. And the output error responses for the several types of the proposed adaptation law are examined in the presence of a kind of unmodeled dynamics.

• MALSORI
• /
• no.58
• /
• pp.83-99
• /
• 2006

One key factor that hinders the widespread deployment of speaker identification technologies is the requirement of long enrollment utterances to guarantee low error rate during identification. To gain user acceptance of speaker identification technologies, adaptation algorithms that can enroll speakers with short utterances are highly essential. To this end, this paper applies MLLR speaker adaptation for speaker enrollment and compares its performance against other speaker modeling techniques: GMMs and HMM. Also, to speed up the computational procedure of identification, we apply speaker clustering method which uses principal component analysis (PCA) and weighted Euclidean distance as distance measurement. Experimental results show that MLLR adapted modeling method is most effective for short enrollment utterances and that the GMMs performs better when long utterances are available.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.1
• /
• pp.96-100
• /
• 2015

Adaptive background gain calibration loop for multi-lane serial links is proposed. In order to detect and cancel gain mismatches between lanes, a single digital loop using a ${\sum}{\Delta}$ ADC is employed, which provides a real-time adaptation of gain variations and is shared among all lanes to reduce power and area. Evaluation result showed that gain mismatches between lanes were well calibrated and tracked, resulting in timing budget at $10^{-6}$ BER increased from 0.261 UI to 0.363 UI with stable loop convergence.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.118-127
• /
• 2007

We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to-end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay-to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end-to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.

• Proceedings of the IEEK Conference
• /
• 2002.06e
• /
• pp.39-42
• /
• 2002

A new adaptive PRML architecture, considered not only DVD-ROM but also DVD-Multi including DVD-RAM as well, is presented to demonstrate its superiority over the conventional analog channel in a DVD system. For this new architecture, channel adaptation algorithm using gain controlled type of FIR filter, and asymmetry compensation algorithm using expected level adaptation of viterbi decoder are presented. In addition, a method of modelling the disk tilt and asymmetrical read-back signal are discussed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1610-1617
• /
• 1988

In this paper, a robust discrete-time adaptive control with compensation is proposed for single-input single-output discrete-time plants which have unmodeled dynamics. The stability of the overall system is studied using the conic sector stability theorems when a normalized constant gain parameter adaptation algorithm and a properly chosen compensation are used. An illustrative exmple shows that this compensation can also increase the parameter adaptation speed. And a method of compensation using the adaptive observation is also discussed.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.47-52
• /
• 2012

This paper focuses on discrete-time sliding mode control with SIIM fuzzy adaptive switching gain. The adaptive switching gain is calculated using the simplified indirect inference fuzzy logic. Two fuzzy inputs are the normal distance from the present state trajectory to the switching function and the distance from the present state trajectory to the equilibrium state. The fuzzy output $f_{out}$(k) out f k is used to adjust the speed the adaptation law depending on the location of the state trajectory. The simulation results showed that the proposed method had no chattering in case of uncertain parameter without disturbance. Moreover the convergent rate of the switching gain was faster and more stable even in case of disturbance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.7
• /
• pp.24-35
• /
• 2018

In wireless communications environments, a link adaptation technique that selects the proper rate from among several transmission rates is adopted to cope with variations in channel status. In block coded modulation, the frame time and/or the block length can be adjusted to the channel status. A smaller frame time can cause inter-frame interference (IFI), however, a larger frame time can reduce the data rate. Therefore, frame time is the design factor decided by a tradeoff between performance and the data rate. This paper presents a method to determine the frame time based on the processing gain for the channel model, CM1~CM4, recommended by IEEE 802.15a. Also, a link adaptation technique for block coded modulation is proposed for efficient communications by varying the frame time and the block length. Through simulation, link adaptation can be carried out with a step size of 2~5 nsec in a frame time range of 14~ 50 nsec for channel models CM1~CM4.