Search NASA⌕ Search

SEARCH · Search NASA

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Encoding of head acceleration in vestibular neurons. I. Spatiotemporal response properties to linear acceleration

1. Extracellular recordings were made in and around the medial vestibular nuclei in decerebrated rats. Neurons were functionally identified according to their semicircular canal input on the basis of their responses to angular head rotations around the yaw, pitch, and roll head axes. Those cells responding to angular acceleration were classified as either horizontal semicircular canal-related (HC) or vertical semicircular canal-related (VC) neurons. The HC neurons were further characterized as either type I or type II, depending on the direction of rotation producing excitation. Cells that lacked a response to angular head acceleration, but exhibited sensitivity to a change in head position, were classified as purely otolith organ-related (OTO) neurons. All vestibular neurons were then tested for their response to sinusoidal linear translation in the horizontal head plane. 2. Convergence of macular and canal inputs onto central vestibular nuclei neurons occurred in 73% of the type I HC, 79% of the type II HC, and 86% of the VC neurons. Out of the 223 neurons identified as receiving macular input, 94 neurons were further studied, and their spatiotemporal response properties to sinusoidal stimulation with pure linear acceleration were quantified. Data were obtained from 33 type I HC, 22 type II HC, 22 VC, and 17 OTO neurons. 3. For each neuron the angle of the translational stimulus vector was varied by 15, 30, or 45 degrees increments in the horizontal head plane. In all tested neurons, a direction of maximum sensitivity was identified. An interesting difference among neurons was their response to translation along the direction perpendicular to that that produced the maximum response ("null" direction). For the majority of neurons tested, it was possible to evoke a nonzero response during stimulation along the null direction always had response phases that varied as a function of stimulus direction. 4. These spatiotemporal response properties were quantified in two independent ways. First, the data were evaluated on the basis of the traditional one-dimensional principle governed by the "cosine gain rule" and constant response phase at different stimulus orientations. Second, the response gain and phase values that were empirically determined for each orientation of the applied linear stimulus vector were fitted on the basis of a newly developed formalism that treats neuronal responses as exhibiting two-dimensional spatial sensitivity. Thus two response vectors were determined for each neuron on the basis of its response gain and phase at different stimulus directions in the horizontal head plane.(ABSTRACT TRUNCATED AT 400 WORDS).

NASA Discipline Neuroscience↗
NASA NTRS2014

Mixed Linear/Square-Root Encoded Single Slope Ramp Provides a Fast, Low Noise Analog to Digital Converter with Very High Linearity for Focal Plane Arrays

An analog-to-digital converter (ADC) converts pixel voltages from a CMOS image into a digital output. A voltage ramp generator generates a voltage ramp that has a linear first portion and a non-linear second portion. A digital output generator generates a digital output based on the voltage ramp, the pixel voltages, and comparator output from an array of comparators that compare the voltage ramp to the pixel voltages. A return lookup table linearizes the digital output values.

Wrigley, Christopher James↗
NASA NTRS1994

Convolutional Encoding of Self-Dual Codes

Self-dual block codes of rate 1/2 are constructed here, The codes are of length 8m with weights w, w = 0 mod 4. The codes have a convolutional portion of length 8m-2 and non-systematic information length 4m-1.

self↗
NASA NTRSDate not supplied

The maize rough endosperm6 (rgh6) mutant encodes a predicted DEAD-box RNA helicase

Maize rough endosperm (rgh) mutants have defective seeds with a rough, etched, or pitted endosperm surface. Molecular genetic analysis of this mutant class has identified multiple RNA processing proteins critical to endosperm development. We isolated the rgh6 locus from the UniformMu transposon tagging population. Mutant kernels have reduced grain-fill with defective embryos that fail to germinate. Self-pollination of rgh6 heterozygotes produces mutant seeds at frequency consistent with a single recessive mutation. Molecular mapping localized rgh6 to a 60 kbp interval on chromosome 5. PCR analysis of gene models within the fine-map interval identified a Mutator (Mu) transposon insertion within a predicted DEAD-box RNA helicase gene. A second allele of rgh6 was identified from UniformMu population. Reciprocal crosses between rgh6-umu1 and rgh6-umu2 heterozygotes produces mutant seeds at a frequency consistent with a 3:1 ratio indicating these mutants are allelic. Both rgh6-umu1 and rgh6-umu2 have Mu element insertions at the same insertion site within the DEAD-box RNA helicase gene. However, the terminal inverted repeat sequences are polymorphic between the alleles showing the alleles are independent mutations. We conclude that mutation of the DEAD-box RNA helicase causes the rgh6 phenotype. Further characterization of the rgh6 mutant phenotype and biochemical investigation of the RGH6 protein is expected to give further insights on the roles of RNA processing in endosperm development.

maize↗
DOE OSTI2024

Self-assembled elastomers with molecularly encoded tissue-like softness, strain-adaptive stiffening and coloration

The invention generally relates to linear-bottlebrush-linear copolymer blocks and methods of making and using same. The disclosed copolymer blocks can be useful in, for example, the formation of polymer networks that replicate biological stress-strain behavior. This abstract is intended as a scanning tool for purposes of searching in the particular art and is not intended to be limiting of the present invention.

Sheiko, Sergei↗
NASA NTRS2000

Hybrid concatenated codes and iterative decoding

Several improved turbo code apparatuses and methods. The invention encompasses several classes: (1) A data source is applied to two or more encoders with an interleaver between the source and each of the second and subsequent encoders. Each encoder outputs a code element which may be transmitted or stored. A parallel decoder provides the ability to decode the code elements to derive the original source information d without use of a received data signal corresponding to d. The output may be coupled to a multilevel trellis-coded modulator (TCM). (2) A data source d is applied to two or more encoders with an interleaver between the source and each of the second and subsequent encoders. Each of the encoders outputs a code element. In addition, the original data source d is output from the encoder. All of the output elements are coupled to a TCM. (3) At least two data sources are applied to two or more encoders with an interleaver between each source and each of the second and subsequent encoders. The output may be coupled to a TCM. (4) At least two data sources are applied to two or more encoders with at least two interleavers between each source and each of the second and subsequent encoders. (5) At least one data source is applied to one or more serially linked encoders through at least one interleaver. The output may be coupled to a TCM. The invention includes a novel way of terminating a turbo coder.

Divsalar, Dariush↗
NASA NTRS2011

Prioritized LT Codes

The original Luby Transform (LT) coding scheme is extended to account for data transmissions where some information symbols in a message block are more important than others. Prioritized LT codes provide unequal error protection (UEP) of data on an erasure channel by modifying the original LT encoder. The prioritized algorithm improves high-priority data protection without penalizing low-priority data recovery. Moreover, low-latency decoding is also obtained for high-priority data due to fast encoding. Prioritized LT codes only require a slight change in the original encoding algorithm, and no changes at all at the decoder. Hence, with a small complexity increase in the LT encoder, an improved UEP and low-decoding latency performance for high-priority data can be achieved. LT encoding partitions a data stream into fixed-sized message blocks each with a constant number of information symbols. To generate a code symbol from the information symbols in a message, the Robust-Soliton probability distribution is first applied in order to determine the number of information symbols to be used to compute the code symbol. Then, the specific information symbols are chosen uniform randomly from the message block. Finally, the selected information symbols are XORed to form the code symbol. The Prioritized LT code construction includes an additional restriction that code symbols formed by a relatively small number of XORed information symbols select some of these information symbols from the pool of high-priority data. Once high-priority data are fully covered, encoding continues with the conventional LT approach where code symbols are generated by selecting information symbols from the entire message block including all different priorities. Therefore, if code symbols derived from high-priority data experience an unusual high number of erasures, Prioritized LT codes can still reliably recover both high- and low-priority data. This hybrid approach decides not only "how to encode" but also "what to encode" to achieve UEP. Another advantage of the priority encoding process is that the majority of high-priority data can be decoded sooner since only a small number of code symbols are required to reconstruct high-priority data. This approach increases the likelihood that high-priority data is decoded first over low-priority data. The Prioritized LT code scheme achieves an improvement in high-priority data decoding performance as well as overall information recovery without penalizing the decoding of low-priority data, assuming high-priority data is no more than half of a message block. The cost is in the additional complexity required in the encoder. If extra computation resource is available at the transmitter, image, voice, and video transmission quality in terrestrial and space communications can benefit from accurate use of redundancy in protecting data with varying priorities.

Woo, Simon S.↗
NASA NTRS1984

Comparison of voice types for helicopter voice warning systems

Three related studies were conducted to compare different types of human voice warnings. In the first study, a comparison of three LPC-encoded voices, human female, human male, and phoneme-synthesized, by the criteria of pilot flight task performance showed no differences due to the voice type. In the second study, pilots' preferences were investigated, by comparing preference for direct synthesized speech to the LPC-encoded human female speech and to LPC-encoded synthesized speech. Most pilots were found to prefer direct synthesized speech over both LPC-encoded human female speech and the LPC-encoded synthesized speech. In the third study, phonetically balanced (PB) words heard in simulated helicopter noise were used to compare the intelligibility of direct synthesized and LPC-encoded phoneme-synthesized speech types. PB word intelligibility was found to be better for direct synthesized speech than for the LPC-encodes synthesized speech.

Simpson, C. A.↗
NASA NTRS2008

Fault-Tolerant Coding for State Machines

Two reliable fault-tolerant coding schemes have been proposed for state machines that are used in field-programmable gate arrays and application-specific integrated circuits to implement sequential logic functions. The schemes apply to strings of bits in state registers, which are typically implemented in practice as assemblies of flip-flop circuits. If a single-event upset (SEU, a radiation-induced change in the bit in one flip-flop) occurs in a state register, the state machine that contains the register could go into an erroneous state or could hang, by which is meant that the machine could remain in undefined states indefinitely. The proposed fault-tolerant coding schemes are intended to prevent the state machine from going into an erroneous or hang state when an SEU occurs. To ensure reliability of the state machine, the coding scheme for bits in the state register must satisfy the following criteria: 1. All possible states are defined. 2. An SEU brings the state machine to a known state. 3. There is no possibility of a hang state. 4. No false state is entered. 5. An SEU exerts no effect on the state machine. Fault-tolerant coding schemes that have been commonly used include binary encoding and "one-hot" encoding. Binary encoding is the simplest state machine encoding and satisfies criteria 1 through 3 if all possible states are defined. Binary encoding is a binary count of the state machine number in sequence; the table represents an eight-state example. In one-hot encoding, N bits are used to represent N states: All except one of the bits in a string are 0, and the position of the 1 in the string represents the state. With proper circuit design, one-hot encoding can satisfy criteria 1 through 4. Unfortunately, the requirement to use N bits to represent N states makes one-hot coding inefficient.

Naegle, Stephanie Taft↗
NASA NTRS2011

Method and System for Temporal Filtering in Video Compression Systems

Three related innovations combine improved non-linear motion estimation, video coding, and video compression. The first system comprises a method in which side information is generated using an adaptive, non-linear motion model. This method enables extrapolating and interpolating a visual signal, including determining the first motion vector between the first pixel position in a first image to a second pixel position in a second image; determining a second motion vector between the second pixel position in the second image and a third pixel position in a third image; determining a third motion vector between the first pixel position in the first image and the second pixel position in the second image, the second pixel position in the second image, and the third pixel position in the third image using a non-linear model; and determining a position of the fourth pixel in a fourth image based upon the third motion vector. For the video compression element, the video encoder has low computational complexity and high compression efficiency. The disclosed system comprises a video encoder and a decoder. The encoder converts the source frame into a space-frequency representation, estimates the conditional statistics of at least one vector of space-frequency coefficients with similar frequencies, and is conditioned on previously encoded data. It estimates an encoding rate based on the conditional statistics and applies a Slepian-Wolf code with the computed encoding rate. The method for decoding includes generating a side-information vector of frequency coefficients based on previously decoded source data and encoder statistics and previous reconstructions of the source frequency vector. It also performs Slepian-Wolf decoding of a source frequency vector based on the generated side-information and the Slepian-Wolf code bits. The video coding element includes receiving a first reference frame having a first pixel value at a first pixel position, a second reference frame having a second pixel value at a second pixel position, and a third reference frame having a third pixel value at a third pixel position. It determines a first motion vector between the first pixel position and the second pixel position, a second motion vector between the second pixel position and the third pixel position, and a fourth pixel value for a fourth frame based upon a linear or nonlinear combination of the first pixel value, the second pixel value, and the third pixel value. A stationary filtering process determines the estimated pixel values. The parameters of the filter may be predetermined constants.

Lu, Ligang↗