When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Ladder topology - Wikipedia

    en.wikipedia.org/?title=Ladder_topology&redirect=no

    This page was last edited on 31 August 2008, at 13:46 (UTC).; Text is available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may ...

  3. Ladder network - Wikipedia

    en.wikipedia.org/?title=Ladder_network&redirect=no

    Download as PDF; Printable version; ... Appearance. move to sidebar hide. From Wikipedia, the free encyclopedia. Redirect page. Redirect to: Electronic filter ...

  4. Jacob's ladder surface - Wikipedia

    en.wikipedia.org/wiki/Jacob's_ladder_surface

    In mathematics, Jacob's ladder is a surface with infinite genus and two ends. It was named after Jacob's ladder by Étienne Ghys (1995 , Théorème A), because the surface can be constructed as the boundary of a ladder that is infinitely long in both directions.

  5. Circuit topology (electrical) - Wikipedia

    en.wikipedia.org/wiki/Circuit_topology_(electrical)

    Anti-ladder topology. The balanced form of ladder topology can be viewed as being the graph of the side of a prism of arbitrary order. The side of an antiprism forms a topology which, in this sense, is an anti-ladder. Anti-ladder topology finds an application in voltage multiplier circuits, in particular the Cockcroft-Walton generator. There is ...

  6. Bartlett's bisection theorem - Wikipedia

    en.wikipedia.org/wiki/Bartlett's_bisection_theorem

    Here ladder topologies have some undesirable properties, but a common design strategy is to start from a ladder implementation because of its simplicity. Bartlett's theorem is then used to transform the design to an intermediate stage as a step towards the final implementation (using a transformer to produce an unbalanced version of the lattice ...

  7. Möbius ladder - Wikipedia

    en.wikipedia.org/wiki/Möbius_ladder

    In graph theory, the Möbius ladder M n, for even numbers n, is formed from an n-cycle by adding edges (called "rungs") connecting opposite pairs of vertices in the cycle. It is a cubic, circulant graph, so-named because (with the exception of M 6 (the utility graph K 3,3), M n has exactly n/2 four-cycles [1] which link together by their shared edges to form a topological Möbius strip.

  8. File:Ladder topology.svg - Wikipedia

    en.wikipedia.org/wiki/File:Ladder_topology.svg

    You are free: to share – to copy, distribute and transmit the work; to remix – to adapt the work; Under the following conditions: attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made.

  9. Electronic filter topology - Wikipedia

    en.wikipedia.org/wiki/Electronic_filter_topology

    Usually the design applies some transform to a simple ladder topology: the resulting topology is ladder-like but no longer obeys the rule that shunt admittances are the dual network of series impedances: it invariably becomes more complex with higher component count. Such topologies include; m-derived filter; mm'-type filter; General m n-type ...