• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.83-89
• /
• 2013

An adaptive blind equalization is a technique using to minimize the Inter-symbol Interference occurred on a communication channel in the transmission of the high speed digital data. In this paper, we propose a blind equalization more improving performance of the conventional MSAGF-MMA adaptive blind equalization algorithm by applying a multiple step size. This algorithm apply a LMS algorithm with a several step size according to each region divided by absolute values of decision-directed error to MSAGF-MMA. By computer simulation, it is confirmed that the proposed algorithm has a performance highly enhanced in terms of a convergence speed, a residual ISI and a residual error and an ensemble averaged MSE in a steady status compared with MMA and MSAGF-MMA.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.131-137
• /
• 2015

This paper relates with the VSS-MMA (Variable Step Size-Multiple Modulus Algorithm) adaptive equalization algorithm which is possible to improving the equalization performance by use the nonlinear fuction of error signal in the MMA adaptive equalization algorithm that are used for the minimization of the intersymbol interference due to the distortion which occurs in the time dispersive channel for the transmission of QAM signal in the system.. In the conventional MMA, we obtains the tap coefficient of adaptive equalizer using the fixed step size, but in the VSS-MMA, we obtains the tap coefficient of adaptive equalizer using the variable step size based on a nonlinear function of error signal. By adapting the variable step size, it was confirmed that the improved equalization performance were obtained by computer simulation. For this, the equalizer output signal constellation, residual isi, maximum distortion, MSE and SER were used in the performace index.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.83-88
• /
• 2017

This paper related with the performance evaluation of H-MMA (Hybrid-MMA) which is applying the adaptive modulus and adaptive step size concept to MMA adaptive equalization algorithm in order to reduce the intersymbol interference that is occurred in communication channel for digital code transmission. In the conventional MMA adaptive equalizer, the coefficient is updated by using the equalizer output and possible to compensation of amplitude and phase in 2nd dimensional QAM signal, the equalization performance were degraded due to fixed modulus and step size. For the overcomming the abovemensioned problem, it is possible to improving the equalization performance in the 2nd dimensional QAM signal by applying the adaptive modulus and adaptive step size propotional to equalizer output signal to the conventional MMA algorithm. The computer simulation was performed in the same channel for the compare the performance of MMA and proposed H-MMA which is proposed in this paper. As a result of simulation, the proposed H-MMA has slower convergence time in order to arriving the steady state than MMA. But after the steady state, H-MMA has more superior to the MMA in every performance index and the equalization noise was reduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.651-658
• /
• 2002

Although least mean square(LMS) algorithm is known to one of the most popular algorithm in adaptive signal processing because of the simplicity and the small computation, the choice of the step size reflects a tradeoff between the misadjustment and the speed of adaptation. In this paper, we present a new variable step size LMS algorithm, so-called ECLMS(Estimated correlation LMS), using the correlation between reference input and error signal of adaptive filter. The proposed algorithm updates each weight of filter by different step size at same sample time. We applied this algorithm to adaptive multiple-notch filter. Simulation results are presented to compare the performance of the proposed algorithm with the usual LMS algorithm and another variable step algorithm.

• Journal of Satellite, Information and Communications
• /
• v.11 no.1
• /
• pp.46-50
• /
• 2016

The adaptive power control of Code Division Multiple Access (CDMA) systems for communications between User Equipments (UEs) with a link-budget based Signal-to-Interference Ratio (SIR) estimate which has distance information is applied to three inner loop power control algorithms. The speed estimation performances of these algorithms with their consecutive Transmit-Power-Control (TPC) ratios are compared to each other, and it is concluded that the speed can be estimated using the TPC ratio information of Consecutive TPC Ratio Step-size Closed Loop Power Control (CS-CLPC) and Fixed Step-size Power Control (FSPC).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.77-82
• /
• 2017

This paper related with the VSS_SE-MMA (Varying Step Size_Signed Error-MMA) which possible to improving the equalization performance that employing the varying adaptive step size based on the nonlinearities of error signal of SE-MMA (Signed Error-MMA), compensates the intersymbol interference by distortion occurs at the communication channel, in the transmitting the spectral efficient nonconstant modulus signal such as 16-QAM. The SE-MMA appeared to the reducing the computational arithematic operation using the polarity of error signal in the updating the tap coefficient of present MMA adaptive equalizer, but have a problem of equalization performance degradation. The VSS_SE-MMA improves the problem of such SE-MMA, using the varying step size consider the error signal in the update the adaptive equalizer tap coefficient, and its improved performance were confirmed by simulation. For this, the output signal constellation of equalizer, the residual isi and maximum distortion, MSE and SER were applied. As a result of computer simulation, it was confirmed that the VSS_SE-MMA algorithm has nearly same in convergence speed and has more good performance in every performance index at the steady state.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2005.09a
• /
• pp.193-197
• /
• 2005

This paper presents a method by which multiple holes of ultra small size can be punched simultaneously. Silicon wafers were used to fabricate punching die. Workpiece used in the present investigation were the rolled pure copper of $3{\mu}m$ in thickness and CP titanium of $1.5{\mu}m$ in thickness. The metal foils were punched with the dies and arrays of circular and rectangular holes were made. The diameter of holes ranges from $2-10{\mu}m$. The process set-up is similar to that of the flexible rubber pad forming or Guerin process. Arrays of holes were punched successfully in one step forming. The punched holes were examined in terms of their dimensions, surface qualities, and potential defect. The effects of the die hole dimension on ultra small size hole formation of the thin foil were discussed. The optimum process condition such as proper die shape and diameter-thickness ratio (d/t) were also discussed. The results in this paper show that the present method can be successfully applied to the fabrication of ultra small size hole array in a one step operation.

• Journal of Pharmaceutical Investigation
• /
• v.34 no.1
• /
• pp.1-14
• /
• 2004

A promising approach to the development of a new single-step vaccine, which would eliminate the requirement for multiple injections, involves the encapsulation of antigens into microspheres. Biodegradable poly(lactide-co-glycolide) (PLGA) microspheres gave us a bright insight for controling antigen release in a pulsatile fashion, thereby mimicking two or tree boosting injections. However, in spite of the above merits, the level of immunization induced by a single-shot vaccination is often lower tan two doses of alum-adsorbed antigen. Therefore, optima modification of the microsphere is essential for the development of single-step vaccines. In the review, we discuss the stability of antigen in microsphere, safety and non-toxic in human and encapsulation technology. Also, we attempted to outline relevant physicochemical properties on the immunogenicity of microsphere vaccine and attainment of pulsatile release pater by combination of different microsphere, as well as to analyze immunological data associated with antigen delivery by microsphere. Although a lot of variables are related to the optimized microsphere formulation, we could conclude that judicious choice of proper polymer type, adjustment of particles size, and appropriate immunization protocol along with a suitable adjuvant might be a crucial factor for the generation of long-lasting immune response from a single-step vaccine formulation employing PLGA microsphere.

• KEPCO Journal on Electric Power and Energy
• /
• v.8 no.2
• /
• pp.159-179
• /
• 2022

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1231-1238
• /
• 2005

This paper presents a new fast encoding algorithm for image vector quantization that incorporates the partial distances of multiple features with a multidimensional look-up table (LUT). Although the methods which were proposed earlier use the multiple features, they handles the multiple features step by step in terms of searching order and calculating process. On the other hand, the proposed algorithm utilizes these features simultaneously with the LUT. This paper completely describes how to build the LUT with considering the boundary effect for feasible memory cost and how to terminate the current search by utilizing partial distances of the LUT Simulation results confirm the effectiveness of the proposed algorithm. When the codebook size is 256, the computational complexity of the proposed algorithm can be reduced by up to the $70\%$ of the operations required by the recently proposed alternatives such as the ordered Hadamard transform partial distance search (OHTPDS), the modified $L_2-norm$ pyramid ($M-L_2NP$), etc. With feasible preprocessing time and memory cost, the proposed algorithm reduces the computational complexity to below the $2.2\%$ of those required for the exhaustive full search (EFS) algorithm while preserving the same encoding quality as that of the EFS algorithm.