Computation of the para-pseudoinverse for oversampled filter banks: Forward and backward Greville formulas

This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Frames and oversampled filter banks have been extensively studied over the past few years due to their increased design freedom and improved error resilience. In frame expansions, the least square signal reconstruction operator is called the dual frame, which can be obtained by choosing the synthesis filter bank as the para-pseudoinverse of the analysis bank. In this paper, we study the computation of the dual frame by exploiting the Greville formula, which was originally derived in 1960 to compute the pseudoinverse of a matrix when a new row is appended. Here, we first develop the backward Greville formula to handle the case of row deletion. Based on the forward Greville formula, we then study the computation of para-pseudoinverse for extended filter banks and Laplacian pyramids. Through the backward Greville formula, we investigate the frame-based error resilient transmission over erasure channels. The necessary and sufficient condition for an oversampled filter bank to be robust to one erasure channel is derived. A postfiltering structure is also presented to implement the para-pseudoinverse when the transform coefficients in one subband are completely lost

Unified Theory for Biorthogonal Modulated Filter Banks

Modulated filter banks (MFBs) are practical signal decomposition tools for M -channel multirate systems. They combine high subfilter selectivity with efficient realization based on polyphase filters and block transforms. Consequently, the O(M 2 ) burden of computations in a general filter bank (FB) is reduced to O(M log2 M ) - the latter being a complexity order comparable with the FFT-like transforms.Often hiding from the plain sight, these versatile digital signal processing tools have important role in various professional and everyday life applications of information and communications technology, including audiovisual communications and media storage (e.g., audio codecs for low-energy music playback in portable devices, as well as communication waveform processing and channelization). The algorithmic efficiency implies low cost, small size, and extended battery life, bringing the devices close to our skins.The main objective of this thesis is to formulate a generalized and unified approach to the MFBs, which includes, in addition to the deep theoretical background behind these banks, both their design by using appropriate optimization techniques and efficient algorithmic realizations. The FBs discussed in this thesis are discrete-time time-frequency decomposition/reconstruction, or equivalently, analysis-synthesis systems, where the subfilters are generated through modulation from either a single or two prototype filters. The perfect reconstruction (PR) property is a particularly important characteristics of the MFBs and this is the core theme of this thesis. In the presented biorthogonal arbitrary-delay exponentially modulated filter bank (EMFB), the PR property can be maintained also for complex-valued signals.The EMFB concept is quite flexible, since it may respond to the various requirements given to a subband processing system: low-delay PR prototype design, subfilters having symmetric impulse responses, efficient algorithms, and the definition covers odd and even-stacked cosine-modulated FBs as special cases. Oversampling schemes for the subsignals prove out to be advantageous in subband processing problems requiring phase information about the localized frequency components. In addition, the MFBs have strong connections with the lapped transform (LT) theory, especially with the class of LTs grounded in parametric window functions.<br/

Filtered Multicarrier Transmission

Orthogonal frequency‐division multiplexing (OFDM) has been adopted as the waveform of choice in the existing and emerging broadband wireless communication systems for a number of advantages it can offer. Nevertheless, investigations of more advanced multicarrier transmission schemes have continued with the aim of eliminating or mitigating its essential limitations. This article discusses multicarrier schemes with enhanced spectrum localization, which manage to reduce the spectral sidelobes of plain OFDM that are problematic in various advanced communication scenarios. These include schemes for enhancing the OFDM waveform characteristics through additional signal processing as well as filter‐bank multicarrier (FBMC) waveforms utilizing frequency‐selective filter banks instead of plain (inverse) discrete Fourier transform processing for waveform generation and demodulation.acceptedVersionPeer reviewe

Low-Complexity Multicarrier Waveform Processing Schemes fo Future Wireless Communications

Wireless communication systems deliver enormous variety of services and applications. Nowa- days, wireless communications play a key-role in many fields, such as industry, social life, education, and home automation. The growing demand for wireless services and applications has motivated the development of the next generation cellular radio access technology called fifth-generation new radio (5G-NR). The future networks are required to magnify the delivered user data rates to gigabits per second, reduce the communication latency below 1 ms, and en- able communications for massive number of simple devices. Those main features of the future networks come with new demands for the wireless communication systems, such as enhancing the efficiency of the radio spectrum use at below 6 GHz frequency bands, while supporting various services with quite different requirements for the waveform related key parameters. The current wireless systems lack the capabilities to handle those requirements. For exam- ple, the long-term evolution (LTE) employs the cyclic-prefix orthogonal frequency-division multiplexing (CP-OFDM) waveform, which has critical drawbacks in the 5G-NR context. The basic drawback of CP-OFDM waveform is the lack of spectral localization. Therefore, spectrally enhanced variants of CP-OFDM or other multicarrier waveforms with well localized spectrum should be considered. This thesis investigates spectrally enhanced CP-OFDM (E-OFDM) schemes to suppress the out-of-band (OOB) emissions, which are normally produced by CP-OFDM. Commonly, the weighted overlap-and-add (WOLA) scheme applies smooth time-domain window on the CP- OFDM waveform, providing spectrally enhanced subcarriers and reducing the OOB emissions with very low additional computational complexity. Nevertheless, the suppression perfor- mance of WOLA-OFDM is not sufficient near the active subband. Another technique is based on filtering the CP-OFDM waveform, which is referred to as F-OFDM. F-OFDM is able to provide well-localized spectrum, however, with significant increase in the computational com- plexity in the basic scheme with time-domain filters. Also filter-bank multicarrier (FBMC) waveforms are included in this study. FBMC has been widely studied as a potential post- OFDM scheme with nearly ideal subcarrier spectrum localization. However, this scheme has quite high computational complexity while being limited to uniformly distributed sub- bands. Anyway, filter-bank based waveform processing is one of the main topics of this work. Instead of traditional polyphase network (PPN) based uniform filter banks, the focus is on fast-convolution filter banks (FC-FBs), which utilize fast Fourier transform (FFT) domain processing to realize effectively filter-banks with high flexibility in terms of subcarrier bandwidths and center frequencies. FC-FBs are applied for both FBMC and F-OFDM waveform genera- tion and processing with greatly increased flexibility and significantly reduced computational complexity. This study proposes novel structures for FC-FB processing based on decomposition of the FC-FB structure consisting of forward and inverse discrete Fourier transforms (DFT and IDFT). The decomposition of multirate FC provides means of reducing the computational complexity in some important specific scenarios. A generic FC decomposition model is proposed and analyzed. This scheme is mathematically equivalent to the corresponding direct FC imple- mentation, with exactly the same performance. The benefits of the optimized decomposition structure appear mainly in communication scenarios with relatively narrow active transmis- sion band, resulting in significantly reduced computational complexity compared to the direct FC structure. The narrowband scenarios find their places in the recent 3GPP specification of cellular low- power wide-area (LPWA) access technology called narrowband internet-of-things (NB-IoT). NB-IoT aims at introducing the IoT to LTE and GSM frequency bands in coexistence with those technologies. NB-IoT uses CP-OFDM based waveforms with parameters compatible with the LTE. However, additional means are needed also for NB-IoT transmitters to improve the spec- trum localization. For NB-IoT user devices, it is important to consider ultra-low complexity solutions, and a look-up table (LUT) based approach is proposed to implement NB-IoT uplink transmitters with filtered waveforms. This approach provides completely multiplication-free digital baseband implementations and the addition rates are similar or smaller than in the basic NB-IoT waveform generation without the needed elements for spectrum enhancement. The basic idea includes storing full or partial waveforms for all possible data symbol combinations. Then the transmitted waveform is composed through summation of needed stored partial waveforms and trivial phase rotations. The LUT based scheme is developed with different vari- ants tackling practical implementations issues of NB-IoT device transmitters, considering also the effects of nonlinear power amplifier. Moreover, a completely multiplication and addition- free LUT variant is proposed and found to be feasible for very narrowband transmission, with up to 3 subcarriers. The finite-wordlength performance of LUT variants is evaluated through simulations

Efficient Multiband Algorithms for Blind Source Separation

The problem of blind separation refers to recovering original signals, called source signals, from the mixed signals, called observation signals, in a reverberant environment. The mixture is a function of a sequence of original speech signals mixed in a reverberant room. The objective is to separate mixed signals to obtain the original signals without degradation and without prior information of the features of the sources. The strategy used to achieve this objective is to use multiple bands that work at a lower rate, have less computational cost and a quicker convergence than the conventional scheme. Our motivation is the competitive results of unequal-passbands scheme applications, in terms of the convergence speed. The objective of this research is to improve unequal-passbands schemes by improving the speed of convergence and reducing the computational cost. The first proposed work is a novel maximally decimated unequal-passbands scheme.This scheme uses multiple bands that make it work at a reduced sampling rate, and low computational cost. An adaptation approach is derived with an adaptation step that improved the convergence speed. The performance of the proposed scheme was measured in different ways. First, the mean square errors of various bands are measured and the results are compared to a maximally decimated equal-passbands scheme, which is currently the best performing method. The results show that the proposed scheme has a faster convergence rate than the maximally decimated equal-passbands scheme. Second, when the scheme is tested for white and coloured inputs using a low number of bands, it does not yield good results; but when the number of bands is increased, the speed of convergence is enhanced. Third, the scheme is tested for quick changes. It is shown that the performance of the proposed scheme is similar to that of the equal-passbands scheme. Fourth, the scheme is also tested in a stationary state. The experimental results confirm the theoretical work. For more challenging scenarios, an unequal-passbands scheme with over-sampled decimation is proposed; the greater number of bands, the more efficient the separation. The results are compared to the currently best performing method. Second, an experimental comparison is made between the proposed multiband scheme and the conventional scheme. The results show that the convergence speed and the signal-to-interference ratio of the proposed scheme are higher than that of the conventional scheme, and the computation cost is lower than that of the conventional scheme

Comparative study and performance evaluation of MC-CDMA and OFDM over AWGN and fading channels environment

Η απαίτηση για εφαρμογές υψηλής ταχύτητας μετάδοσης δεδομένων έχει αυξηθεί σημαντικά τα τελευταία χρόνια. Η πίεση των χρηστών σήμερα για ταχύτερες επικοινωνίες, ανεξαρτήτως κινητής ή σταθερής, χωρίς επιπλέον κόστος είναι μια πραγματικότητα. Για να πραγματοποιηθούν αυτές οι απαιτήσεις, προτάθηκε ένα νέο σχήμα που συνδυάζει ψηφιακή διαμόρφωση και πολλαπλές προσβάσεις, για την ακρίβεια η Πολλαπλή Πρόσβαση με διαίρεση Κώδικα Πολλαπλού Φέροντος (Multi-Carrier Code Division Multiple Access MC-CDMA). Η εφαρμογή του Γρήγορου Μετασχηματισμού Φουριέ (Fast Fourier Transform,FFT) που βασίζεται στο (Orthogonal Frequency Division Multiplexing, OFDM) χρησιμοποιεί τις περίπλοκες λειτουργίες βάσεως και αντικαθίσταται από κυματομορφές για να μειώσει το επίπεδο της παρεμβολής. Έχει βρεθεί ότι οι μετασχηματισμένες κυματομορφές (Wavelet Transform,W.T.) που βασίζονται στον Haar είναι ικανές να μειώσουν το ISI και το ICI, που προκαλούνται από απώλειες στην ορθογωνιότητα μεταξύ των φερόντων, κάτι που τις καθιστά απλούστερες για την εφαρμογή από του FFT. Επιπλέον κέρδος στην απόδοση μπορεί να επιτευχθεί αναζητώντας μια εναλλακτική λειτουργία ορθογωνικής βάσης και βρίσκοντας ένα καλύτερο μετασχηματισμό από του Φουριέ (Fourier) και τον μετασχηματισμό κυματομορφής (Wavelet Transform). Στην παρούσα εργασία, υπάρχουν τρία προτεινόμενα μοντέλα. Το 1ο, ( A proposed Model ‘1’ of OFDM based In-Place Wavelet Transform), το 2ο, A proposed Model ‘2’ based In-Place Wavelet Transform Algorithm and Phase Matrix (P.M) και το 3ο, A proposed Model ‘3’ of MC-CDMA Based on Multiwavelet Transform. Οι αποδόσεις τους συγκρίθηκαν με τα παραδοσιακά μοντέλα μονού χρήστη κάτω από διαφορετικά κανάλια (Κανάλι AWGN, επίπεδη διάλειψη και επιλεκτική διάλειψη).The demand for high data rate wireless multi-media applications has increased significantly in the past few years. The wireless user’s pressure towards faster communications, no matter whether mobile, nomadic, or fixed positioned, without extra cost is nowadays a reality. To fulfill these demands, a new scheme which combines wireless digital modulation and multiple accesses was proposed in the recent years, namely, Multicarrier-Code Division Multiple Access (MC-CDMA). The Fourier based OFDM uses the complex exponential bases functions and it is replaced by wavelets in order to reduce the level of interference. It is found that the Haar-based wavelets are capable of reducing the ISI and ICI, which are caused by the loss in orthogonality between the carriers. Further performance gains can be made by looking at alternative orthogonal basis functions and finding a better transform rather than Fourier and wavelet transform. In this thesis, there are three proposed models [Model ‘1’ (OFDM based on In-Place Wavelet Transform, Model ‘2’ (MC-CDMA based on IP-WT and Phase Matrix) and Model ‘3’ (MC-CDMA based on Multiwavelet Transform)] were created and then comparison their performances with the traditional models for single user system were compared under different channel characteristics (AWGN channel, flat fading and selective fading). The conclusion of my study as follows, the models (1) was achieved much lower bit error rates than traditional models based FFT. Therefore these models can be considered as an alternative to the conventional MC-CDMA based FFT. The main advantage of using In-Place wavelet transform in the proposed models that it does not require an additional array at each sweep such as in ordered Fast Haar wavelet transform, which makes it simpler for implementation than FFT. The model (2) gave a new algorithm based on In-Place wavelet transform with first level processing multiple by PM was proposed. The model (3) gave much lower bit error than other two models in additional to traditional models

An Investigation of Orthogonal Wavelet Division Multiplexing Techniques as an Alternative to Orthogonal Frequency Division Multiplex Transmissions and Comparison of Wavelet Families and Their Children

Recently, issues surrounding wireless communications have risen to prominence because of the increase in the popularity of wireless applications. Bandwidth problems, and the difficulty of modulating signals across carriers, represent significant challenges. Every modulation scheme used to date has had limitations, and the use of the Discrete Fourier Transform in OFDM (Orthogonal Frequency Division Multiplex) is no exception. The restriction on further development of OFDM lies primarily within the type of transform it uses in the heart of its system, Fourier transform. OFDM suffers from sensitivity to Peak to Average Power Ratio, carrier frequency offset and wasting some bandwidth to guard successive OFDM symbols. The discovery of the wavelet transform has opened up a number of potential applications from image compression to watermarking and encryption. Very recently, work has been done to investigate the potential of using wavelet transforms within the communication space. This research will further investigate a recently proposed, innovative, modulation technique, Orthogonal Wavelet Division Multiplex, which utilises the wavelet transform opening a new avenue for an alternative modulation scheme with some interesting potential characteristics. Wavelet transform has many families and each of those families has children which each differ in filter length. This research consider comprehensively investigates the new modulation scheme, and proposes multi-level dynamic sub-banding as a tool to adapt variable signal bandwidths. Furthermore, all compactly supported wavelet families and their associated children of those families are investigated and evaluated against each other and compared with OFDM. The linear computational complexity of wavelet transform is less than the logarithmic complexity of Fourier in OFDM. The more important complexity is the operational complexity which is cost effectiveness, such as the time response of the system, the memory consumption and the number of iterative operations required for data processing. Those complexities are investigated for all available compactly supported wavelet families and their children and compared with OFDM. The evaluation reveals which wavelet families perform more effectively than OFDM, and for each wavelet family identifies which family children perform the best. Based on these results, it is concluded that the wavelet modulation scheme has some interesting advantages over OFDM, such as lower complexity and bandwidth conservation of up to 25%, due to the elimination of guard intervals and dynamic bandwidth allocation, which result in better cost effectiveness

Global and Local Uncertainty Principles for Signals on Graphs

Uncertainty principles such as Heisenberg's provide limits on the time-frequency concentration of a signal, and constitute an important theoretical tool for designing and evaluating linear signal transforms. Generalizations of such principles to the graph setting can inform dictionary design for graph signals, lead to algorithms for reconstructing missing information from graph signals via sparse representations, and yield new graph analysis tools. While previous work has focused on generalizing notions of spreads of a graph signal in the vertex and graph spectral domains, our approach is to generalize the methods of Lieb in order to develop uncertainty principles that provide limits on the concentration of the analysis coefficients of any graph signal under a dictionary transform whose atoms are jointly localized in the vertex and graph spectral domains. One challenge we highlight is that due to the inhomogeneity of the underlying graph data domain, the local structure in a single small region of the graph can drastically affect the uncertainty bounds for signals concentrated in different regions of the graph, limiting the information provided by global uncertainty principles. Accordingly, we suggest a new way to incorporate a notion of locality, and develop local uncertainty principles that bound the concentration of the analysis coefficients of each atom of a localized graph spectral filter frame in terms of quantities that depend on the local structure of the graph around the center vertex of the given atom. Finally, we demonstrate how our proposed local uncertainty measures can improve the random sampling of graph signals