<![CDATA[ IEEE Communications Letters - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 4234 2018March 15<![CDATA[Table of contents]]>223C1437285<![CDATA[IEEE Communications Society]]>223C2C285<![CDATA[Traffic Engineering Enhancement by Progressive Migration to SDN]]>223438441460<![CDATA[Generalized Three-Layer Integrated Interleaved Codes]]>223442445373<![CDATA[Ultra-Light Decoder for Turbo Product Codes]]>$M$ -ary modulation schemes over additive white Gaussian noise channels, and the coding gain is given for Rayleigh fading channels. The obtained numerical results show that the ULD offers coding gain that is comparable to the conventional TPC decoders under various system and channel conditions but with significantly lower complexity.]]>223446449732<![CDATA[Analysis and Design of Physical Layer Raptor Codes]]>2234504531283<![CDATA[Short Nonbinary Maximum Distance Separable Cycle Codes]]>223454457479<![CDATA[Improved LPC-Based Fronthaul Compression With High Rate Adaptation Resolution]]>223458461690<![CDATA[New MDS Symbol-Pair Codes From Repeated-Root Codes]]>223462465199<![CDATA[Polar-Code Construction of Golay Codes]]>223466469515<![CDATA[On the Performance of Multi-Message Algebraic Gossip Algorithms in Dynamic Random Geometric Graphs]]>ad hoc networks (MANETs). In the gossip algorithms, in each time slot, each node communicates with a neighboring node, which is randomly selected by an Exchange algorithm, to exchange their information. The goal of the algorithm is to efficiently disseminate all the messages to all the nodes as fast as possible. We analyze the convergence time of network coding (NC) based gossip algorithm by taking into account the node mobility in MANETs, and derived a lower bound on the convergence time. It showed that the convergence time of the NC gossip algorithm with node mobility can be reduced by the order of $O(n^{1/2}/log ^{3/2}n)$ over that without considering node mobility. But it is only $O(log n)$ quicker than the gossip algorithm with node mobility but no NC.]]>223470473228<![CDATA[An Efficient Tree Search Algorithm for the Free Distance of Variable-Length Error-Correcting Codes]]>223474477668<![CDATA[4.7-Gb/s LDPC Decoder on GPU]]>2234784811170<![CDATA[Rate-Compatible Tail-Biting Convolutional Codes for M2M Communications]]>$1/n$ , $3leq nleq 12$ . Numerical results show that the constructed RC-TBCCs have better frame error rate performance than the TBCCs used in LTE standards for various information lengths and code rates.]]>223482485555<![CDATA[High-Throughput Multi-Codeword Decoder for Non-Binary LDPC Codes on GPU]]>$3.12 times$ to $185 times$ over various Galois fields compared with the existing works on GPU.]]>223486489817<![CDATA[Low-Complexity Master Controller Assignment in Distributed SDN Controller Environments]]>223490493475<![CDATA[Resource Optimization in Heterogeneous Cloud Radio Access Networks]]>223494497466<![CDATA[TDD-Based Rapid Fault Detection and Recovery for Fronthaul Bridged Network]]>223498501872<![CDATA[A New Constellation Diagram-Based Signal Detection for GSM-MIMO Systems]]>223502505823<![CDATA[A Space Shift Keying for Downlink Multi-User Transmission With Partial CSI in Massive MIMO Systems]]>223506509458<![CDATA[A Novel PAPR Reduction Scheme for OFDM System Based on Deep Learning]]>223510513618<![CDATA[On Constellation Rotation of NOMA With SIC Receiver]]>223514517724<![CDATA[Wi-Fi and Wireless Power Transfer Live Together]]>223518521732<![CDATA[Phase Noise Resistant Rotation Iteration-Based Carrier Interferometry Code Design for High Speed Optical OFDM Systems]]>223522525772<![CDATA[Estimating Delay Times Between Cloud Datacenters: A Pragmatic Modeling Approach]]>223526529735<![CDATA[Energy Analysis of Co-Channel Harvesting in Wireless Networks]]>223530533377<![CDATA[A Semi-Analytical Method for Periodic Earth Coverage Satellites Optimization]]>longitude interval of ascending node of the orbit. Subsequently, a mixed integer linear programming (MILP) model and an improved 0/1 programming model are formulated with coverage constraints that considerably reduce the size of the search space. We demonstrate that the new method significantly improves the optimization efficiency and verify the robustness of the solution.]]>2235345371177<![CDATA[A Gini Impurity-Based Interest Flooding Attack Defence Mechanism in NDN]]>223538541714<![CDATA[Anti-Jamming Underwater Transmission With Mobility and Learning]]>$Q$ -networks-based transmission scheme can achieve the optimal power and node mobility control without knowing the jamming model and the underwater channel model in the dynamic game. Experiments performed with transducers in a non-anechoic pool show that our proposed scheme can reduce the bit error rate of the underwater transmission against reactive jamming compared with the $Q$ -learning based scheme.]]>2235425451012<![CDATA[Analog Cooperative Beamforming With Spherically-Bound Random Arrays for Physical-Layer Secure Communications]]>223546549670<![CDATA[Secrecy-Enhancing Scheme for Spatial Modulation]]>223550553610<![CDATA[Unitary Direction of Arrival Estimation Based on A Second Forward/Backward Averaging Technique]]>223554557522<![CDATA[Impulse Noise Mitigation in IR-UWB Communication Using Signal Cluster Sparsity]]>a priori knowledge of the amplitude, the probability of occurrence of IN, or channel estimation.]]>223558561420<![CDATA[DOA Estimation for Coprime Linear Arrays: An Ambiguity-Free Method Involving Full DOFs]]>223562565877<![CDATA[Analysis and Exploitation of the Noise Correlation in MIMO Power Line Communications in the FM Band]]>223566569718<![CDATA[A Robust Blind Detection Algorithm for Cognitive Radio Networks With Correlated Multiple Antennas]]>223570573602<![CDATA[Robust Beamforming in Downlink MIMO NOMA Networks Using Cutting-Set Method]]>223574577346<![CDATA[Downlink Achievable Rate of Massive MIMO Enabled SWIPT Systems Over Rician Channels]]>223578581474<![CDATA[A Novel Quasi Orthogonal Space Frequency Code For Cooperative Communication]]>223582585536<![CDATA[A Novel NTRU-Based Handover Authentication Scheme for Wireless Networks]]>223586589471<![CDATA[On the Performance of Non-Orthogonal Multiple Access in Short-Packet Communications]]>223590593502<![CDATA[Energy-Efficient Transmission Design in Cooperative Relaying Systems Using NOMA]]>223594597370<![CDATA[Hybrid Duplex Wireless Peer Discovery With Imperfect Self-Interference Cancellation]]>223598601737<![CDATA[Analytical Calculation of Spectrum Requirements for LTE-A Using the Probability Distribution on the Scheduled Resource Blocks]]>223602605654<![CDATA[Consequences of Performing DL MU-MIMO Transmissions With TXOP Sharing for QoS Provisioning in IEEE 802.11ac Networks]]>223606609662<![CDATA[QoS-Aware Hybrid Scheduling for Geographical Zone-Based Resource Allocation in Cellular Vehicle-to-Vehicle Communications]]>223610613784<![CDATA[A Novel Adaptive TDMA-Based MAC Protocol for VANETs]]>2236146171328<![CDATA[Asynchronous-Symmetric Channel-Hopping Sequences Over Prime Field for Cognitive Radio Networks]]>223618621680<![CDATA[Distributed Power Allocation for Nonorthogonal Multiple Access Heterogeneous Networks]]>223622625471<![CDATA[Forwarding in Heterogeneous Mobile Opportunistic Networks]]>renewal theory, we derive a closed-form expression for the mean delivery delay in a heterogeneous network under any probabilistic two-hop relay selection policy. Utilizing this expression, a policy that assures the least mean delivery delay can be obtained as a solution of a linear program (the time complexity of $mathcal {O}(n^{3})$ ). However, exploiting the structure of the mean delay minimization problem, we compute an optimal solution using an algorithm with linearithmic ($mathcal {O}(n log n)$ ) time complexity.]]>223626629434<![CDATA[Enhanced Collision Avoidance for Distributed LTE Vehicle to Vehicle Broadcast Communications]]>223630633609<![CDATA[A Time-Varied Probabilistic ON/OFF Switching Algorithm for Cellular Networks]]>223634637320<![CDATA[Robust Wide-Beam Analog Beamforming With Inaccurate Channel Angular Information]]>223638641877<![CDATA[MMSE-Based Precoding for Rate Splitting Systems With Finite Feedback]]>223642645341<![CDATA[A Closed-Form Expression of Coherence Bandwidth for Troposcatter Links]]>223646649803<![CDATA[Location Verification Systems Based on Received Signal Strength With Unknown Transmit Power]]>223650653285<![CDATA[Achievable Rate Analysis of Opportunistic Transmission in Bursty Interference Networks]]>$K$ -user bursty fading interference channel, where each user transmits data intermittently with a certain probability under the local channel state information assumption. In particular, we consider three different transmission techniques with fixed power: random transmission (RT), opportunistic transmission-based on generating interference (OT-1), and opportunistic transmission based on desired channel gain (OT-2). We mathematically analyze the average achievable rates of the three transmission techniques, which is the first theoretical result to the best our knowledge. The analysis is validated via extensive computer simulations. It is shown that the opportunistic transmission techniques (OT-1 and OT-2) result in better performance in terms of the achievable rate compared with the RT as well as the conventional non-bursty transmission technique.]]>223654657544<![CDATA[IEEE Communications Society]]>223C3C359