Algorithm for optimizing data sampling in a discrete periodic system with a bounded rate of change for the discrete system periods

A method for switching a sampling rate for a resolver position tracking system (RPT), said RPT having a plurality of sampling rates for sampling resolver positions throughout at least three sequential quadrants over time, a microprocessor and a memory storage unit, said memory storage unit storing:

• 1) microprocessor, 2) a transition time, said transition time being equal to the minimum time interval used by said resolver to transition through one of said quadrants, and 3) a fast sample time for said resolver representing the sample time at the one of said sampling rates which is fastest, said method comprising the steps of:
• a) comparing said transition time to said sleep time plus said processing time;
• b) indicating an error condition if said transition time is less than said sleep time plus said processing time;
• c) determining whether a first motion is detected;
• d) initializing and starting a counter if motion is detected in step (c);
• e) determining whether a subsequent motion is detected;
• f) determining a comparison time equal to the period of said first sampling rate multiplied by said count;
• g) comparing said comparison time to said sleep time plus said processing time;
• h) changing to a slow sampling rate when said comparison time is greater than said sleep time plus said processing time;
• i) repeating steps (d) through (h) until said resolver positions are sampled at said slower sampling rates.

A method for switching a sampling rate for a resolver position tracking system (RPT), said RPT having a microprocessor and a plurality of sampling rates for sampling resolver positions throughout at least three sequential quadrants over time, comprising the steps of:

• a) determining a processing time and a sleep time for said microprocessor, and storing each in a first and second storage location, respectively;
• b) determining a transition time, said transition time equal to the minimum length of time necessary for said resolver to transition through one of said quadrants and storing said transition time in a third storage location;
• c) determining a fast sample time for said resolver at a fastest one of said sampling rates and storing said fast sample time in a fourth storage location;
• d) comparing said fast sample time to said transition time;
• e) comparing said transition time to said sleep time plus said processing time;
• f) indicating an error condition if either:
• 1) said transition time is less than said sample time, or
• 2) said transition time is less than said sleep time plus said processing time;
• g) determining whether a first motion is detected;
• h) initializing and starting a counter if motion is detected in step (g);
• i) determining whether a subsequent motion is detected;
• j) determining a comparison time equal to the period of said fastest sampling rate multiplied by said count;
• k) comparing said comparison time to said sleep time plus said processing time;
• l) switching to one of said sampling rates which is slower than said fastest sampling rate when said comparison time is greater than said sleep time plus said processing time;
• m) repeating steps (h) through (l).