Search for dissertations about: "upper bound"

Showing result 1 - 5 of 137 swedish dissertations containing the words upper bound.

  2. 1. Analysis of Relay Channels and Improved Iterative Decoders for Turbo-Coded Decode-and-Forward Relay Channels

    Author : Khoa Huynh; Chalmers tekniska högskola; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; detect-and-forward; maximum a posteriori; decode-and-forward; Maximum likelihood; iterative decoder.; relay channels; equivalent SNR; upper bound;

    Abstract : Three-node relay channels which consist of a source, a relay and a destinationare considered in this thesis. In the first part, an uncoded relay channelis studied. READ MORE

  4. 2. Algorithms, measures and upper bounds for satisfiability and related problems

    Author : Magnus Wahlström; Peter Jonsson; Oliver Kullmann; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Exact algorithms; upper bounds; algorithm analysis; satisfiability; Computer science; Datavetenskap;

    Abstract : The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of attention, particularly with the focus of producing algorithms with stronger theoretical guarantees, e.g. upper bounds on the running time on the form O(c^n) for some c. READ MORE

  5. 3. Techniques to Tighten the Upper Bound on the ExecutionTime of Task-based Parallel Applications

    Author : Petros Voudouris; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Scheduling; Multiprocessor; WCET; Uniform; Hard; multicore; Related; DAG; Real-Time; Dynamic; Unrelated; Makespan; Homogeneous; Parallel; Identical;

    Abstract : To use multiprocessors in hard real-time systems, schedulability analysis is needed to provide formally proven guarantees for the timing behavior of the system. Programming models for parallel applications, such as OpenMP, use pragmas to specify parts of the application as parallel tasks, for example, a function or a body of a loop. READ MORE

  6. 4. Phase Noise in Communication Systems--Modeling, Compensation, and Performance Analysis

    Author : M Reza Khanzadi; Chalmers tekniska högskola; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; multiple antennas; distributed oscillators.; colored phase noise; free-running oscillator; Bayesian Cramér-Rao bound; Oscillator phase noise; phase noise model; channel capacity; mean square error; capacity achieving distribution; Wiener process; extended Kalman filter smoother; maximum a posteriori estimator; phase-locked loop;

    Abstract : The continuous increase in demand for higher data rates due to applications with massive number of users motivates the design of faster and more spectrum efficient communication systems. In theory, the current communication systems must be able to operate close to Shannon capacity bounds. READ MORE

  7. 5. Classifications and volume bounds of lattice polytopes

    Author : Gabriele Balletti; Benjamin Nill; Martin Henk; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : In this licentiate thesis we study relations among invariants of lattice polytopes, with particular focus on bounds for the volume.In the first paper we give an upper bound on the volume vol(P^*) of a polytope P^* dual to a d-dimensional lattice polytope P with exactly one interiorlattice point, in each dimension d. READ MORE