Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Engineering
Nonlinear Observability Analysis Of Bearing-Only Cooperative Localization Using Graph Theory, Rajnikant Sharma
Nonlinear Observability Analysis Of Bearing-Only Cooperative Localization Using Graph Theory, Rajnikant Sharma
Faculty Publications
In this report we investigate the nonlinear observability properties of bearing-only cooperative localization. We establish a link between observability and a graph representing measurements and communication between the robots.
Observability Analysis Of Bearing-Only Cooperative Localization, Rajnikant Sharma
Observability Analysis Of Bearing-Only Cooperative Localization, Rajnikant Sharma
Faculty Publications
In this report we investigate the nonlinear observability properties of bearing-only cooperative localization. We establish a link between observability and a graph representing measurements and communication between the robots. It is shown that graph theoretic properties like the connectivity and the existence of a path between two nodes can be used to explain the observability of the system.
Qpsk And Oqpsk In Frequency Nonselective Fading, Michael D. Rice
Qpsk And Oqpsk In Frequency Nonselective Fading, Michael D. Rice
Faculty Publications
The maximum likelihood estimator for the fading gain in a frequency non-selective fading channel is derived and analyzed for offset QPSK (OQPSK). The corresponding impact of estimator errors on the bit error probability performance for OQPSK is also derived.
Summary Of Feedback Edge Set Papers, Jonathan Johnson
Summary Of Feedback Edge Set Papers, Jonathan Johnson
Faculty Publications
The problem of finding a set of edges F from a directed graph G = (V,E) such that the graph G0 = (V,E − F) contains no cycles is known as the feedback edge set (FES) problem or the feedback arc set problem. A related problem is the minimum feedback edge set problem, in which the feedback edge set F must be minimal. The feedback edge set problem has application in applying a common reliability technique called triple modular redundancy to FPGA circuit designs where configuration memory scrubbing is employed [1].