Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on

Issue 6 • Date Jun 1993

Filter Results

Displaying Results 1 - 7 of 7
  • Single-capacitor phase-controlled series resonant converter

    Publication Year: 1993 , Page(s): 383 - 391
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (660 KB)  

    A new phase-controlled series resonant, DC/DC converter is described, analyzed, and experimentally verified. The circuit comprises a phase-controlled inverter and a Class D current-driven rectifier. The phase-controlled inverter consists of two switching legs, two resonant inductors, and a single resonant capacitor connected in series with an AC load. The phase shift between the voltages that drive the MOSFETs is varied to control the AC current of the inverter and thereby regulate the DC output voltage of the converter. A frequency-domain analysis is used to derive basic equations which govern the circuit operation. An important advantage of the converter is that the operating frequency can be maintained constant. For operation at a switching frequency greater than 1.15 resonant frequency, the load of each switching leg is inductive. The proposed converter has an excellent full-load and part-load efficiency. An experimental prototype of the converter with a center-tapped rectifier was built and extensively tested at an output power of 78 W and a switching frequency of 200 kHz. The theoretical and experimental results were in good agreement View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global bifurcation and chaos from automatic gain control loops

    Publication Year: 1993 , Page(s): 403 - 412
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (696 KB)  

    The dynamics of the automatic gain control (AGC) loops which employ variable-gain amplifiers with a square control law are studied. The selected loop filters are of second-order low-pass type. The existence of global homoclinic bifurcation and Smale horseshoe chaos are proved without the traditional small-signal model assumption. To investigate systems that are monitored during discrete-time intervals, sampled-data AGC loops are also considered. Under the same square gain-control law, the first-and second-order loop filters are studied. The period-doubling routes to chaos are verified for the first-order systems, and Hopf bifurcations for the second-order filters. Simulations are performed and the resultant homoclinic tangles, chaotic time waveforms, bifurcation diagrams, and Lyapunov exponents are illustrated to demonstrate the theoretical results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimization of MOS circuits

    Publication Year: 1993 , Page(s): 412 - 422
    Cited by:  Papers (11)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (708 KB)  

    Optimizing the number of transistors in a complex MOS gate, which is important for minimizing chip area and delay in VLSI designs, is an NP-complete problem. The worst-case computational complexity of graph-oriented algorithms used in existing approaches is exponential in the number of transistors. This problem is addressed through the use of bridging switches. A theory and an algorithm for optimization of MOS switch networks using an edge-merging technique are proposed. The worst-case computational complexity of the heuristic algorithm proposed is O(n5e2), where n is the number of nodes and e is the number of edges in the switch network View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new adaptive recursive delay filter

    Publication Year: 1993 , Page(s): 426 - 429
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (264 KB)  

    An adaptive recursive filter based on a sequential approach of identifying each delay, pole location and coefficient value is proposed. It is observed that if the unknown system to be modeled contains long decaying intervals in its impulse response, this filter has better performance than adaptive FIR (finite impulse response) delay filters or conventional approaches. Its stability monitoring and computational complexity are comparable to the most efficient IIR (infinite impulse response) realizations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QR-decomposition based algorithms for adaptive Volterra filtering

    Publication Year: 1993 , Page(s): 372 - 382
    Cited by:  Papers (10)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (816 KB)  

    A QR-recursive-least squares (RLS) adaptive algorithm for non-linear filtering is presented. The algorithm is based solely on Givens rotation. Hence the algorithm is numerically stable and highly amenable to parallel implementations. The computational complexity of the algorithm is comparable to that of the fast transversal Volterra filters. The algorithm is based on a truncated second-order Volterra series model; however, it can be easily extended to other types of polynomial nonlinearities. The algorithm is derived by transforming the nonlinear filtering problem into an equivalent multichannel linear filtering problem with a different number of coefficients in each channel. The derivation of the algorithm is based on a channel-decomposition strategy which involves processing the channels in a sequential fashion during each iteration. This avoids matrix processing and leads to a scalar implementation. Results of extensive experimental studies demonstrating the properties of the algorithm in finite and `infinite' precision environments are also presented. The results indicate that the algorithm retains the fast convergence behavior of the RLS Volterra filters and is numerically stable View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability of polynomials with time-variant coefficients

    Publication Year: 1993 , Page(s): 423 - 426
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (308 KB)  

    The problem of global asymptotic stability of a time-variant m th-order difference equation is addressed. Stable regions in the parameter space are derived for two cases: the case of a time-invariant parameter region, and the case of a time-variant parameter region. These results find applications in the area of adaptive digital filters View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic algorithm for CNN template learning

    Publication Year: 1993 , Page(s): 392 - 402
    Cited by:  Papers (60)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (816 KB)  

    A learning algorithm for space invariant cellular neural networks (CNNs) is described. Learning is formulated as an optimization problem. Exploration of any specified domain of stable CNNs is possible by the current approach. Templates are derived using a genetic optimization algorithm. Details of the algorithm are discussed and several application results are shown. Using this algorithm, propagation-type and gray-scale-output CNNs can also be designed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.