The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Feb. 05, 2019

Filed:

Dec. 13, 2013
Applicant:

Volvo Truck Corporation, Göteborg, SE;

Inventor:

Rune Prytz, Arlöv, SE;

Assignee:

Volvo Truck Corporation, Göteborg, SE;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 11/00 (2006.01); G06F 11/30 (2006.01); G05B 23/02 (2006.01); F02D 41/24 (2006.01); G06F 13/16 (2006.01); G11C 21/00 (2006.01); G06K 9/00 (2006.01); F02D 41/00 (2006.01); F02D 41/28 (2006.01);
U.S. Cl.
CPC ...
G06F 11/3013 (2013.01); F02D 41/2409 (2013.01); F02D 41/2425 (2013.01); G05B 23/0221 (2013.01); G06F 11/3027 (2013.01); G06F 11/3037 (2013.01); G06F 13/1673 (2013.01); G11C 21/00 (2013.01); F02D 41/0007 (2013.01); F02D 2041/286 (2013.01); G06K 9/00543 (2013.01);
Abstract

A method for monitoring the operation of a component includes receiving a stream of data samples, wherein each data sample represents a value of a physical parameter of the component, identifying local extrema of the stream of data samples, storing information relating to each local extremum in a respective position of a fixed size buffer, and upon the presence of a cycle formed between two matching endpoints represented by two local maxima or two local minima: i) deleting at least one of the local extrema corresponding to the endpoints of the cycle from the buffer, and ii) storing information related to the cycle in a memory such that the information stored in the memory represents the operation of the component. When the buffer is full such that each position of the buffer contains information relating to a unique local extrema, the method further includes the steps of: i) deleting the information relating to the oldest local extrema from the buffer, ii) calculating a pseudo cycle formed between two endpoints of which one endpoint is represented by the deleted oldest local extrema, and iii) storing information related to the calculated pseudo cycle in the memory.


Find Patent Forward Citations

Loading…