In this letter, a novel method is proposed for carrier-frequency offset (CFO) estimation for multiple users in orthogonal frequency division multiple access (OFDMA) uplink with the generalized carrier assignment scheme (GCAS). The base station (BS) is equipped with multiple antennas, and each user's CFO can be estimated by the ESPRIT-like method that utilizes the rotation invariance of the space-domain snapshot matrix. The method is still effective even in fully loaded system with all subcarriers allocated to users. Simulation results illustrate the high performance of the proposed algorithm.

In orthogonal frequency division multiple access (OFD-MA) uplink, the distortions introduced by both multiple carrier frequency offsets (CFOs) and in-phase and quadrature-phase (IQ) imbalances will severely degrade the system performance. With both CFOs and IQ imbalances, signal detection at the receiver becomes hard, if not impossible. In this letter, a linear receiver is proposed to cope with the distortions at a slight drop in system transmission rate. The analysis and simulations demonstrate the effectiveness of the proposed approach.

A novel distributed ranging method for wireless sensor networks (WSN) is proposed in this letter. Linear frequency modulation (LFM) waves are emitted from the two antenna elements equipped at the anchor node simultaneously to create an interference field. Through the frequency measurement of local RSSI (Received Signal Strength Indication) signal, the horizontal distance from the anchor node can be estimated independently at each sensor. Analysis and simulation results demonstrate the effectiveness of our proposed method.

In this letter, we propose a simple distributed space-frequency code with both timing errors and multiple carrier frequency offsets (CFO) in asynchronous cooperative communications. By employing both the Alamouti coding approach and the transmit repetition diversity technique, full diversity gain can be achieved by the fast symbol-wise maximum likelihood (ML) decoding at the destination node. Analysis and simulations demonstrate the effectiveness of the proposed method.

This paper studies the design of cooperative beamforming (CB) and cooperative jamming (CJ) for the physical layer security of an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. The secrecy rate maximization (SRM) problem of such a network is to maximize the difference of two concave functions, a problem which is non-convex and has no efficient solution. Based on the inner convex approximation (ICA) and semidefinite relaxation (SDR) techniques, we propose two novel low-complexity schemes to design CB and CJ for SRM in the AF network. In the first strategy, relay nodes adopt the CB only to secure transmission. Based on ICA, this design guarantees convergence to a Karush-Kuhn-Tucker (KKT) solution of the SDR of the original problem. In the second strategy, the optimal joint CB and CJ design is studied and the proposed joint design can guarantee convergence to a KKT solution of the original problem. Moreover, in the second strategy, we prove that SDR always has a rank-1 solution for the SRM problem. Simulation results show the superiority of the proposed schemes.

In this letter, a multiuser cooperative network with multiple relays is introduced, and two decode-and-forward (DF) cooperation schemes are proposed aiming at outage-optimal and fair user scheduling, respectively. The outage probability and asymptotic expressions of symbol error probability (SEP) are derived to evaluate these two schemes. Analysis and simulations show that both schemes can achieve full diversity order, which is the combination of cooperative diversity and multiuser diversity.