A high speed implementation of the random decrement algorithm
Abstract
The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.
 Publication:

NASA STI/Recon Technical Report N
 Pub Date:
 March 1982
 Bibcode:
 1982STIN...8222388K
 Keywords:

 Noise Reduction;
 Random Noise;
 Signal Processing;
 Algorithms;
 Analog To Digital Converters;
 Probability Theory;
 Statistical Analysis;
 Stochastic Processes;
 Engineering (General)