Flexible Multi-Group Single-Carrier Modulation: Optimal Subcarrier Grouping and Rate Maximization

Orthogonal frequency division multiplexing (OFDM) and single-carrier frequency domain equalization (SC-FDE) are two commonly adopted modulation schemes for frequency-selective channels. Compared to SC-FDE, OFDM generally achieves higher data rate, but at the cost of higher transmit signal peak-to-average power ratio (PAPR) that leads to lower power amplifier efficiency. This paper proposes a new modulation scheme, called flexible multi-group single-carrier (FMG-SC), which encapsulates both OFDM and SC-FDE as special cases, thus achieving more flexible rate-PAPR trade-offs between them. Specifically, a set of frequency subcarriers are flexibly divided into orthogonal groups based on their channel gains, and SC-FDE is applied over each of the groups to send different data streams in parallel. We aim to maximize the achievable sum-rate of all groups by optimizing the subcarrier-group mapping. We propose two low-complexity subcarrier grouping methods and show via simulation that they perform very close to the optimal grouping by exhaustive search. Simulation results also show the effectiveness of the proposed FMG-SC modulation scheme with optimized subcarrier grouping in improving the rate-PAPR trade-off over conventional OFDM and SC-FDE.Comment: Submitted for possible conference publicatio

Existence of codes with constant PMEPR and related design

Recently, several coding methods have been proposed to reduce the high peak-to-mean envelope ratio (PMEPR) of multicarrier signals. It has also been shown that with probability one, the PMEPR of any random codeword chosen from a symmetric quadrature amplitude modulation/phase shift keying (QAM/PSK) constellation is logn for large n, where n is the number of subcarriers. Therefore, the question is how much reduction beyond logn can one asymptotically achieve with coding, and what is the price in terms of the rate loss? In this paper, by optimally choosing the sign of each subcarrier, we prove the existence of q-ary codes of constant PMEPR for sufficiently large n and with a rate loss of at most log/sub q/2. We also obtain a Varsharmov-Gilbert-type upper bound on the rate of a code, given its minimum Hamming distance with constant PMEPR, for large n. Since ours is an existence result, we also study the problem of designing signs for PMEPR reduction. Motivated by a derandomization algorithm suggested by Spencer, we propose a deterministic and efficient algorithm to design signs such that the PMEPR of the resulting codeword is less than clogn for any n, where c is a constant independent of n. For symmetric q-ary constellations, this algorithm constructs a code with rate 1-log/sub q/2 and with PMEPR of clogn with simple encoding and decoding. Simulation results for our algorithm are presented

Frequency-Selective PAPR Reduction for OFDM

We study the peak-to-average power ratio (PAPR) problem in orthogonal frequency-division multiplexing (OFDM) systems. In conventional clipping and filtering based PAPR reduction techniques, clipping noise is allowed to spread over the whole active passband, thus degrading the transmit signal quality similarly at all active subcarriers. However, since modern radio networks support frequency-multiplexing of users and services with highly different quality-of-service expectations, clipping noise from PAPR reduction should be distributed unequally over the corresponding physical resource blocks (PRBs). To facilitate this, we present an efficient PAPR reduction technique, where clipping noise can be flexibly controlled and filtered inside the transmitter passband, allowing to control the transmitted signal quality per PRB. Numerical results are provided in 5G New Radio (NR) mobile network context, demonstrating the flexibility and efficiency of the proposed method.Comment: Accepted for publication as a Correspondence in the IEEE Transactions on Vehicular Technology in March 2019. This is the revised version of original manuscript, and it is in press at the momen

Frequency-domain transmit processing for MIMO SC-FDMA in wideband propagation channels

This document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available

Two novel nonlinear companding schemes with iterative receiver to reduce PAPR in multi-carrier modulation systems

Companding transform is an efficient and simple method to reduce the Peak-to-Average Power Ratio (PAPR) for Multi-Carrier Modulation (MCM) systems. But if the MCM signal is only simply operated by inverse companding transform at the receiver, the resultant spectrum may exhibit severe in-band and out-of-band radiation of the distortion components, and considerable peak regrowth by excessive channel noises etc. In order to prevent these problems from occurring, in this paper, two novel nonlinear companding schemes with a iterative receiver are proposed to reduce the PAPR. By transforming the amplitude or power of the original MCM signals into uniform distributed signals, the novel schemes can effectively reduce PAPR for different modulation formats and sub-carrier sizes. Despite moderate complexity increasing at the receiver, but it is especially suitable to be combined with iterative channel estimation. Computer simulation results show that the proposed schemes can offer good system performances without any bandwidth expansion