No description available.

No description available.

Abstract Cognitive Radio (CR) improves the efficiency of spectrum utilization by allowing non- licensed users to utilize bands when not occupied by licensed users. In this thesis, we address several challenges currently limiting the wide use of cognitive radios. These challenges include identification of unoccupied bands, energy consumption and other technical challenges. Improved accuracy edge detection techniques are developed for CR to mitigate both noise and estimation error variance effects. Next, a reduced complexity Simplified DFT (SDFT) is proposed for use in CR. Then, a sub-Nyquist rate A to D converter is introduced to reduce energy consumption. Finally, a novel multi-resolution PSD estimation based on expectation-maximization algorithm is introduced that can obtain a more accurate PSD within a specified sensing time.

Abstract Cognitive Radio (CR) improves the efficiency of spectrum utilization by allowing non- licensed users to utilize bands when not occupied by licensed users. In this thesis, we address several challenges currently limiting the wide use of cognitive radios. These challenges include identification of unoccupied bands, energy consumption and other technical challenges. Improved accuracy edge detection techniques are developed for CR to mitigate both noise and estimation error variance effects. Next, a reduced complexity Simplified DFT (SDFT) is proposed for use in CR. Then, a sub-Nyquist rate A to D converter is introduced to reduce energy consumption. Finally, a novel multi-resolution PSD estimation based on expectation-maximization algorithm is introduced that can obtain a more accurate PSD within a specified sensing time.

The dissertation considers an indirect approach for the estimation of the cointegrating parameters, in the sense that the estimators are jointly constructed along with estimating other nuisance parameters. This approach was proposed by Robinson (2008) where a bivariate local Whittle estimator was developed to jointly estimate a cointegrating parameter along with the memory parameters and the phase parameters (discussed in chapter 2). The main contributions of this dissertation is to establish, similar to Robinson (2008), a joint estimation of the memory, cointegrating and phase parameters in stationary and nonstationary fractionally cointegrated models in a multivariate framework. In order to accomplish such task, a general shape of the spectral density matrix, first noted in Davidson and Hashimzade (2008), is utilised to cover multivariate jointly dependent stationary long memory time series allowing more than one cointegrating relation (discussed in chapter 3). Consequently, the notion of the extended discrete Fourier transform is adopted based on the work of Phillips (1999) to allow for the multivariate estimation to cover the non stationary region (explained in chapter 4). Overall, the estimation methods adopted in this dissertation follows the semiparametric approach, in that the spectral density is only specified in a neighbourhood of zero frequency. The dissertation is organised in four self-contained chapters that are connected to each other, in additional to this introductory chapter: • Chapter 1 discusses the univariate long memory time series analysis covering different definitions, models and estimation methods. Consequently, parametric and semiparametric estimation methods were applied to a univariate series of the daily Egyptian stock returns to examine the presence of long memory properties. The results show strong and significant evidence of long memory in the Egyptian stock market which refutes the hypothesis of market efficiency. • Chapter 2 expands the analysis in the first chapter using a bivariate framework first introduced by Robinson (2008) for long memory time series in stationary system. The bivariate model presents four unknown parameters, including two memory parameters, a phase parameter and a cointegration parameter, which are jointly estimated. The estimation analysis is applied to a bivariate framework includes the US and Canada inflation rates where a linear combination between the US and Canada inflation rates that has a long memory less than the two individual series has been detected. • Chapter 3 introduces a semiparametric local Whittle (LW) estimator for a general multivariate stationary fractional cointegration using a general shape of the spectral density matrix first introduced by Davidson and Hashimzade (2008). The proposed estimator is used to jointly estimate the memory parameters along with the cointegrating and phase parameters. The consistency and asymptotic normality of the proposed estimator is proved. In addition, a Monte Carlo study is conducted to examine the performance of the new proposed estimator for different sample sizes. The multivariate local whittle estimation analysis is applied to three different relevant examples to examine the presence of fractional cointegration relationships. • In the first three chapters, the estimation procedures focused on the stationary case where the memory parameter is between zero and half. On the other hand, the analysis in chapter 4, which is a natural progress to that in chapter 3, adjusts the estimation procedures in order to cover the non-stationary values of the memory parameters. Chapter 4 expands the analysis in chapter 3 using the extended discrete Fourier transform and periodogram to extend the local Whittle estimation to non stationary multivariate systems. As a result, the new extended local Whittle (XLW) estimator can be applied throughout the stationary and non stationary zones. The XLW estimator is identical to the LW estimator in the stationary region, introduced in chapter 3. Application to a trivariate series of US money aggregates is employed.

The aims of this thesis are to reduce the complexity and increasethe accuracy of rotations carried out inthe fast Fourier transform (FFT) at algorithmic and arithmetic level.In FFT algorithms, rotations appear after every hardware stage, which are alsoreferred to as twiddle factor multiplications. At algorithmic level, the focus is on the development and analysisof FFT algorithms. With this goal, a new approach based on binary tree decompositionis proposed. It uses the Cooley Tukey algorithm to generate a large number ofFFT algorithms. These FFT algorithms have identical butterfly operations and data flow but differ inthe value of the rotations. Along with this, a technique for computing the indices of the twiddle factors based on the binary tree representation has been proposed. We have analyzed thealgorithms in terms of switching activity, coefficient memory size, number of non-trivial multiplicationsand round-off noise. These parameters have impact on the power consumption, area, and accuracy of the architecture.Furthermore, we have analyzed some specific cases in more detail for subsets of the generated algorithms. At arithmetic level, the focus is on the hardware implementation of the rotations.These can be implemented using a complex multiplier,the CORDIC algorithm, and constant multiplications. Architectures based on the CORDIC and constant multiplication use shift and add operations, whereas the complex multiplication generally uses four real multiplications and two adders.The sine and cosine coefficients of the rotation angles fora complex multiplier are normally stored in a memory.The implementation of the coefficient memory is analyzed and the best possible approaches are analyzed.Furthermore, a number of twiddle factor multiplication architectures based on constant multiplications is investigated and proposed. In the first approach, the number of twiddle factor coefficients is reduced by trigonometric identities. By considering the addition aware quantization method, the accuracy and adder count of the coefficients are improved. A second architecture based on scaling the rotations such that they no longer have unity gain is proposed. This results in twiddle factor multipliers with even lower complexity and/or higher accuracy compared to the first proposed architecture.

A linear periodically time-varying (LPTV) system is a linear time-varying system with the coefficients changing periodically, which is widely used in control, communications, signal processing, and even circuit modeling. This thesis concentrates on identification of LPTV systems. To this end, the representations of LPTV systems are thoroughly reviewed. Identification methods are developed accordingly. The usefulness of the proposed identification methods is verified by the simulation results.<p> A periodic input signal is applied to a finite impulse response (FIR)-LPTV system and measure the noise-contaminated output. Using such periodic inputs, we show that we can formulate the problem of identification of LPTV systems in the frequency domain. With the help of the discrete Fourier transform (DFT), the identification method reduces to finding the least-squares (LS) solution of a set of linear equations. A sufficient condition for the identifiability of LPTV systems is given, which can be used to find appropriate inputs for the purpose of identification.<p> In the frequency domain, we show that the input and the output can be related by using the discrete Fourier transform (DFT) and a least-squares method can be used to identify the alias components. A lower bound on the mean square error (MSE) of the estimated alias components is given for FIR-LPTV systems. The optimal training signal achieving this lower MSE bound is designed subsequently. The algorithm is extended to the identification of infinite impulse response (IIR)-LPTV systems as well. Simulation results show the accuracy of the estimation and the efficiency of the optimal training signal design.

A linear periodically time-varying (LPTV) system is a linear time-varying system with the coefficients changing periodically, which is widely used in control, communications, signal processing, and even circuit modeling. This thesis concentrates on identification of LPTV systems. To this end, the representations of LPTV systems are thoroughly reviewed. Identification methods are developed accordingly. The usefulness of the proposed identification methods is verified by the simulation results.<p> A periodic input signal is applied to a finite impulse response (FIR)-LPTV system and measure the noise-contaminated output. Using such periodic inputs, we show that we can formulate the problem of identification of LPTV systems in the frequency domain. With the help of the discrete Fourier transform (DFT), the identification method reduces to finding the least-squares (LS) solution of a set of linear equations. A sufficient condition for the identifiability of LPTV systems is given, which can be used to find appropriate inputs for the purpose of identification.<p> In the frequency domain, we show that the input and the output can be related by using the discrete Fourier transform (DFT) and a least-squares method can be used to identify the alias components. A lower bound on the mean square error (MSE) of the estimated alias components is given for FIR-LPTV systems. The optimal training signal achieving this lower MSE bound is designed subsequently. The algorithm is extended to the identification of infinite impulse response (IIR)-LPTV systems as well. Simulation results show the accuracy of the estimation and the efficiency of the optimal training signal design.

In data-dependent superimposed training (DDST) system, the data sequence subtracts a data-dependent sequence before transmission. The receiver cannot correctly find the unknown term which causes an error floor at high SNR. In this thesis, we list some helpful conditions to enhance the performance for precoding design in DDST system, and analyze the major cause of data misidentification by singular value decomposition (SVD) method. Finally, we propose a precoding matrix based on [C.-P. Li and W.-C. Huang, ¡§A constructive representation for the Fourier dual of the Zadoff¡VChu sequences,¡¨ IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4221¡Ð4224, Nov. 2007]. The precoding matrix is constructed by an inverse discrete Fourier transform (IDFT) matrix and a diagonal matrix with the elements consist of an arbitrary perfect sequence. The proposed method satisfies these conditions and simulation results show that the data identification problem is solved.

The thesis proposes using the efficient memory arrangement methods for the implementation of radix-r multi-dimensional Discrete Fourier Transform (DFT) and Discrete Cosine Transform (DCT). By using the memory instead of the registers to buffer and reorder data, hardware complexity is significantly reduced. We use the recursive architecture that requires only one arithmetic-processing element to compute the entire DFT/DCT operation. The algorithm is based on efficient coefficient matrix factorization and data allocation. By exploiting the features of Kronecker product representation in the fast algorithm, the multi-dimensional DFT/DCT operation is converted into its corresponding 1-D problem and the intermediate data is stored in several memory units. In addition to the smaller area, we also propose a method to reduce the power consumption of the DFT/DCT processors.