Search

This paper proposes to encode pilot bits together with information bits by using a systematic encoder and applying them to an iterative receiver, where channel estimation and decoding are iteratively performed. This paper then shows why and how the encoded pilot bits can give a positive gain over a conventional uncoded pilot system. Specifically, this paper considers an orthogonal frequency-division multiplexing system that is encoded by a low-density parity-check code under a frequency-selective fading channel and shows theoretical analysis as well as simulation results. Index Terms--Channel estimation, encoded pilot (EP), iterative receiver, low-density parity-check (LDPC), orthogonal frequency-division multiplexing (OFDM).

Recently, the smart antenna (a blind adaptive antenna array) has brought much attention to its ability to improve the future code-division multiple-access (CDMA) wireless communications systems. However, Adachi et al. [1], [2] employed only one out of M elements that are in a smart antenna array during the pseudonoise (PN) code acquisition process due to the difficulty in obtaining the weight coefficients of the smart antenna and PN code acquisition jointly and adaptively. Yet, as the PN code is acquired, all M elements are used in [1] and [2] to improve the signal-to-noise ratio (SNR) at a reverse link. In this paper, we propose an efficient PN code acquisition scheme where all elements are employed during PN code acquisition. Also, we show that by using all elements, the PN code acquisition time can be shortened by at least 40% for a given signal-to-noise ratio and M = 5, compared to the single element case. Furthermore, the power of a random access user signal in the reverse link can be lowered at least 3 dB. The additional computational load and complexity to use the proposed PN code acquisition are insignificant. Index Terms--Code.division multiple access (CDMA), pseudonoise (PN) code acquisition, smart antennas.

Due to emerging mobile applications and an Internet of Things, data traffic carried by wireless networks has increased dramatically. As a result, maximizing the utilization of the limited network resource is a top priority. To date, there exists a large body of work on the stochastic network utility maximization (NUM) problem. On the one hand, the stochastic NUM problem and its associated solutions have been mainly investigated under the light-tailed (LT) data condition. On the other hand, empirical results show that data delivered by wireless networks is not only large in volume but also highly variable, which can be characterized by heavy-tailed (HT) distributions. Such HT traffic exhibits high burstiness and strong temporal correlations, which are fundamentally different from the behavior of LT traffic. In this paper, first it is shown that the classic stochastic gradient algorithms (SGAs), as effective solutions for stochastic NUM problems, fail to prevent HT traffic flows from aggressively competing with LT flows for limited resources. This leads to unbounded queueing delay for LT flows, which results in network instability. To counter such a challenge, the time-average stochastic gradient routing algorithm is proposed, which prevents competition among HT and LT traffic flows so that utility optimality and network stability can be achieved simultaneously. Moreover, because HT data have unbounded moments, such as mean and variance, it is not feasible to apply the conventional convergence analysis, which assumes the moment boundedness of traffic arrivals. To address this problem, the ordinary differential equation method is adopted to prove that the proposed algorithm still converges even with highly variable HT traffic. Comprehensive simulation results are shown to verify the derived theoretical results. [ABSTRACT FROM AUTHOR]

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]

This paper considers a two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay network consisting of two sources (each with multiple antennas) and multiple physically dispersed single-antenna relays. A central station finds the optimum relay amplifying matrices and transmit/receive beamforming vectors explicitly and iteratively under the transmit power constraints at the sources and the relays. The minimum-mean-square-error criterion is used. Numerical results show that the proposed scheme outperforms the existing two-way AF MIMO network schemes proposed by Arti et al. and Wang et al. [ABSTRACT FROM PUBLISHER]

This paper proposes to encode pilot bits together with information bits by using a systematic encoder and applying them to an iterative receiver, where channel estimation and decoding are iteratively performed. This paper then shows why and how the encoded pilot bits can give a positive gain over a conventional uncoded pilot system. Specifically, this paper considers an orthogonal frequency-division multiplexing system that is encoded by a low-density parity-check code under a frequency-selective fading channel and shows theoretical analysis as well as simulation results. [ABSTRACT FROM AUTHOR]

Presents an analysis of the performance of smart antenna algorithms when used in code-division multiple access wireless communication system. System models used; Conditions of general simulation; Results and discussion.

Focuses on the development of a digital communication receiver. Receiver's use of the direct-sequence spread signal at a nonzero intermediate frequency; Effects of the intermediate frequency sampling on pseudonoise code synchronization; Study of bit-error rate degradation.