Engineering topics
Publications and source records attributed to Cheung, Kar-Ming.
This paper describes a systems engineering approach to resource planning by integrating mathematical modeling and constrained optimization, empirical simulation, and theoretical analysis techniques to generate an optimal task plan in the presence of uncertainties.
This document is the viewgraphs that accompanies a paper that presents the preliminary results of an architecture study that provides continuous telemetry coverage for NASA missions for immediate post-separation phase. After launch when the spacecraft separated from the upper stage, the spacecraft typically executes a number of mission-critical operations prior to the deployment of solar panels and the activation of the primary communication subsystem. JPL, GSFC, and APL have similar design principle statements that require continuous coverage of mission-critical telemetry during the immediate post-separation phase. To conform to these design principles, an architecture that consists of a separate spacecraft transmitter and a robust communication network capable of tracking the spacecraft signals is needed. The main results of this study are as follows: 1) At low altitude (< 10000 km) when most post-separation critical operations are executed, Earth-based network (e.g. Deep Space Network (DSN)) can only provide limited coverage, whereas space-based network (e.g. Space Network (SN)) can provide continuous coverage. 2) Commercial-off-the-shelf SN compatible transmitters are available for small satellite applications. In this paper we present the detailed coverage analysis of Earth-based and Space-based networks. We identify the key functional and performance requirements of the architecture, and describe the proposed selection criteria of the spacecraft transmitter. We conclude the paper with a proposed forward plan.
This paper presents the preliminary results of an architecture study that provides continuous telemetry coverage for NASA missions for immediate post-separation phase. This study is a collaboration effort between Jet Propulsion Laboratory (JPL), Goddard Space Flight Center (GSFC), and Applied Physics Laboratory (APL). After launch when the spacecraft separated from the upper stage, the spacecraft typically executes a number of mission-critical operations prior to the deployment of solar panels and the activation of the primary communication subsystem. JPL, GSFC, and APL have similar design principle statements that require continuous coverage of mission-critical telemetry during the immediate post-separation phase. To conform to these design principles, an architecture that consists of a separate spacecraft transmitter and a robust communication network capable of tracking the spacecraft signals is needed.This paper presents the preliminary results of an architecture study that provides continuous telemetry coverage for NASA missions for immediate post-separation phase. This study is a collaboration effort between Jet Propulsion Laboratory (JPL), Goddard Space Flight Center (GSFC), and Applied Physics Laboratory (APL). After launch when the spacecraft separated from the upper stage, the spacecraft typically executes a number of mission-critical operations prior to the deployment of solar panels and the activation of the primary communication subsystem. JPL, GSFC, and APL have similar design principle statements that require continuous coverage of mission-critical telemetry during the immediate post-separation phase. To conform to these design principles, an architecture that consists of a separate spacecraft transmitter and a robust communication network capable of tracking the spacecraft signals is needed. The main results of this study are as follows: 1) At low altitude (< 10000 km) when most post-separation critical operations are executed, Earth-based network (e.g. Deep Space Network (DSN)) can only provide limited coverage, whereas space-based network (e.g. Space Network (SN)) can provide continuous coverage. 2) Commercial-off-the-shelf SN compatible transmitters are available for small satellite applications. In this paper we present the detailed coverage analysis of Earth-based and Space-based networks. We identify the key functional and performance requirements of the architecture, and describe the proposed selection criteria of the spacecraft transmitter. We conclude the paper with a proposed forward plan.
In this article, we describe the communication coverage analysis for the lunar network and the Earth ground stations. The first part of this article focuses on the direct communication coverage of the Moon from the Earth's ground stations. In particular, we assess the coverage performance of the Moon based on the existing Deep Space Network (DSN) antennas and the complimentary coverage of other potential stations at Hartebeesthoek, South Africa and at Santiago, Chile. We also address the coverage sensitivity based on different DSN antenna scenarios and their capability to provide single and redundant coverage of the Moon. The second part of this article focuses on the framework of the constrained optimization scheme to seek a stable constellation six relay satellites in two planes that not only can provide continuous communication coverage to any users on the Moon surface, but can also deliver data throughput in a highly efficient manner.
The orbit selection of telecommunications orbiters is one of the critical design processes and should be guided by global telecom performance metrics and mission-specific constraints. In order to aid the orbit selection, we have coupled the Telecom Orbit Analysis and Simulation Tool (TOAST) with genetic optimization algorithms. As a demonstration, we have applied the developed tool to select an optimal orbit for general Mars telecommunications orbiters with the constraint of being a frozen orbit. While a typical optimization goal is to minimize tele-communications down time, several relevant performance metrics are examined: 1) area-weighted average gap time, 2) global maximum of local maximum gap time, 3) global maximum of local minimum gap time. Optimal solutions are found with each of the metrics. Common and different features among the optimal solutions as well as the advantage and disadvantage of each metric are presented. The optimal solutions are compared with several candidate orbits that were considered during the development of Mars Telecommunications Orbiter.
In this paper we describe an optimal modeling and planning framework for the future large array of DSN antennas. This framework takes into account the array link performance models, reliability models, constrain models, and objective functions, and determines the optimal sub-array clusters configuration that will support the maximum number of concurrent missions based on mission link properties, antenna element reliabilities, mission requests, and array operation constraints. ..
In this paper we address the dilemma of planning in the presence of uncertainty, the problem of scheduling events where some events might have non-deterministic durations.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
In this paper we describe an orbit design aide tool, called Telecom Orbit Analysis and Simulation Tool(TOAST). Although it can be used for studying and selecting orbits for any planet, we solely concentrate on its use for Mars. By specifying the six orbital elements for an orbit, a time frame of interest, a horizon mask angle, and some telecom parameters such as the transmitting power, frequency, antenna gains, antenna losses, link margin, received threshold powers for the rates, etc. this tool enables the user to view the animation of the orbit in two and three-dimensional different telecom metrics at any point on the Mars, namely the global planetary map.
In this paper, we describe the development roadmap and discuss the various challenges of an evolvable and extensible multi-mission telecom planning and analysis framework. Our long-term goal is to develop a set of powerful flexible telecommunications analysis tools that can be easily adapted to different missions while maintain the common Deep Space Communication requirements. The ability of re-using the DSN ground models and the common software utilities in our adaptations has contributed significantly to our development efforts measured in terms of consistency, accuracy, and minimal effort redundancy, which can translate into shorter development time and major cost savings for the individual missions. In our roadmap, we will address the design principles, technical achievements and the associated challenges for following telecom analysis tools (i) Telecom Forecaster Predictor - TFP (ii) Unified Telecom Predictor - UTP (iii) Generalized Telecom Predictor - GTP (iv) Generic TFP (v) Web-based TFP (vi) Application Program Interface - API (vii) Mars Relay Network Planning Tool - MRNPT.
Radiotelemetry, by definition, is the science and technology of automatic measurement and transmission of data by radio from remote sources, as from space vehicles, to receiving stations for recording and analyis. It involves the preparatio of data generated at remote sources, the transmission of data through radio channels, and the processing of data at the recieving stations. Behind these three tasks, how to convey the information in a reliable and timely manner through a communication link is the most fundamental problem to be addressed in this field.
Modified mean-pyramid coding scheme requires transmission of slightly fewer data. Data-expansion factor reduced from 1/3 to 1/12. Schemes for progressive transmission of image data transmitted in sequence of frames in such way coarse version of image reconstructed after receipt of first frame and increasingly refined version of image reconstructed after receipt of each subsequent frame.
Adaptive variable-length coding scheme for compression of stream of independent and identically distributed source data involves either Huffman code or alternating run-length Huffman (ARH) code, depending on characteristics of data. Enables efficient compression of output of lossless or lossy precompression process, with speed and simplicity greater than those of older coding schemes developed for same purpose. In addition, scheme suitable for parallel implementation on hardware with modular structure, provides for rapid adaptation to changing data source, compatible with block orientation to alleviate memory requirements, ensures efficiency over wide range of entropy, and easily combined with such other communication schemes as those for containment of errors and for packetization.
In a time-varying signal-to-noise-ratio (SNR) environment, symbol rate is changed to maximize data return. However, the symbol-rate changes may cause the receiver symbol loop to lose lock, thus losing real-time data. We propose an alternate way of varying the data rate in a seamless fashion by puncturing the convolutionally encoded symbol stream and transmitting the punctured encoded symbols with a constant symbol rate. We systematically searched for good puncturing patterns for the Galileo (14,1/4) convolutional code and changed the data rates by using the punctured codes to match the Galileo SNR profile of November 9, 1997. We concluded that this scheme reduces the symbol-rate changes from 9 to 2 and provides a larger data return and a higher symbol SNR during most of the day.
Synchronization times reduced to reduce loss of data. Scheme for decoding received doubly encoded binary-data signal provides for joint synchronization of two decoders. Applies to concatenated error-correcting channel coding communication system in which, at transmitter, data first encoded by interleaved Reed-Solomon code (block code), then by convolutional code.
Several refinements introduced to improve performance of data-compression scheme described in "Adaptive Vector-Quantization Scheme" (NPO-18186). Principal advantages of LAVQ are that complexity and coding time less than those of some other data-compression schemes. Also, does not require priori knowledge of either codebook or statistics of source data.
Algorithm computes coefficients of integer cosine transforms, containing only integer coefficients approximately proportional to floating-point coefficients of discrete cosine transforms. Used in compression of image data in blocks of N x N pixels, discrete cosine transforms involve large amounts of computation, typically amounting to 80 percent of computational load in data-compression scheme. In constructing integer approximations, competing requirements are to obtain data-compression and data-decompression performances comparable to those of corresponding descrete cosine transforms while taking advantage of simplicity afforded by integer arithmetic to reduce complexity and amount of computation.