Search NASA⌕ Search

SEARCH · Search NASA

Results for “fading memory”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Simplified solution for a class of fading memory filters

A fading memory filter is a least squares estimator (LSE) that applies an exponentially decaying weight to past measurements. When compared with a standard Kalman filter, its key advantages are asymptotic stability and reduced sensitivity to modeling errors. This paper derives a simple solution for a class of fading memory filters, resulting in a reduction in computational complexity. Steady state filter solutions are obtained for second- and third-order filters used in a global positioning system (GPS) receiver for high dynamic vehicles.

Statman, Joseph I.↗

A recursive solution for a fading memory filter derived from Kalman filter theory

A simple recursive solution for a class of fading memory tracking filters is presented. A fading memory filter provides estimates of filter states based on past measurements, similar to a traditional Kalman filter. Unlike a Kalman filter, an exponentially decaying weight is applied to older measurements, discounting their effect on present state estimates. It is shown that Kalman filters and fading memory filters are closely related solutions to a general least squares estimator problem. Closed form filter transfer functions are derived for a time invariant, steady state, fading memory filter. These can be applied in loop filter implementation of the Deep Space Network (DSN) Advanced Receiver carrier phase locked loop (PLL).

Statman, J. I.↗

Equations For Fading-Memory Filters

Report discusses simplified recursive solutions for equations of class of fading-memory filters. Under appropriate assumptions regarding noise and exponential decay of effects of previous states, filter equations reduced to analytic formulas in closed form.

Statman, J. I.↗

Multi-Pass Sequential Mini-Batch Stochastic Gradient Descent Algorithms for Noise Covariance Estimation in Adaptive Kalman Filtering

Estimation of unknown noise covariances in a Kalman filter is a problem of significant practical interest in a wide array of applications. Although this problem has a long history, reliable algorithms for their estimation were scant, and necessary and sufficient conditions for identifiability of the covariances were in dispute until recently. Necessary and sufficient conditions for covariance estimation and a batch estimation algorithm were presented in our previous study. This paper presents stochastic gradient descent algorithms for noise covariance estimation in adaptive Kalman filters that are an order of magnitude faster than the batch method for similar or better root mean square error. More significantly, these algorithms are applicable to non-stationary systems where the noise covariances can occasionally jump up or down by an unknown magnitude. The computational efficiency of the new algorithms stems from adaptive thresholds for convergence, recursive fading memory estimation of the sample cross-correlations of the innovations, and accelerated stochastic gradient descent algorithms. The comparative evaluation of the proposed methods on a number of test cases demonstrates their computational efficiency and accuracy.

Adaptive Kalman filtering↗

Performance analysis of replication ALOHA for fading mobile communications channels

This paper describes an ALOHA random access protocol for fading communications channels. A two-state Markov model is used for the channel error process to account for the channel fading memory. The ALOHA protocol is modified to send multiple contiguous copies of a message at each transmission attempt. Both pure and slotted ALOHA channels are considered. The analysis is applicable to fading environments where the channel memory is short compared to the propagation delay. It is shown that smaller delay may be achieved using replications and, in noisy conditions, can also improve throughput.

Yan, Tsun-Yee↗

Waves in materials with memory. V.

One-dimensional acceleration waves and higher order waves propagating in general nonlinear Maxwellian materials with fading memory

VISCOELASTICITY↗

Performance of DPSK with convolutional encoding on time-varying fading channels

The bit error probability performance of a differentially-coherent phase-shift keyed (DPSK) modem with convolutional encoding and Viterbi decoding on time-varying fading channels is examined. Both the Rician and the lognormal channels are considered. Bit error probability upper bounds on fully-interleaved (zero-memory) fading channels are derived and substantiated by computer simulation. It is shown that the resulting coded system performance is a relatively insensitive function of the choice of channel model provided that the channel parameters are related according to the correspondence developed as part of this paper. Finally, a comparison of DPSK with a number of other modulation strategies is provided.

Mui, S. Y.↗

Performance analysis of the ALOHA protocol with replication in a fading channel for the Mobile Satellite Experiment

The analysis of the ALOHA random access protocol for communications channels with fading is presented. The protocol is modified to send multiple contiguous copies of a message at each transmission attempt. Both pure and slotted ALOHA channels are considered. A general two state model is used for the channel error process to account for the channel fading memory. It is shown that greater throughput and smaller delay may be achieved using repetitions. The model is applied to the analysis of the delay-throughput performance in a fading mobile communications environment. Numerical results are given for NASA's Mobile Satellite Experiment.

Clare, L. P.↗

Astronautics and Aeronautics, 1966

At the opening of the tenth year in the era of man’s mobility in outer space, we can look back on 1966 as offering convincing evidence that the United States had gained great competence. This evidence included: five orbital space flights by ten Gemini astronauts; four lunar missions undertaking the orbiting of and soft landing on the moon; numerous contributions to scientific knowledge by unmanned spacecraft and sounding rockets; and further demonstrations of the practical utility of operational space systems, including weather and communications satellites. During 1966, a record 100 American spacecraft were placed into earth orbit or on escape trajectories. Thousands of revealing and useful pictures of the earth were taken from space and of the moon from lunar orbit and on its surface. The Gemini program ended with rendezvous and docking experiments and extravehicular activity by the Gemini test pilots as the Apollo R&D test flights leading to the manned lunar mission came into the schedule. Thirty-five major scientific, technological, and operational milestones were cited for 1966 by the President in his Report to the Congress on aeronautical and space activities of the United States. This was one measure of the American commitment to share in the peaceful exploration of space for all mankind. Another was our support of the final steps toward a United Nations space treaty, undertaken to ensure that the peaceful exploitation of space had juridical basis in international law. Spectacular as some events in the space venture were in 1966, they nonetheless came to have diminished novelty in the eyes of many laymen. The multitude of both important and unspectacular space activities attained almost an accepted and routine place. This volume, as well as its predecessor chronicles, offers a ready reference on the major as well as the less-well known events. Beyond the welter of documented details on the complex nature of aeronautical and space related events and their impact, this volume helps to provide a better perspective upon today as we contemplate tomorrow. Such intent also serves future historians and analysts who cannot be unmindful of what is herein presented. When the Congress created the National Aeronautics and Space Administration in 1958, it charged NASA with the responsibility to “contribute materially to . . . the expansion of human knowledge of phenomena in the atmosphere and space’’ and to “provide for the widest practical and appropriate dissemination of information concerning its activities and results thereof.” NASA has attempted to do this and to include documentation for the historical record. The relating of NASA history begins with this day-by day chronicle and leads to more specialized studies and histories of the unprecedented task of extending man’s mobility and understanding beyond his planet. While a chronology cannot in itself serve as a full-fledged history, the size of this annual volume alone is illustrative of the scope and complexity of the historical task yet to be completed as memories fade and the records disappear.

SPACE PROBE↗

On-board orbit determination for application satellites

A proposal for onboard orbit determination which would rely entirely on reference Doppler beacons located within the Continental United States is presented. Algorithms were conceived which were compatible with small computing machines and sufficiently accurate to maintain an adequate satellite ephemeris. An on board computer equipped with a recursive filter with a fading memory to account for dynamic modeling errors and two reference beacons was found to be necessary for the system to work.

Morduch, G. E.↗

On-board orbit determination for applications satellites

An algorithm for satellite orbit determination is described which would be suitable for use with an on-board computer with limited core storage. The proposed filter is recursive on a pass-by-pass basis and features a fading memory to account for the effect of gravity field error. Only a single pass of Doppler data needs to be stored at any time and the data may be acquired from two reference beacons located within the Continental United States. The results of both simulated data and real data reductions demonstrate that the satellite's position can be determined to within one kilometer when a 4 x 4 recovery field is used.

Morduch, G. E.↗

A comparison of methods for DPLL loop filter design

Four design methodologies for loop filters for a class of digital phase-locked loops (DPLLs) are presented. The first design maps an optimum analog filter into the digital domain; the second approach designs a filter that minimizes in discrete time weighted combination of the variance of the phase error due to noise and the sum square of the deterministic phase error component; the third method uses Kalman filter estimation theory to design a filter composed of a least squares fading memory estimator and a predictor. The last design relies on classical theory, including rules for the design of compensators. Linear analysis is used throughout the article to compare different designs, and includes stability, steady state performance and transient behavior of the loops. Design methodology is not critical when the loop update rate can be made high relative to loop bandwidth, as the performance approaches that of continuous time. For low update rates, however, the miminization method is significantly superior to the other methods.

Aguirre, S.↗

High dynamic GPS receiver using maximum likelihood estimation and frequency tracking

A new high dynamic global positioning system (GPS) receiver is presented and its performance characterized by analysis, simulation, and demonstration. The demonstration receiver is a breadboard model capable of tracking a single simulated satellite signal in pseudorange and range rate. Pseudorange and range rate estimates are made once every 20 ms, using a maximum likelihood estimator, and are tracked by means of a third-order fading memory filter in a feedback configuration. The receiver tracks pseudorange with rms errors of under 1 m when subjected to simulated 50 g, 40 g/s circular trajectories. The tracking threshold is approximately 28 dB-Hz, which provides 12 dB margin relative to the minimum specified signal strength, assuming 3.5 dB system noise figure and 0 dBi antenna gain.

Hurd, W. J.↗

Convolutional code performance in the Rician fading channel

The performance of short constraint length convolutional codes in conjunction with binary phase-shift keyed (BPSK) modulation and Viterbi maximum likelihood decoding on the classical Rician fading channel is examined in detail. Primary interest is in the bit error probability performance as a function of E sub b/N sub 0 parameterized by the fading channel parameters. Fairly general upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results in the two extremes of zero channel memory and infinite channel memory. The efficacy of simple block interleaving in combating the memory of the channel is thoroughly explored. Results include the effects of fading on tracking loop performance and the subsequent impact on overall coded system performance. The approach is analytical where possible; otherwise resort is made to digital computer simulation.

Modestino, J. W.↗

Parallelized Convolutional Interleaver Implementation for Efficient DDR Memory Access

Convolutional interleavers are used in many different communications systems to correct for burst errors due to atmospheric fades and scintillation. The interleaver size is related to the channel coherence time and the data rate. Small convolutional interleavers can be implemented in a field programmable gate array (FPGA) block random access memory (BRAM). However, large interleavers exceeding the size of the BRAM on the FPGA are necessary for channels with longer fades and higher data rates. Therefore, an implementation utilizing double data rate (DDR) memory external to the FPGA is necessary. Wide DDR memory data buses can make the use of DDR memory for convolutional interleavers inefficient when individual symbols are written to and read from the memory. DDR memory operational speeds can also limit the data rate of the interleaver. The Consultative Committee for Space Data Systems (CCSDS) Optical Communications High Photon Efficiency (HPE) standard utilizes a convolutional channel symbol interleaver. A previous implementation of the HPE standard utilized BRAM for the convolutional interleaver, but mission requirements for the upcoming Optical Artemis-2 Orion (O2O) communications demonstration dictate the use of an interleaver exceeding the size of the BRAM. An algorithm and method for implementing the convolutional interleaver in the FPGA with DDR memory is described in this paper.

optical communications↗

Parallelized convolutional interleaver implementation for efficient DDR memory access

Convolutional interleavers are used in many different communications systems to correct for burst errors due to atmospheric fades and scintillation. The interleaver size is related to the channel coherence time and the data rate. Small convolutional interleavers can be implemented in a field programmable gate array (FPGA) block random access memory (BRAM). However, large interleavers exceeding the size of the BRAM on the FPGA are necessary for channels with longer fades and higher data rates. Therefore, an implementation utilizing double data rate (DDR) memory external to the FPGA is necessary. Wide DDR memory data buses can make the use of DDR memory for convolutional interleavers inefficient when individual symbols are written to and read from the memory. DDR memory operational speeds can also limit the data rate of the interleaver. The Consultative Committee for Space Data Systems (CCSDS) Optical Communications High Photon Efficiency (HPE) standard utilizes a convolutional channel symbol interleaver. A previous implementation of the HPE standard utilized BRAM for the convolutional interleaver, but mission requirements for the upcoming Optical Artemis-2 Orion (O2O) communications demonstration dictate the use of an interleaver exceeding the size of the BRAM. An algorithm and method for implementing the convolutional interleaver in the FPGA with DDR memory is described in this paper.

Optical communications↗