Search for dissertations about: "sum-product algorithm"
Showing result 1 - 5 of 6 swedish dissertations containing the words sum-product algorithm.
-
1. Serially Concatenated Space-Time Coded Continuous Phase Modulation
Abstract : Certain problems associated with reliable digital wireless communication over a frequency-flat slow Rayleigh fadingchannel are treated, when the transmitted signal is modulated using continuous phase modulation (CPM) due to the desirable properties of CPM. The primary focus of attention is on detection strategies, and the thesis proposes iterative detection algorithms for CPM signals transmitted over frequency-flat slow Rayleigh fading channels. READ MORE
-
2. On the Impact of Phase Noise in Communication Systems –- Performance Analysis and Algorithms
Abstract : The mobile industry is preparing to scale up the network capacity by a factor of 1000x in order to cope with the staggering growth in mobile traffic. As a consequence, there is a tremendous pressure on the network infrastructure, where more cost-effective, flexible, high speed connectivity solutions are being sought for. READ MORE
-
3. Early-Decision Decoding of LDPC Codes
Abstract : Since their rediscovery in 1995, low-density parity-check (LDPC) codes have received wide-spread attention as practical capacity-approaching code candidates. It has been shown that the class of codes can perform arbitrarily close to the channel capacity, and LDPC codes are also used or suggested for a number of important current and future communication standards. READ MORE
-
4. Low Complexity Techniques for Low Density Parity Check Code Decoders and Parallel Sigma-Delta ADC Structures
Abstract : Since their rediscovery in 1995, low-density parity-check (LDPC) codes have received wide-spread attention as practical capacity-approaching code candidates. It has been shown that the class of codes can perform arbitrarily close to the channel capacity, and LDPC codes are also used or suggested for a number of important current and future communication standards. READ MORE
-
5. Studies in Efficient Discrete Algorithms
Abstract : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. READ MORE