Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “DECODER”

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 217 records · Page 12

Disruption of evolutionarily correlated tRNA elements impairs accurate decoding

Bacterial transfer RNAs (tRNAs) contain evolutionarily conserved sequences and modifications that ensure uniform binding to the ribosome and optimal translational accuracy despite differences in their aminoacyl attachments and anticodon nucleotide sequences. In the tRNA anticodon stem-loop, the anticodon sequence is correlated with a base pair in the anticodon loop (nucleotides 32 and 38) to tune the binding of each tRNA to the decoding center in the ribosome. Disruption of this correlation renders the ribosome unable to distinguish correct from incorrect tRNAs. The molecular basis for how these two tRNA features combine to ensure accurate decoding is unclear. In this work, we solved structures of the bacterial ribosome containing either wild-type tRNA$^{\mathrm{Ala}}_{\mathrm{GGC}}$ or tRNA$^{\mathrm{Ala}}_{\mathrm{GGC}}$ containing a reversed 32–38 pair on cognate and near-cognate codons. Structures of wild-type tRNA$^{\mathrm{Ala}}_{\mathrm{GGC}}$ bound to the ribosome reveal 23S ribosomal RNA (rRNA) nucleotide A1913 positional changes that are dependent on whether the codon-anticodon interaction is cognate or near cognate. Further, the 32–38 pair is destabilized in the context of a near-cognate codon-anticodon pair. Reversal of the pairing in tRNA$^{\mathrm{Ala}}_{\mathrm{GGC}}$ ablates A1913 movement regardless of whether the interaction is cognate or near cognate. These results demonstrate that disrupting 32–38 and anticodon sequences alters interactions with the ribosome that directly contribute to misreading.

59 BASIC BIOLOGICAL SCIENCES↗

Qubit-Oscillator Concatenated Codes: Decoding Formalism and Code Comparison

Concatenating bosonic error-correcting codes with qubit codes can substantially boost the errorcorrecting power of the original qubit codes. It is not clear how to concatenate optimally, given that there are several bosonic codes and concatenation schemes to choose from, including the recently discovered Gottesman-Kitaev-Preskill (GKP) – stabilizer codes [Phys. Rev. Lett. 125, 080503 (2020)] that allow protection of a logical bosonic mode from fluctuations of the conjugate variables of the mode. We develop efficient maximum-likelihood decoders for and analyze the performance of three different concatenations of codes taken from the following set: qubit stabilizer codes, analog or Gaussian stabilizer codes, GKP codes, and GKP-stabilizer codes. We benchmark decoder performance against additive Gaussian white noise, corroborating our numerics with analytical calculations. We observe that the concatenation involving GKP-stabilizer codes outperforms the more conventional concatenation of a qubit stabilizer code with a GKP code in some cases. We also propose a GKP-stabilizer code that suppresses fluctuations in both conjugate variables without extra quadrature squeezing and formulate qudit versions of GKP-stabilizer codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optical information transfer through random unknown diffusers using electronic encoding and diffractive decoding

Free-space optical information transfer through diffusive media is critical in many applications, such as biomedical devices and optical communication, but remains challenging due to random, unknown perturbations in the optical path. We demonstrate an optical diffractive decoder with electronic encoding to accurately transfer the optical information of interest, corresponding to, e.g., any arbitrary input object or message, through unknown random phase diffusers along the optical path. This hybrid electronic-optical model, trained using supervised learning, comprises a convolutional neural network-based electronic encoder and successive passive diffractive layers that are jointly optimized. After their joint training using deep learning, our hybrid model can transfer optical information through unknown phase diffusers, demonstrating generalization to new random diffusers never seen before. The resulting electronic-encoder and optical-decoder model was experimentally validated using a 3D-printed diffractive network that axially spans <70λ, where λ = 0.75 mm is the illumination wavelength in the terahertz spectrum, carrying the desired optical information through random unknown diffusers. The presented framework can be physically scaled to operate at different parts of the electromagnetic spectrum, without retraining its components, and would offer low-power and compact solutions for optical information transfer in free space through unknown random diffusive media.

36 MATERIALS SCIENCE↗

Parameter Estimation for Decoding Sensor Signals

This paper introduces a parameter estimation approach for decoding digital sensor signals in a cyber-physical system. For unknown or not fully characterized digital sensor data, it can be difficult to decipher a desired signal from background or noise. In a cyber-physical system with networked sensors, we can leverage knowledge of the physical system to inform the decoding of the digital signals. This work in progress is a case study on deciphering commercial vehicle on-board sensor networks that communicate through the Controller Area Network (CAN). By understanding the stock vehicle sensor network, a vehicle can be extended into a scalable research platform with minimal instrumentation. Our challenge was to localize desired sensor signals encoded in network traffic that included other sensor data, control messages, as well as encoding and security overhead. Due to the vehicle’s unknown sensor network, our approach developed methods to efficiently analyze and identify key signals despite the large state-space for potential signal embeddings.

Nice, Matthew↗

CNN-Encoder-Decoder Model

Code and data for training CNN-Encoder-Decoder model described in the publication 'Noise reduction in X-ray photon correlation spectroscopy with convolutional neural networks encoder-decoder models.'

Konstantinova, Tatiana [Brookhaven National Lab. (↗

J1939 Decoder

The J1939 Decoder package is a set of scripts that will allow one to decode J1939 messages.

Olatt, Joseph↗

Chasing ghosts: characterization of artifact generation in coded aperture decoding due to experimental implementation

Coded aperture imaging is a form of lensless aperture imaging that projects multiple overlapping images of the source onto the detector, enhancing signal strength, which is advantageous for low-flux sources or high-resolution imaging. This technique requires decoding of the detector signal to reconstruct the original source, which involves convolving the detector data with the aperture pattern. When the signal is from a centered point source, the reconstructed source image is known as the point spread function (PSF). A clean PSF without artifacts is a Dirac delta function [Appl. Opt. 20, 1858 (1981)]. This paper examines the robustness of the decoding process against variations in experimental tolerances by analyzing artifact growth in the reconstructed PSF. We illustrate the effects of incorrect magnification, rotation, and detector size and find that aperture–detector rotational misalignment about the imaging axis is the most sensitive parameter, with significant artifact generation occurring with angular offsets of less than one degree. We discuss compensation methods for imperfect aperture placement, finding that small detector sizes produce uncompensatable artifact generation, and compare theoretical predictions with experimental PSF measurements of a rank , 6.8 mm thick (less than one mean free path) coded aperture with a 3.5 mm cell size, conducted at the MegaJOuLe Neutron Imaging Radiography dense plasma focus [IEEE Trans. Plasma Sci. 49, 3299 (2021)] using a 2.45 MeV neutron source. Based on our findings, we recommend using magnified coded apertures in the under-sampled regime, which allows for the inclusion of fiducial markers to characterize aperture–detector rotational offsets and the addition of mechanical coupling, where possible, to constrain rotational and magnification offsets.

Selwood, M. P. [Lawrence Livermore National Labora↗

General Purpose Graphics Processing Unit Based High-Rate Rice Decompression and Reed-Solomon Decoding

As the volume of data acquired by space-based sensors increases, mission data compression/decompression and forward error correction code processing performance must likewise scale. This competency development effort was explored using the General Purpose Graphics Processing Unit (GPGPU) to accomplish high-rate Rice Decompression and high-rate Reed-Solomon (RS) decoding at the satellite mission ground station. Each algorithm was implemented and benchmarked on a single GPGPU. Distributed processing across one to four GPGPUs was also investigated. The results show that the GPGPU has considerable potential for performing satellite communication Data Signal Processing, with three times or better performance improvements and up to ten times reduction in cost over custom hardware, at least in the case of Rice Decompression and Reed-Solomon Decoding.

97 MATHEMATICS AND COMPUTING↗

High speed sequential decoder

Operation of sequential decoding of data at high rates using Fano algorithm is discussed. Actions followed by decoder in systematically searching branches are described. Technique of diagonal steps is explained and illustrated.

Gilhousen, K. S.↗

An improved learning decoder

Learning decoder was developed which operates at system data rate without limiting data rate. Decoder is much simpler than those in existence, operates near Shannon's channel capacity, and automatically recovers operation after loss of signal.

Doland, G. D.↗

Decoder for delay-modulation coded data.

A decoding technique is described for the conversion of delay-modulated digital data to nonreturn to zero (NRZ) data. A potential time-phase ambiguity in reception and decoding of delay-modulated data is resolved in real time, through monitoring the data stream for a unique waveform inherent in delay-modulated data. Statistical backup is provided.

Lewin, J.↗

Burst decoding of binary block codes on Q-ary output channels.

The burst-b distance between two binary vectors is defined and shown to be a metric. This definition is applied to a binary-input, Q-ary output channel where errors occur in bursts. A decoding algorithm is presented for such a channel that is an extension of Weldon's (1971) weighted erasure decoding. Examples are presented illustrating the techniques.

Wainberg, S.↗

Upper bounds on sequential decoding performance parameters

This paper presents the best obtainable random coding and expurgated upper bounds on the probabilities of undetectable error, of t-order failure (advance to depth t into an incorrect subset), and of likelihood rise in the incorrect subset, applicable to sequential decoding when the metric bias G is arbitrary. Upper bounds on the Pareto exponent are also presented. The G-values optimizing each of the parameters of interest are determined, and are shown to lie in intervals that in general have nonzero widths. The G-optimal expurgated bound on undetectable error is shown to agree with that for maximum likelihood decoding of convolutional codes, and that on failure agrees with the block code expurgated bound. Included are curves evaluating the bounds for interesting choices of G and SNR for a binary-input quantized-output Gaussian additive noise channel.

Jelinek, F.↗

Space vehicle Viterbi decoder

The design and fabrication of an extremely low-power, constraint-length 7, rate 1/3 Viterbi decoder brassboard capable of operating at information rates of up to 100 kb/s is presented. The brassboard is partitioned to facilitate a later transition to an LSI version requiring even less power. The effect of soft-decision thresholds, path memory lengths, and output selection algorithms on the bit error rate is evaluated. A branch synchronization algorithm is compared with a more conventional approach. The implementation of the decoder and its test set (including all-digital noise source) are described along with the results of various system tests and evaluations. Results and recommendations are presented.

Source record↗

The fast decoding of Reed-Solomon codes using high-radix fermat theoretic transforms

Fourier-like transforms over GF(F sub n), where F sub n = 2(2n) + 1 is a Fermat prime, are applied in decoding Reed-Solomon codes. It is shown that such transforms can be computed using high-radix fast Fourier transform (FFT) algorithms requiring considerably fewer multiplications than the more usual radix 2 FFT algorithm. A special 256-symbol, 16-symbol-error-correcting, Reed-Solomon (RS) code for space communication-link applications can be encoded and decoded using this high-radix FFT algorithm over GF(F sub 3).

Liu, K. Y.↗

The statistical significance of error probability as determined from decoding simulations for long codes

The very low error probability obtained with long error-correcting codes results in a very small number of observed errors in simulation studies of practical size and renders the usual confidence interval techniques inapplicable to the observed error probability. A natural extension of the notion of a 'confidence interval' is made and applied to such determinations of error probability by simulation. An example is included to show the surprisingly great significance of as few as two decoding errors in a very large number of decoding trials.

Massey, J. L.↗