<![CDATA[ IEEE Transactions on Communications - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 26 2016September26<![CDATA[Table of contents]]>649C1C4331<![CDATA[IEEE Communications Society]]>649C2C291<![CDATA[A Soft Input Decoding Algorithm for Generalized Concatenated Codes]]>649358535951360<![CDATA[Error Errore Eicitur: A Stochastic Resonance Paradigm for Reliable Storage of Information on Unreliable Media]]>649359636081866<![CDATA[Hierarchical Polar Coding for Achieving Secrecy Over State-Dependent Wiretap Channels Without Any Instantaneous CSI]]>649360936231802<![CDATA[The Three/Two Gaussian Parametric LDLC Lattice Decoding Algorithm and Its Analysis]]> and , the two-Gaussian approximation is the same as the full-complexity decoder. But when the dimension is , a three-Gaussian approximation is needed.]]>649362436331188<![CDATA[Block Markov Superposition Transmission of RUN Codes]]>649363436432486<![CDATA[Low Complex, Narrowband-Interference Robust Synchronization for NC-OFDM Cognitive Radio]]>649364436541690<![CDATA[Optimal Energy-Efficient Joint Resource Allocation for Multi-Hop MIMO-AF Systems]]>649365536681615<![CDATA[On the Capacity Region of Asymmetric Gaussian Two-Way Line Channel]]> , where nodes 1 and 4 with the help of two full-duplex relays, i.e., nodes 2 and 3, exchange their messages with each other. Using lattice codes, we design a novel scheme that allows the relay nodes to send the data in both directions simultaneously under an asymmetric rate region. In the proposed scheme, each relay decodes the sum of lattice points and then re-encodes it into another lattice codeword (which satisfies the transmit power constraint at the relay). It is shown that the proposed scheme achieves the capacity region of asymmetric two-way line network within 0.5 bit independent of the number of relays.]]>649366936821016<![CDATA[Delay-Limited and Ergodic Capacities of MIMO Channels With Limited Feedback]]> at the transmitter. A relevant performance limit is the delay-limited capacity, which is the largest data rate at which the outage probability is zero. It is well known that if both the transmitter and the receiver have full channel state information (CSI) and if either of them has multiple antennas, the delay-limited capacity is non-zero and grows logarithmically with . Achieving even a positive delay-limited capacity, however, becomes a difficult task when the CSI at the transmitter (CSIT) is imperfect. In this context, the standard partial CSIT model where the transmitter has a fixed finite bit of quantized CSI feedback for each channel state results in zero delay-limited capacity. We show that by using a variable-length feedback scheme that utilizes a different number of feedback bits for different channel states, a non-zero delay-limited capacity can be achieved if the feedback rate is greater than 1 bit per channel state. Moreover, we show that the delay-limited capacity loss due to finite-rate feedback decays at least inverse linearly with respect to the feedback rate. We also discuss the applications to ergodic MIMO channels.]]>64936833696874<![CDATA[Large-Scale MIMO Detection Using MCMC Approach With Blockwise Sampling]]>649369737071972<![CDATA[Modeling and Analysis of SiNW FET-Based Molecular Communication Receiver]]>649370837212941<![CDATA[Energy-Efficient Resource Allocation for Downlink Non-Orthogonal Multiple Access Network]]>649372237321172<![CDATA[Joint Allocation of Spectral and Power Resources for Non-Cooperative Wireless Localization Networks]]>649373337451234<![CDATA[Delay-Aware Scheduling and Resource Optimization With Network Function Virtualization]]>649374637581438<![CDATA[On the Two-User Multi-Carrier Joint Channel Selection and Power Control Game]]>649375937701433<![CDATA[On Monotonicity of the Optimal Transmission Policy in Cross-Layer Adaptive <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula>-QAM Modulation]]> -quadrature amplitude modulation in order to minimize the long-term losses incurred by the queue overflow in the data link layer and the transmission power consumption in the physical layer. The work is done in two steps. First, we observe the -convexity and submodularity of DP to prove that the optimal policy is always nondecreasing in queue occupancy/state and derive the sufficient condition for it to be nondecreasing in both queue and channel states. We also show that, due to the -convexity of DP, the variation of the optimal policy in queue state is restricted by a bounded marginal effect. The increment of the optimal policy between adjacent queue states is no greater than one. Second, we use the monotonicity results to present two low complexity algorithms: monotonic policy iteration (MPI) based on -convexity and discrete simultaneous perturbation stochastic approximation (DSPSA). We run experiments to show that the time complexity of MPI based on -convexity is much lower than that of DP and the conventional MPI that is based on submodularity and DSPSA is able to adaptively track the optimal policy when the system parameters change.]]>649377137851843<![CDATA[Performance Analysis of Diffusion-Based Molecular Communications With Memory]]> -ary molecular communications with memory are presented. By taking into account any level of channel memory, the type-based and concentration-based modulation schemes are introduced and analyzed. In the type-based modulation, information symbols are encoded through different molecule types. In the concentration-based modulation, various concentration levels of one molecule type are used to encode information symbols. For both modulation schemes, the delay distributions of the molecular symbols are derived, and then, the symbol error probabilities are developed. The given distributions and the error probability expressions are validated through extensive simulation experiments. After showing that the derived expressions are valid, the performance of the modulation schemes is evaluated. The performance evaluations reveal that by properly selecting the parameters such as slot time and number of emitted molecules, the performance can be improved in both type and concentration-based molecular communication as the channel memory is increased. Furthermore, it is shown that the type-based molecular communication outperforms the concentration-based molecular communication.]]>649378637931158<![CDATA[Adaptive Multi-Homing Resource Allocation for Time-Varying Heterogeneous Wireless Networks Without Timescale Separation]]> and the increase of network utility is at the speed of with the control parameter . Simulation results validate the theoretical analysis of our proposed scheme.]]>649379438071408<![CDATA[Diphase: Characterizing Packet Delay in Multi-Source Energy Harvesting Systems]]>Diphase, a two phase queueing formulation, which decouples the wait stages for the energy arrival process and the service process, to derive closed-form expressions for the average packet delay and the probability of data packet loss due to buffer overflow. These expressions are shown to be exact when the service time is negligible, and robust for a relatively wide range of values of the average service time. We show that these expressions are useful in selecting system design parameters, which maximize the throughput while meeting the required quality of service constraints.]]>649380838191751<![CDATA[Bandlimited Optical Intensity Modulation Under Average and Peak Power Constraints]]> -ary pulse amplitude modulation (PAM) using previously established techniques for spectral efficiencies greater than 2.5 and 3.5 bits/s/Hz, respectively. For high spectral efficiency, e.g., greater than 6 bits/s/Hz, the proposed scheme attains a more than 2-dB average and peak optical power gain over 16-PAM using the previous approaches.]]>649382038301134<![CDATA[On Secrecy Performance of MISO SWIPT Systems With TAS and Imperfect CSI]]>$N$ ($N > 1$ ) single-antenna energy-harvesting receivers (ERs) is considered. Assuming that the information signal to the desired IR may be eavesdropped by ERs if ERs are malicious, we investigate the secrecy performance of the target MISO SWIPT system when imperfect channel state information (CSI) is available and adopted for transmit antenna selection at the BS. Considering that each eavesdropping link experiences independent but not necessarily identically distributed Rayleigh fading, the closed-form expressions for the exact and the asymptotic secrecy outage probability, and the average secrecy capacity are derived and verified by simulations. Furthermore, the optimal power splitting factor is derived for each ER to realize the tradeoff between the energy harvesting and the information eavesdropping. Our results reveal the impact of the imperfect CSI on the secrecy performance of MISO SWIPT systems in the presence of multiple wiretap channels.]]>649383138432002<![CDATA[BER-Based Physical Layer Security With Finite Codelength: Combining Strong Converse and Error Amplification]]>649384438571260<![CDATA[Secrecy Performance of Wirelessly Powered Wiretap Channels]]>649385838711593<![CDATA[MIMO Wiretap Channel Under Receiver-Side Power Constraints With Applications to Wireless Power Transfer and Cognitive Radio]]>double-sided correlation matrix constraint on the channel input. We show the converse by extending the channel enhancement technique to our case. We present two achievable schemes that achieve the secrecy capacity: the first achievable scheme uses a Gaussian codebook with a fixed mean, and the second achievable scheme uses artificial noise (or cooperative jamming) together with a Gaussian codebook. The role of the mean or the artificial noise is to enable energy transfer without sacrificing from the secure rate. This is the first instance of a channel model where either the use of a mean signal or the use of channel prefixing via artificial noise is strictly necessary for the MIMO wiretap channel. We then extend our work to consider a maximum receiver-side power constraint instead of a minimum receiver-side power constraint. This problem is motivated by cognitive radio applications, where an added goal is to decrease the received signal energy (interference temperature) at a receiver. We further extend our results to: requiring receiver-side power constraints at both receivers; considering secrecy constraints at both receivers to study broadcast channels with confidential messages; and removing the secrecy constraints to study the classical broadcast -
hannel.]]>64938723885689<![CDATA[Accurate Range-Free Localization in Multi-Hop Wireless Sensor Networks]]>649388639002960<![CDATA[Spatially Concatenated Channel-Network Code for Underwater Wireless Sensor Networks]]>649390139142960<![CDATA[In-Band Full Duplex Broadband Power Line Communications]]>649391539312744<![CDATA[Distributed Detection of Dynamic Event Regions in Sensor Networks With a Gibbs Field Distribution and Gaussian Corrupted Measurements]]>649393239452552<![CDATA[Orthogonal Chirp Division Multiplexing]]>649394639572852<![CDATA[Location-Oriented Evolutionary Games for Price-Elastic Spectrum Sharing]]>649395839691281<![CDATA[Reconfigurable Antenna-Based Space-Shift Keying for Spectrum Sharing Systems Under Rician Fading]]>649397039801425<![CDATA[On the Feasibility of Sharing Spectrum Licenses in mmWave Cellular Systems]]>649398139951971<![CDATA[An Autonomous Learning-Based Algorithm for Joint Channel and Power Level Selection by D2D Pairs in Heterogeneous Cellular Networks]]>649399640122896<![CDATA[Optimal Multiband Transmission Under Hostile Jamming]]>649401340272205<![CDATA[Introducing IEEE Collabratec]]>649402840282160<![CDATA[IEEE Communications Society]]>649C3C394