Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.

IEEE Communications Letters

Filter Results

Displaying Results 1 - 25 of 56

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

Publication Year: 2016, Page(s): C2
| PDF (88 KB)
• q-Ary Chain-Containing Quantum Synchronizable Codes

Publication Year: 2016, Page(s):414 - 417
Cited by:  Papers (1)
| | PDF (101 KB) | HTML

We propose a general design of quantum synchronizable codes from classical q-ary cyclic codes. With the aid of classical super/subcodes, the proposed method exploits the idea of chain-containing q-ary cyclic codes when designing quantum synchronizable codes. The distance bound of the resulting quantum synchronizable codes of Calderbank-Shor-Steane (CSS) structure is derived using the representatio... View full abstract»

• On the Weight Enumerator of Periodically Time-Varying Convolutional Codes

Publication Year: 2016, Page(s):418 - 421
| | PDF (184 KB) | HTML

An iterative algebraic method called state reduction algorithm has been proposed to compute the distance spectrum of time-invariant convolutional codes. This method is based on an iterative manipulation of the symbolic adjacency matrix of the state diagram. This work defines new adjacency matrices for time-varying convolutional codes to allow the application of this algorithm for this class of cod... View full abstract»

• A Relaxed Min-Sum LDPC Decoder With Simplified Check Nodes

Publication Year: 2016, Page(s):422 - 425
| | PDF (315 KB) | HTML

This letter presents a heuristic technique for simplifying the parity-check node operation in a relaxed min-sum iterative decoder. The proposed decoder eliminates the second-minimum computation in check nodes, which allows broadcasting the same output to all neighboring variable nodes to alleviate routing problem in VLSI implementations of low-density parity check (LDPC) decoders. The second-minim... View full abstract»

• Hadamard Minimum Storage Regenerating Code Revisited

Publication Year: 2016, Page(s):426 - 429
| | PDF (272 KB) | HTML

In this letter, we revisit the Hadamard minimum storage regenerating code to form a new minimum storage regenerating code. The resultant new code has two more systematic nodes than that of the Hadamard minimum storage regenerating code with the same node capacity. Furthermore, we present simple but efficient repair strategies for all the systematic nodes of the new code. View full abstract»

• Analysis of RSRP Measurement Accuracy

Publication Year: 2016, Page(s):430 - 433
Cited by:  Papers (1)
| | PDF (328 KB) | HTML

In this letter, the accuracy of the reference signal received power (RSRP) measurement carried out by an LTE user equipment (UE) is analyzed. Assuming the measurement based on the averaged frequency-domain maximum likelihood estimate (FD-MLE), the closed-form expressions of the mean-error and mean-squared-error (MSE) are obtained to show the impact of the channel parameters, the cell ID, the subse... View full abstract»

• Minimizing Completion Time for Relay-Assisted Multicast With Instantly Decodable Network Coding

Publication Year: 2016, Page(s):434 - 437
Cited by:  Papers (1)
| | PDF (543 KB) | HTML

We propose a selective retransmission (SR) protocol for relay-assisted multicast systems with instantly decodable network coding (IDNC). Our protocol consists of three stages, the initial transmission stage, selective retransmission stage, and relay retransmission stage. To reduce the computational complexity, weighted packet scheduling (WPS) algorithm, which is used to select coded packets in gre... View full abstract»

• On the Power Allocation for a Practical Multiuser Superposition Scheme in NOMA Systems

Publication Year: 2016, Page(s):438 - 441
Cited by:  Papers (4)
| | PDF (358 KB) | HTML

In this letter, we study nonorthogonal multiple access (NOMA) systems with a linear multiuser superposition transmission (MUST) scheme. To perform the power allocation or the determination of the transmission power ratio for linear MUST with practical modulation schemes of finite constellation sizes, we consider the mutual information. An approach based on Monte Carlo simulations is devised to obt... View full abstract»

• On the Analytical Solution of Rank Problem in the Convolutional Code Identification Context

Publication Year: 2016, Page(s):442 - 445
| | PDF (89 KB) | HTML

The rank-based method is very effective to identify the convolutional code parameters in a non-cooperative context. This method cuts the received sequence up into vectors of length l to form the rows of matrix C(l). It is well known that there is a relationship between the code parameters and the rank behavior of C(l). However, finding the general form of this relation is a c... View full abstract»

• Low Complexity OFDM-IM Detector by Encoding All Possible Subcarrier Activation Patterns

Publication Year: 2016, Page(s):446 - 449
Cited by:  Papers (3)
| | PDF (331 KB) | HTML

In orthogonal frequency division multiplexing with index modulation (OFDM-IM), the use of a maximum likelihood (ML) detector becomes impractical for large number of subcarriers per subblock, due to its exponentially growing detection complexity. Lower complexity detectors determine the received subcarrier activation pattern (SAP) through detecting the state of the subcarriers by thresholding. Thes... View full abstract»

• Hybrid Maximum Likelihood Modulation Classification for Continuous Phase Modulations

Publication Year: 2016, Page(s):450 - 453
Cited by:  Papers (1)
| | PDF (381 KB) | HTML

In this letter, we propose a hybrid maximum likelihood (HML) classifier for continuous phase modulation (CPM). To the best of our knowledge, the proposed likelihood function is the first one for CPM signals that is based on two of its main features: nonlinear waveform, which is represented with its principal components, and signal memory, which is modeled as a Markov mapping symbol sequence. Unkno... View full abstract»

• An LDPC-Coded Generalized Space Shift Keying Scheme Using A Codebook-Assisted Low-Complexity Massive MIMO Detector

Publication Year: 2016, Page(s):454 - 457
| | PDF (401 KB) | HTML

Aimed at the emerging massive multiple-input multiple-output (MIMO) systems, both hard-decision and soft-decision detectors are investigated for the generalized space shift keying (GSSK) modulation scheme, where a codebook-assisted technique is used to reduce the tree-search complexity. Furthermore, the outer low-density parity-check (LDPC) code is optimized such that the proposed system design ca... View full abstract»

• Uplink Nonorthogonal Multiple Access in 5G Systems

Publication Year: 2016, Page(s):458 - 461
Cited by:  Papers (6)
| | PDF (437 KB) | HTML

In order to achieve diverse arrived power in uplink nonorthogonal multiple access (NOMA), an uplink power control scheme is proposed. The proposed scheme makes evolved NodeB (eNB) distinguish the multiplexing user equipments (UEs) in power domain. The outage performance and the achievable sum data rate for the proposed scheme are theoretically analyzed, and the closed-form expressions of outage pr... View full abstract»

• Design and Modelling of a Low-Latency Centralized Controller for Optical Integrated Networks

Publication Year: 2016, Page(s):462 - 465
Cited by:  Papers (2)
| | PDF (1006 KB) | HTML

Optical integrated network (OIN) is a promising alternative to overcome the restrictions that electrical networks-on-chip (eNoCs) will face in the next generation of multiprocessor integrated systems due to electrical interconnects' physical limitations. OINs present a higher bandwidth and lower power consumption but their full capabilities are curbed by high latency controllers. Control technique... View full abstract»

• Design of K-Node (Edge) Content Connected Optical Data Center Networks

Publication Year: 2016, Page(s):466 - 469
Cited by:  Papers (2)
| | PDF (859 KB) | HTML

Due to the fact that network connectivity has a fixed value for a given network, only using network connectivity to improve the survivability of data center networks will reach bottleneck. The content connectivity, which is defined as the reachability of content from any point of a network becomes research focus. In this letter, the definition of k-node (edge) content connectivity is given. Theore... View full abstract»

• Optimal Mode Selection in D2D-Enabled Multibase Station Systems

Publication Year: 2016, Page(s):470 - 473
Cited by:  Papers (4)
| | PDF (270 KB) | HTML

In this letter, we consider device-to-device (D2D) communication underlaying uplink cellular networks with multiple base stations (BSs), where each user can switch between traditional cellular mode (through BS) and D2D mode (by connecting proximity user), namely mode selection. We impose load balancing constraints on BSs to efficient resource usage. The joint problem of mode selection and user ass... View full abstract»

• Convexity of Fairness-Aware Resource Allocation in Wireless Powered Communication Networks

Publication Year: 2016, Page(s):474 - 477
Cited by:  Papers (5)
| | PDF (202 KB) | HTML

This letter focuses on fairness-aware power and time allocation in wireless powered communication networks under the “harvest-then-transmit” protocol, where downlink wireless energy transfer is implemented at first and then uplink wireless information transfer takes place in a spectrum-sharing fashion. We aim to achieve the rate fairness of all users under three fairness criteria nam... View full abstract»

• Independent Power Splitting for Interference-Corrupted SIMO SWIPT Systems

Publication Year: 2016, Page(s):478 - 481
| | PDF (322 KB) | HTML

In this letter, the design and performance of independent power splitting (PS) is investigated for interference-corrupted SIMO simultaneous wireless information and power transfer (SWIPT) systems. Namely, each antenna is connected to an individual power splitter at the receiver, and the corresponding PS factors for different antennas are jointly optimized to provide the more favorable tradeoff bet... View full abstract»

• Multibeam Pattern Synthesis With Adaptive Finite Excitation Amplitude Levels

Publication Year: 2016, Page(s):482 - 485
| | PDF (454 KB) | HTML

An optimization approach based on alternating projection (AP) is proposed to generate low earth orbit (LEO)-satellite-borne multiple patterns with isoflux coverage. The purpose is to find a common amplitude distribution and different phases corresponding to the different patterns. The common amplitudes are with finite levels, which are calculated adaptively in the iteration. To demonstrate the goo... View full abstract»

• Single-Channel Blind Source Separation of Co-Frequency Overlapped GMSK Signals Under Constant-Modulus Constraints

Publication Year: 2016, Page(s):486 - 489
Cited by:  Papers (2)
| | PDF (353 KB) | HTML

As for the single-channel overlapped signals, in which the modulation parameters of the component signals are identical or similar, it is still a great challenge to extract the component signals. Aiming at this problem, a single-channel blind source separation (SCBSS) algorithm, constrained by constant modulus, is proposed for the overlapped Gaussian minimum shift keying (GMSK) signals and this al... View full abstract»

• High Precision Low Complexity Matrix Inversion Based on Newton Iteration for Data Detection in the Massive MIMO

Publication Year: 2016, Page(s):490 - 493
Cited by:  Papers (7)
| | PDF (469 KB) | HTML

Currently, massive multiple-input multiple-output (MIMO) is one of the most promising wireless transmission technologies for 5G. Massive MIMO requires handling with large-scale matrix computation, especially for matrix inversion. In this letter, we find that matrix inversion based on Newton iteration (NI) is suitable for data detection in massive MIMO system. In contrast with recently proposed pol... View full abstract»

• Bayesian Hypothesis Testing for Block Sparse Signal Recovery

Publication Year: 2016, Page(s):494 - 497
Cited by:  Papers (1)
| | PDF (235 KB) | HTML

A novel block Bayesian hypothesis testing algorithm (BBHTA) is presented for reconstructing block-sparse signals with unknown block structures. The BBHTA detects and recovers the supports and then estimates the amplitudes of block sparse signal. The support detection and recovery are performed by a Bayesian hypothesis testing. Using the detected and reconstructed supports, the nonzero amplitudes a... View full abstract»

• Predictive Unicast and Multicast Scheduling in Onboard Buffered Crossbar Switches

Publication Year: 2016, Page(s):498 - 501
Cited by:  Papers (1)
| | PDF (550 KB) | HTML

In this letter, a predictive unicast and multicast scheduling (PUMS) scheme is proposed for onboard buffered crossbar switches to cope with time-variant traffic composition. The multicast service ratios required with respect to traffic composition ratio are deduced in theory to guarantee stability and fairness. In the proposed scheme, the multicast service ratios are obtained by a real-time traffi... View full abstract»

• Retrospective Network Coding Alignment Over $K$-User MIMO Y Channel

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

Under the assumption that each node has delayed channel state information at transmitter (D-CSIT), this letter studies the achievable degrees of freedom (DOF) for K-user multiple-input-multiple-output (MIMO) Y channel in frequency division duplex (FDD) systems, where each user exchanges messages with other K-1 users simultaneously via an intermediate relay. We propose a new retrospective network c... 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