𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Time-varying reconstruction of the ionosphere. 1. The algorithm

✍ Scribed by Eric Sutton; Helen Na

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
189 KB
Volume
9
Category
Article
ISSN
0899-9457

No coin nor oath required. For personal study only.

✦ Synopsis

Total electron content data can be used to reconstruct images of ionospheric electron density using computed ionospheric tomography (CIT). All existing CIT algorithms are formulated with the assumption that the ionosphere does not move during data collection. Since existing algorithms are static reconstruction algorithms, the motion of the ionosphere becomes a source of image degradation. This article presents a time-varying CIT algorithm that reconstructs several time slices of the ionosphere instead of a single static image. Thus, the new algorithm is not adversely affected by the motion of the ionosphere. The new algorithm uses a priori information on the vertical distribution of ionospheric electron density, but no a priori information on ionospheric motion, so the motion is reconstructed solely on the basis of information contained in the data.

πŸ“œ SIMILAR VOLUMES

Time-varying reconstruction of the ionos
Time-varying reconstruction of the ionosphere. 2. Data source analysis
✍ Eric Sutton; Helen Na πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 421 KB

A time-varying computed ionospheric tomography (TVCIT) algorithm for reconstructing moving images of the ionosphere is proposed. Since the TVCIT algorithm provides more information in the reconstructions than is provided in reconstructions using conventional static computed ionospheric tomography, t

Adaptive maximum likelihood algorithms f
Adaptive maximum likelihood algorithms for the blind tracking of time-varying multipath channels
✍ JoΓ«l Grouffaud; Pascal Larzabal; Anne FerrΓ©ol; Henri Clergeot πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 311 KB

Transmissions through multipath channels suffer from Rayleigh fading and intersymbol interference. This can be overcome by sending a (known) training sequence and identifying the channel (active identification). However, in a non-stationary context, the channel model has to be updated by periodicall

A Newton-like approximation algorithm fo
A Newton-like approximation algorithm for the steady-state solution of the riccati equation for time-varying systems
✍ Erol Emre; Gareth Knowles πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 329 KB πŸ‘ 1 views

An approximation technique is developed for the steady-state solution of the time-varying matrix Riccati equation. We show how the Newton-type algorithm of Kleinman, developed for computing the steady solution to the algebraic Riccati equation for time-invariant systems, can be extended for time-var

On the calculation of time-varying stabi
On the calculation of time-varying stability radii
✍ Fabian Wirth πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

The problem of calculating the maximal Lyapunov exponent (generalized spectral radius) of a discrete inclusion is formulated as an average yield optimal control problem. It is shown that the maximal value of this problem can be approximated by the maximal value of discounted optimal control problems

Binocular Shape Reconstruction: Psycholo
Binocular Shape Reconstruction: Psychological Plausibility of the 8-Point Algorithm
✍ Moses W. Chan; Zygmunt Pizlo; David M. Chelberg πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 354 KB

A similarity structure (shape) of a 3-D object can be reconstructed from two perspective views of the object obtained by a calibrated camera. One of the best-known methods for performing such a reconstruction is the 8-point algorithm. To evaluate the psychological plausibility of this algorithm, we