Prioritized Luby Transform (LT) Codes
This viewgraph presentation describes a prioritized Luby Transform coding scheme that seeks to decode high priority data with high reliability, when decoders fail.
SEARCH · Search NASA
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.
This viewgraph presentation describes a prioritized Luby Transform coding scheme that seeks to decode high priority data with high reliability, when decoders fail.
The logic modules and data structures composing the Meta-translator module are desribed. This module is responsible for the actual generation of the executable language compiler as a function of the input Meta-language. Machine definitions are also processed and are placed as encoded data on the compiler library data file. The transformation of intermediate language in target language object text is described.
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.
A data compression algorithm involving vector quantization (VQ) and the discrete wavelet transform (DWT) is applied to two different types of multidimensional digital earth-science data. The algorithms (WVQ) is optimized for each particular application through an optimization procedure that assigns VQ parameters to the wavelet transform subbands subject to constraints on compression ratio and encoding complexity. Preliminary results of compressing global ocean model data generated on a Thinking Machines CM-200 supercomputer are presented. The WVQ scheme is used in both a predictive and nonpredictive mode. Parameters generated by the optimization algorithm are reported, as are signal-to-noise (SNR) measurements of actual quantized data. The problem of extrapolating hydrodynamic variables across the continental landmasses in order to compute the DWT on a rectangular grid is discussed. Results are also presented for compressing Landsat TM 7-band data using the WVQ scheme. The formulation of the optimization problem is presented along with SNR measurements of actual quantized data. Postprocessing applications are considered in which the seven spectral bands are clustered into 256 clusters using a k-means algorithm and analyzed using the Los Alamos multispectral data analysis program, SPECTRUM, both before and after being compressed using the WVQ program.
High-speed, low-power, reconfigurable electronic hardware has been developed to implement ICER-3D, an algorithm for compressing hyperspectral-image data. The algorithm and parts thereof have been the topics of several NASA Tech Briefs articles, including Context Modeler for Wavelet Compression of Hyperspectral Images (NPO-43239) and ICER-3D Hyperspectral Image Compression Software (NPO-43238), which appear elsewhere in this issue of NASA Tech Briefs. As described in more detail in those articles, the algorithm includes three main subalgorithms: one for computing wavelet transforms, one for context modeling, and one for entropy encoding. For the purpose of designing the hardware, these subalgorithms are treated as modules to be implemented efficiently in field-programmable gate arrays (FPGAs). The design takes advantage of industry- standard, commercially available FPGAs. The implementation targets the Xilinx Virtex II pro architecture, which has embedded PowerPC processor cores with flexible on-chip bus architecture. It incorporates an efficient parallel and pipelined architecture to compress the three-dimensional image data. The design provides for internal buffering to minimize intensive input/output operations while making efficient use of offchip memory. The design is scalable in that the subalgorithms are implemented as independent hardware modules that can be combined in parallel to increase throughput. The on-chip processor manages the overall operation of the compression system, including execution of the top-level control functions as well as scheduling, initiating, and monitoring processes. The design prototype has been demonstrated to be capable of compressing hyperspectral data at a rate of 4.5 megasamples per second at a conservative clock frequency of 50 MHz, with a potential for substantially greater throughput at a higher clock frequency. The power consumption of the prototype is less than 6.5 W. The reconfigurability (by means of reprogramming) of the FPGAs makes it possible to effectively alter the design to some extent to satisfy different requirements without adding hardware. The implementation could be easily propagated to future FPGA generations and/or to custom application-specific integrated circuits.
A spectrometric imager and a thermal imager, which achieve multiplexing by the use of binary optical encoding masks, were developed. The masks are based on orthogonal, pseudorandom digital codes derived from Hadamard matrices. Spatial and/or spectral data is obtained in the form of a Hadamard transform of the spatial and/or spectral scene; computer algorithms are then used to decode the data and reconstruct images of the original scene. The hardware, algorithms and processing/display facility are described. A number of spatial and spatial/spectral images are presented. The achievement of a signal-to-noise improvement due to the signal multiplexing was also demonstrated. An analysis of the results indicates both the situations for which the multiplex advantage may be gained, and the limitations of the technique. A number of potential applications of the spectrometric imager are discussed.
A set of recursive rules which generate unitary transforms with a fast algorithm are presented. For each rule, simple relations give the number of elementary operations required by the fast algorithm. The common Fourier, Walsh-Hadamard, Slant, and Haar transforms are expressed with these rules. The framework developed allows the introduction of generalized transforms which include all common transforms in a large class of identical computation transforms. A systematic and unified view is provided for unitary transforms which have appeared in the literature and for a number of new transforms of potential interest. Generalization to complex and multidimensional unitary transforms is considered.
An imager and a spectrometric imager, which achieve multiplexing by the use of binary optical encoding masks, have been built and tested. The masks are based on orthogonal, pseudorandom digital codes derived from Hadamard matrices. The spatial (and/or spectral) data are therefore obtained in the form of a Hadamard transform of the spatial (and/or spectral) scene. Computer algorithms are used to decode the data and reconstruct images of the original scene. The hardware, algorithms processing and display facility are described. A number of spatial and spatial/spectral images, obtained in the laboratory, are presented.
It is common in data transmissions that some information is more important than others. This is especially true in space communications where mission critical information or science data are high priority. In this work, we propose a simple yet constructive scheme to send high priority data reliably and efficiently using Luby Transform (LT) codes. The new proposed scheme modifies the conventional LT encoder to send high priority data as a degree 1 and 2 so that high priority data can be quickly resolved and very likely recovered before a decoder stops. Preliminary results show that a carefully designed degree distribution of high priority data increases the likelihood of receiving high priority information while having negligible performance impact on data with lower priority. The performance of the proposed scheme is evaluated and compared with the conventional LT approach with the same parameters under a range of erasure error rates.
Data compression coding requirements for aerospace applications differ somewhat from the compression requirements for entertainment systems. On the one hand, entertainment applications are bit rate driven with the goal of getting the best quality possible with a given bandwidth. Science applications are quality driven with the goal of getting the lowest bit rate for a given level of reconstruction quality. In the past, the required quality level has been nothing less than perfect allowing only the use of lossless compression methods (if that). With the advent of better, faster, cheaper missions, an opportunity has arisen for lossy data compression methods to find a use in science applications as requirements for perfect quality reconstruction runs into cost constraints. This paper presents a review of the data compression problem from the space application perspective. Transform coding techniques are described and some simple, integer transforms are presented. The application of these transforms to space-based data compression problems is discussed. Integer transforms have an advantage over conventional transforms in computational complexity. Space applications are different from broadcast or entertainment in that it is desirable to have a simple encoder (in space) and tolerate a more complicated decoder (on the ground) rather than vice versa. Energy compaction with new transforms are compared with the Walsh-Hadamard (WHT), Discrete Cosine (DCT), and Integer Cosine (ICT) transforms.
The use of Cayley-Rodrigues attitude parameters as kinematic variables is shown to yield a globally linearized and decoupled model of the equations of motion of a deformable body, where the structural deformation state appears only in the coefficients of the inverse transformation. It is shown how commanded multiaxial attitude maneuvers can be encoded as switching surfaces for a variable-structure control implementation of the corresponding computed slew torques, automatically modulated in respnse only to detected angular rate error signs, for accurate tracking in the presence of separately damped or even uncontrolled (but stable) structural deformations.
Statistical encoding techniques enable the reduction of the number of bits required to encode a set of symbols, and are derived from their probabilities. Huffman encoding is an example of statistical encoding that has been used for error-free data compression. The degree of compression given by Huffman encoding in this application can be improved by the use of prediction methods. These replace the set of elevations by a set of corrections that have a more advantageous probability distribution. In particular, the method of Lagrange Multipliers for minimization of the mean square error has been applied to local geometrical predictors. Using this technique, an 8-point predictor achieved about a 7 percent improvement over an existing simple triangular predictor.
An efficient protocol for the production of transgenic Brassica napus cv. Westar plants was developed by optimizing two important parameters: preconditioning time and co-cultivation time. Agrobacterium tumefaciens-mediated transformation was performed using hypocotyls as explant tissue. Two variants of a green fluorescent protein (GFP)-encoding gene--mGFP5-ER and eGFP--both under the constitutive expression of the cauliflower mosaic virus 35S promoter, were used for the experiments. Optimizing the preconditioning time to 72 h and co-cultivation time with Agrobacterium to 48 h provided the increase in the transformation efficiency from a baseline of 4% to 25%. With mGFP5-ER, the transformation rate was 17% and with eGFP it was 25%. Transgenic shoots were selected on 200 mg/l kanamycin. Rooting efficiency was 100% on half-strength Murashige and Skoog medium with 10 g/l sucrose and 0.5 mg/l indole butyric acid in the presence of kanamycin.
An experimental investigation of the Deformable Mirror Device (DMD) developed by Texas Instruments at Dallas for use in object identification was completed. The DMD was tested as a joint correlator. The DMD was used as a spatial light modulator on which the squared modulus of the Fourier transform of test object pairs was written. The squared modulus was phase encoded on the DMD after it had been thresholded and rewritten as a binary phase function. The thresholding was found to produce a sharp peak in the autocorrelation when the test objects were matched and no significant peak in the case of distinct objects. It was concluded that the use of the DMD as a joint correlator looks promising and further studies should be carried out.
Composite color television signals are sampled at four times the color subcarrier and transformed using intraframe two dimensional Walsh functions. It is shown that by properly sampling a composite color signal and employing a Walsh transform the YIQ time signals which sum to produce the composite color signal can be represented, in the transform domain, by three component signals in space. By suitably zonal quantizing the transform coefficients, the YIQ signals can be processed independently to achieve data compression and obtain the same results as component coding. Computer simulations of three bandwidth compressors operating at 1.09, 1.53 and 1.8 bits/ sample are presented. The above results can also be applied to the PAL color system.
A mathematical approach was used to compare interferometric spectrometers and Hadamard transform spectrometers. The principle results are reported, noting that the simple Hadamard spectrometer encodes more efficiently than a Michelson interferometer which, in turn, encodes less efficiently than is usually acknowledged. Hirschfeld's (1977) major objections to these findings are discussed, although it is noted that none of his objections is supported by evidence.
An algorithm for computing a Fourier-like transform over GF(2 to the (second power) to the n power), where n = 1,2,3,4,5, was developed to encode and decode and Reed-Solomon (RS) codes of length 2 to the (second power) to the n power. Such as RS detector is considerably faster than a decoder that uses the conventional fast transform over GF(2 to the (second power) to the n power).
A set of software programs which simulates a (255,223) Reed-Solomon encoder/decoder pair is described. The transform decoder algorithm uses a modified Euclid algorithm, and closely follows the pipeline architecture proposed for the hardware decoder. Uncorrectable error patterns are detected by a simple test, and the inverse transform is computed by a finite field FFT. Numerical examples of the decoder operation are given for some test codewords, with and without errors. The use of the software package is briefly described.