SEARCH · Engineering Papers

Results for “Transforms”

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.

SourceResearch connectionFrom yearThrough year

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

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

NASA NTRS1978

A fast D.F.T. algorithm using complex integer transforms

Winograd (1976) has developed a new class of algorithms which depend heavily on the computation of a cyclic convolution for computing the conventional DFT (discrete Fourier transform); this new algorithm, for a few hundred transform points, requires substantially fewer multiplications than the conventional FFT algorithm. Reed and Truong have defined a special class of finite Fourier-like transforms over GF(q squared), where q = 2 to the p power minus 1 is a Mersenne prime for p = 2, 3, 5, 7, 13, 17, 19, 31, 61. In the present paper it is shown that Winograd's algorithm can be combined with the aforementioned Fourier-like transform to yield a new algorithm for computing the DFT. A fast method for accurately computing the DFT of a sequence of complex numbers of very long transform-lengths is thus obtained.

Reed, I. S.↗

NASA NTRS1979

Computing the Fast Fourier Transform on a vector computer

Two algorithms are presented for performing a Fast Fourier Transform on a vector computer and are compared on the Control Data Corporation STAR-100. The relative merits of the two algorithms are shown to depend upon whether only a few or many independent transforms are desired. A theorem is proved which shows that a set of independent transforms can be computed by performing a partial transformation on a single vector. The results of this theorem also apply to nonvector machines and have reduced the average time per transform by a factor of two on the CDC 6600 computer.

Korn, D. G.↗

NASA NTRS1979

Comparison between thermochemical and phase stability data for the quartz-coesite-stishovite transformations

Phase stability and elasticity data have been used to calculate the Gibbs free energy, enthalpy, and entropy changes at 298 K and 1 bar associated with the quartz-coesite and coesite-stishovite transformations in the system SiO2. For the quartz-coesite transformation, these changes disagree by a factor of two or three with those obtained by calorimetric techniques. The phase boundary for this transformation appears to be well determined by experiment; the discrepancy, therefore, suggests that the calorimetric data for coesite are in error. Although the calorimetric and phase stability data for the coesite-stishovite transformation yield the same transition pressure at 298 K, the phase-boundary slopes disagree by a factor of two. At present, it is not possible to determine which of the data are in error. Thus serious inconsistencies exist in the thermodynamic data for the polymorphic transformations of silica.

Weaver, J. S.↗

NASA NTRS1982

Transformation of the diamond /110/ surface

The diamond surface undergoes a transformation in its electronic structure by a vacuum anneal at approximately 900 C. This transformation is characterized by the appearance of a feature in the band gap region of the energy loss spectrum. The kinetics of the transformation on the (110) surface is studied by observing the growth of this feature with time and temperature. The transformation is found to be consistent with first-order kinetics with an activation energy of 4.8 eV. It is also found that the band gap feature could be removed by exposure of the transformed surface to excited hydrogen. The results are consistent with the polished diamond (110) surface being covered with hydrogen which removes the band gap states and can be thermally desorbed at approximately 900 C.

Pepper, S. V.↗

NASA NTRS1982

Theory of design using nonlinear transformations

This paper is presenting an overview of the theory of transformations from nonlinear systems to linear systems. Topics covered include (1) necessary and sufficient conditions for transformations to exist, (2) a method of constructing transformations (3) robustness in design (based on transformations theory) and Liapunov functions, (4) estimation theory, and (5) the relationship between transformation theory and 'nonlinear zeros'. Application of these results to automatic flight control is presented in another paper at this session.

Su, R.↗

NASA NTRS1984

Near field to far field transformations and multiple beam forming and steering

The feasibility of acoustic verification of microwave near field to far field transformation algorithms using the Phased Array Sonic Simulation System was studied. Existing electromagnetic near field measurement techniques and transformation algorithms (equations) were investigated. It was analytically determined that acoustic verification is valid. Acoustic simulation of electromagnetic near field to far field transformations is emphasized. The acoustic simulation of electromagnetic near field to far field transformation is verified for the modal expansion method. In the modal expansion method, data from antenna near field measurements are converted to a summation or spectrum of modes corresponding to wave numbers in the measurement coordinate system. Fourier transformation of those measurements preserves the far field information in a spectral form that is then readily extractable.

Source record↗

NASA NTRS1987

Tail modeling in a stretched magnetosphere. I - Methods and transformations

A new method is developed for representing the magnetospheric field B as a distorted dipole field. Because Delta-B = 0 must be maintained, such a distortion may be viewed as a transformation of the vector potential A. The simplest form is a one-dimensional 'stretch transformation' along the x axis, concisely represented by the 'stretch function' f(x), which is also a convenient tool for representing features of the substorm cycle. One-dimensional stretch transformations are extended to spherical, cylindrical, and parabolic coordinates and then to arbitrary coordinates. It is shown that distortion transformations can be viewed as mappings of field lines from one pattern to another; the final result only requires knowledge of the field and not of the potentials. General transformations in Cartesian and arbitrary coordinates are derived, and applications to field modeling, field line motion, MHD modeling, and incompressible fluid dynamics are considered.

Stern, David P.↗

NASA NTRS1986

Dose protraction studies with low- and high-LET radiations on neoplastic cell transformation in vitro

The effects of the low- and high-LET radiation (by X-rays, Co-60, and heavy ions) on the transformation of neoplastic cells were studied using cultured C3H10T1/2 mouse embryo cells. The transformed colonies in the confluent cell monolayers were recognized as focuses composed of highly polar fibroblastic multilayered criss-cross arrays of densely stained cells. For the low-LET radiation, there was a decrease in cell killing and cell transformation frequency when cells were irradiated with fractionated doses and at a low dose rate, indicating that cultured mammalian cells can repair both subtransformation and potential transformation lesions. No sparing effect, however, was found for the high-LET radiation. An enhancement of cell transformation was observed for low-dose/rate argon (400 MeV/u; 120 keV/micron) and iron particles (600 MeV/u; 200 keV/micron). The molecular mechanism for this enhancement effect is not known.

Yang, Tracy Chui-Hsu↗

NASA NTRS1990

Optimal block cosine transform image coding for noisy channels

The two dimensional block transform coding scheme based on the discrete cosine transform was studied extensively for image coding applications. While this scheme has proven to be efficient in the absence of channel errors, its performance degrades rapidly over noisy channels. A method is presented for the joint source channel coding optimiaation of a scheme based on the 2-D block cosine transorm when the output of the encoder is to be transmitted via a memoryless design of the quantizers used for encoding the transform coefficients. This algorithm produces a set of locally optimum quantizers and the corresponding binary code assignment for the assumed transform coefficient statistics. To determine the optimum bit assignment among the transform coefficients, an algorithm was used based on the steepest descent method, which under certain convexity conditions on the performance of the channel optimized quantizers, yields the optimal bit allocation. Comprehensive simulation results for the performance of this locally optimum system over noise channels were obtained and appropriate comparisons against a reference system designed for no channel error were rendered.

Vaishampayan, Vinay A.↗

NASA NTRS1989

Ordered fast fourier transforms on a massively parallel hypercube multiprocessor

Design alternatives for ordered Fast Fourier Transformation (FFT) algorithms were examined on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication which is known to dominate the overall computing time. To this end, the order and computational phases of the FFT were combined, and the sequence to processor maps that reduce communication were used. The class of ordered transforms is expanded to include any FFT in which the order of the transform is the same as that of the input sequence. Two such orderings are examined, namely, standard-order and A-order which can be implemented with equal ease on the Connection Machine where orderings are determined by geometries and priorities. If the sequence has N = 2 exp r elements and the hypercube has P = 2 exp d processors, then a standard-order FFT can be implemented with d + r/2 + 1 parallel transmissions. An A-order sequence can be transformed with 2d - r/2 parallel transmissions which is r - d + 1 fewer than the standard order. A parallel method for computing the trigonometric coefficients is presented that does not use trigonometric functions or interprocessor communication. A performance of 0.9 GFLOPS was obtained for an A-order transform on the Connection Machine.

Tong, Charles↗

NASA NTRS1991

The fractional Fourier transform and applications

This paper describes the 'fractional Fourier transform', which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e exp -2(pi)i/n, the fractional Fourier transform is based on fractional roots of unity e exp -2(pi)i(alpha), where alpha is arbitrary. The fractional Fourier transform and the corresponding fast algorithm are useful for such applications as computing DFTs of sequences with prime lengths, computing DFTs of sparse sequences, analyzing sequences with noninteger periodicities, performing high-resolution trigonometric interpolation, detecting lines in noisy images, and detecting signals with linearly drifting frequencies. In many cases, the resulting algorithms are faster by arbitrarily large factors than conventional techniques.

Bailey, David H.↗

NASA NTRS1992

Canonical transformations for space trajectory optimization

Canonical transformations are developed between the Cartesian coordinates, equinoctial elements, trajectory variables, and orbital elements for coplanar space trajectory optimization problems. The canonical transformations permit the state and adjoint or their solution, transversality conditions, the optimal control, and integrals of the motion, to be transformed between any of the common sets of coordinates for planar space trajectory optimization problems. Variations on the canonical transformations shown are straightforward to develop given the group properties of the canonical transformations.

Haissig, Christine M.↗

NASA NTRS1993

Non-gauge phase transformations in quantum transition amplitudes

The prescription for introducing a gauge transformation into a quantum transition amplitude, nominally well known, contains an ambiguous feature. It is presumed by some authors that an appropriate transformation of the phase of a wave function will generate the associated gauge transformation. It is shown that this is a necessary but not sufficient step. Examples from the literature are cited to show the consequences of the failure of this procedure. One must distinguish between true gauge transformations and unitary transformations within a fixed gauge.

Reiss, H. R.↗

NASA NTRS1991

Integer cosine transform for image compression

This article describes a recently introduced transform algorithm called the integer cosine transform (ICT), which is used in transform-based data compression schemes. The ICT algorithm requires only integer operations on small integers and at the same time gives a rate-distortion performance comparable to that offered by the floating-point discrete cosine transform (DCT). The article addresses the issue of implementation complexity, which is of prime concern for source coding applications of interest in deep-space communications. Complexity reduction in the transform stage of the compression scheme is particularly relevant, since this stage accounts for most (typically over 80 percent) of the computational load.

Cheung, K.-M.↗

NASA NTRS1993

Oceanic transform earthquakes with unusual mechanisms or locations - Relation to fault geometry and state of stress in the adjacent lithosphere

Results are presented of a search for transform earthquakes departing from the pattern whereby they occur on the principal transform displacement zone (PTDZ) and have strike-slip mechanisms consistent with transform-parallel motion. The search was conducted on the basis of source mechanisms and locations taken from the Harvard centroid moment tensor catalog and the bulletin of the International Seismological Center. The source mechanisms and centroid depths of 10 such earthquakes on the St. Paul's, Marathon, Owen, Heezen, Tharp, Menard, and Rivera transforms are determined from inversions of long-period body waveforms. Much of the anomalous earthquake activity on oceanic transforms is associated with complexities in the geometry of the PTDZ or the presence of large structural features that may influence slip on the fault.

Wolfe, Cecily J.↗

NASA NTRS1994

Improved image decompression for reduced transform coding artifacts

The perceived quality of images reconstructed from low bit rate compression is severely degraded by the appearance of transform coding artifacts. This paper proposes a method for producing higher quality reconstructed images based on a stochastic model for the image data. Quantization (scalar or vector) partitions the transform coefficient space and maps all points in a partition cell to a representative reconstruction point, usually taken as the centroid of the cell. The proposed image estimation technique selects the reconstruction point within the quantization partition cell which results in a reconstructed image which best fits a non-Gaussian Markov random field (MRF) image model. This approach results in a convex constrained optimization problem which can be solved iteratively. At each iteration, the gradient projection method is used to update the estimate based on the image model. In the transform domain, the resulting coefficient reconstruction points are projected to the particular quantization partition cells defined by the compressed image. Experimental results will be shown for images compressed using scalar quantization of block DCT and using vector quantization of subband wavelet transform. The proposed image decompression provides a reconstructed image with reduced visibility of transform coding artifacts and superior perceived quality.

Orourke, Thomas P.↗

NASA NTRS2003

On the Hilbert-Huang Transform Data Processing System Development

One of the main heritage tools used in scientific and engineering data spectrum analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). The Fourier view of nonlinear mechanics that had existed for a long time, and the associated FFT (fairly recent development), carry strong a-priori assumptions about the source data, such as linearity and of being stationary. Natural phenomena measurements are essentially nonlinear and nonstationary. A very recent development at the National Aeronautics and Space Administration (NASA) Goddard Space Flight Center (GSFC), known as the Hilbert-Huang Transform (HHT) proposes a novel approach to the solution for the nonlinear class of spectrum analysis problems. Using the Empirical Mode Decomposition (EMD) followed by the Hilbert Transform of the empirical decomposition data (HT), the HHT allows spectrum analysis of nonlinear and nonstationary data by using an engineering a-posteriori data processing, based on the EMD algorithm. This results in a non-constrained decomposition of a source real value data vector into a finite set of Intrinsic Mode Functions (IMF) that can be further analyzed for spectrum interpretation by the classical Hilbert Transform. This paper describes phase one of the development of a new engineering tool, the HHT Data Processing System (HHTDPS). The HHTDPS allows applying the "T to a data vector in a fashion similar to the heritage FFT. It is a generic, low cost, high performance personal computer (PC) based system that implements the HHT computational algorithms in a user friendly, file driven environment. This paper also presents a quantitative analysis for a complex waveform data sample, a summary of technology commercialization efforts and the lessons learned from this new technology development.

Kizhner, Semion↗

NASA NTRS2002

Chemical constraints governing the origin of metabolism: the thermodynamic landscape of carbon group transformations under mild aqueous conditions

The thermodynamics of organic chemistry under mild aqueous conditions was examined in order to begin to understand its influence on the structure and operation of metabolism and its antecedents. Free energies (deltaG) were estimated for four types of reactions of biochemical importance carbon-carbon bond cleavage and synthesis, hydrogen transfer between carbon groups, dehydration of alcohol groups, and aldo-keto isomerization. The energies were calculated for mainly aliphatic groups composed of carbon, hydrogen, and oxygen. The energy values showed (1) that generally when carbon-carbon bond cleavage involves groups from different functional group classes (i.e., carboxylic acids, carbonyl groups, alcohols, and hydrocarbons), the transfer of the shared electron-pair to the more reduced carbon group is energetically favored over transfer to the more oxidized carbon group, and (2) that the energy of carbon-carbon bond transformation is primarily determined by the functional group class of the group that changes oxidation state in the reaction (i.e., the functional group class of the group that donates the shared electron-pair during cleavage, or that accepts the incipient shared electron-pair during synthesis). In contrast, the energy of hydrogen transfer between carbon groups is determined by the functional group class of both the hydrogen-donor group and the hydrogen-acceptor group. From these and other observations we concluded that the chemistry involved in the origin of metabolism (and to a lesser degree modern metabolism) was strongly constrained by (1) the limited redox-based transformation energy of organic substrates that is readily dissipated in a few energetically favorable irreversible reactions; (2) the energy dominance of a few transformation half-reactions that determines whether carbon-carbon bond transformation (cleavage or synthesis) is energetically favorable (deltaG < -3.5 kcal/mol), reversible (deltaG between +/-3.5 kcal/mol), or unfavorable (deltaG > +3.5 kcal/mol); and (3) the dependence of carbon group transformation energy on the functional group class (i.e., oxidation state) of participating groups that in turn is contingent on prior reactions and precursors in the synthetic pathway.

Carbon/chemistry/metabolism↗