In this paper, we study the achievable degrees of freedom (DoF) of a multiple-input multiple-output (MIMO) multi-way relay channel with asymmetric message set that models the scenario of the two-way communication between a base station and multiple users through a relay. Under the assumption of delayed channel state information at transmitters (CSIT), we propose an amplify-and-forward relaying scheme based on the scheme proposed by Maddah-Ali and Tse to support signal space alignment, so that the available dimensions of the signal spaces at the relay and the users can be efficiently utilized. The proposed scheme outperforms the traditional one-way scheme from the perspective of DoF, and is useful to relieve the communication bottleneck caused by the asymmetric traffic load inherent in cellular networks.

In this paper, we present a new all-digital carrier recovery loop for high-order quadrature amplitude modulation (QAM) signal constellations. The proposed approach is a blind phase-frequency detector structure that consists of a phase detector, a phase offset estimator, a frequency offset estimator, and a digital control oscillator. Compared to previous related approaches, the proposed algorithm provides a wider acquisition range and a more accurate estimation of frequency and phase offsets. These features are demonstrated by simulation results of the DOCSIS (Data-Over-Cable Service Interface Specifications) cable modem system.

The technique of partial transmit sequences (PTS) is effective in reducing the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. However, the conventional PTS (CPTS) scheme has high computation complexity because it needs several inverse fast Fourier transform (IFFT) units and an optimization process to find the candidate signal with the lowest PAPR. In this paper, we propose a new low-complexity PTS scheme for OFDM systems, in which a hybrid subblock partition method (SPM) is used to reduce the complexity that results from the IFFT computations and the optimization process. Also, the PAPR reduction performance of the proposed PTS scheme is further enhanced by multiplying a selected subblock with a predefined phase rotation vector to form a new subblock. The time-domain signal of the new subblock can be obtained simply by performing a circularly-shift-left operation on the IFFT output of the selected subblock. Computer simulations show that the proposed PTS scheme achieves a PAPR reduction performance close to that of the CPTS scheme with the pseudo-random SPM, but with much lower computation complexity.

One major drawback of orthogonal frequency-division multiplexing is the high peak-to-average power ratio (PAPR) of the output signal. The selected mapping (SLM) and partial transmit sequences (PTS) methods are two promising techniques for PAPR reduction. However, to generate a set of candidate signals, these techniques need a bank of inverse fast Fourier transforms (IFFT's) and thus require high computational complexity. In this paper, we propose two low-complexity multiplication-free conversion processes to replace the IFFT's in the SLM method, where each conversion process for an N-point IFFT involves only 3N complex additions. Using these proposed conversions, we develop several new SLM schemes and a combined SLM & PTS method, in which at least half of the IFFT blocks are reduced. Computer simulation results show that, compared to the conventional methods, these new schemes have approximately the same PAPR reduction performance under the same number of candidate signals for transmission selection.