Optimal signal processing for next-generation communication systems

Publication Type:
Thesis
Issue Date:
2018
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
01front.pdf219.46 kB
Adobe PDF
02whole.pdf1.06 MB
Adobe PDF
In order to meet consumers’ exponentially growing demand, the next-generation wireless communication systems are aimed at achieving high data rate, low latency, large device density, and superior energy efficiency (EE). In this dissertation, we address problems in different scenarios to ensure superior performance of next-generation wireless communication systems. We first consider the pilot sequence design for orthogonal frequency-division multiplexing (OFDM) systems in a high mobility environment. The design of pilot sequence to minimize the mean squared error (MSE) of the channel estimate is proposed under a linear minimum mean squared error (LMMSE) estimator for average path gains. Due to the existence of interferences of pilot and data subcarriers, the MSE of the LMMSE estimator is a nonconvex function. Then, the MSE of the LMMSE estimator is transformed to a concave quadratic function and we develop a path-following optimization procedure, which improves the MSE in every iteration and it quickly converges at least to its local optimal solution. The developed path-following procedure can also be adapted to design pilot sequences for the least-square (LS) and maximum-likelihood (ML) estimators. The second part of research is devoted to the optimal design of training sequences for channel estimation in large-scale multiple-input multiple-output (MIMO) OFDM systems. Under the criterion of minimizing the MSE of the channel estimate, the optimal design of training sequences for such systems poses a truly large-scale optimization problem, to which existing optimization solvers are not applicable. We develop a fast convex programming (FCP) procedure to find its global optimal solution. In each iteration of the proposed FCP procedure, a solution is found in a scalable and closed form. The singularity and ill-conditionedness of the channel correlation matrices are also exploited to improve the computation efficiency. Furthermore, we also examine the design of reduced-length training sequences and develop a successive quadratic programming (SQP) procedure to find the solutions. Thirdly, we consider the joint design of user power allocation and relay beamforming in relaying communications, in which multiple pairs of single-antenna users exchange information with each other via multiple-antenna relays in two time slots. The aim is to maximize the system’s EE subject to quality-of-service (QoS) constraints in terms of exchange throughput requirements. The QoS constraints are nonconvex with many nonlinear cross-terms, so finding a feasible point is already computationally challenging. The sum throughput appears in the numerator while the total consumption power appears in the denominator of the EE objective function. The former is a nonconcave function and the latter is a nonconvex function, making fractional programming useless for EE optimization. Nevertheless, efficient iterations of low complexity to obtain its optimized solutions are developed. Finally, we consider MIMO multicell networks, where the base stations (BSs) are full-duplex transceivers, while uplink users and downlink users are equipped with multiple antennas and operate in a half-duplex mode. The problem of interest is to design linear precoders for BSs and users to optimize the network’s energy efficiency. Given that the EE objective is not a ratio of concave and convex functions, the commonly-used Dinkelbach-type algorithms are not applicable. We develop a low-complexity path-following algorithm that only invokes one simple convex quadratic program at each iteration, which converges at least to the local optimum.
Please use this identifier to cite or link to this item: