<![CDATA[ Communications Letters, IEEE - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 4234 2014December 25<![CDATA[Table of Contents]]>1812C1C4105<![CDATA[IEEE Communications Letters publication information]]>1812C2C2132<![CDATA[Reliability-Based Iterative Decoding Algorithm for LDPC Codes With Low Variable-Node Degree]]>181220652068493<![CDATA[Correction of Two (or Often More) Vector Symbol Errors With the Outer Structure of a Hamming Single Error Correcting Code]]>$>$ 2 errors can be corrected, up to a good fraction of even $n-k$ errors of a $(n,k)$ Hamming single error correcting code.]]>181220692072297<![CDATA[On the Construction of Low Error Floor LDPC Codes on Rectangular Lattices]]>$k$) LDPC codes on rectangular lattices. This method, however, creates a certain number of small trapping sets, which degrade overall performances. In this letter, an improved construction of a class of (3, $k$) LDPC codes on rectangular lattices is presented. Relevant constraints are derived to eliminate small trapping sets to improve performance in the error floor region. The check matrices of the proposed codes are introduced into quasi-cyclic structures, where experimental investigation shows favorable error rate performance over AWGN channels.]]>181220732076533<![CDATA[An Efficient Hybrid Decoder for Block Turbo Codes]]>et al. A simple formula for estimating the extrinsic information is first derived. Then the proposed decoder is constructed by modifying the decoder of Al-Dweik et al. using the formula. Simulation results show that the proposed decoder can substantially reduce the complexity of the decoder of Al-Dweik et al., especially for moderate and high signal-to-noise ratios, with nearly the same bit error rate performance.]]>181220772080297<![CDATA[A Novel Puncturing Scheme for Polar Codes]]>181220812084895<![CDATA[Decoding LDPC Codes With Locally Maximum-Likelihood Binary Messages]]>181220852088534<![CDATA[EXIT Chart Analysis of Puncturing for Non-Binary LDPC Codes]]>181220892092450<![CDATA[A Hybrid Decoding Scheme for Short Non-Binary LDPC Codes]]>$approx 10^{-5}$. Notably, for a fixed MRB order, hybrid decoding achieves a gain up to 0.5 dB at CER $approx 10^{-5}$ with respect to BP decoding and MRB decoding used alone.]]>181220932096549<![CDATA[Cramer-Rao Bound for SNR Estimation of Hyper-Cubic Signals Over Gaussian Channel]]>181220972100257<![CDATA[PLC Performance Analysis Over Rayleigh Fading Channel Under Nakagami- <inline-formula> <tex-math notation="TeX">$m$</tex-math></inline-formula> Additive Noise]]>$m$ distributed additive background noise assuming binary phase shift keying modulation scheme. The probability density function of the decision variable is derived. We obtain a numerically computable expression of the analytical average bit error rate of the considered system. The closed-form expression of the outage probability of the PLC system is also computed. Simulation results closely verify the validity of the derived analytical expressions.]]>181221012104330<![CDATA[Demonstration of 60 Gb/s W-Band Optical mm-wave Signal Full-Duplex Transmission Over Fiber-Wireless-Fiber Network]]>$2times 10^{-2}$.]]>181221052108574<![CDATA[Data Enriched SACK: A Novel Acknowledgement Generation Scheme for Secure SCTP]]>181221092112636<![CDATA[Dynamic Wavelength and Bandwidth Allocation in Flexible TWDM Optical Access Network]]>181221132116680<![CDATA[Optimization of Multicast Traffic in Elastic Optical Networks With Distance-Adaptive Transmission]]>181221172120171<![CDATA[Self-Similar Traffic End-to-End Delay Minimization Multipath Routing Algorithm]]>181221212124320<![CDATA[Geometric Routing With Word-Metric Spaces]]>181221252128257<![CDATA[Comment on “A Novel Homomorphic MAC Scheme for Authentication in Network Coding”]]>$1/q^{l}$, where $q$ is the cardinality of the message symbol field $BBF_{q}$, and $linBBZ^{+}$ is a proper security parameter. A formal proof of its security is also given in their work. However, in this letter, we show that there exists an inherent vulnerability in Cheng-Jiang TraceMac scheme, which results in a forgery attack on the scheme. Moreover, we also point out an error in their formal security proof. We hope that with our discussion, a better understanding of using trace function to design homomorphic MAC scheme can be identified, and similar mistakes can be avoided in future design and security proof of homomorphic MAC scheme for network coding.]]>181221292132134<![CDATA[Performance Analysis of MPSK Phase Detectors for Carrier Synchronization PLLs at Low SNRs]]>$M$-ary phase shift keying (MPSK) receivers working at low signal-to-noise ratios (SNRs). These PDs have the property that their outputs are functions of the inputs' phase only, and thus, their performance is independent of the automatic gain control (AGC) circuits. We deduce closed-form expressions about the linearized gain and equivalent noise variance of these PDs when SNR goes to zero and sum up simple approximate formulas for three typical PDs at all SNRs. We also prove that the modified $M$th-power PD performs asymptotically best in this category of PDs as SNR goes to zero.]]>181221332136152<![CDATA[Delay–Interleaved Cooperative Relay Networks]]>181221372140354<![CDATA[An Iterative DFE Receiver for MIMO SC-FDMA Uplink]]>181221412144562<![CDATA[On the Uplink SIR Distributions in Heterogeneous Cellular Networks]]>181221452148560<![CDATA[Optimization of a Relay-Assisted Link With Buffer State Information at the Source]]>181221492152296<![CDATA[Optimal MIMO Multicast Transceiver Design for Simultaneous Information and Power Transfer]]>181221532156354<![CDATA[Adaptive Modulation in Decode-and-Forward Cooperative Communications With Limited Source-Relay CSI]]>181221572160446<![CDATA[On Energy Efficiency Maximization in Downlink MIMO Systems Exploiting Multiuser Diversity]]>181221612164364<![CDATA[Joint Social-Position Relationship Based Cooperation Among Mobile Terminals]]>181221652168240<![CDATA[Optimal Power Allocation for Multicarrier Secure Communications in Full-Duplex Decode-and-Forward Relay Networks]]>181221692172246<![CDATA[Cross-Layer Design of Joint Beamforming and Random Network Coding in Wireless Multicast Networks]]>181221732176309<![CDATA[Secondary Network Connectivity of <italic>Ad Hoc</italic> Cognitive Radio Networks]]>ad hoc cognitive radio networks (CRNs). Considering correct detection and false alarm probabilities ( $P_{d}$ and $P_{f}$), we derive in closed-form the thinned density of active secondary users (SUs) in a secondary network. We show the active-probability and detectable radius of primary users (PUs) have a significant impact on the density of active SUs. Moreover, we find that increasing $P_{f}$ of SUs considerably decreases the node density of active SUs. The connectivity of the secondary network is further analysed with the continuum percolation theory. Given the critical density of the secondary network without the impact of PUs, the critical density of the secondary network coexisting with PUs is estimated analytically. Simulations confirm our analysis.]]>181221772180607<![CDATA[Measurement-Based Modeling of Interarrivals for the Simulation of Highway Vehicular Networks]]>181221812184463<![CDATA[A Novel BILP Model for Energy Optimization Under Data Precision Constraints in Wireless Sensor Networks]]>${ssr EMDP}$. The exact solution of our BILP model determines, in each round of data collection, the role of each node in terms of sensing, data relaying, and processing. It gives the baseline for optimal network operations and helps characterizing the complexity of ${ssr EMDP}$ problem. Moreover, we propose a heuristic solution, namely, CORAD, which is an energy-aware correlation-based adaptive dynamic clustering algorithm for data collection.]]>181221852188249<![CDATA[A Rule-Based Solution Search Methodology for Self-Optimization in Cellular Networks]]>181221892192657<![CDATA[Optimal Energy Efficiency Link Adaptation in IEEE 802.15.6 IR-UWB Body Area Networks]]>181221932196347<![CDATA[An Indoor AOA Estimation Algorithm for IEEE 802.11ac Wi-Fi Signal Using Single Access Point]]>181221972200758<![CDATA[A Game-Theoretic Approach to Exploit Partially Overlapping Channels in Dynamic and Distributed Networks]]>181222012204549<![CDATA[A Novel Graphic Coverage Hole Description in Wireless Sensor Networks]]>181222052208466<![CDATA[Collaborative Self-Healing With Opportunistic IBS Selection in Indoor Wireless Communication Systems]]>181222092212443<![CDATA[A Model for Epidemical DTN Considering Effects of Path Loss and Interference]]>181222132216339<![CDATA[Grouped Channel Quantization and Antenna Combining for Multiuser MIMO OFDM Systems]]>181222172220349<![CDATA[Near-ML MIMO Detection Algorithm With LR-Aided Fixed-Complexity Tree Searching]]>$10^{-5}$ for a 8 $times$ 8 MIMO system with 256 QAM. Also, the proposed method reduces the complexity to about 1.23% of the corresponding FSD complexity.]]>181222212224737<![CDATA[A Joint Scheme of Antenna Selection and Power Allocation for Localization in MIMO Radar Sensor Networks]]>181222252228515<![CDATA[A Dual-Threshold Policy for Opportunistic Spectrum Access in Fading Channels]]>181222292232481<![CDATA[Performance of Hybrid Selection and Switch-and-Stay Combining With Decode-and-Forward Relaying]]>$M$-ary phase-shift keying (MPSK) signaling using paired error approach. Numerical results reveal that full diversity order is achieved in the case of HSSSC scheme and improvement in the SEP performance is observed when compared to the distributed selection combining (SC), distributed scaled selection combining, and distributed switch-and-stay combining schemes proposed in the literature. In addition, the HSSSC scheme requires less channel state information (CSI) at D compared to the distributed full CSI SC scheme proposed in the literature.]]>181222332236247<![CDATA[Iterative Antenna Selection for Decode-and-Forward MIMO Relay Systems Under a Holistic Power Model]]>181222372240139<![CDATA[2014 Index IEEE Communications Letters Vol. 18]]>1812224123041117<![CDATA[IEEE Communications Society Information]]>1812C3C3123