**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Localized vs Distributed Circuits: Criteria 1 and 2

Description

This lecture introduces two criteria to determine whether a circuit is localized or distributed: a temporal criterion comparing propagation time with rise time, and a frequency criterion for signals with a single frequency. Examples and calculations are provided to illustrate these concepts.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Instructor

In course

EE-200: Electromagnetics I : Transmission lines and waves

Le signal électrique est un vecteur essentiel pour la transmission d'information et d'énergie. En haute fréquence elle se manifeste comme un signal électromagnétique dont l'étude demande le développem

Related concepts (29)

Signal propagation delay

Propagation delay is the time duration taken for a signal to reach its destination. It can relate to networking, electronics or physics. In computer networks, propagation delay is the amount of time it takes for the head of the signal to travel from the sender to the receiver. It can be computed as the ratio between the link length and the propagation speed over the specific medium. Propagation delay is equal to d / s where d is the distance and s is the wave propagation speed. In wireless communication, s=c, i.

Network analysis (electrical circuits)

In electrical engineering and electronics, a network is a collection of interconnected components. Network analysis is the process of finding the voltages across, and the currents through, all network components. There are many techniques for calculating these values; however, for the most part, the techniques assume linear components. Except where stated, the methods described in this article are applicable only to linear network analysis.

Circuit (computer science)

In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes a function. Circuits of this kind provide a generalization of Boolean circuits and a mathematical model for digital logic circuits. Circuits are defined by the gates they contain and the values the gates can produce. For example, the values in a Boolean circuit are boolean values, and the circuit includes conjunction, disjunction, and negation gates.

Boolean circuit

In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal language can be decided by a family of Boolean circuits, one circuit for each possible input length. Boolean circuits are defined in terms of the logic gates they contain. For example, a circuit might contain binary AND and OR gates and unary NOT gates, or be entirely described by binary NAND gates. Each gate corresponds to some Boolean function that takes a fixed number of bits as input and outputs a single bit.

Equivalent circuit

In electrical engineering, an equivalent circuit refers to a theoretical circuit that retains all of the electrical characteristics of a given circuit. Often, an equivalent circuit is sought that simplifies calculation, and more broadly, that is a simplest form of a more complex circuit in order to aid analysis. In its most common form, an equivalent circuit is made up of linear, passive elements. However, more complex equivalent circuits are used that approximate the nonlinear behavior of the original circuit as well.

Related lectures (14)

Shor Algorithm: Circuit DetailsCS-308: Introduction to quantum computation

Covers the details of the Shor algorithm circuit and its complexity.

Circuit Analysis: Thevenin and Norton TheoremsEE-106: Electrical engineering science & technology

Explores circuit analysis using Thevenin and Norton theorems to simplify complex circuits for analysis.

Circuit Analysis: Thevenin and Norton EquivalentsEE-111: Circuits and systems

Explores Thevenin and Norton equivalents, mesh and nodal analysis, and planar circuits.

S-Domain Circuit Analysis: Part 2MICRO-211: Analog circuits and systems

Delves into s-domain circuit analysis, covering theorems, analysis methods, and stability concepts.

Analysis of Circuits with Dependent SourcesMICRO-211: Analog circuits and systems

Explores the analysis of circuits with dependent sources, node-voltage analysis, Thévenin equivalent circuits, and OPAMP fundamentals.