Scribd Logo
Upload

Welcome to Scribd!

  • Signal Propagation in A Long Wire

    Uploaded by

    Dionysios Zelios
    23 views25 pages
    We want to study the signal propagation in a wire of length l=10000 [m], having the resistance R, the inductance L and the capacitance C. At x=0 signals with the strength 1 [V] are sent during repeated time intervals of different lengths. Let’s denote this time-dependent input signal function by u0(t). The voltage U(x,t) in the wire is modeled by a hyperbolic PDE. Given the initial conditions and the boundary condition at x=0 the signal function is u0(t). At the other end x=l, the wire is open, i.e no signal is reflected but disappears out. The boundary condition fulfilling this condition is the advection equation We use the Finite Difference Method and discretize the x-axis into N intervals. We use the central difference approximations for the first and second order derivatives. To approximate the boundary condition at the right end try the upwind discretization (FTBS). For the wire the following parameter values are used: R=0.004 [Ω], L= [H] and C= [F]. We try N=100 and N=200. We compute the signal propagation during a few milliseconds with the maximum time-step fulfilling the stability condition and also with a time-step being 70 percent of this. The code has been written in Matlab.

    Original Title

    Signal Propagation in a Long Wire

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    We want to study the signal propagation in a wire of length l=10000 [m], having the resistance R, the inductance L and the capacitance C. At x=0 signals with the strength 1 [V] are sent during repeated time intervals of different lengths. Let’s denote this time-dependent input signal function by u0(t). The voltage U(x,t) in the wire is modeled by a hyperbolic PDE. Given the initial conditions and the boundary condition at x=0 the signal function is u0(t). At the other end x=l, the wire is open, i.e no signal is reflected but disappears out. The boundary condition fulfilling this condition is the advection equation We use the Finite Difference Method and discretize the x-axis into N intervals. We use the central difference approximations for the first and second order derivatives. To approximate the boundary condition at the right end try the upwind discretization (FTBS). For the wire the following parameter values are used: R=0.004 [Ω], L= [H] and C= [F]. We try N=100 and N=200. We compute the signal propagation during a few milliseconds with the maximum time-step fulfilling the stability condition and also with a time-step being 70 percent of this. The code has been written in Matlab.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    23 views25 pages

    Signal Propagation in A Long Wire

    Uploaded by

    Dionysios Zelios
    We want to study the signal propagation in a wire of length l=10000 [m], having the resistance R, the inductance L and the capacitance C. At x=0 signals with the strength 1 [V] are sent during repeated time intervals of different lengths. Let’s denote this time-dependent input signal function by u0(t). The voltage U(x,t) in the wire is modeled by a hyperbolic PDE. Given the initial conditions and the boundary condition at x=0 the signal function is u0(t). At the other end x=l, the wire is open, i.e no signal is reflected but disappears out. The boundary condition fulfilling this condition is the advection equation We use the Finite Difference Method and discretize the x-axis into N intervals. We use the central difference approximations for the first and second order derivatives. To approximate the boundary condition at the right end try the upwind discretization (FTBS). For the wire the following parameter values are used: R=0.004 [Ω], L= [H] and C= [F]. We try N=100 and N=200. We compute the signal propagation during a few milliseconds with the maximum time-step fulfilling the stability condition and also with a time-step being 70 percent of this. The code has been written in Matlab.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 25

    KTH

    Course: Applied Numerical methods


    Professor: Lennart Edsberg

    Team members
    Andreas Angelou
    Paul Evans
    Vasileios Papadimitriou
    Daniel Tepic
    Dionysios Zelios

    u R u
    1 u

    2
    2
    t
    L dt
    LC x
    2

    I.C :

    B.C :

    u ( x,0) 0
    X=0
    X=L

    R 0.004[]

    0 xl

    u
    ( x, 0) 0
    t

    0 xl

    u0 (t ) 1 [V]

    u
    (l , t )
    t
    L 106 [ H ]

    1 u
    (l , t ) 0
    LC x
    C 0.25 108[ F ]

    (N+1) grid-points

    Discretization

    of x-axis into N intervals:


    Finite Difference Method
    first

    and second order derivatives:


    Central difference approximations
    Approximation

    of the right end of B.C:


    Upwind discretization (FTBS)

    n 1
    i

    n 1

    2u i u i
    n

    t 2

    n 1
    i

    n 1

    n 1

    R ui ui
    1 u i 1 2u i u i 1

    L 2t
    LC
    x2
    n

    a
    1
    n
    n
    n

    (u i 1 2 ( 1) u i u i 1)
    1
    a

    1 (t )
    a
    2
    LC (x)
    2

    t R

    2L

    t 5 10 s
    N=100 grid-points

    N=100 grid-points

    N=100 grid-points

    N=100 grid-points

    t 2.5 10 s
    N=200 grid-points

    N=200 grid-points

    N=200 grid-points

    N=200 grid-points

    Taylor expansion
    N=100- t 7.0711106
    N=200 t 3.5355 10 6
    Greater interval for finding stability

    Without Taylor expansion


    N=100- t 5.025 106
    N=200 t 2.506 106

    Experimental values
    N=100- t 4.9962 10 6
    N=200 t 2.4991106

    Approximation method stability max


    N=100 t 5 10 6
    N=200 t 2.5 106

    N=100 grid-points

    N=100 grid-points

    You might also like