<![CDATA[ Communications, IEEE Transactions on - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 26 2014July 31<![CDATA[Table of contents]]>627C1C4100<![CDATA[IEEE Transactions on Communications publication information]]>627C2C2152<![CDATA[On the Optimum Cyclic Subcode Chains of <inline-formula> <tex-math notation="TeX">${cal RM}(2, m)^{ast}$</tex-math></inline-formula> for Increasing Message Length]]>$GF(q)$ with length $n$ such that $gcd(n, q)=1$. In this paper, the optimum DPCs and the corresponding optimum cyclic subcode chains are investigated on the punctured second-order Reed–Muller code ${cal RM}(2, m)^{ast}$ for increasing message length, where two standards on the optimums are studied according to the rhythm of increase. Ignoring the dimension profile, the device will coincide with that of TFCI.]]>62721452155491<![CDATA[Using Short Synchronous WOM Codes to Make WOM Codes Decodable]]>synchronous WOM code and write generations of the original code and the synchronous code simultaneously. We consider both the binary and the nonbinary case. Furthermore, we propose a construction of synchronous WOM codes, which are then used to make nondecodable codes decodable. For short-to-moderate block lengths, the proposed method significantly reduces the rate loss as compared to the standard method.]]>62721562169906<![CDATA[Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes]]>proper and $C$-symmetric and make a connection to finite graph covers of the 3D-TC factor graph. This connection is used to show that the support set of any pseudocodeword is a stopping set of iterative decoding of 3D-TCs using maximum a posteriori constituent decoders on the binary erasure channel. Furthermore, we compute ensemble-average pseudoweight enumerators of 3D-TCs and perform a finite-length minimum pseudoweight analysis for small cover degrees. Moreover, an explicit description of the fundamental cone of the 3D-TC polytope is given. Finally, we present an extensive numerical study of small-to-medium block length 3D-TCs, which shows that 1) typically (i.e., in most cases), when the minimum distance $d_{min}$ and/or the stopping distance $h_{min}$ is high, the minimum pseudoweight (on the additive white Gaussian noise channel) is strictly smaller than both $d_{min}$ and $h_{min}$ and that 2) the minimum pseudoweight grows with the block length, at least for small-to-medium block lengths.]]>62721702182791<![CDATA[Hybrid Interweave-Underlay Spectrum Access for Cognitive Cooperative Radio Networks]]>$m$ fading with integer values of fading severity parameter $m$. Numerical results are provided showing the effect of network parameters on the secondary network performance, such as the primary arrival rate, the distances from the secondary transmitters to the primary receiver, the interference power threshold of the primary receiver in underlay mode, and the average transmit signal-to-noise ratio of the secondary network in interweave mode. To show the performance improvement of the CCRN, comparisons for outage probability, SER, and capacity between the conventional underlay scheme and the hybrid scheme are presented. The numerical results show that the hybrid approach outperforms the conventional underlay spectrum access.]]>62721832197897<![CDATA[Performance Analysis of Adaptive Modulation in Cognitive Relay Network With Cooperative Spectrum Sensing]]>$L$-ary quadrature amplitude modulation ( $L$-QAM) with fixed switching threshold is adopted. Simulation results verify our analysis and show that both hybrid interweave/underlay scheme and adaptive modulation can improve the SU's performance significantly.]]>627219822111317<![CDATA[Downlink Beamforming in Underlay Cognitive Cellular Networks]]>627221222231326<![CDATA[Resource Allocation in MIMO-OFDM-Based Cooperative Cognitive Radio Networks]]>627222422351304<![CDATA[Design and Analysis of Low-Complexity Multi-Antenna Relaying for OFDM-Based Relay Networks]]>627223622481295<![CDATA[Auction-Based Relay Power Allocation: Pareto Optimality, Fairness, and Convergence]]>62722492259907<![CDATA[MSE and Outage Probability Based Training Power Allocations for Relay Networks]]>627226022701345<![CDATA[I/Q Imbalance in Two-Way AF Relaying]]>$m$ fading channels, and exact closed-form expressions and bounds are derived. Our theoretical analysis indicates that, without IQI compensation, IQI can create fundamental performance limits on two-way relaying. However, these limits can be avoided by performing IQI compensation at source nodes. Compared with the equal power allocation scheme, our numerical results show that the two proposed power allocation schemes can significantly improve the outage performance, thus reducing the IQI effects, particularly when the total power budget is large.]]>62722712285874<![CDATA[A New Beamforming Design for MIMO AF Relaying Systems With Direct Link]]>627228622951465<![CDATA[On the Achievable Diversity of Repetition-Based and Relay Selection Network-Coded Cooperation]]>627229623131256<![CDATA[Ergodic Capacity Comparison of Different Relay Precoding Schemes in Dual-Hop AF Systems With Co-Channel Interference]]>$N$ scenario, where $N$ is the number of relay antennas. Our results reveal that, in the large $N$ regime, both the ZF/MRT and MMSE/MRT schemes have perfect interference cancelation capability, which is not possible with the MRC/MRT scheme.]]>627231423281304<![CDATA[Filter-And-Forward Relay Design for MIMO-OFDM Systems]]>627232923391165<![CDATA[Diversity–Multiplexing Tradeoff of Asynchronous Decode-and-Forward Cooperative Networks]]>asynchronous cooperative network is examined for orthogonal and nonorthogonal selection decode-and-forward relaying protocols. The transmitter nodes send pulse amplitude modulation signals, in which information symbols are linearly modulated by a shaping waveform to be sent to the destination. We consider two different cases of band-limited and time-limited shaping waveforms. In each case, the DMT performance of the asynchronous and synchronous networks is compared. It is proved that in the band-limited system scenario, the asynchronism does not incur any performance loss, and the same DMT as that of the corresponding synchronous network is obtained for both protocols. In the time-limited-system scenario, the bandwidth is expanded for high values of signal-to-noise ratio. In this scenario, it is observed that only asynchronous signaling is able to exploit the extra degrees of freedom of the channel. The asynchronous network in this scenario provides better DMT performances for both protocols throughout the range of the multiplexing gain.]]>62723402352511<![CDATA[Energy-Efficient Uplink Resource Allocation in LTE Networks With M2M/H2H Co-Existence Under Statistical QoS Guarantees]]>effective capacity-based bits-per-joule capacity under statistical QoS provisioning. The specific constraints of single carrier frequency division multiple access (uplink air interface in LTE networks) pertaining to power and resource block allocation not only complicate the resource allocation problem, but also render the standard Lagrangian duality techniques inapplicable. We overcome the analytical and computational intractability by first transforming the original problem into a mixed integer programming (MIP) problem and then formulating its dual problem using the canonical duality theory. The proposed energy-efficient design is compared with the spectral efficient design along with round robin (RR) and best channel quality indicator (BCQI) algorithms. Numerical results, which are obtained using the invasive weed optimization (IWO) algorithm, show that the proposed energy-efficient uplink design not only outperforms other algorithms in terms of energy efficiency while satisfying the QoS requirements, but also performs closer to the optimal design.]]>627235323651329<![CDATA[Resource Allocation in Spectrum-Sharing OFDMA Femtocells With Heterogeneous Services]]>627236623771708<![CDATA[An Extension of Clarke's Model With Stochastic Amplitude Flip Processes]]>62723782389925<![CDATA[Characterizing the Spectral Properties and Time Variation of the In-Vehicle Wireless Communication Channel]]>627239023991650<![CDATA[A Semiblind Two-Way Training Method for Discriminatory Channel Estimation in MIMO Systems]]>627240024101248<![CDATA[Robust Distributed Beamforming With Interference Coordination in Downlink Cellular Networks]]>62724112421930<![CDATA[Coded Sampling Bound—How Much Training is Needed for Iterative Semi-Blind Channel Estimation?]]>627242224311112<![CDATA[End-to-End Propagation Noise and Memory Analysis for Molecular Communication over Microfluidic Channels]]>62724322443604<![CDATA[Spectrally Efficient Multicarrier Transmission With Message-Driven Subcarrier Selection]]>62724442455956<![CDATA[Realization of Root Raised Cosine Roll-Off Filters Using a Recursive FIR Filter Structure]]>62724562464410<![CDATA[Understanding the Benefits of Successive Interference Cancellation in Multi-Rate Multi-Hop Wireless Networks]]>62724652477716<![CDATA[Stability and Delay Analysis of EPON Registration Protocol]]>627247824931105<![CDATA[Performance Model of Multichannel Deflection-Routed All-Optical Networks With Packet Injection Control]]>627249425061287<![CDATA[Mode-Multiplexed Multi-Tb/s Superchannel Transmission With Advanced Multidimensional Signaling in the Presence of Fiber Nonlinearities]]>627250725141756<![CDATA[Confidential Broadcasting via Linear Precoding in Non-Homogeneous MIMO Multiuser Networks]]>$N_{t}$ antennas securely broadcasts messages to $K$ users with $N_{r}$ antennas each. We focus on the practical non-homogeneous scenario where the distances between the BS and the users are not equal. We first design a linear precoder based on regularized channel inversion, and derive new channel-independent expressions for the achievable secrecy sum-rate in the large system regime. With the aid of these expressions, we examine the impact of user dispersion, $N_{t}$, and $K$ on the secrecy sum-rate. We then propose a power reduction strategy and power allocation algorithms to increase the secrecy sum-rate. We demonstrate that our power reduction strategy increases the secrecy sum-rate at high signal-to-noise ratios. We also show the secrecy sum-rate advantage of optimal power allocation over equal power allocation. Furthermore, we consider channel correlation and derive an easy-to-compute expression for the secrecy sum-rate to examine its impact on the secrecy performance.]]>62725152530824<![CDATA[Orthogonal Multiple Access With Correlated Sources: Achievable Region and Pragmatic Schemes]]>627253125431825<![CDATA[Sending a Laplacian Source Using Hybrid Digital–Analog Codes]]>627254425572003<![CDATA[On the Use of Zadeh's Series Expansion for Modeling and Estimation of Indoor Powerline Channels]]>627255825681088<![CDATA[Throughput Analysis of ARQ Schemes in Gaussian Block Fading Channels]]>627256925882037<![CDATA[Overcoming Large-Scale Fading in Cellular Systems With Network Coordination]]>627258926011131<![CDATA[IEEE Member digital library]]>627260226021637<![CDATA[2014 IEEE membership application]]>627260326041556<![CDATA[IEEE Communications Society Information]]>627C3C3123