Search

In this paper, we consider the channel assignment problem for cognitive radio networks with hardware-constrained secondary users (SUs). In particular, we assume that SUs exploit spectrum holes on a set of channels where each SU can use at most one available channel for communication. We present the optimal brute-force search algorithm to solve the corresponding nonlinear integer optimization problem and analyze its complexity. Because the optimal solution has exponential complexity with the numbers of channels and SUs, we develop two low-complexity channel assignment algorithms that can efficiently utilize the spectrum holes. In the first algorithm, SUs are assigned distinct sets of channels. We show that this algorithm achieves the maximum throughput limit if the number of channels is sufficiently large. In addition, we propose an overlapping channel assignment algorithm that can improve the throughput performance compared with its nonoverlapping channel assignment counterpart. Moreover, we design a distributed medium access control (MAC) protocol for access contention resolution and integrate it into the overlapping channel assignment algorithm. We then analyze the saturation throughput and the complexity of the proposed channel assignment algorithms. We also present several potential extensions, including the development of greedy channel assignment algorithms under the max-min fairness criterion and throughput analysis, considering sensing errors. Finally, numerical results are presented to validate the developed theoretical results and illustrate the performance gains due to the proposed channel assignment algorithms.

In this paper, we investigate the joint optimal sensing and distributed Medium Access Control (MAC) protocol design problem for cognitive radio (CR) networks. We consider both scenarios with single and multiple channels. For each scenario, we design a synchronized MAC protocol for dynamic spectrum sharing among multiple secondary users (SUs), which incorporates spectrum sensing for protecting active primary users (PUs). We perform saturation throughput analysis for the corresponding proposed MAC protocols that explicitly capture the spectrum-sensing performance. Then, we find their optimal configuration by formulating throughput maximization problems subject to detection probability constraints for PUs. In particular, the optimal solution of the optimization problem returns the required sensing time for PUs' protection and optimal contention window to maximize the total throughput of the secondary network. Finally, numerical results are presented to illustrate developed theoretical findings in this paper and significant performance gains of the optimal sensing and protocol configuration.

This paper proposes novel pilot optimization and channel estimation algorithm for the downlink multiuser massive multiple input multiple output (MIMO) system with $K$ decentralized single antenna mobile stations (MSs), and time division duplex (TDD) channel estimation which is performed by utilizing $N$ pilot symbols. The proposed algorithm is explained as follows. First, we formulate the channel estimation problem as a weighted sum mean square error (WSMSE) minimization problem containing pilot symbols and introduced variables. Second, for fixed pilot symbols, the introduced variables are optimized using minimum mean square error (MMSE) and generalized Rayleigh quotient methods. Finally, for $N=1$ and $N=K$ settings, the pilot symbols of all MSs are optimized using semi definite programming (SDP) convex optimization approach, and for the other settings of $N$ and $K$, the pilot symbols of all MSs are optimized by applying simple iterative algorithm. When $N=K$, it is shown that the latter iterative algorithm gives the optimal pilot symbols achieved by the SDP method. Simulation results confirm that the proposed algorithm achieves less WSMSE compared to that of the conventional semi-orthogonal pilot symbol and MMSE channel estimation algorithm which creates pilot contamination., Comment: Accepted in CISS 2014 Conference

We investigate the geometric picture of the level surfaces of quantum entanglement and geometric measure of quantum discord (GMQD) of a class of X-states, respectively. This pictorial approach provides us a direct understanding of the structure of entanglement and GMQD. The dynamic evolution of GMQD under two typical kinds of quantum decoherence channels is also investigated. It is shown that there exists a class of initial states for which the GMQD is not destroyed by decoherence in a finite time interval. Furthermore, we establish a factorization law between the initial and final GMQD, which allows us to infer the evolution of entanglement under the influences of the environment., Comment: 10 pages, 4 figures, comments are welcome

Based on the rapid experimental developments of circuit QED, we propose a feasible scheme to simulate a spin-boson model with the superconducting circuits, which can be used to detect quantum Kosterlitz-Thouless (KT) phase transition. We design the spin-boson model by using a superconducting phase qubit coupled with a semi-infinite transmission line, which is regarded as bosonic reservoir with a continuum spectrum. By tuning the bias current or the coupling capacitance, the quantum KT transition can be directly detected through tomography measurement on the states of the phase qubit. We also estimate the experimental parameters using numerical renormalization group method., Comment: 4 pages

The interaction between a superconducting phase qubit and the two-level systems locating inside the Josephson tunnel barrier is shown to be described by the XY model, which is naturally used to implement the iSWAP gate. With this gate, we propose a scheme to efficiently generate genuine multi-qubit entangled states of such two-level systems, including multipartite W state and cluster states. In particularly, we show that, with the help of the phase qubit, the entanglement witness can be used to efficiently detect the produced genuine multi-qubit entangled states. Furthermore, we analyze that the proposed approach for generating multi-qubit entangled states can be used in a wide class of candidates for quantum computation., Comment: 6 pages