Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Determination of the Propagation Constant From Single-Ended Line Test Data

Författare:
Publiceringsår: 2012
Språk: Engelska
Sidor: 2422-2427
Publikation/Tidskrift/Serie: IEEE Transactions on Instrumentation and Measurement
Volym: 61
Nummer: 9
Dokumenttyp: Artikel
Förlag: IEEE

Sammanfattning

This paper presents a numerical method, here, called recursive obliquely moving approximation (ROMA), for determining the propagation constant from single-ended line test measurements. The method is based on deriving an equation binding the input impedance of the open-ended transmission line and the characteristic impedance with the line propagation constant. The algorithm solving this equation relies on a recursive Newton-Raphson-type procedure. Initial guesses are generated using oblique least squares on the complex plane for the extrapolation of previous data while moving toward higher frequencies. For residential access, the loops often consist of multiple sections. In those scenarios, the ROMA algorithm gives a less accurate and more difficult-to-interpret estimate of the propagation constant than for single-segment loops. Nevertheless, it still enables a quick and credible estimation of the loop capacity. ROMA provides these estimates without a priori information; it is insensitive to local solutions, and it has low numerical complexity. Moreover, for single-segment loops, common in, e. g., mobile backhaul applications, the algorithm gives a highly accurate estimation of the propagation constant.

Disputation

Nyckelord

  • Technology and Engineering
  • Broadband communication
  • digital subscriber line (DSL)
  • loop
  • qualification
  • twisted-pair modeling

Övriga

Published
Yes
  • ISSN: 0018-9456

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen