The use of Gaussian functions in radio astronomy source measurements
Gaussian distribution analysis of radio source observation
SEARCH · Engineering Papers
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.
Gaussian distribution analysis of radio source observation
Signal to noise threshold behavior for sinusoidal and Gaussian modulation using Rice-Ridgeway criteria
Output autocorrelation properties of ideal limiters driven by binary deterministic signal plus stationary zero-mean Gaussian noise
Signal design for Gaussian noise and intersymbol interference immunity, discussing bandlimited signals and maximum likelihood detection technique
Gaussian source model of image, deriving rate distortion function under mean square error criterion
Coding for feedback communication system with additive white Gaussian noise, using mean-square estimation error
Book on detection, estimation and modulation theory, Part 3, Gaussian and radar-sonar signals in noise, covering point targets, random process and scatter channels
Random numbers were generated with the aid of a digital computer and transformed such that the probability density function of a discrete random load history composed of these random numbers had one of the following non-Gaussian distributions: Poisson, binomial, log-normal, Weibull, and exponential. The resulting random load histories were analyzed to determine their peak statistics and were compared with cumulative peak maneuver-load distributions for fighter and transport aircraft in flight.
A digital system has been constructed for the generation of wideband Gaussian noise with a spectrum which is flat to within plus or minus 0.5 dB from 0 to 10 MHz. These characteristics are substantially better than those of commercially available analog noise generators, and are required in testing and simulation of wideband communications systems. The noise is generated by the analog summation of thirty essentially independent binary waveforms, clocked at 35 MHz, and low-pass filtered to 10 MHz.
This paper presents the derivation of the recursive algorithms necessary for real-time digital detection of M-ary known signals that are subject to independent multiplicative and additive Gaussian noises. The motivating application is minimum probability of error detection of digital data-link messages aboard civil aircraft in the earth reflection multipath environment. For each known signal, the detector contains one Kalman filter and one probability computer. The filters estimate the multipath disturbance. The estimates and the received signal drive the probability computers. Outputs of all the computers are compared in amplitude to give the signal decision. The practicality and usefulness of the detector are extensively discussed.
A method is described for generating time histories which model the frequency content and certain non-Gaussian probability characteristics of atmospheric turbulence including the large gusts and patchy nature of turbulence. Methods for time histories using either analog or digital computation are described. A STOL airplane was programmed into a 6-degree-of-freedom flight simulator, and turbulence time histories from several atmospheric turbulence models were introduced. The pilots' reactions are described.
An all digital phase locked loop which tracks the phase of the incoming sinusoidal signal once per carrier cycle is proposed. The different elements and their functions and the phase lock operation are explained in detail. The nonlinear difference equations which govern the operation of the digital loop when the incoming signal is embedded in white Gaussian noise are derived, and a suitable model is specified. The performance of the digital loop is considered for the synchronization of a sinusoidal signal. For this, the noise term is suitably modelled which allows specification of the output probabilities for the two level quantizer in the loop at any given phase error. The loop filter considered increases the probability of proper phase correction. The phase error states in modulo two-pi forms a finite state Markov chain which enables the calculation of steady state probabilities, RMS phase error, transient response and mean time for cycle skipping.
Tree codes are known to be capable of performing arbitrarily close to the rate-distortion function for any memoryless source and single-letter fidelity criterion. Tree coding and tree search strategies are investigated for the discrete-time memoryless Gaussian source encoded for a signal-power-to-mean-squared-error ratio of about 30 dB (about 5 binary digits per source output). Also, a theoretical lower bound on average search effort is derived. Two code search strategies (the Viterbi algorithm and the stack algorithm) were simulated in assembly language on a large digital computer. After suitable modifications, both strategies yielded encoding with a signal-to-distortion ratio about 1 dB below the limit set by the rate-distortion function. Although this performance is better than that of any previously known instrumentable scheme, it unfortunately requires search computation of the order of 100,000 machine cycles per source output encoded.
Two weighted adaptive algorithms are proposed for updating the estimates of the mean vector and the covariance matrix, respectively, in a multispectral pattern recognition system. To achieve computational efficiency, the auxiliary matrices have been utilized in the algorithm for covariance matrix updating. Enhancements in the performance accuracy of a multispectral processing system and extensions of the Gaussian maximum likelihood classification capabilities to larger scale surveys are the motivations in developing the algorithms presented herein.
This analysis utilizes computer simulation and statistical estimation. Realizations of stationary gaussian stochastic processes with selected autocorrelation functions are computer simulated. Analysis of the simulated data revealed that the mean and the variance of a process were functionally dependent upon the autocorrelation parameter and crossing level. Using predicted values for the mean and standard deviation, by the method of moments, the distribution parameters was estimated. Thus, given the autocorrelation parameter, crossing level, mean, and standard deviation of a process, the probability of exceeding the crossing level for a particular length of time was calculated.
Computer programs for computing Gaussian quadrature abscissas and weights are described. For the classical case the programs use Laguerre iteration to compute abscissas as zeros of orthogonal polynomials. The polynomials are evaluated from known recursion coefficients. The nonclassical case is handled similarly except that the recursion coefficients are computed by numerical integration. A sample problem, with input and output, is presented to illustrate the use of the programs. It computes the quadrature abscissas and weights associated with the weight function over the interval (0,1) for quadrature orders from 16 to 96 in increments of 8.
The parameters of non-uniform and uniform quantizers up to ten bits of quantization, optimum for a Gaussian input probability and for the magnitude-error distortion criterion are computed. Optimum quantizers must be understood as quantizers with minimum distortion. The numerical method used for the optimization converges relatively rapidly. The comparison between optimum non-uniform quantizers and optimum uniform quantizers is made.
A computational algorithm is presented for the extraction of an optimal single linear feature from several Gaussian pattern classes. The algorithm minimizes the increase in the probability of misclassification in the transformed (feature) space. Numerical results on the application of this procedure to the remotely sensed data from the Purdue Cl flight line as well as LANDSAT data are presented. It was found that classification using the optimal single linear feature yielded a value for the probability of misclassification on the order of 30% less than that obtained by using the best single untransformed feature. Also, the optimal single linear feature gave performance results comparable to those obtained by using the two features which maximized the average divergence.