232 research outputs found
On the Factor Refinement Principle and its Implementation on Multicore Architectures
The factor refinement principle turns a partial factorization of integers (or polynomi als) into a more complete factorization represented by basis elements and exponents, with basis elements that are pairwise coprime.
There are lots of applications of this refinement technique such as simplifying systems of polynomial inequations and, more generally, speeding up certain algebraic algorithms by eliminating redundant expressions that may occur during intermediate computations.
Successive GCD computations and divisions are used to accomplish this task until all the basis elements are pairwise coprime. Moreover, square-free factorization (which is the first step of many factorization algorithms) is used to remove the repeated patterns from each input element. Differentiation, division and GCD calculation op erations are required to complete this pre-processing step. Both factor refinement and square-free factorization often rely on plain (quadratic) algorithms for multipli cation but can be substantially improved with asymptotically fast multiplication on sufficiently large input.
In this work, we review the working principles and complexity estimates of the factor refinement, in case of plain arithmetic, as well as asymptotically fast arithmetic. Following this review process, we design, analyze and implement parallel adaptations of these factor refinement algorithms. We consider several algorithm optimization techniques such as data locality analysis, balancing subproblems, etc. to fully exploit modern multicore architectures. The Cilk++ implementation of our parallel algorithm based on the augment refinement principle of Bach, Driscoll and Shallit achieves linear speedup for input data of sufficiently large size
Augmented Multi-Subarray Dilated Nested Array with Enhanced Degrees of Freedom and Reduced Mutual Coupling
Sparse linear arrays (SLAs) can be designed in a systematic way, with the ability for underdetermined DOA estimation where a greater number of sources can be detected than that of sensors. In this paper, as the first stage, a new systematic design named multi-subarray dilated nested array (MDNA), whose difference co-array (DCA) can be proved to be hole-free, is firstly proposed by introducing a sparse ULA and multiple identical dense ULAs with appropriate sub-ULA spacings. The MDNA will degenerate into the nested array under specific conditions, and the uniform degrees of freedom (uDOFs) of MDNA is larger than that of its parent nested array. On the basis of MDNA, to reduce the mutual coupling effect, an augmented multi-subarray dilated nested array (AMDNA) is constructed by migrating some elements of the dense segments of MDNA, without reducing the number of uDOFs. Several theoretical properties of the proposed array structures are proved, and simulation results are provided to demonstrate the effectiveness and superiority of the proposed AMDNA over some existing sparse arrays
Theory and Algorithms for Reliable Multimodal Data Analysis, Machine Learning, and Signal Processing
Modern engineering systems collect large volumes of data measurements across diverse sensing modalities. These measurements can naturally be arranged in higher-order arrays of scalars which are commonly referred to as tensors. Tucker decomposition (TD) is a standard method for tensor analysis with applications in diverse fields of science and engineering. Despite its success, TD exhibits severe sensitivity against outliers —i.e., heavily corrupted entries that appear sporadically in modern datasets. We study L1-norm TD (L1-TD), a reformulation of TD that promotes robustness. For 3-way tensors, we show, for the first time, that L1-TD admits an exact solution via combinatorial optimization and present algorithms for its solution. We propose two novel algorithmic frameworks for approximating the exact solution to L1-TD, for general N-way tensors. We propose a novel algorithm for dynamic L1-TD —i.e., efficient and joint analysis of streaming tensors. Principal-Component Analysis (PCA) (a special case of TD) is also outlier responsive. We consider Lp-quasinorm PCA (Lp-PCA) for
Multi-source parameter estimation and tracking using antenna arrays
This thesis is concerned with multi-source parameter estimation and tracking using antenna arrays in wireless communications. Various multi-source parameter estimation and tracking algorithms are presented and evaluated.
Firstly, a novel multiple-input multiple-output (MIMO) communication system is proposed for multi-parameter channel estimation. A manifold extender is presented for increasing the degrees of freedom (DoF). The proposed approach utilises the extended manifold vectors together with superresolution subspace type algorithms, to achieve the estimation of delay, direction of departure (DOD) and direction of arrival (DOA) of all the paths of the desired user in the presence of multiple access interference (MAI).
Secondly, the MIMO system is extended to a virtual-spatiotemporal system by incorporating the temporal domain of the system towards the objective of further increasing the degrees of freedom. In this system, a multi-parameter es-
timation of delay, Doppler frequency, DOD and DOA of the desired user, and a beamformer that suppresses the MAI are presented, by utilising the proposed virtual-spatiotemporal manifold extender and the superresolution subspace type
algorithms.
Finally, for multi-source tracking, two tracking approaches are proposed based on an arrayed Extended Kalman Filter (arrayed-EKF) and an arrayed Unscented Kalman Filter (arrayed-UKF) using two type of antenna arrays: rigid array and
flexible array. If the array is rigid, the proposed approaches employ a spatiotemporal state-space model and a manifold extender to track the source parameters, while if it is flexible the array locations are also tracked simultaneously.
Throughout the thesis, computer simulation studies are presented to investigate and evaluate the performance of all the proposed algorithms.Open Acces
Antenna Systems
This book offers an up-to-date and comprehensive review of modern antenna systems and their applications in the fields of contemporary wireless systems. It constitutes a useful resource of new material, including stochastic versus ray tracing wireless channel modeling for 5G and V2X applications and implantable devices. Chapters discuss modern metalens antennas in microwaves, terahertz, and optical domain. Moreover, the book presents new material on antenna arrays for 5G massive MIMO beamforming. Finally, it discusses new methods, devices, and technologies to enhance the performance of antenna systems
Integrated Sensing and Communications: Recent Advances and Ten Open Challenges
It is anticipated that integrated sensing and communications (ISAC) would be
one of the key enablers of next-generation wireless networks (such as beyond 5G
(B5G) and 6G) for supporting a variety of emerging applications. In this paper,
we provide a comprehensive review of the recent advances in ISAC systems, with
a particular focus on their foundations, system design, networking aspects and
ISAC applications. Furthermore, we discuss the corresponding open questions of
the above that emerged in each issue. Hence, we commence with the information
theory of sensing and communications (SC), followed by the
information-theoretic limits of ISAC systems by shedding light on the
fundamental performance metrics. Next, we discuss their clock synchronization
and phase offset problems, the associated Pareto-optimal signaling strategies,
as well as the associated super-resolution ISAC system design. Moreover, we
envision that ISAC ushers in a paradigm shift for the future cellular networks
relying on network sensing, transforming the classic cellular architecture,
cross-layer resource management methods, and transmission protocols. In ISAC
applications, we further highlight the security and privacy issues of wireless
sensing. Finally, we close by studying the recent advances in a representative
ISAC use case, namely the multi-object multi-task (MOMT) recognition problem
using wireless signals.Comment: 26 pages, 22 figures, resubmitted to IEEE Journal. Appreciation for
the outstanding contributions of coauthors in the paper
- …