• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.3
• /
• pp.96-105
• /
• 1992

The use of fixed-point digital signal processors, such as the TMS 320C25, requires scaling of data at each arithmetic step to prevent overflows while keeping the accuracy. A software which automatizes this process is developed for TMS 320C25. The programmers use a model of a hypothetical floating-point digital signal processor and a floating-point format for data representation. However, the program and data are automatically translated to a fixed-point version by this software. Thus, the execution speed is not sacrificed. A fixed-point variable has a unique binary-point location, which is dependent on the range of the variable. The range is estimated from the floating-point simulation. The number of shifts needed for arithmetic or data transfer step is determined by the binary-points of the variables associated with the operation. A fixed-point code generator is also developed by using the proposed automatic scaling software. This code generator produces floating-point assembly programs from the specifiations of FIR, IIR, and adaptive transversal filters, then floating-point programs are transformed to fixed-point versions by the automatic scaling software.

• Journal of Power Electronics
• /
• v.12 no.1
• /
• pp.164-171
• /
• 2012

Variable step size maximum power point trackers (MPPTs) are widely used in photovoltaic (PV) systems to extract the peak array power which depends on solar irradiation and array temperature. One essential factor which judges system dynamics and steady state performances is the scaling factor (N), which is used to update the controlling equation in the tracking algorithm to determine a new duty cycle. This paper proposes a novel stability study of variable step size incremental resistance maximum power point tracking (INR MPPT). The main contribution of this analysis appears when developing the overall small signal model of the PV system. Therefore, by using linear control theory, the boundary value of the scaling factor can be determined. The theoretical analysis and the design principle of the proposed stability analysis have been validated using MATLAB simulations, and experimentally using a fixed point digital signal processor (TMS320F2808).

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.3
• /
• pp.133-138
• /
• 2006

This paper presents an Optimal Power Flow (OPF) algorithm using Interior Point Method (IPM) to swiftly and precisely perform the five minute dispatch. This newly suggested methodology is based on Affine Scaling Interior Point Method which is favorable for large-scale problems involving many constraints. It is also eligible for OPF problems in order to improve the calculation speed and the preciseness of its resultant solutions. Big-M Method is also used to improve the solution stability. Finally, this paper provides relevant case studies to confirm the efficiency of the proposed methodology.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.6 no.4
• /
• pp.234-239
• /
• 2006

In the past decade, several tools have been developed to automate the floating-point to fixed-point conversion for DSP systems. In the conversion process, a number of scaling shifts are introduced, and they inevitably alter the original code sequence. Recently, we have observed that a compiler can often be adversely affected by this alteration, and consequently fails to generate efficient machine code for its target processor. In this paper, we present an optimization technique that safely migrates scaling shifts to other places within the code so that the compiler can produce better-quality code. We consider our technique to be safe in that it does not introduce new overflows, yet preserving the original SQNR. The experiments on a commercial fixed-point DSP processor exhibit that our technique is effective enough to achieve tangible improvement on code size and speed for a set of benchmarks.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.17 no.5
• /
• pp.423-430
• /
• 2012

An adaptive maximum power point tracking (MPPT) scheme employing a variable scaling factor is presented. A MPPT control loop was constructed analytically and the magnitude variation in the MPPT loop gain according to the operating point of the PV array was identified due to the nonlinear characteristics of the PV array output. To make the crossover frequency of the MPPT loop gain consistent, the variable scaling factor was determined using an approximate curve-fitted polynomial equation about linear expression of the error. Therefore, a desirable dynamic response and the stability of the MPPT scheme were maintained across the entire MPPT voltage range. The simulation and experimental results obtained from a 3 KW rated prototype demonstrated the effectiveness of the proposed MPPT scheme.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.25 no.1
• /
• pp.12-18
• /
• 2021

In this study, the performance modeling of MT30 gas turbine engine is performed. The design point is determined, and the component performance maps to which the scaling technique is applied are generated using standard maps provided by the commercial program. Off-design point performance analysis is performed with the generated performance model, and this is compared with the performance deck data of the engine. It is confirmed that the data of the performance maps generated by the one-point scaling method had some errors from the performance deck data, and it is determined that correction is necessary to increase the accuracy of the performance model. Therefore, the off-design point analysis is performed by creating the correction performance model in a manner that obtains the scaling factors for each operating point(off-design point) according to the high pressure spool speed.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.33-42
• /
• 1997

Fixed-point optimization utility software that can aid scaling and wordlength determination of digital signal processign algorithms written in C or C$\^$++/ language is developed. This utility consists of two programs: the range estimator and the fixed-point simulator. The former estimates the ranges of floating-point variables for automatic scaling purpose, and the latter translates floating-point programs into fixed-point equivalents for evaluating te fixed-point performance by simulation. By exploiting the operator overloading characteristics of C$\^$++/ language, the range estimation and the fixed-point simulation can be conducted just by modifying the variable declaration of the original program. This utility is easily applicable to nearly all types of digital signal processing programs including non-linear, time-varying, multi-rate, and multi-dimensional signal processing algorithms. In addition, this software can be used for comparing the fixed-point characteristics of different implementation architectures.

• Proceedings of the KIEE Conference
• /
• 2005.10c
• /
• pp.98-100
• /
• 2005

DSPs used at motor control are usually fixed point processor. They need scaling because they cannot excute floating point calculation. Scaling for floating point calculation makes the DSP's speed down, complex coding and etc. Therefore the IQ math is adopted. IQ math makes the fixed point processor possible to calculate the floating point math. In addition, IQ math can reduce memory usage and be more faster than that without IQ math. It seems that IQ math is appropriate in motor position control. In comparison of the position calculation between the IQ math, math function and the sine table, the method using IQ math is superior than other methods.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1221-1241
• /
• 2008

Most of domains people have studied are convex bounded projective (or affine) domains. Edith $Soci{\acute{e}}$-$M{\acute{e}}thou$ [15] characterized ellipsoid in ${\mathbb{R}}^n$ by studying projective automorphism of convex body. In this paper, we showed convex and bounded projective domains can be identified from local data of their boundary points using scaling technique developed by several mathematicians. It can be found that how the scaling technique combined with properties of projective transformations is used to do that for a projective domain given local data around singular boundary point. Furthermore, we identify even unbounded or non-convex projective domains from its local data about a boundary point.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.173-190
• /
• 2011

In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.