IEEE Communications Letters

Issue 1 • Jan. 2016

Filter Results

Displaying Results 1 - 25 of 54
  • Table of contents

    Publication Year: 2016, Page(s):C1 - 2
    Request permission for commercial reuse | PDF file iconPDF (220 KB)
    Freely Available from IEEE
  • IEEE Communications Society

    Publication Year: 2016, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • A Farewell Note and Reviewer Appreciation Program 2015

    Publication Year: 2016, Page(s): 3
    Request permission for commercial reuse | PDF file iconPDF (69 KB)
    Freely Available from IEEE
  • A Welcome Message From the New Editor-in-Chief

    Publication Year: 2016, Page(s): 4
    Request permission for commercial reuse | PDF file iconPDF (54 KB) | HTML iconHTML
    Freely Available from IEEE
  • On the Impact of Network State Collection on the Performance of SDN Applications

    Publication Year: 2016, Page(s):5 - 8
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (522 KB) | HTML iconHTML

    Intelligent and autonomous SDN applications need to monitor the network state in order to take appropriate actions. In this letter, we compare the impact of active and passive network state collection methods on an SDN load-balancing application running at the controller. We do this comparison through: 1) the results of a mathematical model evaluation we derive for the SDN load-balancer, and 2) th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of Quantum LDPC Codes From Classical Row-Circulant QC-LDPCs

    Publication Year: 2016, Page(s):9 - 12
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    Classical row-circulant quasi-cyclic (QC) low-density parity check (LDPC) matrices are known to generate efficient high-rate short and moderate-length QC-LDPC codes, while the comparable random structures exhibit numerous short cycles of length-4. Therefore, we conceive a general formalism for constructing nondual-containing Calderbank-Shor-Steane (CSS)-type quantum low-density parity check (QLDPC... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of High-Performance Array-Based Non-Binary LDPC Codes With Moderate Rates

    Publication Year: 2016, Page(s):13 - 16
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB) | HTML iconHTML

    Based on arrays, excellent low-density parity-check (LDPC) codes with high rates have been constructed. In this letter, we propose to construct high-performance nonbinary LDPC (NBLDPC) codes with moderate rates based on arrays. The proposed construction combines masking and column selection. First, we construct a masking matrix M based on asymptotic thresholds and certain error-prone substructures... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Algorithms for Systematic Polar Encoding

    Publication Year: 2016, Page(s):17 - 20
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    Arıkan has laid the foundations of systematic polar codes and has also indicated that the computational complexity order of the systematic polar encoder (SPE) can be the same of a nonsystematic polar encoder (NSPE) i.e., θ(N log N). In this letter, we propose three efficient encoders along with their full pseudocode implementations, all with θ(N log N) complexity. These encode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatially Coupled Repeater-Combiner-Convolutional Codes

    Publication Year: 2016, Page(s):21 - 24
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    A form of spatially coupled codes is obtained by coupling multiple identical concatenated codes consisting of a block outer code (a repetition code followed by a single-parity code) concatenated with a convolutional inner code of infinite impulse response. The coupling operation involves only the outer code of the block-convolutional concatenated code. Because of the simple outer code and diverse ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Row and Column Extensions of 4-Cycle Free LDPC Codes

    Publication Year: 2016, Page(s):25 - 28
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (275 KB) | HTML iconHTML

    In this letter, an approach is proposed to increase the row (column)-weight of the parity-check matrix of a 4-cycle free LDPC code such that the constructed LDPC code has girth of at least 6. In fact, to each parity-check matrix H, a new graph Gr(H) (Gc(H)) is assigned in which the vertices correspond to the rows (columns) of H and two vertices are adjacent if and only if the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-Weight and Three-Weight Linear Codes From Square Functions

    Publication Year: 2016, Page(s):29 - 32
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    Linear codes can be applied in secret sharing, authentication codes, association schemes, and strongly regular graphs. This letter generalizes the construction of linear codes, uses more flexible construction method, and presents linear codes with few weights. These codes contain two-weight linear codes and three-weight linear codes. Some of them are optimal. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lower Bound for Burst Error Correcting Capability of Low Rate Binary Cyclic Codes

    Publication Year: 2016, Page(s):33 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB) | HTML iconHTML

    The letter presents a lower bound for burst error correcting capability of a class of binary cyclic codes based on the structure of parity check polynomial and the properties of its circulant matrix. This bound is applied for implementation of an algorithm, which exactly determines codes' error correcting capabilities. The algorithm has less complexity than other ones and is applicable for codes w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree Analysis of BATS Codes

    Publication Year: 2016, Page(s):37 - 40
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (178 KB) | HTML iconHTML

    BATS codes are a class of efficient random linear network codes. In this letter, BATS codes are generalized to incorporate batches of different sizes, and the corresponding belief propagation (BP) decoding performance is studied. Using a tree-based analysis, a sufficient condition is obtained such that the BP decoder can recover a given fraction of the input symbols with high probability. Some ass... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On $q$-ary Linear Quasi-Constant-Weight Codes

    Publication Year: 2016, Page(s):41 - 44
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (74 KB) | HTML iconHTML

    We show that all k-dimensional q-ary linear quasiconstant-weight codes are equivalent to the first-order RM code or its copies for k ≥ 4, and the same result holds also for the case k = 3 and q being a prime number. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum Likelihood SNR Estimation of Hyper Cubic Signals Over Gaussian Channel

    Publication Year: 2016, Page(s):45 - 48
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (565 KB) | HTML iconHTML

    In this letter, we address the problem of closed-form data aided (DA) and non-data aided (NDA) maximum likelihood (ML) signal-to-noise ratio (SNR) estimation for hyper-cubic modulated signals over Gaussian channel. The requirement of high SNR is exploited to derive closed-form expression of unbiased NDA ML SNR estimator. Exact expressions for the DA and NDA Cramer-Rao lower bound (CRLB) on the var... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Pairwise Error Probability for Hierarchical Decode and Forward Strategy in PLNC

    Publication Year: 2016, Page(s):49 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (142 KB) | HTML iconHTML

    Pairwise error probability (PEP) is an essential tool allowing to design practical optimized coding schemes. It reveals the connection between the performance and the decoding metric that is directly related to the codeword and/or constellation properties. The application of this principle to the hierarchical PEP used to describe the decoding performance of many-to-one message functions (hierarchi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secrecy Outage Probability in Multi-RAT Heterogeneous Networks

    Publication Year: 2016, Page(s):53 - 56
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (423 KB) | HTML iconHTML

    Practical difficulty in examining all base stations (BSs) to choose the best one providing secure transmission in heterogeneous networks (HetNets), we impose a BS association constraint in this letter that the BSs providing an average received signal power at the legitimate user greater than a predetermined receiving threshold can be candidate serving BSs. With this constraint, we derive closed-fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-Complexity Detection of Binary CPM With Small Modulation Index

    Publication Year: 2016, Page(s):57 - 60
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    Binary continuous phase modulation (CPM) with modulation index h = 0.5 can be approximated by a linear modulation, which leads to a low-complexity serial receiver. By reconstructing CPM signals generated with a small modulation index into equivalent CPM signals with modulation index h = 0.5, a low-complexity detector (LCD) for binary CPM with small modulation index is proposed. The complexity of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Some New Families of Almost Difference Sets Constructed From Cyclotomic Classes of Order 12

    Publication Year: 2016, Page(s):61 - 64
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB) | HTML iconHTML

    Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. Constructing a binary sequences with three-level autocorrelation is equivalent to find the corresponding characteristic set of the sequences that should be an almost difference set. In this letter, we construct three new families of almost difference se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mass-Count Disparity in Mobile Traffic

    Publication Year: 2016, Page(s):65 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB) | HTML iconHTML

    Mass-count disparity is a basis of the elephants and mice phenomenon in Internet traffic analysis. Mobile applications tend to minimize transmission overhead by reducing object size. Assuming the mice get smaller, we first look at properties of mass-count disparity in the smart device traffic. We find the existence of elephants and represent an accurate inequality measure using the Gini coefficien... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Convex Optimization Framework for Service Rate Allocation in Finite Communications Buffers

    Publication Year: 2016, Page(s):69 - 72
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB) | HTML iconHTML

    We study the convexity of loss probability in communications and networking optimization problems that involve finite buffers, where the arrival process has a general distribution. Examples of such problems include scheduling, energy management and revenue, and cost optimization problems. To achieve a computationally tractable optimization framework, we propose to adjust an existing nonconvex loss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Addressing With an Improved DAD for 6LoWPAN

    Publication Year: 2016, Page(s):73 - 76
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (497 KB) | HTML iconHTML

    In the existing DAD solutions, a new node constructs a target address and broadcasts the complete target address in the network. The target address becomes invalid as long as another node claims that the target address is occupied. An attacker usually takes advantage of this feature and repeatedly makes such a claim in order to prevent a new node from obtaining an address. In order to protect DAD ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Low-Density Lattice Codes

    Publication Year: 2016, Page(s):77 - 80
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    This letter presents a novel distributed LDLC (D-LDLC) relaying scheme for the classical relay channel. The relay node decodes LDLC packets from the source and forwards an additional parity message to the destination. The destination then performs joint decoding in order to exploit the available coding gain as well as diversity gain. First, assuming AWGN links, density evolution is used to optimiz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noncoherent Multiple-Symbol Detector of Binary CPFSK in Physical-Layer Network Coding

    Publication Year: 2016, Page(s):81 - 84
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (275 KB) | HTML iconHTML

    It is well known that the binary continuous phase frequency shift keying (CPFSK) signal is power efficient with constant envelope, because it allows transmission with inexpensive and energy efficient nonlinear amplifiers. Recently, physical-layer network coding (PNC) using the binary CPFSK is considered as a potentially attractive solution to the dual needs of high throughput and high power effici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary CPMs With Improved Spectral Efficiency

    Publication Year: 2016, Page(s):85 - 88
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB) | HTML iconHTML

    We design new continuous phase modulation (CPM) formats, which are based on the combination of a proper precoder with binary input and a ternary CPM. The proposed precoder constrains the signal phase evolution in order to increase the minimum Euclidean distance, and to limit the bandwidth expansion due to the use of a ternary CPM. The resulting schemes are highly spectrally efficient and outperfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Communications Letters publishes letters on the frontiers of research within the field of interest of the IEEE Communications Society in a timely manner.

 

 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Octavia Dobre
Memorial University, Canada