CN105157899A - Method for searching maximum absolute value of reciprocal noise-containing fitted square waves - Google Patents

Abstract

The invention discloses a method for searching the maximum absolute value of reciprocal noise-containing fitted square waves. The method includes the following steps that: a sampling frequency is set, and equal-duration array acquisition is performed on the noise-containing fitted square waves, so that an array {x} can be obtained, and the length of the array {x} assuredly cover 4 to 5 noise-containing fitted square waves; absolute value traversal is performed on the array {x}; and all data in the array {x} which has been subjected to absolute value traversal are sequenced according to a small-to-large order, and the last datum is the maximum absolute value in all the data in the array {x}. With the method of the invention adopted, the maximum absolute value of the reciprocal noise-containing fitted square waves of which the minimum period is Td can be automatically determined, and the misjudgment rate of a computer program can be decreased, and the success rate of search can be improved. The method is applied to occasions presenting a reciprocal noise-containing fitted square wave form, such as a metro platform screen door maximum kinetic energy test system.

Description

The reciprocal searching method to noisy plan square wave maximum value

Technical field

The present invention relates to a kind of reciprocal searching method to noisy plan square wave maximum value, belong to signal collection and analysis technical field.

Background technology

For reciprocal to noisy plan square wave, because it contains frequency glitches and irregularity, and the contrary alternation of amplitude presents non-monotonic change, makes in signal collection and analysis when requiring automatically to determine maximum value, easily judges by accident.

Summary of the invention

The object of the invention is to overcome deficiency of the prior art, a kind of reciprocal searching method to noisy plan square wave maximum value is provided, solve and reciprocally there is frequency glitches and irregularity to noisy plan square wave, and the contrary alternation of amplitude presents non-monotonic change, easily there is the technical matters judged by accident when requiring automatically to determine maximum value.

For solving the problems of the technologies described above, the method applied in the present invention is: the reciprocal searching method to noisy plan square wave maximum value, comprises the steps:

Step one: sample frequency is set, in the first-class duration collection array of noisy plan square wave, { x}, ensures that array length covers 4 ~ 5 noisy plan square waves;

Step 2: { x} is all over taking absolute value to array;

Step 3: to all over after taking absolute value { total data in x} by sorting from small to large, last data is array { maximum values of total data in x}.

Further, described employing frequency is f _s=10f ₀, f ₀₌1/T _d, T _dfor intending the minimum period of square wave.

Preferably, { duration of x} is 5T to gather array _d~ 7T _d.

Further, in step 3 " to all over after taking absolute value the total data in x} is by sorting from small to large " and concrete steps as follows:

To all over after taking absolute value the total data in x} is carried out size in order one by one and is compared: if current data be greater than after data, then current data and rear data are carried out Data Position exchange; Otherwise, retain current data position constant, further the size of relatively rear data and next data, thus after always making, a numerical value is greater than last data.

Compared with prior art, the beneficial effect that the present invention reaches is: the present invention can determine that the minimum period is T automatically _dreciprocal to noisy plan square wave maximum value, reduce the False Rate of computer program, improve search success ratio, be applied to and present the reciprocal occasion to noisy plan square wave form, such as subway shield door maximum kinetic energy test macro.

Embodiment

The invention will be further described below, and following examples only for technical scheme of the present invention is clearly described, and can not limit the scope of the invention with this.

The reciprocal searching method to noisy plan square wave maximum value, comprises the steps:

Step one: sample frequency f is set _s=10f ₀, f ₀₌1/T _d, T _dfor intending the minimum period of square wave, noisy plan square wave carries out array such as duration collection such as grade, and { x} ensures that array length covers 4 ~ 5 noisy plan square waves.Array gathers duration and can select can ensure that array length covers 4 ~ 5 noisy plan square waves, also can avoid gathering numerical value and cause committed memory too much, slowly calculated too much, most preferred embodiment the most of the present invention, gather duration and select 6T _d.

Step 2: { x} is all over taking absolute value to array;

Step 3: to all over after taking absolute value { total data in x} is by sorting from small to large, concrete operation step is: to all over after taking absolute value the total data in x} is carried out size in order one by one and is compared: if current data be greater than after data, then current data and rear data are carried out Data Position exchange; Otherwise, retain current data position constant, further the size of relatively rear data and next data, thus after always making, a numerical value is greater than last data.Last data is array { maximum values of total data in x}.

The inventive method, by arranging sampling policy, gathering array, arranging search criteria, builds a kind of reciprocal searching method to noisy plan square wave maximum value, automatically can determine that the minimum period is T _dreciprocal to noisy plan square wave maximum value, reduce the False Rate of computer program, improve search success ratio, be applied to and present the reciprocal occasion to noisy plan square wave form, such as subway shield door maximum kinetic energy test macro.

The above is only the preferred embodiment of the present invention; it should be pointed out that for those skilled in the art, under the prerequisite not departing from the technology of the present invention principle; can also make some improvement and distortion, these improve and distortion also should be considered as protection scope of the present invention.

Claims (4)

1. the reciprocal searching method to noisy plan square wave maximum value, is characterized in that, comprise the steps:

Step one: sample frequency is set, in the first-class duration collection array of noisy plan square wave, { x}, ensures that array length covers 4 ~ 5 noisy plan square waves;

Step 2: { x} is all over taking absolute value to array;

Step 3: to all over after taking absolute value { total data in x} by sorting from small to large, last data is array { maximum values of total data in x}.

2. the reciprocal searching method to noisy plan square wave maximum value according to claim 1, it is characterized in that, described employing frequency is f _s=10f ₀, f ₀=1/T _d, T _dfor intending the minimum period of square wave.

3. the reciprocal searching method to noisy plan square wave maximum value according to claim 2, is characterized in that, { duration of x} is 5T to gather array _d~ 7T _d.

4. the reciprocal searching method to noisy plan square wave maximum value according to claim 1, is characterized in that, in step 3 " to all over after taking absolute value the total data in x} is by sorting from small to large " and concrete steps as follows:

To all over after taking absolute value the total data in x} is carried out size in order one by one and is compared: if current data be greater than after data, then current data and rear data are carried out Data Position exchange; Otherwise, retain current data position constant, further the size of relatively rear data and next data, thus after always making, a numerical value is greater than last data.