References of "IEEE Transactions on Communications"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailDownlink Transmit Design in Massive MIMO LEO Satellite Communications
Li, Ke-Xin; You, Li; Want, Jiaheng et al

in IEEE Transactions on Communications (2021)

Low earth orbit (LEO) satellite communication systems have attracted extensive attention due to their smaller pathloss, shorter round-trip delay and lower launch cost compared with geostationary ... [more ▼]

Low earth orbit (LEO) satellite communication systems have attracted extensive attention due to their smaller pathloss, shorter round-trip delay and lower launch cost compared with geostationary counterparts. In this paper, the downlink transmit design for massive multiple-input multiple-output (MIMO) LEO satellite communications is investigated. First, we establish the massive MIMO LEO satellite channel model where the satellite and user terminals (UTs) are both equipped with the uniform planar arrays. Then, the rank of transmit covariance matrix of each UT is shown to be no larger than one to maximize ergodic sum rate, which reveals the optimality of single-stream precoding for each UT. The minorization-maximization algorithm is used to compute the precoding vectors. To reduce the computation complexity, an upper bound of ergodic sum rate is resorted to produce a simplified transmit design, where the rank of optimal transmit covariance matrix of each UT is also shown to not exceed one. To tackle the simplified precoder design, we derive the structure of precoding vectors, and formulate a Lagrange multiplier optimization (LMO) problem building on the structure. Then, a low-complexity algorithm is devised to solve the LMO, which takes much less computation effort. Simulation results verify the performance of proposed approaches. [less ▲]

Detailed reference viewed: 41 (3 UL)
Full Text
Peer Reviewed
See detailOn the Secrecy Capacity of MIMO Wiretap Channels: Convex Reformulation and Efficient Numerical Methods
Mukherjee, Anshu; Ottersten, Björn UL; Tran, Le-Nam

in IEEE Transactions on Communications (2021), 69(10), 6865-6878

This paper presents novel numerical approaches to finding the secrecy capacity of the multiple-input multiple-output (MIMO) wiretap channel subject to multiple linear transmit covariance constraints ... [more ▼]

This paper presents novel numerical approaches to finding the secrecy capacity of the multiple-input multiple-output (MIMO) wiretap channel subject to multiple linear transmit covariance constraints, including sum power constraint, per antenna power constraints and interference power constraint. An analytical solution to this problem is not known and existing numerical solutions suffer from slow convergence rate and/or high per-iteration complexity. Deriving computationally efficient solutions to the secrecy capacity problem is challenging since the secrecy rate is expressed as a difference of convex functions (DC) of the transmit covariance matrix, for which its convexity is only known for some special cases. In this paper we propose two low-complexity methods to compute the secrecy capacity along with a convex reformulation for degraded channels. In the first method we capitalize on the accelerated DC algorithm which requires solving a sequence of convex subproblems, for which we propose an efficient iterative algorithm where each iteration admits a closed-form solution. In the second method, we rely on the concave-convex equivalent reformulation of the secrecy capacity problem which allows us to derive the so-called partial best response algorithm to obtain an optimal solution. Notably, each iteration of the second method can also be done in closed form. The simulation results demonstrate a faster convergence rate of our methods compared to other known solutions. We carry out extensive numerical experiments to evaluate the impact of various parameters on the achieved secrecy capacity. [less ▲]

Detailed reference viewed: 25 (1 UL)
Full Text
Peer Reviewed
See detailEnergy-Efficient Hybrid Symbol-Level Precoding for Large-Scale mmWave Multiuser MIMO Systems
Haqiqatnejad, Alireza UL; Kayhan, Farbod UL; Ottersten, Björn UL

in IEEE Transactions on Communications (2021), 69(5), 3119-3134

We address the symbol-level precoding design problem for the downlink of a multiuser millimeter wave (mmWave) multiple-input multiple-output (MIMO) wireless system where the transmitter is equipped with a ... [more ▼]

We address the symbol-level precoding design problem for the downlink of a multiuser millimeter wave (mmWave) multiple-input multiple-output (MIMO) wireless system where the transmitter is equipped with a large-scale antenna array. The high cost and power consumption associated with the massive use of radio frequency (RF) chains prohibit fully-digital implementation of the precoder, and therefore, we consider a hybrid analog-digital architecture where a small-sized baseband precoder is followed by two successive networks of analog on-off switches and variable phase shifters according to a fully-connected structure. We jointly optimize the digital baseband precoder and the states of the switching network on a symbol-level basis, i.e., by exploiting both the channel state information (CSI) and the instantaneous data symbols, whereas the phase-shifting network is designed only based on the CSI due to practical considerations. Our approach to this joint optimization is to minimize the Euclidean distance between the optimal fully-digital and the hybrid symbol-level precoders. Remarkably, the use of a switching network allows for power-savings in the analog precoder by switching some of the phase shifters off according to the instantaneously optimized states of the switches. Our numerical results indicate that, on average, up to 50 percent of the phase shifters can be switched off. We provide an analysis of energy efficiency by adopting appropriate power dissipation models for the analog precoder, where it is shown that the energy efficiency of precoding can substantially be improved thanks to the phase shifter selection approach, compared to the fully-digital and the state-of-the-art hybrid symbol-level schemes. [less ▲]

Detailed reference viewed: 54 (12 UL)
Full Text
Peer Reviewed
See detailImpact of Varying Radio Power Density on Wireless Communications of RF Energy Harvesting Systems
Luo, Yu; Pu, Lina; Lei, Lei UL

in IEEE Transactions on Communications (2020)

Detailed reference viewed: 62 (5 UL)
Full Text
Peer Reviewed
See detailEfficient Detectors for Telegram Splitting based Transmission in Low Power Wide Area Networks with Bursty Interference
Kisseleff, Steven UL; Kneissl, Jakob; Kilian, Gerd et al

in IEEE Transactions on Communications (2020)

Low Power Wide Area (LPWA) networks are known to be highly vulnerable to external in-band interference in terms of packet collisions which may substantially degrade the system performance. In order to ... [more ▼]

Low Power Wide Area (LPWA) networks are known to be highly vulnerable to external in-band interference in terms of packet collisions which may substantially degrade the system performance. In order to enhance the performance in such cases, the telegram splitting (TS) method has been proposed recently. This approach exploits the typical burstiness of the interference via forward error correction (FEC) and offers a substantial performance improvement compared to other methods for packet transmissions in LPWA networks. While it has been already demonstrated that the TS method benefits from knowledge on the current interference state at the receiver side, corresponding practical receiver algorithms of high performance are still missing. The modeling of the bursty interference via Markov chains leads to the optimal detector in terms of a-posteriori symbol error probability. However, this solution requires a high computational complexity, assumes an a-priori knowledge on the interference characteristics and lacks flexibility. We propose a further developed scheme with increased flexibility and introduce an approach to reduce its complexity while maintaining a close-to-optimum performance. In particular, the proposed low complexity solution substantially outperforms existing practical methods in terms of packet error rate and therefore is highly beneficial for practical LPWA network scenarios. [less ▲]

Detailed reference viewed: 119 (4 UL)
Full Text
Peer Reviewed
See detailHybrid User Pairing for Spectral and Energy Efficiencies in Multiuser MISO-NOMA Networks with SWIPT
Nguyen, Toan-Van; Nguyen, van Dinh UL; Costa, Daniel Benevides Da et al

in IEEE Transactions on Communications (2020), 68(8), 4874-4890

In this paper, we propose a novel hybrid user pairing (HUP) scheme in multiuser multiple-input single-output nonorthogonal multiple access networks with simultaneous wireless information and power ... [more ▼]

In this paper, we propose a novel hybrid user pairing (HUP) scheme in multiuser multiple-input single-output nonorthogonal multiple access networks with simultaneous wireless information and power transfer. In this system, two information users with distinct channel conditions are optimally paired while energy users perform energy harvesting (EH) under non-linearity of the EH circuits. We consider the problem of jointly optimizing user pairing and power allocation to maximize the overall spectral efficiency (SE) and energy efficiency (EE) subject to userspecific quality-of-service and harvested power requirements. A new paradigm for the EE-EH trade-off is then proposed to achieve a good balance of network power consumption. Such design problems are formulated as the maximization of nonconcave functions subject to the class of mixed-integer non-convex constraints, which are very challenging to solve optimally. To address these challenges, we first relax binary pairing variables to be continuous and transform the design problems into equivalent non-convex ones, but with more tractable forms. We then develop low-complexity iterative algorithms to improve the objectives and converge to a local optimum by means of the inner approximation framework. Simulation results show the convergence of proposed algorithms and the SE and EE improvements of the proposed HUP scheme over state-of-the-art designs. In addition, the effects of key parameters such as the number of antennas and dynamic power at the BS, target data rates, and energy threshold, on the system performance are evaluated to show the effectiveness of the proposed schemes in balancing resource utilization. [less ▲]

Detailed reference viewed: 102 (16 UL)
Full Text
Peer Reviewed
See detailOnline Spatiotemporal Popularity Learning via Variational Bayes for Cooperative Caching
Mehrizi Rahmat Abadi, Sajad UL; Chaterjee, Saikat; Chatzinotas, Symeon UL et al

in IEEE Transactions on Communications (2020)

Detailed reference viewed: 130 (7 UL)
Full Text
Peer Reviewed
See detailCalibrated Learning for Online Distributed Power Allocation in Small-Cell Networks
Zhang, Xinruo; Nakhai, Mohammad Reza; Zheng, Gan UL et al

in IEEE Transactions on Communications (2019), 67(11), 8124-8136

This paper introduces a combined calibrated learning and bandit approach to online distributed power control in small cell networks operated under the same frequency bandwidth. Each small base station ... [more ▼]

This paper introduces a combined calibrated learning and bandit approach to online distributed power control in small cell networks operated under the same frequency bandwidth. Each small base station (SBS) is modelled as an intelligent agent who autonomously decides on its instantaneous transmit power level by predicting the transmitting policies of the other SBSs, namely the opponent SBSs, in the network, in real-time. The decision making process is based jointly on the past observations and the calibrated forecasts of the upcoming power allocation decisions of the opponent SBSs who inflict the dominant interferences on the agent. Furthermore, we integrate the proposed calibrated forecast process with a bandit policy to account for the wireless channel conditions unknown a priori , and develop an autonomous power allocation algorithm that is executable at individual SBSs to enhance the accuracy of the autonomous decision making. We evaluate the performance of the proposed algorithm in cases of maximizing the long-term sum-rate, the overall energy efficiency and the average minimum achievable data rate. Numerical simulation results demonstrate that the proposed design outperforms the benchmark scheme with limited amount of information exchange and rapidly approaches towards the optimal centralized solution for all case studies. [less ▲]

Detailed reference viewed: 71 (2 UL)
Full Text
Peer Reviewed
See detailJoint and competitive caching designs in large-scale multi-tier wireless multicasting networks
Cui, Ying; Wang, Zitian; Yang, Yang UL et al

in IEEE Transactions on Communications (2018), 66(6), 3108-3121

Detailed reference viewed: 311 (21 UL)
Full Text
Peer Reviewed
See detailTransceiver design of optimum wirelessly powered full-duplex MIMO IoT devices
Xue, Jiang; Biswas, Sudip; Cirik, Ali Cagatay et al

in IEEE Transactions on Communications (2018), 66(5), 1955-1969

Detailed reference viewed: 218 (9 UL)
Full Text
Peer Reviewed
See detailCache-Aided Millimeter Wave Ad-Hoc Networks with Contention-Based Content Delivery
Vuppala, Satyanarayana UL; Vu, Thang Xuan UL; Gautam, Sumit UL et al

in IEEE Transactions on Communications (2018)

The narrow-beam operation in millimeter wave (mmWave) networks minimizes the network interference leading to a noise-limited networks in contrast with interference-limited ones. The medium access control ... [more ▼]

The narrow-beam operation in millimeter wave (mmWave) networks minimizes the network interference leading to a noise-limited networks in contrast with interference-limited ones. The medium access control (MAC) layer throughput, and interference management strategies heavily depend on the noise-limited or interference-limited regime. Yet, these regimes are not considered in recent mmWave MAC layer designs, which can potentially have disastrous consequences on the communication performance. In this paper, we investigate the performance of cache-enabled MAC based mmWave ad-hoc networks, where randomly distributed nodes are supported by a cache. The adhoc nodes are modeled as homogenous Poisson Point Processes (PPP). Specifically, we study the optimal content placement (or caching placement) at desirable mmWave nodes using a network model that accounts for uncertainties both in node locations and blockages. We propose a contention-based multimedia delivery protocol to avoid collisions among the concurrent transmissions. Subsequently, only the node with smallest back-off timer amongst its contenders is allowed to transmit. We then characterize the average success probability of content delivery. We also characterize the cache hit ratio probability, and transmission probability of this system under essential factors, such as blockages, node density, path loss and caching parameters. [less ▲]

Detailed reference viewed: 213 (40 UL)
Full Text
Peer Reviewed
See detailImpact of Residual Additive Transceiver Hardware Impairments on Rayleigh-Product MIMO Channels with Linear Receivers: Exact and Asymptotic Analyses
Papazafeiropoulos, Anastasios; Sharma, Shree Krishna UL; Ratnarajah, Tharmalingam et al

in IEEE Transactions on Communications (2017)

Detailed reference viewed: 164 (15 UL)
Full Text
Peer Reviewed
See detailMulti-gateway Data Predistortion for Non-linear Satellite Channels
Piazza, Roberto UL; Shankar, Bhavani UL; Ottersten, Björn UL

in IEEE Transactions on Communications (2015), 63(10), 3789-3802

Detailed reference viewed: 222 (9 UL)
Full Text
Peer Reviewed
See detailMultiple Gateway Transmit Diversity in Q/V Band Feeder Links
Gharanjik, Ahmad UL; Shankar, Bhavani UL; Arapoglou, Pantelis-Daniel et al

in IEEE Transactions on Communications (2015)

Design of high bandwidth and reliable feeder links is central towards provisioning new services on the user link of a multibeam satellite communication (SatCom) system. Towards this, utilization of the Q ... [more ▼]

Design of high bandwidth and reliable feeder links is central towards provisioning new services on the user link of a multibeam satellite communication (SatCom) system. Towards this, utilization of the Q/V band and an exploitation of multiple gateways (GW) as a transmit diversity measure for overcoming severe propagation effects are being considered. In this context, this contribution deals with the design of a feeder link comprising N + P GWs (N active and P redundant GWs). Towards provisioning the desired availability, a novel switching scheme is analysed and practical aspects such as prediction based switching and switching rate are discussed. Unlike most relevant works, a dynamic rain attenuation model is used to derive analytically average outage probability in the fundamental 1 + 1 gateway case. Building on this result, an analysis for the N +P scenario leading to a quantification of the end􀀀to􀀀end performance is provided. This analysis aids system sizing by illustrating the interplay between the number of active and redundant gateways on the chosen metrics : average outage and average switching rate. [less ▲]

Detailed reference viewed: 327 (43 UL)
Full Text
Peer Reviewed
See detailAdaptive Compression and Joint Detection for Fronthaul Uplinks in Cloud Radio Access Networks
Vu, Thang Xuan UL; Nguyen, Hieu Duy; Quek, Tony Q.S.

in IEEE Transactions on Communications (2015), 63(11), 4565-4575

Cloud radio access network (C-RAN) has recently attracted much attention as a promising architecture for future mobile networks to sustain the exponential growth of data rate. In C-RAN, one data ... [more ▼]

Cloud radio access network (C-RAN) has recently attracted much attention as a promising architecture for future mobile networks to sustain the exponential growth of data rate. In C-RAN, one data processing center or baseband unit (BBU) communicates with users via distributed remote radio heads (RRHs), which are connected to the BBU via high capacity, low latency fronthaul links. In this paper, we study the compression on fron- thaul uplinks and propose a joint decompression algorithm at the BBU. The central premise behind the proposed algorithm is to ex- ploit the correlation between RRHs. Our contribution is threefold. First, we propose a joint decompression and detection (JDD) algorithm which jointly performs decompressing and detecting. The JDD algorithm takes into consideration both the fading and compression effect in a single decoding step. Second, block error rate (BLER) of the proposed algorithm is analyzed in closed-form by using pair-wise error probability analysis. Third, based on the analyzed BLER, we propose adaptive compression schemes subject to quality of service (QoS) constraints to minimize the fronthaul transmission rate while satisfying the pre-defined target QoS. As a dual problem, we also propose a scheme to minimize the signal distortion subject to fronthaul rate constraint. Numerical re- sults demonstrate that the proposed adaptive compression schemes can achieve a compression ratio of 300% in experimental setups. [less ▲]

Detailed reference viewed: 147 (6 UL)
Full Text
Peer Reviewed
See detailEnergy Efficient Coordinated Beamforming for Multicell System: Duality-Based Algorithm Design and Massive MIMO Transition
He, Shiwen; Huang, Yongming; Yang, Luxi et al

in IEEE TRANSACTIONS ON COMMUNICATIONS (2015), 63(12), 4920-4935

In this paper, we investigate joint beamforming and power allocation in multicell multiple-input single-output (MISO) downlink networks. Our goal is to maximize the utility function defined as the ratio ... [more ▼]

In this paper, we investigate joint beamforming and power allocation in multicell multiple-input single-output (MISO) downlink networks. Our goal is to maximize the utility function defined as the ratio between the system weighted sum rate and the total power consumption subject to the users' quality of service requirements and per-base-station (BS) power constraints. The considered problem is nonconvex and its objective is in a fractional form. To circumvent this problem, we first resort to an virtual uplink formulations of the the primal problem by introducing an auxiliary variable and applying the uplink-downlink duality theory. By exploiting the analytic structure of the optimal beamformers in the dual uplink problem, an efficient algorithm is then developed to solve the considered problem. Furthermore, to reduce further the exchange overhead between coordinated BSs in a large-scale antenna system, an effective coordinated power allocation solution only based on statistical channel state information is reached by deriving the asymptotic optimization problem, which is used to obtain the power allocation in a long-term timescale. Numerical results validate the effectiveness of our proposed schemes and show that both the spectral efficiency and the energy efficiency can be simultaneously improved over traditional downlink coordinated schemes, especially in the middle-high transmit power region. [less ▲]

Detailed reference viewed: 184 (12 UL)
Full Text
Peer Reviewed
See detailOptimal training sequences for joint timing synchronization and channel estimation in distributed communication networks
Nasir, Ali A.; Mehrpouyan, Hani; Durrani, Salman et al

in IEEE Transactions on Communications (2013), 7(61), 3002-3015

For distributed multi-user and multi-relay cooperative networks, the received signal may be affected by multiple timing offsets (MTOs) and multiple channels that need to be jointly estimated for ... [more ▼]

For distributed multi-user and multi-relay cooperative networks, the received signal may be affected by multiple timing offsets (MTOs) and multiple channels that need to be jointly estimated for successful decoding at the receiver. This paper addresses the design of optimal training sequences for efficient estimation of MTOs and multiple channel parameters. A new hybrid Cramer-Rao lower bound (HCRB) for joint estimation of MTOs and channels is derived. Subsequently, by minimizing the derived HCRB as a function of training sequences, three training sequence design guidelines are derived and according to these guidelines, two training sequences are proposed. In order to show that the proposed design guidelines also improve estimation accuracy, the conditional Cramer-Rao lower bound (ECRB), which is a tighter lower bound on the estimation accuracy compared to the HCRB, is also derived. Numerical results show that the proposed training sequence design guidelines not only lower the HCRB, but they also lower the ECRB and the mean-square error of the proposed maximum a posteriori estimator. Moreover, extensive simulations demonstrate that application of the proposed training sequences significantly lowers the bit-error rate performance of multi-relay cooperative networks when compared to training sequences that violate these design guidelines. [less ▲]

Detailed reference viewed: 182 (1 UL)
Full Text
Peer Reviewed
See detailWeighted sum rate maximization for MIMO broadcast channels using dirty paper coding and zero-forcing methods
Le-Nam, Tran; Juntti, M.; Bengtsson, M. et al

in IEEE Transactions on Communications (2013), 6(61), 2362-2373

We consider precoder design for maximizing the weighted sum rate (WSR) of successive zero-forcing dirty paper coding (SZF-DPC). For this problem, the existing precoder designs often assume a sum power ... [more ▼]

We consider precoder design for maximizing the weighted sum rate (WSR) of successive zero-forcing dirty paper coding (SZF-DPC). For this problem, the existing precoder designs often assume a sum power constraint (SPC) and rely on the singular value decomposition (SVD). The SVD-based designs are known to be optimal but require high complexity. We first propose a low-complexity optimal precoder design for SZF-DPC under SPC, using the QR decomposition. Then, we propose an efficient numerical algorithm to find the optimal precoders subject to per-antenna power constraints (PAPCs). To this end, the precoder design for PAPCs is formulated as an optimization problem with a rank constraint on the covariance matrices. A well-known approach to solve this problem is to relax the rank constraints and solve the relaxed problem. Interestingly, for SZF-DPC, we are able to prove that the rank relaxation is tight. Consequently, the optimal precoder design for PAPCs is computed by solving the relaxed problem, for which we propose a customized interior-point method that exhibits a superlinear convergence rate. Two suboptimal precoder designs are also presented and compared to the optimal ones. We also show that the proposed numerical method is applicable for finding the optimal precoders for block diagonalization scheme. [less ▲]

Detailed reference viewed: 188 (2 UL)
Full Text
Peer Reviewed
See detailTree expectation propagation for ml decoding of LDPC codes over the BEC
Salamanca Mino, Luis UL; Olmos, P. M.; Murillo-Fuentes, J. J. et al

in IEEE Transactions on Communications (2013), 61(2), 465-473

We propose a decoding algorithm for LDPC codes that achieves the maximum likelihood (ML) solution over the bi- nary erasure channel (BEC). In this channel, the tree-structured expectation propagation (TEP ... [more ▼]

We propose a decoding algorithm for LDPC codes that achieves the maximum likelihood (ML) solution over the bi- nary erasure channel (BEC). In this channel, the tree-structured expectation propagation (TEP) decoder improves the peeling decoder (PD) by processing check nodes of degree one and two. However, it does not achieve the ML solution, as the tree structure of the TEP allows only for approximate inference. In this paper, we provide the procedure to construct the structure needed for exact inference. This algorithm, denoted as generalized tree-structured expectation propagation (GTEP), modifies the code graph by recursively eliminating any check node and merging this information in the remaining graph. The GTEP decoder upon completion either provides the unique ML solution or a tree graph in which the number of parent nodes indicates the multiplicity of the ML solution. We also explain the algorithm as a Gaussian elimination method, relating the GTEP to other ML solutions. Compared to previous approaches, it presents an equivalent complexity, it exhibits a simpler graphical message-passing procedure and, most interesting, the algorithm can be generalized to other channels. [less ▲]

Detailed reference viewed: 114 (4 UL)
Full Text
Peer Reviewed
See detailAn RLL-Constrained LDPC Coded Recording System Using Deliberate Flipping and Flipped-Bit Detection
Chou, Hung-Pu UL; Ueng, Yeong-Luh; Lin, Mao-Chao et al

in IEEE Transactions on Communications (2012)

Detailed reference viewed: 29 (2 UL)