scispace - formally typeset
Search or ask a question
Dissertation

On Linear Transmission Systems

TL;DR: 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.

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI
01 Jan 2004

33 citations

Dissertation
01 Jan 2013
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.
Abstract: Fast and reliable data transmission together with high bandwidth efficiency are important design aspects in a modern digital communication system. Many different approaches exist but in this thesis bandwidth efficiency is obtained by increasing the data transmission rate with the faster-than-Nyquist (FTN) framework while keeping a fixed power spectral density (PSD). In FTN consecutive information carrying symbols can overlap in time and in that way introduce a controlled amount of intentional intersymbol interference (ISI). This technique was introduced already in 1975 by Mazo and has since then been extended in many directions. Since the ISI stemming from practical FTN signaling can be of significant duration, optimum detection with traditional methods is often prohibitively complex, and alternative equalization methods with acceptable complexity-performance tradeoffs are needed. The key objective of this thesis is therefore to design reduced-complexity receivers for FTN and general linear channels that achieve optimal or near-optimal performance. Although the performance of a detector can be measured by several means, this thesis is restricted to bit error rate (BER) and mutual information results. FTN signaling is applied in two ways: As a separate uncoded narrowband communication system or in a coded scenario consisting of a convolutional encoder, interleaver and the inner ISI mechanism in serial concatenation. Turbo equalization where soft information in the form of log likelihood ratios (LLRs) is exchanged between the equalizer and the decoder is a commonly used decoding technique for coded FTN signals. The first part of the thesis considers receivers and arising stability problems when working within the white noise constraint. New M-BCJR algorithms for turbo equalization are proposed and compared to reduced-trellis VA and BCJR benchmarks based on an offset label idea. By adding a third low-complexity M-BCJR recursion, LLR quality is improved for practical values of M. M here measures the reduced number of BCJR computations for each data symbol. An improvement of the minimum phase conversion that sharpens the focus of the ISI model energy is proposed. When combined with a delayed and slightly mismatched receiver, the decoding allows a smaller M without significant loss in BER. The second part analyzes the effect of the internal metric calculations on the performance of Forney- and Ungerboeck-based reduced-complexity equalizers of the M-algorithm type for both ISI and multiple-input multiple-output (MIMO) channels. Even though the final output of a full-complexity equalizer is identical for both models, the internal metric calculations are in general different. Hence, suboptimum methods need not produce the same final output. Additionally, new models working in between the two extremes are proposed and evaluated. Note that the choice of observation model does not impact the detection complexity as the underlying algorithm is unaltered. The last part of the thesis is devoted to a different complexity reducing approach. Optimal channel shortening detectors for linear channels are optimized from an information theoretical perspective. The achievable information rates of the shortened models as well as closed form expressions for all components of the optimal detector of the class are derived. The framework used in this thesis is more general than what has been previously used within the area.

2 citations

References
More filters
Proceedings ArticleDOI
23 May 2010
TL;DR: An efficient sub-optimal MIMO linear precoder based on the maximization of minimum distance for three virtual such channels is proposed and results over a Rayleigh channel confirm the interest of this new precoder in terms of bit-error-rate.
Abstract: This paper proposes an efficient sub-optimal MIMO linear precoder based on the maximization of minimum distance for three virtual suchannels. A new virtual MIMO channel representation with two channel angles allows the parameterization of the linear precoder and the optimization of the distance between signal points at the received constellation. To illustrate the optimization process, a precoder is derived for BPSK and QPSK modulation following the max-SNR approach, which consists in pouring power only on the most favored virtual sub-channel. Simulation results over a Rayleigh channel confirm the interest of this new precoder in terms of bit-error-rate.

14 citations

Proceedings ArticleDOI
03 Mar 2010
TL;DR: This paper proposes a method to execute a conversion of the Gram matrix from a given generator matrix and applies it in a novel MIMO system implementation where most of complexity is taken from the receiver to the transmitter.
Abstract: Either in communication or in control applications, multiple-input multiple-output systems often assume the knowledge of a matrix that relates the input and output vectors. For discrete inputs, this linear transformation generates a multidimensional lattice. The same lattice may be described by an infinite number of generator matrixes, even if the rotated versions of a lattice are not considered. While obtaining the Gram matrix from a given generator matrix is a trivial operation, the converse is not obvious for non-square matrixes and is a research topic in algorithmic number theory. This paper proposes a method to execute such a conversion and applies it in a novel MIMO system implementation where most of complexity is taken from the receiver to the transmitter. Additionally, given the symmetry of the Gram matrix, the number of elements required in the feedback channel is nearly halved.

13 citations

Proceedings ArticleDOI
24 Jun 2007
TL;DR: A method for orthogonalization of two complex-valued vectors by introducing a variation of the Jacobi rotations and it is shown that based on the proposed rotation transformations, the orthogonality can be established among differentcomplex-valued column vectors in the channel response matrix.
Abstract: In this paper, we propose a new transmit beam- forming technique for multiple-input-multiple-output (MIMO) systems to improve the link level performance. We present a method for orthogonalization of two complex-valued vectors by introducing a variation of the Jacobi rotations. We will show that based on the proposed rotation transformations, the orthogonality can be established among different complex-valued column vectors in the channel response matrix. Utilizing the orthogonality, we can achieve the channel gain comparable to the maximum singular value of the channel matrix. Simulation results demonstrate that the proposed beamforming scheme achieves the near-optimum performance with much reduced complexity and feedback overhead. Especially, for the two transmit antenna case, we show that the proposed beamforming scheme provides the optimal beamforming vector for MIMO systems.

12 citations

Proceedings ArticleDOI
04 Dec 2007
TL;DR: Field trails of orthogonal frequency division modulation (OFDM) and single carrier (SC) transmissions are presented in this paper which puts forward experimentally obtained BER performances ahead of simulation works submitted in the literature.
Abstract: Field trails of orthogonal frequency division modulation (OFDM) and single carrier (SC) transmissions are presented in this paper which puts forward experimentally obtained BER performances ahead of simulation works submitted in the literature, instead of giving raw error performance results, experimental studies are also extended to calculate matched filter bound for both OFDM and SC systems, which matches the theoretical limit of real-time wireless medium.

12 citations

Proceedings ArticleDOI
28 Jun 2009
TL;DR: This work studies the problem of constructing precoders for spatially multiplexed multiple-input multiple output (MIMO) channels with close to optimal minimum Euclidean distance and takes the decoding complexity into account and constrains it to a reasonable level.
Abstract: In this work we study the problem of constructing precoders for spatially multiplexed multiple-input multiple output (MIMO) channels with close to optimal minimum Euclidean distance. In order to exploit the full potential of such designs, an ML detector must be used. Our design takes the decoding complexity into account and constrains it to a reasonable level. For our simplest case, the ML detector can be implemented by a Viterbi algorithm operating on a state space of size equal to the size of the modulation alphabet. The design problem will be relaxed by using precoders F such that F*H*HF is a cyclic Toeplitz matrix. Within this class of precoders, the optimal precoder can be found via linear programming. Of uttermost practical importance is the discovery that there only exist very few different effective channels HF even for large MIMO setups; thus, the optimization at the transmitter side reduces into choosing the best precoder from a small list. Receiver tests verify that our method improves upon the currently best precoder designs.

11 citations