Engineering PapersSearch

SEARCH · Engineering Papers

Results for “ENCODING”

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 55 records · Page 3

Noise and neuronal populations conspire to encode simple waveforms reliably

Sensory systems rely on populations of neurons to encode information transduced at the periphery into meaningful patterns of neuronal population activity. This transduction occurs in the presence of intrinsic neuronal noise. This is fortunate. The presence of noise allows more reliable encoding of the temporal structure present in the stimulus than would be possible in a noise-free environment. Simulations with a parallel model of signal processing at the auditory periphery have been used to explore the effects of noise and a neuronal population on the encoding of signal information. The results show that, for a given set of neuronal modeling parameters and stimulus amplitude, there is an optimal amount of noise for stimulus encoding with maximum fidelity.

Neurons/physiology

Method and apparatus for ultra-high-sensitivity, incremental and absolute optical encoding

An absolute optical linear or rotary encoder which encodes the motion of an object (3) with increased resolution and encoding range and decreased sensitivity to damage to the scale includes a scale (5), which moves with the object and is illuminated by a light source (11). The scale carries a pattern (9) which is imaged by a microscope optical system (13) on a CCD array (17) in a camera head (15). The pattern includes both fiducial markings (31) which are identical for each period of the pattern and code areas (33) which include binary codings of numbers identifying the individual periods of the pattern. The image of the pattern formed on the CCD array is analyzed by an image processor (23) to locate the fiducial marking, decode the information encoded in the code area, and thereby determine the position of the object.

Leviton, Douglas B.

Method and system for progressive mesh storage and reconstruction using wavelet-encoded height fields

Systems and methods are provided for progressive mesh storage and reconstruction using wavelet-encoded height fields. A method for progressive mesh storage includes reading raster height field data, and processing the raster height field data with a discrete wavelet transform to generate wavelet-encoded height fields. In another embodiment, a method for progressive mesh storage includes reading texture map data, and processing the texture map data with a discrete wavelet transform to generate wavelet-encoded texture map fields. A method for reconstructing a progressive mesh from wavelet-encoded height field data includes determining terrain blocks, and a level of detail required for each terrain block, based upon a viewpoint. Triangle strip constructs are generated from vertices of the terrain blocks, and an image is rendered utilizing the triangle strip constructs. Software products that implement these methods are provided.

Baxes, Gregory A.

Method and system for progressive mesh storage and reconstruction using wavelet-encoded height fields

Systems and methods are provided for progressive mesh storage and reconstruction using wavelet-encoded height fields. A method for progressive mesh storage includes reading raster height field data, and processing the raster height field data with a discrete wavelet transform to generate wavelet-encoded height fields. In another embodiment, a method for progressive mesh storage includes reading texture map data, and processing the texture map data with a discrete wavelet transform to generate wavelet-encoded texture map fields. A method for reconstructing a progressive mesh from wavelet-encoded height field data includes determining terrain blocks, and a level of detail required for each terrain block, based upon a viewpoint. Triangle strip constructs are generated from vertices of the terrain blocks, and an image is rendered utilizing the triangle strip constructs. Software products that implement these methods are provided.

Baxes, Gregory A.

Enhancing Multi-Step Reservoir Inflow Forecasting: A Time-Variant Encoder–Decoder Approach

Accurate reservoir inflow forecasting is vital for effective water resource management. Reliable forecasts enable operators to optimize storage and release strategies to meet competing sectoral demands—such as water supply, irrigation, and hydropower scheduling—while also mitigating flood and drought risks. To address this need, in this study, we propose a novel time-variant encoder–decoder (ED) model designed specifically to improve multi-step reservoir inflow forecasting, enabling accurate predictions of reservoir inflows up to seven days ahead. Unlike conventional ED-LSTM and recursive ED-LSTM models, which use fixed encoder parameters or recursively propagate predictions, our model incorporates an adaptive encoder structure that dynamically adjusts to evolving conditions at each forecast horizon. Additionally, we introduce the Expected Baseline Integrated Gradients (EB-IGs) method for variable importance analysis, enhancing interpretability of inflow by incorporating multiple baselines to capture a broader range of hydrometeorological conditions. The proposed methods are demonstrated at several diverse reservoirs across the United States. Our results show that they outperform traditional methods, particularly at longer lead times, while also offering insights into the key drivers of inflow forecasting. These advancements contribute to enhanced reservoir management through improved forecasting accuracy and practical decision-making insights under complex hydroclimatic conditions.

58 GEOSCIENCES

Ecology of methyl-coenzyme M reductase encoding Thermoproteota

The recent demonstration that members of at least three classes of archaea affiliated with the Thermoproteota superphylum are involved in the production of the climate-active gas methane has sparked discussions about how well we understand the diversity of methanogens. Here, in this work, we show that members of all three of these lineages, as well as several other, yet uncultured and physiologically uncharacterized groups within the Thermoproteota that encode the key enzyme of anaerobic methane cycling, methyl-coenzyme M reductase (MCR), are widely distributed in anoxic ecosystems. We postulate that the taxonomic, metabolic, and ecological diversity of methanogenic and MCR-encoding Thermoproteota are poorly understood, and that the contribution of methylotrophic and thermoproteotal methanogenesis to methane production is largely unknown. We hypothesize that thermoproteotal methanogens could contribute, potentially substantially, to methane emissions in many anoxic environments that harbor methylated precursors, including wetlands, sediments, peat, rice paddies, wastewater sludge, and geothermal systems. We highlight the necessity to experimentally test the (eco)physiology of these widely distributed archaea using both culture-dependent ( in vitro ) and culture-independent ( in situ ) approaches to assess their potential contribution to methane emissions. Last, we stress the importance of remaining agnostic about the physiology of MCR-encoding Thermoproteota in the absence of experimental data because most of these archaea also carry the genetic potential to grow non-methanogenically.

MCR

Encoding of linear kinetic plasma problems in quantum circuits via data compression

We propose an algorithm for encoding linear kinetic plasma problems in quantum circuits. The focus is on modelling electrostatic linear waves in a one-dimensional Maxwellian electron plasma. The waves are described by the linearized Vlasov–Ampère system with a spatially localized external current that drives plasma oscillations. This system is formulated as a boundary-value problem and cast in the form of a linear vector equation Aψ = b to be solved by using the quantum signal processing algorithm. The latter requires encoding of matrix A in a quantum circuit as a sub-block of a unitary matrix. We propose how to encode A in a circuit in a compressed form and discuss how the resulting circuit scales with the problem size and the desired precision.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY

Three-Qubit Encoding in Ytterbium-171 Atoms for Simulating 1+1D Quantum Chromodynamics

Simulating nuclear matter described by quantum chromodynamics using quantum computers is notoriously inefficient because of the assortment of quark degrees of freedom such as matter/antimatter, flavor, color, and spin. Here, we propose to address this resource efficiency challenge by encoding three qubits within individual ytterbium-171 atoms of a neutral atom quantum processor. The three qubits are encoded in three distinct sectors: an electronic “clock” transition, the spin-1/2 nucleus, and the lowest two motional states in one radial direction of the harmonic trapping potential. We develop a family of composite sideband pulses and demonstrate a universal gate set and readout protocol for this three-qubit system. We then apply it to single-flavor quantum chromodynamics in 1+1D axial gauge for which the three qubits directly represent the occupancy of quarks in the three colors. We show that two atoms are sufficient to simulate both vacuum persistence oscillations and a screened hadron-number transition. We consider resource requirements and connections to error detection/correction. Our work is a step toward resource-efficient digital simulation of nuclear matter and opens new opportunities for versatile qubit encoding in neutral atom quantum processors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

Fast and Accurate Greenberger-Horne-Zeilinger Encoding Using All-to-All Interactions

The 𝑁-qubit Greenberger-Horne-Zeilinger (GHZ) state is an important resource for quantum technologies. Here, we consider the task of GHZ encoding using all-to-all interactions, which prepares the GHZ state in a special case, and is furthermore useful for quantum error correction, interaction-rate enhancement, and transmitting information using power-law interactions. The naive protocol based on parallelizing CNOT gates takes O(1)-time of Hamiltonian evolution. In this work, we propose a fast protocol that achieves GHZ encoding with high accuracy. The evolution time O⁡(log 2 ⁡𝑁/𝑁) almost saturates the theoretical limit Ω⁡(log⁡𝑁/𝑁). Moreover, the final state is close to the ideal encoded one with high fidelity >1–10 −3 , up to large system sizes 𝑁 ≲ 2000. The protocol only requires a few stages of time-independent Hamiltonian evolution; the key idea is to use the data qubit as control, and to use fast spin-squeezing dynamics generated by e.g., two-axis twisting.

quantum computation

Fidelity Comparison of Time-Bin and Fock State Encoding in Hybrid Quantum Systems Under Channel and Transduction Effects

Future quantum networks are expected to integrate a heterogeneous combination of quantum systems, owing to the diverse advantages offered by different physical platforms in terms of scalability, coherence times, and interfacing capabilities. Within the context of this emerging quantum communication paradigm, this paper presents an analytical comparison of two photonic encoding schemes—time-bin and Fock state (single rail)—in hybrid quantum systems where flying qubits are entangled with stationary matter qubits. We evaluate their resilience against fiber channel and quantum transduction effects by calculating the fidelity of the final states relative to their ideal forms. Employing the characteristic function approach, we derive analytical fidelity expressions and investigate their dependence on parameters such as transmissivity, noise levels, fiber length, and source generation success probability. Additionally, we simulate the scenario with a dedicated QuTiP software implementation to verify the validity of the theoretical models. Our findings reveal that due to its inherent single-mode structure, the Fock state encoding consistently outperforms time-bin encoding in fidelity, as this structure significantly minimizes susceptibility to losses compared to the two-mode nature of the time-bin scheme. This analysis offers valuable insights for future hybrid quantum communication and information processing applications.

Fiorini, Francesco [Pisa U.]

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

Abrams, Erez [Princeton University, Massachusetts

Upper bound on compression ratio for run-length encoding.

Run-length encoding is a scheme which has been used to remove redundancy from video signals. Based upon a first-order Markov model of video data, an upper bound on compression ratio is found for run-length encoding. It is shown that at best run-length encoding will give a compression ratio which is approximately 60% of the maximum attainable value. This percentage is fairly independent of the particular picture involved.

Gray, K. G.

On the detection of differentially encoded polyphase signals.

Discussion of the transmission and detection of differentially encoded polyphase signals and of the ambiguity resolution problem which results from suppression of the transmitted carrier. In particular, an analysis is made of the performance of differentially encoded coherent multiple phase-shift keyed (MPSK) systems which reconstruct coherent reference signals by means of generalized Costas or nth-power loops. The performance of such systems is then compared with that of ideal reception of MPSK signals and differentially coherent detection of differentially encoded MPSK signals. Emphasis is placed upon the special cases of quadriphase and octaphase signaling.

Lindsey, W. C.

Rate data encoder

An apparatus and technique for encoding rate data is described. The expected range of the rate data is determined and the data falling within that range is encoded by conventional digital techniques. If the data falls either below or above the range, the encoding is stopped and signals are transmitted indicating that the data is not within the expected range.

Sivertson, W. E., Jr.

Adaptive line by line encoder for image transmission.

A simple adaptive algorithm is applied to the line by line encoding of images. Among its desirable properties the algorithm includes a control of encoding errors independently of the image statistics. This block transform encoder, because of its adaptive nature gives rise to nonstationary errors and end of block effects. Two methods are proposed to reduce these effects and thus improve the subjective quality of reconstructed images. The performance of the algorithm is image dependent and several illustrative examples are given.

Algazi, V. R.

Tree encoding of Gaussian sources

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.

Dick, R. J.

The effects of a visual fidelity criterion on the encoding of images

Shannon's rate-distortion function provides a potentially useful lower bound against which to compare the rate-versus-distortion performance of practical encoding-transmission systems. However, this bound is not applicable unless one can arrive at a numerically-valued measure of distortion which is in reasonable correspondence with the subjective evaluation of the observer or interpreter. We have attempted to investigate this choice of distortion measure for monochrome still images. This investigation has considered a class of distortion measures for which it is possible to simulate the optimum (in a rate-distortion sense) encoding. Such simulation was performed at a fixed rate for various measures in the class and the results compared subjectively by observers. For several choices of transmission rate and original images, one distortion measure was fairly consistently rated as yielding the most satisfactory appearing encoded images.

Mannos, J. L.

Source encoding for orbiter communications links

The feasibility of using data compression to improve link efficiency as an alternative to increased transmitter power, reducing receiver noise figures, increasing antenna gain through more stringent orbiter attitude constraints, etc. is studied. A method of encoding digital data is developed which permits low band-width encoding as well as a unique system of adaptive run length encoding. The effectiveness of these techniques for the air-to-ground link and for the bandwidth-limited ground-to-ground data link used for the orbiter downlink data is evaluated. Results are presented.

Source record