Median codeword Shift (MCS) technique for PAPR reduction with low complexity in OFDM system

With the rapid development of today’s communication technology, the need for a system capable to improve spectral efficiency, high data rates and at the same time can reduce inter-symbol interference (ISI) is necessary. Orthogonal Frequency Division Multiplexing (OFDM) meet all the requirements needed. However, the high peak to average power ratio (PAPR) has become its major obstacle. This paper is focusing on the development of Median Codeword Shift (MCS), which a new PAPR reduction technique with the capability to reduce the computational complexity of the system. This can be achieved through codeword structure alterization and bit position manipulation by utilizing the circulant shift process. The simulation results revealed that the proposed technique overwhelm conventional OFDM and SCS with 24% improvement and 0.5 dB gap from SCS. In fact, the proposed technique possess a lower computational complexity by reducing 16.67% of the use of IFFT block in the system in contrast with SCS technique

Complementary Sets, Generalized Reed-Muller Codes, and Power Control for OFDM

The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considered in this correspondence. By generalizing a result by Paterson, it is shown that each q-phase (q is even) sequence of length 2^m lies in a complementary set of size 2^{k+1}, where k is a nonnegative integer that can be easily determined from the generalized Boolean function associated with the sequence. For small k this result provides a reasonably tight bound for the PMEPR of q-phase sequences of length 2^m. A new 2^h-ary generalization of the classical Reed-Muller code is then used together with the result on complementary sets to derive flexible OFDM coding schemes with low PMEPR. These codes include the codes developed by Davis and Jedwab as a special case. In certain situations the codes in the present correspondence are similar to Paterson's code constructions and often outperform them

Efficient Implementation of Complementary Golay Sequences for PAR Reduction and Forward Error Correction in OFDM-based WLAN systems

In this paper the use of complementary Golay sequences (CGS) for peak-to-average power ratio (PAR) reduction and forward error correction (FEC) in an orthogonal frequency division multiplexing (OFDM)-based wireless local area network (WLAN) system is explored; performance is examined and complexity issues are analyzed. We study their PAR reduction performance depending on sequence lengths and we have found that, for the case that the number of sub-carriers differs from the sequence length, some interesting relationships can still be stated. Regarding their error correction capabilities, these sequences are investigated considering M-PSK constellations applied to the OFDM signal specified in IEEE 802.11a standard. Computational load for both Golay encoding and decoding processes is addressed and we provide an exhaustive analysis of their complexity. In order to overcome memory restrictions and speed up algorithmic operations, a novel algorithm for real-time generation of the Golay Base Sequences is proposed and evaluated giving as a conclusion that these sequences can be real-time generated with actual Digital Signal Processors (DSP). Our proposal lies on an efficient permutation algorithm that obtains the current permutation without the need for generating previous ones. Its complexity is calculated and turns out to be significantly low; the advantages are specially appreciated at the decoding stage. We also introduce a hybrid solution to get a trade-off between complexity and memory requirements. Moreover, the whole system is also implemented in a DSP to validate the proposal in a prototype, where its feasibility has been confirmed.This work has been partly funded by the Spanish government with projects MACAWI (TEC 2005-07477-c02-02) and MAMBO (UC3M-TEC-05-027)

PAPR reduction in OFDM system using combined MCS and DHMT precoding

Orthogonal Frequency Division Multiplexing (OFDM) has become a preferable scheme for most high data rate wireless communication standards. However, the non-linear power amplifier effect experienced in the OFDM system has increases the peak-to-average power ratio (PAPR). This paper proposed a Median Codeword Shift (MCS) as a new solution to alleviate the effect of high PAPR. MCS takes advantage of the codeword structure and bit position changes through the manipulation of the codeword structure and permutation process to achieve a low PAPR value. Additionally, the enhanced version of MCS is also being proposed by merging MCS with the Discrete Hartley matrix transform (DHMT) precoding method to boost the PAPR reduction. Simulation results show that MCS is capable of minimizing PAPR of conventional OFDM with 24% improvement and at the same time outperform Selective Codeword Shift (SCS) with a 0.5 dB gap. A remarkable result was also achieved by MCS-DHMT with a 15.1% improvement without facing any bit error rate (BER) degradation