IEEE Communications Letters

Filter Results

Displaying Results 1 - 25 of 60

Publication Year: 2016, Page(s):C1 - 2337
| |PDF (308 KB)
• IEEE Communications Society

Publication Year: 2016, Page(s): C2
| |PDF (90 KB)
• Integer Codes Correcting Spotty Byte Asymmetric Errors

Publication Year: 2016, Page(s):2338 - 2341
Cited by:  Papers (2)
| |PDF (1184 KB) | HTML

In short-range optical networks, channel errors occur due to energy losses. Upon transmission, they mostly manifest themselves as spotty byte asymmetric errors. In this letter, we present a class of codes that can correct these errors. The presented codes use integer and lookup table operations, which make them suitable for software implementation. In addition, if needed, the proposed codes can be... View full abstract»

• Parity-Check-Concatenated Polar Codes

Publication Year: 2016, Page(s):2342 - 2345
Cited by:  Papers (3)
| |PDF (862 KB) | HTML

In this letter, concatenation of parity-check and polar codes is proposed to improve error correction performance. In addition, a heuristic construction of the parity-check-concatenated (PCC) polar codes is proposed. Simulation results show that the PCC polar codes with the heuristic construction have evident performance gains over the cyclic redundancy check-concatenated polar codes. View full abstract»

• Optimal Two-Weight Codes From Trace Codes Over $\mathbb {F}_2+u\mathbb {F}_2$

Publication Year: 2016, Page(s):2346 - 2349
Cited by:  Papers (4)
| |PDF (156 KB)

We construct an infinite family of two-Lee-weight codes over the ring F2 t uF2. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using character sums. By Gray mapping, we obtain an infinite family of abelian binary two-weight codes. They are shown to be optimal by application of the Griesm... View full abstract»

• Exploring Node Repair Locality in Fractional Repetition Codes

Publication Year: 2016, Page(s):2350 - 2353
| |PDF (307 KB) | HTML

In this letter, we focus on fractional repetition (FR) codes, which enable uncoded exact node repair with the minimum disk reads and network bandwidth. We investigate the problem of designing FR codes that also incorporate the preferable property of local repair, i.e., the nodes participating in the repair operation are less than those required for data reconstruction. We propose explicit code con... View full abstract»

• A Low-Complexity SNR Estimation Algorithm Based on Frozen Bits of Polar Codes

Publication Year: 2016, Page(s):2354 - 2357
Cited by:  Papers (1)
| |PDF (505 KB) | HTML

Polar codes attract a lot of attention due to their provably capacity-achieving property with low encoding and decoding complexity. Frozen bits, the special structure of polar codes, are helpful for signal-to-noise ratio (SNR) estimation. A novel SNR estimation algorithm based on frozen bits is proposed in this letter. In the proposed algorithm, the mapping from SNR to frozen bit error rate is the... View full abstract»

• Optimal Code Length Estimates From Dependent Samples With Bounds on the Estimation Error

Publication Year: 2016, Page(s):2358 - 2361
| |PDF (376 KB) | HTML

Modern communication networks require robust and adaptive communication protocols to optimize various performance metrics, such as latency and energy efficiency. Adaptive communication protocols require real-time estimation of critical system parameters, amongst which the average length of an optimal source code is of key importance, when data compression is involved. In this letter, we prove fini... View full abstract»

• Efficient Pruning for Successive-Cancellation Decoding of Polar Codes

Publication Year: 2016, Page(s):2362 - 2365
Cited by:  Papers (1)
| |PDF (642 KB) | HTML

This letter presents an efficient pruning method for the successive-cancellation (SC) decoding of polar codes. In the proposed method, unnecessary sub-trees are pruned if the syndrome check of a constituent code is satisfied. Without sacrificing the error-rate performance, the recursive operation associated with such a constituent code is replaced with simple computations. Compared with the tradit... View full abstract»

• An Integral Model of Two-Order and Three-Order Scattering for Non-Line-of-Sight Ultraviolet Communication in a Narrow Beam Case

Publication Year: 2016, Page(s):2366 - 2369
Cited by:  Papers (1)
| |PDF (851 KB)

The study on multiple scattering propagation of non-line-of-sight ultraviolet communication is based on the stochastic Monte Carlo method in the previous studies. In this letter, an integral model of two-order and three-order scattering is deduced in a narrow beam case. A prolate-spheroidal coordinates system and an isotropic scattering hypothesis are used to simplify the three-order scattering mo... View full abstract»

• Construction of Quasi-Cyclic LDPC Codes via Masking With Successive Cycle Elimination

Publication Year: 2016, Page(s):2370 - 2373
Cited by:  Papers (2)
| |PDF (355 KB) | HTML

In this letter, we study the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes by array dispersion and masking. We first propose a class of arrays of circulant permutation matrices (CPMs) of arbitrary size obtained by dispersion. Based on this class of arrays of CPMs, a class of QC-LDPC codes is constructed. For these resulting codes, we analyze their cycle structure and deri... View full abstract»

• Enhanced-Reliability Cyclic Generalized Spatial-and-Temporal Modulation

Publication Year: 2016, Page(s):2374 - 2377
Cited by:  Papers (4)
| |PDF (412 KB) | HTML

In this letter, we propose temporal modulation as a new dimension to enhance the performance of spatially modulated space-time block codes (STBCs). We efficiently integrate a cyclic spatially modulated codebook with temporal permutations over four consecutive time slots. To ensure a full transmit diversity order for the designed codebook, we assume that two distinct pairs from the available transm... View full abstract»

• PAPR Reduction in OFDM Systems Using Active Constellation Extension and Subcarrier Grouping Techniques

Publication Year: 2016, Page(s):2378 - 2381
Cited by:  Papers (1)
| |PDF (686 KB)

The active constellation extension (ACE) scheme provides an effective means of reducing the peak-to-average power ratio (PAPR) without the need for side information. However, traditional ACE schemes involve a time-consuming iteration process. This letter proposes a novel ACE scheme, along with a low-complexity implementation, for orthogonal frequency division multiplexing (OFDM) systems, where the... View full abstract»

• A Method for Increasing the Spectral and Energy Efficiency SEFDM Signals

Publication Year: 2016, Page(s):2382 - 2385
Cited by:  Papers (3)
| |PDF (559 KB) | HTML

Examination of a method of increasing the spectral and energy efficiency of the nonorthogonal multifrequency spectrally efficient frequency division multiplexing (SEFDM) signals is considered. This method consists in the application of optimal envelopes of signals increased duration on each subcarrier frequency under intersignal interference for fix data rate. Multistep optimization problem for th... View full abstract»

• Equiprobable Subcarrier Activation Method for OFDM With Index Modulation

Publication Year: 2016, Page(s):2386 - 2389
Cited by:  Papers (6)
| |PDF (502 KB) | HTML

Orthogonal frequency division multiplexing with index modulation (OFDM-IM) conveys additional information bits via the indices of active subcarriers. Consequently, the determination of the active subcarriers according to the incoming bits arises as a challenging problem. The existing solution resorts to the lexicographic ordering, which leads to a low implementation complexity but an unequal subca... View full abstract»

• A High-Bandwidth Live Streaming Model in Mesh-Based Peer-to-Peer Networks

Publication Year: 2016, Page(s):2390 - 2393
Cited by:  Papers (3)
| |PDF (726 KB) | HTML

Previous works concerning modeling and analysis of mesh-based P2P live streaming mainly focus on the case that the upload bandwidth of ordinary peers is equal to the streaming rate of the streaming server. In this letter, we propose a high-bandwidth P2P live streaming model with two extended streaming schemes. We derive streaming formulas which incorporate multi-peer selection, multi-chunk selecti... View full abstract»

• Idle-Slots Elimination Based Binary Splitting Anti-Collision Algorithm for RFID

Publication Year: 2016, Page(s):2394 - 2397
Cited by:  Papers (2)
| |PDF (1257 KB) | HTML

Tag collision avoidance is critical to the success of data communications in radio frequency identification (RFID) system. This letter presents an efficient idle-slots elimination based binary splitting (ISE-BS) algorithm to improve the performance of the RFID system. In ISE-BS, by introducing 1-b random number Q and 16-b random number serial identifier, which are transmitted before data exchange,... View full abstract»

• On the Stability of a Full-Duplex Aloha Network

Publication Year: 2016, Page(s):2398 - 2401
| |PDF (673 KB) | HTML

This letter offers the first characterization of the stability for full-duplex (FD) large size networks. Through stochastic geometry tools, key performance metrics such as delay and maximum stable arrival rate are derived for the nonsaturated system and compared with a half-duplex counterpart, also accounting for imperfect self-interference cancellation. This analysis better identifies that the FD... View full abstract»

• Capacity Upper Bound Analysis of the Hybrid Satellite Terrestrial Communication Systems

Publication Year: 2016, Page(s):2402 - 2405
| |PDF (805 KB) | HTML

The integrative development of hybrid satellite terrestrial communication systems (HSTCSs) has become a hot research field for next generation communications. This letter proposes the hybrid 1-D and 2-D beam models for the return link (RL) of the HSTCSs by considering the equivalent interference factor β from the TCSs and the equivalent interference factor α from inter-beam. Then, th... View full abstract»

• An Optimized Snapshot Division Strategy for Satellite Network in GNSS

Publication Year: 2016, Page(s):2406 - 2409
| |PDF (659 KB) | HTML

Finite-state automaton is a common method of dynamic network research. It considers the satellite network topology as a periodically repeating series of topology snapshots. Few studies have looked at the issue of how to divide the dynamic network topology into a series of snapshots. The most common method is to divide the satellite network period into equal-length snapshots. Global navigation sate... View full abstract»

Publication Year: 2016, Page(s):2410 - 2413
Cited by:  Papers (1)
| |PDF (500 KB)

Contact plan design (CPD) aims to schedule conflicting forthcoming communication opportunities (i.e., contacts). In CPD, the capacity of established contacts is indeed time-varying. Neglecting such variations in contact capacity inevitably leads to system performance deterioration. In this letter, we develop a new dynamic CPD algorithm while considering the time-varying property of contacts in bro... View full abstract»

• A Novel Connection Correlation Scheme Based on Threshold Secret Sharing

Publication Year: 2016, Page(s):2414 - 2417
| |PDF (900 KB) | HTML

Detecting correlated network flows aids with exposing the attackers who hide behind anonymous networks or stepping stones. More recent flow watermarking schemes can link flows, but are often impossible to achieve invisibility and robustness concurrently. This letter proposes an innovative connection correlation scheme capable of remaining invisible to attackers. The idea is that we exploit the bur... View full abstract»

• A New Construction of Zero Correlation Zone Gaussian Integer Sequence Sets

Publication Year: 2016, Page(s):2418 - 2421
Cited by:  Papers (1)
| |PDF (157 KB)

In this letter, a construction of zero correlation zone (ZCZ) sequence sets over Gaussian integers is presented. Based on the characteristic sets of binary pseudo-random sequences and shift sequences, ZCZ Gaussian integer sequence sets with optimal or almost optimal parameters are constructed. Moreover, the ZCZ lengths of resultant ZCZ Gaussian integer sequence sets are flexible. View full abstract»

• Degrees of Freedom Region of the MIMO Z-Interference Channel With Mixed CSIT

Publication Year: 2016, Page(s):2422 - 2425
Cited by:  Papers (1)
| |PDF (164 KB) | HTML

The degrees of freedom (DoF) region is established for the two-user multiple-input multiple-output Z-interference channel (IC) under the assumption of mixed channel state information at transmitters (CSIT), in which each transmitter obtains accurate delayed CSIT as well as an imperfect estimate of the current channel state, with the quality of the estimate determined by a parameter, α. A bl... View full abstract»

• BER Performance of SFBC OFDM System Over TWDP Fading Channel

Publication Year: 2016, Page(s):2426 - 2429
Cited by:  Papers (1)
| |PDF (637 KB) | HTML

In this letter, the performance of uncoded and space frequency block coding (SFBC) orthogonal frequency division multiplexing (OFDM) system over two-wave with diffuse power (TWDP) fading environment is analyzed. A general closed-form expressions of average bit error rate for both M-ary phase shift keying and M-ary quadrature amplitude modulation are derived using moment generating function of TWDP... View full abstract»

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

Editor-in-Chief
Octavia Dobre