Non-linear digital rank filtering of input signal values
AssigneeADC Automotive Distance Control Systems GmbH
InventorMarkus Wintermantel
Life of this patent
Estimating the term…
Loading patent…
AssigneeADC Automotive Distance Control Systems GmbH
InventorMarkus Wintermantel
Estimating the term…
Input values are non-linearly digitally filtered to produce as an output value the Rth-largest value among the K input values, wherein the Rth-largest value may be the median value with R=(K+1)/2. The input values are provided in any binary fixed point number representation. A respective selected bit of all the input values is evaluated to determine the Rth-largest bit value of this bit among the K input values, and this gives the value of the corresponding bit of the output value. In the input values of which the selected bit does not correspond to the determined Rth-largest bit value, all of the subsequent less-significant bits are set as dummy bits equal to the selected bit, which excludes these input values from being the Rth-largest value in the subsequent evaluation of the successive less-significant bits. Then these steps are repeated for the next selected less-significant bit, and so forth, thereby respectively determining the successive bits of the output value. Minor modifications are necessary depending on the particular numerical representation. The method can be used for implementing digital filters, in particular for signal processing in systems for object recognition.
A method of non-linearly digitally filtering K input values to produce an output value corresponding to an Rth greatest value among said K input values with K≧R≧1, comprising the steps:
A method for the digital filtering of K input values by means of a non-linear filter, wherein the filter produces the R-maximum value from the K input values (K≧R≧1), and wherein the input values are available in a signed binary number representation in fixed point format, in which the amount of the bit significances descends from a maximum significant bit (MSB) to a less significant bit (LSB) with a factor ½ respectively, only the bit values 0 and 1 occur and if necessary an additional sign bit (SB) exists, in which
Dependencies are inferred from the claim text.