Analyses are performed on the potential of using radio-frequency signals from massive LEO satellite constellations. This work aids in the creation of a navigation system independent of current GNSS. A tightly-coupled carrier Doppler shift/INS filter is developed to determine the feasibility of using signals of opportunity from LEO satellites for navigation purposes. This portion of the work makes two major contributions to the field of satellite-based radio-navigation systems. The first contribution is an analysis that shows GNSS-like position accuracy is possible using only INS measurements and carrier Doppler shift from LEO communication constellations. The second contribution is that INS quality, signal availability, and constellation design can significantly impact the navigation accuracy of a carrier Doppler shift/INS Kalman filter. An analysis of the costs and benefits of using model replacement over a Markov model in the dynamic propagation step of a tightly-coupled carrier Doppler shift/INS Kalman filter is performed in the next part of this work. This portion of the work makes contributions to the field of satellite-based radio-navigation systems. The main contribution is an analysis that shows Gauss-Markov models can be used instead of model replacement without increasing navigation error. Next, a DOP analysis is developed for systems using pseudorange and carrier Doppler shift measurements in point-solution batch filters that do not rely on INS data or dynamic propagation. This section's contributions to the field of satellite-based radio-navigation systems include a combined pseudorange and carrier Doppler shift DOP analysis using a novel DOP metric and an example of how to use the DOP analysis to identify the constellation characteristics, such as alternating ascending and descending nodes, that the OneWeb constellation could change to increase navigation accuracy. / Doctor of Philosophy / This dissertation presents research on using large communication satellite constellations as an independent backup to GPS. Simulated data are used to study the feasibility and navigation accuracy of such a system. Also investigated are different implementations of the algorithms used to navigate. Finally, a general analysis is developed to quickly approximate the navigation accuracy of a system that uses multiple measurement types.

Master of Science / Department of Industrial & Manufacturing Systems Engineering / Todd W. Easton / Integer programming (IP) is a powerful technique used by many companies and organizations to determine optimal strategies for making decisions and managing resources to achieve their goals. One class of IP problems is the multiple knapsack (MK) problem. However, MK and other IP problems, are extremely complicated since they are ${\cal NP}$-hard problems. Furthermore, there exist numerous instances that can not be solved. One technique commonly used to reduce the solution time for IP problems is lifting. This method, introduced by Gomory, takes an existing valid inequality and strengthens it. Lifting has the potential to form facet defining inequalities, which are the strongest inequalities to solve an IP problem. As a result, lifting is frequently used in integer programming applications. This research takes a broad approach to simultaneous lifting and provides its theoretical background for. The underlying hypergraphic structure for simultaneous lifting in an MK problem is identified and called a constellation. A constellation contains two hypercliques and multiple hyperstars from various conflict hypergraphs. Theoretical results demonstrate that a constellation induces valid inequalities that could be obtained by simultaneous lifting. Moreover, these constellation inequalities can be facet defining. The primary advancements, constellations and the associated valid inequalities, of this thesis are theoretical in nature. By providing the theory behind simultaneous lifting, researchers should be able to apply this knowledge to develop new algorithms that enable simultaneous lifting to be performed faster and over more complex integer programs.

The common view of brand choice in consumer marketing is that brands compete against each other within a specified product category. For example, different coffee brands are compared and evaluated by consumers and the most preferred brand is selected. Is this the only adequate way of demonstrating how consumers make brand choices? This thesis challenges the common view on brand choice and brand choice determinants in consumer markets on several accounts. First, brand choice is made in goal-derived categories (e.g., "foods to eat while on a diet"), and research on goal-derived categories and consumption goals suggests that consumers often choose between brands from different product categories. For example, a consumer may choose between brands of coffee, tea, and soft drinks to fulfill a consumption goal. Second, there is the question of complementarity. Are brands always chosen one by one? We argue in this thesis that consumers often choose brand constellations from complementary product categories in goal-derived categories (e.g., hamburgers and soft drinks when on a short lunch break). The thesis consists of four articles based on empirical studies. The articles cover single-brand choice and brand constellation choice in goal-derived categories, and the use of goal-derived categories by marketing practitioners. The general conclusion is that consumers evaluate more aspects than just brand-related ones when they choose brands in goal-derived categories. Product category associations (i.e., how typical a product category is perceived in a goal-derived category) are a more important determinant of brand (constellation) choice than brand associations. Also, in brand constellation choice, complementarity (i.e., perceived fit between brands) is more strongly related to brand choice than attitude towards individual brands. / <p>Diss. Stockholm : Handelshögsk., 2003</p>

Stellar Ouintet is a composition in five movements (Prologue, Allegro, "...Of Stars", Rondo, Epilogue) for two violins, viola, violoncello, and harpsichord. It makes extensive use of constellations , a term used in this work to denote arrangements of pitches in spatial notation. This method of notation is derived from actual astronomical constellations. The score makes use of both real and freely constructed constellations which are rotated around their own central axis. The score is 90 pages long with a 28 page analysis preceding the score. The work has a performance time of approximately 18-20 minutes

While the focus of this work is on turbo equalization, there is also an examination of equalization techniques including MMSE linear and DFE equalizers and Precoding. The losses and capacity associated with the ISI channel are also examined. Iterative decoding of concatenated codes is briefly reviewed and the MAP algorithm is explained.

Dissertation (Ph. D.)--University of Stellenbosch, 1997. / Bibliography. Also available via the Internet

Satellite constellations are an increasingly attractive option for many commercial and military applications. They provide a robust and distributed method of accomplishing the goals of expensive monolithic satellites. Among the many challenges that satellite constellations engender (challenges in control, coordination, disposal, and other areas), refueling is of particular interest because of the many methods one can use to refuel a constellation and the lifetime implications on the satellites. The present work presents a methodology for carrying out peer-to-peer refueling maneuvers within a constellation. Peer-to-peer (P2P) refueling can be of great value both in cases where a satellite unexpectedly consumes more fuel than it was alloted, and as part of a mixed refueling strategy that will include an outside tanker bringing fuel to the constellation. Without considering mixed-refueling, we formulate the peer-to-peer refueling problem as an assignment problem that seeks to guarantee that all satellites will have the fuel they need to be functional until the next refueling, while concurrently minimizing the cost in fuel that the refueling maneuvers entail. The assignment problem is then solved via auctions, which, by virtue of their distributed nature, can easily and effectively be implemented on a constellation without jeopardizing any robustness properties. Taking as a given that the P2P assignment problem has been solved, and that it has produced some matching among fuel deficient and fuel sufficient satellites, we then seek to sequence those prescribed maneuvers in the most effective manner. The idea is that while a constellation can be expected to have some redundancy, enough satellites leaving their assigned orbital slots will eventually make it impossible for the constellation to function. To tackle this problem, we define a wide class of operability conditions, and present three algorithms that intelligently schedule the maneuvers. We then briefly show how combining the matching and scheduling problems yields a complete methodology for organizing P2P satellite refueling operations.

In recent years, the accumulation of space debris has become an increasingly pressing issue, and adequately monitoring it is a formidable task for designated ground-based sensors. Supplementing the capabilities of these ground-based networks with orbiting sensing platforms would dramatically enhance the ability of such systems to detect, track, identify, and characterize resident space objects -- the primary goals of modern space situational awareness (SSA). Space-based space situational awareness (SBSSA), then, is concerned with achieving the stated SSA goals through coordinated orbiting sensing platforms. To facilitate the design of satellite constellations that promote SSA goals, an optimization approach is selected, which inherently requires a pre-defined mathematical representation of a cost index or measure of merit. Such representations are often analytically available, but when considering optimal constellation design for SBSSA applications, a closed-form expression for the cost index is only available under certain assumptions. The present study focuses on a subset of cases that admit exact representations. In this case, geometrical arguments are employed to establish an analytical formulation for the coverage area provided as well as for the coverage multiplicity. These analytical results are essential in validating numerical approximations that are able to simulate more complex configurations. / text

The constant demand for capacity increase, together with the foreseen saturation of the single-mode optical fiber, paved the way to technological breakthroughs that have completely changed the landscape of fiber-optic telecommunications. The most important advance was, undeniably, the practical implementation of a coherent detection with the help of high-speed electronics. This has, first, enabled the use of advanced modulation formats that allowed for a more efficient use of the fiber bandwidth, compared to the classical On-Off Keying, while adapted algorithms could not be used in order to mitigate the optical signal degradation. This thesis began a little after the advent of coherent detection and its main objective was to revisit the propagation effects in optical transmission systems using "Quadrature phase shift keying" (QPSK) modulation in the context of terrestrial systems, i.e. for transmission distances of up to about 2000 km. The manuscript is divided into two parts. The first part is dedicated to a study on the data sequences that need to be used in numerical simulations, when advanced modulation is involved. Fiber propagation, and in particular the interplay between chromatic dispersion and nonlinearities, usually introduce a nonlinear inter-symbol interference (ISI) to the transmitted signal. Since this ISI depends on the actual transmitted data pattern, it is obvious that the choice of the sequence used in our numerical simulations will have a direct influence on the estimated channel quality. Since, an infinite length, random sequence is impractical; we very commonly use pseudorandom" (PR) sequences, i.e. finite-length, deterministic sequences with balanced pattern statistics that seem to be random. In the first part we describe the method of generating M-level (with M>2) pseudorandom sequences and we detail their properties. In addition, we propose numerical tools to characterize the non-pseudorandom sequences that we use in numerical simulations, or we are sometimes forced to use in laboratory experiments. Finally, we present results of numerical simulations that quantify the necessity to use PR sequences as a function of our system parameters. After having established the "fairest possible" finite sequences, in the second part of the manuscript, we focus on the study of the nonlinear propagation, in the context of a transmission system using QPSK modulation and assuming a variable dispersion management and fiber type. Specifically, we numerically study the signal statistics due to the interplay of chromatic dispersion and nonlinear effects, neglecting all polarization or multi-wavelength effects and the amplifier noise. In this context, we were first interested in determining whether some empirical laws developed for OOK systems, can be also used in the case of QPSK modulation, such as the criterion of cumulative nonlinear phase (ΦNL) or laws that allow for a quick optimization of the dispersion management. Next we reveal the importance of a global phase rotation added to the initial signal constellation, as a parameter that can provide interesting information for the post-optimization of our system. We also discuss the fact that the constellation shape critically depends on the applied dispersion management, while there are generally 3 types of constellations, concerning the complex signal statistics: (1) the phase variance is higher than the amplitude variance (2) the amplitude variance is higher than the phase variance and (3) the received signal constellation resembles to a constellation of a signal under the influence of just an Additive White Gaussian Noise. Finally, we provide a phenomenological explanation of the constellations shapes revealing the fact that different data sub-sequences suffer from a different kind of signal degradation, while we also use this information to define a parameter that quantifies the potential benefit from a MAP (Maximum A Posteriori probability) correction algorithm

While the focus of this work is on turbo equalization, there is also an examination of equalization techniques including MMSE linear and DFE equalizers and Precoding. The losses and capacity associated with the ISI channel are also examined. Iterative decoding of concatenated codes is briefly reviewed and the MAP algorithm is explained.