In this dissertation, we studied two seemingly uncorrelated, but conceptually related problems in terms of source-channel coding: 1) wireless image transmission and 2) Costa ("dirty-paper") code design. In the first part of the dissertation, we consider progressive image transmission over a wireless system employing space-time coded OFDM. The space-time coded OFDM system based on a newly built broadband MIMO fading model is theoretically evaluated by assuming perfect channel state information (CSI) at the receiver for coherent detection. Then an adaptive modulation scheme is proposed to pick the constellation size that offers the best reconstructed image quality for each average signal-to-noise ratio (SNR). A more practical scenario is also considered without the assumption of perfect CSI. We employ low-complexity decision-feedback decoding for differentially space- time coded OFDM systems to exploit transmitter diversity. For JSCC, we adopt a product channel code structure that is proven to provide powerful error protection and bursty error correction. To further improve the system performance, we also apply the powerful iterative (turbo) coding techniques and propose the iterative decoding of differentially space-time coded multiple descriptions of images. The second part of the dissertation deals with practical dirty-paper code designs. We first invoke an information-theoretical interpretation of algebraic binning and motivate the code design guidelines in terms of source-channel coding. Then two dirty-paper code designs are proposed. The first is a nested turbo construction based on soft-output trellis-coded quantization (SOTCQ) for source coding and turbo trellis- coded modulation (TTCM) for channel coding. A novel procedure is devised to balance the dimensionalities of the equivalent lattice codes corresponding to SOTCQ and TTCM. The second dirty-paper code design employs TCQ and IRA codes for near-capacity performance. This is done by synergistically combining TCQ with IRA codes so that they work together as well as they do individually. Our TCQ/IRA design approaches the dirty-paper capacity limit at the low rate regime (e.g., < 1:0 bit/sample), while our nested SOTCQ/TTCM scheme provides the best performs so far at medium-to-high rates (e.g., >= 1:0 bit/sample). Thus the two proposed practical code designs are complementary to each other.

Manufacturing system design decisions are costly and involve significant investment in terms of allocation of resources. These decisions are complex, due to uncertainties related to uncontrollable factors such as processing times and part demands. Designers often need to find a robust manufacturing system design that meets certain objectives under these uncertainties. Failure to find a robust design can lead to expensive consequences in terms of lost sales and high production costs. In order to find a robust design configuration, designers need accurate methods to model various uncertainties and efficient ways to search for feasible configurations. The dissertation work uses a multi-objective Genetic Algorithm (GA) and Petri net based modeling framework for a robust manufacturing system design. The Petri nets are coupled with Bayesian Model Averaging (BMA) to capture uncertainties associated with uncontrollable factors. BMA provides a unified framework to capture model, parameter and stochastic uncertainties associated with representation of various manufacturing activities. The BMA based approach overcomes limitations associated with uncertainty representation using classical methods presented in literature. Petri net based modeling is used to capture interactions among various subsystems, operation precedence and to identify bottleneck or conflicting situations. When coupled with Bayesian methods, Petri nets provide accurate assessment of manufacturing system dynamics and performance in presence of uncertainties. A multi-objective Genetic Algorithm (GA) is used to search manufacturing system designs, allowing designers to consider multiple objectives. The dissertation work provides algorithms for integrating Bayesian methods with Petri nets. Two manufacturing system design examples are presented to demonstrate the proposed approach. The results obtained using Bayesian methods are compared with classical methods and the effect of choosing different types of priors is evaluated. In summary, the dissertation provides a new, integrated Petri net based modeling framework coupled with BMA based approach for modeling and performance analysis of manufacturing system designs. The dissertation work allows designers to obtain accurate performance estimates of design configurations by considering model, parameter and stochastic uncertainties associated with representation of uncontrollable factors. Multi-objective GA coupled with Petri nets provide a flexible and time saving approach for searching and evaluating alternative manufacturing system designs.

In this thesis, M-estimators with Ramsay¡¦s function used in robust regression theory for linear parametric regression problems will be generalized to nonparametric Ramsay fuzzy neural networks (RFNNs) for nonlinear regression problems. Emphasis is put particularly on the robustness against outliers. This provides alternative learning machines when faced with general nonlinear learning problems. Simple weight updating rules based on incremental gradient descent and iteratively reweighted least squares (IRLS) will be derived. Some numerical examples will be provided to compare the robustness against outliers for usual fuzzy neural networks (FNNs) and the proposed RFNNs. Simulation results show that the RFNNs proposed in this thesis have good robustness against outliers.

With the progress in VLSI technology, the external environment makes it easier for the interference affected the operation of microcontroller. The design of the recently microcontroller, not only the pursuit of speed and performance, also began the study of the various fault-tolerant technology to enhance the reliability and safety. This thesis, being designed for the Fault-tolerant microcontroller according market, presents a Robust Micro-Control Unit : RMCU for dual core architecture of ARM9 ISA. The RMCU provides two operation modes: synchronize mode and Processor test mode for fault-tolerant mechanism. In synchronize mode, both processors are executing the same program concurrently. The results generated by processors are compared, and every mismatch indicates a transient fault in one of the two processors. When the transient fault occurred, the two processors will use Instruction retry mechanism, recover system operation. If the same address's errors larger than the number of settings are considered permanent fault, processors will be held, and entered the processor test mode for processor functional test. In accordance with the test results to close the wrong processor and operating system back to normal. This approach to solve the traditional dual-core processor fault-tolerant architecture that can not be fixed to permanent-fault restrictions. In addition to the design of fault-tolerance mechanism, for the upgrading of software and hardware development and validation of this paper design of the RMCU debug platform. RMCU debug platform including JTAG-based OCD (On-Chip Debugging) unit, and debug interface program. In addition to providing read and write registers and memory, set Breakpoint, Watchpoint and single-step but also take the initiative to increase the external interrupt inserted to provide a more effective ISR (Interrupt Service Routine) debug. In the last of the thesis, we use the FPGA Implementation of the RMCU fault-tolerant mechanisms and debug platform. After simulation and testing, the results prove the feasibility of RMCU.

No description available.

Thesis (Ph. D.)--University of Missouri-Columbia, 1999. / Typescript. Vita. Includes bibliographical references (leaves 196-200). Also available on the Internet.

Thesis (M.S. in Astronautical Engineering)--Naval Postgraduate School, December 2009. / Thesis Advisor(s): Agrawal, Brij; Kim, Jae Jun. "December 2009." Description based on title screen as viewed on January 27, 2010. Author(s) subject terms: MIMO control, Robust control, adaptive optics, segmented mirrors, flexible structures, space telescopes, Shack-Hartmann sensors, hybrid controller. Includes bibliographical references (p. 77). Also available in print.

Thesis (Ph. D.)--University of Missouri-Columbia, 1999. / Typescript. Vita. Includes bibliographical references (leaves 196-200). Also available on the Internet.

Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009. / Committee Chair: Jeff Shamma; Committee Member: Eric Feron; Committee Member: Magnus Egerstedt. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Dans cette thèse, nous nous intéressons à l’optimisation robuste. Plus précisément,nous nous intéresserons aux problèmes linéaires mixtes bi-niveaux, c’est à dire aux problèmes dans lesquels le processus de décision est divisé en deux parties : dans un premier temps, les valeurs optimales des variables dites "de décisions" seront calculées ; puis, une fois que l’incertitude sur les données est levée, nous calculerons les valeurs des variables dites "de recours". Dans cette thèse, nousnous limiterons au cas où les variables de deuxième étape, dites "de recours", sontcontinues.Dans la première partie de cette thèse, nous nous concentrerons sur l’étudethéorique de tels problèmes. Nous commencerons par résoudre un problème linéairesimplifié dans lequel l’incertitude porte seulement sur le membre droit descontraintes, et est modélisée par un polytope bien particulier. Nous supposerons enoutre que le problème vérifie une propriété dite "de recours complet", qui assureque, quelles que soient les valeurs prises par les variables de dcisions, si ces dernières sont admissibles, alors le problème admet toujours une solution réalisable, et ce, quelles que soient les valeurs prises par les paramètres incertains. Nous verrons alors une méthode permettant, à partir d’un programme robuste quelconque, de se ramener à un programme robuste équivalent dont le problème déterministe associévérifie la propriété de recours complet. Avant de traiter le cas général, nous nouslimiterons d’abord au cas o les variables de décisions sont entières. Nous testeronsalors notre approche sur un problème de production. Ensuite, après avoir remarquéque l’approche développée dans les chapitres précédents ne se généralisait pasnaturellement aux polytopes qui n’ont pas des points extrmes 0-1, nous montreronscomment, en utilisant des propriétés de convexité du problème, résoudre le problème robuste dans le cas général. Nous en déduirons alors des résultats de complexité sur le problème de deuxième étape, et sur le problème robuste. Dans la suite de cette partie nous tenterons d’utiliser au mieux les informations probabilistes que l’on a sur les données aléatoires pour estimer la pertinence de notre ensemble d’incertitude.Dans la deuxième partie de cette thèse, nous étudierons un problème de conceptionde parc hybride de production d’électricité. Plus précisément, nous chercheronsà optimiser un parc de production électrique constitué d’éoliennes, de panneauxsolaires, de batteries et d’un générateur à diesel, destiné à répondre à unedemande locale d’énergie électrique. Il s’agit de déterminer le nombre d’éoliennes,de panneaux solaires et de batteries à installer afin de répondre à la demande pourun cot minimum. Cependant, les données du problème sont très aléatoires. En effet,l’énergie produite par une éolienne dépend de la force et de la direction du vent ; celle produite par un panneau solaire, de l’ensoleillement et la demande en électricité peut tre liée à la température ou à d’autres paramètres extérieurs. Pour résoudre ce problème, nous commencerons par modéliser le problème déterministeen un programme linéaire mixte. Puis nous appliquerons directement l’approche de la première partie pour résoudre le problème robuste associé. Nous montrerons ensuite que le problème de deuxième étape associé, peut se résoudre en temps polynomial en utilisant un algorithme de programmation dynamique. Enfin, nous donnerons quelques généralisations et améliorations pour notre problème. / Robust optimization is a recent approach to study problems with uncertain datathat does not rely on a prerequisite precise probability model but on mild assumptionson the uncertainties involved in the problem.We studied a linear two-stage robustproblem with mixed-integer first-stage variables and continuous second stagevariables. We considered column wise uncertainty and focused on the case whenthe problem doesn’t satisfy a "full recourse property" which cannot be always satisfied for real problems. We also studied the complexity of the robust problemwhich is NP-hard and proved that it is actually polynomial solvable when a parameterof the problem is fixed.We then applied this approach to study a stand-alonehybrid system composed of wind turbines, solar photovoltaic panels and batteries.The aim was to determine the optimal number of photovoltaic panels, wind turbinesand batteries in order to serve a given demand while minimizing the total cost of investment and use. We also studied some properties of the second stage problem, in particular that the second stage problem can be solvable in polynomial time using dynamic programming.