Search for dissertations about: "iterative algorithms"
Showing result 1 - 5 of 131 swedish dissertations containing the words iterative algorithms.
-
1. Hybrid ARQ Using Serially Concatenated Block Codes for Real-Time Communication : An Iterative Decoding Approach
Abstract : The ongoing wireless communication evolution offers improvements for industrial applications where traditional wireline solutions causes prohibitive problems in terms of cost and feasibility. Many of these new wireless applications are packet oriented and time-critical. READ MORE
-
2. Estimation-based iterative learning control
Abstract : In many applications industrial robots perform the same motion repeatedly. One way of compensating the repetitive part of the error is by using iterative learning control (ILC). The ILC algorithm makes use of the measured errors and iteratively calculates a correction signal that is applied to the system. READ MORE
-
3. On Receiver Algorithms for OFDM Systems
Abstract : This thesis addresses the problem of designing a receiver for an Orthogonal FrequencyDivisionMultiplexing (OFDM)communication system operating over fading channels, taking into account the effects of hardware imperfections. We discuss solutions for efficiently estimating the parameters of a channel model and for compensating oscillator phase noise and analog to digital converter (ADC) quantisation errors at the receiver. READ MORE
-
4. Structure-Exploiting Numerical Algorithms for Optimal Control
Abstract : Numerical algorithms for efficiently solving optimal control problems are important for commonly used advanced control strategies, such as model predictive control (MPC), but can also be useful for advanced estimation techniques, such as moving horizon estimation (MHE). In MPC, the control input is computed by solving a constrained finite-time optimal control (CFTOC) problem on-line, and in MHE the estimated states are obtained by solving an optimization problem that often can be formulated as a CFTOC problem. READ MORE
-
5. Distributed k-ary System: Algorithms for Distributed Hash Tables
Abstract : This dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed systems. The provided algorithms guarantee lookup consistency in the presence of dynamism: they guarantee consistent lookup results in the presence of nodes joining and leaving. READ MORE