# Patent

## Title
Method and apparatus for estimating induction motor rotor temperature

## Abstract

A method and apparatus to provide continuous and reliable rotor temperature estimates for line-connected induction motors during steady-state and/or dynamic motor operations. Rotor temperature is calculated from voltage and current measurements without any temperature or speed sensors. First, complex space vectors are synthesized from voltage and current measurements. Second, the instantaneous rotor speed is detected by calculating the rotational speed of a single rotor slot harmonic component with respect to the rotational speed of the fundamental frequency component. Third, the positive sequence fundamental frequency components are extracted from complex space vectors. Fourth, the rotor time constant is estimated in a model-reference adaptive system based on a dynamic induction motor equivalent circuit model. Finally, the rotor temperature is calculated according to the linear relationship between the rotor temperature and the estimated rotor time constant. Real-time induction motor thermal protection is achieved through this continuous tracking of the rotor temperature.

## Background
CROSS-REFERENCE TO RELATED APPLICATION
This application claims the benefit of U.S. Provisional Application Ser. No. 61/053,941, filed May 16, 2008, entitled “Methods and Apparatuses for Estimating Transient Slip, Rotor Slots, Motor Parameters, and Induction Motor Temperature.”


FIELD OF THE INVENTION
The present disclosure relates generally to the estimation of rotor temperatures in induction motors without using actual temperature or speed sensors. More particularly, this disclosure relates to the continuous estimation of the rotor temperature from measurements of voltage and current, for motors operated at steady-state and/or dynamic conditions.
BACKGROUND
The accumulation of excessive heat on the rotor of an induction motor can cause severe thermal stress to the rotor structure, resulting in rotor conductor burnout or even total motor failure. Consequently, an accurate and reliable real-time tracking of the rotor temperature is needed to provide an adequate warning of imminent rotor over-heating. Furthermore, many line-connected induction motors are characterized by totally enclosed frames, as well as, small air gaps to increase their efficiencies. Therefore, the stator and rotor temperatures are highly correlated due to such motor designs, and the rotor temperature can often be used as an indicator of the stator winding temperature. For these motors, the continuous monitoring of the rotor temperature also provides a way to properly protect the motors against stator winding insulation deterioration due to over-heating. Thus, rotor temperature estimation is considered an integral part of induction motor condition monitoring, diagnosis, and protection.
There are typically four major approaches to obtaining the rotor temperature in an induction motor. The first approach makes direct measurements of rotor temperatures by way of temperature sensors, such as thermocouples, temperature-sensitive stick-ons, temperature-sensitive paint, and/or infrared cameras. These methods of measurement typically involve expensive instruments and dedicated wiring from the motors back to a motor control center. Therefore, this approach adds operating cost to line-connected induction motors.
The second approach utilizes a thermal model-based temperature estimator to calculate the rotor temperature. A lumped-parameter thermal circuit, typically with a single thermal capacitor and a single thermal resistor, is often used to emulate the thermal characteristic of a motor. For a class of motors with the same rating, the thermal capacitance and resistance are often pre-determined by plant operators or electrical installation engineers based on a set of known parameters, such as full load current, service factor, and trip class. Consequently, such thermal models cannot respond to changes in the motors' cooling capability, such as a broken cooling fan or a clogged motor casing. Therefore, this approach is incapable of giving an accurate estimate of the rotor temperature tailored to a specific motor's cooling capability.
The third approach typically applies to inverter-fed induction motors. By injecting high frequency signals into a motor, a magnetic field is created inside the motor. The electrical response waveforms are recorded, and the value of the rotor resistance or the rotor time constant is extracted. The rotor temperature information is then derived from the extracted rotor resistance and/or rotor time constant value. However, this approach requires an injection circuit and is usually impractical for line-connected induction motors.
The fourth approach derives the rotor temperature from the rotor resistance and/or the rotor time constant, based on the induction motor equivalent circuit. This technique requires the knowledge of rotor speed. This speed information is usually obtained from a mechanical speed sensor attached to the shaft of a line-connected motor. Because of the cost and fragile nature of such a speed sensor, and because of the difficulty of installing the sensor in many motor applications, speed-sensorless schemes based on induction motor magnetic saliency have been preferred. By sampling a single-phase current at steady-state motor operation, the rotor speed information is extracted from spectral estimation techniques such as fast Fourier transform. This speed information is then used in conjunction with the induction motor equivalent circuit to produce an estimate of the rotor resistance and subsequently the rotor temperature. However, accurate rotor temperature cannot be reliably obtained during dynamic motor operations, where motors are connected to time-varying loads such as reciprocating compressors or pumps. In addition, because most spectral estimation techniques require that the whole sequence of current samples, acquired at steady-state motor operation, be available for batch processing, such techniques can cause significant delay between the data acquisition and the final output of the temperature estimates.
What is needed is a cost-effective induction motor condition monitoring, diagnosis, and protection system with a highly accurate and reliable rotor temperature estimator that relies on measurements of voltage and/or current. What is also needed is an induction motor condition monitoring, diagnosis, and protection system with the ability to continuously track the rotor temperature during steady-state and/or dynamic motor operations. It is further needed to interleave the data acquisition process with the rotor temperature estimation process such that: (1) a set of voltage and current samples is acquired, (2) the corresponding rotor temperature is estimated, and (3) the estimation is completed before the next set of voltage and current samples is available.
SUMMARY OF THE INVENTION
According to some aspects, a method and apparatus for estimating rotor temperature in induction motors are provided. The estimations are based on voltage and current measurements readily available at motor control centers or at motor terminals. Continuous tracking of the rotor temperature is provided during steady-state and/or dynamic motor operations. No additional sensors or injection circuits are needed. The method can be divided into five major components.
First, a complex voltage space vector is synthesized from voltage measurements. A complex current space vector is synthesized from current measurements. The voltage measurements can be either phase-to-neutral or line-to-line, and the current can be measured either from two phases or from all three phases.
Second, an instantaneous rotor speed is detected by calculating the rotational speed of a single rotor slot harmonic component, which is extracted from the complex current space vector, with respect to the rotational speed of a fundamental frequency component, which is extracted from the complex voltage space vector. This rotor speed measurement/estimation eliminates the need for a speed measurement from a tachometer, which adds cost and bulk to the motor.
Third, a positive sequence fundamental frequency voltage component is obtained from the complex voltage space vector. A positive sequence fundamental frequency current component is obtained from the complex current space vector. A computationally efficient discrete-time filtering technique can be used.
Fourth, a rotor time constant can be estimated through the use a model-reference adaptive system (“MRAS”). The MRAS is based on a dynamic induction motor equivalent circuit model. The MRAS adjusts the rotor time constant so that a flux-related vector from the rotor circuit equation is aligned with another flux-related vector from the stator circuit equation.
Fifth, a rotor temperature is calculated according to an inverse relationship between the rotor temperature and the rotor time constant. This relationship is derived from a linear relationship between the rotor temperature and rotor resistance.
The foregoing and additional aspects and embodiments of the present invention will be apparent to those of ordinary skill in the art in view of the detailed description of various embodiments and/or aspects, which is made with reference to the drawings, a brief description of which is provided next.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram illustrating an architecture of a method and apparatus for estimating an induction motor rotor temperature;
FIG. 2A is a block diagram of a complex voltage space vector synthesis for use in the architecture of FIG. 1;
FIG. 2B is a block diagram showing a complex current space vector synthesis for use in the architecture of FIG. 1;
FIG. 3A is a chart exemplifying a stator current harmonic spectrum computed from a complex current space vector for a 20-hp 4-pole induction motor with 40 rotor slots according to some aspects;
FIG. 3B is a chart exemplifying a stator current harmonic spectrum computed from a complex current space vector for a 7.5-hp 4-pole induction motor with 44 rotor slots according to some aspects;
FIG. 3C is a chart exemplifying a stator current harmonic spectrum computed from a complex current space vector for a 2-hp 6-pole induction motor with 33 rotor slots according to some aspects;
FIG. 4A is a block diagram illustrating methods of extracting a fundamental frequency from a complex voltage space vector according to some aspects;
FIG. 4B is a block diagram illustrating methods of extracting a rotor slot harmonic frequency from a complex current space vector according to some aspects;
FIG. 5 is a block diagram illustrating methods of estimating an instantaneous rotor speed according to some aspects;
FIG. 6 is a chart exemplifying results of an instantaneous rotor speed detected from voltage and current measurements for a 20-hp 4-pole induction motor with 40 rotor slots during a dynamic motor operation with random load oscillation according to some aspects;
FIG. 7A is a block diagram illustrating methods of extracting a positive sequence fundamental frequency voltage component from a complex voltage space vector according to some aspects;
FIG. 7B is a block diagram illustrating methods of extracting a positive sequence fundamental frequency current component from a complex current space vector according to some aspects;
FIG. 8 is a schematic of a dynamic induction motor equivalent circuit model that characterizes the motor's stator and rotor circuit equations;
FIG. 9 is a block diagram illustrating methods of estimating a rotor time constant according to some aspects;
FIG. 10 is a block diagram illustrating methods of calculating a rotor temperature according to some aspects;
FIG. 11A is a chart exemplifying a dynamic motor operation for a 20-hp 4-pole induction motor with 40 rotor slots according to some aspects;
FIG. 11B is a chart exemplifying an estimated rotor temperature and measured stator winding temperatures for a 20-hp 4-pole induction motor with 40 rotor slots during the dynamic motor operation in FIG. 11A;
FIG. 12 is a block diagram showing an architecture of a method and apparatus for estimating induction motor electrical parameters without speed sensors according to some aspects of the present concepts;
FIG. 13 is a schematic showing a dynamic induction motor equivalent circuit model that characterizes the motor's stator and rotor circuit equations according to some aspects;
FIG. 14 is a block diagram illustrating methods of determining various quantities used for estimating induction motor electrical parameters according to some aspects;
FIG. 15 is a flow chart in a unified modeling language (UML) defining a matrix condition and pseudo-inverse solution according to some aspects;
FIG. 16 is a flow diagram of methods for performing an efficient recursive method for estimating induction motor electrical parameters; and
FIG. 17 is a block diagram illustrating a method and apparatus for estimating induction motor electrical parameters, as well rotor temperature, according to some aspects of the present concepts.



DETAILED DESCRIPTION OF THE INVENTION
Although the invention will be described in connection with certain aspects and/or embodiments, it will be understood that the invention is not limited to those particular aspects and/or embodiments. On the contrary, the invention is intended to cover all alternatives, modifications, and equivalent arrangements as may be included within the spirit and scope of the invention as defined by the appended claims.
Referring to FIG. 1, an architecture (100) for estimating rotor temperature in an induction motor 106 is illustrated according to some aspects of the present concepts. The architecture (100) includes a complex voltage space vector synthesis (108), a complex current space vector synthesis (110), a rotor speed estimation (120), a positive sequence fundamental frequency voltage component extraction (112), a positive sequence fundamental frequency current component extraction (118), a rotor time constant estimation (122), and a rotor temperature calculation (124).
Complex Space Vector Synthesis 108, 110
According to some aspects, voltage measurements (102) and current measurements (104) can be acquired in the form of samples from phase a, b and c at a sampling frequency fs for a line-connected induction motor (e.g., an induction motor 106) having a floating neutral point. The complex space vector, vC or iC, synthesized from voltage measurements (102) or current measurements (104), is a sequence of complex numbers carrying frequency information between −fs/2 and fs/2. The positive half of the complex space vector frequency spectrum corresponds to the positive sequence components at various frequencies, while the negative half corresponds to the negative sequence components at various frequencies.
Complex Voltage Space Vector Synthesis
FIG. 2A illustrates a block diagram of the complex voltage space vector synthesis (108) of FIG. 1. The complex voltage space vector, vC,n, (218) is calculated from the voltage measurements (102) by Equation 1,

vC,n=2⁄3·(vao,n+α·vbo,n+α2·vco,n)  Equation 1

where α=ej2π/3; vao, vbo, vco are the voltage difference between phase a, b and c and an arbitrary voltage reference point o selected by a measurement device, respectively; the subscript n denotes the nth instant (or sample) in a discrete-time system.

When phase-to-neutral voltage measurements are not available and only the line-to-line voltage measurements (208) are available, vC,n (218) can also be calculated from the line-to-line voltage measurements (210, 212, 214) using Equation 2,

vC,n=2⁄3·(vab,n−α2·vbc,n), when vab and vbc are available;

vC,n=2⁄3·(−vca,n+α·vbc,n), when vbc and vca are available;

vC,n=2⁄3·(−α·vab,n+α2·vca,n),when vca and vab are available  Equation 2

where vab is the voltage difference between phase a and phase b, vbc is the voltage difference between phase b and phase c, vca is the voltage difference between phase c and phase a.

Complex Current Space Vector Synthesis

FIG. 2B illustrates a block diagram of the complex current space vector synthesis (110). The complex current space vector, iC,n, (238) is calculated from the current measurements (104) and Equation 3,

iC,n=2⁄3·(ia,n+α·ib,n+α2·ic,n)  Equation 3

where ia, ib, ic are phase a, b and c current measurements, respectively.

When three phase measurements are not available and only current measurements from two phases are available, iC,n (238) can also be calculated from such current measurements. Specifically, depending on which two phase measurements (228) are available, Equation 4 specifies three alternatives (230, 232, and 234) for determining iC,n.

iC,n=2⁄3·[(2+α)·ia,n+(1+2α)·ib,n], when ia and ib are available;

iC,n=2⁄3·[(−1+α)·ib,n+(−2−α)·ic,n], when ib and ic are available;

iC,n=2⁄3·[(1−α)·ia,n+(−1−2α)·ic,n], when ic and ia are available;  Equation 4

Instantaneous Rotor Speed Detection

According to some aspects of the present disclosure, instantaneous rotor speed detection can include 3 subsystems: 1) fundamental frequency extraction (114) from the complex voltage space vector (218); 2) rotor slot harmonic frequency extraction (116) from the complex current space vector (238); and 3) rotor speed estimation (120). While the present disclosure illustrates examples relating to a particular instantaneous rotor speed detection scheme, other schemes are contemplated. For example, U.S. Provisional Application Ser. No. 61/053,941, filed May 16, 2008, entitled “Methods and Apparatuses for Estimating Transient Slip, Rotor Slots, Motor Parameters, and Induction Motor Temperature,” which is incorporated by reference herein, provides additional examples of schemes that can be used in place of the scheme described herein for detecting the instantaneous rotor speed. Alternately, rotor speed can be determined conventionally via a speed sensing device coupled to a rotor of the induction motor 106.
Fundamental Frequency Extraction
For most motors (e.g., induction motor 106) connected directly to regulated power distribution networks, the motor's instantaneous fundamental frequency, f0,n, typically varies within a small range around the rated fundamental frequency f0. Because of this varying frequency, an accurate estimate of a particular motor's instantaneous rotor speed requires a reliable estimate of the instantaneous fundamental frequency.
For example, FIG. 4A illustrates a block diagram of the fundamental frequency extraction block 114 of FIG. 1, according to some aspects. A voltage controlled oscillator (“VCO”) 406 generates a complex exponential signal xn in the demodulation and mixes the positive sequence fundamental frequency component in the complex voltage space vector down to a complex baseband. A generalized linear-phase low-pass filter 410 produces a complex baseband signal zn from a mixed complex voltage signal, yn. A numerical differentiation block 412 extracts the discrete-time derivative of the phase from the complex baseband signal. The instantaneous fundamental frequency (414) can be calculated from the discrete-time derivative of the phase.
Voltage Controlled Oscillator
The VCO 406 reduces the complexity of the filter architecture in a subsequent stage. The VCO takes the rated fundamental frequency, f0, (404) as its input and synthesizes the complex exponential signal, xn, at sample n, as its output according to Equation 5:

xn=exp(j·2πn·f0/fs)  Equation 5

where j is the imaginary unit (e.g., j2=−1).

This synthesizing process is analogous to demodulating an FM signal. By multiplying the complex voltage space vector, vC,n, (218) with the complex conjugate (408) of the VCO 406 output, xn*, the positive sequence fundamental frequency voltage component is mixed down to the complex baseband, where yn is the mixed complex voltage signal defined in Equation 6.

yn=vC,n·xn*  Equation 6

Generalized Linear-Phase Low-Pass Filter

According to some aspects, the generalized linear-phase low-pass filter 410 takes the mixed complex voltage signal yn as its input and produces the complex baseband signal zn as its output. The generalized linear-phase low-pass filter 410 can provide linear phase response over a frequency band and suppress out-of-band interference from other sources. For example, if the complex baseband bandwidth is denoted as ωB, then signals between −ωB and ωB in yn, including the signal at zero frequency, are retained. Signals beyond this frequency band [−ωB ωB] are attenuated (e.g., filtered out). The generalized linear-phase low-pass filter 410 can preserve the shape of the mixed complex voltage signal, yn. Specifically, the generalized linear-phase low-pass filter 410 introduces the same amount of time shift to the signals with frequencies between −ωB and ωB Using a generalized linear-phase low-pass filter (e.g., 410) ensures that phase information in the mixed complex voltage signal, yn, is maintained without distortion. After filtering the mixed complex voltage signal, yn, the numerical differentiation block 412 is applied to the complex baseband signal, zn, to calculate the signal's angular rotational speed.
According to some aspects, discrete-time finite impulse response (FIR) filters can be used when implementing a generalized linear-phase low-pass filter (e.g., 410). Carefully designed infinite impulse response (IIR) Bessel filters can also be used with approximately linear phase within the [−ωB ωB] range. Compared with their FIR counterparts, the IIR filters usually offer similar performance with smaller memory depth.
Commonly used filter design techniques, such as a Kaiser window design technique, offer useful solutions when selecting appropriate generalized linear-phase low-pass filters (e.g., generalized linear-phase low-pass filter 410). The desired cutoff frequency of the generalized linear-phase low-pass filter depends on the complex baseband bandwidth, ωB. For most line-connected motors in regulated power distribution networks, the frequency difference between the instantaneous fundamental frequency and the rated fundamental frequency is usually less than 1 Hz. Therefore, the cutoff frequency of a generalized linear-phase low-pass filter 410 is often chosen to be a few Hertz for the purpose of fundamental frequency extraction.
In some aspects, a time shift can be introduced by the generalized linear-phase low-pass filter 410, which can cause a delay between the filter input and output. Because the thermal time constant of a typical motor ranges from several minutes to an hour, this filter delay, usually a few seconds at most, can be regarded as negligible in final rotor temperature calculation (e.g., 124).
The start-up transient caused by a zero initial state in the generalized linear-phase low-pass filter 410 can be addressed by (1) determining the filter's initial state in advance, and/or (2) discarding the output that corresponds to the start-up transient. This start-up transient is typically negligibly short as compared to the motor's thermal dynamics, thus, discarding the first few seconds of the filter's output does not adversely affect final rotor temperature estimation results.
Numerical Differentiation Block
If φ is the phase of the complex baseband signal, zn, produced by the generalized linear-phase low-pass filter (410), (e.g., φ=z), then the angular speed of the complex baseband signal, ω [electrical rad/s], is related to the continuous-time derivative of the phase φ via Equation 7.

ω=dφ/dt  Equation 7

Frequency deviation, δf, is defined as the difference between the instantaneous frequency and its prescribed nominal value. In the fundamental frequency extraction (114), this frequency deviation is related to the difference between the instantaneous fundamental frequency (414) and the rated fundamental frequency (404). The frequency deviation quantity is calculated from ω via Equation 8.

δf=ω/(2π)  Equation 8

In a discrete-time system, the numerical differentiation block (412) approximates the continuous-time derivative of the phase given in Equations 7 and 8. If the sampling interval is denoted as Ts (Ts=1/fs), three different formulas can be utilized to approximate the continuous-time derivative of the phase depending on the desired precision.
1) A forward difference formula provides:

δfn=(φn+1−φn)/(2π·Ts)=(zn+1−zn)/(2π·Ts)  Equation 9

where the approximation error in δfn is proportional to Ts. A backward difference formula can be used in place of the forward difference formula to compute δfn, which provides:

δfn=(φn−φn−1)/(2π·Ts)=(zn−zn−1)/(2π·Ts)  Equation 10

where the approximation error in δfn is proportional to Ts.

2) A three-point formulas provides:

δfn=(−3zn+4zn+1−zn+2)/(2π·2Ts)  Equation 11a

δfn=(−zn−1+zn+1)/(2π·2Ts)  Equation 11b

δfn=(zn−2−4zn−1+3zn)/(2π·2Ts)  Equation 11c

where the approximation error in δfn is proportional to Ts2. For a sequence of complex numbers, Equation 11a is used to compute δf for the first sample in this sequence, while Equation 11c is used to compute δf for the last sample. For the rest samples in this sequence, Equation 11b is used to compute δf.

3) A five-point formulas provides:

δfn=(−25zn+48zn+1−36zn+2+16zn+3−3zn+4)/(2π·12Ts)  Equation 12a

δfn=(zn−2−8zn−1+8zn+1−zn+2)/(2π·12Ts)  Equation 12b

δfn=(3zn−4−16zn−3+36zn−2−48zn−1+25zn)/(2π·12Ts)  Equation 12c

where the approximation error in δfn is proportional to Ts4. For a sequence of complex numbers, Equation 12a determines δf for the first two samples in this sequence, while Equation 12c determines δf for the last two samples. For the rest samples in the sequence, Equation 12b determines δf.

According to some aspects of the present concepts, a discrete-time differentiator can be used as an alternative to the numerical differentiation block (412) discussed above. Such a discrete-time differentiator is often designed from a linear-phase system using a Kaiser window.
Instantaneous Fundamental Frequency Calculation
The instantaneous fundamental frequency, f0,n [Hz] (414), can be calculated by summing up the frequency deviation, output from the numerical differentiation block (412) with the rated fundamental frequency (404), as provided in Equation 13.

f0,n=f0+δfn  Equation 13

Dominant Rotor Slot Harmonic Frequency Extraction

For a squirrel-cage induction motor, a finite number of rotor slots produce steps in a waveform of rotor magnetomotive forces (MMFs) when excited by a positive sequence flux wave at a rated fundamental frequency from the stator. These steps in the rotor MMF affect the waveform of an air gap flux. In addition, the large reluctance of the rotor slot conductors and flux saturation due to high field concentration at the rotor slot openings produce spatial variations in, for example, an induction motor's air gap permeance. Because the air gap permeance interacts with the MMF from both the stator and the rotor to produce air gap flux, variations in the air gap permeance manifest themselves in the air gap flux. Furthermore, because the air gap flux is linked to stator windings, the variations in the air gap flux are reflected in a stator current harmonic spectrum.
A dominant rotor slot harmonic typically has the largest amplitude among all rotor slot harmonic components in the stator current harmonic spectrum. The dominant rotor slot harmonic frequency is related to the rotor design parameters via the relationship shown in Table I below:







TABLE I







Relationship between the Dominant Rotor Slot


Harmonic Frequency and Rotor Design Parameters









Case
h = fsh/f0|slip=0
Condition





1
(kR/P − 1)
kR/P − 1 = 6m + 1


2
−(kR/P − 1)
kR/P − 1 = 6m − 1


3
NONE
kR/P − 1≠6m ± 1


4
(kR/P + 1)
kR/P + 1 = 6m + 1


5
−(kR/P + 1)
kR/P + 1 = 6m − 1


6
NONE
kR/P + 1≠6m ± 1









where fsh [Hz] is the dominant rotor slot harmonic frequency; k=1, 2, 3, . . . , indicates the rotor MMF distribution harmonic order; m=1, 2, 3, . . . , is a positive integer; P is the number of pole-pairs; R is the number of rotor slots.

For many motors, Table I provides guidelines on the relationship between the dominant rotor slot harmonic frequency and the rotor design parameters. For example, for a 20-hp 4-pole induction motor with R=40, the condition associated with Case 1 in Table I, kR/P−1=6m+1, is satisfied when k=1 and m=3. Therefore, the dominant rotor slot harmonic frequency lies at (kR/P−1)·f0=19·f0 when slip=0. FIG. 3A illustrates an exemplary stator current harmonic spectrum indicating that the motor's dominant rotor slot harmonic frequency (302) is 1113 Hz when the motor is connected to the power supply with a rated fundamental frequency of 60 Hz and operated at around rated load.
By way of another example, a 7.5-hp 4-pole induction motor with R=44 (e.g., the condition associated with Case 5 in Table I), where kR/P+1=6m−1, satisfies the condition when k=1 and m=4. Therefore, the dominant rotor slot harmonic frequency lies at −(kR/P+1)·f0=−23·f0 when slip=0. FIG. 3B illustrates an exemplary stator current harmonic spectrum indicating that the motor's dominant rotor slot harmonic frequency (314) is −1357 Hz when the motor is connected to a power supply with a rated fundamental frequency of 60 Hz and operated at around rated load.
By way of yet another example with a 2-hp 6-pole induction motor with R=33, (e.g., the condition associated with Case 5 in Table I), where kR/P+1=6m−1, the condition is satisfied when k=2 and m=4. Therefore, the dominant rotor slot harmonic frequency lies at −(kR/P+1)·f0=−23·f0 when slip=0. FIG. 3C illustrates an exemplary stator current harmonic spectrum indicating that the motor's dominant rotor slot harmonic frequency (324) is −1351 Hz when the motor is connected to a power supply with a rated fundamental frequency of 60 Hz and operated at around rated load.
FIG. 4B is a block diagram of the rotor slot harmonic frequency extraction (116) of FIG. 1. Similar to the fundamental frequency extraction (114) scheme described above, the rotor slot harmonic frequency extraction (116) scheme includes a VCO 426, a generalized linear-phase low-pass filter 430, a numerical differentiation block 432 and an instantaneous dominant rotor slot harmonic frequency calculation block 434.
Voltage Controlled Oscillator 426
In FIG. 4B, the Voltage Controlled Oscillator 426 takes a nominal dominant rotor slot harmonic frequency as its input and produces a complex exponential signal as its output. The nominal dominant rotor slot harmonic frequency, fsh, (424) can be determined from a motor (e.g., induction motor 106) nameplate data plus rotor design parameters. The rotor design parameters can often be obtained from either the motor manufacturers or certain electric motor energy and management databases, such as the software tools provided by the U.S. Department of Energy. According to other aspects, the dominant rotor slot harmonic frequency can be determined by applying spectral estimation techniques to the stator current harmonic spectrum. A first approach relies on the knowledge of an approximate slip, usually derived from a linear relationship between the slip and the input power. A second approach typically requires steady-state motor operation during data acquisition.
Once the nominal dominant rotor slot harmonic frequency (424) is determined, the VCO 426 takes this nominal frequency (424) as its input and synthesizes a complex exponential signal, xn, as its output, where xn is defined in Equation 14.

xn=exp(j·2πn·fsh/fs)  Equation 14

Multiplying the complex current space vector, iC,n, (238) with the complex conjugate (428) of the VCO 426 output, xn*, mixes the dominant rotor slot harmonic down to a complex baseband.

Generalized Linear-Phase Low-Pass Filter

A filter with nonlinear phase can distort the shape of a signal, even when the filter's frequency-response magnitude is constant. Thus, according to some aspects, the generalized linear-phase low-pass filter 430 is used in the rotor slot harmonic frequency extraction (116). This filter 430 has a structure similar to its counterpart (e.g., filter 410) used in the fundamental frequency extraction (114). However, the cutoff frequency of the filter 430 can be chosen so that the filter 430 can pass a range of dominant rotor slot harmonic frequencies that corresponds to 50-150% of the motor's rated input power. The motor's (e.g., induction motor 106) rated input power is usually calculated from motor nameplate data, and the corresponding rotor slot harmonic frequencies can be approximated according to a linear relationship between the input power and the slip. For example, U.S. Provisional Application Ser. No. 61/053,941, filed May 16, 2008, entitled “Methods and Apparatuses for Estimating Transient Slip, Rotor Slots, Motor Parameters, and Induction Motor Temperature,” which is incorporated by reference herein, provides examples for approximating the corresponding rotor slot harmonic frequencies. Thus, the generalized linear-phase low-pass filter 430 is designed along the same rules outlined above in reference to the generalized linear-phase low-pass filter 410 but with a different cutoff frequency.
Numerical Differentiation Block
The structure of the numerical differentiation block 432 used in the rotor slot harmonic frequency extraction (116) is identical to its counterpart (412) used in the fundamental frequency extraction (114).
Instantaneous Dominant Rotor Slot Harmonic Frequency Calculation
The instantaneous dominant rotor slot harmonic frequency, fsh,n [Hz], (434) is calculated by summing up frequency deviation and the nominal dominant rotor slot harmonic frequency (424) according to Equation 15.

fsh,n=fsh+δfn  Equation 15

Rotor Speed Estimation

FIG. 5 is a block diagram of the rotor speed estimation (120). The rotor speed, ωR [electrical rad/s], (520) can be calculated from the extracted instantaneous fundamental frequency (414) and the extracted instantaneous dominant rotor slot harmonic frequency (434) via Equation 16:

ωR,n=2πP·(±fsh,n−nw·f0,n)/(kR)  Equation 16

where ‘+’ sign (504) corresponds to Cases 1 and 4 in Table I, and ‘−’ sign (506) corresponds to Cases 2 and 5 in Table I. Furthermore, nw is the stator winding distribution harmonic order. Corresponding to Cases 1 and 2 in Table I, nw=−1 (514). Corresponding to Cases 4 and 5 in Table I, nw=+1 (516). For example, speed estimation for a motor with a stator current harmonic spectrum as illustrated in FIG. 3A, will use a ‘+’ sign (504) and nw=−1 (514) in Equation 16. For another example, rotor speed estimation for a motor with a stator current harmonic spectrum as illustrated in FIG. 3B or FIG. 3C, will use a ‘−’ sign (506) and nw=+1 (516) in Equation 16.

FIG. 6 is a chart 600 depicting an estimated instantaneous rotor speed (RPM) over time (604) from the voltage measurements (102) and current measurements (104) for a 20-hp 4-pole induction motor (e.g., induction motor 106) with 40 rotor slots, as outlined above. FIG. 6 compares the estimated instantaneous rotor speed with an instantaneous rotor speed detected from a speed sensing device, such as a tachometer mounted on the motor shaft to provide a voltage output that is proportional to the rotor speed. The tachometer output can be converted into rpm values and plotted over time (602), shown in FIG. 6, as a reference signal to compare and/or validate the rotor speed estimation (120) scheme outlined above.
While the instantaneous rotor speed, ωR,n, can be detected by applying the rotor slot harmonic frequency extraction (116) scheme to a dominant rotor slot harmonic described above, the present disclosure also contemplates other variations of determining the instantaneous rotor speed, ωR,n . For example, the instantaneous rotor speed, ωR,n, can also be detected by applying a slightly modified scheme to other non-dominant rotor slot harmonics (e.g., rotor slot harmonics 304 and 312 shown in FIGS. 3A and 3B). In these other schemes, a nominal rotor slot harmonic frequency (e.g., 304 and 312) that corresponds to the non-dominant rotor slot harmonic is inputted into a VCO, and the value of nw used in Equation 16 is an odd integer other than ±1.
Positive Sequence Fundamental Frequency Component Extraction
For the purpose of rotor time constant estimation (122), which occurs after the rotor speed estimation, the positive sequence fundamental frequency voltage and current components are typically extracted from the complex voltage and current space vectors, respectively.
Positive Sequence Fundamental Frequency Voltage Component Extraction
FIG. 7A is a block diagram of the positive sequence fundamental frequency voltage component extraction (112). It includes a VCO 706 and a discrete-time low-pass filter 702.
Voltage Controlled Oscillator
The VCO 706 used in the positive sequence fundamental frequency voltage component extraction (112) has a structure similar to the VCO 406. The complex conjugate (708) of the VCO output, xn*, is used in the demodulation to mix the positive sequence fundamental frequency voltage component in the complex voltage space vector (218) down to a complex baseband.
Low-Pass Filter
The low-pass filter 702 can be either a discrete-time FIR or a discrete-time IIR low-pass filter. The cutoff frequency of this low-pass filter 702 is usually chosen to accommodate the frequency deviation, allowed by power distribution network regulators, around the rated fundamental frequency f0 (404). To simplify the implementation, the generalized linear-phase low-pass filter 410 used in the fundamental frequency extraction (114) can also be used.
Multiplying the low-pass filter output, zn, with the VCO output, xn, according to Equation 17, provides the positive sequence fundamental frequency voltage component, vF,n, (704).

vF,n=zn·xn  Equation 17

Positive Sequence Fundamental Frequency Current Component Extraction

As shown in FIG. 7B, the positive sequence fundamental frequency current component extraction (118), of FIG. 1, has a structure that resembles the positive sequence fundamental frequency voltage component extraction (112). Similarly, the structure includes a rated fundamental frequency f0 (404) input, a VCO 726, a complex conjugate block (728), and a low-pass filter 712. The positive sequence fundamental frequency current component extraction (118) takes the complex current space vector, iC,n, (238) as an input, and produces the positive sequence fundamental frequency current component, iF,n, (714) as its output. In addition, the cutoff frequency of the low-pass filter 712 should be high enough to retain the variations in the load-dependent positive sequence fundamental frequency current component. For example, if a motor experiences a 5 Hz load oscillation when connected to, for example, a reciprocating compressor, then the low-pass filter cutoff frequency can be chosen to be a few Hertz higher than this load oscillation frequency to accommodate the load-dependent positive sequence fundamental frequency current component.
Rotor Time Constant Estimation
A rotor time constant (e.g., 924) can be estimated from a model-reference adaptive system, such as model-reference adaptive system 900 (“MRAS”) shown in FIG. 9. The MRAS 900 can be configured to adjust the rotor time constant (924) to align a flux-related vector calculated from a rotor circuit equation (930) with another flux-related vector calculated from a stator circuit equation (925).
Stator and Rotor Circuit Equations
FIG. 8 illustrates a dynamic induction motor equivalent circuit (e.g., 800) in a stationary reference frame.
According to FIG. 8, the stator circuit Equation 18 is:

pλF=(vF−RS·iF)−σLS·piF  Equation 18

where the operator p represents the continuous-time derivative operator d/dt; λF is a complex flux space vector; RS is stator resistance; σ is total leakage factor; LS is stator inductance.
According to FIG. 8, the rotor circuit Equation 19 is:

pλF=[(1−σ)LS/τR]·iF+(jωR−1/τR)·λF  Equation 19

where τR is the rotor time constant. It is defined as the ratio between rotor inductance, LR, and rotor resistance, RR, i.e., τR=LR/RR. Instantaneous rotor speed is ωR [rad/s]. The imaginary unit j rotates the complex quantities counter-clockwise by π/2.

The total leakage factor, σ, and the stator inductance, LS, can be obtained from either motor manufacturer or standard no load and locked rotor tests according to the IEEE Standard 112 entitled “Standard Test Procedure for Polyphase Induction Motors and Generators”. In case the information from neither channel is available, the inductances are estimated according to the method outlined in the section entitled “Induction Motor Electrical Parameter Estimation.”
High-Pass Filter
Incorrect initial values produce dc offset errors in the flux vectors when computed according to Equations 18 and 19. One or more high-pass filters (e.g., a high-pass filter 906) can be used in the MRAS 900 to remove such errors by filtering the outputs of both the stator and rotor circuit equations (925 and 930). Substituting the expression pλF with (p+ωc)γF, where ωc is the high-pass filter cutoff frequency, and γF is an auxiliary vector denoting the frequency contents in λF that are above the high-pass filter cutoff frequency, transforms the Equations 18 and 19 to Equations 20 and 21, respectively,

γFS=(vF−RS·iF)/(p+ωc)−σLS·piF/(p+ωc)  Equation 20

γFR=[(1−σ)LS/τR]·iF/(p+ωc)+(jωR−1/τR)·γFR/p  Equation 21

where the expression, γFS, is a flux-related vector calculated from the stator circuit equation (925) according to Equation 20; and the expression, γFR, is a flux-related vector calculated from the rotor circuit equation (930) according to Equation 21. High-pass filter (906) has a form of p/(p+ωc), and low-pass filters 904, 914 are in the form of 1/(p+ωc). Additionally, according to some aspects, both the high-pass filter and the low-pass filters have the same cutoff frequency.

Rotor Time Constant Adaptation

The MRAS 900 adapts the rotor time constant based on the magnitude of the cross product between γFS and γFR, as shown in Equation 22:

εF=γFS×γFR=real(γFS)·imag(γFR)−imag(γFS)·real(γFR)  Equation 22

where εF denotes the magnitude of the cross product; the symbol × denotes the cross product operation; real(·) denotes the real part of a complex quantity; and imag(·) denotes the imaginary part of a complex quantity. Rotor time constant adaptation (935) uses γFS from the stator circuit equation (925) as a reference vector and adjusts the rotor time constant, τR, so that εF approaches 0. This indicates that the flux-related vector, γFR, is aligned with the reference vector γFS. As shown in FIG. 9, a proportional-integral block is used in the rotor time constant adaptation (935) to correlate εF to γR using Equation 23:

τR=(Kp+Ki/s)·εF  Equation 23

where 1/s denotes an integrator (922).

The tuning of Kp (918) and Ki (920) values depends on knowledge of induction motor electrical parameters, as well as a motor's operating condition. According to some aspects, commonly used methods for tuning proportional-integral controllers in feedback control systems, such as the trial and error method or the Ziegler-Nichols method, provide a good starting point for fine-tuning. For most line-connected induction motor applications, small positive values of Kp (918) and Ki (920) suffice. Large positive values of Kp (918) and Ki (920) can decrease the rise time and increase the overshoot, but they can also introduce instability when tuned improperly.
According to some aspects of the present concepts, a positive value, typically between 0.1 and 1 second, is set as the initial value of τR before the adaptation (935) is started. Such a practice avoids the “division by zero” error arising from the implementation of 1/τR and the subsequent instability in MRAS operation.
For most line-connected induction motors, thermal behavior is characterized by a slow thermal process with a large thermal time constant. Therefore, when tuned according to the tuning methods discussed above, the response time of the MRAS 900 is much smaller than the motor's thermal time constant. As a result, the MRAS output is regarded as the real-time value of the rotor time constant (924).
Rotor Temperature Calculation
According to some aspects of the present disclosure, a rotor temperature calculation can be based on an inverse relationship between a rotor temperature and the estimated rotor time constant (924), determined in block (122) of FIG. 1. This relationship is derived from a linear relationship between the rotor temperature and a rotor resistance.
Although rotor resistance is a function of both rotor temperature and slip frequency, the slip frequency of a line-connected induction motor (e.g., induction motor 106) only varies within a small range during normal motor operation. In addition, deep rotor bars or double cage rotors are rarely used in such motors. Therefore, the skin effect of the rotor resistance is not pronounced. Given that the rotor resistance is either independent of the slip, or properly compensated for based on known slip-resistance characteristics, the change in the rotor resistance is caused primarily by the change in the rotor temperature.
Assuming at time n0, that the rotor resistance is RR,n0, and the corresponding rotor temperature is θR,n0 [° C.]; and at time n, the rotor resistance is RR,n, and the corresponding rotor temperature is θR,n, then the relationship between the rotor resistance and the rotor temperature can be defined as in Equation 24:

RR,n/RR,n0=(θR,n+k)/(θR,n0+k)  Equation 24

where k is a temperature coefficient related to the inferred temperature for zero resistance. According to some aspects, a temperature coefficient k is 234.5 for motors having 100% International Annealed Copper Standard conductivity copper. According to other aspects, a temperature coefficient k is 225 for motors having aluminum with a volume conductivity of 62%. It is contemplated that other suitable values of k are used for other motor materials.

The baseline rotor temperature, θR,n0, can be either specified by the user, or determined from the motor's ambient temperature, a motor's ambient temperature is often a known quantity. Because thermal processes are usually slow, according to some aspects, this ambient temperature is taken as the baseline rotor temperature, θR,n0, during the first several seconds after the motor is energized from a cold state. The baseline rotor time constant, τR,n0, can be obtained from any of the following method 1) user input; 2) τR,0 according to the method described in “Induction Motor Electrical Parameter Estimation” described below. 3) use the averaged rotor time constant produced by the rotor time constant estimation (122) during the first several seconds after the motor is energized and the rotor time constant estimation (122) produces stabilized outputs. This rotor time constant and temperature pair, (τR,n0, θR,n0), provides baseline information for the subsequent calculation of the rotor temperature at time n.
According to some aspects, a comparison of the rotor time constant, τR,n (924) at time n, which is obtained at the same motor load level, with the baseline rotor time constant, τR,n0, at time n0, yields the rotor temperature θR,n, at time n, which is defined in Equation 25.

θR,n=(θR,n0+k)·τR,n0/τR,n−k  Equation 25

For example, FIG. 10 illustrates a flowchart (1000) of a rotor temperature calculation. Assuming that the ambient temperature is used as the baseline rotor temperature θR,n0, and that τR,n0 is obtained using the third method outlined above. Each time a new rotor time constant value, τR,n, is calculated from current and voltage measurements along the lines outlined above, it is compared with the baseline value, τR,n0, and the corresponding new rotor temperature, θR,n, is computed using Equation 25 (1006).
FIG. 11A illustrates an exemplary chart 1100 of a dynamic motor's operation (i.e., power and speed) during an experiment using a 20-hp 4-pole induction motor with 40 rotor slots. During the experiment, a dc dynamometer can be used as a load. Additionally, a 5 Hz oscillation can be superimposed on the rated load of the motor to emulate, for example, a reciprocating compressor load. The amplitude of the oscillating load can be set to approximately 5% of the motor's rated load. After about 58 seconds, the oscillating load is disconnected and the motor continues to operate at the rated load until the end of the experiment. The upper plot of FIG. 11A illustrates the instantaneous input power over time (1102) calculated from the motor terminal voltage and current measurements (e.g., 102 and 104), and the lower plot illustrates the instantaneous rotor speed over time (1104), which is estimated from the voltage and current measurements (e.g., 102 and 104) as described above.
FIG. 11B depicts graphical results (1110) of calculating a rotor temperature. According to some aspects, the estimated rotor temperature for the tested a 20-hp 4-pole induction motor with 40 rotor slots is calculated in accordance with the present disclosure, and the calculated rotor temperature is plotted over time (1112). Additionally, rotor temperatures are measured from two J-type thermocouples that are instrumented in the stator windings, and the temperature readings from those thermocouples are also plotted over time (1114 and 1116) in the same figure for comparison purposes. As illustrated in FIG. 11B, the estimated rotor temperature (1112) converges to the temperatures measured by the two thermocouples after about 20 seconds of rotor time constant adaptation. Thus, the estimated rotor temperature outputted from, for example, rotor temperature calculation block (124) tracks the temperature measured by the two thermocouples continuously and accurately using the voltage and current measurements (e.g., 102 and 104) sampled from, for example, the induction motor 106 of FIG. 1.
Referring to FIG. 12, an architecture 1200 for estimating electrical parameters of an induction motor 106 is illustrated according to some aspects of the present disclosure. The architecture 1200 includes a complex voltage space vector synthesis block 108, a complex current space vector synthesis block 110, a rotor speed estimation block 120, a positive sequence fundamental frequency voltage component extraction block 112, a positive sequence fundamental frequency current component extraction block 118, and an induction motor electrical parameter estimation block 1204.
Induction Motor Electrical Parameter Estimation
According to some aspects, induction motor electrical parameters can be determined from the motor nameplate data, as well as voltage and current measurements (e.g., 102 and 104) acquired at motor control centers and/or at motor terminals. According to some aspects, an induction motor electrical parameter estimation algorithm can be formulated from a dynamic induction motor equivalent circuit model.
For example, FIG. 13 depicts a dynamic induction motor equivalent circuit model 1300 in a stationary reference frame. The complex stator flux linkage, λS, is related to the positive sequence fundamental frequency voltage component, vF, and the positive sequence fundamental frequency current component, iF, as defined in Equation 26:

pλS=vF−RS·iF  Equation 26

where p represents the continuous-time derivative operator d/dt; and RS is the stator resistance. The complex stator flux linkage, λS, is also related to the instantaneous rotor speed, ωR [rad/s], via:

pλS=σLS·piF+(LS/τR−jωR·σLS)·iF+(jωR−1/τR)·λS  Equation 27

where LS is the stator inductance; σ is the total leakage factor; τR is the rotor time constant. The rotor time constant is defined as the ratio between the rotor inductance, LR, and the rotor resistance, RR, i.e., τR=LR/RR. The imaginary unit j rotates the complex space vector counter-clockwise by π/2.

Stator Resistance

An estimate of stator resistance is conveniently produced based on the motor nameplate data. This estimate is calculated as a ratio of a nameplate voltage, v0, and a nameplate current, i0, scaled by a scalar constant, αR.




  
    
      
        
          
            R
            S
          
          =
          
            
              
                α
                R
              
              ·
              
                (
                
                  
                    v
                    0
                  
                  
                    i
                    0
                  
                
                )
              
            
            ⁢
            
              ❘
              
                
                  α
                  R
                
                =
                
                  
                    1.155
                    ⁢
                    
                      
                    
                    ⁢
                    e
                  
                  -
                  2
                
              
            
            ⁢
            Ω
          
        
        ⁢
        
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        28
      
    
  




where the nameplate voltage is typically a line-to-line root mean square rated voltage, and the nameplate current is typically a single phase root mean square rated current.

Induction Motor Electrical Parameters

The process of estimating induction motor electrical parameters is illustrated as a compound process, as two distinct and independent methods, each expressing relative strengths and advantages. A first method is an Efficient Recursive Method, described in the section below entitled Efficient Recursive Method. A second method is a Maximum Diversity Method, described in the section below entitled Maximum Diversity Method. The induction motor electrical parameters, LS,m, σm, and τR,0,m, determined by either the Efficient Recursive Method or the Maximum Diversity Method, are equally valid, and the selection of the specific method to employ is application dependent.
The Efficient Recursive Method supports the definition and evaluation of a source matrix and a source vector with a variable row dimension, with a recursive solution. The Maximum Diversity Method defines a source matrix and a source vector with fixed dimensions, opportunistically replacing rows when new information is available, to ensure that the condition of derived matrix, and the accuracy of the solution vector are optimized.
Induction Motor Equivalent Circuit Model Equations
The stator inductance, the total leakage factor and the rotor time constant are estimated according to the dynamic induction motor equivalent circuit 1300 shown in FIG. 13 by substituting Equation 26 to Equation 27, which yields Equation 29:

vF−RS·iF=σLS·piF+(LS/τR−jωR·σLS)·iF+(jωR−1/τR)λS  Equation 29

Rearranging equation 29 yields:

σLS·(piF−jωR·iF)=−(LS/τR)·iF+(1/τR)λS+[(vF−RS·iF)−jωR·λS]  Equation 30

Dividing both sides of Equation 30 by σLS and then taking the continuous-time derivative of both sides yield:

p2iF−jωR·(piF)=[LS/(σLSτR)]·(−piF)+[1/(σLSτR)]·(pλS)+[1/(σLS)]·[p(vF−RS·iF)−jωR·pλS]  Equation 31

where p2iF denotes the second-order continuous-time derivative of the positive sequence fundamental frequency current component (e.g., p2iF=d2(iF)/dt2). Equation 30 can be simplified by replacing pλS with (vF−RS·iF) according to Equation (27), which yields:

p2iF−jωR·(piF)=[LS/(σLSτR)]·(−piF)+[1/(σLSτR)]·(vF−RS·iF)+[1/(σLS)]·[p(vF−RS·iF)−jωR·(vF−RS·iF)]  Equation 32

Equation 32 can be written in a matrix form by defining the following quantities:

y=p2iF−jωR·(piF)  Equation 33

{right arrow over (u)}=[−piF, vF−RS·iF, p(vF−RS·iF)−jωR·(vF−RS·iF)]  Equation 34

{right arrow over (ξ)}=[LS/(σLSτR), 1/(σLSτR), 1/(σLS)]T  Equation 35

where the superscript T in Equation 35 denotes the matrix transpose. Note that it is not a complex conjugate transpose.

Consequently, Equation 32 can be transformed into matrix format as defined in Equation 36.

y={right arrow over (u)}·{right arrow over (ξ)}  Equation 36

Calculation of y and u

Given a sequence of samples of positive sequence fundamental frequency voltage and current components, it is desirable to use a numerical differentiation block to compute first-order continuous-time derivative of the positive sequence fundamental frequency voltage and current components, pvF and piF, respectively; as well as second-order continuous-time derivative of the positive sequence fundamental frequency current component, p2iF. The structure of the numerical differentiation block used here is described in the section entitled Numerical Differentiation Block. FIG. 14 shows the temporal alignment that needs to be carefully considered in the implementation.
Temporal Alignment
As shown in FIG. 14, two numerical differentiation blocks 1406, 1410 on the right are cascaded to compute second-order continuous-time derivative of the positive sequence fundamental frequency current component (e.g., p2iF). When Kaiser window-based discrete-time differentiators are used, the latency introduced by the differentiator must be compensated. The “Latency Compensation—Time Delay ΔnL” blocks 1404, 1408 in FIG. 14 ensure the temporal alignment among all signals for subsequent calculations. The time delay, ΔnL, is typically obtained by evaluating a differentiator's architecture during its design stage.
Least-Squares Solution
According to some aspects, for motor operation that covers more than one load level, one yi and one {right arrow over (u)}i can be formed for each load level. Consequently, a vector, {right arrow over (y)}, can be obtained for m load levels along with a matrix, {right arrow over (U)}, where {right arrow over (y)} is defined according to Equation 37 and {right arrow over (U)} is defined according to Equation 38.

{right arrow over (y)}=[y1, y2, . . . , yi, . . . , ym]T  Equation 37

{right arrow over (U)}=[{right arrow over (u)}1T, {right arrow over (u)}2T, . . . , {right arrow over (u)}iT, . . . , {right arrow over (u)}mT]T  Equation 38

Consequently, Equation 36 can be expanded for motor operation with m load levels according to Equation 39.

{right arrow over (y)}={right arrow over (U)}·{right arrow over (ξ)}  Equation 39

According to some aspects, {right arrow over (y)}m and {right arrow over (U)}m can be constructed by taking the real and/or imaginary part of components in {right arrow over (y)} and {right arrow over (U)} separately as defined in Equations 40a,b,c and 41a,b,c.

{right arrow over (y)}m=[real(y1), imag(y1), real(y2), imag(y2), . . . , real(yi), imag(yi), . . . , real(ym), imag(ym)]T  Equation 40a

{right arrow over (U)}m=[real({right arrow over (u)}1T), imag({right arrow over (u)}1T), real({right arrow over (u)}2T), imag({right arrow over (u)}2T), . . . , real({right arrow over (u)}iT), imag({right arrow over (u)}iT), . . . , real({right arrow over (u)}mT), imag({right arrow over (u)}mT)]T  Equation 41a

{right arrow over (y)}m=[real(y1), real(y2), . . . , real(yi), . . . , real(ym)]T  Equation 40b

{right arrow over (U)}m=[real({right arrow over (u)}1T), real({right arrow over (u)}2T), . . . , real({right arrow over (u)}iT), . . . , real({right arrow over (u)}mT)]T  Equation 41b

{right arrow over (y)}m=[imag(y1), imag(y2), . . . , imag(yi), . . . , imag({right arrow over (y)}m)]T  Equation 40c

{right arrow over (U)}m=[imag({right arrow over (u)}1T), imag({right arrow over (u)}2T), . . . , imag({right arrow over (u)}iT), . . . , imag({right arrow over (u)}mT)]T  Equation 41c

At least two distinct load levels are required if Equations 40a and 41a are used to construct {right arrow over (y)}m and {right arrow over (U)}m, (e.g., m≧2). In case either Equations 40b and 41b, or Equations 40c and 41c, are used to construct {right arrow over (y)}m and {right arrow over (U)}m, then at least three distinct load levels are required (e.g., m≧3).
A least-squares solution can be obtained from Equation 39 via a pseudo-inverse solution as defined in Equation 42.

{right arrow over (ξ)}m=({right arrow over (U)}mT{right arrow over (U)}m)−1·({right arrow over (U)}mT{right arrow over (y)}m)  Equation 42

Finally, based on the definitions of Equation 35, {right arrow over (ξ)}m(1)=LS/(σLSτR), {right arrow over (ξ)}m(2)=1/(σLSτR), {right arrow over (ξ)}m(3)=1/(σLS). Therefore, the stator inductance, the total leakage factor, and the rotor time constant can be estimated from the least-squares solution produced by Equation 42, where the stator inductance, Ls, is defined in Equation 43; the total leakage factor, σ, is defined in Equation 44; and the rotor time constant, τR, is defined in Equation 45.

LS,m={right arrow over (ξ)}m(1)/{right arrow over (ξ)}m(2)  Equation 43

σm={right arrow over (ξ)}m(2)/[{right arrow over (ξ)}m(1){right arrow over (ξ)}m(3)]  Equation 44

τR,0,m={right arrow over (ξ)}m(3)/{right arrow over (ξ)}m(2)  Equation 45

This τR,0,m can be the same as an initial rotor time constant, τR,0, outputted by the induction motor electrical parameter estimation block (1204).

As discussed above, the induction motor electrical parameter estimation given in Equations 43-45 relies on the least-squares solution of {right arrow over (ξ)}m in Equation 42. Thus, according to some aspects, matrix {right arrow over (U)}mT{right arrow over (U)}m is checked to not be singular before performing the matrix inverse, ({right arrow over (U)}mT{right arrow over (U)}m)−1. Instead of performing a conventional singular value decomposition for this purpose, readily available quantities can be used more efficiently, such as the complex input power, as indices to ensure a nonsingular {right arrow over (U)}mT{right arrow over (U)}m. The complex input power is defined in the “Initial Synthesis” section below.
Efficient Recursive Method
An efficient recursive method is described in this section as an efficient way to reduce the computation of the pseudo-inverse in Equation 42 each time a new set of qualified data becomes available, as shown in the flow chart of FIG. 16. Unlike the Maximum Diversity Method (e.g., 1500 in FIG. 15), which operates on the vector, {right arrow over (y)}, and the matrix, {right arrow over (U)}, whose number of rows is fixed, the Efficient Recursive Method has no such restrictions and can be applied to a vector, {right arrow over (y)}, and a matrix, {right arrow over (U)}, with a growing number of rows.
The efficient recursive method first determines if vector {right arrow over (y)}m and matrix {right arrow over (U)}m are empty (1604) (e.g., whether they contain any values). If vector {right arrow over (y)}m and matrix {right arrow over (U)}m are empty, then the appropriate {right arrow over (y)}m and {right arrow over (U)}m are automatically constructed (1608). It is possible to construct vector {right arrow over (y)}m and matrix {right arrow over (U)}m according to Equations 40b and 41b, where {right arrow over (U)}mT·{right arrow over (U)}m and {right arrow over (U)}mT·{right arrow over (y)}m are assumed to have been computed in accordance with a Least-Squares Solution obtained from Equation 42 (1612). If the vector {right arrow over (y)}m and the matrix {right arrow over (U)}m are not empty, then an intermediate index, sIN, can be defined based on the complex input power or a quantity derived from the complex input power. There are altogether m intermediate indices related to {right arrow over (y)}m and {right arrow over (U)}m, (e.g., sIN,k), where k is a discrete index (1≦k≦m), and each k corresponds to one distinct row in {right arrow over (y)}m and {right arrow over (U)}m.
Whenever a new set of voltage and current measurements (e.g., 102 and 104) becomes available, an intermediate index, sIN,NEW, can be computed for this new data set. This intermediate index can then be compared to the existing m intermediate indices associated with m rows of {right arrow over (y)}m and {right arrow over (U)}m, and m non-negative distances are calculated between sIN,NEW and sIN,k (1≦k≦m) according to:

ΔsIN,k=∥sIN,NEW−sIN,k∥, 1≦k≦m  Equation 46

where the ∥·∥ denotes either an absolute value or an Euclidean norm.

Taking a minimum value of m distances from Equation 46 yields:

dIN=min([ΔsIN,1, ΔsIN,2, . . . , ΔsIN,k, . . . , ΔsIN,m]T)  Equation 47

A diversity index, dIN, is computed for each new data set. This diversity index is subsequently compared to a threshold, predetermined from the motor nameplate data. If the diversity index exceeds the threshold, then the new data set is regarded as a qualified data set (1606). This comparison procedure ensures that the matrix {right arrow over (U)} will not become ill-conditioned when solving Equation 42.

Each time a qualified new data set is available, the corresponding y and {right arrow over (u)}, denoted by a new quantity {right arrow over (y)}m+1 and a new vector {right arrow over (u)}m+1, are appended to {right arrow over (y)}m and {right arrow over (U)}m respectively (1608):

{right arrow over (y)}m+1=[{right arrow over (y)}mT, real(ym+1)]T  Equation 48

{right arrow over (U)}m+1=[{right arrow over (U)}mT, real({right arrow over (u)}m+1T)]T  Equation 49

Consequently, the matrices in equation 42 are updated via:

{right arrow over (U)}m+1T·{right arrow over (U)}m+1=[{right arrow over (U)}mT,{right arrow over (u)}m+1T]·[{right arrow over (U)}mT,{right arrow over (u)}m+1T]T={right arrow over (U)}mT·{right arrow over (U)}m+{right arrow over (u)}m+1T·{right arrow over (u)}m+1  Equation 50

{right arrow over (U)}m+1T·{right arrow over (y)}m+1=[{right arrow over (U)}mT, {right arrow over (u)}m+1T]·[{right arrow over (y)}mT, ym+1]T={right arrow over (U)}mT·{right arrow over (y)}m+{right arrow over (u)}m+1T·ym+1  Equation 51

Once enough rows are accumulated (e.g., m≧3), (1610) the estimated electrical parameters become:

{right arrow over (ξ)}m+1=({right arrow over (U)}m+1T{right arrow over (U)}m+1)−1·({right arrow over (U)}m+1T{right arrow over (y)}m+1)=({right arrow over (U)}mT·{right arrow over (U)}m+{right arrow over (u)}m+1T·{right arrow over (u)}m+1)−1·({right arrow over (U)}mT·{right arrow over (y)}m+{right arrow over (u)}m+1T·ym+1)  Equation 52

Since the matrices {right arrow over (U)}mT·{right arrow over (U)}m and {right arrow over (U)}mT·{right arrow over (y)}m have previously been computed with m≧3, it is now only necessary to compute {right arrow over (u)}m+1T·{right arrow over (u)}m+1 and {right arrow over (u)}m+1T·ym+1 and subsequently to inverse a 3 by 3 matrix to solve for the least-squares solution of {right arrow over (ξ)}m+1 (1612). This procedure helps significantly reduce the computation time in the electrical parameter estimation each time a qualified new data set becomes available. By doing so, the induction motor electrical parameters computed from {right arrow over (ξ)}m+1, following the same manner as Equations 43-45, benefit from the knowledge brought by the qualified new quantity ym+1 and the qualified new vector {right arrow over (u)}m+1. After the vector {right arrow over (y)} and the matrix {right arrow over (U)} contain enough rows and sufficiently qualified (e.g., diverse) data sets to support the least-squares solution of {right arrow over (ξ)}, the induction motor electrical parameter estimation can be ceased (1614).
In case {right arrow over (y)}m and {right arrow over (U)}m are constructed according to either Equations 40a and 41a, or Equations 40c and 41c, comparably efficient equations (e.g., Equations 48-52) can be executed to produce estimation results. As shown in Equation 34, the structure of the vector {right arrow over (u)} and consequently the matrix {right arrow over (U)} makes {right arrow over (U)}mT{right arrow over (U)}m a well-conditioned matrix once the conditions described above are satisfied. Therefore, a robust and efficient estimate of induction motor electrical parameters can be obtained (e.g., Equations 43-45) based on the above description. A default transition to the terminus can be defined, and the stator inductance, the total leakage factor, and the rotor time constant are produced as the output (1616).
Maximum Diversity Method
The Maximum Diversity Method (1500) defines a source matrix and a source vector with fixed dimensions, opportunistically replacing rows when new information is available, to ensure that the condition of derived matrix, and the accuracy of the solution vector is optimized.
Control flow presents an alternative system view, where the nature of the relationships between entities and processes are defined in terms of order and conditions of operation, in FIG. 15.
The epoch of control flow transitions to the Initial Synthesis process (1502).
The Initial Synthesis process (1502) constructs the initial representations of the source matrix, the source vector, and the diversity set. The diversity set is employed as an indirect means to estimate the condition of a matrix derived from the source matrix, ensuring robust and accurate subsequent definition of a solution vector. Minimum distance and mean distance are calculated, with respect to members of the initial diversity set. The Initial Synthesis process (1502) initializes the relevant values precisely once. In subsequent invocations, the process performs no actions. The Initial Synthesis process (1502) transitions to the Candidate Diversity Sets process.
The Candidate Diversity Sets process (1504) iteratively synthesizes candidate diversity sets, or potential replacements to the existing diversity set, formed by substituting a new value for each member of the existing set. For each candidate diversity set, a minimum distance is evaluated, and the maximum minimum distance is compared to the minimum distance of the diversity set. If the maximum candidate minimum distance is greater than the minimum distance of the diversity set, of if the distances are equal and the candidate mean distance is greater than the mean distance of the diversity set, the source matrix, source vector, diversity set, minimum distance and mean distance associated with a selected candidate diversity set are modified, and the Candidate Diversity Set process transitions to the Matrix Condition process. If the diversity set remains unchanged, the Candidate Diversity Sets process transitions to itself at the next sequential increment of the synchronous temporal index.
The Matrix Condition process (1506) evaluates the condition of the matrix {right arrow over (U)}mT{right arrow over (U)}m by either direct or indirect means. An indirect means of evaluating the condition of the matrix is defined through a process of maximizing the minimum distance between any two members of a diversity set. The basis for the diversity set is selected such that the minimum distance, or diversity of the set, corresponds, positively or inversely, to the condition of the matrix {right arrow over (U)}mT{right arrow over (U)}m. The application of the diversity set is an economic means to evaluate the condition, which would otherwise be computationally prohibitive and impractical in many environments. If the condition number is below a specified threshold, in direct evaluation, or a minimum distance is above a specified threshold, in indirect evaluation, the Matrix Condition process transitions to the Pseudo-Inverse Solution process. If the condition is insufficient to support a solution, the Matrix Condition process transitions to the Candidate Diversity Sets process at the next sequential increment of the synchronous temporal index.
The Pseudo-Inverse Solution process (1508) applies the Moore-Penrose pseudo-inverse method to extract a solution vector from the source matrix and the source vector, facilitating the direct definition of stator inductance, total leakage factor, and initial rotor time constant from the solution vector. The Pseudo-Inverse Solution process (1508) transitions to the terminus of control flow.
It is possible, and recommended, that the process of solving the induction motor electrical parameters not be terminated after the first available solution is extracted, but rather iteratively refined through continued application of the techniques described in the Maximum Diversity Method process. As new information is extracted through passive observation of motor operation, the resulting solution vector will become more robust and accurate, and can be used with greater confidence. If computational complexity is a significant concern, the synchronous temporal index can be accessed with a greater than unity stride, effectively downsampling the basis for the diversity set, and reducing the bandwidth required by a linear factor equal to the inverse of the stride. This is generally a reasonable compromise, as potential basis values extracted from motor electrical signals, including complex input power and complex impedance, cannot change instantaneously and are generally quasi-stationary for periods which significantly exceed the sampling frequency.
A practical temporal stride value can be selected such that the effective sampling frequency is reduced to no less than two times the rated fundamental frequency. For example, in a system with a sampling frequency of 5 kHz, and a rated fundamental frequency equal to 60 Hz, a stride of less than or equal to 40 is recommended.
The source matrix {right arrow over (U)}m is composed of ND rows formed from independent observations of complex fundamental voltage, complex fundamental current and rotor speed signals. The complex fundamental voltage can be the same as the positive sequence fundamental frequency voltage component (e.g., 704). The complex fundamental current can be the same as the positive sequence fundamental frequency current component (e.g., 714). Asynchronous temporal index m is applied as a means to enumerate successive asynchronous estimates, or opportunistic updates. The row dimension, ND, must be greater than or equal to 3 to support the application of the Moore-Penrose pseudo-inverse method, based on the dimension of the solution vector, {right arrow over (ξ)}m. A practical dimension, ND, typically defines 10 or more observations.
The rows of the source matrix are independent, though not necessarily sufficiently diverse to support definition of a solution vector. If the rows of the source matrix are representative of too narrow a range of operating conditions, the square and potentially invertible matrix {right arrow over (U)}mT{right arrow over (U)}m can be ill-conditioned, or nearly singular. The matrix {right arrow over (U)}mT{right arrow over (U)}m must be sufficiently well-conditioned to support a solution.
The source matrix {right arrow over (U)}m and source vector {right arrow over (y)}m are defined and allowed to evolve opportunistically, with each observation of a diversity basis determined to increase diversity of the rows of {right arrow over (U)}m, and correspondingly decrease the condition number of the matrix {right arrow over (U)}mT{right arrow over (U)}m. When the matrix {right arrow over (U)}mT{right arrow over (U)}m is sufficiently well-conditioned, the solution vector is extracted. A single estimate of the solution vector can be sufficient, or the solution can be improved with subsequent iterations of the source matrix in an application-dependent manner.
Initial Synthesis
An initial matrix {right arrow over (U)}0 is formed by application of Equation 34 to ND sequential samples of complex fundamental voltage and complex fundamental current, in Equation 53.




  
    
      
        
          
            U
            ->
          
          0
        
        ⁢
        
          =
          REAL
        
        ⁢
        
           
          
            
              [
              
                
              
              ⁢
              
                
                  
                    
                      -
                      
                        pi
                        
                          F
                          ,
                          
                            n
                            -
                            
                              N
                              D
                            
                            +
                            1
                          
                        
                      
                    
                  
                  
                    
                      
                        
                      
                      ⁢
                      
                        
                          v
                          
                            F
                            ,
                            
                              n
                              -
                              
                                N
                                D
                              
                              +
                              1
                            
                          
                        
                        -
                        
                          
                            R
                            S
                          
                          ·
                          
                            i
                            
                              F
                              ,
                              
                                n
                                -
                                
                                  N
                                  D
                                
                                +
                                1
                              
                            
                          
                        
                      
                    
                  
                  
                    
                      
                        p
                        ⁡
                        
                          (
                          
                            
                              v
                              
                                F
                                ,
                                
                                  n
                                  -
                                  
                                    N
                                    D
                                  
                                  +
                                  1
                                
                              
                            
                            -
                            
                              
                                R
                                S
                              
                              ·
                              
                                i
                                
                                  F
                                  ,
                                  
                                    n
                                    -
                                    
                                      N
                                      D
                                    
                                    +
                                    1
                                  
                                
                              
                            
                          
                          )
                        
                      
                      -
                      
                        j
                        ·
                        
                          ω
                          
                            R
                            ,
                            
                              n
                              -
                              
                                N
                                D
                              
                              +
                              1
                            
                          
                        
                        ·
                        
                          (
                          
                            
                              v
                              
                                F
                                ,
                                
                                  n
                                  -
                                  
                                    N
                                    D
                                  
                                  +
                                  1
                                
                              
                            
                            -
                            
                              
                                R
                                S
                              
                              ·
                              
                                i
                                
                                  F
                                  ,
                                  
                                    n
                                    -
                                    
                                      N
                                      D
                                    
                                    +
                                    1
                                  
                                
                              
                            
                          
                          )
                        
                      
                    
                  
                
                
                  
                    
                      -
                      
                        pi
                        
                          F
                          ,
                          
                            n
                            -
                            
                              N
                              D
                            
                            +
                            2
                          
                        
                      
                    
                  
                  
                    
                      
                        v
                        
                          F
                          ,
                          
                            n
                            -
                            
                              N
                              D
                            
                            +
                            2
                          
                        
                      
                      -
                      
                        
                          R
                          S
                        
                        ·
                        
                          i
                          
                            F
                            ,
                            
                              n
                              -
                              
                                N
                                D
                              
                              +
                              2
                            
                          
                        
                      
                    
                  
                  
                    
                      
                        p
                        ⁡
                        
                          (
                          
                            
                              v
                              
                                F
                                ,
                                
                                  n
                                  -
                                  
                                    N
                                    D
                                  
                                  +
                                  2
                                
                              
                            
                            -
                            
                              
                                R
                                S
                              
                              ·
                              
                                i
                                
                                  F
                                  ,
                                  
                                    n
                                    -
                                    
                                      N
                                      D
                                    
                                    +
                                    2
                                  
                                
                              
                            
                          
                          )
                        
                      
                      -
                      
                        j
                        ·
                        
                          ω
                          
                            R
                            ,
                            
                              n
                              -
                              
                                N
                                D
                              
                              +
                              2
                            
                          
                        
                        ·
                        
                          (
                          
                            
                              v
                              
                                F
                                ,
                                
                                  n
                                  -
                                  
                                    N
                                    D
                                  
                                  +
                                  2
                                
                              
                            
                            -
                            
                              
                                R
                                S
                              
                              ·
                              
                                i
                                
                                  F
                                  ,
                                  
                                    n
                                    -
                                    
                                      N
                                      D
                                    
                                    +
                                    2
                                  
                                
                              
                            
                          
                          )
                        
                      
                    
                  
                
                
                  
                    
                      
                    
                  
                  
                    ⋮
                  
                  
                    
                      
                    
                  
                
                
                  
                    
                      -
                      
                        pi
                        
                          F
                          ,
                          n
                        
                      
                    
                  
                  
                    
                      
                        v
                        
                          F
                          ,
                          n
                        
                      
                      -
                      
                        
                          R
                          S
                        
                        ·
                        
                          i
                          
                            F
                            ,
                            n
                          
                        
                      
                    
                  
                  
                    
                      
                        p
                        ⁡
                        
                          (
                          
                            
                              v
                              
                                F
                                ,
                                n
                              
                            
                            -
                            
                              
                                R
                                S
                              
                              ·
                              
                                i
                                
                                  F
                                  ,
                                  n
                                
                              
                            
                          
                          )
                        
                      
                      -
                      
                        j
                        ·
                        
                          ω
                          
                            R
                            ,
                            n
                          
                        
                        ·
                        
                          (
                          
                            
                              v
                              
                                F
                                ,
                                n
                              
                            
                            -
                            
                              
                                R
                                S
                              
                              ·
                              
                                i
                                
                                  F
                                  ,
                                  n
                                
                              
                            
                          
                          )
                        
                      
                    
                  
                
              
              ]
            
            ⁢
            
              ❘
              
                
                  N
                  D
                
                ≥
                3
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        53
      
    
  




An initial source vector y0 is formed once by application of Equation 33 to ND sequential samples of complex fundamental current and rotor speed, in Equation 54.




  
    
      
        
          
            y
            ->
          
          0
        
        ⁢
        
          =
          REAL
        
        ⁢
        
          
            [
            
              
                
                  
                    
                      
                        p
                        2
                      
                      ⁢
                      
                        i
                        
                          F
                          ,
                          
                            n
                            -
                            
                              N
                              D
                            
                            +
                            1
                          
                        
                      
                    
                    -
                    
                      j
                      ·
                      
                        ω
                        
                          R
                          ,
                          
                            n
                            -
                            
                              N
                              D
                            
                            +
                            1
                          
                        
                      
                      ·
                      
                        pi
                        
                          F
                          ,
                          
                            n
                            -
                            
                              N
                              D
                            
                            +
                            1
                          
                        
                      
                    
                  
                
              
              
                
                  
                    
                      
                        p
                        2
                      
                      ⁢
                      
                        i
                        
                          F
                          ,
                          
                            n
                            -
                            
                              N
                              D
                            
                            +
                            2
                          
                        
                      
                    
                    -
                    
                      j
                      ·
                      
                        ω
                        
                          R
                          ,
                          
                            n
                            -
                            
                              N
                              D
                            
                            +
                            2
                          
                        
                      
                      ·
                      
                        pi
                        
                          F
                          ,
                          
                            n
                            -
                            
                              N
                              D
                            
                            +
                            2
                          
                        
                      
                    
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    
                      
                        p
                        2
                      
                      ⁢
                      
                        i
                        
                          F
                          ,
                          n
                        
                      
                    
                    -
                    
                      j
                      ·
                      
                        ω
                        
                          R
                          ,
                          n
                        
                      
                      ·
                      
                        pi
                        
                          F
                          ,
                          n
                        
                      
                    
                  
                
              
            
            ]
          
          ⁢
          
            ❘
            
              
                N
                D
              
              ≥
              3
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        54
      
    
  




Source matrix and source vector definitions correspond to real projections, as defined in Equation 41b and 40b. Imaginary projections, or interlaced real and imaginary projections are valid alternatives, as defined in Equation 41c, 40c and Equation 41a and 40a, respectively.
Complex input power, ρF,n, is defined in Equation 55,




  
    
      
        
          ρ
          
            F
            ,
            n
          
        
        =
        
          
            
              3
              0.5
            
            ·
            
              v
              
                F
                ,
                n
              
            
            ·
            
              i
              
                F
                ,
                n
              
              *
            
          
          
            2
            ·
            
              P
              F
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        55
      
    
  




where PF is a rated power factor from the motor nameplate data, and the superscript * denotes the complex conjugate of a complex number.

An initial diversity set, {right arrow over (D)}0, is formed once with ND sequential samples of complex input power at sample indices corresponding to row synthesis in the initial matrix {right arrow over (U)}0, in Equation 56:

{right arrow over (D)}0={ρF,n−ND+1ρF,n−ND+2 . . . ρF,n}|ND≧3  Equation 56

The diversity of the source matrix {right arrow over (U)}0 is indirectly specified in the diversity set, employing a basis of the complex input power as a matter of convenience. Complex input power, complex input impedance, and the real or imaginary projections of these signals can be used as an alternative basis to specify diversity.
The distance, δm,j,k, is an Euclidean distance between any two members of the diversity set, at independent indices j and k, in Equation 57:




  
    
      
        
          δ
          
            m
            ,
            j
            ,
            k
          
        
        =
        
          
            
            
              
                D
                
                  m
                  ,
                  j
                
              
              -
              
                D
                
                  m
                  ,
                  k
                
              
            
            
          
          ⁢
          
            ❘
            
              
                
                  j
                  ,
                  k
                
                
                  
                    j
                    ≠
                    k
                  
                  
                    N
                    ≥
                    3
                  
                
              
              ⁢
              
                
                  :
                
                ⁡
                
                  [
                  
                    0
                    ,
                    
                      
                        N
                        D
                      
                      -
                      1
                    
                  
                  ]
                
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        57
      
    
  




A minimum distance, dm, is the minimum Euclidian distance between all unique combination of members of the diversity set, {right arrow over (D)}m, in Equation 58:




  
    
      
        
          d
          m
        
        =
        
          
            
               
              MIN
            
            ⁢
            
              (
              
                δ
                
                  m
                  ,
                  j
                  ,
                  k
                
              
              )
            
          
          ⁢
          
            ❘
            
              
                
                  j
                  ,
                  k
                
                
                  
                    j
                    ≠
                    k
                  
                  
                    N
                    ≥
                    3
                  
                
              
              ⁢
              
                
                  :
                
                ⁡
                
                  [
                  
                    0
                    ,
                    
                      
                        N
                        D
                      
                      -
                      1
                    
                  
                  ]
                
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        58
      
    
  




The mean distance, d′m, is the mean Euclidean distance between each member pair of the diversity set {right arrow over (D)}m, in Equation 59:




  
    
      
        
          
            d
            _
          
          m
        
        =
        
          
            
              1
              
                
                  ∑
                  
                    c
                    =
                    1
                  
                  
                    
                      N
                      D
                    
                    -
                    1
                  
                
                ⁢
                c
              
            
            ·
            
              
                ∑
                
                  j
                  =
                  0
                
                
                  
                    N
                    D
                  
                  -
                  2
                
              
              ⁢
              
                
                  ∑
                  
                    k
                    =
                    
                      j
                      +
                      1
                    
                  
                  
                    
                      N
                      D
                    
                    -
                    1
                  
                
                ⁢
                
                  δ
                  
                    m
                    ,
                    j
                    ,
                    k
                  
                
              
            
          
          ⁢
          
            ❘
            
              
                N
                D
              
              ≥
              3
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        59
      
    
  




According to some aspects, an initial minimum distance, d0, and mean distance, d′0, are calculated once for the initial diversity set, {right arrow over (D)}0, and retained for comparison to values extracted from candidate diversity sets.
Candidate Diversity Sets
At each successive index, n, a sample of complex input power, or alternative diversity basis, can be evaluated to determine if it should replace an existing member of the diversity set. Alternatively, a temporal index stride greater than unity can be selected to conserve bandwidth, and it is generally not possible to have instantaneous changes in the basis for the diversity set. Candidate diversity sets, {right arrow over (D)}m,c, are synthesized by temporarily replacing an existing member at index c with the new sample, forming ND unique candidate diversity sets, in Equation 60:




  
    
      
        
          
            D
            ->
          
          
            m
            ,
            c
          
        
        =
        
          
            {
            
              
                
                  
                    D
                    ->
                  
                  m
                
                ⁢
                
                  :
                
                ⁢
                
                  D
                  
                    m
                    ,
                    j
                  
                
              
              =
              
                ρ
                
                  F
                  ,
                  n
                
              
            
            }
          
          ⁢
          
            ❘
            
              
                
                  c
                  ,
                  j
                
                
                  
                    c
                    =
                    j
                  
                  
                    
                      N
                      D
                    
                    ≥
                    3
                  
                
              
              ⁢
              
                
                  :
                
                ⁢
                
                  
                
                [
                
                  0
                  ,
                  
                    
                      N
                      D
                    
                    -
                    1
                  
                
                ]
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        60
      
    
  




The Candidate distance, δm,c,j,k, is computed for any two members of each candidate diversity set, {right arrow over (D)}m,c, at independent indices j and k, in Equation 61:




  
    
      
        
          δ
          
            m
            ,
            c
            ,
            j
            ,
            k
          
        
        =
        
          
            
            
              
                D
                
                  m
                  ,
                  c
                  ,
                  j
                
              
              -
              
                D
                
                  m
                  ,
                  c
                  ,
                  k
                
              
            
            
          
          ⁢
          
            ❘
            
              
                
                  c
                  ,
                  j
                  ,
                  k
                
                
                  
                    j
                    ≠
                    k
                  
                  
                    
                      N
                      D
                    
                    ≥
                    3
                  
                
              
              ⁢
              
                
                  :
                
                ⁢
                
                  
                
                [
                
                  0
                  ,
                  
                    
                      N
                      D
                    
                    -
                    1
                  
                
                ]
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        61
      
    
  




The Candidate minimum distance, dm,c, is the distance between the two most proximate members of a candidate diversity set, {right arrow over (D)}m,c, in Equation 62:




  
    
      
        
          d
          
            m
            ,
            c
          
        
        =
        
          
            
               
              MIN
            
            ⁢
            
              (
              
                δ
                
                  m
                  ,
                  c
                  ,
                  j
                  ,
                  k
                
              
              )
            
          
          ⁢
          
            ❘
            
              
                
                  c
                  ,
                  j
                  ,
                  k
                
                
                  
                    j
                    ≠
                    k
                  
                  
                    
                      N
                      D
                    
                    ≥
                    3
                  
                
              
              ⁢
              
                
                  :
                
                ⁢
                
                  
                
                [
                
                  0
                  ,
                  
                    
                      N
                      D
                    
                    -
                    1
                  
                
                ]
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        62
      
    
  




The maximum candidate minimum distance, dm,z, is identified at set index z in the ND candidate diversity sets, {right arrow over (D)}m,c, in Equation 63:




  
    
      
        
          d
          
            m
            ,
            z
          
        
        ⁢
        
          =
          MAX
        
        ⁢
        
          
            (
            
              d
              
                m
                ,
                c
              
            
            )
          
          ⁢
          
            |
            
              
                c
                ,
                
                  z
                  ⁢
                  
                    
                      :
                    
                    ⁢
                    
                      
                    
                    [
                    
                      0
                      ,
                      
                        
                          N
                          D
                        
                        -
                        1
                      
                    
                    ]
                  
                
              
              
                
                  N
                  D
                
                ≥
                3
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        63
      
    
  




In some aspects, if the maximum candidate minimum distance, dm,z, is greater than or equal to the existing minimum distance, dm, the mean candidate distance, d′m,z, is evaluated corresponding to the candidate diversity set, {right arrow over (D)}m,z, with set index z, in Equation 64:




  
    
      
        
          
            d
            _
          
          
            m
            ,
            z
          
        
        =
        
          
            
              (
              
                1
                
                  
                    ∑
                    
                      c
                      =
                      1
                    
                    
                      
                        N
                        D
                      
                      -
                      1
                    
                  
                  ⁢
                  c
                
              
              )
            
            ·
            
              
                ∑
                
                  j
                  =
                  0
                
                
                  
                    N
                    D
                  
                  -
                  2
                
              
              ⁢
              
                
                  ∑
                  
                    k
                    =
                    
                      j
                      +
                      1
                    
                  
                  
                    
                      N
                      D
                    
                    -
                    1
                  
                
                ⁢
                
                  δ
                  
                    m
                    ,
                    c
                    ,
                    j
                    ,
                    k
                  
                
              
            
          
          ⁢
          
            ❘
            
              
                
                  c
                  ,
                  z
                
                
                  
                    N
                    D
                  
                  ≥
                  3
                
              
              :
              
                
              
              ⁢
              
                [
                
                  0
                  ,
                  
                    
                      N
                      D
                    
                    -
                    1
                  
                
                ]
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        64
      
    
  




In some aspects, if the maximum candidate minimum distance, dm,z, is greater than the existing minimum distance, dm, or if the maximum candidate minimum distance is equal to the existing minimum distance and the candidate mean distance, d′m,z, is greater than the existing mean distance, d′m, it is implicit that the condition of the matrix {right arrow over (U)}mT{right arrow over (U)}m would be improved by updating the matrix {right arrow over (U)}m+1, by synthesizing a new vector to replace the existing row at index z, in Equation 65.




  
    
      
        
          
            U
            ->
          
          
            m
            +
            1
          
        
        =
        
          {
          
            
              
                
                  
                    
                      
                        U
                        ->
                      
                      m
                    
                    ⁢
                    
                      :
                    
                    ⁢
                    
                      
                        U
                        ->
                      
                      
                        m
                        ,
                        z
                      
                    
                  
                  =
                
              
            
            
              
                
                   
                  
                    
                      [
                      
                        
                          
                            
                              
                                
                                  -
                                  
                                    pi
                                    
                                      F
                                      ,
                                      n
                                    
                                  
                                
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  v
                                  
                                    F
                                    ,
                                    n
                                  
                                
                              
                              -
                              
                                
                                  R
                                  S
                                
                                ·
                              
                            
                          
                        
                        
                          
                            
                              
                                
                                  i
                                  
                                    F
                                    ,
                                    n
                                  
                                
                                ⁢
                                
                                  p
                                  ⁡
                                  
                                    (
                                    
                                      
                                        v
                                        
                                          F
                                          ,
                                          n
                                        
                                      
                                      -
                                      
                                        
                                          R
                                          S
                                        
                                        ·
                                        
                                          i
                                          
                                            F
                                            ,
                                            n
                                          
                                        
                                      
                                    
                                    )
                                  
                                
                              
                              -
                            
                          
                        
                        
                          
                            
                              j
                              ·
                              
                                ω
                                
                                  R
                                  ,
                                  n
                                
                              
                              ·
                              
                                (
                                
                                  
                                    v
                                    
                                      F
                                      ,
                                      n
                                    
                                  
                                  -
                                  
                                    
                                      R
                                      S
                                    
                                    ·
                                    
                                      i
                                      
                                        F
                                        ,
                                        n
                                      
                                    
                                  
                                
                                )
                              
                            
                          
                        
                      
                      ]
                    
                    ⁢
                    
                      ❘
                      
                        
                          
                            d
                            
                              m
                              ,
                              z
                            
                          
                          >
                          
                            d
                            m
                          
                        
                        
                          
                            
                              d
                              
                                m
                                ,
                                z
                              
                            
                            =
                            
                              d
                              m
                            
                          
                          ,
                          
                            
                              
                                d
                                _
                              
                              
                                m
                                ,
                                z
                              
                            
                            >
                            
                              
                                d
                                _
                              
                              m
                            
                          
                        
                      
                    
                  
                
              
            
          
          }
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        65
      
    
  




Source vector {right arrow over (y)}m+1 is equal to the previous vector, {right arrow over (y)}m, modified by synthesizing a new value to replace the existing row at index z, in Equation 66:




  
    
      
        
          
            y
            ->
          
          
            m
            +
            1
          
        
        =
        
          {
          
            
              
                
                  
                    
                      
                        
                          y
                          ->
                        
                        m
                      
                      ⁢
                      
                        :
                      
                      ⁢
                      
                        y
                        
                          m
                          ,
                          z
                        
                      
                    
                    =
                    
                      
                        
                          p
                          2
                        
                        ⁢
                        
                          i
                          
                            F
                            ,
                            n
                          
                        
                      
                      -
                    
                  
                
              
              
                
                  
                    j
                    ·
                    
                      ω
                      
                        R
                        ,
                        n
                      
                    
                    ·
                    
                      pi
                      
                        F
                        ,
                        n
                      
                    
                  
                
              
            
            ⁢
            
              ❘
              
                
                  
                    d
                    
                      m
                      ,
                      z
                    
                  
                  >
                  
                    d
                    m
                  
                
                
                  
                    
                      d
                      
                        m
                        ,
                        z
                      
                    
                    =
                    
                      d
                      m
                    
                  
                  ,
                  
                    
                      
                        d
                        _
                      
                      
                        m
                        ,
                        z
                      
                    
                    >
                    
                      
                        d
                        _
                      
                      m
                    
                  
                
              
            
          
          }
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        66
      
    
  




Diversity set, {right arrow over (D)}m+1, is equal to the candidate diversity set, {right arrow over (D)}m,z, corresponding to the basis sample substitution at index z, in Equation 67:




  
    
      
        
          
            D
            ->
          
          
            m
            +
            1
          
        
        =
        
          
            
              D
              ->
            
            
              m
              ,
              z
            
          
          ⁢
          
            ❘
            
              
                
                  d
                  
                    m
                    ,
                    z
                  
                
                >
                
                  d
                  m
                
              
              
                
                  
                    d
                    
                      m
                      ,
                      z
                    
                  
                  =
                  
                    d
                    m
                  
                
                ,
                
                  
                    
                      d
                      _
                    
                    
                      m
                      ,
                      z
                    
                  
                  >
                  
                    
                      d
                      _
                    
                    m
                  
                
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        67
      
    
  




The minimum distance, dm+1, is equal to the candidate diversity, dm,z, at index z, in Equation 68:




  
    
      
        
          d
          
            m
            +
            1
          
        
        =
        
          
            d
            
              m
              ,
              z
            
          
          ⁢
          
            ❘
            
              
                
                  d
                  
                    m
                    ,
                    z
                  
                
                >
                
                  d
                  m
                
              
              
                
                  
                    d
                    
                      m
                      ,
                      z
                    
                  
                  =
                  
                    d
                    m
                  
                
                ,
                
                  
                    
                      d
                      _
                    
                    
                      m
                      ,
                      z
                    
                  
                  >
                  
                    
                      d
                      _
                    
                    m
                  
                
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        68
      
    
  




The mean distance, d′m+1, is equal to the candidate mean distance, d′m,z, at index z, in Equation 69:




  
    
      
        
          
            d
            _
          
          
            m
            +
            1
          
        
        =
        
          
            
              d
              _
            
            
              m
              ,
              z
            
          
          ⁢
          
            ❘
            
              
                
                  d
                  
                    m
                    ,
                    z
                  
                
                >
                
                  d
                  m
                
              
              
                
                  
                    d
                    
                      m
                      ,
                      z
                    
                  
                  =
                  
                    d
                    m
                  
                
                ,
                
                  
                    
                      d
                      _
                    
                    
                      m
                      ,
                      z
                    
                  
                  >
                  
                    
                      d
                      _
                    
                    m
                  
                
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        69
      
    
  




In some aspects, if the candidate diversity sets, {right arrow over (D)}m,c, do not produce a candidate, {right arrow over (D)}m,z, which is more diverse than the existing diversity set, {right arrow over (D)}m, then the process of synthesis and evaluation of candidate diversity sets can be repeated at each subsequent sample index until the opportunity to improve the diversity of the set is observed.
Matrix Condition
For each new definition of the diversity set, the matrix {right arrow over (U)}mT{right arrow over (U)}m can be evaluated to determine if the matrix condition is sufficient to support the definition of the solution vector. The condition of the matrix {right arrow over (U)}mT{right arrow over (U)}m determines the sensitivity of the solution vector to perturbations in the matrix. Sensitivity analysis can be performed through direct or indirect means, though direct analysis is often computationally impractical.
Condition number, cm, a direct measure of the sensitivity of the solution vector {right arrow over (ξ)}m to perturbations in the matrix {right arrow over (U)}mT{right arrow over (U)}m, is defined as the magnitude of the ratio of the maximum and minimum eigenvalues of the matrix, in Equation 70.




  
    
      
        
          c
          m
        
        =
        
          
            
            
              
                λ
                
                  m
                  ,
                  x
                
              
              
                λ
                
                  m
                  ,
                  y
                
              
            
            
          
          ⁢
          
            ❘
            
              
                λ
                
                  x
                  ,
                  m
                
              
              ≥
              
                λ
                
                  m
                  ,
                  j
                
              
              ≥
              
                λ
                
                  m
                  ,
                  y
                
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        70
      
    
  




The Eigenvalues, {right arrow over (λ)}m, of the matrix {right arrow over (U)}mT{right arrow over (U)}m can be extracted by solving a characteristic polynomial associated with the matrix. Eigenvalues are the roots of the characteristic polynomial, in Equation 71.

DET({right arrow over (U)}mT·{right arrow over (U)}m−{right arrow over (λ)}m·{right arrow over (I)})=0  Equation 71

According to some aspects, the matrix {right arrow over (U)}mT{right arrow over (U)}m is relatively small, with dimension [3, 3], thus, eigenvalues can be extracted with reasonable efficiency through a direct solution to a third order characteristic polynomial, expressed in terms of matrix determinant, DET, and trace, TR, operations, in Equation 72.




  
    
      
        
          
            -
            
              
                λ
                ->
              
              m
              3
            
          
          +
          
            
              
                λ
                ->
              
              m
              2
            
            ·
            
              
                 
                TR
              
              ⁢
              
                (
                
                  
                    
                      U
                      ->
                    
                    m
                    T
                  
                  ·
                  
                    
                      U
                      ->
                    
                    m
                  
                
                )
              
            
          
          +
          
            
              
                
                  λ
                  ->
                
                m
              
              2
            
            ·
            
              [
              
                
                  
                     
                    TR
                  
                  ⁢
                  
                    (
                    
                      
                        (
                        
                          
                            
                              U
                              ->
                            
                            m
                            T
                          
                          ·
                          
                            
                              U
                              ->
                            
                            m
                          
                        
                        )
                      
                      2
                    
                    )
                  
                
                -
                
                  
                    (
                    
                      
                        
                          U
                          ->
                        
                        m
                        T
                      
                      ·
                      
                        
                          U
                          ->
                        
                        m
                      
                    
                    )
                  
                  
                  2
                  
                    TR
                    
                
              
              ]
            
          
          +
          
            
               
              DET
            
            ⁢
            
              (
              
                
                  
                    U
                    _
                  
                  m
                  T
                
                ·
                
                  
                    U
                    ->
                  
                  m
                
              
              )
            
          
        
        =
        0
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        72
      
    
  




Condition number, cm, of the matrix {right arrow over (U)}mT{right arrow over (U)}m approaches unity when the matrix is well-conditioned, and has eigenvalues which are nearly equal, and approaches infinity when the matrix is nearly singular, and has asymmetric eigenvalues.
A static maximum condition number, cx, can be defined to determine if the matrix {right arrow over (U)}mT{right arrow over (U)}m is sufficiently well-conditioned to extract a solution vector. The maximum condition number, cL, is defined through sensitivity analysis of the elements of the solution vector, based on application-specific requirements.
Practical variants of the algorithm include evaluation of the condition number, cm, after several successive iterations to the matrix {right arrow over (U)}m, or only if the minimum distance dm, exceeds a threshold, dy. According to some aspects, alternative eigenvalue estimation methods can be applied to reduce computational complexity. Numerical stability analysis can also be addressed.
An efficient, practical, indirect method of estimating the condition of the matrix {right arrow over (U)}mT{right arrow over (U)}m n can omit synthesis of condition number, cm, entirely. The basis for the diversity set, {right arrow over (D)}m, is selected based on the assumption that an increase in the minimum distance, dm, of the set yields a decrease in the condition number of the related matrix {right arrow over (U)}mT{right arrow over (U)}m. While the distance and the condition number correlate, it is possible that their relationship is not linear.
In some aspects, in lieu of a condition number synthesis, a static minimum distance, dy, can be defined to indirectly determine if the matrix {right arrow over (U)}mT{right arrow over (U)}m is sufficiently well-conditioned to support a solution. In these aspects, a minimum distance threshold, dy, is defined experimentally to result in a solution that is accurate enough to support the needs of a specific application.
Pseudo-Inverse Solution
According to some aspects, when the condition of the matrix {right arrow over (U)}mT{right arrow over (U)}m is found to be sufficient in the Matrix Condition process (1506), the solution vector, {right arrow over (ξ)}m is evaluated through application of the Moore-Penrose pseudo-inverse technique, in Equation 73.

{right arrow over (ξ)}m=({right arrow over (U)}mT·{right arrow over (U)}m)−1·({right arrow over (U)}mT·{right arrow over (y)}m)  Equation 73

The stator inductance, LS,m, the total leakage factor, σm, and the initial rotor time constant, τR,0,m, are directly evaluated from the solution vector according to Equations 43-45, respectively.
FIG. 17 illustrates an architecture (1700) used to track an induction motor rotor temperature in accordance with some aspects of the present disclosure. Once the induction motor electrical parameters, RS, LS, σ and τR,0, are accurately and reliably estimated (1204), as described above, the parameters are fed into the rotor time constant estimation block (122). The quantity, τR,0, is used as the initial rotor time constant value in a model-reference adaptive system inside the rotor time constant estimation block (122). Furthermore, this τR,0can also be used as an approximate indicator and be associated with the baseline rotor time constant and temperature pair (τR,n0, θR,n0), which is used to calculate the rotor temperature, θR,n, (124) from the rotor time constant, τR,n. The quantity τR,n being the output of the rotor time constant estimation block (122).
While particular aspects, embodiments, and applications of the present invention have been illustrated and described, it is to be understood that the invention is not limited to the precise construction and compositions disclosed herein and that various modifications, changes, and variations be apparent from the foregoing descriptions without departing from the spirit and scope of the invention as defined in the appended claims.

## Claims

1. A method for estimating a temperature of a rotor of an induction motor through analysis of voltage and current signals associated with the motor, comprising:
measuring the voltage signal associated with the induction motor;
determining a representation of the measured voltage signal;
measuring the current signal associated with the induction motor;
determining a representation of the measured current signal;
determining a speed of the rotor;
determining an estimate of a rotor time constant according to a function that includes a fundamental frequency voltage component extracted from the representation of the measured voltage signal, a fundamental frequency current component extracted from the representation of the measured current signal, and the rotor speed;
determining an estimate of the rotor temperature based on an inverse relationship between a known rotor temperature and the estimated rotor time constant; and
storing the estimated rotor temperature.

2. The method of claim 1, wherein the representation of the measured voltage signal is determined by calculating a complex voltage space vector from the voltage measurements of the voltage signal, and the representation of the measured current signal is determined by calculating a complex current space vector from the current measurements of the current signal.

3. The method of claim 2, wherein the measured voltage signal is a three-phase voltage signal and the voltage measurements are measured from the voltage differences between at least one of the three phases of the three-phase voltage signal and either every other phase of the three phases or a voltage reference point.

4. The method of claim 2, wherein the measured current signal is a three-phase current signal and the current measurements are measured from at least two of the three phases of the three-phase current signal.

5. The method of claim 1, wherein the induction motor is a line-connected motor.

6. The method of claim 1, wherein the determining the speed of the rotor is carried out according to a function that includes a fundamental frequency extracted from the representation of the measured voltage signal, a rotor slot harmonic frequency extracted from the representation of the measured current signal, a stator winding distribution harmonic order, a rotor magnetomotive force distribution harmonic order, a number of rotor slots of the motor, and a number of pole-pairs of the motor.

7. The method of claim 6, wherein the representation of the measured current signal is determined by calculating a complex current space vector from the current measurements of the current signal, and wherein the rotor slot harmonic frequency corresponds to a dominant rotor slot harmonic frequency extracted from the complex current space vector.

8. The method of claim 6, wherein the function for determining the rotor speed is represented by




  
    
      ω
      R
    
    =
    
      
        2
        ⁢
        π
        ⁢
        
          
        
        ⁢
        
          P
          ·
          
            (
            
              
                ±
                
                  f
                  sh
                
              
              -
              
                
                  n
                  w
                
                ·
                
                  f
                  0
                
              
            
            )
          
        
      
      
        (
        kR
        )
      
    
  
  ,




where ωR represents the rotor speed, P represents the number of pole-pairs, fsh represents the rotor slot harmonic frequency; nw represents the stator winding distribution harmonic order, f0 represents the fundamental frequency; k represents the rotor magnetomotive force distribution harmonic order; and R represents the number of rotor slots.

9. The method of claim 7, wherein the representation of the measured voltage signal is determined by calculating a complex voltage space vector from the voltage measurements of the voltage signal, and wherein the fundamental frequency is extracted from the complex voltage space vector by:
generating a complex exponential signal in a voltage controlled oscillator evaluated at a rated fundamental frequency associated with the motor;
multiplying the complex voltage space vector with a complex conjugate of the complex exponential signal to produce a mixed complex voltage signal;
filtering the mixed complex voltage signal to produce a first complex baseband signal; and
extracting a time derivative of the phase of the first complex baseband signal to produce the fundamental frequency as a function of the extracted time derivative.

10. The method of claim 9, wherein the filtering is carried out by a low-pass filter that has an associated phase response over a frequency band that at least approximates a linear phase.

11. The method of claim 10, wherein the low pass filter includes a Finite Impulse Response (FIR) filter or in an Infinite Impulse Response (IIR) filter.

12. The method of claim 6, wherein the representation of the measured current signal is determined by calculating a complex current space vector from the current measurements of the current signal, and wherein the rotor slot harmonic frequency is extracted from complex current space vector by:
determining a nominal rotor slot harmonic frequency;
synthesizing, in a voltage controlled oscillator, a complex exponential signal evaluated at the nominal rotor slot harmonic frequency;
multiplying the complex current space vector with a complex conjugate of the complex exponential signal to produce a mixed complex current signal;
filtering the mixed complex current signal to produce a second complex baseband signal; and
extracting a time derivative of the phase of the second complex baseband signal to produce the rotor slot harmonic frequency as a function of the extracted time derivative.

13. The method of claim 7, wherein the dominant rotor slot harmonic frequency has the largest amplitude among a plurality of observable rotor slot harmonic components in a stator current harmonic spectrum.

14. The method of claim 13, wherein the dominant rotor slot harmonic frequency is extracted according to a relationship between dominant rotor slot harmonic frequency and rotor design parameters.

15. The method of claim 1, wherein the determining the rotor speed is carried out by converting an output of a speed sensing device coupled to a shaft of the motor to the rotor speed.

16. The method of claim 1, wherein the rotor time constant is determined by substantially aligning a first flux-related vector calculated from a rotor circuit equation with a second flux-related vector calculated from a stator circuit equation.

17. The method of claim 16, wherein the stator circuit equation is expressed as a time derivative of a second complex flux space vector and includes the fundamental frequency current component, the fundamental frequency voltage component, a stator resistance, a total leakage factor, and a stator inductance.

18. The method of claim 16, wherein the rotor circuit equation is expressed as a time derivative of a first complex flux space vector and includes a ratio between (a) a rotor inductance and (b) a rotor resistance.

19. The method of claim 18, further comprising:
filtering an output of the rotor circuit equation to produce the first flux-related vector; and
filtering an output of the stator circuit equation to produce the second flux-related vector.

20. The method of claim 19, wherein the rotor time constant is further determined by adapting the rotor time constant according to a function that includes a cross product between the first flux-related vector and the second flux-related vector such that the magnitude of the cross product is minimized.

21. The method of claim 20, wherein the rotor time constant is further determined by correlating the magnitude of the cross product to the rotor time constant based on a tuned proportional-integral block.

22. The method of claim 1, wherein the inverse relationship is represented by a function that includes the known rotor temperature, at least two rotor time constants determined at different times, and a temperature coefficient based on an inferred temperature for zero resistance.

23. The method of claim 22, wherein the inverse relationship is represented by:
θR,n=(θR,n0+k)·τR,n0/τR,n−k, where θR,n represents the rotor temperature at time n, θR,n0 represents the known rotor temperature at time n0, τR,n represents the rotor time constant at time n, τR,n0 represents a baseline rotor time constant at time n0, and k represents the temperature coefficient.

24. The method of claim 1, wherein the inverse relationship is derived from a linear relationship based on at least two rotor resistances at different times, a temperature coefficient based on an inferred temperature for zero resistance, and at least two rotor temperatures at the different times.

25. The method of claim 1, wherein the fundamental frequency voltage component is extracted from the representation of the measured voltage signal by:
generating a complex exponential signal in a voltage controlled oscillator evaluated at a rated fundamental frequency associated with the motor;
calculating a mixed complex voltage signal according to a function that includes the product of the complex voltage space vector and the complex conjugate of the complex exponential signal;
filtering the mixed complex voltage signal to produce a complex baseband signal; and
multiplying the complex baseband signal by the complex exponential signal to produce the fundamental frequency voltage component.

26. The method of claim 25, wherein the filtering is carried out via a finite impulse response low-pass filter, or an infinite impulse response low-pass filter, or a generalized linear-phase low-pass filter.

27. The method of claim 1, wherein the fundamental frequency current component is extracted from the representation of the measured current signal by:
generating a complex exponential signal in a voltage controlled oscillator evaluated at a rated fundamental frequency associated with the motor;
calculating a mixed complex current signal according to a function that includes the product of the complex current space vector and the complex conjugate of the complex exponential signal;
filtering the mixed complex current signal to produce a complex baseband signal; and
multiplying the complex baseband signal by the complex exponential signal to produce the fundamental frequency current component.