Search NASASearch

SEARCH · Search NASA

Results for “transform”

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 91 records · Page 5

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

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.

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

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.

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.

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.

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.

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.

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.

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

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

Substrate flexibility regulates growth and apoptosis of normal but not transformed cells

One of the hallmarks of oncogenic transformation is anchorage-independent growth (27). Here we demonstrate that responses to substrate rigidity play a major role in distinguishing the growth behavior of normal cells from that of transformed cells. We cultured normal or H-ras-transformed NIH 3T3 cells on flexible collagen-coated polyacrylamide substrates with similar chemical properties but different rigidity. Compared with cells cultured on stiff substrates, nontransformed cells on flexible substrates showed a decrease in the rate of DNA synthesis and an increase in the rate of apoptosis. These responses on flexible substrates are coupled to decreases in cell spreading area and traction forces. In contrast, transformed cells maintained their growth and apoptotic characteristics regardless of substrate flexibility. The responses in cell spreading area and traction forces to substrate flexibility were similarly diminished. Our results suggest that normal cells are capable of probing substrate rigidity and that proper mechanical feedback is required for regulating cell shape, cell growth, and survival. The loss of this response can explain the unregulated growth of transformed cells.

Non-NASA Center

Volume and Mass Estimation of Three-Phase High Power Transformers for Space Applications

Spacecraft historically have had sub-1kW(sub e), electrical requirements for GN&C, science, and communications: Galileo at 600W(sub e), and Cassini at 900W(sub e), for example. Because most missions have had the same order of magnitude power requirements, the Power Distribution Systems (PDS) use existing, space-qualified technology and are DC. As science payload and mission duration requirements increase, however, the required electrical power increases. Subsequently, this requires a change from a passive energy conversion (solar arrays and batteries) to dynamic (alternator, solar dynamic, etc.), because dynamic conversion has higher thermal and conversion efficiencies, has higher power densities, and scales more readily to higher power levels. Furthermore, increased power requirements and physical distribution lengths are best served with high-voltage, multi-phase AC to maintain distribution efficiency and minimize voltage drops. The generated AC-voltage must be stepped-up (or down) to interface with various subsystems or electrical hardware. Part of the trade-space design for AC distribution systems is volume and mass estimation of high-power transformers. The volume and mass are functions of the power rating, operating frequency, the ambient and allowable temperature rise, the types and amount of heat transfer available, the core material and shape, the required flux density in a core, the maximum current density, etc. McLyman has tabulated the performance of a number of transformers cores and derived a "cookbook" methodology to determine the volume of transformers, whereas Schawrze had derived an empirical method to estimate the mass of single-phase transformers. Based on the work of McLyman and Schwarze, it is the intent herein to derive an empirical solution to the volume and mass estimation of three-phase, laminated EI-core power transformers, having radiated and conducted heat transfer mechanisms available. Estimation of the mounting hardware, connectors, etc. is not included.

Kimnach, Greg L.

On the Hilbert-Huang Transform Theoretical Developments

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). Both carry strong a-priori assumptions about the source data, such as linearity, of being stationary, and of satisfying the Dirichlet conditions. A 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 a-posteriori data processing based on the Empirical Mode Decomposition (EMD) sifting process (algorithm), followed by the normalized Hilbert Transform of the decomposition data, the HHT allows spectrum analysis of nonlinear and nonstationary data. The EMD sifting process results in a non-constrained decomposition of a source real value data vector into a finite set of Intrinsic Mode Functions (IMF). These functions form a near orthogonal adaptive basis, a basis that is derived from the data. The IMFs can be further analyzed for spectrum interpretation by the classical Hilbert Transform. A new engineering spectrum analysis tool using HHT has been developed at NASA GSFC, the HHT Data Processing System (HHT-DPS). As the HHT-DPS has been successfully used and commercialized, new applications post additional questions about the theoretical basis behind the HHT and EMD algorithms. Why is the fastest changing component of a composite signal being sifted out first in the EMD sifting process? Why does the EMD sifting process seemingly converge and why does it converge rapidly? Does an IMF have a distinctive structure? Why are the IMFs near orthogonal? We address these questions and develop the initial theoretical background for the HHT. This will contribute to the developments of new HHT processing options, such as real-time and 2-D processing using Field Programmable Array (FPGA) computational resources, enhanced HHT synthesis, and broaden the scope of HHT applications for signal processing.

Kizhner, Semion

On Certain Theoretical Developments Underlying the Hilbert-Huang Transform

One of the main traditional tools used in scientific and engineering data spectral analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). Both carry strong a-priori assumptions about the source data, such as being linear and stationary, and of satisfying the Dirichlet conditions. A 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 spectral analysis problems. Using a-posteriori data processing based on the Empirical Mode Decomposition (EMD) sifting process (algorithm), followed by the normalized Hilbert Transform of the decomposed data, the HHT allows spectral analysis of nonlinear and nonstationary data. The EMD sifting process results in a non-constrained decomposition of a source real-value data vector into a finite set of Intrinsic Mode Functions (IMF). These functions form a nearly orthogonal derived from the data (adaptive) basis. The IMFs can be further analyzed for spectrum content by using the classical Hilbert Transform. A new engineering spectral analysis tool using HHT has been developed at NASA GSFC, the HHT Data Processing System (HHT-DPS). As the HHT-DPS has been successfully used and commercialized, new applications pose additional questions about the theoretical basis behind the HHT and EMD algorithms. Why is the fastest changing component of a composite signal being sifted out first in the EMD sifting process? Why does the EMD sifting process seemingly converge and why does it converge rapidly? Does an IMF have a distinctive structure? Why are the IMFs nearly orthogonal? We address these questions and develop the initial theoretical background for the HHT. This will contribute to the development of new HHT processing options, such as real-time and 2-D processing using Field Programmable Gate Array (FPGA) computational resources,

Kizhner, Semion

Computing Instantaneous Frequency by normalizing Hilbert Transform

This invention presents Normalized Amplitude Hilbert Transform (NAHT) and Normalized Hilbert Transform(NHT), both of which are new methods for computing Instantaneous Frequency. This method is designed specifically to circumvent the limitation set by the Bedorsian and Nuttal Theorems, and to provide a sharp local measure of error when the quadrature and the Hilbert Transform do not agree. Motivation for this method is that straightforward application of the Hilbert Transform followed by taking the derivative of the phase-angle as the Instantaneous Frequency (IF) leads to a common mistake made up to this date. In order to make the Hilbert Transform method work, the data has to obey certain restrictions.

Huang, Norden E.

Architecture for time or transform domain decoding of reed-solomon codes

Two pipeline (255,233) RS decoders, one a time domain decoder and the other a transform domain decoder, use the same first part to develop an errata locator polynomial .tau.(x), and an errata evaluator polynominal A(x). Both the time domain decoder and transform domain decoder have a modified GCD that uses an input multiplexer and an output demultiplexer to reduce the number of GCD cells required. The time domain decoder uses a Chien search and polynomial evaluator on the GCD outputs .tau.(x) and A(x), for the final decoding steps, while the transform domain decoder uses a transform error pattern algorithm operating on .tau.(x) and the initial syndrome computation S(x), followed by an inverse transform algorithm in sequence for the final decoding steps prior to adding the received RS coded message to produce a decoded output message.

Shao, Howard M.

When Deriving the Spatial QRS-T Angle from the 12-lead ECG, which Transform is More Frank: Regression or Inverse Dower?

Our primary objective was to ascertain which commonly used 12-to-Frank-lead transformation yields spatial QRS-T angle values closest to those obtained from simultaneously collected true Frank-lead recordings. Simultaneous 12-lead and Frank XYZ-lead recordings were analyzed for 100 post-myocardial infarction patients and 50 controls. Relative agreement, with true Frank-lead results, of 12-to-Frank-lead transformed results for the spatial QRS-T angle using Kors regression versus inverse Dower was assessed via ANOVA, Lin s concordance and Bland-Altman plots. Spatial QRS-T angles from the true Frank leads were not significantly different than those derived from the Kors regression-related transformation but were significantly smaller than those derived from the inverse Dower-related transformation (P less than 0.001). Independent of method, spatial mean QRS-T angles were also always significantly larger than spatial maximum (peaks) QRS-T angles. Spatial QRS-T angles are best approximated by regression-related transforms. Spatial mean and spatial peaks QRS-T angles should also not be used interchangeably.

Schlegel, Todd T.