<![CDATA[ IEEE Transactions on Communications - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 26 2016July 28<![CDATA[Table of contents]]>647C1C4331<![CDATA[IEEE Communications Society]]>647C2C2194<![CDATA[Blind Reconstruction of Binary Cyclic Codes From Unsynchronized Bitstream]]>647269327061583<![CDATA[XI-Code: A Family of Practical Lowest Density MDS Array Codes of Distance 4]]> (or ), where is a prime that satisfies: i) and ii) 2 is primitive in . In this paper, we propose a new family of the lowest density MDS array codes of distance 4, called XI-Code. It has the properties of: 1) being capable of correcting both triple erasures and a single error combined with one erasure; 2) having code length of either or with being an odd prime number; 3) achieving optimality in encoding and update; and 4) achieving optimality in erasure decoding for certain erasure patterns and near optimality for other erasure patterns. It is worth mentioning that XI-Code is the first discovered family of the lowest density MDS array codes of distance 4 that supports the code length of or with be-
ng an odd prime.]]>647270727181225<![CDATA[Algebraic Decoding of Cyclic Codes Without Error-Locator Polynomials]]> -ary cyclic code consists of four steps: 1) computation of the known syndromes using the received word; 2) computation of the unknown syndromes from the known syndromes; 3) computation of the error positions by a use of the Berlekamp-Massey (BM) algorithm and Chien’s search; and 4) computation of the error values by solving a linear system. This paper addresses two problems of determining the error positions and computing the unknown syndromes. To solve the first problem, a new matrix, together with Gaussian elimination instead of the BM algorithm and Chien’s search, is proposed. In this new simplified decoder, finding an error-locator polynomial is completely avoided. A main advantage of the presented decoding method is when the Bose-Chaudhuri–Hocquenghem bound is unequal to the minimum distance of the code. Some cyclic codes, which do not have consecutive known syndromes, can be decoded up to their actual minimum distance by using the presented matrix once. To solve the second problem, two algorithms for different square matrices reported recently by Lee et al. are also provided to calculate the value of an unknown syndrome. Finally, an algebraic decoding of the ternary cyclic code is given.]]>647271927311188<![CDATA[Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes]]>647273227451738<![CDATA[Fast Encoding of Polar Codes With Reed–Solomon Kernel]]>647274627531155<![CDATA[Energy Detection Spectrum Sensing Under RF Imperfections]]>647275427661571<![CDATA[Delay-Constrained Optimal Transmission With Proactive Spectrum Handoff in Cognitive Radio Networks]]> bits within a predefined deadline time slots is formulated as a discrete-time Markov decision process, in which the SU aims at minimizing its expected total cost, i.e., transmission cost, handoff cost, and overtime penalty. We solve the problem using dynamic programming, and propose a general optimal transmission with the proactive spectrum handoff (OTPH) algorithm whose complexity is . Furthermore, we prove that for a convex penalty function, the optimal handoff-aided transmission exhibits a threshold structure. A monotone OTPH algorithm with a complexity of is used in this case. Simulation results verify that our proposed scheme achieves both the minimal total cost and the highest data transmission efficiency as compared with the traditional always staying and always changing schemes.]]>647276727791727<![CDATA[Throughput Analysis for the Cognitive Uplink Under Limited Primary Cooperation]]> -out-of- feedback protocol, in which the primary base station feeds back only the smallest interference channel gains, out of of them, to the secondary base station. We characterize the throughput performance under the -out-of- feedback protocol by analyzing the achievable multiuser diversity gains (MDGs) in cognitive uplinks for three different network types. Our results show that the proposed feedback mechanism is asymptotically optimum for interference-limited (IL) and individual-power-and-interference-limited (IPIL) networks for a fixed positive . It is further shown that the secondary network throughput in the IL and IPIL networks (under both the full and limited cooperation scenarios) logarithmically scales with the number of users in the network. In total-power-and-interference-limited (TPIL) networks, on the other hand, the -out-of- feedback protocol is asymptotically optimum for , where . We also show that, in TPIL networks, the secondary network throughput under both the limited and full cooperation scales logarithmically double with the number of users in the network. These results indicate that the cognitive uplink can achieve the optimum MDG even with limited cooperation from the primary network. They also establish the dependence of pre-log throughput scaling factors on the distribution of fading channel gains for different network types.]]>647278027961704<![CDATA[On the Gaussian Fading Broadcast Relay Channel With Causal State Feedback]]>647279728071104<![CDATA[Two-Way Satellite Relaying With Estimated Channel Gains]]>64728082820865<![CDATA[Spatial Modulation Exploited in Non-Reciprocal Two-Way Relay Channels: Efficient Protocols and Capacity Analysis]]>647282128341441<![CDATA[Disintegrated Channel Estimation in Filter-and-Forward Relay Networks]]>647283528471016<![CDATA[Performance Analysis of DF Cooperative Relaying Over Bursty Impulsive Noise Channel]]>a posteriori (MAP) receiver. From the obtained results, it is seen that the DF CR scheme in bursty impulsive noise channel still achieves the space diversity and performs significantly better than DT under the same power consumption. Moreover, the proposed MAP receiver attains the lower bound derived for DF CR scheme and leads to large performance gains compared with the conventional receiving criteria, which were optimized for additive white Gaussian noise channel and memoryless impulsive noise channel.]]>647284828592107<![CDATA[Open-Loop End-to-End Transmission for Multihop Opportunistic Networks With Energy-Harvesting Devices]]>647286028721363<![CDATA[Two-Timeslot Two-Way Full-Duplex Relaying for 5G Wireless Communication Networks]]> - and four-node -relaying channels. Among various relaying protocols, the well-known amplify-and-forward and decode-and-forward are considered. Closed-form expressions for the average end-to-end rate and the outage probability, under the effect of residual self-interference and inter-user interference, are presented. The results show that the proposed two-timeslot two-way FD relaying scheme can achieve higher rate and better outage performance than the half-duplex one, when residual self-interference is below a certain level. Therefore, this relaying scheme presents a reasonable tradeoff between performance and complexity, and so, it could be efficiently used in the fifth-generation wireless networks.]]>647287328872261<![CDATA[On the Capacity of Multiple-Antenna Systems and Parallel Gaussian Channels With Amplitude-Limited Inputs]]>647288828991017<![CDATA[Capacity of 3D Erasure Networks]]> wireless nodes are randomly distributed in a cuboid of with for , and completely characterize its capacity scaling laws. Two fundamental path-loss attenuation models (i.e., exponential and polynomial power-law models) are used to suitably model an erasure probability for packet transmission. Then, under the two erasure models, we introduce a routing protocol using percolation highway in 3D space, and then analyze its achievable throughput scaling laws. It is shown that, under the two erasure models, the aggregate throughput scaling can be achieved in the 3D erasure network. This implies that the aggregate throughput scaling can be achieved in 3D cubic erasure networks, while can be achieved in 2D square erasure networks. The gain comes from the fact that, compared with 2D space, more geographic diversity can be exploited via 3D space, which means that generating more simultaneous percolation highways is possible. In addition, cut-set upper bounds on the capacity scaling are derived to verify that the achievable scheme based on the 3D percolation highway is order-optimal within a polylogarithmic factor under certain practical operating regimes on the decay parameters.]]>64729002912864<![CDATA[Approximate Capacity Region of the MISO Broadcast Channels With Delayed CSIT]]> -user multiple-input single-output broadcast channel with delayed knowledge of the channel state information at the transmitter to within bits/s/Hz.]]>647291329241241<![CDATA[Transmitter-Centric Channel Estimation and Low-PAPR Precoding for Millimeter-Wave MIMO Systems]]>64729252938762<![CDATA[BER Analysis for Spatial Modulation in Multicast MIMO Systems]]>647293929512172<![CDATA[Trimming Soft-Input Soft-Output Viterbi Algorithms]]> is moderate. Other analyses verify that our approach provides good LLR quality with only at most backtracking operations of SOVA. Simulation results show that it outperforms SOVA and performs as well as its variants and the Log-MAP algorithm.]]>647295229601794<![CDATA[A Comprehensive Framework for Quadrature Spatial Modulation in Generalized Fading Scenarios]]> –, –, and – distributions, are considered. The obtained results clearly show the influence of the fading parameters on the average BEP. In the case of the – fading channels, increasing has larger negative impact on the average BEP compared with increasing . For the – channels, increasing -
results in increasing the average BEP dramatically when compared with increasing . In the same context, in – fading channels, as increases the average BEP degrades whereas increasing slightly improves the average BEP. In addition, it is demonstrated that transmit-antenna correlation significantly deteriorate the average BEP when compared with receive-antenna correlation.]]>647296129703236<![CDATA[Upstream Polling Protocols for Flow Control in PON/xDSL Hybrid Access Networks]]>647297129842115<![CDATA[On the Stability of Static Poisson Networks Under Random Access]]>647298529981658<![CDATA[Multicast Switching Fabric Based on Network Coding and Algebraic Switching Theory]]>647299930102070<![CDATA[Secrecy Capacity Analysis Over <inline-formula> <tex-math notation="LaTeX">$kappa $ </tex-math></inline-formula>–<inline-formula> <tex-math notation="LaTeX">$mu $ </tex-math></inline-formula> Fading Channels: Theory and Applications]]> – fading channel in the presence of an eavesdropper who also experiences – fading. In particular, we obtain novel analytical solutions for the probability of strictly positive secrecy capacity (SPSC) and a lower bound of secure outage probability (SOP) for independent and non-identically distributed channel coefficients without parameter constraints. We also provide a closed-form expression for the probability of SPSC when the parameter is assumed to take positive integer values. Monte-Carlo simulations are performed to verify the derived results. The versatility of the – fading model means that the results presented in this paper can be used to determine the probability of SPSC and SOP for a large number of other fading scenarios, such as Rayleigh, Rice (Nakagami-), Nakagami-, One-Sided Gaussian, and mixtures of these common fading models. In addition, due to the duality of the analysis of secrecy capacity and co-channel interference (CCI), the results presented here will have immediate applicability in the an-
lysis of outage probability in wireless systems affected by CCI and background noise (BN). To demonstrate the efficacy of the novel formulations proposed here, we use the derived equations to provide a useful insight into the probability of SPSC and SOP for a range of emerging wireless applications, such as cellular device-to-device, peer-to-peer, vehicle-to-vehicle, and body centric communications using data obtained from real channel measurements.]]>6473011302411714<![CDATA[Physical Layer Security With RF Energy Harvesting in AF Multi-Antenna Relaying Networks]]>647302530381693<![CDATA[IQ Imbalance in Multiuser Systems: Channel Estimation and Compensation]]>647303930511380<![CDATA[Bit and Power Loading for Narrowband Indoor Powerline Communications]]>647305230631406<![CDATA[An Efficient Direct Solution of Cave-Filling Problems]]> , , where is the total number of resources, which is significantly lower than that of the existing algorithms given by an order of , , under the same memory requirement and sorted parameters. The algorithm is then generalized both to weighted CFP (WCFP) and WCFP requiring the minimum power. These extensions also result in a computational complexity of the order of , . Finally, simulation results corroborating the analysis are presented.]]>647306430771315<![CDATA[On Long-Term Statistical Dependences in Channel Gains for Fixed Wireless Links in Factories]]>647307830912223<![CDATA[Learning Temporal–Spatial Spectrum Reuse]]>647309231031839<![CDATA[Design, Modeling, and Performance Analysis of Multi-Antenna Heterogeneous Cellular Networks]]>647310431182074<![CDATA[Diversity-Multiplexing Tradeoff for Log-Normal Fading Channels]]>647311931291289<![CDATA[IEEE Access]]>64731303130605<![CDATA[Member Get-A-Member (MGM) Program]]>647313131313461<![CDATA[Introducing IEEE Collabratec]]>647313231322159<![CDATA[IEEE Communications Society]]>647C3C3133