Channelization for Multi-Standard Software-Defined Radio Base Stations

As the number of radio standards increase and spectrum resources come under more pressure, it becomes ever less efficient to reserve bands of spectrum for exclusive use by a single radio standard. Therefore, this work focuses on channelization structures compatible with spectrum sharing among multiple wireless standards and dynamic spectrum allocation in particular. A channelizer extracts independent communication channels from a wideband signal, and is one of the most computationally expensive components in a communications receiver. This work specifically focuses on non-uniform channelizers suitable for multi-standard Software-Defined Radio (SDR) base stations in general and public mobile radio base stations in particular. A comprehensive evaluation of non-uniform channelizers (existing and developed during the course of this work) shows that parallel and recombined variants of the Generalised Discrete Fourier Transform Modulated Filter Bank (GDFT-FB) represent the best trade-off between computational load and flexibility for dynamic spectrum allocation. Nevertheless, for base station applications (with many channels) very high filter orders may be required, making the channelizers difficult to physically implement. To mitigate this problem, multi-stage filtering techniques are applied to the GDFT-FB. It is shown that these multi-stage designs can significantly reduce the filter orders and number of operations required by the GDFT-FB. An alternative approach, applying frequency response masking techniques to the GDFT-FB prototype filter design, leads to even bigger reductions in the number of coefficients, but computational load is only reduced for oversampled configurations and then not as much as for the multi-stage designs. Both techniques render the implementation of GDFT-FB based non-uniform channelizers more practical. Finally, channelization solutions for some real-world spectrum sharing use cases are developed before some final physical implementation issues are considered

Filter Bank Multicarrier Modulation for Spectrally Agile Waveform Design

In recent years the demand for spectrum has been steadily growing. With the limited amount of spectrum available, Spectrum Pooling has gained immense popularity. As a result of various studies, it has been established that most of the licensed spectrum remains underutilized. Spectrum Pooling or spectrum sharing concentrates on making the most of these whitespaces in the licensed spectrum. These unused parts of the spectrum are usually available in chunks. A secondary user looking to utilize these chunks needs a device capable of transmitting over distributed frequencies, while not interfering with the primary user. Such a process is known as Dynamic Spectrum Access (DSA) and a device capable of it is known as Cognitive Radio. In such a scenario, multicarrier communication that transmits data across the channel in several frequency subcarriers at a lower data rate has gained prominence. Its appeal lies in the fact that it combats frequency selective fading. Two methods for implementing multicarrier modulation are non-contiguous orthogonal frequency division multiplexing (NCOFDM)and filter bank multicarrier modulation (FBMC). This thesis aims to implement a novel FBMC transmitter using software defined radio (SDR) with modulated filters based on a lowpass prototype. FBMCs employ two sets of bandpass filters called analysis and synthesis filters, one at the transmitter and the other at the receiver, in order to filter the collection of subcarriers being transmitted simultaneously in parallel frequencies. The novel aspect of this research is that a wireless transmitter based on non-contiguous FBMC is being used to design spectrally agile waveforms for dynamic spectrum access as opposed to the more popular NC-OFDM. Better spectral containment and bandwidth efficiency, combined with lack of cyclic prefix processing, makes it a viable alternative for NC-OFDM. The main aim of this thesis is to prove that FBMC can be practically implemented for wireless communications. The practicality of the method is tested by transmitting the FBMC signals real time by using the Simulink environment and USRP2 hardware modules

Filterbank optimization with convex objectives and the optimality of principal component forms

This paper proposes a general framework for the optimization of orthonormal filterbanks (FBs) for given input statistics. This includes as special cases, many previous results on FB optimization for compression. It also solves problems that have not been considered thus far. FB optimization for coding gain maximization (for compression applications) has been well studied before. The optimum FB has been known to satisfy the principal component property, i.e., it minimizes the mean-square error caused by reconstruction after dropping the P weakest (lowest variance) subbands for any P. We point out a much stronger connection between this property and the optimality of the FB. The main result is that a principal component FB (PCFB) is optimum whenever the minimization objective is a concave function of the subband variances produced by the FB. This result has its grounding in majorization and convex function theory and, in particular, explains the optimality of PCFBs for compression. We use the result to show various other optimality properties of PCFBs, especially for noise-suppression applications. Suppose the FB input is a signal corrupted by additive white noise, the desired output is the pure signal, and the subbands of the FB are processed to minimize the output noise. If each subband processor is a zeroth-order Wiener filter for its input, we can show that the expected mean square value of the output noise is a concave function of the subband signal variances. Hence, a PCFB is optimum in the sense of minimizing this mean square error. The above-mentioned concavity of the error and, hence, PCFB optimality, continues to hold even with certain other subband processors such as subband hard thresholds and constant multipliers, although these are not of serious practical interest. We prove that certain extensions of this PCFB optimality result to cases where the input noise is colored, and the FB optimization is over a larger class that includes biorthogonal FBs. We also show that PCFBs do not exist for the classes of DFT and cosine-modulated FBs

On optimal design and applications of linear transforms

Linear transforms are encountered in many fields of applied science and engineering. In the past, conventional block transforms provided acceptable answers to different practical problems. But now, under increasing competitive pressures, with the growing reservoir of theory and a corresponding development of computing facilities, a real demand has been created for methods that systematically improve performance. As a result the past two decades have seen the explosive growth of a class of linear transform theory known as multiresolution signal decomposition. The goal of this work is to design and apply these advanced signal processing techniques to several different problems. The optimal design of subband filter banks is considered first. Several design examples are presented for M-band filter banks. Conventional design approaches are found to present problems when the number of constraints increases. A novel optimization method is proposed using a step-by-step design of a hierarchical subband tree. This method is shown to possess performance improvements in applications such as subband image coding. The subband tree structuring is then discussed and generalized algorithms are presented. Next, the attention is focused on the interference excision problem in direct sequence spread spectrum (DSSS) communications. The analytical and experimental performance of the DSSS receiver employing excision are presented. Different excision techniques are evaluated and ranked along with the proposed adaptive subband transform-based excises. The robustness of the considered methods is investigated for either time-localized or frequency-localized interferers. A domain switchable excision algorithm is also presented. Finally, sonic of the ideas associated with the interference excision problem are utilized in the spectral shaping of a particular biological signal, namely heart rate variability. The improvements for the spectral shaping process are shown for time-frequency analysis. In general, this dissertation demonstrates the proliferation of new tools for digital signal processing

Construction of M - Band bandlimited wavelets for orthogonal decomposition

While bandlimited wavelets and associated IIR filters have shown serious potential in areas of pattern recognition and communications, the dyadic Meyer wavelet is the only known approach to construct bandlimited orthogonal decomposition. The sine scaling function and wavelet are a special case of the Meyer. Previous works have proposed a M - Band extension of the Meyer wavelet without solving the problem. One key contribution of this thesis is the derivation of the correct bandlimits for the scaling function and wavelets to guarantee an orthogonal basis. In addition, the actual construction of the wavelets based upon these bandlimits is developed. A composite wavelet will be derived based on the M scale relationships from which we will extract the wavelet functions. A proper solution to this task is proposed which will generate associated filters with the knowledge of the scaling function and the constraints for Mband orthogonality

Efficiency in audio processing : filter banks and transcoding

Audio transcoding is the conversion of digital audio from one compressed form A to another compressed form B, where A and B have different compression properties, such as a different bit-rate, sampling frequency or compression method. This is typically achieved by decoding A to an intermediate uncompressed form, and then encoding it to B. A significant portion of the involved computational effort pertains to operating the synthesis filter bank, which is an important processing block in the decoding stage, and the analysis filter bank, which is an important processing block in the encoding stage. This thesis presents methods for efficient implementations of filter banks and audio transcoders, and is separated into two main parts. In the first part, a new class of Frequency Response Masking (FRM) filter banks is introduced. These filter banks are usually characterized by comprising a tree-structured cascade of subfilters, which have small individual filter lengths. Methods of complexity reduction are proposed for the scenarios when the filter banks are operated in single-rate mode, and when they are operated in multirate mode; and for the scenarios when the input signal is real-valued, and when it is complex-valued. An efficient variable bandwidth FRM filter bank is designed by using signed-powers-of-two reduction of its subfilter coefficients. Our design has a complexity an order lower than that of an octave filter bank with the same specifications. In the second part, the audio transcoding process is analyzed. Audio transcoding is modeled as a cascaded quantization process, and the cascaded quantization of an input signal is analyzed under different conditions, for the MPEG 1 Layer 2 and MP3 compression methods. One condition is the input-to-output delay of the transcoder, which is known to have an impact on the audio quality of the transcoded material. Methods to reduce the error in a cascaded quantization process are also proposed. An ultra-fast MP3 transcoder that requires only integer operations is proposed and implemented in software. Our implementation shows an improvement by a factor of 5 to 16 over other best known transcoders in terms of execution speed

Low Complexity Multiplier-less Modified FRM Filter Bank using MPGBP Algorithm

The design of a low complexity multiplier-less narrow transition band filter bank for the channelizer of multi-standard software-defined radio (SDR) is investigated in this paper. To accomplish this, the modal filter and complementary filter in the upper and lower branches of the conventional Frequency Response Masking (FRM) architecture are replaced with two power-complementary and linear phase filter banks. Secondly, a new masking strategy is proposed to fully exploit the potential of the numerous spectra replicas produced by the interpolation of the modal filter, which was previously ignored in the existing FRM design. In this scheme, the two masking filters are appropriately modulated and alternately masked over the spectra replicas from 0 to 2$\pi$, to generate even and odd channels. This Alternate Masking Scheme (AMS) increases the potency of the Modified FRM (ModFRM) architecture for the design of a computationally efficient narrow transition band uniform filter bank (termed as ModFRM-FB). Finally, by combining the adjoining ModFRM-FB channels, Non-Uniform ModFRM-FB (NUModFRM-FB) for extracting different communication standards in the SDR channelizer is created. To reduce the total power consumption of the architecture, the coefficients of the proposed system are made multiplier-less using the Matching Pursuits Generalized Bit-Planes (MPGBP) algorithm. In this method, filter coefficients are successively approximated using a dictionary of vectors to give a sum-of-power-of-two (SOPOT) representation. In comparison to all other general optimization techniques, such as genetic algorithms, the suggested design method stands out for its ease of implementation, requiring no sophisticated optimization or exhaustive search schemes. Another notable feature of the suggested approach is that, in comparison to existing methods, the design time for approximation has been greatly reduced. To further bring down the complexity, adders are reused in recurrent SOPOT terms using the Common Sub-expression Elimination (CSE) technique without compromising the filter performance

A System Approach to the Design of Multirate Filter Banks.

This dissertation studies the design of multirate filter banks by adopting a so-called system approach. The design issue of Johnston\u27s method is first investigated in which an explicit expression of the reconstruction error is derived using Lyapunov stability theory, and new convergent iterative algorithms are proposed through non-linear optimization. The results are extended to the two-dimensional filter banks. The design issue of more general multirate filter banks is also investigated through model matching method. Using standard results from modern control theory, new design algorithms are developed which minimize the reconstruction error while completely eliminating the aliasing error. State-space realizations, inner-outer factorizations, and optimal Hankel norm approximation are used to reduce the complexity of computation and improve the accuracy of the proposed design algorithms