Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

Decoding algorithms based on the trellis representation of a code (block or convolutional) drastically reduce decoding complexity. The best known and most commonly used trellis-based decoding algorithm is the Viterbi algorithm. It is a maximum likelihood decoding algorithm. Convolutional codes with the Viterbi decoding have been widely used for error control in digital communications over the last two decades. This chapter is concerned with the application of the Viterbi decoding algorithm to linear block codes. First, the Viterbi algorithm is presented. Then, optimum sectionalization of a trellis to minimize the computational complexity of a Viterbi decoder is discussed and an algorithm is presented. Some design issues for IC (integrated circuit) implementation of a Viterbi decoder are considered and discussed. Finally, a new decoding algorithm based on the principle of compare-select-add is presented. This new algorithm can be applied to both block and convolutional codes and is more efficient than the conventional Viterbi algorithm based on the add-compare-select principle. This algorithm is particularly efficient for rate 1/n antipodal convolutional codes and their high-rate punctured codes. It reduces computational complexity by one-third compared with the Viterbi algorithm.

Lin, Shu↗
DOE OSTI2019

Optimum Full Information, Unlimited Complexity, Invariant and Minimax Clock Skew and Offset Estimators for IEEE 1588

This paper presents the problem of clock skew and offset estimation for the IEEE 1588 precision time protocol. Built on the classical two-way message exchange scheme, IEEE 1588 is a prominent synchronization protocol for packet switched networks. Because of the presence of random queuing delays in a packet switched network, the joint recovery of clock skew and offset from the received packet timestamps can be viewed as a statistical estimation problem. Recently, assuming perfect clock skew information, minimax optimum clock offset estimators were developed for IEEE 1588. Building on this work, we first develop joint optimum invariant clock skew and offset estimators for IEEE 1588 for known queuing delay statistics and unlimited computational complexity. We then show the developed estimators are minimax optimum, i.e., these estimators minimize the maximum skew normalized mean square estimation error over all possible values of the unknown parameters. Minimax optimum estimators that utilize information from past timestamps to improve accuracy are also introduced. The developed optimum estimators provide useful fundamental limits for evaluating the performance of clock skew and offset estimation schemes. These performance limits can aid system designers to develop algorithms with the desired computational complexity that achieve performance close to the performance of the optimum estimators. If a designer finds an approach with a complexity they find acceptable and which provides performance close to the optimum performance, they can use it and know they have near optimum performance. This is precisely the approach used in communications when comparing to capacity.

Cellular networks↗
DOE OSTI2024

The black hole interior from non-isometric codes and complexity

Quantum error correction has given us a natural language for the emergence of spacetime, but the black hole interior poses a challenge for this framework: at late times the apparent number of interior degrees of freedom in effective field theory can vastly exceed the true number of fundamental degrees of freedom, so there can be no isometric (i.e. inner-product preserving) encoding of the former into the latter. In this paper we explain how quantum error correction nonetheless can be used to explain the emergence of the black hole interior, via the idea of “non-isometric codes protected by computational complexity”. We show that many previous ideas, such as the existence of a large number of “null states”, a breakdown of effective field theory for operations of exponential complexity, the quantum extremal surface calculation of the Page curve, post-selection, “state-dependent/state-specific” operator reconstruction, and the “simple entropy” approach to complexity coarse-graining, all fit naturally into this framework, and we illustrate all of these phenomena simultaneously in a soluble model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1986

Theoretical kinetic computations in complex reacting systems

Nasa Lewis' studies of complex reacting systems at high temperature are discussed. The changes which occur are the result of many different chemical reactions occurring at the same time. Both an experimental and a theoretical approach are needed to fully understand what happens in these systems. The latter approach is discussed. The differential equations which describe the chemical and thermodynamic changes are given. Their solution by numerical techniques using a detailed chemical mechanism is described. Several different comparisons of computed results with experimental measurements are also given. These include the computation of (1) species concentration profiles in batch and flow reactions, (2) rocket performance in nozzle expansions, and (3) pressure versus time profiles in hydrocarbon ignition processes. The examples illustrate the use of detailed kinetic computations to elucidate a chemical mechanism and to compute practical quantities such as rocket performance, ignition delay times, and ignition lengths in flow processes.

Bittker, David A.↗
DOE OSTI2014

Discrete models of fluids: spatial averaging, closure and model reduction

We consider semidiscrete ODE models of single-phase fluids and two-fluid mixtures. In the presence of multiple fine-scale heterogeneities, the size of these ODE systems can be very large. Spatial averaging is then a useful tool for reducing computational complexity of the problem. The averages satisfy exact balance equations of mass, momentum, and energy. These equations do not form a satisfactory continuum model because evaluation of stress and heat flux requires solving the underlying ODEs. To produce continuum equations that can be simulated without resolving microscale dynamics, we recently proposed a closure method based on the use of regularized deconvolution. Here we continue the investigation of deconvolution closure with the long term objective of developing consistent computational upscaling for multiphase particle methods. The structure of the fine-scale particle solvers is reminiscent of molecular dynamics. For this reason we use nonlinear averaging introduced for atomistic systems by Noll, Hardy, and Murdoch-Bedeaux. We also consider a simpler linear averaging originally developed in large eddy simulation of turbulence. We present several simple but representative examples of spatially averaged ODEs, where the closure error can be analyzed. Based on this analysis we suggest a general strategy for reducing the relative error of approximate closure. For problems with periodic highly oscillatory material parameters we propose a spectral boosting technique that augments the standard deconvolution and helps to correctly account for dispersion effects. We also conduct several numerical experiments, one of which is a complete mesoscale simulation of a stratified two-fluid flow in a channel. In this simulation, the operation count per coarse time step scales sublinearly with the number of particles.

Multiscale modeling, discrete models, fluid flow↗
NASA NTRS1986

Airport-Noise Levels and Annoyance Model (ALAMO) user's guide

A guide for the use of the Airport-Noise Level and Annoyance MOdel (ALAMO) at the Langley Research Center computer complex is provided. This document is divided into 5 primary sections, the introduction, the purpose of the model, and an in-depth description of the following subsystems: baseline, noise reduction simulation and track analysis. For each subsystem, the user is provided with a description of architecture, an explanation of subsystem use, sample results, and a case runner's check list. It is assumed that the user is familiar with the operations at the Langley Research Center (LaRC) computer complex, the Network Operating System (NOS 1.4) and CYBER Control Language. Incorporated within the ALAMO model is a census database system called SITE II.

Deloach, R.↗
DOE OSTI2024

Experimental Setup and Learning-Based AI Model for Developing Accurate PV Inverter Models

The integration of power electronics-based interfaces presents challenges due to the absence of detailed models and the high computational complexity. Generic models used in system studies lack accuracy in capturing converter dynamics. This paper proposes a data-driven approach developed from experimental setup data. This approach enhances accuracy in photovoltaic inverter modeling. We used two types of PV inverters in the experiment. The recorded experimental data undergo processing through a machine learning model. Results from the model trained through machine learning is also presented.

artificial intelligence↗
NASA NTRS1980

Parallel processing implementations of a contextual classifier for multispectral remote sensing data

The applicability of parallel processing schemes to the implementation of a contextual classification algorithm which exploits the spatial and spectral context of a multispectral remote sensing pixel to achieve classification is examined. Two algorithms for classifying each multivariate pixel taking into account the probable classifications of neighboring pixels are presented which make use of a size three horizontally linear neighborhood, and the serial computational complexity of the more efficient algorithm is shown to grow in proportion to the number of pixels and the cube of the number of possible categories. The implementation of the more efficient algorithm on a CDC Flexible Processor system and on a multimicroprocessor system such as the proposed PASM is then discussed. It is noted that the use of N processors to perform the calculations N times faster than a single processor overcomes the principal disadvantage of contexual classifiers, i.e., their computational complexity.

Siegel, H. J.↗
NASA NTRS1991

Measuring the effects of distributed database models on transaction availability measures

Data distribution, data replication, and system reliability are key factors in determining the availability measures for transactions in distributed database systems. In order to simplify the evaluation of these measures, database designers and researchers tend to make unrealistic assumptions about these factors. Here, the effect of such assumptions on the computational complexity and accuracy of such evaluations is investigated. A database system is represented with five parameters related to the above factors. Probabilistic analysis is employed to evaluate the availability of read-one and read-write transactions. Both the read-one/write-all and the majority-read/majority-write replication control policies are considered. It is concluded that transaction availability is more sensitive to variations in degrees of replication, less sensitive to data distribution, and insensitive to reliability variations in a heterogeneous system. The computational complexity of the evaluations is found to be mainly determined by the chosen distributed database model, while the accuracy of the results are not so much dependent on the models.

Mukkamala, Ravi↗
NASA NTRS1997

Computations of Complex Three-Dimensional Turbulent Free Jets

Three-dimensional, incompressible turbulent jets with rectangular and elliptical cross-sections are simulated with a finite-difference numerical method. The full Navier- Stokes equations are solved at low Reynolds numbers, whereas at high Reynolds numbers filtered forms of the equations are solved along with a sub-grid scale model to approximate the effects of the unresolved scales. A 2-N storage, third-order Runge-Kutta scheme is used for temporary discretization and a fourth-order compact scheme is used for spatial discretization. Although such methods are widely used in the simulation of compressible flows, the lack of an evolution equation for pressure or density presents particular difficulty in incompressible flows. The pressure-velocity coupling must be established indirectly. It is achieved, in this study, through a Poisson equation which is solved by a compact scheme of the same order of accuracy. The numerical formulation is validated and the dispersion and dissipation errors are documented by the solution of a wide range of benchmark problems. Three-dimensional computations are performed for different inlet conditions which model the naturally developing and forced jets. The experimentally observed phenomenon of axis-switching is captured in the numerical simulation, and it is confirmed through flow visualization that this is based on self-induction of the vorticity field. Statistical quantities such as mean velocity, mean pressure, two-point velocity spatial correlations and Reynolds stresses are presented. Detailed budgets of the mean momentum and Reynolds stresses are presented. Detailed budgets of the mean momentum and Reynolds stress equations are presented to aid in the turbulence modeling of complex jets. Simulations of circular jets are used to quantify the effect of the non-uniform curvature of the non-circular jets.

Wilson, Robert V.↗
DOE OSTI2017

High Performance Computing Based Parallel HIearchical Modal Association Clustering (HPAR HMAC)

For many applications, clustering is a crucial step in order to gain insight into the makeup of a dataset. The best approach to a given problem often depends on a variety of factors, such as the size of the dataset, time restrictions, and soft clustering requirements. The HMAC algorithm seeks to combine the strengths of 2 particular clustering approaches: model-based and linkage-based clustering. One particular weakness of HMAC is its computational complexity. HMAC is not practical for mega-scale data clustering. For high-definition imagery, a user would have to wait months or years for a result; for a 16-megapixel image, the estimated runtime skyrockets to over a decade! To improve the execution time of HMAC, it is reasonable to consider an multi-core implementation that utilizes available system resources. An existing imple-mentation (Ray and Cheng 2014) divides the dataset into N partitions - one for each thread prior to executing the HMAC algorithm. This implementation benefits from 2 types of optimization: parallelization and divide-and-conquer. By running each partition in parallel, the program is able to accelerate computation by utilizing more system resources. Although the parallel implementation provides considerable improvement over the serial HMAC, it still suffers from poor computational complexity, O(N2). Once the maximum number of cores on a system is exhausted, the program exhibits slower behavior. We now consider a modification to HMAC that involves a recursive partitioning scheme. Our modification aims to exploit divide-and-conquer benefits seen by the parallel HMAC implementation. At each level in the recursion tree, partitions are divided into 2 sub-partitions until a threshold size is reached. When the partition can no longer be divided without falling below threshold size, the base HMAC algorithm is applied. This results in a significant speedup over the parallel HMAC.

Patlolla, Dilip R↗
DOE OSTI2020

State-Constrained Grid-Forming Inverter Control for Robust Operation of AC Microgrids

The control of grid-forming inverters has become an important problem to achieve high efficiency, reliability, and resilience of the future power grid. The distributed control that utilizes a sparse communication network has been proposed for AC microgrids, in which each DG only has access to the information of a small number of its neighboring DGs, reducing the computational complexity and improving the resiliency to faults and unknown parameters. However, these approaches have not provided a clear analysis of the coupling between active/reactive power injections and the voltage magnitude/frequency or a distributed updating law with a solid theoretical foundation. Additionally, in the existing approaches, tracking the references from the secondary control may violate operational constraints.

Xu, Ying↗
DOE OSTI2023

Editorial: Edge computation and digital distribution networks

The development of digital technologies is penetrating all areas of energy revolution. Based on the in-depth integration of advanced digital technologies, distribution networks are gradually transforming into digital distribution networks (DDNs) with tremendous changes from the structure to the operation mode. DDNs is the digitalized appearance of the physical distribution network, in which ubiquitous connections and massive data are the basic characteristics (Huo et al., 2022). It is an important task to utilize the massive data and propose novel operation modes to construct more efficient and intelligent distribution networks (Jian et al., 2022). Among the advanced digital technologies in DDNs, edge computing has received wide attention (Zhao et al., 2022). It has superior performance in local sensing and intelligent computation, which can effectively relieve huge communication pressure. However, the limited computing resources and the complex computing tasks at the edge side significantly challenge the collaboration of distribution network regulation and advanced digital technologies (Hu et al., 2022). It is necessary to find out proper methods to utilize advanced digital technology to construct DDNs. This Research Topic is organized to introduce the recent progress in the construction, operation and advanced computational methods for DDNs. Finally, seven papers have been accepted, which can be sorted into the following three categories: 1) Evolution and technical features of DDNs, 2) Intelligent operation control of DDNs, 3) Advanced simulation for large-scale DDNs. The three sections below respectively introduce the major research and contributions of the papers covered in each category.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1978

A fast computation of complex convolution using a hybrid transform

The cyclic convolution of complex values was obtained by a hybrid transform that is a combination of a Winograd transform and a fast complex integer transform. This new hybrid algorithm requires fewer multiplications than any previously known algorithm.

Reed, I. S.↗