146 research outputs found
Structure-Based Bayesian Sparse Reconstruction
Sparse signal reconstruction algorithms have attracted research attention due
to their wide applications in various fields. In this paper, we present a
simple Bayesian approach that utilizes the sparsity constraint and a priori
statistical information (Gaussian or otherwise) to obtain near optimal
estimates. In addition, we make use of the rich structure of the sensing matrix
encountered in many signal processing applications to develop a fast sparse
recovery algorithm. The computational complexity of the proposed algorithm is
relatively low compared with the widely used convex relaxation methods as well
as greedy matching pursuit techniques, especially at a low sparsity rate.Comment: 29 pages, 15 figures, accepted in IEEE Transactions on Signal
Processing (July 2012
Beamforming Design for Joint Localization and Data Transmission in Distributed Antenna System
A distributed antenna system is studied whose goal is to provide data
communication and positioning functionalities to Mobile Stations (MSs). Each MS
receives data from a number of Base Stations (BSs), and uses the received
signal not only to extract the information but also to determine its location.
This is done based on Time of Arrival (TOA) or Time Difference of Arrival
(TDOA) measurements, depending on the assumed synchronization conditions. The
problem of minimizing the overall power expenditure of the BSs under data
throughput and localization accuracy requirements is formulated with respect to
the beamforming vectors used at the BSs. The analysis covers both
frequency-flat and frequency-selective channels, and accounts also for
robustness constraints in the presence of parameter uncertainty. The proposed
algorithmic solutions are based on rank-relaxation and Difference-of-Convex
(DC) programming.Comment: 15 pages, 9 figures, and 1 table, accepted in IEEE Transactions on
Vehicular Technolog
Applications of Lattice Codes in Communication Systems
In the last decade, there has been an explosive growth in different applications of wireless technology, due to users' increasing expectations for multi-media services. With the current trend, the present systems will not be able to handle the required data traffic. Lattice codes have attracted considerable attention in recent years, because they provide high data rate constellations. In this thesis, the applications of implementing lattice codes in different communication systems are investigated. The thesis is divided into two major parts. Focus of the first part is on constellation shaping and the problem of lattice labeling. The second part is devoted to the lattice decoding problem.
In constellation shaping technique, conventional constellations are replaced by lattice codes that satisfy some geometrical properties. However, a simple algorithm, called lattice labeling, is required to map the input data to the lattice code points. In the first part of this thesis, the application of lattice codes for constellation shaping in Orthogonal Frequency Division Multiplexing (OFDM) and Multi-Input Multi-Output (MIMO) broadcast systems are considered. In an OFDM system a lattice code with low Peak to Average Power Ratio (PAPR) is desired. Here, a new lattice code with considerable PAPR reduction for OFDM systems is proposed. Due to the recursive structure of this lattice code, a simple lattice labeling method based on Smith normal decomposition of an integer matrix is obtained. A selective mapping method in conjunction with the proposed lattice code is also presented to further reduce the PAPR. MIMO broadcast systems are also considered in the thesis. In a multiple antenna broadcast system, the lattice labeling algorithm should be such that different users can decode their data independently. Moreover, the implemented lattice code should result in a low average transmit energy. Here, a selective mapping technique provides such a lattice code.
Lattice decoding is the focus of the second part of the thesis, which concerns the operation of finding the closest point of the lattice code to any point in N-dimensional real space. In digital communication applications, this problem is known as the integer least-square problem, which can be seen in many areas, e.g. the detection of symbols transmitted over the multiple antenna wireless channel, the multiuser detection problem in Code Division Multiple Access (CDMA) systems, and the simultaneous detection of multiple users in a Digital Subscriber Line (DSL) system affected by crosstalk. Here, an efficient lattice decoding algorithm based on using Semi-Definite Programming (SDP) is introduced. The proposed algorithm is capable of handling any form of lattice constellation for an arbitrary labeling of points. In the proposed methods, the distance minimization problem is expressed in terms of a binary quadratic minimization problem, which is solved by introducing several matrix and vector lifting SDP relaxation models. The new SDP models provide a wealth of trade-off between the complexity and the performance of the decoding problem
Joint Antenna Selection and Phase-Only Beamforming Using Mixed-Integer Nonlinear Programming
In this paper, we consider the problem of joint antenna selection and analog
beamformer design in downlink single-group multicast networks. Our objective is
to reduce the hardware costs by minimizing the number of required phase
shifters at the transmitter while fulfilling given distortion limits at the
receivers. We formulate the problem as an L0 minimization problem and devise a
novel branch-and-cut based algorithm to solve the resulting mixed-integer
nonlinear program to optimality. We also propose a suboptimal heuristic
algorithm to solve the above problem approximately with a low computational
complexity. Computational results illustrate that the solutions produced by the
proposed heuristic algorithm are optimal in most cases. The results also
indicate that the performance of the optimal methods can be significantly
improved by initializing with the result of the suboptimal method.Comment: to be presented at WSA 201
Multi-user spatial diversity techniques for wireless communication systems
Multiple antennas at the transmitter and receiver, formally known as multiple-input
multiple-output (MIMO) systems have the potential to either increase the data rates
through spatial multiplexing or enhance the quality of services through exploitation
of diversity. In this thesis, the problem of downlink spatial multiplexing, where a
base station (BS) serves multiple users simultaneously in the same frequency band is
addressed. Spatial multiplexing techniques have the potential to make huge saving
in the bandwidth utilization. We propose spatial diversity techniques with and without
the assumption of perfect channel state information (CSI) at the transmitter.
We start with proposing improvement to signal-to-leakage ratio (SLR) maximization
based spatial multiplexing techniques for both fiat fading and frequency selective
channels. [Continues.
- …