SEARCH · Engineering Papers

Results for “convolution”

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 667 records · Page 37

All sources NASA NTRS DOE OSTI

NASA NTRS1989

Stochastic modeling of crack initiation and short-crack growth under creep and creep-fatigue conditions

A simplified stochastic model is proposed for crack initiation and short-crack growth under creep and creep-fatigue conditions. Material inhomogeneity provides the random nature of crack initiation and early growth. In the model, the influence of microstructure is introduced by the variability of: (1) damage accumulation along grain boundaries, (2) critical damage required for crack initiation or growth, and (3) the grain-boundary length. The probabilities of crack initiation and growth are derived by using convolution integrals. The model is calibrated and used to predict the crack density and crack-growth rate of short cracks of 304 stainless steel under creep and creep-fatigue conditions. The mean-crack initiation lives are predicted to be within an average deviation of about 10 percent from the experimental results. The predicted cumulative distributions of crack-growth rate follow the experimental data closely. The applicability of the simplified stochastic model is discussed and the future research direction is outlined.

Kitamura, Takayuki↗

NASA NTRS1989

Wiring Viterbi decoders (splitting deBruijn graphs)

A new Viterbi decoder, capable of decoding convolutional codes with constraint lengths up to 15, is under development for the Deep Space Network (DSN). A key feature of this decoder is a two-level partitioning of the Viterbi state diagram into identical subgraphs. The larger subgraphs correspond to circuit boards, while the smaller subgraphs correspond to Very Large Scale Integration (VLSI) chips. The full decoder is built from identical boards, which in turn are built from identical chips. The resulting system is modular and hierarchical. The decoder is easy to implement, test, and repair because it uses a single VLSI chip design and a single board design. The partitioning is completely general in the sense that an appropriate number of boards or chips may be wired together to implement a Viterbi decoder of any size greater than or equal to the size of the module.

Collins, O.↗

NASA NTRS1988

A representational framework and user-interface for an image understanding workstation

Problems in image understanding involve a wide variety of data (e.g., image arrays, edge maps, 3-D shape models) and processes or algorithms (e.g., convolution, feature extraction, rendering). The underlying structure of an Image Understanding Workstation designed to support mulitple levels and types of representations for both data and processes is described, also the user-interface. The Image Understanding Workstation consists of two parts: the Image Understanding (IU) Framework, and the user-interface. The IU Framework is the set of data and process representations. It includes multiple levels of representation for data such as images (2-D), sketches (2-D), surfaces (2 1/2 D), and models (3-D). The representation scheme for processes characterizes their inputs, outputs, and parameters. Data and processes may reside on different classes of machines. The user-interface to the IU Workstation gives the user convenient access for creating, manipulating, transforming, and displaying image data. The user-interface follows the structure of the IU Framework and gives the user control over multiple types of data and processes. Both the IU Framework and user-interface are implemented on a LISP machine.

Schroeder, Joyce D.↗

NASA NTRS1989

Orbital maneuvering vehicle teleoperation and video data compression

The Orbital Maneuvering Vehicle (OMV) and concepts of teleoperation and video data compression as applied to OMV design and operation are described. The OMV provides spacecraft delivery, retrieval, reboost, deboost and viewing services, with ground-control or Space Station operation, through autonomous navigation and pilot controlled maneuvers. Communications systems are comprised of S-band RF command, telemetry, and compressed video data links through the TDRSS and GSTDN networks. The control console video monitors display a monochrome image at an update rate of five frames per second. Depending upon the mode of operation selected by the pilot, the video resolution is either 255 x 244 pixels, or 510 x 244 pixels. Since practically all video image redundancy is removed by the compression process, the video reconstruction is particularly sensitive to data transmission bit errors. Concatenated Reed-Solomon and convolution coding are used with helical data interleaving for error detection and correction, and an error-containment process minimizes the propagation of error effects throughout the video image. Video sub-frame replacement is used, in the case of a non-correctable error or error burst, to minimize the visual impact to the pilot.

Jones, Steve↗

NASA NTRS1989

Deep space communications, weather effects, and error control

Deep space telemetry is and will remain signal-to-noise limited and vulnerable to interference. A need exists to increase received signal power and decrease noise. This includes going to Ka-band in the mid-1990's to increase directivity. The effects of a wet atmosphere can increase the noise temperature by a factor of 5 or more, even at X-band, but the order of magnitude increase in average data rate obtainable at Ka-band relative to X-band makes the increased uncertainty a good trade. Lowbit error probabilities required by data compression are available both theoretically and practically with coding, at an infinitesimal power penalty rather than the 10 to 15 dB more power required to reduce error probabilities without coding. Advances are coming rapidly in coding, as with the new constraint-length 15 rate 1/4 convolutional code concatenated with the already existing Reed-Solomon code to be demonstrated on Galileo. In addition, high density spacecraft data storage will allow selective retransmissions, even from the edge of the Solar System, to overcome weather effects. In general, deep space communication was able to operate, and will continue to operate, closer to theoretical limits than any other form of communication. These include limits in antenna area and directivity, system noise temperature, coding efficiency, and everything else. The deep space communication links of the mid-90's and beyond will be compatible with new instruments and compression algorithms and represent a sensible investment in an overall end-to-end information system design.

Posner, Edward C.↗

NASA NTRS1989

A new state reconstructor for digital controls systems using weighted-average measurements

A state reconstructor is presented for a linear continuous-time plant driven by a zero-order-hold. It takes a continuous-time output vector from the plant and convolutes it with a weighting-function matrix whose elements are time dependent. This result is integrated over T second intervals to generate weighted-averaged measurements, every T seconds, that are used in the state reconstruction process. If the plant is noise-free and can be modeled precisely, the output of this state reconstructor exactly equals the true state of the plant and accomplishes this without knowledge of the plant's initial state. If noise or modeling errors are a problem, it can be catenated with a state observer or a Kalman filter for a synergistic effect.

Polites, Michael E.↗

NASA NTRS1989

Performance of concatenated codes using 8-bit and 10-bit Reed-Solomon codes

The performance improvement of concatenated coding systems using 10-bit instead of 8-bit Reed-Solomon codes is measured by simulation. Three inner convolutional codes are considered: (7,1/2), (15,1/4), and (15,1/6). It is shown that approximately 0.2 dB can be gained at a bit error rate of 10(-6). The loss due to nonideal interleaving is also evaluated. Performance comparisons at very low bit error rates may be relevant for systems using data compression.

Pollara, F.↗

NASA NTRS1988

The discrete correlation function - A new method for analyzing unevenly sampled variability data

A method for measuring correlation functions without interpolating in the temporal domain is proposed which provides an assumption-free representation of the correlation measured in the data and allows meaningful error estimates. Physical interpretation of the cross-correlation function of two series believed to be related by a convolution is shown to require knowledge of the input function's fluctuation power spectrum. Application of the method to two systems reveals no correlation for the optical data of Akn 120, but a strong correlation for the UV data of NGC 4151, placing bounds of between 1.2 and 20 light days on the size of the line-emitting region.

Edelson, R. A.↗

NASA NTRS1988

Extraction of topography from side-looking satellite systems - A case study with SPOT simulation data

A simulated data set was used to evaluate techniques for extracting topography from side-looking satellite systems for an area of northwest Washington state. A negative transparency orthophotoquad was digitized at a spacing of 85 microns, resulting in an equivalent ground distance of 9.86 m between pixels and a radiometric resolution of 256 levels. A bilinear interpolation was performed on digital elevation model data to generate elevation data at a 9.86-m resolution. The nominal orbital characteristics and geometry of the SPOT satellite were convoluted with the data to produce simulated panchromatic HRV digital stereo imagery for three different orbital paths and techniques for reconstructing topographic data were developed. Analyses with the simulated HRV data and other data sets show that the method is effective.

Ungar, Stephen G.↗

NASA NTRS1988

Altimetry for non-Gaussian oceans - Height biases and estimation of parameters

The effects of a non-Gaussian ocean on satellite altimetry parameter estimation are discussed. The first part of this paper shows how non-Gaussian ocean parameters affect height estimation for satellites of the Seasat/Geosat/TOPEX type. In the second part, the estimation of the altimeter tracker bias and the non-Gaussian ocean parameters from the altimeter return signal is studied. A new convolution model that facilitates the deconvolution of the ocean surface specular point probability density function is introduced. Next, it is argued that it is not feasible in practice to estimate the electromagnetic bias from noisy altimeter returns. It is then shown that the least squares estimation of the surface parameters in the log-frequency domain has several advantages overestimating parameters in the time domain. The maximum likelihood estimation equations for the estimation of the waveform parameters are derived, and their solution is discussed.

Rodriguez, Ernesto↗

NASA NTRS1987

The U.S. survey for faint blue objects

A spectrophotometric study of the blue and UV-excess starlike objects in the U.S. survey (Usher, 1981) has been conducted. Observations were obtained with a resolution of about 20 A over the 3500-7000-A wavelength range. Considered within the sample are 42 DA white dwarfs, 4 DB/DO white dwarfs, 13 subdwarf B stars, 12 subdwarf O stars, and 13 horizontal branch stars. The sample is analyzed using numerical convolution photometry.

Mitchell, K. J.↗

NASA NTRS1988

Finite-state codes

A class of codes called finite-state (FS) codes is defined and investigated. The codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived. A general construction for FS codes is given, and it is shown that in many cases the FS codes constructed in this way have a free distance that is the largest possible. Catastrophic error propagation (CEP) for FS codes is also discussed. It is found that to avoid CEP one must solve the graph-theoretic problem of finding a uniquely decodable edge labeling of the state diagram.

Pollara, Fabrizio↗

NASA NTRS1990

VLSI Architecture For Viterbi Decoder

"Pipeline" architecture developed for very-large-scale integrated (VLSI) Viterbi decoding circuits for binary convolutional codes of large constraint lengths. In scheme, single sequential processor computes path metrics in trellis diagram (diagram in which paths and nodes represent possible sequences of code states and in which metrics indicate relative likelihoods of sequences). Systolic-array method used to store path information as well as to choose path with best metric. VLSI Viterbi-decoder architecture is compromise between speed and complexity. Size of decoding circuit increases approximately linearly with constraint length of code, and additional circuit chips added with moderate numbers of interconnections.

Hsu, In-Shek↗

NASA NTRS1990

Synchronization Technique For Reception Of Coded Data

Shortest sequence of bits likely to be filled with error bursts examined. Algorithm improves synchronization of frames of noisy binary-coded data signals after Viterbi decoding (recovery from "inner" convolutional code used in transmission channel) and before Reed-Solomon or other decoding (recovery from "outer" error-correcting block code). Based on comparisons of sequences of correct and erroneous Viterbi-decoded received bits with known marker sequence denoting beginning of frame of data. Does not require count of number of bits in received sequence disagreeing with corresponding bits in marker sequence.

Shahshahani, Mehrdad M.↗

NASA NTRS1990

Finite-State Codes

New class of codes with desirable properties constructed from block codes. Finite-state encoder is machine that has finite number of internal states. Receives k parallel information symbols and transmits n parallel code symbols at each clock pulse. Finite-state codes include both block and convolutional codes. Theory of finite-state codes used to study properties of error-correcting codes in general and to design new codes to various specifications.

Pollara, F.↗

NASA NTRS1990

Large-Constraint-Length, Fast Viterbi Decoder

Scheme for efficient interconnection makes VLSI design feasible. Concept for fast Viterbi decoder provides for processing of convolutional codes of constraint length K up to 15 and rates of 1/2 to 1/6. Fully parallel (but bit-serial) architecture developed for decoder of K = 7 implemented in single dedicated VLSI circuit chip. Contains six major functional blocks. VLSI circuits perform branch metric computations, add-compare-select operations, and then store decisions in traceback memory. Traceback processor reads appropriate memory locations and puts out decoded bits. Used as building block for decoders of larger K.

Collins, O.↗

NASA NTRS1989

A combined finite element and boundary integral formulation for solution via CGFFT of 2-dimensional scattering problems

A new technique is presented for computing the scattering by 2-D structures of arbitrary composition. The proposed solution approach combines the usual finite element method with the boundary integral equation to formulate a discrete system. This is subsequently solved via the conjugate gradient (CG) algorithm. A particular characteristic of the method is the use of rectangular boundaries to enclose the scatterer. Several of the resulting boundary integrals are therefore convolutions and may be evaluated via the fast Fourier transform (FFT) in the implementation of the CG algorithm. The solution approach offers the principle advantage of having O(N) memory demand and employs a 1-D FFT versus a 2-D FFT as required with a traditional implementation of the CGFFT algorithm. The speed of the proposed solution method is compared with that of the traditional CGFFT algorithm, and results for rectangular bodies are given and shown to be in excellent agreement with the moment method.

Collins, Jeffery D.↗

NASA NTRS1989

Isolating contour information from arbitrary images

Aspects of natural vision (physiological and perceptual) serve as a basis for attempting the development of a general processing scheme for contour extraction. Contour information is assumed to be central to visual recognition skills. While the scheme must be regarded as highly preliminary, initial results do compare favorably with the visual perception of structure. The scheme pays special attention to the construction of a smallest scale circular difference-of-Gaussian (DOG) convolution, calibration of multiscale edge detection thresholds with the visual perception of grayscale boundaries, and contour/texture discrimination methods derived from fundamental assumptions of connectivity and the characteristics of printed text. Contour information is required to fall between a minimum connectivity limit and maximum regional spatial density limit at each scale. Results support the idea that contour information, in images possessing good image quality, is (centered at about 10 cyc/deg and 30 cyc/deg). Further, lower spatial frequency channels appear to play a major role only in contour extraction from images with serious global image defects.

Jobson, Daniel J.↗