Suppression of performance degradation of reconfigurable robot by quantization error based on quantization error observer

Author(s):  
Taichi Mouri ◽  
Kazuhiro Yubai ◽  
Daisuke Yashiro ◽  
Junji Hirai ◽  
Roberto Oboe
Author(s):  
Prashant Tiwari ◽  
SH Upadhyay

The performance degradation assessment of ball bearings is of great importance to increase the efficiency and the reliability of rotating mechanical systems. The large dimensionality of feature space introduces a lot of noise and buries the potential information about faults hidden in the feature data. This paper proposes a novel health assessment method facilitated with two compatible methods, namely curvilinear component analysis and self-organizing map network. The novelty lies in the implementation of a vector quantization approach for the sub-manifolds in the feature space and to extract the fault signatures through nonlinear mapping technique. Curvilinear component analysis is a nonlinear mapping tool that can effectively represent the average manifold of the highly folded information and further preserves the local topology of the data. To answer the complications and to accomplish reliability and accuracy in bearing performance degradation assessment, the work is carried out with following steps; first, ensemble empirical mode decomposition is used to decompose the vibration signals into useful intrinsic mode functions; second, two fault features i.e. singular values and energy entropies are extracted from the envelopes of the intrinsic mode function signals; third, the extracted feature vectors under healthy conditions, further reduced with curvilinear component analysis are used to train the self-organizing map model; finally, the reduced test feature vectors are supplied to the trained self-organizing map and the confidence value is obtained. The effectiveness of the proposed technique is validated on three run-to-failure test signals with the different type of defects. The results indicate that the proposed technique detects the weak degradation earlier than the widely used indicators such as root mean square, kurtosis, self-organizing map-based minimum quantization error, and minimum quantization error-based on the principal component analysis.


Author(s):  
Kyle D. Wesson ◽  
Swen D. Ericson ◽  
Terence L. Johnson ◽  
Karl W. Shallberg ◽  
Per K. Enge ◽  
...  

Author(s):  
Edgar Ofuchi ◽  
Ana Leticia Lima Santos ◽  
Thiago Sirino ◽  
Henrique Stel ◽  
Rigoberto Morales

2021 ◽  
Vol 18 (3) ◽  
pp. 1-22
Author(s):  
Michael Stokes ◽  
David Whalley ◽  
Soner Onder

While data filter caches (DFCs) have been shown to be effective at reducing data access energy, they have not been adopted in processors due to the associated performance penalty caused by high DFC miss rates. In this article, we present a design that both decreases the DFC miss rate and completely eliminates the DFC performance penalty even for a level-one data cache (L1 DC) with a single cycle access time. First, we show that a DFC that lazily fills each word in a DFC line from an L1 DC only when the word is referenced is more energy-efficient than eagerly filling the entire DFC line. For a 512B DFC, we are able to eliminate loads of words into the DFC that are never referenced before being evicted, which occurred for about 75% of the words in 32B lines. Second, we demonstrate that a lazily word filled DFC line can effectively share and pack data words from multiple L1 DC lines to lower the DFC miss rate. For a 512B DFC, we completely avoid accessing the L1 DC for loads about 23% of the time and avoid a fully associative L1 DC access for loads 50% of the time, where the DFC only requires about 2.5% of the size of the L1 DC. Finally, we present a method that completely eliminates the DFC performance penalty by speculatively performing DFC tag checks early and only accessing DFC data when a hit is guaranteed. For a 512B DFC, we improve data access energy usage for the DTLB and L1 DC by 33% with no performance degradation.


Sign in / Sign up

Export Citation Format

Share Document