# IEEE Transactions on Communications

## Issue 6 • June 2018

The purchase and pricing options for this item are unavailable. Select items are only available as part of a subscription package. You may try again later or contact us for more information.

## Filter Results

Displaying Results 1 - 25 of 37

Publication Year: 2018, Page(s):C1 - C4
| PDF (316 KB)
• ### IEEE Communications Society

Publication Year: 2018, Page(s): C2
| PDF (99 KB)
• ### Analytical Lower Bounds on the Size of Elementary Trapping Sets of Variable-Regular LDPC Codes With Any Girth and Irregular Ones With Girth 8

Publication Year: 2018, Page(s):2313 - 2321
| | PDF (1367 KB) | HTML

In this paper, we give lower bounds on the size of $(a,b)$ elementary trapping sets (ETSs) of variable-regular LDPC codes with any girth, $g$ , and irregular ones with girth 8, where $a$ View full abstract»

• ### Faulty Successive Cancellation Decoding of Polar Codes for the Binary Erasure Channel

Publication Year: 2018, Page(s):2322 - 2332
| | PDF (1162 KB) | HTML

In this paper, the faulty successive cancellation decoding of polar codes for the binary erasure channel is studied. To this end, a simple erasure-based fault model is introduced to represent errors in the decoder, and it is shown that, under this model, polarization does not happen, meaning that fully reliable communication is not possible at any rate. Furthermore, a lower bound on the frame erro... View full abstract»

• ### Dynamic-SCFlip Decoding of Polar Codes

Publication Year: 2018, Page(s):2333 - 2345
| | PDF (1317 KB) | HTML

This paper proposes a generalization of the recently introduced successive cancellation flip (SCFlip) decoding of polar codes, characterized by a number of extra decoding attempts, where one or several positions are flipped from the standard SC decoding. To make such an approach effective, we first introduce the concept of higher order bit flips and propose a new metric to determine the bit flips ... View full abstract»

• ### Exploiting Locality for Improved Decoding of Binary Cyclic Codes

Publication Year: 2018, Page(s):2346 - 2358
| | PDF (1377 KB) | HTML

In this paper, we show how the presence of locality within a binary cyclic code can be exploited to improve decoding performance and to reduce decoding complexity. We pursue two approaches. Under the first approach, we show how the ordered statistics decoding (OSD) method can be modified by inserting a simple single round belief-propagation step at the start that involves only the local codes. The... View full abstract»

• ### Pliable Fractional Repetition Codes for Distributed Storage Systems: Design and Analysis

Publication Year: 2018, Page(s):2359 - 2375
| | PDF (961 KB) | HTML

A distributed storage system (DSS) is one of the most vital components of a cloud computing system used for storing and sharing big data among authorized users. A typical DSS consists of ${ n}$ storage nodes each with a storage capacity of ${alpha }$ uni... View full abstract»

• ### Joint Channel Estimation and LDPC Decoding Over Time-Varying Impulsive Noise Channels

Publication Year: 2018, Page(s):2376 - 2383
| | PDF (1402 KB) | HTML

This paper tackles the problem of channel estimation and decoding in environments that exhibit time-varying block-memoryless impulsive noise. In order to perform the estimation in continuous value space and the decoding in discrete value space jointly, a novel message passing framework is proposed that combines the sampling-importance resampling (SIR) estimator and the LDPC sum-product decoder in ... View full abstract»

• ### Noncoherent LDPC-Coded Physical-Layer Network Coding Using Multitone FSK

Publication Year: 2018, Page(s):2384 - 2395
| | PDF (1300 KB) | HTML

A noncoherent two-way relaying system is developed using physical-layer network coding for improved throughput over conventional relaying in a fading channel. Energy-efficient noncoherent operation is achieved using multitone frequency shift keying (FSK). A novel soft-output demodulator is developed for the relay, and corresponding achievable exchange rates are found for Rayleigh fading and AWGN c... View full abstract»

• ### On the Symmetry Reduction of Information Inequalities

Publication Year: 2018, Page(s):2396 - 2408
| | PDF (917 KB) | HTML

Information inequalities can be used to derive the fundamental limits of information systems. Many information inequalities and problem-specific constraints are linear equalities or inequalities of joint entropies, and thus, outer bounding the fundamental limits can be viewed as and in principle computed through linear programming. However, for many practical engineering problems, the resultant li... View full abstract»

• ### On Hypothesis Testing Against Conditional Independence With Multiple Decision Centers

Publication Year: 2018, Page(s):2409 - 2420
| | PDF (789 KB) | HTML

A distributed binary hypothesis testing problem is studied with one observer and two decision centers. Achievable type-II error exponents are derived for testing against conditional independence when the observer communicates with the two decision centers over one common and two individual noise-free bit pipes and when it communicates with them over a noisy broadcast channel. The results are based... View full abstract»

• ### Large MIMO Detection Schemes Based on Channel Puncturing: Performance and Complexity Analysis

Publication Year: 2018, Page(s):2421 - 2436
| | PDF (1795 KB) | HTML

A family of low-complexity detection schemes based on channel matrix puncturing targeted for large multiple-input multiple-output (MIMO) systems is proposed. It is well known that the computational cost of MIMO detection based on QR decomposition is directly proportional to the number of non-zero entries involved in back-substitution and slicing operations in the triangularized channel matrix, whi... View full abstract»

• ### Stair Matrix and Its Applications to Massive MIMO Uplink Data Detection

Publication Year: 2018, Page(s):2437 - 2455
| | PDF (1856 KB) | HTML

In this paper, we investigate low-complexity data detection scheme for massive multiple-input multiple-output (MIMO) uplink transmission. We propose to utilize the stair matrix, instead of diagonal matrix in existing proposals, for the development, and achieve near linear minimum mean-square error detection performance. We first demonstrate the applicability of the proposed method by showing that ... View full abstract»

• ### Performance Analysis of Multi-User Massive MIMO Downlink Under Channel Non-Reciprocity and Imperfect CSI

Publication Year: 2018, Page(s):2456 - 2471
| | PDF (2042 KB) | HTML

This paper analyzes the performance of linearly precoded time division duplex based multi-user massive MIMO downlink system under joint impacts of channel non-reciprocity (NRC) and imperfect channel state information. We consider a generic and realistic NRC model that accounts for transceiver frequency-response as well as mutual coupling mismatches at both user equipment (UE) and base station (BS)... View full abstract»

• ### 3-D Indoor Positioning for Millimeter-Wave Massive MIMO Systems

Publication Year: 2018, Page(s):2472 - 2486
| | PDF (1514 KB) | HTML

In this paper, a novel three-dimensional (3-D) indoor positioning scheme is proposed for millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems. Its operation is based upon a hybrid received signal strength and angle of arrival (RSS-AoA) positioning scheme, which employs only a single access point equipped with a large-scale uniform cylindrical array. To reduce the high com... View full abstract»

• ### Low-Complexity and High-Resolution DOA Estimation for Hybrid Analog and Digital Massive MIMO Receive Array

Publication Year: 2018, Page(s):2487 - 2501
| | PDF (1733 KB) | HTML

A large-scale fully digital receive antenna array can provide very high-resolution direction of arrival (DOA) estimation, but resulting in a significantly high RF-chain circuit cost. Thus, a hybrid analog and digital (HAD) structure is preferred. Two phase alignment (PA) methods, HAD PA (HADPA) and hybrid digital and analog PA (HDAPA), are proposed to estimate DOA based on the parametric method. C... View full abstract»

• ### A Unified Precoding Scheme for Generalized Spatial Modulation

Publication Year: 2018, Page(s):2502 - 2514
| | PDF (1796 KB) | HTML

Generalized spatial modulation (GSM) activates $n_{t}$ out of $N_{t}~(1 leq n_{t} < N_{t})$ available transmit antennas, and information is conveyed through $n_{t}$ modulated sym... View full abstract»

• ### Non-Coherent Detection for Diffusive Molecular Communication Systems

Publication Year: 2018, Page(s):2515 - 2531
| | PDF (1416 KB) | HTML

We study non-coherent detection schemes for molecular communication (MC) systems with negligible inter-symbol interference that do not require knowledge of the channel state information (CSI). In particular, we first derive the optimal maximum likelihood (ML) multiple-symbol (MS) detector for MC systems. As a special case of the optimal MS detector, we show that the optimal ML symbol-by-symbol (SS... View full abstract»

• ### A Lattice-Partition Framework of Downlink Non-Orthogonal Multiple Access Without SIC

Publication Year: 2018, Page(s):2532 - 2546
| | PDF (2542 KB) | HTML

In this paper, a novel lattice-partition-based downlink non-orthogonal multiple access framework is proposed. This framework is motivated by recognizing the algebraic structure behind the previous scheme recently proposed by Shieh and Huang as a lattice partition in $mathbb {Z}$ and is in fact a generalization of the scheme ... View full abstract»

• ### Reliability of Multicast Under Random Linear Network Coding

Publication Year: 2018, Page(s):2547 - 2559
| | PDF (1569 KB) | HTML

We consider a lossy multicast network in which the reliability is provided by means of random linear network coding. Our goal is to characterize the performance of such network in terms of the probability that a source message is delivered to all destination nodes. Previous studies considered coding over large finite fields, small numbers of destination nodes or specific, often impractical, channe... View full abstract»

• ### Buffer-Aided Physical-Layer Network Coding With Optimal Linear Code Designs for Cooperative Networks

Publication Year: 2018, Page(s):2560 - 2575
| | PDF (1269 KB) | HTML

In this paper, we propose buffer-aided physical-layer network coding (PLNC) techniques for improving data transmission over cooperative networks. In particular, we develop buffer-aided PLNC schemes and relay pair selection algorithms for direct-sequence code-division multiple access (DS-CDMA) systems. We devise PLNC techniques based on optimal linear network coding matrices according to the maximu... View full abstract»

• ### Enhancing Contention Resolution ALOHA Using Combining Techniques

Publication Year: 2018, Page(s):2576 - 2587
| | PDF (1390 KB) | HTML

Recently, random access protocols have acquired a new wave of interest, not only from the satellite communication community, but also from researchers active in fields, such as Internet of Things and machine-to-machine. Asynchronous (slot- and frame-wise) ALOHA-like random access protocols, are very attractive for such applications, enabling low complexity transmitters and avoiding time synchroniz... View full abstract»

• ### Learning for Robust Routing Based on Stochastic Game in Cognitive Radio Networks

Publication Year: 2018, Page(s):2588 - 2602
| | PDF (1578 KB) | HTML

This paper studies the problem of spectrum-aware routing in a multi-hop, multi-channel cognitive radio network when malicious nodes in the secondary network attempt to block the path with mixed attacks. Based on the location and time-variant path delay information, we model the path discovery process as a non-cooperative stochastic game. By exploiting the structure of the underlying Markov Decisio... View full abstract»

Publication Year: 2018, Page(s):2603 - 2616
| | PDF (1735 KB) | HTML

Task admission is critical to delay-sensitive applications in mobile edge computing, but is technically challenging due to its combinatorial mixed nature and consequently limited scalability. We propose an asymptotically optimal task admission approach which is able to guarantee task delays and achieve $(1-epsilon)$ -approxima... View full abstract»

• ### Efficient LTE/Wi-Fi Coexistence in Unlicensed Spectrum Using Virtual Network Entity: Optimization and Performance Analysis

Publication Year: 2018, Page(s):2617 - 2629
| | PDF (1074 KB) | HTML

Long-term evolution (LTE) operation in the unlicensed spectrum is a promising solution to address the scarcity of licensed spectrum for cellular networks. Although this approach brings higher capacity for LTE networks, the Wi-Fi performance operating in this band can be significantly degraded. To address this issue, we consider a coordinated structure, in which both networks are controlled by a hi... View full abstract»

## Aims & Scope

IEEE Transactions on Communications focuses on all telecommunications including telephone, telegraphy, facsimile, and point-to-point television by electromagnetic propagation.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Naofal Al-Dhahir
University of Texas at Dallas