Sökning: "stopping criteria"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden stopping criteria.

1. 1. Reduced Complexity Techniques for Iterative Decoding

   Författare :Dhammika Bokolamulla; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; turbo codes; trellis complexity; soft information; trellis pruning; stopping criteria; intersymbol interference; symbol-by-symbol {MAP} detection; reduced-complexity decoding; serially concatenated codes; Iterative detection;

   Sammanfattning : .... LÄS MER

3. 2. Efficient Density Matrix Methods for Large Scale Electronic Structure Calculations

   Författare :Anastasia Kruchinina; Emanuel H. Rubensson; Elias Rudberg; David Bowler; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; electronic structure; linear scaling; density matrix; density functional theory; Hartree-Fock; recursive polynomial expansion; density matrix purification; eigenvectors; molecular orbitals; stopping criteria; inverse factorization; matrix sparsity; parallelization; Scientific Computing; Beräkningsvetenskap;

   Sammanfattning : Efficient and accurate methods for computing the density matrix are necessary to be able to perform large scale electronic structure calculations. For sufficiently sparse matrices, the computational cost of recursive polynomial expansions to construct the density matrix scales linearly with increasing system size. LÄS MER

4. 3. Reconstruction of stresses in plates by incomplete Cauchy data

   Författare :Jonas Lundgren; Björn Gustafsson; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : We consider an ill-posed boundary value problem from classical plate theory for the biharmonic equation. The boundary conditions involve incomplete Cauchy data on one part of the boundary and an extra condition on the other part. LÄS MER

5. 4. Perturbed Markov Chains with Damping Component and Information Networks

   Författare :Benard Abola; Sergei Silvestrov; Christopher Engström; Dmitrii Silvestrov; Anatoliy Malyarenko; Milica Rancic; Vladimir Anisimov; Mälardalens högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics Applied Mathematics; matematik tillämpad matematik;

   Sammanfattning : This thesis brings together three thematic topics, PageRank of evolving tree graphs, stopping criteria for ranks and perturbed Markov chains with damping component. The commonality in these topics is their focus on ranking problems in information networks. LÄS MER

7. 5. Hybrid ARQ Using Serially Concatenated Block Codes for Real-Time Communication : An Iterative Decoding Approach

   Författare :Elisabeth Uhlemann; Högskolan i Halmstad; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Real-Time Communications; Hybrid ARQ; Iterative Decoding; QoS; Deadline Dependent Coding; Telecommunication theory; Telekommunikationsteori;

   Sammanfattning : 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. LÄS MER