Search

Multipath fading can degrade the performance of a wireless communication system significantly when the data rate is as high as those systems beyond Long-Term Evolution Advanced (LTE-A). To combat the multipath-fading effects, orthogonal frequency-division multiplexing (OFDM) techniques have been extensively studied and used in existing systems. However, another effective method to combat multipath fading is a code-division multiple access (CDMA) scheme, which has not been extensively investigated for relay network communication systems. This paper considers uplink CDMA relay networks (consisting of multiple sources, multiple relays, and a single destination) and downlinks (consisting of a combined source, multiple relays, and multiple destinations) under multipath fading. The objective of this paper is to propose a unique, simple, and effective method of finding optimum nonbinary pseudo noise (PN) spreading and despreading sequences employing a maximum signal-to-interference-plus-noise ratio (SINR) criterion and channel state information (CSI). This paper also examines the sensitivity of the proposed schemes to 1-bit quantization, mistiming alignment, wideband jamming, and imperfect CSI. Simulation results verify that the proposed method shows much faster convergence in finding optimum PN sequences and better performance than existing schemes under the same environment. [ABSTRACT FROM AUTHOR]

In this paper, we study user selection (US) strategies for a multiple-input–multiple-output (MIMO) cognitive radio (CR) downlink network, where the r-antenna underlay CR secondary users (SUs) coexist with a primary user (PU), and all terminals are equipped with multiple antennas. Two main scenarios are considered: 1) The t-antenna cognitive base station (CBS) has perfect or partial channel state information at the transmitter (CSIT) from the CBS to the PU receiver (RX), and 2) the CBS has absolutely no PU CSIT. For these scenarios, we propose and evaluate multiple SU selection schemes that are applicable to both best-effort PU interference mitigation and hard interference temperature (IT) constraints. The computational complexity of the proposed schemes can be significantly smaller than that of an exhaustive search with negligible performance degradation. For the selection of C SUs out of K, whereas an exhaustive search is on the order of \mathcal{O}(\binom{K}{C}C^4r^3). When t$ and r$ are of the same order, the computational complexity of the proposed scheme can be \binom{K}{C}C^4/K times smaller. Mathematical complexity analysis and numerical simulations are provided to show the advantage of our schemes. [ABSTRACT FROM PUBLISHER]