The Cascade Correlation architecture is unique in its abilities to construct sensibly a network topology during training — taking into account all possible connections. This paper investigates a number of different connection strategies for the hidden nodes that Cascade Correlation inserts into a network, by limiting the connections a hidden node may make.

In this paper, a new structure for cascade multilevel inverter is presented which consists of a series connection of several sub-multilevel units. Each sub-multilevel unit comprises of eight unidirectional switches, two bidirectional switches, and six DC voltage sources. For the proposed cascade topology, two algorithms are presented to produce all possible levels at the output voltage waveform...

Nonlinear feedback shift registers (NFSRs) are an important type of sequence generators used for building stream ciphers. The shift register used in Grain, one of eSTREAM finalists, is a cascade connection of two NFSRs, which is also known as nonlinear product-feedback shift registers proposed in 1970. This paper provides a series of algorithms to decompose a given NFSR into a cascade connectio...

Nonlinear feedback shift registers (NFSRs) are an important building block for stream ciphers. Given a cascade connection of two NFSRs, say NFSR(f, g), it has been known for decades how to solve the characteristic function of the NFSR which is equivalent to NFSR(f, g). However, the converse problem of decomposing an NFSR into a cascade connection of two smaller NFSRs is not completely solved, a...

In this article, the cascade connection of two “buck” converters is examined from the perspective of differential flatness and Generalized Proportional Integral (GPI) observer–based control. The multi-variable nonlinear “buckbuck” converter is subject to unknown, time-varying, load current demands, at each one of the outputs of the two constitutive stages. The linear output feedback controllers...

We study asymptotic percolation as N → ∞ in an infinite random graph GN embedded in the hierarchical group of order N , with connection probabilities depending on an ultrametric distance between vertices. GN is structured as a cascade of finite random subgraphs of (approximate) Erdös-Renyi type. We give a criterion for percolation, and show that percolation takes place along giant components of...

A large-scale memory-technology-based programmable logic device (PLD) using a look-up table (LUT) cascade is developed in the 0.35-mm standard complementary metal oxide semiconductor (CMOS) logic process. Eight 64K-bit synchronous SRAMs are connected to form an LUT cascade with a few additional circuits. The features of the LUT cascade include: 1) a flexible cascade connection structure, 2) mul...