HIGH PERFORMANCE, LOW COST SUBSPACE DECOMPOSITION AND POLYNOMIAL ROOTING FOR REAL TIME DIRECTION OF ARRIVAL ESTIMATION: ANALYSIS AND IMPLEMENTATION

This thesis develops high performance real-time signal processing modules for direction of arrival (DOA) estimation for localization systems. It proposes highly parallel algorithms for performing subspace decomposition and polynomial rooting, which are otherwise traditionally implemented using sequential algorithms. The proposed algorithms address the emerging need for real-time localization for a wide range of applications. As the antenna array size increases, the complexity of signal processing algorithms increases, making it increasingly difficult to satisfy the real-time constraints. This thesis addresses real-time implementation by proposing parallel algorithms, that maintain considerable improvement over traditional algorithms, especially for systems with larger number of antenna array elements. Singular value decomposition (SVD) and polynomial rooting are two computationally complex steps and act as the bottleneck to achieving real-time performance. The proposed algorithms are suitable for implementation on field programmable gated arrays (FPGAs), single instruction multiple data (SIMD) hardware or application specific integrated chips (ASICs), which offer large number of processing elements that can be exploited for parallel processing. The designs proposed in this thesis are modular, easily expandable and easy to implement. Firstly, this thesis proposes a fast converging SVD algorithm. The proposed method reduces the number of iterations it takes to converge to correct singular values, thus achieving closer to real-time performance. A general algorithm and a modular system design are provided making it easy for designers to replicate and extend the design to larger matrix sizes. Moreover, the method is highly parallel, which can be exploited in various hardware platforms mentioned earlier. A fixed point implementation of proposed SVD algorithm is presented. The FPGA design is pipelined to the maximum extent to increase the maximum achievable frequency of operation. The system was developed with the objective of achieving high throughput. Various modern cores available in FPGAs were used to maximize the performance and details of these modules are presented in detail. Finally, a parallel polynomial rooting technique based on Newton’s method applicable exclusively to root-MUSIC polynomials is proposed. Unique characteristics of root-MUSIC polynomial’s complex dynamics were exploited to derive this polynomial rooting method. The technique exhibits parallelism and converges to the desired root within fixed number of iterations, making this suitable for polynomial rooting of large degree polynomials. We believe this is the first time that complex dynamics of root-MUSIC polynomial were analyzed to propose an algorithm. In all, the thesis addresses two major bottlenecks in a direction of arrival estimation system, by providing simple, high throughput, parallel algorithms

Towards Low Latency and Resource-Efficient FPGA Implementations of the MUSIC Algorithm for Direction of Arrival Estimation

The estimation of the Direction of Arrival (DoA) is one of the most critical parameters for target recognition, identification and classification. MUltiple SIgnal Classification (MUSIC) is a powerful technique for DoA estimation. The algorithm requires complex mathematical operations like the computation of the covariance matrix for the input signals, eigenvalue decomposition and signal peak search. All these signal processing operations make real-time and resource-efficient implementation of the MUSIC algorithm on Field Programmable Gate Arrays (FPGAs) a challenge. In this paper, a novel design approach is proposed for the FPGA-implementation of the MUSIC algorithm. This approach enables a significant reduction in both FPGA resources and latency. In more detail, the proposed design enables the estimation of DoA in real-time scenarios in 2μ sec with 30% to 50% fewer resources as compared to existing techniques.The work of Pedro Reviriego was supported in part by the Architecting Intelligent Cost-effective Central Offices to enable 5G Tactile Internet (ACHILLES) through the Spanish Ministry of Economy and Competitivity under Project PID2019-104207RB-I00, in part by the Madrid Government (Comunidad de Madrid-Spain) through the Multiannual Agreement with Universidad Carlos III de Madrid (UC3M) in the line of Excellence of University Professors under Grant EPUC3M21, and in part by the Context of the V Plan Regional de Investigación Científica e Innovación Tecnológica (V PRICIT) (Regional Program of Research and Technological Innovation)

A covariance matrix reconstruction approach for single snapshot direction of arrival estimation

Achieving accurate single snapshot direction of arrival (DOA) information significantly improves communication performance. This paper investigates an accurate and high-resolution DOA estimation technique by enabling single snapshot data collection and enhancing DOA estimation results compared to multiple snapshot methods. This is carried out by manipulating the incoming signal covariance matrix while suppressing undesired additive white Gaussian noise (AWGN) by actively updating and estimating the antenna array manifold vector. We demonstrated the estimation performance in simulation that our proposed technique supersedes the estimation performance of existing state-of-the-art techniques in various signal-to-noise ratio (SNR) scenarios and single snapshot sampling environments. Our proposed covariance-based single snapshot (CbSS) technique yields the lowest root-mean-squared error (RMSE) against the true DOA compared to root-MUSIC and the partial relaxation (PR) approach for multiple snapshots and a single signal source environment. In addition, our proposed technique presents the lowest DOA estimation performance degradation in a multiple uncorrelated and coherent signal source environment by up to 25.5% with nearly negligible bias. Lastly, our proposed CbSS technique presents the best DOA estimation results for a single snapshot and single-source scenario with an RMSE of 0.05° against the true DOA compared to root-MUSIC and the PR approach with nearly negligible bias as well. A potential application for CbSS would be in a scenario where accurate DOA estimation with a small antenna array form factor is a limitation, such as in the intelligent transportation system industry and wireless communication

A tutorial on the characterisation and modelling of low layer functional splits for flexible radio access networks in 5G and beyond

The centralization of baseband (BB) functions in a radio access network (RAN) towards data processing centres is receiving increasing interest as it enables the exploitation of resource pooling and statistical multiplexing gains among multiple cells, facilitates the introduction of collaborative techniques for different functions (e.g., interference coordination), and more efficiently handles the complex requirements of advanced features of the fifth generation (5G) new radio (NR) physical layer, such as the use of massive multiple input multiple output (MIMO). However, deciding the functional split (i.e., which BB functions are kept close to the radio units and which BB functions are centralized) embraces a trade-off between the centralization benefits and the fronthaul costs for carrying data between distributed antennas and data processing centres. Substantial research efforts have been made in standardization fora, research projects and studies to resolve this trade-off, which becomes more complicated when the choice of functional splits is dynamically achieved depending on the current conditions in the RAN. This paper presents a comprehensive tutorial on the characterisation, modelling and assessment of functional splits in a flexible RAN to establish a solid basis for the future development of algorithmic solutions of dynamic functional split optimisation in 5G and beyond systems. First, the paper explores the functional split approaches considered by different industrial fora, analysing their equivalences and differences in terminology. Second, the paper presents a harmonized analysis of the different BB functions at the physical layer and associated algorithmic solutions presented in the literature, assessing both the computational complexity and the associated performance. Based on this analysis, the paper presents a model for assessing the computational requirements and fronthaul bandwidth requirements of different functional splits. Last, the model is used to derive illustrative results that identify the major trade-offs that arise when selecting a functional split and the key elements that impact the requirements.This work has been partially funded by Huawei Technologies. Work by X. Gelabert and B. Klaiqi is partially funded by the European Union's Horizon Europe research and innovation programme (HORIZON-MSCA-2021-DN-0) under the Marie Skłodowska-Curie grant agreement No 101073265. Work by J. Perez-Romero and O. Sallent is also partially funded by the Smart Networks and Services Joint Undertaking (SNS JU) under the European Union’s Horizon Europe research and innovation programme under Grant Agreements No. 101096034 (VERGE project) and No. 101097083 (BeGREEN project) and by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 under ARTIST project (ref. PID2020-115104RB-I00). This last project has also funded the work by D. Campoy.Peer ReviewedPostprint (author's final draft

Preconditioners for iterative solutions of large-scale linear systems arising from Biot's consolidation equations

Ph.DDOCTOR OF PHILOSOPH

Rake, Peel, Sketch:The Signal Processing Pipeline Revisited

The prototypical signal processing pipeline can be divided into four blocks. Representation of the signal in a basis suitable for processing. Enhancement of the meaningful part of the signal and noise reduction. Estimation of important statistical properties of the signal. Adaptive processing to track and adapt to changes in the signal statistics. This thesis revisits each of these blocks and proposes new algorithms, borrowing ideas from information theory, theoretical computer science, or communications. First, we revisit the Walsh-Hadamard transform (WHT) for the case of a signal sparse in the transformed domain, namely that has only K †N non-zero coefficients. We show that an efficient algorithm exists that can compute these coefficients in O(K log2(K) log2(N/K)) and using only O(K log2(N/K)) samples. This algorithm relies on a fast hashing procedure that computes small linear combinations of transformed domain coefficients. A bipartite graph is formed with linear combinations on one side, and non-zero coefficients on the other. A peeling decoder is then used to recover the non-zero coefficients one by one. A detailed analysis of the algorithm based on error correcting codes over the binary erasure channel is given. The second chapter is about beamforming. Inspired by the rake receiver from wireless communications, we recognize that echoes in a room are an important source of extra signal diversity. We extend several classic beamforming algorithms to take advantage of echoes and also propose new optimal formulations. We explore formulations both in time and frequency domains. We show theoretically and in numerical simulations that the signal-to-interference-and-noise ratio increases proportionally to the number of echoes used. Finally, beyond objective measures, we show that echoes also directly improve speech intelligibility as measured by the perceptual evaluation of speech quality (PESQ) metric. Next, we attack the problem of direction of arrival of acoustic sources, to which we apply a robust finite rate of innovation reconstruction framework. FRIDA â the resulting algorithm â exploits wideband information coherently, works at very low signal-to-noise ratio, and can resolve very close sources. The algorithm can use either raw microphone signals or their cross- correlations. While the former lets us work with correlated sources, the latter creates a quadratic number of measurements that allows to locate many sources with few microphones. Thorough experiments on simulated and recorded data shows that FRIDA compares favorably with the state-of-the-art. We continue by revisiting the classic recursive least squares (RLS) adaptive filter with ideas borrowed from recent results on sketching least squares problems. The exact update of RLS is replaced by a few steps of conjugate gradient descent. We propose then two different precondi- tioners, obtained by sketching the data, to accelerate the convergence of the gradient descent. Experiments on artificial as well as natural signals show that the proposed algorithm has a performance very close to that of RLS at a lower computational burden. The fifth and final chapter is dedicated to the software and hardware tools developed for this thesis. We describe the pyroomacoustics Python package that contains routines for the evaluation of audio processing algorithms and reference implementations of popular algorithms. We then give an overview of the microphone arrays developed

Modeling flocculation and deflocculation processes of cohesive sediments

The transport and fate of cohesive sediments are responsible for many engineering, environmental, economic and policy issues that relate to, for example, siltation and dredging in navigation channels, water quality, water turbidity, pollutant transports, and biological ecosystem responses. Our current understanding, however, is insufficient to conduct accurate quantitative predictions of these processes. This is because the cohesive particles in natural waters will flocculate, which determines the settling, and thus the deposition behaviors. The simulation of flocculation processes is a primary challenge since the time variation of Floc Size Distribution (FSD) is controlled by a partial differential equation that also contains the integration of FSD itself. Previous models either address less characteristic sizes, which produce biased FSDs, or are incapable of modeling a relative large study domain in order to better express the FSDs with more size groups. In this study, a cohesive sediment flocculation model developed based on the framework of Population Balance Model (PBM) is solved by the Quadrature Method of Moments (QMOM). This PBM�QMOM flocculation model has reasonably compromised by both the model robustness and model efficiency. The former lies in the capability of describing the time evolution of the FSDs with a maximum of eight size classes, and the latter is reflected in its efficiency to solve PBM with transport terms and the potential to be coupled in a flow-mud estuary model. The model predictions are compared to both the analytical (or trusted class method) results for general PBMs (i.e., beyond the scope of specific research field), and the published experimental results of kaolinite suspension and colloidal montmorillonite. After that, an experimental activity has been carried out to develop a Sony NEX-5R camera system (with extension tubes and close-up) to automatically acquire floc images under various controlled environments, and to use MATLAB software to process the FSDs. This process is validated by the results of two set of sample particles. The validated camera system is first applied in a five liter mixing chamber to investigate the effects of salinity and selected organic matters on kaolinite flocculation. Then, the camera system is improved and assembled in a waterproof house for underwater use to provide data for a conceptual one-dimensional application in a relatively large turbulence tank. The flow field of the tank is measured by an acoustic Doppler velocimetry. The flocculation processes in the mixing chamber or cylindrical tank are modeled by PBM�QMOM and validated by camera statistical FSDs. While chemical and biological effects are not explicitly included in PBM�QMOM (implicitly included in fitting parameters) at this time to address the basic mechanisms of flocculation, these effects can be further extended when the process itself is better understood through other laboratory experiments or field measurements

Array processing based on time-frequency analysis and higher-order statistics

Ph.DDOCTOR OF PHILOSOPH