1,921 research outputs found
Recommended from our members
Peak Power Reduction of OFDM Signals with Sign Adjustment
It has recently been shown that significant reduction in the peak to mean envelope power (PMEPR) can be obtained by altering the sign of each subcarrier in a multicarrier system with n subcarriers. However, finding the best sign not only requires a search over 2n possible signs but also may lead to a substantial rate loss for small size constellations. In this paper, we first propose a greedy algorithm to choose the signs based on p-norm minimization and prove that the resulting PMEPR is guaranteed to be less than c log n where c is a constant independent of n for any n. This approach has lower complexity in each iteration compared to the derandomization approach of while achieving similar PMEPR reduction. We further improve the performance of the proposed algorithm by enlarging the search space using pruning. Simulation results show that PMEPR of a multicarrier signal with 128 subcarriers can be reduced to within 1.6 dB of the PMEPR of a single carrier system. In the second part of the paper, we address the rate loss by proposing a block coding scheme in which only one sign vector is chosen for K different modulating vectors. The sign vector can be computed using the greedy algorithm in n iterations. We show that the multi-symbol encoding approach can reduce the rate loss by a factor of K while achieving the PMEPR of c logKn, i.e., only logarithmic growth in K. Simulation results show that the rate loss can be made smaller than %10 at the cost of only 1 db increase in the resulting PMEPR for a system with 128 subcarriers
Near-Instantaneously Adaptive HSDPA-Style OFDM Versus MC-CDMA Transceivers for WIFI, WIMAX, and Next-Generation Cellular Systems
Burts-by-burst (BbB) adaptive high-speed downlink packet access (HSDPA) style multicarrier systems are reviewed, identifying their most critical design aspects. These systems exhibit numerous attractive features, rendering them eminently eligible for employment in next-generation wireless systems. It is argued that BbB-adaptive or symbol-by-symbol adaptive orthogonal frequency division multiplex (OFDM) modems counteract the near instantaneous channel quality variations and hence attain an increased throughput or robustness in comparison to their fixed-mode counterparts. Although they act quite differently, various diversity techniques, such as Rake receivers and space-time block coding (STBC) are also capable of mitigating the channel quality variations in their effort to reduce the bit error ratio (BER), provided that the individual antenna elements experience independent fading. By contrast, in the presence of correlated fading imposed by shadowing or time-variant multiuser interference, the benefits of space-time coding erode and it is unrealistic to expect that a fixed-mode space-time coded system remains capable of maintaining a near-constant BER
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
Robustness maximization of parallel multichannel systems
Bit error rate (BER) minimization and SNR-gap maximization, two robustness
optimization problems, are solved, under average power and bit-rate
constraints, according to the waterfilling policy. Under peak-power constraint
the solutions differ and this paper gives bit-loading solutions of both
robustness optimization problems over independent parallel channels. The study
is based on analytical approach with generalized Lagrangian relaxation tool and
on greedy-type algorithm approach. Tight BER expressions are used for square
and rectangular quadrature amplitude modulations. Integer bit solution of
analytical continuous bit-rates is performed with a new generalized secant
method. The asymptotic convergence of both robustness optimizations is proved
for both analytical and algorithmic approaches. We also prove that, in
conventional margin maximization problem, the equivalence between SNR-gap
maximization and power minimization does not hold with peak-power limitation.
Based on a defined dissimilarity measure, bit-loading solutions are compared
over power line communication channel for multicarrier systems. Simulation
results confirm the asymptotic convergence of both allocation policies. In non
asymptotic regime the allocation policies can be interchanged depending on the
robustness measure and the operating point of the communication system. The low
computational effort of the suboptimal solution based on analytical approach
leads to a good trade-off between performance and complexity.Comment: 27 pages, 8 figures, submitted to IEEE Trans. Inform. Theor
Waveform Design for 5G and Beyond
5G is envisioned to improve major key performance indicators (KPIs), such as
peak data rate, spectral efficiency, power consumption, complexity, connection
density, latency, and mobility. This chapter aims to provide a complete picture
of the ongoing 5G waveform discussions and overviews the major candidates. It
provides a brief description of the waveform and reveals the 5G use cases and
waveform design requirements. The chapter presents the main features of cyclic
prefix-orthogonal frequency-division multiplexing (CP-OFDM) that is deployed in
4G LTE systems. CP-OFDM is the baseline of the 5G waveform discussions since
the performance of a new waveform is usually compared with it. The chapter
examines the essential characteristics of the major waveform candidates along
with the related advantages and disadvantages. It summarizes and compares the
key features of different waveforms.Comment: 22 pages, 21 figures, 2 tables; accepted version (The URL for the
final version:
https://onlinelibrary.wiley.com/doi/abs/10.1002/9781119333142.ch2
A Simplified Scheme of Estimation and Cancellation of Companding Noise for Companded Multicarrier Transmission Systems
Nonlinear companding transform is an efficient method to reduce the high peak-to-average power ratio (PAPR) of multicarrier transmission systems. However, the introduced companding noise greatly degrades the bit-error-rate (BER) performance of the companded multicarrier systems. In this paper, a simplified but effective scheme of estimation and cancellation of companding noise for the companded multicarrier transmission system is proposed. By expressing the companded signals as the summation of original signals added with a companding noise component, and subtracting this estimated companding noise from the received signals, the BER performance of the overall system can be significantly improved. Simulation results well confirm the great advantages of the proposed scheme over other conventional decompanding or no decompanding schemes under various situations
- …