Engineering Papers⌕ Search

Engineering topics

Cheung, Kar-Ming

Publications and source records attributed to Cheung, Kar-Ming.

103 records · Page 6

An image assessment study of image acceptability of the Galileo low gain antenna mission

This paper describes a study conducted by NASA Ames Research Center (ARC) in collaboration with the Jet Propulsion Laboratory (JPL), Pasadena, California on the image acceptability of the Galileo Low Gain Antenna mission. The primary objective of the study is to determine the impact of the Integer Cosine Transform (ICT) compression algorithm on Galilean images of atmospheric bodies, moons, asteroids and Jupiter's rings. The approach involved fifteen volunteer subjects representing twelve institutions involved with the Galileo Solid State Imaging (SSI) experiment. Four different experiment specific quantization tables (q-table) and various compression stepsizes (q-factor) to achieve different compression ratios were used. It then determined the acceptability of the compressed monochromatic astronomical images as evaluated by Galileo SSI mission scientists. Fourteen different images were evaluated. Each observer viewed two versions of the same image side by side on a high resolution monitor, each was compressed using a different quantization stepsize. They were requested to select which image had the highest overall quality to support them in carrying out their visual evaluations of image content. Then they rated both images using a scale from one to five on its judged degree of usefulness. Up to four pre-selected types of images were presented with and without noise to each subject based upon results of a previously administered survey of their image preferences. Fourteen different images in seven image groups were studied. The results showed that: (1) acceptable compression ratios vary widely with the type of images; (2) noisy images detract greatly from image acceptability and acceptable compression ratios; and (3) atmospheric images of Jupiter seem to have higher compression ratios of 4 to 5 times that of some clear surface satellite images.

Chuang, S. L.↗

Decoder Synchronization for Deep Space Missions

The Consultative committee for Space Data STandards (CCSDS) recommends that space communication links employ a concatenated error-correcting channel-coding system in which the inner code is a convolutional (7, 2/2) code and the outer code is a (255,223) Reed-Solomon code.

Decoder↗

Advances In Coding For Nearly Errorless Communication

Report surveys state of art of coding digital data for nearly errorless communication over long distances. Coding techniques described include mainly ones that have been or might be used to transmit imagery and/or other data from spacecraft to receivers on Earth.

Cheung, Kar-Ming↗

Low-Complexity Progressive Image-Transmission Schemes For Space Applications

This paper describes the use of combination of multiresolution image representation and data compression techniques to reduce transmission time and permit early recognition of images. Data compression removes the inherent redundancies in the image data to reduce the overal data volume.

Image Transmission↗

Proposed data compression schemes for the Galileo S-band contingency mission

The Galileo spacecraft is currently on its way to Jupiter and its moons. In April 1991, the high gain antenna (HGA) failed to deploy as commanded. In case the current efforts to deploy the HGA fails, communications during the Jupiter encounters will be through one of two low gain antenna (LGA) on an S-band (2.3 GHz) carrier. A lot of effort has been and will be conducted to attempt to open the HGA. Also various options for improving Galileo's telemetry downlink performance are being evaluated in the event that the HGA will not open at Jupiter arrival. Among all viable options the most promising and powerful one is to perform image and non-image data compression in software onboard the spacecraft. This involves in-flight re-programming of the existing flight software of Galileo's Command and Data Subsystem processors and Attitude and Articulation Control System (AACS) processor, which have very limited computational and memory resources. In this article we describe the proposed data compression algorithms and give their respective compression performance. The planned image compression algorithm is a 4 x 4 or an 8 x 8 multiplication-free integer cosine transform (ICT) scheme, which can be viewed as an integer approximation of the popular discrete cosine transform (DCT) scheme. The implementation complexity of the ICT schemes is much lower than the DCT-based schemes, yet the performances of the two algorithms are indistinguishable. The proposed non-image compression algorith is a Lempel-Ziv-Welch (LZW) variant, which is a lossless universal compression algorithm based on a dynamic dictionary lookup table. We developed a simple and efficient hashing function to perform the string search.

Cheung, Kar-Ming↗

On the decoder error probability of block codes

By using coding and combinational techniques, an explicit formula is derived which enumerates the complete weight distribution of decodable words of block codes using partially known weight distributions. Also an approximation formula for nonbinary block codes is obtained. These results in turn give exact and approximate expressions for the decoder error probability PE(u) of block codes.

Cheung, Kar-Ming↗

Fast Transform Decoding Of Nonsystematic Reed-Solomon Codes

Fast, efficient Fermat number transform used to compute F'(x) analogous to computation of syndrome in conventional decoding scheme. Eliminates polynomial multiplications and reduces number of multiplications in reconstruction of F'(x) to n log (n). Euclidean algorithm used to evaluate F(x) directly, without going through intermediate steps of solving error-locator and error-evaluator polynomials. Algorithm suitable for implementation in very-large-scale integrated circuits.

Truong, Trieu-Kie↗

Adaptive Vector-Quantization Scheme

Adaptive vector-quantization scheme provides for rapid encoding of signals for transmission in compressed form and for rapid decoding at receiver. Based on simple heuristic "move-to-front" protocol effecting lossless compression of high-rate textual data. Audio, video, or other signals compressed efficiently.

Cheung, Kar-Ming↗

Procedure For Labeling Linear Finite-State Codes

Method for labeling state diagrams of linear finite-state codes developed. Simplifies implementation of encoder hardware. Used to label state diagram not completely connected to obtain linear finite-state code that has larger free distance.

Cheung, Kar-Ming↗

More on the decoder error probability for Reed-Solomon codes

The decoder error probability for Reed-Solomon codes (more generally, linear maximum distance separable codes) is examined. McEliece and Swanson offered an upper bound on P sub E (u), the decoder error probability given that u symbol errors occur. This upper bound is slightly greater than Q, the probability that a completely random error pattern will cause decoder error. By using a combinatoric technique, the principle of inclusion and exclusion, an exact formula for P sub E (u) is derived. The P sub E (u) for the (255,223) Reed-Solomon Code used by NASA, and for the (31,15) Reed-Solomon code (JTIDS code), are calculated using the exact formula, and the P sub E (u)'s are observed to approach the Q's of the codes rapidly as u gets larger. An upper bound for the expression is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P sub E (u) indeed approaches Q as u becomes large, and some laws of large numbers come into play.

Cheung, Kar-Ming↗

More On The Decoder-Error Probability Of Reed-Solomon Codes

Paper extends theory of decoder-error probability for linear maximum-distance separable (MDS) codes. General class of error-correcting codes includes Reed-Solomon codes, important in communications with distant spacecraft, military communications, and compact-disk recording industry. Advancing beyond previous theoretical developments that placed upper bounds on decoder-error probabilities, author derives an exact formula for probability PE(u) that decoder will make error when u code symbols in error.

Cheung, Kar-Ming↗

The undetected error probability for Reed-Solomon codes

McEliece and Swanson (1986) offered an upper bound on P(E)u, the decoder error probability given u symbol errors occur. In the present study, by using a combinatoric technique such as the principle of inclusion and exclusion, an exact formula for P(E)u is derived. The P(E)u of a maximum distance separable code is observed to approach Q rapidly as u gets large, where Q is the probability that a completely random error pattern will cause decoder error. An upper bound for the expansion P(E)u/Q - 1 is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P(E)u indeed approaches Q as u becomes large, and that some laws of large number come into play.

Cheung, Kar-Ming↗