<p>A new path of DSP processor design is described in this thesis with an example, to design a FFT processor. It is an innovative concept for DSP processor design developed by the Electronic Systems Division in the department of Electrical Engineer department in Linköping University. </p><p>The project described in this thesis is to design a Sande-Tukey FFT processor step by step. It will go through all steps from the simplest MATLAB specification to the final synthesizable VHDL specification. The steps should be as small as possible in order to avoid error and MATLAB should be used as for as possible.</p>

<p>This thesis deals with output power calibration of a mobile platform that supports EGPRS.Two different topics are examined. First some different measurement methods are compared concerning cost efficiency, accuracy, and speed and later measurements are carried out on a mobile platform. </p><p>The output power from the mobile platform is controlled by three parameters and the influence on the output power when varying those parameters is investigated and presented. Furthermore, two methods of improving the speed of the calibration are presented. </p><p>The first one aims to decrease the number of bursts to average over as much as possible. The conclusion is that 10-20 bursts are enough for GMSK modulation and about five bursts for 8PSK modulation. The purpose of the second investigation is to examine the possibility to measure the output power in one modulation and frequency band, and then calculate the output power in the other bands. The conclusion in this case is that, based on the units investigated, it is possible for some values of the parameters and in some frequency bands. However, more units need to be included in the basic data for decision-making and it is possible that the hardware variation is too large.</p>

<p>This report presents work done in the field of output error identification, with application to spark ignition (SI) engine identification for the purpose of air to fuel ratio control. The generic parts of the project consist mainly in setting out the basis for the design of output error identification software. Efficiency issues related to linear state space models have also been explored, and although the software design is not made explicit in this report, many of the important concepts have been implemented in order to provide powerful abstractions for the application to SI engine identification. </p><p>The SI engine identification data was obtained under normal operating conditions. The goal is to re- estimate models without utilizing a virtual measurement which has been used successfully to estimate models in the past. This turns out to be a difficult problem much related to the lack of excitation in the system input, shortcomings of the fuel dynamics model and the unknown and hard to estimate exhaust sensor characteristics. Indeed, the larger of the previously estimated models are found not to be identifiable in the present situation. However, trivial restrictions of the models (not meaning restriction to trivial models) avoid that problem.</p>

<p>his thesis proposes two motion synchronization approaches to coordinate the motion of a follower to a leader within the Euler-Lagrange system framework. The information requirements from the leader are that of position and orientation only, i.e. the mathematical model with its parameters and the velocity and acceleration of the leader are considered unknown and unmeasured.</p><p>The follower is responsible for the control action necessary to coordinate the systems, and the leader system is free to manoeuvre independently of the follower. There is no off-line synchronization of the systems through predefined paths or trajectories. %The parameters of the dynamic model of the leader are unknown, and its unmeasured system states (velocity and acceleration) must be estimated in order to be utilized in the coordination controller of the follower.</p><p>The concept of motion control of multiple objects is discussed in terms of the different forms of synchronization; cooperation (where all objects contribute equally) and coordination (where one object governs the motion of the others). Motivating examples and literature provide the motivation for the definition of two motion coordination problems. The output reference state feedback synchronization problem is defined by utilizing only output feedback from the desired motion reference, while assuming state feedback for the follower in the coordination control law. Furthermore, to increase the usefulness of the proposed control schemes and to provide robustness towards loss or poor quality of velocity measurements, the requirements of state information for the follower are alleviated in the definition of the output reference output feedback synchronization problem utilizing only output information of both the leader and the follower in the synchronization design. Furthermore, the necessary tools of stability are presented to prove that the proposed coordination schemes are uniformly ultimately bounded or practically asymptotically stable closed-loop systems.</p><p>In order to solve the output reference state feedback and the output reference output feedback synchronization problems, an observer-controller scheme is proposed that estimates the unknown states of the leader indirectly through a nonlinear model-based error observer. The observer-controller approach makes the follower system a physical observer of the leader system through the coupled observer and controller error-dynamics. A second nonlinear model-based observer is introduced for the follower to remove the state feedback assumption. The observer-controller scheme is proven to be uniformly globally ultimately bounded when utilizing state feedback of the follower in the coordination control law, and to be uniformly semiglobally ultimately bounded when utilizing only output feedback of the follower in the coordination control law. The observer-controller approach to motion coordination is studied through simulations and experiments, and a back-to-back comparison between ideal simulations and practical experiments is presented to allow for a discussion on the performance of the scheme under modelling errors, measurement noise and external disturbances. The observer-controller scheme is demonstrated to be suitable for practical applications.</p><p>Furthermore, a virtual vehicle scheme is proposed to solve the output reference state/ output feedback synchronization problems through a cascaded approach. The virtual vehicle approach is based on a two-level control structure to decouple the estimation and coordination error dynamics in the stability analysis and the tuning process. The virtual vehicle scheme estimates the unknown states of the leader through a virtual kinematic vehicle stabilized to the output of the leader system. A stable first-order velocity filter is introduced for the follower to remove the state feedback assumption. The virtual vehicle scheme is proven to be uniformly globally practically asymptotically stable when utilizing state feedback of the follower in the coordination control law, and to be uniformly semiglobally practically asymptotically stable when utilizing only output feedback of the follower in the coordination control law. Application of the virtual vehicle scheme to both vehicle coordination and robot manipulator coordination is presented, and the virtual vehicle approach to motion coordination is studied through simulations and experiments. The virtual vehicle scheme is demonstrated to be suitable for practical applications. In addition, an extension to a dynamic synchronization scheme is proposed to impose a smooth behaviour on the follower during a change of relative position.</p><p>The proposed coordination schemes are compared in terms of estimation principle, performance and robustness. Simulation studies compare the performance of the proposed schemes in terms of gain tuning and bounds on the closed-loop errors, and in terms of impact from external disturbances, modelling errors and measurement noise. The two coordination schemes are distinguished by concept rather than by performance, and both of the proposed schemes are believed to be suitable for practical implementation in coordination applications.</p>

<p>The contributions of this thesis are in the area of control of systems with nonlinear dynamics. The thesis is divided into three parts. The two first parts are similar in the sense that they both consider output feedback of rather general classes of nonlinear systems, and both approaches are based on mathematical programming (although in quite different ways). The third part contains a state feedback approach for a specific system class, and is more application oriented.</p><p>The first part treats control of systems described by nonlinear difference equations, possibly with uncertain terms. The system dynamics are represented by piecewise affine difference inclusions, and for this system class, piecewise affine controller structures are suggested. Controller synthesis inequalities for such controller structures are given in the form of Bilinear Matrix Inequalities (BMIs). A solver for the BMIs is developed. The main contribution is to the output feedback case, where an observer-based controller structure is proposed. The theory is exemplified through two examples.</p><p>In the second part the output feedback problem is examined in the setting of Nonlinear Model Predictive Control (NMPC). The state space formulation of NMPC is inherently a state feedback approach, since the state is needed as initial condition for the prediction in the controller. Consequently, for output feedback it is natural to use observers to obtain estimates of the state. A high gain observer is applied for this purpose. It is shown that for several existing NMPC schemes, the state feedback stability properties ``semiglobally'' hold in the output feedback case. The theory is illuminated with a simple example.</p><p>Finally, a state feedback controller for a class of positive systems is proposed. Convergence of the state to a certain subset of the first orthant, corresponding to a constant ``total mass'' (interpreting states as masses) is obtained. Conditions are given under which convergence to this set implies asymptotic stability of an equilibrium. Simple examples illustrate some properties of the controller. Furthermore, the control strategy is applied to the stabilization of a gas-lifted oil well, and simulations on a rigorous multi-phase dynamic simulator of such a well demonstrate the controller performance.</p>

The optimization, control, and characterization of engineering components or systems require fast, repeated, and accurate evaluation of a partial-differential-equation-induced input-output relationship. We present a technique for the rapid and reliable prediction of linear-functional outputs of elliptic partial differential equations with affine parameter dependence. The method has three components: (i) rapidly convergent reduced{basis approximations; (ii) a posteriori error estimation; and (iii) off-line/on-line computational procedures. These components -- integrated within a special network architecture -- render partial differential equation solutions truly "useful": essentially real{time as regards operation count; "blackbox" as regards reliability; and directly relevant as regards the (limited) input-output data required. / Singapore-MIT Alliance (SMA)

Stock markets employ specialized traders, market-makers, designed to provide liquidity and volume to the market by constantly supplying both supply and demand. In this paper, we demonstrate a novel method for modeling the market as a dynamic system and a reinforcement learning algorithm that learns profitable market-making strategies when run on this model. The sequence of buys and sells for a particular stock, the order flow, we model as an Input-Output Hidden Markov Model fit to historical data. When combined with the dynamics of the order book, this creates a highly non-linear and difficult dynamic system. Our reinforcement learning algorithm, based on likelihood ratios, is run on this partially-observable environment. We demonstrate learning results for two separate real stocks.

Bibliography: p. 76-77. / Title page reads: Final report ESL-FR-361. / NASA Research Grant NSG-496. M.I.T. Project DSR 76152.

Design and analysis of random-like codes for various multiple-input and multiple-output communication systems are addressed in this work. Random-like codes have drawn significant interest because they offer capacity-achieving performance. We first consider the analysis and design of low-density parity-check (LDPC) codes for turbo multiuser detection in multipath CDMA channels. We develop techniques for computing the probability density function (pdf) of the extrinsic messages at the output of the soft-input soft-output (SISO) multiuser detectors as a function of the pdf of input extrinsic messages, user spreading codes, channel impulse responses, and signal-to-noise ratios. Using these techniques, we are able to accurately compute the thresholds for LDPC codes and design good irregular LDPC codes. We then apply the tools of density evolution with mixture Gaussian approximations to optimize irregular LDPC codes and to compute minimum operational signal-to-noise ratios for ergodic MIMO OFDM channels. In particular, the optimization is done for various MIMO OFDM system configurations which include different number of antennas, different channel models and different demodulation schemes. We also study the coding-spreading tradeoff in LDPC coded CDMA systems employing multiuser joint decoding. We solve the coding-spreading optimization based on the extrinsic information SNR evolution curves for the SISO multiuser detectors and the SISO LDPC decoders. Both single-cell and multi-cell scenarios will be considered. For each of these cases, we will characterize the extrinsic information for both finite-size systems and the so-called large systems where asymptotic performance results must be evoked. Finally, we consider the design optimization of irregular repeat accumulate (IRA) codes for MIMO communication systems employing iterative receivers. We present the density evolution-based procedure with Gaussian approximation for optimizing the IRA code ensemble. We adopt an approximation method based on linear programming to design an IRA code with the extrinsic information transfer (EXIT) chart matched to that of the soft MIMO demodulator.

In der Dissertation werden neue Entwurfsmethoden für Kompaktoren für die Ausgänge von digitalen Schaltungen beschrieben, die die Anzahl der zu testenden Ausgänge drastisch verkleinern und dabei die Testbarkeit der Schaltungen nur wenig oder gar nicht verschlechtern. <br>Der erste Teil der Arbeit behandelt für kombinatorische Schaltungen Methoden, die die Struktur der Schaltungen beim Entwurf der Kompaktoren berücksichtigen. Verschiedene Algorithmen zur Analyse von Schaltungsstrukturen werden zum ersten Mal vorgestellt und untersucht. Die Komplexität der vorgestellten Verfahren zur Erzeugung von Kompaktoren ist linear bezüglich der Anzahl der Gatter in der Schaltung und ist damit auf sehr große Schaltungen anwendbar. <br>Im zweiten Teil wird erstmals ein solches Verfahren für sequentielle Schaltkreise beschrieben. Dieses Verfahren baut im wesentlichen auf das erste auf. <br>Der dritte Teil beschreibt eine Entwurfsmethode, die keine Informationen über die interne Struktur der Schaltung oder über das zugrundeliegende Fehlermodell benötigt. Der Entwurf basiert alleine auf einem vorgegebenen Satz von Testvektoren und die dazugehörenden Testantworten der fehlerfreien Schaltung. Ein nach diesem Verfahren erzeugter Kompaktor maskiert keinen der Fehler, die durch das Testen mit den vorgegebenen Vektoren an den Ausgängen der Schaltung beobachtbar sind. / The objective of this thesis is to provide new space compaction techniques for testing or concurrent checking of digital circuits. In particular, the work focuses on the design of space compactors that achieve high compaction ratio and minimal loss of testability of the circuits. <br>In the first part, the compactors are designed for combinational circuits based on the knowledge of the circuit structure. Several algorithms for analyzing circuit structures are introduced and discussed for the first time. The complexity of each design procedure is linear with respect to the number of gates of the circuit. Thus, the procedures are applicable to large circuits. <br>In the second part, the first structural approach for output compaction for sequential circuits is introduced. Essentially, it enhances the first part. <br>For the approach introduced in the third part it is assumed that the structure of the circuit and the underlying fault model are unknown. The space compaction approach requires only the knowledge of the fault-free test responses for a precomputed test set. The proposed compactor design guarantees zero-aliasing with respect to the precomputed test set.