A Low-Complexity SLM PAPR Reduction Scheme for OFDMA

In orthogonal frequency division multiplexing (OFDM) systems, selected mapping (SLM) techniques are widely used to minimize the peak to average power ratio (PAPR). The candidate signals are generated in the time domain by linearly mixing the original time-domain transmitted signal with numerous cyclic shift equivalents to reduce the amount of Inverse Fast Fourier Transform (IFFT) operations in typical SLM systems. The weighting factors and number of cyclic shifts, on the other hand, should be carefully chosen to guarantee that the elements of the appropriate frequency domain phase rotation vectors are of equal magnitude. A low-complexity expression is chosen from among these options to create the proposed low-complexity scheme, which only requires one IFFT. In comparison to the existing SLM technique, the new SLM scheme achieves equivalent PAPR reduction performance with significantly less computing complexity. MATLAB tool is used for simulating the proposed work

A Low-Complexity SLM PAPR Reduction Scheme for OFDMA

In orthogonal frequency division multiplexing (OFDM) systems, selected mapping (SLM) techniques are widely used to minimize the peak to average power ratio (PAPR). The candidate signals are generated in the time domain by linearly mixing the original time-domain transmitted signal with numerous cyclic shift equivalents to reduce the amount of Inverse Fast Fourier Transform (IFFT) operations in typical SLM systems. The weighting factors and number of cyclic shifts, on the other hand, should be carefully chosen to guarantee that the elements of the appropriate frequency domain phase rotation vectors are of equal magnitude. A low-complexity expression is chosen from among these options to create the proposed low-complexity scheme, which only requires one IFFT. In comparison to the existing SLM technique, the new SLM scheme achieves equivalent PAPR reduction performance with significantly less computing complexity. MATLAB tool is used for simulating the proposed work

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

Analysis and Implementation of PAPR reduction algorithms for C-OFDM signals

Nowadays multicarrier modulation has become a key technology for communication systems; for example C-OFDM schemes are used in wireless LAN (802.11a/g/n), terrestrial digital television (DVB-T) and audio broadcaster (DAB) in Europe, and discrete multitone (DMT) in x.DSL systems. The principal difficulty with OFDM is the occurrence of the coherent alignment of the time domain parallel signals at the transmitted side which forces system designer to introduce either additional hard computationally device or a suitable power back-off at the high power amplifier in order to cope with the large magnitude signal fluctuation. This leads to a significant increment in computational cost in the former case whereas in a worse allowable power utilization in the latter case with respect to the original system. However since both allowable power and computational cost are subject to a design as well as regulatory limit others solution must be accomplished. Peak reduction techniques reduce maximum-to-mean amplitude fluctuations nominating as a feasible solution. Peak-to-average power ratio is the key metric to measure this amplitude fluctuations at transmitter and to give a clear figure of merit for comparison among different techniques

Constrained RS coding for Low Peak to Average Power Ratio in FBMC -- OQAM Systems

Multi-carrier modulation techniques have now become a standard in many communication protocols. Filter bank based multi-carrier (FBMC) generation techniques have been discussed in the literature as a means for overcoming the shortcomings of IFFT/FFT based OFDM system. The Peak to Average Power Ratio (PAPR) is a problem faced by all multi-carrier techniques. This paper discusses the methods for reducing PAPR in a FBMC system while maintaining acceptable Bit Error Rate (BER). A new PAPR minimizing scheme called Constrained Reed Solomon (CRS) coding is proposed. The hybrid techniques using coding and companding are tested for different channel models and is found to yield promising results.Comment: 6 pages,6 Figures, Journal of Electrical and Electronics Engineerin

Polar-Coded OFDM with Index Modulation

Polar codes, as the first error-correcting codes with an explicit construction to provably achieve thesymmetric capacity of memoryless channels, which are constructed based on channel polarization, have recently become a primary contender in communication networks for achieving tighter requirements with relatively low complexity. As one of the contributions in this thesis, three modified polar decoding schemes are proposed. These schemes include enhanced versions of successive cancellation-flip (SC-F), belief propagation (BP), and sphere decoding (SD). The proposed SC-F utilizes novel potential incorrect bits selection criteria and stack to improve its error correction performance. Next, to make the decoding performance of BP better, permutation and feedback structure are utilized. Then, in order to reduce the complexity without compromising performance, a SD by using novel decoding strategies according to modified path metric (PM) and radius extension is proposed. Additionally, to solve the problem that BP has redundant iterations, a new stopping criterion based on bit different ratio (BDR) is proposed. According to the simulation results and mathematical proof, all proposed schemes can achieve corresponding performance improvement or complexity reduction compared with existing works. Beside applying polar coding, to achieve a reliable and flexible transmission in a wireless communication system, a modified version of orthogonal frequency division multiplexing (OFDM) modulation based on index modulation, called OFDM-in-phase/quadrature-IM (OFDM-I/Q-IM), is applied. This modulation scheme can simultaneously improve spectral efficiency and bit-error rate (BER) performance with great flexibility in design and implementation. Hence, OFDM-I/Q-IM is considered as a potential candidate in the new generation of cellular networks. As the main contribution in this work, a polar-coded OFDM-I/Q-IM system is proposed. The general design guidelines for overcoming the difficulties associated with the application of polar codes in OFDM-I/Q-IM are presented. In the proposed system, at the transmitter, we employ a random frozen bits appending scheme which not only makes the polar code compatible with OFDM-I/Q-IM but also improves the BER performance of the system. Furthermore, at the receiver, it is shown that the \textit{a posteriori} information for each index provided by the index detector is essential for the iterative decoding of polar codes by the BP algorithm. Simulation results show that the proposed polar-coded OFDM-I/Q-IM system outperforms its OFDM counterpart in terms of BER performance

Intelligent Processing in Wireless Communications Using Particle Swarm Based Methods

There are a lot of optimization needs in the research and design of wireless communica- tion systems. Many of these optimization problems are Nondeterministic Polynomial (NP) hard problems and could not be solved well. Many of other non-NP-hard optimization problems are combinatorial and do not have satisfying solutions either. This dissertation presents a series of Particle Swarm Optimization (PSO) based search and optimization algorithms that solve open research and design problems in wireless communications. These problems are either avoided or solved approximately before. PSO is a bottom-up approach for optimization problems. It imposes no conditions on the underlying problem. Its simple formulation makes it easy to implement, apply, extend and hybridize. The algorithm uses simple operators like adders, and multipliers to travel through the search space and the process requires just five simple steps. PSO is also easy to control because it has limited number of parameters and is less sensitive to parameters than other swarm intelligence algorithms. It is not dependent on initial points and converges very fast. Four types of PSO based approaches are proposed targeting four different kinds of problems in wireless communications. First, we use binary PSO and continuous PSO together to find optimal compositions of Gaussian derivative pulses to form several UWB pulses that not only comply with the FCC spectrum mask, but also best exploit the avail- able spectrum and power. Second, three different PSO based algorithms are developed to solve the NLOS/LOS channel differentiation, NLOS range error mitigation and multilateration problems respectively. Third, a PSO based search method is proposed to find optimal orthogonal code sets to reduce the inter carrier interference effects in an frequency redundant OFDM system. Fourth, a PSO based phase optimization technique is proposed in reducing the PAPR of an frequency redundant OFDM system. The PSO based approaches are compared with other canonical solutions for these communication problems and showed superior performance in many aspects. which are confirmed by analysis and simulation results provided respectively. Open questions and future Open questions and future works for the dissertation are proposed to serve as a guide for the future research efforts

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

Performance evaluation of OFDM based wireless communication systems using Graphics Processing Unit (GPU) based high performance computing

Wireless communication is one of the fastest developing technologies of current decade. Achieving high data rate under constrained condition demand sophisticated signal processing algorithms which in turn demand complex computational processing. Modern wireless communication techniques using OFDM demand substantial computational resources for implementation. An OFDM system with 2048 subcarriers typically requires a 2048 point IFFT for transmission and 2048 point FFT for reception. When signal processing techniques like PAPR, pre-equalization, equalization, pilot carrier insertion are implemented, the complexity increases considerably. This large complexity demands use of high performance computing systems for efficient implementation. This primary aim of this project was to take up this investigation. Rapid growth in computing and communications technology has led to the proliferation of powerful parallel and distributed computing paradigm leading to innovation in high performance computing and communications (HPCC). In this project, the performance of advanced wireless communication algorithms on Graphics Processing Unit (GPU) based high performance computing hardware has been evaluated. The computationally expensive multi-carrier wireless communication systems along with associated signal processing techniques have been implemented on GPU with an aim to reduce computation time. This project proposes the use of GPU architecture for efficient implementation of Long Term Evolution (LTE) Physical Layer, Multiple Input Multiple Output (MIMO) OFDM system and Partial Transmit sequence (PTS) technique for Peak-to-Average Power Ratio (PAPR) reduction in OFDM system. The implementation of this new method is expected to provide promising ways to implement complex wireless communication systems using GPU based computing hardware