Engineering Papers⌕ Search

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 91 records · Page 5

LUNA Condition-Based Monitoring Update: Auto-encoders on Actuator Data [Slides]

An auto-encoder is a neural network trained to output a reconstruction of its input. There is a ‘bottleneck’ layer whose dimension is typically lower than that of the input. Because the input passes through the bottleneck, the auto-encoder must learn to compress (encode) the input into this low-dimensional form, and to decompress (decode) the compressed data into a close approximation of its original form.

97 MATHEMATICS AND COMPUTING↗

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↗

Adaptive delta modulation systems for video encoding

This paper describes several adaptive delta modulators designed to encode video signals. One- and two-dimensional ADM algorithms are discussed and compared. Results are shown for bit rates of 2 bits/pixel, 1 bit/pixel and 0.5 bits/pixel. Pictures showing the difference between the encoded-decoded pictures and the original pictures are presented. Results are also presented to illustrate the effect of channel errors on the reconstructed picture. A two-dimensional ADM using interframe encoding is also presented. This system operates at the rate of 2 bits/pixel and produces excellent quality pictures when there is little motion. We also describe and illustrate the effect of large amounts of motion on the reconstructed picture.

Lei, T.-L. R.↗

The effect of interference on delta modulation encoded video signals

The results of a study on the use of the delta modulator as a digital encoder of television signals are presented. The computer simulation was studied of different delta modulators in order to find a satisfactory delta modulator. After finding a suitable delta modulator algorithm via computer simulation, the results are analyzed and then implemented in hardware to study the ability to encode real time motion pictures from an NTSC format television camera. The effects were investigated of channel errors on the delta modulated video signal and several error correction algorithms were tested via computer simulation. A very high speed delta modulator was built (out of ECL logic), incorporating the most promising of the correction schemes, so that it could be tested on real time motion pictures. The final area of investigation concerned itself with finding delta modulators which could achieve significant bandwidth reduction without regard to complexity or speed. The first such scheme to be investigated was a real time frame to frame encoding scheme which required the assembly of fourteen, 131,000 bit long shift registers as well as a high speed delta modulator. The other schemes involved two dimensional delta modulator algorithms.

Schilling, D. L.↗

A bit transition density encoder for the Space Shuttle 2 MHz data channel

As a result of several unique factors, the 2 MHz data channel which carries science data from the various experiments aboard the Space Shuttle through the Tracking and Data Relay Satellite System (TDRSS) lacks sufficient bit transition density to satisfy the bit synchronizer requirements at the ground station. It is noted that six encoding techniques were examined, and all but one, a PN cover sequence (Reset Bit Scrambler) were dismissed because of incompatibility with system constraints. The rationale behind the particular PN sequence chosen, the way it was truncated, and the new sequence properties are presented. The properties of the raw data stream are analyzed, as are the encoded sequence properties, including transition density. Diagrams of the encoder and decoder are included.

Schoggen, W. O.↗

VLSI Reed-Solomon Encoder

Modular Reed-solomon encoder uses identical custom VLSI chips called "symbol slices." By cascading and properly interconnecting group of these chips, encoder is made for any desired error-correcting capability and interleaving level. VLSI encoder requires only one-tenth the number of chips required by conventional Reed-Solomon Circuit implemented with discrete IC's.

Liu, K. Y.↗

Processing circuit with asymmetry corrector and convolutional encoder for digital data

A processing circuit is provided for correcting for input parameter variations, such as data and clock signal symmetry, phase offset and jitter, noise and signal amplitude, in incoming data signals. An asymmetry corrector circuit performs the correcting function and furnishes the corrected data signals to a convolutional encoder circuit. The corrector circuit further forms a regenerated clock signal from clock pulses in the incoming data signals and another clock signal at a multiple of the incoming clock signal. These clock signals are furnished to the encoder circuit so that encoded data may be furnished to a modulator at a high data rate for transmission.

Pfiffner, Harold J.↗

Pulse Vector-Excitation Speech Encoder

Proposed pulse vector-excitation speech encoder (PVXC) encodes analog speech signals into digital representation for transmission or storage at rates below 5 kilobits per second. Produces high quality of reconstructed speech, but with less computation than required by comparable speech-encoding systems. Has some characteristics of multipulse linear predictive coding (MPLPC) and of code-excited linear prediction (CELP). System uses mathematical model of vocal tract in conjunction with set of excitation vectors and perceptually-based error criterion to synthesize natural-sounding speech.

Davidson, Grant↗

VLSI Reed-Solomon Encoder With Interleaver

Size, weight, and susceptibility to burst errors reduced. Encoding system built on single very-large-scale integrated (VLSI) circuit chip produces (255,223) Reed-Solomon (RS) code with programmable interleaving up to depth of 5. (225,223) RS encoder includes new remainder-and-interleaver unit providing programmable interleaving of code words. Remainder-and-interleaver unit contains shift registers and modulo-2 adders. Signals on "turn" and "no-turn" lines control depth of interleaving. Based on E. R. Berlekamp's bit-serial multiplication algorithm for (225,223) RS encoder over Galois Field (2 to the 8th power).

Hsu, In-Shek↗

Optical Pseudocolor Encoding Of Gray-Scale Image

Optical encoding much faster than digital electronic encoding. In optical pseudocolor-encoding apparatus brightness modulation in image from television camera transformed into polarization modulation in LCTV, and then into pseudocolor modulation in image on projection screen. Advantageous for such purposes as thermography, inspection of circuit boards, mammography, and mapping.

Chao, Tien-Hsin↗

Encoding techniques for complex information structures in connectionist systems

Two general information encoding techniques called relative position encoding and pattern similarity association are presented. They are claimed to be a convenient basis for the connectionist implementation of complex, short term information processing of the sort needed in common sense reasoning, semantic/pragmatic interpretation of natural language utterances, and other types of high level cognitive processing. The relationships of the techniques to other connectionist information-structuring methods, and also to methods used in computers, are discussed in detail. The rich inter-relationships of these other connectionist and computer methods are also clarified. The particular, simple forms are discussed that the relative position encoding and pattern similarity association techniques take in the author's own connectionist system, called Conposit, in order to clarify some issues and to provide evidence that the techniques are indeed useful in practice.

Barnden, John↗