arXiv subjects

Symeon Chatzinotas

Publications and source records attributed to Symeon Chatzinotas.

At least 397 records · Page 22Linked to original sources

arXiv2018

$M$-QAM Precoder Design for MIMO Directional Modulation Transceivers

Spectrally efficient multi-antenna wireless communication systems are a key challenge as service demands continue to increase. At the same time, powering up radio access networks is facing environmental and regulation limitations. In order to achieve more power efficiency, we design a directional modulation precoder by considering an $M$-QAM constellation, particularly with $M=4,8,16,32$. First, extended detection regions are defined for desired constellations using analytical geometry. Then, constellation points are placed in the optimal positions of these regions while the minimum Euclidean distance to adjacent constellation points and detection region boundaries is kept as in the conventional $M$-QAM modulation. For further power efficiency and symbol error rate similar to that of fixed design in high SNR, relaxed detection regions are modeled for inner points of $M=16,32$ constellations. The modeled extended and relaxed detection regions as well as the modulation characteristics are utilized to formulate symbol-level precoder design problems for directional modulation to minimize the transmission power while preserving the minimum required SNR at the destination. In addition, the extended and relaxed detection regions are used for precoder design to minimize the output of each power amplifier. We transform the design problems into convex ones and devise an interior point path-following iterative algorithm to solve the mentioned problems and provide details on finding the initial values of the parameters and the starting point. Results show that compared to the benchmark schemes, the proposed method performs better in terms of power and peak power reduction as well as symbol error rate reduction for a wide range of SNRs.

cs.IT↗

arXiv2018

Energy-Efficient Multi-Cell Multigroup Multicasting with Joint Beamforming and Antenna Selection

This paper studies the energy efficiency and sum rate trade-off for coordinated beamforming in multi-cell multi-user multigroup multicast multiple-input single-output systems. We first consider a conventional network energy efficiency maximization (EEmax) problem by jointly optimizing the transmit beamformers and antennas selected to be used in transmission. We also account for per-antenna maximum power constraints to avoid non-linear distortion in power amplifiers and user-specific minimum rate constraints to guarantee certain service levels and fairness. To be energy-efficient, transmit antenna selection is employed. It eventually leads to a mixed-Boolean fractional program. We then propose two different approaches to solve this difficult problem. The first solution is based on a novel modeling technique that produces a tight continuous relaxation. The second approach is based on sparsity-inducing method, which does not require the introduction of any Boolean variable. We also investigate the trade-off between the energy efficiency and sum rate by proposing two different formulations. In the first formulation, we propose a new metric that is the ratio of the sum rate and the so-called weighted power. Specifically, this metric reduces to EEmax when the weight is 1, and to sum rate maximization when the weight is 0. In the other method, we treat the trade-off problem as a multi-objective optimization for which a scalarization approach is adopted. Numerical results illustrate significant achievable energy efficiency gains over the method where the antenna selection is not employed. The effect of antenna selection on the energy efficiency and sum rate trade-off is also demonstrated.

cs.IT↗

arXiv2018

Successive Convex Approximation Algorithms for Sparse Signal Estimation with Nonconvex Regularizations

In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and it can be written as the difference of two convex functions. The proposed framework is based on a nontrivial combination of the majorization-minimization framework and the successive convex approximation framework proposed in literature for a convex regularization function. The proposed framework has several attractive features, namely, i) flexibility, as different choices of the approximate function lead to different type of algorithms; ii) fast convergence, as the problem structure can be better exploited by a proper choice of the approximate function and the stepsize is calculated by the line search; iii) low complexity, as the approximate function is convex and the line search scheme is carried out over a differentiable function; iv) guaranteed convergence to a stationary point. We demonstrate these features by two example applications in subspace learning, namely, the network anomaly detection problem and the sparse subspace clustering problem. Customizing the proposed framework by adopting the best-response type approximation, we obtain soft-thresholding with exact line search algorithms for which all elements of the unknown parameter are updated in parallel according to closed-form expressions. The attractive features of the proposed algorithms are illustrated numerically.

cs.LG↗

arXiv2018

Energy efficiency optimization in MIMO interference channels: A successive pseudoconvex approximation approach

In this paper, we consider the (global and sum) energy efficiency optimization problem in downlink multi-input multi-output multi-cell systems, where all users suffer from multi-user interference. This is a challenging problem due to several reasons: 1) it is a nonconvex fractional programming problem, 2) the transmission rate functions are characterized by (complex-valued) transmit covariance matrices, and 3) the processing-related power consumption may depend on the transmission rate. We tackle this problem by the successive pseudoconvex approximation approach, and we argue that pseudoconvex optimization plays a fundamental role in designing novel iterative algorithms, not only because every locally optimal point of a pseudoconvex optimization problem is also globally optimal, but also because a descent direction is easily obtained from every optimal point of a pseudoconvex optimization problem. The proposed algorithms have the following advantages: 1) fast convergence as the structure of the original optimization problem is preserved as much as possible in the approximate problem solved in each iteration, 2) easy implementation as each approximate problem is suitable for parallel computation and its solution has a closed-form expression, and 3) guaranteed convergence to a stationary point or a Karush-Kuhn-Tucker point. The advantages of the proposed algorithm are also illustrated numerically.

math.OC↗

arXiv2018

Signal Processing for High Throughput Satellite Systems: Challenges in New Interference-Limited Scenarios

The field of satellite communications is enjoying a renewed interest in the global telecom market, and very high throughput satellites (V/HTS), with their multiple spot-beams, are key for delivering the future rate demands. In this article, the state-of-the-art and open research challenges of signal processing techniques for V/HTS systems are presented for the first time, with focus on novel approaches for efficient interference mitigation. The main signal processing topics for the ground, satellite, and user segment are addressed. Also, the critical components for the integration of satellite and terrestrial networks are studied, such as cognitive satellite systems and satellite-terrestrial backhaul for caching. All the reviewed techniques are essential in empowering satellite systems to support the increasing demands of the upcoming generation of communication networks.

cs.IT↗

arXiv2018

Edge-Caching Wireless Networks: Performance Analysis and Optimization

Edge-caching has received much attention as an efficient technique to reduce delivery latency and network congestion during peak-traffic times by bringing data closer to end users. Existing works usually design caching algorithms separately from physical layer design. In this paper, we analyse edge-caching wireless networks by taking into account the caching capability when designing the signal transmission. Particularly, we investigate multi-layer caching where both base station (BS) and users are capable of storing content data in their local cache and analyse the performance of edge-caching wireless networks under two notable uncoded and coded caching strategies. Firstly, we propose a coded caching strategy that is applied to arbitrary values of cache size. The required backhaul and access rates are derived as a function of the BS and user cache size. Secondly, closed-form expressions for the system energy efficiency (EE) corresponding to the two caching methods are derived. Based on the derived formulas, the system EE is maximized via precoding vectors design and optimization while satisfying a predefined user request rate. Thirdly, two optimization problems are proposed to minimize the content delivery time for the two caching strategies. Finally, numerical results are presented to verify the effectiveness of the two caching methods.

cs.IT↗

arXiv2017

A Framework for Optimizing Multi-cell NOMA: Delivering Demand with Less Resource

Non-orthogonal multiple access (NOMA) allows multiple users to simultaneously access the same time-frequency resource by using superposition coding and successive interference cancellation (SIC). Thus far, most papers on NOMA have focused on performance gain for one or sometimes two base stations. In this paper, we study multi-cell NOMA and provide a general framework for user clustering and power allocation, taking into account inter-cell interference, for optimizing resource allocation of NOMA in multi-cell networks of arbitrary topology. We provide a series of theoretical analysis, to algorithmically enable optimization approaches. The resulting algorithmic notion is very general. Namely, we prove that for any performance metric that monotonically increases in the cells' resource consumption, we have convergence guarantee for global optimum. We apply the framework with its algorithmic concept to a multi-cell scenario to demonstrate the gain of NOMA in achieving significantly higher efficiency.

cs.IT↗

arXiv2017

Low Complexity Symbol-Level Design for Linear Precoding Systems

The practical utilization of the symbol-level precoding in MIMO systems is challenging since the implementation of the sophisticated optimization algorithms must be done with reasonable computational resources. In the real implementation of MIMO precoding systems, the processing time for each set of symbols is a crucial parameter, especially in the high-throughput mode. In this work, a symbol-level optimization algorithm with reduced complexity is devised. Performance of a symbol-level precoder is shown to improve in terms of the processing times per set of symbols.

eess.SP↗

arXiv2017

Constrained Bayesian Active Learning of Interference Channels in Cognitive Radio Networks

In this paper, a sequential probing method for interference constraint learning is proposed to allow a centralized Cognitive Radio Network (CRN) accessing the frequency band of a Primary User (PU) in an underlay cognitive scenario with a designed PU protection specification. The main idea is that the CRN probes the PU and subsequently eavesdrops the reverse PU link to acquire the binary ACK/NACK packet. This feedback indicates whether the probing-induced interference is harmful or not and can be used to learn the PU interference constraint. The cognitive part of this sequential probing process is the selection of the power levels of the Secondary Users (SUs) which aims to learn the PU interference constraint with a minimum number of probing attempts while setting a limit on the number of harmful probing-induced interference events or equivalently of NACK packet observations over a time window. This constrained design problem is studied within the Active Learning (AL) framework and an optimal solution is derived and implemented with a sophisticated, accurate and fast Bayesian Learning method, the Expectation Propagation (EP). The performance of this solution is also demonstrated through numerical simulations and compared with modified versions of AL techniques we developed in earlier work.

cs.IT↗

arXiv2017

Distributed Optimization for Coordinated Beamforming in Multi-Cell Multigroup Multicast Systems: Power Minimization and SINR Balancing

This paper considers coordinated multicast beamforming in a multi-cell multigroup multiple-input single-output system. Each base station (BS) serves multiple groups of users by forming a single beam with common information per group. We propose centralized and distributed beamforming algorithms for two different optimization targets. The first objective is to minimize the total transmission power of all the BSs while guaranteeing the user-specific minimum quality-of-service targets. The semidefinite relaxation (SDR) method is used to approximate the non-convex multicast problem as a semidefinite program (SDP), which is solvable via centralized processing. Subsequently, two alternative distributed methods are proposed. The first approach turns the SDP into a two-level optimization via primal decomposition. At the higher level, inter-cell interference powers are optimized for fixed beamformers while the lower level locally optimizes the beamformers by minimizing BS-specific transmit powers for the given inter-cell interference constraints. The second distributed solution is enabled via an alternating direction method of multipliers, where the inter-cell interference optimization is divided into a local and a global optimization by forcing the equality via consistency constraints. We further propose a centralized and a simple distributed beamforming design for the signal-to-interference-plus-noise ratio (SINR) balancing problem in which the minimum SINR among the users is maximized with given per-BS power constraints. This problem is solved via the bisection method as a series of SDP feasibility problems. The simulation results show the superiority of the proposed coordinated beamforming algorithms over traditional non-coordinated transmission schemes, and illustrate the fast convergence of the distributed methods.

cs.IT↗

arXiv2017

Energy-Efficient Joint Unicast and Multicast Beamforming with Multi-Antenna User Terminals

This paper studies energy-efficient joint transmit and receive beamforming in multi-cell multi-user multiple-input multiple-output systems. We consider conventional network energy efficiency metric where the users can receive unicasting streams in addition to the group-specific common multicasting streams which have certain rate constraints. The goal is to use the transmission resources more efficiently to improve the energy efficiency, when the users are equipped with multiple antennas. Numerical results show the achieved energy efficiency gains by using the additional degrees of freedom of the multicasting transmission to private message unicasting.

cs.IT↗

arXiv2017

Symbol-Level Multiuser MISO Precoding for Multi-level Adaptive Modulation

Symbol-level precoding is a new paradigm for multiuser downlink systems which aims at creating constructive interference among the transmitted data streams. This can be enabled by designing the precoded signal of the multiantenna transmitter on a symbol level, taking into account both channel state information and data symbols. Previous literature has studied this paradigm for MPSK modulations by addressing various performance metrics, such as power minimization and maximization of the minimum rate. In this paper, we extend this to generic multi-level modulations i.e. MQAM and APSK by establishing connection to PHY layer multicasting with phase constraints. Furthermore, we address adaptive modulation schemes which are crucial in enabling the throughput scaling of symbol-level precoded systems. In this direction, we design signal processing algorithms for minimizing the required power under per-user SINR or goodput constraints. Extensive numerical results show that the proposed algorithm provides considerable power and energy efficiency gains, while adapting the employed modulation scheme to match the requested data rate.

cs.IT↗

arXiv2017

Symbol-level and Multicast Precoding for Multiuser Multiantenna Downlink: A Survey, Classification and Challenges

Precoding has been conventionally considered as an effective means of mitigating the interference and efficiently exploiting the available in the multiantenna downlink channel, where multiple users are simultaneously served with independent information over the same channel resources. The early works in this area were focused on transmitting an individual information stream to each user by constructing weighted linear combinations of symbol blocks (codewords). However, more recent works have moved beyond this traditional view by: i) transmitting distinct data streams to groups of users and ii) applying precoding on a symbol-per-symbol basis. In this context, the current survey presents a unified view and classification of precoding techniques with respect to two main axes: i) the switching rate of the precoding weights, leading to the classes of block- and symbol-level precoding, ii) the number of users that each stream is addressed to, hence unicast-/multicast-/broadcast- precoding. Furthermore, the classified techniques are compared through representative numerical results to demonstrate their relative performance and uncover fundamental insights. Finally, a list of open theoretical problems and practical challenges are presented to inspire further research in this area.

cs.IT↗

arXiv2017

Energy-Efficient Coordinated Multi-Cell Multigroup Multicast Beamforming with Antenna Selection

This paper studies energy-efficient coordinated beamforming in multi-cell multi-user multigroup multicast multiple-input single-output systems. We aim at maximizing the network energy efficiency by taking into account the fact that some of the radio frequency chains can be switched off in order to save power. We consider the antenna specific maximum power constraints to avoid non-linear distortion in power amplifiers and user-specific quality of service (QoS) constraints to guarantee a certain QoS levels. We first introduce binary antenna selection variables and use the perspective formulation to model the relation between them and the beamformers. Subsequently, we propose a new formulation which reduces the feasible set of the continuous relaxation, resulting in better performance compared to the original perspective formulation based problem. However, the resulting optimization problem is a mixed-Boolean non-convex fractional program, which is difficult to solve. We follow the standard continuous relaxation of the binary antenna selection variables, and then reformulate the problem such that it is amendable to successive convex approximation. Thereby, solving the continuous relaxation mostly results in near-binary solution. To recover the binary variables from the continuous relaxation, we switch off all the antennas for which the continuous values are smaller than a small threshold. Numerical results illustrate the superior convergence result and significant achievable gains in terms of energy efficiency with the proposed algorithm.

cs.IT↗

arXiv2016

Hybrid Analog-Digital Transceiver Designs for Cognitive Large-Scale Antenna Array Systems

Milimeter wave (mmWave) band mobile communications can be a solution to the continuously increasing traffic demand in modern wireless systems. Even though mmWave bands are scarcely occupied, the design of a prospect transceiver should guarantee the efficient coexistence with the incumbent services in these bands. To that end, in this paper, two underlay cognitive transceiver designs are proposed that enable the mmWave spectrum access while controlling the interference to the incumbent users. MmWave systems usually require large antenna arrays to achieve satisfactory performance and thus, they cannot support fully digital transceiver designs due to high demands in hardware complexity and power consumption. Thus, in order to develop efficient solutions, the proposed approaches are based on a hybrid analog-digital pre-coding architecture. In such hybrid designs, the overall beamformer can be factorized in a low dimensional digital counterpart applied in the baseband and in an analog one applied in the RF domain. The first cognitive solution developed in this paper designs the cognitive hybrid pre-coder by maximizing the mutual information between its two ends subject to interference, power and hardware constraints related to the analog counterpart. The second solution aims at reduced complexity requirements and thus derives the hybrid pre-coder by minimizing the Frobenious norm of its difference to the optimal digital only one. A novel solution for the post-coder at the cognitive receiver part is further proposed here based on a hardware constrained Minimum Mean Square Error criterion. Simulations show that the performance of both the proposed hybrid approaches is very close to the one of the fully digital solution for typical wireless environments.

cs.IT↗

arXiv2016

On the Performance Analysis of Underlay Cognitive Radio Systems: A Deployment Perspective

We study the performance of cognitive Underlay System (US) that employ power control mechanism at the Secondary Transmitter (ST) from a deployment perspective. Existing baseline models considered for performance analysis either assume the knowledge of involved channels at the ST or retrieve this information by means of a band manager or a feedback channel, however, such situations rarely exist in practice. Motivated by this fact, we propose a novel approach that incorporates estimation of the involved channels at the ST, in order to characterize the performance of the US in terms of interference power received at the primary receiver and throughput at the secondary receiver (or \textit{secondary throughput}). Moreover, we apply an outage constraint that captures the impact of imperfect channel knowledge, particularly on the uncertain interference. Besides this, we employ a transmit power constraint at the ST to classify the operation of the US in terms of an interference-limited regime and a power-limited regime. In addition, we characterize the expressions of the uncertain interference and the secondary throughput for the case where the involved channels encounter Nakagami-$m$ fading. Finally, we investigate a fundamental tradeoff between the estimation time and the secondary throughput depicting an optimized performance of the US.

cs.IT↗

arXiv2016

Frequency of Arrival-based Interference Localization Using a Single Satellite

Intentional and unintentional interferences are an increasing threat for the satellite communications industry. In this paper, we aim to localize an interference with unknown location using frequency of arrival (FoA) technique by only relying on the measurements obtained through a single satellite. In each time instance, the satellite samples the interference and forwards it to the gateway to estimate its frequency. Since the satellite moves, each estimated frequency includes a Doppler shift, which is related to the location of the unknown interferer. The satellite's position, velocity, oscillator frequency, and the interference frequency are used at the gateway to build a location-related equation between the estimated frequency and the location of the unknown interference. Simultaneously with the interference signal, the satellite samples a reference signal to calibrate the estimated frequency and compensate for the mismatches between the available and real values of the satellite's position, velocity, and oscillator frequency. Multiple location-related equations obtained based on the FoA measurements, (at least two), along with the equation of the earth surface are used to localize the unknown interference. Simulations show that increasing the number of these equations, and the satellite velocity can improve the localization accuracy by 80% and 95%, respectively.

cs.IT↗

arXiv2016

Directional Modulation via Symbol-Level Precoding: A Way to Enhance Security

Wireless communication provides a wide coverage at the cost of exposing information to unintended users. As an information-theoretic paradigm, secrecy rate derives bounds for secure transmission when the channel to the eavesdropper is known. However, such bounds are shown to be restrictive in practice and may require exploitation of specialized coding schemes. In this paper, we employ the concept of directional modulation and follow a signal processing approach to enhance the security of multi-user MIMO communication systems when a multi-antenna eavesdropper is present. Enhancing the security is accomplished by increasing the symbol error rate at the eavesdropper. Unlike the information-theoretic secrecy rate paradigm, we assume that the legitimate transmitter is not aware of its channel to the eavesdropper, which is a more realistic assumption. We examine the applicability of MIMO receiving algorithms at the eavesdropper. Using the channel knowledge and the intended symbols for the users, we design security enhancing symbol-level precoders for different transmitter and eavesdropper antenna configurations. We transform each design problem to a linearly constrained quadratic program and propose two solutions, namely the iterative algorithm and one based on non-negative least squares, at each scenario for a computationally-efficient modulation. Simulation results verify the analysis and show that the designed precoders outperform the benchmark scheme in terms of both power efficiency and security enhancement.

cs.IT↗