# IEEE Communications Letters

## Filter Results

Displaying Results 1 - 25 of 51

Publication Year: 2015, Page(s):C1 - C4
| |PDF (110 KB)
• ### IEEE Communications Letters publication information

Publication Year: 2015, Page(s): C2
| |PDF (139 KB)
• ### Linear and Non-Linear Run Length Limited Codes

Publication Year: 2015, Page(s):1085 - 1088
| |PDF (308 KB) | HTML

We compare achievable rates of binary linear and non-linear run length limited codes where the constraint is on the number of consecutive ones. We show that there is a significant loss in rate when linear codes are used. For non-linear codes, we present practical encoders with rates close to the theoretical limits. We show that our approach can be generalised to avoid arbitrary sequences in the da... View full abstract»

• ### Efficient Receiver Architecture for LDPC Coded BICM-ID System

Publication Year: 2015, Page(s):1089 - 1092
| |PDF (706 KB) | HTML

The low-density parity-check (LDPC) coded bit-interleaved coded modulation with iterative demapping (BICM-ID) has excellent bit error rate (BER) performance, but with extremely high receiver complexity. This letter proposes a three-stage full-parallel receiver architecture in which each component decoder is separately but simultaneously iteratively decoded. This architecture can make full use of t... View full abstract»

• ### Using Stuffed Quadratic Congruence Codes for SAC Labels in Optical Packet Switching Network

Publication Year: 2015, Page(s):1093 - 1096
Cited by:  Papers (1)
| |PDF (785 KB) | HTML

While optical codes in optical code-division multiple access (OCDMA) has been extensively investigated, research of optical coding labels in optical multi-protocol label switching (MPLS) network is relatively unexplored. This paper studies optical labels with spectral-amplitude coding (SAC) for optical packet switching (OPS) network. The research focuses on implementing two different codes in opti... View full abstract»

• ### Binary Linear Codes With Two Weights

Publication Year: 2015, Page(s):1097 - 1100
Cited by:  Papers (16)
| |PDF (112 KB) | HTML

Linear codes have wide applications in secret sharing schemes and authentication codes. In this letter, a class of binary linear codes with two weights is presented. The weight distribution of this class of binary linear codes is settled. The dual codes are also studied and proved to be optimal or almost optimal. View full abstract»

• ### Gaussian Elimination Decoding of $t$-Error Correcting Reed-Solomon Codes in $t$ Steps and $O(t^2)$ Complexity

Publication Year: 2015, Page(s):1101 - 1104
| |PDF (75 KB) | HTML

In this letter, a decoding algorithm based on Gaussian elimination is presented to decode a t-error correcting Reed-Solomon (RS) code. This algorithm requires only t steps, as opposed to the “classic” Berlekamp-Massey (BM) algorithm which requires 2t steps. Both algorithms compute 2t discrepancies which are used to iteratively update the error locator polynomial with roughly the same... View full abstract»

• ### A Low Complexity Sequential Decoding Algorithm for Rateless Spinal Codes

Publication Year: 2015, Page(s):1105 - 1108
Cited by:  Papers (1)
| |PDF (338 KB) | HTML

A forward stack decoding (FSD) algorithm for rateless spinal codes is proposed in this letter. This decoding algorithm divides the decoding tree of the spinal code into several layers, and then searches the decoding paths in each single layer. Compared with the bubble decoder, which was initially designed for spinal codes, the proposed FSD algorithm can decrease the complexity significantly withou... View full abstract»

• ### $\ell_\infty$ Minimization Based Symbol Detection for Generalized Space Shift Keying

Publication Year: 2015, Page(s):1109 - 1112
Cited by:  Papers (6)
| |PDF (551 KB) | HTML

Generalized space shift keying (GSSK), as one simplified version of spatial modulation (SM), has attracted plenty of interest in the study of large-scale multiple-input multiple-output (MIMO). In this letter, we propose a low-complexity symbol detector for GSSK based on ℓ∞ minimization. Via a bijective transformation, the symbol detection for GSSK can be converted into the... View full abstract»

• ### Joint Wireless Information and Power Transfer for an Autonomous Multiple Antenna Relay System

Publication Year: 2015, Page(s):1113 - 1116
Cited by:  Papers (12)
| |PDF (506 KB) | HTML

Considering a three-node multiple antenna relay system, this letter proposes a two-phase amplify-and-forward (AF) relaying protocol, which enables the autonomous relay to simultaneously harvest wireless power from the source information signal and from an energy signal conveyed by the destination. We first study this energy-flow-assisted (EFA) relaying in a single-input single-output (SISO) relay ... View full abstract»

• ### Performance Evaluation of PLC Under the Combined Effect of Background and Impulsive Noises

Publication Year: 2015, Page(s):1117 - 1120
Cited by:  Papers (19)
| |PDF (164 KB) | HTML

Power line communication (PLC) is the use of power lines for the purpose of electronic data transmission. The presence of additive noise, namely, background noise and impulsive noise, significantly affects the performance of a PLC system. While the background noise is modeled by Nakagami-m distribution, the impulsive noise is modeled using Middleton class A distribution. In this letter, we study t... View full abstract»

• ### A Close Approximation of the Nonempty Buffer Probability Over Nakagami- $m$ Fading Channels

Publication Year: 2015, Page(s):1121 - 1124
Cited by:  Papers (1)
| |PDF (446 KB) | HTML

Based on the effective capacity model, the tail probability of backlog size in a wireless communication system can be characterized by two effective capacity functions, namely, the QoS exponent and the nonempty buffer probability. The QoS exponent is well understood in the literature; however, there is little known about the other function, i.e., the nonempty buffer probability, because this funct... View full abstract»

• ### Approaching the Gaussian Channel Capacity With APSK Constellations

Publication Year: 2015, Page(s):1125 - 1128
Cited by:  Papers (6)
| |PDF (487 KB) | HTML

We consider the Gaussian channel with power constraint P. A gap exists between the channel capacity and the highest achievable rate of equiprobable uniformly spaced signal. Several approaches enable to overcome this limitation such as constellations with non-uniform probability or constellation shaping. In this letter, we focus on constellation shaping. We give a construction of amplitude and phas... View full abstract»

• ### Random Linear Network Coding Based on Outdated Channel-State Information

Publication Year: 2015, Page(s):1129 - 1132
Cited by:  Papers (1)
| |PDF (386 KB) | HTML

Scheduling based on random linear network coding is an effective way of improving system performance in a wireless network. In a time-varying channel environment, it is important to take the effects of outdated channel-state information (CSI) into consideration when scheduling because the CSI used may be different from the real CSI for data transmissions due to mobility and feedback delays. Here, ... View full abstract»

• ### Spatial Modulation Achieves Information-Theoretically Optimal Energy Efficiency

Publication Year: 2015, Page(s):1133 - 1136
Cited by:  Papers (2)
| |PDF (127 KB) | HTML

Spatial modulation (SM) is investigated for multiple-input single-output channels with perfect channel state information at the receiver. In spite of its low implementation complexity, SM with quadrature phase-shift keying is proved to achieve an information-theoretically achievable rate that is equal to the channel capacity up to second order as the signal-to-noise ratio tends to zero. This impli... View full abstract»

• ### Wideband Spectrum Sensing for Cognitive Radios in Weakly Correlated Non-Gaussian Noise

Publication Year: 2015, Page(s):1137 - 1140
Cited by:  Papers (1)
| |PDF (438 KB) | HTML

Wideband signals can be subjected to various types of non-Gaussian and impulsive noise. Such non-Gaussian noise may cause degradation in the detection performance of conventional wideband signal detection methods, such as the periodogram-based approach. In addition, the signal detection probability can be further reduced due to possible correlation among the noise samples. Under such non-Gaussian ... View full abstract»

• ### Optimal TXOP Sharing in IEEE 802.11ac

Publication Year: 2015, Page(s):1141 - 1144
Cited by:  Papers (4)
| |PDF (275 KB) | HTML

With the goal of throughput maximization in IEEE 802.11ac, this letter proposes a throughput-aware TXOP sharing scheme. This scheme performs joint link adaptation and scheduling of the downlink multiuser transmission such that MAC layer throughput is maximized, while the TXOP sharing rules of IEEE 802.11ac are satisfied. We show that this joint optimization problem is a non-convex mixed-integer no... View full abstract»

• ### Projection-Based List Detection in Generalized Spatial Modulation MIMO Systems

Publication Year: 2015, Page(s):1145 - 1148
Cited by:  Papers (4)
| |PDF (1230 KB) | HTML

This letter presents a novel detection strategy for Spatially-Multiplexed Generalized Spatial Modulation systems. It is a multi-stage detection that produces a list of candidates of the transmitted signal vector, sorted according to the proximity of the data vector to one of the possible vector subspaces. The quality metric and list-length metric selects the best candidate and manages the list len... View full abstract»

• ### Blind Cyclostationarity-Based Symbol Period Estimation for FSK Signals

Publication Year: 2015, Page(s):1149 - 1152
Cited by:  Papers (1)
| |PDF (462 KB) | HTML

In this letter, we propose an algorithm for blind estimation of the symbol period of frequency-shift-keying (FSK) signals affected by fading channels. The algorithm exploits the property of the second-order cyclic moment magnitude to exhibit a change in the peak pattern at a delay equal to the symbol period, which we prove analytically. It has the advantage that it requires neither channel estimat... View full abstract»

• ### On the Design of a Relay-Assisted Network

Publication Year: 2015, Page(s):1153 - 1156
Cited by:  Papers (1)
| |PDF (303 KB) | HTML

A relay network composed of a source, a set of relays, and a destination is considered. A queueing framework is proposed, in which each node maintains a buffer to store its incoming traffic. An optimization-based formulation is proposed to maximize the mean service rate of the source queue. The relay selection technique is based on the statistics of the system parameters. Three packet decoding str... View full abstract»

• ### Outage Analysis of Multi-Antenna Cognitive Hybrid Satellite-Terrestrial Relay Networks With Beamforming

Publication Year: 2015, Page(s):1157 - 1160
Cited by:  Papers (9)
| |PDF (259 KB) | HTML

This letter investigates the outage performance of a multi-antenna cognitive decode-and-forward (DF) hybrid satellite-terrestrial relay network (HSTRN) with beamforming (BF), where the secondary source and relay can coexist with the primary user (PU) as long as their interference imposed to PU is below a predefined threshold. Specifically, the novel closed-form expression for the outage probabilit... View full abstract»

• ### Link Layer Systematic Random Network Coding for DVB-S2X/RCS

Publication Year: 2015, Page(s):1161 - 1164
Cited by:  Papers (3)
| |PDF (519 KB) | HTML

In this letter, we investigate the benefits of systematic network coding (SNC) in Digital Video Broadcasting by Satellite-Second Generation (DVB-S2X) based satellite systems. We propose an architecture and encapsulation framework to use SNC at the link layer (LL) of DVB-S2X. Our proposal includes coding both at the source node and at one intermediate node to increase the overall throughput (achiev... View full abstract»

• ### On the Optimality of Secure Network Coding

Publication Year: 2015, Page(s):1165 - 1168
| |PDF (92 KB) | HTML

In network communications, information trans-mission often encounters wiretapping attacks. Secure network coding is introduced to prevent information from being leaked to adversaries. The investigation of performance bounds on the numbers of source symbols and random symbols are two fundamental research problems. For an important case that each wiretap-set with cardinality not larger than r, Cai a... View full abstract»

• ### The Temporal Characteristic of Human Mobility: Modeling and Analysis of Social Worm Propagation

Publication Year: 2015, Page(s):1169 - 1172
Cited by:  Papers (1)
| |PDF (628 KB) | HTML

A common view of modeling social worm propagation is topology construction for social networking layer and human behavior modeling for message checking activity. However, due to the existence of human mobility behavior, traditional analytical models have not been suitable for the propagation dynamics of social worms nowadays, which results in underestimating the scale of infected network and lacki... View full abstract»

• ### Using Distance-Bounding Protocols to Securely Verify the Proximity of Two-Hop Neighbours

Publication Year: 2015, Page(s):1173 - 1176
Cited by:  Papers (2)
| |PDF (255 KB) | HTML

Distance-bounding protocols allow devices to cryptographically verify the physical proximity of two parties and is a prominent secure neighbour detection method. We describe how existing distance-bounding protocols could be modified to verify the proximity of both next-hop and two-hop neighbours. This approach allows a node to verify that another node is a physical next-hop neighbour, and also det... 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