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

Architecture for VLSI design of Reed-Solomon encoders

A description is given of the logic structure of the universal VLSI symbol-slice Reed-Solomon (RS) encoder chip, from a group of which an RS encoder may be constructed through cascading and proper interconnection. As a design example, it is shown that an RS encoder presently requiring approximately 40 discrete CMOS ICs may be replaced by an RS encoder consisting of four identical, interconnected VLSI RS encoder chips, offering in addition to greater compactness both a lower power requirement and greater reliability.

Liu, K. Y.

Negative base encoding in optical linear algebra processors

In the digital multiplication by analog convolution algorithm, the bits of two encoded numbers are convolved to form the product of the two numbers in mixed binary representation; this output can be easily converted to binary. Attention is presently given to negative base encoding, treating base -2 initially, and then showing that the negative base system can be readily extended to any radix. In general, negative base encoding in optical linear algebra processors represents a more efficient technique than either sign magnitude or 2's complement encoding, when the additions of digitally encoded products are performed in parallel.

Perlee, C.

Software package for performing experiments about the convolutionally encoded Voyager 1 link

A software package enabling engineers to conduct experiments to determine the actual performance of long constraint-length convolutional codes over the Voyager 1 communication link directly from the Jet Propulsion Laboratory (JPL) has been developed. Using this software, engineers are able to enter test data from the Laboratory in Pasadena, California. The software encodes the data and then sends the encoded data to a personal computer (PC) at the Goldstone Deep Space Complex (GDSC) over telephone lines. The encoded data are sent to the transmitter by the PC at GDSC. The received data, after being echoed back by Voyager 1, are first sent to the PC at GDSC, and then are sent back to the PC at the Laboratory over telephone lines for decoding and further analysis. All of these operations are fully integrated and are completely automatic. Engineers can control the entire software system from the Laboratory. The software encoder and the hardware decoder interface were developed for other applications, and have been modified appropriately for integration into the system so that their existence is transparent to the users. This software provides: (1) data entry facilities, (2) communication protocol for telephone links, (3) data displaying facilities, (4) integration with the software encoder and the hardware decoder, and (5) control functions.

Cheng, U.

Efficient Encoding and Rendering of Time-Varying Volume Data

Visualization of time-varying volumetric data sets, which may be obtained from numerical simulations or sensing instruments, provides scientists insights into the detailed dynamics of the phenomenon under study. This paper describes a coherent solution based on quantization, coupled with octree and difference encoding for visualizing time-varying volumetric data. Quantization is used to attain voxel-level compression and may have a significant influence on the performance of the subsequent encoding and visualization steps. Octree encoding is used for spatial domain compression, and difference encoding for temporal domain compression. In essence, neighboring voxels may be fused into macro voxels if they have similar values, and subtrees at consecutive time steps may be merged if they are identical. The software rendering process is tailored according to the tree structures and the volume visualization process. With the tree representation, selective rendering may be performed very efficiently. Additionally, the I/O costs are reduced. With these combined savings, a higher level of user interactivity is achieved. We have studied a variety of time-varying volume datasets, performed encoding based on data statistics, and optimized the rendering calculations wherever possible. Preliminary tests on workstations have shown in many cases tremendous reduction by as high as 90% in both storage space and inter-frame delay.

CODING

Encoders for block-circulant LDPC codes

In this paper, we present two encoding methods for block-circulant LDPC codes. The first is an iterative encoding method based on the erasure decoding algorithm, and the computations required are well organized due to the block-circulant structure of the parity check matrix. The second method uses block-circulant generator matrices, and the encoders are very similar to those for recursive convolutional codes. Some encoders of the second type have been implemented in a small Field Programmable Gate Array (FPGA) and operate at 100 Msymbols/second.

encoders

Pneumatic binary encoder replaces multiple solenoid system

Pneumatic binary encoder replaces solenoid system in the pilot stage of a digital actuator. The encoder operates in flip-flop manner to valve gas at either high or low pressures. By rotating the disk in a pinion-to-encoding gear ratio, six to eight adder circuits may be operated from single encoder.

Source record

Differential encoding for multiple amplitude and phase shift keying systems

Because of the symmetry in most two-dimensional signal constellations, ambiguities exist at the receiver as to the exact phase orientation of the received signal set. In PSK systems, this ambiguity is resolved by the use of differential encoding. This paper presents differential encoding techniques which can be used with a variety of symmetric signal sets to remove their phase ambiguity. While not proven to be optimum, the techniques do have low performance penalties relative to the uncoded performance. The key to reducing the performance penalty is to use the minimum amount of differential encoding necessary to resolve the ambiguity. Examples of encoding techniques for several common signal constellations are given, including their performance penalties.

Weber, W. J., III

High data rate Reed-Solomon encoding and decoding using VLSI technology

Presented as an implementation of a Reed-Solomon encode and decoder, which is 16-symbol error correcting, each symbol is 8 bits. This Reed-Solomon (RS) code is an efficient error correcting code that the National Aeronautics and Space Administration (NASA) will use in future space communications missions. A Very Large Scale Integration (VLSI) implementation of the encoder and decoder accepts data rates up 80 Mbps. A total of seven chips are needed for the decoder (four of the seven decoding chips are customized using 3-micron Complementary Metal Oxide Semiconduction (CMOS) technology) and one chip is required for the encoder. The decoder operates with the symbol clock being the system clock for the chip set. Approximately 1.65 billion Galois Field (GF) operations per second are achieved with the decoder chip set and 640 MOPS are achieved with the encoder chip.

Miller, Warner

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.

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.