scispace - formally typeset
Open AccessDissertation

On Linear Transmission Systems

TLDR
The object in Part I is to study the impact of both the signaling rate and the pulse shape on the information rate of single antenna, single carrier linear modulation systems, and a iterative optimization method is developed, which produces precoders improving upon the best known ones in the literature.
Abstract
This thesis is divided into two parts. Part I analyzes the information rate of single antenna, single carrier linear modulation systems. The information rate of a system is the maximum number of bits that can be transmitted during a channel usage, and is achieved by Gaussian symbols. It depends on the underlying pulse shape in a linear modulated signal and also the signaling rate, the rate at which the Gaussian symbols are transmitted. The object in Part I is to study the impact of both the signaling rate and the pulse shape on the information rate. Part II of the thesis is devoted to multiple antenna systems (MIMO), and more specifically to linear precoders for MIMO channels. Linear precoding is a practical scheme for improving the performance of a MIMO system, and has been studied intensively during the last four decades. In practical applications, the symbols to be transmitted are taken from a discrete alphabet, such as quadrature amplitude modulation (QAM), and it is of interest to find the optimal linear precoder for a certain performance measure of the MIMO channel. The design problem depends on the particular performance measure and the receiver structure. The main difficulty in finding the optimal precoders is the discrete nature of the problem, and mostly suboptimal solutions are proposed. The problem has been well investigated when linear receivers are employed, for which optimal precoders were found for many different performance measures. However, in the case of the optimal maximum likelihood (ML) receiver, only suboptimal constructions have been possible so far. Part II starts by proposing new novel, low complexity, suboptimal precoders, which provide a low bit error rate (BER) at the receiver. Later, an iterative optimization method is developed, which produces precoders improving upon the best known ones in the literature. The resulting precoders turn out to exhibit a certain structure, which is then analyzed and proved to be optimal for large alphabets.

read more

Content maybe subject to copyright    Report

Citations
More filters
Dissertation

Reduced Receivers for Faster-than-Nyquist Signaling and General Linear Channels

Adnan Prlja
TL;DR: A framework to design reduced-complexity receivers for FTN and general linear channels that achieve optimal or near-optimal performance and an improvement of the minimum phase conversion that sharpens the focus of the ISI model energy is proposed.
References
More filters

A Polynomial Time, Numerically Stable Integer Relation Algorithm

TL;DR: It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it, and this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.
Book

Digital Transmission Engineering

TL;DR: In this paper, the authors present a 4th year (Sweden)/5th year(USA) text in digital communication theory and practice, including baseband pulse transmission, carrier transmission, synchronization, channels, coding and information theory, and advanced topics.
Journal ArticleDOI

BER criterion and codebook construction for finite-rate precoded spatial multiplexing with linear receivers

TL;DR: It is observed from numerical results that the BER performance of finite-rate feedback with suboptimal codebooks approaches quickly the benchmark performance of infinite-rate Feedback, suggesting that the number of feedback bits in practical systems need not be large and the room for performance improvement via further codebook optimization shrinks quickly as the codebook size increases.
Journal ArticleDOI

Conjugate gradient algorithm for optimization under unitary matrix constraint

TL;DR: This paper proposes a conjugate gradient (CG) algorithm on the Lie group of unitary matrices U(n) and shows that the proposed algorithm outperforms other existing algorithms in terms of convergence speed and computational complexity.
Journal ArticleDOI

Optimal Channel Shortening for MIMO and ISI Channels

TL;DR: It is shown that previously published channel shortening algorithms can be seen as special cases of the derived model, and closed form expressions for all components of the optimal detector of the class are derived.
Related Papers (5)