Method and apparatus for debouncing signals

Abstract: Debounce and lockout filters (20) include an input part (22) for receiving a plurality of input signals (V₁-V N ) from switches (10), a microprocessor (24) and an output part (26). The filters (20) simultaneously process a plurality of input binary signals (V₁-V N ) in parallel according to a sequence of mask values which individually adjust the filter response function for each of the individual filter channels (1-N). A multichannel filter (20) has a filter simultaneously filtering each input signal of a plurality of input signals (V₁-V N ), the filter including a plurality of independent filter channels (1-N), each independent filter channel filtering a corresponding input signal (V) of the plurality of input signals to produce a corresponding output signal (F) of a plurality of output signals (F₁-F N ). The multichannel filter (20) also has a mechanism for independently adjusting a filter response time (Figs. 5,15) of each independent filter channel.

Description: This invention relates to a method and apparatus for debouncing electrical signals. In particular, this invention relates to a filter for simultaneously processing multiple noisy signals to produce multiple corresponding debounced signals. Within copiers or other systems, there are a large number of binary input signals used to control the system. These signals come from sensors or switches in the system. Most switches and some sensors suffer from a phenomenon called bounce when changing state. Figure 1 shows a simple switch circuit 10 containing switch 12, voltage source 14 and resistor 16. Output voltage V will depend on the switch state of switch 12. When the switch is changed from an open to a closed state, current flows through the resistor and the voltage V at the output increases from zero volts to the voltage of the voltage source 14. When the switch is changed from a closed state to an open state, the voltage V at the output returns to zero volts. Figure 2 shows a graph of the voltage V as a function of time T. When switch 12 is changed from an open state to a closed state at time T 0 the output voltage V attains the voltage of the voltage source 14 after undergoing a noisy transition as shown in Figure 2. When processed through digital circuits, the noisy signal of output voltage V becomes a binary signal (having an on state and an off state). The binary signals often have a significant bounce time as shown in Figure 14. Without proper filtering, the bouncing signal shown in Figure 14, may be interpreted by a machine as multiple actuations of switch 12. Many modern systems are controlled by microprocessors. When a bouncing signal is input to a microprocessor controlled system, the bouncing signal can cause a number of problems for the software running on the microprocessor if the bouncing signal is not properly filtered. A debounce filter, whether implemented in hardware or software, waits until the input signal has stabilized for a specific period of time before changing the output signal from the filter. The software controlled microprocessor then uses the filtered signal as the control signal for the microprocessor controlled system. Such a debounce filter has a debounce filter time delay as shown in Figure 5. A complication in designing large systems arises from two properties. The first is that different switches and sensor types are often characterized by different bounce times, thus requiring different filters and different filter characteristics. The second is that a large system often imposes different timing requirements, such as the maximum tolerable delay, on the signals coming from the several switches and sensors in the system. Therefore, it is often necessary to process signals from different switches through different filter types to produce the corresponding filtered signals. One method of filtering input signals is a two sample approach where two samples are sequentially taken and compared. If the two samples agree, then the value of the two samples is output as the filter output. In another method of filtering input signals, the input voltage V is sampled at a regular rate. If the input sampled signal changes state, then a counter is incremented at the sample rate as long as the input signal differs from the present filter output. When the counter reaches a particular maximum value, then the filter output changes. If the input signal changes back to the present filter output value while the counter is still being incremented, then the counter is reset. In this method it is necessary to have a counter for every signal input to be debounced. In a microprocessor based filter system, this results in a large use of RAM and significant execution time for every input. Figure 6 is a timing diagram for the method using a counter where the counter is set to 6. This method is superior to the two sample approach in that more samples are taken, reducing the chance of incorrect reporting. However, this method uses even more time than the two sample approach. It is an object of the present invention to overcome limitations of the related art. It is another object of the present invention to provide a microprocessor based filter system for simultaneously processing a plurality of noisy input signals. It is yet another object of the present invention to provide a microprocessor based filter system for individually adjusting the filter response times of filter channels processing a plurality of simultaneously processed noisy input signals. These and other objects are achieved with a lockout filter for processing a plurality of binary signals representative of a corresponding plurality of switch outputs to produce a corresponding plurality of filtered signals. Each binary signal is a sequence of binary values, one value from each sequence of binary values being a current binary value. Each filtered signal is a sequence of filtered values, one value from each sequence of filtered values being a current filtered value. The filter includes a boolean processor having a plurality of signal filters for simultaneously processing each of the plurality of binary signals through a corresponding signal filter of the plurality of signal filters to produce the corresponding plurality of filtered signals. Each signal filter processes the corresponding current binary value and a predetermined number of other values from the corresponding sequence of binary values occurring prior to the current binary value to produce the corresponding current filtered value. The filter also includes a repeating mechanism for successively operating the boolean processor to produce, from each signal filter of the plurality of signal filters, the corresponding sequence of filtered values. Each value in the corresponding sequence of filtered values is a current filtered value corresponding to the corresponding current binary value and the predetermined number of other values. A successive current filtered value is produced by each signal filter each time the boolean processor is operated. The present invention provides a lockout filter for processing a plurality of binary signals into plurality of filtered signals, the filter comprising: boolean means for simultaneously processinc each binary signal through a corresponding one of a plurality of signal filters to produce a corresponding current filtered signal, each signal filter processing the corresponding current binary signal and a predetermined number of previous corresponding filtered values to produce a corresponding current filtered signal; and repeating means for successively operating the boolear means to produce the corresponding current filtered signal for each signal filter, a successive current filtered signal being produced by each signal filter each time the boolean means is operated. Preferably, for each time the repeating means operates the boolean means the at leas one update value includes the current filtered value; the at least one current stored value includes the leading value and the trailing value; and wherein for each signal filter of the plurality of signa filters the second means includes, OR means for determining a first value based on a logical OF function of the leading value with a logical compliment of the trailing value, AND means for determining a second value based on a logical AND function of the leading value with a logica compliment of the trailing value, and output means for determining the current filtered value based on a logical AND function of the current binary value with the first value logically combined with the second value based on a logical OR function. Preferably, for each time the repeating means operates the boolean means the at leas one update value includes the current filtered value; the at least one current stored value includes the leading value and the trailing value; and wherein for each signal filter of the plurality of signa filters the signal filter further comprises mask means for generating a first and a second sequence o masked values based on a sequence of mask values, a number of values in the sequence of mask values being equal to the predetermined number of other values, each value in the sequence o mask values corresponding to a respective value in the predetermined number of other values, each masked value in the first sequence of masked values being a value based on a logical AND function of a corresponding value from the sequence of mask values with a logical compliment of a corresponding value from the predetermined number of other values, each masked value in the second sequence of masked values being a value based on a logical OR function of a logical compliment of a corresponding value from the sequence of mask values with a logical compliment of a corresponding value from the predetermined number of other values, the second means including, OR means for determining a first value based on a logical OR function of the leading value with all of the values in the first sequence of masked values, AND means for determining a second value based on a logical AND function of the leading value with all of the values in the second sequence of masked values, and output means for determining the current filtered value based on a logical AND function of the first value with the current binary value logically combined with the second value based on a logical OR function, the sequence of mask values characterizing each signal filter by a unique time response function based on the corresponding sequence of mask values. The present invention further provides a programmable digital filtering apparatus when suitably programmed for carrying out any of the above-mentioned method. The invention will be described in detail in the following description of preferred embodiments with reference to the following figures wherein: Figure 1 is a schematic diagram of a representative switch circuit; Figure 2 is a graph of the output voltage produced by the circuit of Figure 1; Figure 3 is a block diagram of the filter processor of the present invention; Figure 4 is a logic schematic representative of the input part of the filter of the present invention; Figure 5 is a timing diagram showing debounce filter time delay; Figure 6 is a timing diagram representative of a conventional counter based debounced filter; Figure 7 is a timing diagram showing a filter output from the debounce filter of the present invention; Figures 8-13 are tables showing debounce filter outputs as a function of binary signal inputs; Figure 14 is a timing diagram showing the bounce time of a binary signal; Figures 15 and 16 are timing diagrams showing filter outputs from a lockout filter of the present invention; Figure 17 is a timing diagram showing a filter output from a conventional counter based lockout filter; Figure 18 is a timing diagram showing a filter output from the lockout filter of the present invention; and Figures 19-21 are tables showing lockout filter output as a function of binary signal inputs. In Figure 3, filter 20 includes input part 22, processor 24, output part 26 and memory 28. Input to the filter processor are a plurality of voltage signals V 1 -V N . Outputs from filter 20 include filtered signals F 1 -F N . Inputs V 1 -V N are produced by switch circuits 10. Figure 4 shows a representative logic schematic of input part 22. Input voltages V 1 -V N are provided to corresponding gates G 1 -G N . Sampling signal T M is provided to each of the gates G 1 -G N to produce binary signals B 1,M -B N,M . Signals B 1,M -B N,M constitute a plurality of binary signals having a sequence of values indexed on index designator M. A current value from each of the plurality of binary signals is provided to register 32 where the plurality of current values are retained until read in by processor 24. Preferably input part 22 is part of a microprocessor comprised of input part 22, processor 24 and output part 26. A multiplexer may be advantageously interposed between switch circuits 10 and input part 22 to select between multiple sets of switch voltage V. The value of each signal at a point in time is either in an on state or an off state (logical "1" or logical "0"). Figure 5 shows a filter input signal changing states several times before finally remaining in one state Figure 5 also shows a debounced filter output signal switching to its output state after the debounce filter time. Using the microprocessor based filter of Figure 3, the present invention debounces a whole byte or word of inputs without having to address each input separately. This method uses boolean arithmetic so that each bit can be treated separately while operating on a whole byte or word. Thus, an eight times improvement in speed over current methods is achievable using an 8-bit microprocessor. Greater improvements in speed are achieved with 16- bit and 32-bit microprocessors. This method also allows the filter to have different debouncing times for each input, even within the same byte of input values, by adjusting a customized mask sequence of values. This enables the filter of the present invention to be operated with a constant amount of microprocessor operation time (i.e. it does not depend on the number of inputs being changed at any one time), thus allowing a more predictable real time response which is independent of the number of inputs changing. The debounce filter changes the output value after a predetermined number of input binary values have differed from the current filter output value. The predetermined number of input binary values that need to differ from the previous output filtered value for the output to change is referred to as the number of phases of the filter. Figure 7 is a timing diagram of a six phase debounce filter. A one phase debounce filter reports out as a filtered output the previous input binary value, thus producing no debounce filtering. A two phase debounce filter requires two consecutive input values to differ from the current output value before the output value will be changed. In general, an x + 1 phase debounce filter will debounce an input binary signal with a time constant corresponding to x sample intervals. In order to describe the boolean filter, boolean equations will be used using the symbols " + " for the logic OR operation, "·" for the logic AND operation, and "/" for the logic NOT operation. R n represents the current binary value, R n-1 represents the next previous binary value (time n-1), and so forth until R n-x (time n-x). Similarly, C n represents the current filtered value, and C n-1 represents the next previous filtered value. The general debounce filter is described by Equation 1: C n = C n-1 ·(R n + R n-1 + R n-2 + ... + R n-x ) + (R n ·R n-1 ·R n-2 ·...·R n-x ) wherein input values R are processed with the next previous filtered value C n-1 to produce the current filtered value C n . A selective debounce filter enables certain bits within the same byte or word of input signals to be debounced differently, or not at all according to a desired filter time constant. If the maximum number of phases to be implemented within the debounce filter is x + 1, it is possible to make certain input signals (selected on a bit-by-bit basis) use a filter with less phases. A mask sequence m-m x is defined where the value of each element in the sequence is logic "1" to enable and logic "0" to disable Thus, when mask elements m 1 -m i (where i is less than x) are all enabled and m i+1 -m x are all disabled, then the debounce filter implemented will have a phase of i. The selective debounce filter is described by Equation 2: C n = C n-1 ·(R n + (m 1 ·R n-1 ) + (m 2 ·R n-2 ) + ... + (m x ·R n-x )) + (R n ·(/m 1 + R n-1 )·(/m 2 + R n-2 )·...·(/m x + R n-x )). For example, Figure 8 shows a one phase (no debounce) debounce filter where filtered value C n is always equal to input binary value R n , regardless of the value of the previous output value C n-1 . Figures 9 and 10 show the input/output functions for a two and three phase debounce filter, respectively, according to Equation 1. Figure 11 shows the filter output values as a function of input values for a three phase selective debounce filter with the mask sequence set for no debounce (m 1 and m 2 = 0), according to Equation 2. Figure 12 shows the filter output values as a function of input values for a three phase selective debounce filter using a mask sequence set to produce a filter time response function equivalent to a two phase filter (m 1 = "1" and m 2 = "0") according to Equation 2. Figure 13 shows the filter output values as a function of input values for a three phase selective debounce filter using a mask sequence set to produce a filter time response function equivalent to a three phase filter (m 1 and m 2 = "1") according to Equation 2. As can be appreciated, a debounce filter produces a filter output value after a debounce filter time delay. In cases where the debounce filter time delay is unacceptable, a lockout filter produces a change in filter output value immediately, and then locks out further changes in response to the filter input signal (Fig. 14) for a lockout filter time as shown in Figure 15. Thus, a lockout filter, whether implemented in hardware or software, reports a change immediately, and then waits before reporting any further changes. Figure 16 shows a filtered output signal reported immediately after a change in an input signal where a subsequent change in the input signal is not reported until after the lockout filter time. As with the debounce filter, not all switches and sensors are characterized by the same debounce time, and the timing requirements of the system using the filtered outputs may be able to tolerate one lockout filter time from one signal but require a shorter lockout filter time from another signal. Thus, it is often necessary to process some inputs differently. As with the debounce filter, a known counter based method for implanting a lockout filter includes sampling a signal at a regular rate, and if the signal changes state, then reporting the change from the filter and incrementing the counter. All further changes are disabled until the counter reaches a predetermined maximum value. When the counter reaches this value, then additional changes in the input signal state are allowed to be reported. In this counter based method it is necessary to have a counter for every locked out input signal. This results in a large use of RAM and a significant execution time for every input. Figure 17 is a timing diagram for a conventional counter based lockout filter. The lockout filter of the present invention simultaneously processes a plurality of input binary signals so that it is possible to lock out a byte or word of input values without having to address each input value separately. This method uses boolean arithmetic so that each bit of the input word can be treated separately when operating on a byte or word of binary values. As shown in Figure 18, the lockout filter allows the output filtered values to change after a predetermined number of output filter values have differed from the input binary value. The number of output filter values that needs to differ from the input binary value is referred to as the number of phases of the filter. A six phase filter is shown in Figure 18. The general lockout filter is described using boolean equation 3 and the selective lockout filter is described using boolean equation 4. For the lockout filter, the current output filtered value is L n , the next prior output filtered value is L n-1 , and so forth until L n-x . The lockout filter is therefore defined by boolean Equation 3: L n = R n ·(L n-1 +/L n-x ) + (L n-1 ·/L n-x ). In the selective lockout filter, a mask sequence m 0 -m x permits certain signals (certain bits in the same byte or word) to be filtered differently, or not filtered at all. Thus, when the maximum number of phases of the lockout filter is implemented as x + 1, it is possible to filter certain input signal, on a bit-by-bit basis, using a filter with less phases. The selected lockout filter is described by Equation 4: L n = R n ·(L n-1 +(m 0 ·/L n-1 ) +(m 1 ·/L n-2 )+ ... +(m x ·/L n-x )) + (L n-1 ·(/m 0 +/L n-1 )·(/m 1 +/L n-2 )·...·(/m x +/L n-x )). Figures 19-21 are tables showing lockout filter output filtered values as a function of input binary values for a one, two and three phase filter, respectively. Note that in Figure 21, the struck-out sequences would not naturally occur for an on-going filter operation. It will be appreciated by persons skilled in the art that lockout and debounce filters according to the present invention may be combined in any order to produce customized filter response functions. For example, a debounce filter may precede a lock out filter where the debounce filter time is selected to relate to a maximum width noise spike (e.g. cross-coupling noise) tolerated by the system noise margin design, and the lock out filter time relates to the bounce produced by the mechanical switch. It will also be appreciated that the debounce and lockout filters may be either implemented as a traversal or finite impulse response filter processing only input binary values or implemented as a recursive or infinite impulse response filter processing both input binary values and prior filter output values, noting of course that a true infinite impulse response is not achieved when the filter output is quantized to be in one of an on state and an off state

Claims: A lockout filter for processing a plurality of binary signals (V 1 -V N ) representative of a corresponding plurality of switch outputs to produce a corresponding plurality of filtered signals (F 1 -F N ), each binary signal being a sequence of binary values (R), one value from each sequence of binary values being a current binary value (R n ), each filtered signal (F) being a sequence of filtered values (L), one value from each sequence of filtered values being a current filtered value (L n ), the filter comprising: boolean means (G,32,24,28) including a plurality of signal filters for simultaneously processing each of the plurality of binary signals (V 1 -V N ) through a corresponding signal filter of the plurality of signal filters to produce the corresponding plurality of filtered signals (F 1 -F N ), each signal filter processing the corresponding current binary value (R n ) and a predetermined number (x + 1) of other values (L n-1 , L n-2 ...) from the corresponding sequence of filtered values (L) occurring prior to the current filtered value (L n ) to produce the corresponding current filtered value (L n ); and repeating means (T m ) for successively operating the boolean means (G,32,24,28) to produce, from each signal filter of the plurality of signal filters, the corresponding sequence of current filtered values (L n ), each value in the corresponding sequence of current filtered values being a current filtered value (L n ) corresponding to the corresponding current binary value (R n ) and the predetermined number (x + 1) of other values, a successive current filtered value (L n ) being produced by each signal filter each time the boolean means is operated. The lockout filter of claim 1, wherein for each signal filter of the plurality of signal filters: the predetermined number (n + 1) of other values includes at least a leading value and a trailing value, the leading value being a value from the sequence of filtered values (L n-1 , L n-2 ...) occurring immediately prior to the current filtered value (L n ); when the current binary value (R n ) is in one of a first state and a second state and when at least the leading value and the trailing value from the predetermined number (n + 1) of other values are in the other of the first state and the second state, then the signal filter produces the current filtered value (L n ) so that the current filtered value (L n ) is in one of a third state and a fourth state, the third and fourth states constituting a pair of binary states corresponding to one of a first pair of binary states and a second pair of binary states, the first pair of binary states being the first and second states respectively, the second pair of binary states being the second and first states respectively. The lockout filter of claim 1 or 2, wherein each signal filter of the plurality of signal filters comprises: a filter memory (32) for storing at least one current stored value; first means for determining, based on the current binary value (R n ) and the at least one current stored value, at least one update value; and second means for determining, based on the current binary value (R n ) and the at least one current stored value, the current filtered value (L n ), so that as the repeating means (T m ) successively operates the boolean means (G,32,24,28), the at least one update value is repeatedly determined and then repeatedly stored in the filter memory (32) as the at least one current stored value, the filter further comprising initializing means for initially storing at least one initial value in the filter memory (32) as the at least one current stored value. The filter of any of the preceding claims, wherein the predetermined number (x + 1) of the other values corresponding to each sequence of binary values (R) is equal to the predetermined number corresponding to any other sequence of binary values (R). The filter of any of the preceding claims, wherein the predetermined number (x + 1) of other values corresponding to each sequence of filtered values (L) is equal to the predetermined number corresponding to any other sequence of filtered values (L).

Inventors: HAWES KERRIGAN M, HAWES, KERRIGAN M.
Applicants: XEROX CORP, XEROX CORPORATION
Application year: 1993
Main classification: H03K5
IPC codes: H03K5, G06F15, H03H17