Some statistical characteristics, including the means and the cross-correlations, of frequency-selective Rician fading channels seen by orthogonal frequency division multiplexing (OFDM) subcarriers are derived in this paper. Based on a pairwise error probability analysis, the mean vector and the cross-correlation matrix are used to obtain an upper bound of the overall bit-error rate (BER) in a closed-form for coded OFDM signals with and without inter-carrier interference. In this paper, the overall BER is defined as the average BER of OFDM signals of all subcarriers obtained by considering their cross-correlations. Numerical examples are presented to compare the proposed upper bound of the overall BERs and the overall BERs obtained by simulations.

Cognitive radio (CR) is considered as the most promising solution to the so-called spectrum scarcity problem, in which channel sensing is an important problem. In this paper, the problem of determining the period of medium access control (MAC)-layer channel sensing in cognitive radio networks (CRNs) is studied. In our study, the channel state is statistically modeled as a continuous-time alternating renewal process (ARP) alternating between the OFF and ON states for the primary user (PU)'s communication activity. Based on the statistical ARP model, we analyze the CRNs with different SU MAC protocols, taking into consideration the effects of practical issues of imperfect channel sensing and non-negligible channel sensing time. Based on the analysis results, a constrained optimization problem to find the optimal sensing period is formulated and the feasibility of this problem is studied for systems with different OFF/ON channel state length distributions. Numerical results are presented to show the performance of the proposed sensing period optimization scheme. The effects of practical system parameters, including channel sensing errors and channel sensing time, on the performance and the computational complexity of the proposed sensing period optimization scheme are also investigated.

A recursive quadratic programming (RQP) approach is proposed for multiuser detection in multicarrier code-division multiple-access (MC-CDMA) systems. In this approach, the combinatorial problem associated with the optimal maximum likelihood (ML) detection is relaxed to a quadratic programming (QP) problem first and then a recursive approach is developed to improve the detection performance. Computer simulations are presented which demonstrate that the detector developed based on the proposed approach offers close-to-optimal symbol-error rate (SER) performance which outperforms several existing suboptimal detectors.

In this paper, Integration of Fractional Gaussian Window transform (IFRGWT) is proposed for the parameter estimation of linear FM (LFM) signal; the proposal is based on the integration of the Fractional Fourier transform modified by Gaussian Window. The peak values can be detected by adjusting the standard deviation of Gaussian function and locating the optimal rotated angles. And also the parameters of the signal can be estimated well. As an application, detection and parameter estimation of multiple LFM signals are investigated in low signal-to-noise ratios (SNRs). The analytic results and simulations clearly demonstrate that the method is effective.

In this paper, a joint optimal design is investigated for orthogonal frequency division multiplexing (OFDM) systems to reduce peak interference-to-carrier ratio (PICR), out-of-band power (OBP) emissions, and peak-to-average power ratio (PAPR). Two approaches, namely, the phase rotation approach and the constellation extension approach, are proposed to convert this joint design problem into a second order cone programming (SOCP) problem, whose global optimal solution has been shown to exist and can be obtained efficiently. Simulation results are presented to demonstrate efficacy of the proposed algorithms in joint PICR, OBP, and PAPR reduction.

In this paper, we investigate the fault-tolerant Hamiltonian problems of crossed cubes with a faulty path. More precisely, let P denote any path in an n-dimensional crossed cube CQn for n ≥ 5, and let V(P) be the vertex set of P. We show that CQn-V(P) is Hamiltonian if |V(P)|≤n and is Hamiltonian connected if |V(P)| ≤ n-1. Compared with the previous results showing that the crossed cube is (n-2)-fault-tolerant Hamiltonian and (n-3)-fault-tolerant Hamiltonian connected for arbitrary faults, the contribution of this paper indicates that the crossed cube can tolerate more faulty vertices if these vertices happen to form some specific types of structures.