<![CDATA[ IEEE Transactions on Communications - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 26 2019April 25<![CDATA[Table of contents]]>674C1C4319<![CDATA[IEEE Communications Society]]>674C2C2100<![CDATA[Repeat-Accumulate Signal Codes]]>repeat-accumulate signal codes (RASCs). To analyze the asymptotic behavior of these codes, we employ Monte Carlo density evolution (MC-DE). As a result, the optimum filters can be efficiently found for the given parameters of the encoder. We also introduce a low-complexity decoding algorithm for RASCs called the extended min-sum (EMS) decoder. The MC-DE analysis shows that the difference between the noise thresholds of RASC and the Shannon limit is within 0.8 dB. The simulation results moreover show that the EMS decoder can reduce the computational complexity to less than 25% of that of conventional decoder without degrading the performance by more than 1 dB.]]>674260726191371<![CDATA[A Systematic Approach to Incremental Redundancy With Application to Erasure Channels]]>674262026313534<![CDATA[Design of Irregular SC-LDPC Codes With Non-Uniform Degree Distributions by Linear Programming]]>674263226462106<![CDATA[Additive, Structural, and Multiplicative Transformations for the Construction of Quasi-Cyclic LDPC Matrices]]>674264726591598<![CDATA[Circular-Shift Linear Network Codes With Arbitrary Odd Block Lengths]]>$L$ is a prime with primitive root 2, it was recently shown that a scalar linear solution over GF($2^{L-1}$ ) induces an $L$ -dimensional circular-shift linear solution at rate $(L-1)/L$ . In this paper, we prove that for arbitrary odd $L$ , every scalar linear solution over GF($2^{m_{L}}$ ), where $m_{L}$ refers to the multiplicative order of 2 modulo $L$ , can induce an $L$ -dimensional circular-shift linear solution at a certain rate. Based on the generalized connection, we further prove that for such $L$ with $m_{L}$ beyond a threshold, every multicast network has an $L$ -dimensional circular-shift linear solution at rate $phi (L)/L$ , where $phi (L)$ is the Euler’s totient function of $L$ 67426602672854<![CDATA[Multi-Scale Spectrum Sensing in Dense Multi-Cell Cognitive Networks]]>agglomerative clustering algorithm is proposed to design a cost-effective aggregation tree, matched to the structure of interference, robust to local estimation errors, and delays. Given these multi-scale estimates, the SU traffic is adapted in a decentralized fashion in each cell, to optimize the trade-off among SU cell throughput, interference caused to PUs, and mutual SU interference. Numerical evaluations demonstrate a small degradation in SU cell throughput (up to 15% for a 0 dB interference-to-noise ratio experienced at PUs) compared to a scheme with full network state information, using only one-third of the cost incurred in the exchange of spectrum estimates. The proposed interference-matched design is shown to significantly outperform a random tree design, by providing more relevant information for network control, and a state-of-the-art consensus-based algorithm, which does not leverage the spatio-temporal structure of interference across the network.]]>674267326881170<![CDATA[Polarization Jones Vector Distance Statistics-Based Full-Duplex Primary Signal Extraction for Cognitive Radios]]>674268927012650<![CDATA[Multi-Node ML Time and Frequency Synchronization for Distributed MIMO-Relay Beamforming Over Time-Varying Flat-Fading Channels]]>$K$ single-antenna nodes, for pre-compensation at each node of the transmitted signals, to ensure constructive maximum ratio combining (MRC) at the destination. Simulation results show significant synchronization accuracy improvement over previous distributed multi-node synchronization techniques assuming TCCs. The latter translates into noticeable gains in terms of useful link-level throughput, more so at higher Doppler or with more relaying nodes.]]>674270227152293<![CDATA[Exploiting Full-Duplex Two-Way Relay Cooperative Non-Orthogonal Multiple Access]]>674271627292078<![CDATA[Caching With Time Domain Buffer Sharing]]>$G/GI/L/0$ queue model is formulated, in which a diffusion approximation and the Erlang-B formula are adopted to determine the buffer overflow probability and the corresponding hit ratio. The optimal hit ratio is shown to be limited by the demand probability and buffer size for large and small buffers respectively. In practice, a user may exploit probabilistic caching with random maximum caching time and arithmetic caching without any need for content arrival statistics to efficiently harvest content files from the air.]]>674273027453440<![CDATA[Large-Scale-Fading Decoding in Cellular Massive MIMO Systems With Spatially Correlated Channels]]>674274627621523<![CDATA[Optimized Power Control for Massive MIMO With Underlaid D2D Communications]]>674276327783112<![CDATA[Non-Uniform Quantization Codebook-Based Hybrid Precoding to Reduce Feedback Overhead in Millimeter Wave MIMO Systems]]>674277927911662<![CDATA[Broad Coverage Precoding Design for Massive MIMO With Manifold Optimization]]>674279228061273<![CDATA[Average SEP-Optimal Precoding for Correlated Massive MIMO With ZF Detection: An Asymptotic Analysis]]>$lim _{xto infty }(1+1/x)^{x}=e$ . The application of these two tools enables us to attain very simple expressions of the SEP limits as the number of the transmitter antennas goes to infinity. A major advantage of our asymptotic analysis is that the asymptotic SEP converges to the true SEP when the number of antennas is moderately large. As such, the obtained expressions can serve as an effective SEP approximations for massive MIMO systems even when the number of antennas is not very large. For the widely used exponential correlation model, we derive closed-form expressions for the SEP limits of both optimally precoded and uniformly precoded systems. Extensive simulations are provided to demonstrate the effectiveness of our asymptotic analysis and compare the performance limit of optimally precoded and uniformly precoded systems.]]>674280728211513<![CDATA[Soft-Output Detection Methods for Sparse Millimeter-Wave MIMO Systems With Low-Precision ADCs]]>674282228361641<![CDATA[Improving the Survivability of Clustered Interdependent Networks by Restructuring Dependencies]]>674283728481844<![CDATA[Efficient File Delivery for Coded Prefetching in Shared Cache Networks With Multiple Requests Per User]]>674284928652285<![CDATA[Artificial Noise-Based Beamforming for the MISO VLC Wiretap Channel]]>674286628791241<![CDATA[Ordered Sequence Detection and Barrier Signal Design for Digital Pulse Interval Modulation in Optical Wireless Communications]]>$K$ symbols is allocated with more power as an inserted barrier signal. BDPIM with OSD (BDPIM-OSD) can limit the error propagation between two adjacent barriers. To reduce the storing delay when using OSD to detect extremely large packets, we propose BDPIM with a combination of OTD and OSD (BDPIM-OTD-OSD), within which long sequences are cut into pieces and separately detected. Approximate upper bounds of the average BER performance of DPIM-OTD, DPIM-OSD, BDPIM-OSD, and BDPIM-OTD-OSD are analysed. Simulations are conducted to corroborate our analysis. Optimal parameter settings are also investigated in uncoded and coded systems by simulations. Simulation results show that the proposed OSD and BDPIM bring significant improvement in uncoded and coded systems over various channels.]]>674288028921799<![CDATA[Unified Statistical Channel Model for Turbulence-Induced Fading in Underwater Wireless Optical Communication Systems]]>674289329073582<![CDATA[Interplay of Bit Rate, Linewidth, Bandwidth, and Reach on Optical DMT and PAM With IMDD]]>67429082913924<![CDATA[Resource Allocation for LDPC-Coded OFDM Downlink Channels]]>et al. The latter formulates a necessary condition for the belief-propagation decoder to perfectly decode a received vector with no errors. The general condition is re-formulated so as to model practical multi-carrier systems, such as OFDM. Consequently, a general resource-allocation framework is laid down for optimizing the transmitted power based on the characteristics of the LDPC code in use. The proposed optimization technique is utilized for power allocation in orthogonal frequency-division multiple access systems; and the transmitted power is minimized while guaranteeing reliable decoding. To validate the proposed approach, it is compared to information-theoretic-based methods that aim at optimizing the mutual information between the transmitter and the receiver. Both approaches are shown to provide almost identical performance for the scenarios addressed in this paper.]]>67429142923923<![CDATA[Frequency Synchronization in Distributed Antenna Systems: Pairing-Based Multi-CFO Estimation, Theoretical Analysis, and Optimal Pairing Scheme]]>674292429381221<![CDATA[<inline-formula> <tex-math notation="LaTeX">$alpha$ </tex-math></inline-formula>-Fair Dynamic Spectrum Management for QRD-Based Precoding With User Encoding Ordering in Downstream G.Fast Transmission]]>$ alpha $ -fairness policy. Since finding the globally optimal UEO entails a combinatorial optimization problem with excessive computational complexity, an iterative algorithm is proposed which uses per-tone exhaustive searches (PTESs) and provides near-optimal approximate solutions. To further reduce the computational complexity, two suboptimal methods are suggested to replace the expensive PTESs, leading to two additional $ alpha $ -fair DSM algorithms that are tractable for large scenarios against little performance loss. Simulations of a G.fast cable binder show that the $ alpha $ -fair DSM algorithms achieve an efficient trade-off between fairness and performance in contrast to current UEO methods.]]>674293929501478<![CDATA[Resource Virtualization for Customized Delay- Bounded QoS Provisioning in Uplink VMIMO-SC-FDMA Systems]]>674295129672589<![CDATA[Revisiting Effectiveness of Energy Conserving Opportunistic Transmission Schemes in Energy Harvesting Wireless Sensor Networks]]>674296829801068<![CDATA[Deployment Strategies of Multiple Aerial BSs for User Coverage and Power Efficiency Maximization]]>$K$ -means clustering. The method divides the target area into $K$ convex subareas, where within each subarea, a mixed integer non-linear problem is solved. An iterative power efficient technique is further proposed to improve coverage probability with reduced power. Finally, we propose a robust technique for compensating the loss of coverage probability in the existence of inaccurate user location information. Our simulation results show that the proposed techniques achieve an up to 30% higher coverage probability when users are not distributed uniformly. In addition, the proposed simultaneous deployment techniques, especially the one using iterative algorithm, improve power-efficiency by up to 15% compared with the benchmark circle packing theory.]]>674298129941960<![CDATA[Real-Time Ultra-Wideband Channel Sounder Design for 3–18 GHz]]>674299530083910<![CDATA[Meta Distribution of SIR in Large-Scale Uplink and Downlink NOMA Networks]]>674300930251624<![CDATA[The Transmit-Energy vs Computation-Delay Trade-Off in Gateway-Selection for Heterogenous Cloud Aided Multi-UAV Systems]]>674302630391700<![CDATA[Device-to-Device Load Balancing for Cellular Networks]]>674304030542081<![CDATA[Sum Rate Optimization of Multi-Standard IEEE 802.11 WLANs]]>674305530681718<![CDATA[SIR Meta Distribution of <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-Tier Downlink Heterogeneous Cellular Networks With Cell Range Expansion]]>$K$ -tier heterogeneous cellular networks based on the homogeneous independent Poisson point process (PPP) model, with range expansion bias (offloading bias) in each tier. Expressions for the $b$ -th moment of the conditional success probability for both the entire network and each tier are derived, based on which the exact meta distributions and the beta approximations are evaluated and compared. Key performance metrics, including the mean success probability, the variance of the conditional success probability, the mean local delay, and the asymptotic SIR gains of each tier are obtained. The results show that the biases are detrimental to the overall mean success probability of the whole network and that the $b$ -th moment curve of the conditional success probability of each tier can be tightly approximated by the horizontal shifted versions of the first moment curve of the single-tier PPP network. We also provide lower bounds for the region of the active probabilities of the base stations to keep the mean local delay of each tier finite.]]>674306930811529<![CDATA[Antenna Placement and Performance Tradeoffs With Hand Blockage in Millimeter Wave Systems]]>spherical coverage corresponding to good array gains over the entire sphere around the UE with a low beam management overhead, complexity, and cost. The scope of this paper is to study the implications of two popular commercial millimeter-wave UE designs (a face and an edge design) on spherical coverage. We show that the analog beam codebooks can result in good performance for both the designs, and the edge design provides a better trade-off in terms of robust performance (with hand blockage), beam management overhead, implementation complexity from an antenna placement standpoint, and cost.]]>674308230963653<![CDATA[IEEE Open Access Publishing]]>674309730971252<![CDATA[Introducing IEEE Collabratec]]>674309830982097<![CDATA[IEEE Communications Society]]>674C3C377