Transmit antenna selection of correlated MIMO multiuser cognitive radio networks in Nakagami‐m fading channels

In this paper, we examine the impact of antenna correlation on transmit antenna selection with receive maximal ratio combining (TAS/MRC) in multiple‐input multiple‐output multiuser underlay cognitive radio network (MIMO‐MCN) over a Nakagami‐m fading environment. The secondary network under consideration consists of a single source and M destinations equipped with multiple correlated antennas at each node. The primary network composed of L primary users, each of which is equipped with multiple correlated antennas. For the considered underlay spectrum sharing paradigm, the transmission power of the proposed secondary system is limited by the peak interference limit on the primary network and the maximum transmission power at the secondary network. In particular, we derive exact closed‐form expressions for the outage probability and average symbol error rate of the proposed secondary system. To gain further insights, simple asymptotic closed‐form expressions for the outage probability and symbol error rate are provided to obtain the achievable diversity order and coding gain of the system. In addition, the impact of antenna correlation on the secondary user ergodic capacity has been investigated by deriving closed‐form expressions for the secondary user capacity. The derived analytical formulas herein are supported by numerical and simulation results to clarify the main contributions. Copyright © 2016 John Wiley & Sons, Ltd.     

Performance evaluation of OFDM and single‐carrier systems using frequency domain equalization and phase modulation

In this paper, we study the performance of the continuous phase modulation (CPM)‐based orthogonal frequency division multiplexing (CPM‐OFDM) system. Also, we propose a CPM‐based single‐carrier frequency domain equalization (CPM‐SC‐FDE) structure for broadband wireless communication systems. The proposed structure combines the advantages of the low complexity of SC‐FDE, in addition to exploiting the channel frequency diversity and the power efficiency of CPM. Both the CPM‐OFDM system and the proposed system are implemented with FDE to avoid the complexity of the equalization. Two types of frequency domain equalizers are considered and compared for performance evaluation of both systems; the zero forcing (ZF) equalizer and the minimum mean square error (MMSE) equalizer. Simulation experiments are performed for a variety of multipath fading channels. Simulation results show that the performance of the CPM‐based systems with multipath fading is better than their performance with single path fading. The performance over a multipath channel is at least 5 and 12 dB better than the performance over a single path channel, for the CPM‐OFDM system and the proposed CPM‐SC‐FDE system, respectively. The results also show that, when CPM is utilized in SC‐FDE systems, they can outperform CPM‐OFDM systems by about 5 dB. Copyright © 2010 John Wiley & Sons, Ltd.     

1.2 nm capacitance equivalent thickness gate stacks on Si-passivated GaAs

Experiments to increase the specific capacitance of MOS capacitors consisting of HfO₂ on a passivating interfacial layer (IL) of amorphous Si (a-Si) on GaAs are described. XPS analysis of the layers and electrical measurements on the capacitors are combined to study the evolution of the gate stack during deposition and subsequent heat treatments. It is shown that oxidation of the a-Si IL is a major factor in preventing the attainment of a scaled capacitance equivalent thickness (CET). By controlling the deposition of the layers, the gate metal and the heat treatments, a highly scaled gate stack with a CET of 1.2 nm and a leakage reduction of more than 4 orders of magnitude with respect to SiO₂/Si was realized.     

Channel estimation based on learning automata for OFDM systems

The abundant benefits of Orthogonal Frequency‐Division Multiplexing and its high flexibility have resulted in its widespread applications in many telecommunication standards. One important parameter for improving wireless system's efficiency is the accurate estimation of channel state information. In the literatures, many techniques have been studied in order to estimate the channel state information. Nowadays, the techniques based on intelligent algorithms such as genetic algorithm and particle swarm optimization (PSO) have attracted attention of researchers. With a very low pilot overhead, these techniques are able to estimate the channel frequency response properly only using the received signals. Unfortunately, each of these techniques suffers a common weakness: they have a slow convergence rate. In this paper, a new intelligent and different method has been presented for channel estimation using learning automata, entitled LA estimator, where the learning automata are search agents, and each pair is responsible for searching 1 complex coefficient of the channel frequency response. This method can achieve an accurate channel estimation with a moderate computational complexity in comparison with GA and PSO estimators. Furthermore, with higher convergence rate, our proposed method is capable of providing the same performance as GA and PSO. For a 2‐path fast fading channel, simulation results demonstrate the robustness of our proposed scheme according to the bit error rate and the mean square error.     

Capacity and Channel Coding for Wireless Point-to-Point <Emphasis Type="Italic">Z</Emphasis><Superscript>2</Superscript> Channel

In this paper, we derive the capacity of the asymmetric \({\text{Z}}^{2}\)-channel, which has been presented for the first time as an optimization problem. Similar to the Z-Channel, the proposed \({\text{Z}}^{2}\)-channel can be modelled as a practical interference wireless channel. In addition, the capacity behavior of \({\text{Z}}^{2}\)-channel is discussed and some examples and simulation results for the capacity is presented. Also a code plan has been applied for \({\text{Z}}^{2}\)-channel, based on repetition code to simulate its performance and compare it with the original Z-channel. In conclusion, simulation results show that the \({\text{Z}}^{2}\)-channel can be used widely for different operating points.     

Interference Mitigation Based on Radio Aware Channel Assignment for Wireless Mesh Networks

An intricate network deployment for high demand users leads to simultaneous transmission in wireless mesh networks. Multiple radios are adapted to individual nodes for improving network performance and Quality of Service (QoS). However, whenever multiple radios are assigned to the same channel, co-located radio interference occurs, which poses a major drawback. This paper proposes a Radio aware Channel Assignment (Ra-CA) mechanism based on a direct graphical model for mitigation of interference in multi-radio multi-channel networks. Initially, the co-located radio interference is identified by classifying non-interfering links for simultaneous transmission in the network. Proposed channel assignment mechanism helps in allocating the minimal number of channels to the network that mitigate co-located radio interference. Performance analysis of the proposed Ra-CA strategy is carried out compared with other existing techniques, like Breadth First Search-Channel Assignment (BFS-CA) and Maximal Independent Set Channel Assignment (MaIS-CA), in multi-radio networks. Simulation results demonstrate that the proposed channel assignment scheme is more efficient compared to the existing ones, in terms of QoS parameters like, packet drop rate, packet delivery ratio, transmission delay and throughput.     

Bounds on capacity and minimum energy-per-bit for AWGN relay channels

Upper and lower bounds on the capacity and minimum energy-per-bit for general additive white Gaussian noise (AWGN) and frequency-division AWGN (FD-AWGN) relay channel models are established. First, the max-flow min-cut bound and the generalized block-Markov coding scheme are used to derive upper and lower bounds on capacity. These bounds are never tight for the general AWGN model and are tight only under certain conditions for the FD-AWGN model. Two coding schemes that do not require the relay to decode any part of the message are then investigated. First, it is shown that the "side-information coding scheme" can outperform the block-Markov coding scheme. It is also shown that the achievable rate of the side-information coding scheme can be improved via time sharing. In the second scheme, the relaying functions are restricted to be linear. The problem is reduced to a "single-letter" nonconvex optimization problem for the FD-AWGN model. The paper also establishes a relationship between the minimum energy-per-bit and capacity of the AWGN relay channel. This relationship together with the lower and upper bounds on capacity are used to establish corresponding lower and upper bounds on the minimum energy-per-bit that do not differ by more than a factor of 1.45 for the FD-AWGN relay channel model and 1.7 for the general AWGN model.     

Noncoherent space-time coding: An algebraic perspective

The design of space-time signals for noncoherent block-fading channels where the channel state information is not known a priori at the transmitter and the receiver is considered. In particular, a new algebraic formulation for the diversity advantage design criterion is developed. The new criterion encompasses, as a special case, the well-known diversity advantage for unitary space-time signals and, more importantly, applies to arbitrary signaling schemes and arbitrary channel distributions. This criterion is used to establish the optimal diversity-versus-rate tradeoff for training based schemes in block-fading channels. Our results are then specialized to the class of affine space-time signals which allows for a low complexity decoder. Within this class, space-time constellations based on the threaded algebraic space-time (TAST) architecture are considered. These constellations achieve the optimal diversity-versus-rate tradeoff over noncoherent block-fading channels and outperform previously proposed codes in the considered scenarios as demonstrated by the numerical results. Using the analytical and numerical results developed in this paper, nonunitary space-time codes are argued to offer certain advantages in block-fading channels where the appropriate use of coherent space-time codes is shown to offer a very efficient solution to the noncoherent space-time communication paradigm.     

On the Optimality of the ARQ-DDF Protocol

In this correspondence, the performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple access relay channel where a single relay is dedicated to simultaneously help two multiple access users. For this setup, it is shown that the ARQ-DDF protocol achieves the channel's optimal diversity multiplexing tradeoff (DMT). The second scenario is the cooperative vector multiple access channel where two users cooperate in delivering their messages to a destination equipped with two receiving antennas. For this setup, a new variant of the ARQ-DDF protocol is developed where the two users are purposefully instructed not to cooperate in the first round of transmission. Lower and upper bounds on the achievable DMT are then derived. These bounds are shown to converge to the optimal tradeoff as the number of transmission rounds increases.