[ { "id": "authors:g6cjr-csr55", "collection": "authors", "collection_id": "g6cjr-csr55", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220622-607541400", "type": "article", "title": "A Minimal Architecture for Real-Time Lunar Surface Positioning Using Joint Doppler and Ranging", "author": [ { "family_name": "Jun", "given_name": "William W.", "orcid": "0000-0002-2768-4882", "clpid": "Jun-William-W" }, { "family_name": "Cheung", "given_name": "Kar-Ming", "clpid": "Cheung-Kar-Ming" }, { "family_name": "Lightsey", "given_name": "Edgar Glenn", "orcid": "0000-0003-3261-064X", "clpid": "Lightsey-Edgar-Glenn" }, { "family_name": "Lee", "given_name": "Charles", "clpid": "Lee-Charles" } ], "abstract": "A positioning solution for users on the lunar surface is required for the success of upcoming missions. Technological advancements have enabled the use of accurate range and Doppler measurements from a lunar orbiter. This article introduces a filtered approach of joint Doppler and ranging (JDR), a minimal architecture that requires as few as one lunar orbiter to perform 3D positioning of lunar surface vehicles. The simulated performance of JDR and Doppler-based positioning methods is compared. Two lunar satellites are simulated: The lunar relay satellite (LRS) in a 12-h frozen orbit with its apogee above the lunar south pole, and the lunar reconnaissance orbiter in a 2-h Polar orbit. The analysis interval is 8 h over a single LRS ground pass. The ground pass has only a few intervals where both satellites are visible to the user and reference station on the lunar south pole. Navigation nodes are simulated with synchronized clocks for all methods. Measurement and satellite ephemeris errors are embedded into a Monte Carlo simulation to evaluate 3D positioning error. The relative JDR method obtains the lowest and most consistent overall 3D root mean squared error, averaging around 10\u201315 m. The absolute positioning methods are limited by satellite orbit height and other factors. Ultimately, JDR is able to provide reasonably accurate positioning knowledge to users with a minimal required infrastructure. Though this article introduces JDR on the Moon, the same architecture can be applied for other celestial bodies like Venus, Mars, Titan, and asteroids.", "doi": "10.1109/taes.2021.3122876", "issn": "0018-9251", "publisher": "IEEE", "publication": "IEEE Transactions on Aerospace and Electronic Systems", "publication_date": "2022-04", "series_number": "2", "volume": "58", "issue": "2", "pages": "1367-1376" }, { "id": "authors:tvjcm-afq06", "collection": "authors", "collection_id": "tvjcm-afq06", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191106-140426464", "type": "book_section", "title": "Coherent optical focal plane array receiver for PPM signals: investigation and applications", "author": [ { "family_name": "Mu\u00f1oz Fern\u00e1ndez", "given_name": "M.", "clpid": "Mu\u00f1oz-Fern\u00e1ndez-M" }, { "family_name": "Cheung", "given_name": "K. M.", "clpid": "Cheung-Kar-Ming" }, { "family_name": "Mukai", "given_name": "R.", "clpid": "Mukai-Ryan" } ], "contributor": [ { "family_name": "Majumdar", "given_name": "Arun K.", "clpid": "Majumdar-A-K" }, { "family_name": "Davis", "given_name": "Christopher C.", "clpid": "Davis-C-C" } ], "abstract": "The performance of a coherent optical focal plane array receiver for PPM signals under atmospheric turbulence is investigated and applications of this system are addressed. The experimental demonstration of this project has already been explained in previous publications. This article shows a more exhaustive analysis of the expressions needed to obtain the Bit Error Rate (BER) for the real system under study in the laboratory, specifically an approach using the Saddle-Point approximation of the Marcum-Q function. Selected experimental results of this system are described and compared with theoretical BER expressions, and array combining gains are presented. Receiver sensitivity in terms of photons per bit (PPB) is examined; BER results are shown as a function of signal to noise ratios (SNR) as well as a function of photons per bit.", "doi": "10.1117/12.681534", "publisher": "Society of Photo-Optical Instrumentation Engineers (SPIE)", "publication_date": "2006-09-01" }, { "id": "authors:wewad-kt087", "collection": "authors", "collection_id": "wewad-kt087", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170622-134209135", "type": "book_section", "title": "Locally Adaptive Vector Quantization For Image Compression", "book_title": "Proceedings. 1991 IEEE International Symposium on Information Theory", "author": [ { "family_name": "Goodman", "given_name": "Rodney M.", "clpid": "Goodman-R-M" }, { "family_name": "Sayano", "given_name": "Masahiro", "clpid": "Sayano-Masahiro" }, { "family_name": "Cheung", "given_name": "Kar-Ming", "clpid": "Cheung-Kar-Ming" }, { "family_name": "Pollara", "given_name": "Fabrizio", "clpid": "Pollara-F" } ], "abstract": "In this paper we study various improvements to a locally \nadaptive vector quantization (LAVQ) algorithm. The \neffects of including bit stripping, index compression, and filtering techniques will be discussed. Software implementation and comparisons with non-adaptive vector \nquantization algorithms will be studied.", "doi": "10.1109/ISIT.1991.695306", "isbn": "0-7803-0056-4", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "1991-06", "pages": "250" }, { "id": "authors:hhqhq-9wa45", "collection": "authors", "collection_id": "hhqhq-9wa45", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120216-080309345", "type": "book_section", "title": "The undetected error probability for Reed-Solomon codes", "author": [ { "family_name": "Cheung", "given_name": "Kar-Ming", "clpid": "Cheung-Kar-Ming" }, { "family_name": "McEliece", "given_name": "Robert J.", "clpid": "McEliece-R-J" } ], "abstract": "This paper is an extension of a recent paper by McEliece\nand Swanson dealing with the decoder error probability for Reed-Solomon codes {more generally, linear MDS codes). McEliece\nand Swanson offered an upper bound on P_E(u), the decoder\nerror probability given u symbol errors occur. In this paper,\nby using combinatoric technique like the principle of inclusion\nand exclusion, an exact formula for P_E(u) is derived. The\nP_E(u) of an MDS code is observed to approach Q rapidly as\nu gets large, where Q is the probability that a compltely random error pattern will cause decoder error. An upper bound for the expression \u2502P_E(u)/Q-1\u2502 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 some laws of large number come info play somehow.", "doi": "10.1109/MILCOM.1988.13385", "publisher": "IEEE", "publication_date": "1988-10" } ]