A new technique using signal flow graph for conversion of ladder based filter into CFOA based filter has been proposed. The proposed technique converts the existing LC ladder based filter into CFOA in low pass and hig...A new technique using signal flow graph for conversion of ladder based filter into CFOA based filter has been proposed. The proposed technique converts the existing LC ladder based filter into CFOA in low pass and high pass configuration. The design of low pass filter and high pass filter has been realized using the proposed technique. The proposed configuration is implemented using CFOA as an active device and all the capacitors are grounded. Simulation has been carried out using simulation software I-cap. The simulation results have been demonstrated and discussed.展开更多
A new technique for the conversion of ladder based filter into CFOA based filter has been proposed. The technique uses signal flow graph and converts the existing LC ladder based filter into band pass & band stop ...A new technique for the conversion of ladder based filter into CFOA based filter has been proposed. The technique uses signal flow graph and converts the existing LC ladder based filter into band pass & band stop configurations. The design of band pass and band stop filter has been realized using the proposed technique. The proposed configuration is implemented using CFOA as an active device and all the capacitors are grounded. CFOA based circuits have greater linearity, high dynamic rate, high slew rate and high signal bandwidth. Simulation has been carried out using simulation software P Spice (v10.1). The simulation results have been demonstrated and discussed.展开更多
For a graph G and an integer r ≥ 1, G is r-EKR if no intersecting family of independent r-sets of G is larger than the largest star （a family of independent r-sets containing some fixed vertex in G）, and G is stric...For a graph G and an integer r ≥ 1, G is r-EKR if no intersecting family of independent r-sets of G is larger than the largest star （a family of independent r-sets containing some fixed vertex in G）, and G is strictly r-EKR if every extremal intersecting family of independent r-sets is a star. Recently, Hurlbert and Kamat gave a preliminary result about EKR property of ladder graphs. They showed that a ladder graph with n rungs is 3-EKR for all n ≥3. The present paper proves that this graph is r-EKR for all 1 ≤ r 〈 n, and strictly r-EKR except for r = n - 1.展开更多
文摘A new technique using signal flow graph for conversion of ladder based filter into CFOA based filter has been proposed. The proposed technique converts the existing LC ladder based filter into CFOA in low pass and high pass configuration. The design of low pass filter and high pass filter has been realized using the proposed technique. The proposed configuration is implemented using CFOA as an active device and all the capacitors are grounded. Simulation has been carried out using simulation software I-cap. The simulation results have been demonstrated and discussed.
文摘A new technique for the conversion of ladder based filter into CFOA based filter has been proposed. The technique uses signal flow graph and converts the existing LC ladder based filter into band pass & band stop configurations. The design of band pass and band stop filter has been realized using the proposed technique. The proposed configuration is implemented using CFOA as an active device and all the capacitors are grounded. CFOA based circuits have greater linearity, high dynamic rate, high slew rate and high signal bandwidth. Simulation has been carried out using simulation software P Spice (v10.1). The simulation results have been demonstrated and discussed.
基金Supported by the National Natural Science Foundation of China(No.11201409,No.11371327)the Natural Science Foundation of Hebei Province of China(No.A2013203009)
文摘For a graph G and an integer r ≥ 1, G is r-EKR if no intersecting family of independent r-sets of G is larger than the largest star （a family of independent r-sets containing some fixed vertex in G）, and G is strictly r-EKR if every extremal intersecting family of independent r-sets is a star. Recently, Hurlbert and Kamat gave a preliminary result about EKR property of ladder graphs. They showed that a ladder graph with n rungs is 3-EKR for all n ≥3. The present paper proves that this graph is r-EKR for all 1 ≤ r 〈 n, and strictly r-EKR except for r = n - 1.
