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 · Engineering Papers
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.
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.
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.
Explore the source record for details and available documents.
Resin Transfer Molding (RTM) has the potential of becoming one of the most cost effective ways of producing composite structures since the raw materials used, resin and dry fabric, are less costly than prepregs. Unfortunately these low material costs are offset by the high labor costs incurred to layup the dry fabric into 3D shapes. To reduce the layup costs, double diaphragm forming is being investigated as a potential technique for creating a complex 3D preform from a simple flat layup. As part of our effort to develop double diaphragm forming into a production capable process, we have undertaken a series of experiments to investigate the interactions between process parameters, mold geometry, fabric weave, tow size, and the quality of the formed part. The results of these tests will be used to determine the forming geometry limitations of double diaphragm forming and to characterize the formability of fabric configurations. An important part of this work was the development of methods to measure and analyze fiber orientations, deformation angles, tow spreading, and shape conformation of the formed parts. This paper will describe the methods used to mark plies, the double diaphragm forming process, the techniques used to measure the formed parts, and the calculation of the parameters of interest. The results can be displayed as 3D contour plots. These experimental results have also been used to verify and improve a computer model which simulates the draping of fabrics over 3D mold shapes.
The inherent aspects and flaws surrounding space based communication is technically described and the math surrounding encoding and decoding LT Codes is examined. Utilizing LT codes as a means of reducing packet erasures due to corrupted packets on an RF link can result in higher voice quality. PESQ-MOS measure was used to analyze voice degradation over space links tested for LT codec size and number of 10ms per packet.Extensions utilizing LT codes to improve the packet erasure performance and combining the use of ASR could provide for a solid means of identifying the benefit in terms of intelligibility of voice communications in space-based networks
Explore the source record for details and available documents.