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

New methods of partial transmit sequence for reducing the high peak-to-average-power ratio with low complexity in the ofdm and f-ofdm systems

The orthogonal frequency division multiplexing system (OFDM) is one of the most important components for the multicarrier waveform design in the wireless communication standards. Consequently, the OFDM system has been adopted by many high-speed wireless standards. However, the high peak-to-average- power ratio (PAPR) is the main obstacle of the OFDM system in the real applications because of the non-linearity nature in the transmitter. Partial transmit sequence (PTS) is one of the effective PAPR reduction techniques that has been employed for reducing the PAPR value 3 dB; however, the high computational complexity is the main drawback of this technique. This thesis proposes novel methods and algorithms for reducing the high PAPR value with low computational complexity depending on the PTS technique. First, three novel subblocks partitioning schemes, Sine Shape partitioning scheme (SS-PTS), Subsets partitioning scheme (Sb-PTS), and Hybrid partitioning scheme (H-PTS) have been introduced for improving the PAPR reduction performance with low computational complexity in the frequency-domain of the PTS structure. Secondly, two novel algorithms, Grouping Complex iterations algorithm (G-C-PTS), and Gray Code Phase Factor algorithm (Gray-PF-PTS) have been developed to reduce the computational complexity for finding the optimum phase rotation factors in the time domain part of the PTS structure. Third, a new hybrid method that combines the Selective mapping and Cyclically Shifts Sequences (SLM-CSS-PTS) techniques in parallel has been proposed for improving the PAPR reduction performance and the computational complexity level. Based on the proposed methods, an improved PTS method that merges the best subblock partitioning scheme in the frequency domain and the best low-complexity algorithm in the time domain has been introduced to enhance the PAPR reduction performance better than the conventional PTS method with extremely low computational complexity level. The efficiency of the proposed methods is verified by comparing the predicted results with the existing modified PTS methods in the literature using Matlab software simulation and numerical calculation. The results that obtained using the proposed methods achieve a superior gain in the PAPR reduction performance compared with the conventional PTS technique. In addition, the number of complex addition and multiplication operations has been reduced compared with the conventional PTS method by about 54%, and 32% for the frequency domain schemes, 51% and 65% for the time domain algorithms, 18% and 42% for the combining method. Moreover, the improved PTS method which combines the best scheme in the frequency domain and the best algorithm in the time domain outperforms the conventional PTS method in terms of the PAPR reduction performance and the computational complexity level, where the number of complex addition and multiplication operation has been reduced by about 51% and 63%, respectively. Finally, the proposed methods and algorithms have been applied to the OFDM and Filtered-OFDM (F-OFDM) systems through Matlab software simulation, where F-OFDM refers to the waveform design candidate in the next generation technology (5G)

Intelligent genetic algorithms for next-generation broadband multi-carrier CDMA wireless networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This dissertation proposes a novel intelligent system architecture for next-generation broadband multi-carrier CDMA wireless networks. In our system, two novel and similar intelligent genetic algorithms, namely Minimum Distance guided GAs (MDGAs) are invented for both peak-to-average power ratio (PAPR) reduction at the transmitter side and multi-user detection (MUD) at the receiver side. Meanwhile, we derive a theoretical BER performance analysis for the proposed MC-CDMA system in A WGN channel. Our analytical results show that the theoretical BER performance of synchronized MC-CDMA system is the same as that of the synchronized DS-CDMA system which is also used as a theoretical guidance of our novel MUD receiver design. In contrast to traditional GAs, our MDGAs start with a balanced ratio of exploration and exploitation which is maintained throughout the process. In our algorithms, a new replacement strategy is designed which increases significantly the convergence rate and reduces dramatically computational complexity as compared to the conventional GAs. The simulation results demonstrate that, if compared to those schemes using exhaustive search and traditional GAs, (1) our MDGA-based P APR reduction scheme achieves 99.52% and 50+% reductions in computational complexity, respectively; (2) our MDGA-based MUD scheme achieves 99.54% and 50+% reductions in computational complexity, respectively. The use of one core MDGA solution for both issues can ease the hardware design and dramatically reduce the implementation cost in practice

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

On Efficient Signal Processing Algorithms for Signal Detection and PAPR Reduction in OFDM Systems

The driving force of the study is susceptibility of LS algorithm to noise. As LS algorithm is simple to implement, hence it’s performance improvement can contribute a lot to the wireless technology that are especially deals with high computation. Cascading of AdaBoost algorithm with LS greatly influences the OFDM system performance. Performance of Adaptive Boosting based symbol recovery was investigated on the performance of LS, MMSE, BLUE were also compared with the performance of AdaBoost algorithm and MMSE has been found the higher computational complexity. Furthermore, MMSE also requires apriori channel statistics and computational complexity O(5N3) of the MMSE increases exponentially as the number of carrier increases. For the Adaboost case the computational complexity calculation is little different.Therefore, in the training stage of the AdaBoost algorithm, the computational complexity is only O(nT M) Furthermore, as it is a classification algorithm so in the receiver side we will require a separate de-mapper (or decoder) to get the desired data bits, i.e., a. SAS aided DCT based PAPR reduction 1326 and b. SAS aided DCT based PAPR reduction. A successive addition subtraction preprocessed DCT based PAPR reduction technique was proposed. Here, the performance of proposed method was compared with other preexisting techniques like SLM and PTS and the performance of the proposed method was seen to outperform specially in low PAPR region. In the proposed PAPR reduction method, the receiver is aware of the transmitted signal processing, this enables a reverse operation at the receiver to extract the transmit data. Hence the requirement of sending extra information through extra subcarrier is eliminated. The proposed method is also seen to be spectrally efficient. In the case of PTS and SLM it is inevitable to send the side information to retrieve the transmit signal. Hence, these two methods are spectrally inefficient. Successive addition subtraction based PAPR reduction method was also applied to MIMO systems. The performance of the SAS based PAPR reduction method also showed better performance as compared to other technique. An extensive simulation of MIMO OFDM PAPR reduction was carried out by varying the number of subcarriers and number of transmitter antennas. A detailed computational complexity analysis was also carried out. BATE aided SDMA multi user detection. A detailed study of SDMA system was carried out with it’s mathematical analysis.Many linear and non linear detectors like ML, MMSE, PIC, SIC have been proposed in literature for multiuser detection of SDMA system. However, except MMSE every receivers other are computational extensive. So as to enhance the performance of the MMSE MUD a meta heuristic Bat algorithm was incorporated in cascade with MMSE

Digital signal processing techniques for peak-to-average power ratio mitigation in MIMO–OFDM systems

The focus of this thesis is to mitigate the very large peak-to-average transmit power ratios (PAPRs) inherent to conventional orthogonal frequency division multiplexing (OFDM) systems, particularly in the context of transmission over multi-input multi-output (MIMO) wireless broadband channels. This problem is important as a large PAPR generally needs an expensive radio frequency (RF) power amplifier at the transmitter due to the requirement for linear operation over a wide amplitude range and such a cost would be compounded when multiple transmit antennas are used. Advanced signal processing techniques which can reduce PAPR whilst retain the integrity of digital transmission therefore have considerable potential for application in emergent MIMO–OFDM wireless systems and form the technical contributions of this study. [Continues.

Intelligent genetic algorithms for next-generation broadband multi-carrier CDMA wireless networks

This dissertation proposes a novel intelligent system architecture for next-generation broadband multi-carrier CDMA wireless networks. In our system, two novel and similar intelligent genetic algorithms, namely Minimum Distance guided GAs (MDGAs) are invented for both peak-to-average power ratio (PAPR) reduction at the transmitter side and multi-user detection (MUD) at the receiver side. Meanwhile, we derive a theoretical BER performance analysis for the proposed MC-CDMA system in A WGN channel. Our analytical results show that the theoretical BER performance of synchronized MC-CDMA system is the same as that of the synchronized DS-CDMA system which is also used as a theoretical guidance of our novel MUD receiver design. In contrast to traditional GAs, our MDGAs start with a balanced ratio of exploration and exploitation which is maintained throughout the process. In our algorithms, a new replacement strategy is designed which increases significantly the convergence rate and reduces dramatically computational complexity as compared to the conventional GAs. The simulation results demonstrate that, if compared to those schemes using exhaustive search and traditional GAs, (1) our MDGA-based P APR reduction scheme achieves 99.52% and 50+% reductions in computational complexity, respectively; (2) our MDGA-based MUD scheme achieves 99.54% and 50+% reductions in computational complexity, respectively. The use of one core MDGA solution for both issues can ease the hardware design and dramatically reduce the implementation cost in practice.EThOS - Electronic Theses Online ServiceGBUnited Kingdo