Digital communication systems which use Orthogonal Frequency Division Multiplexing (OFDM) are now widely used and have many advantages. The main disadvantage is the requirement for highly linear analogue electronics including the high power amplifier (HPA). This requirement cannot be met in all circumstances because of the occurrence of symbols with high peak to average power ratio (PAPR). Such symbols may be non-linearly distorted by limiting. Approaches to solve this problem have been either to reduce the PAPR at the transmitter or to try to mitigate the effect of the non-linearity at the receiver. Soft-limiting, i.e. applying limiting in software prior to the HPA is a simple way to reduce the PAPR. It produces non-linear distortion which will cause an increase in the bit-error-rate (BER) at the receiver. This thesis surveys existing alternatives ways of reducing the effect of non-linearity and proposes some new ones. Two iterative receiver techniques, based on statistical analysis of the nature of the non-linearity, have been implemented and investigated. These are the ‘Bussgang Noise Cancellation’ (BNC) technique and the ‘Decision Aided Reconstruction’ (DAR) techniques. As these techniques are valid for any memory-less nonlinearity, an alternative form of limiting, named as Inverted-Wraparound (IWRAP) has been included in the BNC investigation. A new method is proposed which is capable of correcting the received time-domain samples that are clipped, once they have been identified. This is named the ‘Equation-Method’ and it works by identifying constellation symbols that are likely to be correct at the receiver. If there are a sufficient number of these and they are correctly identified, the FFT may be partitioned to produce a set of equations that may be solved for the clipped time-domain samples. The thesis proposes four enhancements to this new method which improve its effectiveness. It is shown that the best form of this method outperforms conventional techniques especially for severe clipping levels. The performance of these four enhancements is evaluated over channels with additive white Gaussian noise (AWGN) in addition to clipping distortion. A technique based on a ‘margin factor’ is designed to make these methods work more effectively in the presence of AWGN noise. A new combining algorithm referred as ‘HARQ for Clipping’ is presented where soft bit decisions are combined from multiple transmissions. ‘HARQ for Clipping’ has been combined with the best version of the Equation-Method, and the performance of this approach is evaluated in terms of the BER with different levels of AWGN. It has been compared to other approaches from the literature and was found to out-perform the BNC iterative receiver by 3dB at signal to noise ratios around 10dB. Without HARQ, the best version of the Equation-Method performs better than the BNC receiver, at signal-to-nose ratios above about 17dB.

Submitted by Marta Toyoda (1144061@mackenzie.br) on 2018-02-08T19:53:42Z No. of bitstreams: 2 RENATO PIVESSO FRANZIN.pdf: 4022365 bytes, checksum: 9a9f1f649dcaff054b2cc033a7c69dba (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Paola Damato (repositorio@mackenzie.br) on 2018-02-22T13:30:38Z (GMT) No. of bitstreams: 2 RENATO PIVESSO FRANZIN.pdf: 4022365 bytes, checksum: 9a9f1f649dcaff054b2cc033a7c69dba (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-02-22T13:30:38Z (GMT). No. of bitstreams: 2 RENATO PIVESSO FRANZIN.pdf: 4022365 bytes, checksum: 9a9f1f649dcaff054b2cc033a7c69dba (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-10-27 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / The present dissertation presented a comparative analysis between OFDM and FBMC modulation techniques, applied in Power Line Communication (PLC) technology, considering realistic channel models. With the growing demand for access to broadband data networks, there is a need to integrate the various data communication technologies. In this scenario, PLC networks can o er a viable alternative as a provider of network access, since they use the infrastructure of the transmission lines. However, the electrical network is a hostile medium for data transmission, presenting impedance mismatches, noise interference and signal propagation in multipath, characterizing the PLC channel model. With the objective of increasing the data transmission rate, as well as to obtain a better utilization of available bandwidth, the present work proposed to replace the OFDM technique by FBMC in PLC networks. For this, a study of the channel model was carried out to obtain the necessary parameters for the computational simulations through Matlab software. The OFDM and FBMC techniques were implemented according to IEEE 1901 standard technical speci cations. With the results obtained in the simulations, it was veri ed that the FBMC is more robust the channel interferences, presenting gains of up to 8 dB in the bit error rate, and an increase in the data transmission rate and spectral e ciency of up to 25% in relation to OFDM. Therefore, the FBMC technique can be implemented at the physical layer of the IEEE 1901 standard, replacing OFDM. / A presente dissertação apresentou uma análise comparativa entre as t_ecnicas de modulação OFDM e FBMC, aplicadas na tecnologia Power Line Communication (PLC), considerando modelos realísticos de canais. Com a crescente demanda ao acesso das redes de dados em banda larga, há uma necessidade de integração das diversas tecnologias de comunicação de dados. Nesse cenário, as redes PLC podem oferecer uma alternativa viável como provedora de acesso à rede, pois utilizam a infraestrutura das linhas de transmissão de energia elétrica. Entretanto, a rede elétrica é um meio hostil para transmissão de dados, apresentando desajustes de impedância, interferência de ruído e propagação do sinal em multipercursos, caracterizando o modelo do canal PLC. Com o objetivo de aumentar a taxa de transmissão de dados, como também obter um melhor aproveitamento da largura de banda disponível, o presente trabalho propôs substituir a técnica OFDM pela FBMC em redes PLC. Para isso, foi realizado um estudo do modelo do canal, para obter os parâmetros necessários para as simulações computacionais por meio do software Matlab. As técnicas OFDM e FBMC foram implementadas de acordo com especificações técnicas do padrão IEEE 1901. Com os resultados obtidos nas simulações, constatou que o FBMC é mais robusto as interferências do canal, apresentando ganhos de até 8 dB na taxa de erro de bit, e um incremento na taxa de transmissão de dados e eficiência espectral de até 25% em relação ao OFDM. Portanto, a técnica FBMC pode ser implementada na camada física do padrão IEEE 1901, substituindo o OFDM.

This paper presents a new hybrid PAPR reduction technique for the OFDM signal, which combines a multiple symbol representations method with a signal clipping method. The clipping method is a nonlinear PAPR reduction scheme, where the amplitude of the signal is limited to a given threshold. Considering the fact that the signal must be interpolated before A/D conversion, a variety of clipping methods has been proposed. Some methods suggest the clipping before interpolation, having the disadvantage of the peaks re-growth. Other methods contributed that the clipping after interpolation, having the disadvantage of out-of-band power production. In order to overcome this problem different filtering techniques have been proposed. Filtering can also cause peak re-growth, but less than the clipping before interpolation. Another clipping technique supposes that only subcarriers having the highest phase difference between the original signal and its clipped variant will be changed. This is the case of the partial clipping method. To further reduce the PAPR, the dynamic of the clipped signal can be compressed. Linear methods like partial transmit sequence or selective mapping has been proposed for the reduction of PAPR as well. Another PAPR reduction method is the tone reservation. It uses tones on which no data is sent to reduce the transmitted signal peaks. Derivatives of this method with lower computation complexity and improved performance have been proposed: One-Tone One-Peak and one by-one iteration. A similar PAPR reduction method is the multiple symbol representations, where alternative signalling points are used to represent one symbol. The simulation results highlight the advantages of the proposed PAPR reduction method. / The proposed technique namely Adaptive Active Constellation Extension (Adaptive ACE) Algorithm reduced the high Peak-to-Average Power Ratio (PAPR) of the Orthogonal Frequency Division Multiplexing (OFDM) systems. The Peak-to-Average Power Ratio (PAPR) is equal to 6.8 dB for the target clipping ratios of 4 dB, 2 dB and 0 dB by using Adaptive Active Constellation Extension (Adaptive ACE) Algorithm. Thus, the minimum PAPR can be achieved for low target clipping ratios. The Signal-to-Noise Ratio (SNR) of the Orthogonal Frequency Division Multiplexing (OFDM) signal obtained by the Adaptive Active Constellation Extension (Adaptive ACE) algorithm is equal to 1.2 dB at a Bit Error Rate (BER) of 10-0..4 for different constellation orders like 4-Quadrature Amplitude Modulation (4-QAM), 16-Quadrature Amplitude Modulation (16-QAM) and 64-Quadrature Amplitude Modulation (16-QAM). Here, the Bit Error Rate of 10-0.4 or 0.398, that means a total of 398-bits are in error when 1000-bits are transmitted via a communication channel or approximately 4-bits are in error when 10-bits are transmitted via a communication channel, which is high when compared to that of the original Orthogonal Frequency Division Multiplexing (OFDM) signal. The other problems faced by the Adaptive Active Constellation Extension (Adaptive ACE) algorithm are Out-of-Band Interference (OBI) and peak regrowth. Here, the Out-of-Band Interference (OBI) is a form of noise or an unwanted signal, which is caused when the original Orthogonal Frequency Division Multiplexing (OFDM) signal is clipped for reducing the peak signals which are outside of the predetermined area and the peak regrowth is obtained after filtering the clipped signal. The peak regrowth results to, increase in the computational time and computational complexity. In this paper, we have proposed a PAPR reduction scheme to improve the bit error rate performance by applying companding transform technique. Hence, 1-1.5 dB reduction in PAPR with this Non-companding technique is achieved. In Future, We can accept to implement the same on Rician and Rayleigh channels. / Clement Ranjith Anthikkad (E-mail: clement.ranjith@gmail.com / clan11@bth.se) & Irfan Ahmed Baig (E-mail: baig.irfanahmed@gmail.com / ir-a11@bth.se )

Fusion frames and block sparse recovery are of interest in signal processing and communication applications. In these applications it is required that the fusion frame have some desirable properties. One such requirement is that the fusion frame be tight and its subspaces form an optimal packing in a Grassmannian manifold. Such fusion frames are called Grassmannian fusion frames. Grassmannian frames are known to be optimal dictionaries for sparse recovery as they have minimum coherence. By analogy Grassmannian fusion frames are potential candidates as optimal dictionaries in block sparse processing. The present work intends to study fusion frames in finite dimensional vector spaces assuming a specific structure useful in block sparse signal processing. The main focus of our work is the design of Grassmannian fusion frames and their implication in block sparse recovery. We will consider burst error correction as an application of block sparsity and fusion frame concepts. We propose two new algebraic methods for designing Grassmannian fusion frames. The first method involves use of Fourier matrix and difference sets to obtain a partial Fourier matrix which forms a Grassmannian fusion frame. This fusion frame has a specific structure and the parameters of the fusion frame are determined by the type of difference set used. The second method involves constructing Grassmannian fusion frames from Grassmannian frames which meet the Welch bound. This method uses existing constructions of optimal Grassmannian frames. The method, while fairly general, requires that the dimension of the vector space be divisible by the dimension of the subspaces. A lower bound which is an analog of the Welch bound is derived for the block coherence of dictionaries along with conditions to be satisfied to meet the bound. From these results we conclude that the matrices constructed by us are optimal for block sparse recovery from block coherence viewpoint. There is a strong relation between sparse signal processing and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve the burst error correction problem using block sparse signal recovery methods. The use of Grassmannian fusion frames which we constructed as optimal dictionary allows correction of maximum possible number of errors, when used in conjunction with reconstruction algorithms which exploit block sparsity. We also suggest a modification to improve the applicability of the technique and point out relationship with a method which appeared previously in literature. As an application example, we consider the use of the burst error correction technique for impulse noise cancelation in OFDM system. Impulse noise is bursty in nature and severely degrades OFDM performance. The Grassmannian fusion frames constructed with Fourier matrix and difference sets is ideal for use in this application as it can be easily incorporated into the OFDM system.

The integration of Multiple Input Multiple Output (MIMO) and Orthogonal Frequency Division Multiplexing (OFDM) techniques has become a preferred solution for the high rate wireless technologies due to its high spectral efficiency, robustness to frequency selective fading, increased diversity gain, and enhanced system capacity. The main drawback of OFDM-based systems is their susceptibility to impairments such as Carrier Frequency Offset (CFO), Sampling Frequency Offset (SFO), Symbol Timing Error (STE), Phase Noise (PHN), and fading channel. These impairments, if not properly estimated and compensated, degrade the performance of the OFDM-based systems In this thesis, a system model for MIMO-OFDM that takes into account the effects of all these impairments is formulated. Using this system model, we de-rive Cramer-Rao Lower Bounds (CRLBs) for the joint estimation of deterministic impairments in MIMO-OFDM system, which show the coupling effect among different impairments and the significance of the joint estimation. Also, Bayesian CRLBs for the joint estimation of random impairments in OFDM system are derived. Similarly, we derive Hybrid CRLBs for the joint estimation of random and deterministic impairments in OFDM system, which show the significance of using Bayesian approach in estimation. Further, we investigate different algorithms for the joint estimation of all impairments in OFDM-based system. Maximum Likelihood (ML) algorithms and its low complexity variants, for the joint estimation of CFO, SFO, STE, and channel in MIMO-OFDM system, are proposed. We propose a low complexity ML algorithm which uses Compressed Sensing (CS) based channel estimation method in a sparse fading sce-nario, where the received samples used for estimation are less than that required for a Least Squares (LS) or Maximum a posteriori (MAP) based estimation. Also, we propose MAP algorithms for the joint estimation of the random impairments, PHN and channel, utilizing their statistical knowledge which is known a priori. Joint estimation algorithms for SFO and channel in OFDM system, using Bayesian framework, are also proposed in this thesis. The performance of the estimation methods is studied through simulations and numerical results show that the performance of the proposed algorithms is better than existing algorithms and is closer to the derived CRLBs.

No description available.

The rapid advancements in semiconductor technology have led to constant shrinking of transistor sizes as per Moore's Law. Wireless communications is one field which has seen explosive growth, thanks to the cramming of more transistors into a single chip. Design of these systems involve trade-offs between performance, area and power. Fast Fourier Transform is an important component in most of the wireless communication systems. FFTs are widely used in applications like OFDM transceivers, Spectrum sensing in Cognitive Radio, Image Processing, Radar Signal Processing etc. FFT is the most compute intensive and time consuming operation in most of the above applications. It is always a challenge to develop an architecture which gives high throughput while reducing the latency without much area overhead. Next generation wireless systems demand high transmission efficiency and hence FFT processor should be capable of doing computations much faster. Architectures based on smaller radices for computing longer FFTs are inefficient. In this thesis, a fully parallel unrolled FFT architecture based on novel radix-4 engine is proposed which is catered for wide range of applications. The radix-4 butterfly unit takes all four inputs in parallel and can selectively produce one out of the four outputs. The proposed architecture uses Radix-4^3 and Radix-4^4 algorithms for computation of various FFTs. The Radix-4^4 block can take all 256 inputs in parallel and can use the select control signals to generate one out of the 256 outputs. In existing Cooley-Tukey architectures, the output from each stage has to be reordered before the next stage can start computation. This needs intermediate storage after each stage. In our architecture, each stage can directly generate the reordered outputs and hence reduce these buffers. A solution for output reordering problem in Radix-4^3 and Radix-4^4 FFT architectures are also discussed in this work. Although the hardware complexity in terms of adders and multipliers are increased in our architecture, a significant reduction in intermediate memory requirement is achieved. FFTs of varying sizes starting from 64 point to 64K point have been implemented in ASIC using UMC 130nm CMOS technology. The data representation used in this work is fixed point format and selected word length is 16 bits to get maximum Signal to Quantization Noise Ratio (SQNR). The architecture has been found to be more suitable for computing FFT of large sizes. For 4096 point and 64K point FFTs, this design gives comparable throughput with considerable reduction in area and latency when compared to the state-of-art implementations. The 64K point FFT architecture resulted in a throughput of 1332 mega samples per second with an area of 171.78 mm^2 and total power of 10.7W at 333 MHz.

Orthogonal frequency division multiplexing (OFDM) in next generation wireless systems provides high downlink data rates by employing frequency-domain scheduling and rate adaptation at the base station (BS). However, in order to control the significant feedback overhead required by these techniques, feedback reduction schemes are essential. Best-m feedback is one such scheme that is implemented in OFDM standards such as Long Term Evolution. In it, the sub channel (SC) power gains of only the m strongest SCs and their corresponding indices are fed back to the BS. However, two assumptions pervade most of the literature that analyze best-m feedback in OFDM systems. The first one is that the SC gains are uncorrelated. In practice, however, the SC gains are highly correlated, even for dispersive multipath channels. The second assumption deals with the treatment of unreported SCs, which are not fed back by the best-m scheme. If no user reports an SC, then no data transmission is assumed to occur. In this thesis, we eschew these assumptions and investigate best-m feedback in OFDM systems with correlated SC gains. We, first, characterize the average throughput as a function of correlation and m. A uniform correlation model is assumed, i.e., the SC gains are correlated with each other by the same correlation coefficient. The system model incorporates greedy, modified proportional- fair, and round robin schedulers, discrete rate adaptation, and non-identically distributed SC gains of different users. We, then, generalize the model to account for feedback delay. We show in all these cases that correlation degrades the average throughput. We also show that this effect does not arise when users report all the SC power gains to the BS. In order to mitigate the reduction in the average throughput caused by unreported SCs, we derive a novel, constrained minimum mean square error channel estimator for the best-m scheme to estimate the gains of these unreported SCs. The estimator makes use of the additional information, which is unique to the best-m scheme, that the estimated SC power gains must be less than those that were reported. We, then, study its implications on the downlink average cell throughput, again for different schedulers. We show that our approach reduces the root mean square error and increases the average throughput compared to several approaches pursued in the literature. The more correlated the SC gains, greater is the improvement.

This doctoral thesis is focused into the area of multicarrier radio communications systems. These systems are perspective for current and incoming mobile communications and wireless networks. Advantages of multicarrier systems like better multipath propagation resistivity are redeemed by some disadvantages. The high peak to average power ratio of transmitted signal belongs to these disadvantages, for its inconvenience for high efficient power amplification. The thesis concerns with peak to average power ratio reduction methods for OFDM systems, that belongs to the most used multicarrier systems. One of the main objectives is the modification of the existing methods with the intention of complexity reduction. Following subject of interest is the analysis of suitable methods combinations possibilities for more significant peak to average power ratio reduction. One part of this thesis is research of influence of these methods on the OFDM signals with different parameters.

Orthogonal frequency division multiplexing (OFDM) has become a very popular method for high-data-rate communication. However, it is well known that OFDM is plagued by a large peak-to-average power ratio (PAPR) problem. This high PAPR results in overdesigned power amplifiers, which amongst other things leads to inefficient amplifier usage, which is undesirable. Various methods have been recommended to reduce the PAPR of an OFDM transmission; however, all these methods result in a number of drawbacks. In this thesis, a novel method called offset modulation (OM-OFDM) is proposed to control the PAPR of an OFDM signal. The proposed OM-OFDM method does not result in a number of the drawbacks being experienced by current methods in the field. The theoretical bandwidth occupancy and theoretical bit error rate (BER) expression for an OM-OFDM transmission is derived. A newly applied power performance decision metric is also introduced, which can be utilised throughout the PAPR field, in order to compare various methods. The proposed OM-OFDM method appears to be similar to a well-known constant envelope OFDM (CE-OFDM) transmission. The modulation, structural and performance differences between an OM-OFDM and a CE-OFDM method are discussed. By applying the power performance decision metric, the OM-OFDM method is shown to offer significant performance gains when compared to CE-OFDM and traditional OFDM transmissions. In addition, the OM-OFDM method is able to accurately control the PAPR of a transmission for a targeted BER. By applying the power performance decision metric and complementary cumulative distribution function (CCDF), the proposed OM-OFDM method is shown to offer further performance gains when compared to existing PAPR methods, under frequency selective fading conditions. In this thesis, the OM-OFDM method has been combined with an existing active constellation extended (ACE) PAPR reduction method. To introduce a novel method called offset modulation with active constellation extension (OM-ACE), to control the PAPR of an OFDM signal. The theoretical BER expression for an OM-ACE transmission is presented and validated. Thereafter, by applying the decision metric and CCDF, the OM-ACE method is shown to offer performance improvements when compared to various PAPR methods. The use of OM-OFDM for cognitive radio applications is also investigated. Cognitive radio applications require transmissions that are easily detectable. The detection characteristics of an OM-OFDM and OFDM transmission are studied by using receiver operating characteristic curves. A derivation of a simplified theoretical closed-form expression, which relates the probability of a missed detection to the probability of a false alarm, for an unknown deterministic signal, at various signal-to-noise ratio (SNR) values is derived and validated. Previous expressions have been derived, which relate the probability of a missed detection to the probability of a false alarm. However, they have not been presented in such a generic closed-form expression that can be used for any unknown deterministic signal (for instance OFDM and OM-OFDM). Thereafter, an examination of the spectrum characteristics of an OM-OFDM transmission indicates its attractive detection characteristics. The proposed OM-OFDM method is further shown to operate at a significantly lower SNR value than an OFDM transmission, while still offering better detection characteristics than that of an OFDM transmission under Rician, Rayleigh and frequency selective fading channel conditions. In addition to its attractive PAPR properties, OM-OFDM also offers good detection characteristics for cognitive radio applications. These aspects make OM-OFDM a promising candidate for future deployment. / Thesis (PhD)--University of Pretoria, 2012. / Electrical, Electronic and Computer Engineering / unrestricted