Abstract:
A low pass filter is capable of prevention of increasing of circuit scale there of according to increasing of tap number. The low pass filter initiates counting operation in response to a data input and continuing the counting operation until as an externally designated total tap number is reached, for leading out a counted value as a filter output upon completion of the counting operation.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention related generally to a low pass filter. More particularly, the invention relates to a low pass filter (hereinafter referred to as “LPF”) for infrared ray, in which a filter input is one bit, a tap coefficient of the LPF is one bit and a filter output is one bit. 
     2. Description of the Related Art 
     A typical construction of the conventional LPF has been disclosed in Japanese Unexamined Patent Publication No. Heisei 2-284513. The LPF disclosed in the above-identified publication is constructed with a Finite-duration Impulse-Response (FIR) filter  101  and an Infinite-duration Impulse-Response (IIR) filter  102 , as shown in FIG.  8 . 
     In the FIR filter  101 , among respective outputs of tap delay circuits T 0  to T 2N+M+1 , respective outputs of the tap delay circuit T 0  to T N  are added by an adder  103  and respective outputs of the tap delay circuits T N+M+1  to T 2N+M+1  are added by an adder  104 , respectively. Then, an adder output of the adder  104  is inverted by an inverter  105 , and then is added to the adder output of the adder  103  by an adder  106 . An adder output of the adder  106  is input to the IIR filter  102  to obtain a final output. It should be noted that D in FIG. 8 is a delay element. 
     In the meanwhile, since the LPF discussed about is adapted to multiple bit input, a circuit construction corresponding to the tap delay circuits T 0  to T N  in FIG.  8  and the adder  103  is required for adapting to one bit input. Therefore, the circuit shown in FIG. 8 is re-writtenas shown in FIG.  9 . Namely, the LPF shown in FIG. 9 is the LPF to be used upon demodulation of a signal modulated by a particular frequency, typically an infrared signal. An input X(z) and an output H(z) of the LPF are one bit, respectively, and a multiplying coefficient is “1”. The LPF of FIG. 9 is constructed with a data input terminal  1  for inputting an input X(z) of a data string sampled at a sampling frequency f, tap delay circuits T 1  to T 6  connected to the data input terminal  1  in series for generating a tap delay information of an impulse response, an OR circuit G 1  for superimposing tap delay information of the tap delay circuits T 1  to T 6 , and a data output terminal  2  for outputting an output H(z) as a result of superimposing. A filter characteristics of such LPF is determined depending upon number of steps of the tap delay circuits T 1  to T 6 . 
     Operation of the circuit construction shown in FIG. 9 will be discussed with reference to a timing chart of FIG.  10 . For simplification of disclosure, number of stages of the tap delay circuits is set to three stages in FIG.  10 . On the other hand, signals of the pulse response  1  to the pulse response  3  are prepared for the purpose of disclosure and represent impulse response as filters for respective pulses of the input X(z). 
     In FIG. 10, when a pulse P 1  as the input X(z) is input in synchronism with a sampling clock, a pulse response  1  corresponding to a period during which the pulse P 1  is input and a tap calculation period T for the pulse P 1 , is obtained. Since no pulse is present before and after the pulse P 1 , the pulse response  1  corresponding to the pulse P 1  is fed in a form of solitary wave as a demodulated output H(z), as is. 
     Next, the pulse response  1  is similarly obtained for the pulse P 2  input as X(z). In the shown case, next pulse P 3  is input while responding to the pulse P 2 . The pulse response for the pulse P 3  is executed at a timing of the pulse response  2 . On the other hand, a pulse P 4  is input while responding to the pulse P 3 . Similarly, pulse response is executed at a timing of the pulse response  3 . 
     Here, the demodulated output H(z) for the pulse P 2  to the pulse P 4  is output with obtaining OR of respective pulse responses. At this time, the demodulated output H(z) becomes a signal in which “0” during a period from the pulse P 2  to the pulse P 3  are smoothed. 
     In the foregoing conventional LPF, the following drawback is encountered. At first, in the circuit construction shown in FIG. 9, greater number of stages of the tap delay circuits caused greater circuit scale. When the circuit scale is greater, it becomes impossible to equip in a portable equipment. 
     Next, in the circuit construction shown in FIG. 9, tap delay circuits corresponding to total tap number becomes necessary. As the tap delay circuit, ordinary flip-flop (F/F) is used, and F/Fs in number corresponding to the total tap number are connected in series. In this case, F/Fs in number corresponding to the tap number even when the input X(z) to the filter is not present, is consumed by power by the clock input. When the LPF is packed into LSI, power consumption inherently becomes large, 
     SUMMARY OF THE INVENTION 
     The present invention has been worked out for solving the drawbacks in the prior art. It is therefore an object of the present invention to provide an LPF for infrared ray which can realize reduction of circuit scale, lowering of power consumption and improvement of response to switching of number of taps. 
     According to the first aspect of the present invention, a low pass filter comprises: 
     counting means for initiating a counting operation in response to a data input and continuing the counting operation until as an externally designated total tap number is reached, for leading out a counted value as a filter output upon completion of the counting operation. 
     According to the second aspect of the present invention, a low pass filter comprises: 
     time measuring means for initiating a time measuring operation in response to a data input for leading out a counted value as a filter output upon completion of the time measuring operation. 
     In the first and second aspect of the present invention it is preferred that the counting means or the time measuring means comprises: 
     a first m-bit selection circuit, wherein m is a positive integer; 
     a second m-bit selection circuit taking an output of the first m-bit selection circuit and a first fixed value for selectively outputting the output of the first m-bit selection circuit and the first fixed value depending upon an input data to own filter; 
     a m-bit flip-flop taking an output of the second m-bit selection circuit as an input data; 
     a first comparator circuit comparing an output data of the m-bit flip-flop and a second fixed value; 
     a m-bit adder circuit for adding an output of the first comparator circuit to the least significant bit of the output data of the m-bit flip-flop; and 
     a second comparator circuit for comparing the output data of the m-bit flip-flop and an externally input total tap number value, 
     the first m-bit selection circuit taking an output of the m-bit adder and a third fixed value as inputs for selectively outputting one of the output of the m-bit adder and the third fixed value depending upon an output of the second m-bit comparator circuit for leading the output of the first m-bit comparator circuit as a filter output. 
     According to the third aspect of the present invention, a low pass filter comprises: 
     counting means for initiating a counting operation in response to a data input; and 
     comparing means for comparing a counted value counted by the counting means and an externally designated total tap number for leading out the counted value as a filter output when a result of comparison taken place by the comparing means shows matching of the counted value and the externally designated total tap number. 
     According to the fourth aspect of the present invention. a low pass filter comprising: 
     time measuring means for initiating a time measuring operation in response to a data input; and 
     comparing means for comparing a measured time measured by the time measuring means and an externally designated total tap number for leading out the counted value as a filter output when a result of comparison taken place by the comparing means shows matching of the measured time and the externally designated total tap number. 
     In the foregoing third and fourth aspect of the present invention, it is preferred that the counting means or the time measuring means comprises: 
     a first m-bit selection circuit, wherein m is a positive integer; 
     a second m-bit selection circuit taking an output of the first m-bit selection circuit and a first fixed value for selectively outputting the output of the first m-bit selection circuit and the first fixed value depending upon an input data to own filter; 
     a m-bit flip-flop taking an output of the second m-bit selection circuit as an input data; 
     a comparator circuit comparing an output data of the m-bit flip-flop and a second fixed value; and 
     a m-bit adder circuit for adding an output of the first comparator circuit to the least significant bit of the output data of the m-bit flip-flop; 
     the first m-bit selection circuit taking an output of the m-bit adder and a third fixed value as inputs for selectively outputting one of the output of the m-bit adder and the third fixed value depending upon an output of the comparator circuit, 
     the comparator circuit comparing the output data of the m-bit flip-flop and an externally input total tap number for leading the output of the comparator circuit as a filter output. 
     In short, the low pass filter according to the present invention has the tap position counting means for counting the tap position of impulse response generated by the most recent input from the data input terminal. By comparison of the result of counting and the total tap number of the filter, judgment is made whether impulse response to the most recent data input is completed or not. As the output of the low pass filter, “H” level is required within the impulse response period and “L” level is required otherwise. The output of the comparator circuit employed in the present invention, a value equivalent to the low pass filter can be obtained. Also, the tap position counting portion according to the present invention is constructed with the flip-flop in equal number as the input signal setting the total tap number. Therefore, power consumption during stand-by state and in operation can be minimized. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     The present invention will be understood more fully from the detailed description given herebelow and from the accompanying drawings of the preferred embodiment of the present invention, which, however, should not be taken to be limitative to the invention, but are for explanation and understanding only. 
     In the drawings: 
     FIG. 1 is a circuit diagram showing one mode of implementation of an LPF for infrared ray in accordance with the present invention; 
     FIG. 2 is a circuit diagram showing another mode of implementation of an LPF for infrared ray in accordance with the present invention; 
     FIG. 3 is a circuit diagram showing the first embodiment of the LPF for infrared ray according to the present invention; 
     FIG. 4 is a timing chart showing operational example of the LPF for infrared ray of FIG. 3; 
     FIG. 5 is a timing chart showing another operational example of the LPF for infrared ray of FIG. 3; 
     FIG. 6 is a timing chart showing a further operational example of the LPF for infrared ray of FIG. 3; 
     FIG. 7 is a circuit diagram showing the second embodiment of the LPF for infrared ray according to the present invention; 
     FIG. 8 is a circuit diagram showing a construction of a low pass filter disclosed in Japanese Unexamined Patent Publication No. Heisei 2-284513; 
     FIG. 9 is a circuit diagram showing a construction of the low pass filter constructed by extracting a part of the low pass filter of FIG. 8; and 
     FIG. 10 is a timing chart showing operational example of LPF of FIG.  9 . 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT 
     The present invention will be discussed hereinafter in detail in terms of the preferred embodiment of the present invention with reference to the accompanying drawings. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be obvious, however, to those skilled in the art that the present invention may be practiced without these specific details. In other instance, well-known structures are not shown in detail in order to avoid unnecessarily obscure the present invention. Like components are identified by like reference numerals throughout the disclosure and drawings. 
     FIG. 1 is a block diagram of one mode of implementation of an LPF according to the present invention. In FIG. 1, the shown LPF is constructed with a data input terminal  1 , a fixed value input terminal  3 , a tap position counting portion  4  for counting tap position of an impulse response generated by the most recent data input through the data input terminal  1  (performing counting of a period corresponding to the impulse response period), and a data output terminal  2  for taking out a result of counting as a filter output. 
     The most recent data input through the data input terminal  1  is input to the tap position counting portion  4 . From the fixed value input terminal  3 , a total tap number as the LPF is applied. In the tap position counting portion  4 , the tap position for data input from the data input terminal  1  is calculated and output. Demodulated output H(z) counting of which is continued until the calculated tap position and the value input from the fixed value input terminal  3  matches with each other, becomes “H level” during the impulse response period and “L level” out of the impulse response period. From the output of the comparator circuit CMP, a value equivalent to the result of process in the LPF can be obtained. 
     FIG. 2 is a block diagram of another mode of implementation of the LPF according to the present invention. In FIG. 2, the shown LPF is constructed with the data input terminal  1 , the fixed value input terminal  3 , the tap position counting portion  4  for counting tap position of an impulse response generated by the most recent data input through the data input terminal  1 , the comparator circuit CMP comparing the result of counting by the tap position counting portion  4  and the input from the fixed value input terminal  3 , and a data output terminal  2  for taking out a result of comparison by the comparator circuit CMP as the filter output. 
     The most recent data input from the data input terminal  1  is input to the tap position counting portion  4 . From the fixed value input terminal  3 , the total tap number as the LPF is applied. In the tap position counting portion  4 , the tap position for the data input from the data input terminal  1  is calculated and output. By comparing the calculated tap position and the value input from the fixed value input terminal  3 , judgment can be made whether the impulse response for the most recent data input is completed or not. The demodulated output H(z) becomes “H level” in the impulse response period and “L level” out of the impulse response period to obtain the value equivalent to the result of process in the LPF from the output of the comparator circuit CMP. 
     FIG. 3 is a circuit diagram showing the construction of the first embodiment of the LPF according to the present invention. In FIG. 3, the shown embodiment of the low pass filter is constructed with the data input terminal  1 , the total filter tap number input terminal  3 , a second m-bit selection circuit S 2  controlled by an input data to own filter input to the data input terminal  1  with taking an output of a first m-bit selection circuit S 1  and a first fixed value as inputs, and a m-bit flip-flop R 1  operated in synchronism with a clock CLK with taking the output of the second m-bit selection circuit S 2  as data input. 
     On the other hand, the low pass filter of the shown embodiment is constructed with a first comparator circuit CMP 1  comparing the data output of the m-bit flip-flop R 1  and a second fixed value, an m-bit adder circuit A 1  adding the output of the first comparator circuit CMP 1  to the least significant bit of the data output of them-bit flip-flop R 1 , a second comparator circuit CMP 2  comparing a data output of the m-bit flip-flop R 1  and an input from the total filter tap number input terminal  3 , a first m-bit selection circuit S 1  controlled by an output of the second comparator circuit CMP 2  with taking an output of the m-bit adder circuit A 1  and a third fixed value as inputs, and a data output terminal  2  connected to the output of the first comparator circuit CMP 1 . It should be noted that, the least significant bit of the first fixed value is assumed to be set at “1”, all bits of the first fixed value other than the least significant bit are assumed to be set at “0”, and respective constants m are set at a value derived by rounding a logarithm of 2 of the total filter tap number into the integer. In FIG. 3, (x) represents that the value is a decimal value. 
     Here, the total filter tap number input to the input terminal  3  is preliminarily designated externally. However, the tap number is not fixed value and can be varied by the value designated externally. As discussed later, the value may be varied sequentially. The total filter tap number is a value corresponding to the impulse response period of the input data. On the other hand, the total tap number is determined depending number of stages of delay element groups of the low pass filter having a plurality of stages of delay elements connected in cascade connection in order to lead out the tap. 
     In FIG. 3, in a condition where the input from the data input terminal  1  is “H” level, “1” is output from the least significant bit of the second m-bit selection circuit S 2 , and “0” are output from all bits other than the least significant bit. This value is input to the first comparator circuit CMP 1  via the m-bit flip-flop R 1 . In the first comparator circuit CMP 1 , “L” is output when the comparing value and the compared value are equal to each other. Another inputs of the first comparator circuit CMP 1  are “0” and the least significant bit thereof is not “1”. Therefore, “H” is output from the first comparator circuit CMP 1 . 
     The result of comparison is output to the output terminal  2 , and in conjunction therewith, is added to the least significant bit of the adder circuit A 1 . Therefore, the adder circuit A 1  increments a value derived the current value of the m-bit flip-flop R 1  by “+1”. Thus, in the adder circuit A 1 , the current tap position with respect to the most recent data input is counted. In the second comparator circuit CMP 2 , the current value of the m-bit flip-flop R 1  and the set value set by the total tap number input terminal  3  are compared. When the current value of the m-bit flip-flop R 1  becomes equal to the total tap number, the output of the first m-bit selection circuit S 1  are set “0” and when the current value of the m-bit flip-flop R 1  is less than the total tap number, control for selecting the output of the adder circuit A 1  is performed. When “0” are output at all bits of the output of the first m-bit selection circuit S 1 , it represents that the current tap position exceeds the total tap number. Therefore, in order to terminate impulse response, all bits of the input of the first comparator circuit CMP 1  are set to “0” via the second m-bit selection circuit and the m-bit flip-flop R 1 . By this, the first comparator circuit CMP 1  outputs “L” to set the output terminal  2  “L”, and in conjunction therewith, to terminal incrementing by “+1” in the adder circuit A 1 . By this, all bits of the value of the m-bit flip-flop are held at “0”. 
     Here, assuming that an LPF transfer function is expressed by the following formula (1), when respective of the input, output and the tap coefficients are one bit, it can take only K(i)=1. Therefore, the formula (1) can be modified as the following formula (2). 
     
       
           H ( z )=Σ( X ( i )* K ( i ))  (1) 
       
     
     
       
           H ( z )=Σ( X ( i ))  (2) 
       
     
     It should be noted that, in the foregoing formula (1) and (2), i=0, 1, . . . , n. All of the X(i) are the same value and are one bit. Therefore, it becomes equivalent to output “1” for n times when “1” is input to the input X( 0 ). Namely, by employing a circuit outputting n in number of “1” corresponding to the total tap number when “1” is input to the input X( 0 ), the low pass filter can be realized. 
     In FIG. 3, the counter is constructed with the second m-bit selection circuit S 2 , the m-bit flip-flop R 1 , the m-bit adder A 1  and the first m-bit selection circuit S 1 . When “1” is input to the input X(z), counting is executed during a period (namely a period of impulse response) up to reaching the total tap number to terminal counting at a timing when the counted value reaching the total tap number is detected by the comparator CMP 2 . In the comparator circuit CMP 1 , the period to which the input X(z) is input and the period where count is executed are executed to take as the output of the shown filter. 
     FIG. 4 is a timing chart showing one example of a result of simulation upon setting the value at “6” assuming that the total filter tap number input terminal  3  in the circuit construction of FIG. 3 is four bits. In FIG. 4, signals equivalent to respective signals in FIG. 3 will be represented by the same reference numerals. 
     In FIG. 4, “CLK” denotes an input clock, “X(z)” denotes an input X(z) from the data input terminal  1 , “H(z) denotes the output H(z) from the data output terminal  2 , “R 1 ” denotes a state value of the m-bit flip-flop, “TAP” is a total tap number set at the total filter tap number input terminal  3 , “S1” and “S2” are outputs of respective of first and second m-bit selection circuits S 1  and S 2 , and “A 1 ” denotes an output of the adder. 
     In FIG. 4, with respect to the pulse P 1  appearing on the input X(z), the pulse P 3  appears on the filter output H(z). In this case, a period while the output of the selection circuit S 2  is varied from “2” to “6” is the tap calculation period. When the output of the selection circuit S 2  becomes “6” corresponding to the total tap number, the result of comparison in the comparator CMP 2  shows matching (illustrated by the hatched portion). Then, the output of the selection circuit S 1  becomes “00”. 
     Similarly, with respect to the pulse P 2  appearing at the input X(z), a pulse P 4  appears at the filter output H(z). In this case, the period while the output of the selection circuit S 2  is varied from “2” to “6” is the tap calculation period T. When the output of the selection circuit S 2  becomes “6” corresponding to the total tap number, the result of comparison in the comparator CMP 2  shows matching (illustrated by the hatched portion). Then, the output of the selection circuit S 1  becomes “00”. 
     FIG. 5 is a timing chart showing another example of the result of simulation, wherein respective signals equivalent to the signals in FIG. 3 will be represented by the same reference numerals. 
     In FIG. 5, with respect to the pulse P 1  appearing at the input X(z), a pulse P 3  appears at the filter output H(z). Then, if the output of the selection circuit S 2  becomes “6” corresponding to the total tap number, the result of comparison in the comparator CMP 2  shows matching, and the output of the selection circuit S 1  becomes “00”. 
     On the other hand, with respect to the pulse P 2 a, P 2 b, P 2 c appearing at the input X(z), a pulse P 4  appears at the filter output H(z). In this case, at every occasion of input of respective pulses P 2 a, P 2 b, P 2 c, the output of the selection circuit S 2  becomes “1”. At this time, the period while the output of the selection circuit S 2  is varied from “2” to “6” initially, is the tap calculation period T. When the output of the selection circuit S 2  becomes “6” corresponding to the total tap number, the result of comparison in the comparator CMP 2  shows matching. Then, the output of the selection circuit S 1  becomes “00”. 
     As set forth above, instead of the construction employing a multiplier, a construction employing the counter performing counting depending upon number of stages of connection of the delay element groups of the low pass filter having a plurality of stages of the delay element groups connected in cascades connection for leading out the tap of the filter, the LPF suppressing the size of the circuit as small as possible can be realized. 
     FIG. 6 is a timing chart showing a further example of the result of simulation upon setting the value varied sequentially, with taking the total filter tap number input terminal  3  as 4 bits in the circuit construction shown in FIG.  3 . It should be noted that, in FIG. 4, total tap number set at the total filter tap number input terminal  3  is varied sequentially from “C”(h) to “6”(h), “8”(h), “1”(h) (“(h)” represents that the values are hexadecimal number). 
     At this time. according to variation of the total tap number, the counted value in the state value R 1  if the m-bit flip-flop R 1  is obtained up to “6”(h), “8”(h), “1”(h), respectively. 
     FIG. 7 is a circuit diagram showing a construction of the second embodiment of the LPF of the present invention. In FIG. 7, the low pass filter in the shown embodiment is constructed with the data input terminal  1 , the total filter tap number input terminal  3 , the third m-bit selection circuit S 3  controlled by the outputs of the data input terminal  1  and the second comparator circuit CMP 2  with taking the output of the m-bit adder circuit A 1  and the first and second fixed values, and the m-bit flip-flop R 1  taking the output of the third m-bit selection circuit S 3  as data input. It should be noted that, to the m-bit flip flop R 1 , the clock CLK is input. 
     On the other hand, the low pass filter according to the shown embodiment is constructed with a first comparator circuit CMP 1  comparing the data output of the m-bit flip-flop R 1  and the third fixed value, an m-bit adder circuit A 1  adding the output of the first comparator circuit CMP 1  to the least significant bit of the data output of the m-bit flip-flop R 1 , a second comparator circuit CMP 2  comparing a data output of the m-bit flip-flop R 1  and an input from the total filter tap number input terminal  3 , and a data output terminal  2  connected to the output of the first comparator circuit CMP 1 . It should be noted that the least significant bit of the first fixed value is assumed to be set at “1”, all bits of the first fixed value other than the least significant bit are assumed to be set at “0”, all bits of the second and the third fixed value are assumed to be set at “0”, and respective constants m are set at a value derived by rounding a logarithm of 2 of the total filter tap number into the integer. 
     In short, the LPF of the shown embodiment is constructed with including a third m-bit selection circuit selectively controlled by the output of the input data to the own filter and the output of the second comparator circuit, in place of the first and second m-bit selection circuits S 1  and S 2  in the first embodiment of the LPF set forth above. The first and second m-bit selection circuits S 1  and S 2  are different only in one bit of the input fixed values, and other construction is the same. Therefore, by making the same components in common, the m-bit selection circuit S 3  in FIG. 7 can be obtained. Accordingly, the basic operation of the LPF shown in FIG. 7 is the same as that of the LPF illustrated in FIG. 3, but the circuit construction of FIG. 7 can realize the LPF with smaller circuit scale than the circuit construction of the embodiment shown in FIG.  3 . 
     When the tap coefficient is one bit and the total tap number is n, generation of the tap coefficient is performed only in the period where X(z) is “0”. On the other hand, H(z) is equal to X(z) during the period where X(z) is “1”. From this fact, the tap coefficient corresponding to the impulse response for one time is generated when X(z) becomes “0”. 
     Since the set total tap number and the tap position of the impulse response corresponding to the past input are compared and control to respond or not is performed depending upon the result of comparison, switching of the filter coefficient can follow in real time without depending upon X (z) input in the past. 
     As set forth above, number of F/Fs to be used in the conventional LPF was equal to the total number of the tap delay circuit. In contrast to this, in the LPF according to the present invention, the total number of F/Fs to be used by applying the total tap number in binary number can be reduced to be INT(log 2  (Tap Number) ). It should be noted that “INT” represents rounding of the value within parenthesis ( ) into the integer. 
     Associating with reduction of total number of the F/F used, a power consumption in stand-by state can be reduced into (INT (log 2  (Tap Number) )/(Tap Number) )relative to the power to be consumed by the F/Fs for the total number of the tap delay circuit. On the other hand, a period required for switching the total tap number is the waiting period corresponding to the total number of the tap delay circuit in the conventional LPF. In contrast to this, in the present invention, the total tap number can be varied in real time to require no waiting period. 
     Since the shown LPF can make the circuit scale smaller since the multiplier is not employed. Therefore, the LPF according to the present invention is optimal for radio serial communication in a notebook type personal computer, a portable information terminal or household electrical appliances. Also, it is applicable for network in home, i.e. so-called home bus. 
     As set forth above, the present invention can reduce total number of F/Fs to be used by applying the total tap number in binary value. Also, since the switching timing of the total tap number can be varied in real time, it becomes possible to realize reduction of the circuit scale, reduction of power consumption, improvement of response characteristics for switching of the tap number. 
     Although the present invention has been illustrated and described with respect to exemplary embodiment thereof, it should be understood by those skilled in the art that the foregoing and various other changes, omissions and additions may be made therein and thereto, without departing from the spirit and scope of the present invention. Therefore, the present invention should not be understood as limited to the specific embodiment set out above but to include all possible embodiments which can be embodied within a scope encompassed and equivalents thereof with respect to the feature set out in the appended claims. 
     For instance, the low pass filter according to the present invention is applicable in a demodulation circuit disclosed in the commonly owned co-pending U.S. patent application, now U.S. Pat. No. 6,335,658 entitled “Demodulation Circuit” and filed with claiming priority based on Japanese Patent Application No. Heisei 10-327395 and No. Heisei 10-327396, both filed on Nov. 18, 1998. The disclosure of the above-identified commonly owned co-pending application is herein incorporated by reference.