Arash Shahmansoori
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Arash Shahmansoori has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Gonzalo Seco-Granados
Department of Telecommunications and Systems Engineering, Universitat Autonoma de Barcelona, 08193 Barcelona, Spain
3 shared publications - Henk Wymeersch
Chalmers University of Technology
3 shared publications Giuseppe Destino
Oulun Yliopisto, Oulu, FI
2 shared publicationsBernard Uguen
Universite de Rennes 1, Rennes, Bretagne, FR
1 shared publication- Gabriel E. Garcia
Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden
1 shared publication - Utz Roedig
School of Computer Science and Information Technology (CSIT), University College Cork, Cork, Ireland
1 shared publication
Latest Publications
- Open Access
Concurrent Brainstorming & Hypothesis Satisfying: An Iterative Framework for Enhanced Retrieval-Augmented Generation (R2CBR3H-SR)
Addressing the complexity of comprehensive information retrieval, this study introduces an innovative, iterative retrieval-augmented generation system. Our approach uniquely integrates a vector-space driven re-ranking mechanism with concurrent brainstorming to expedite the retrieval of highly relevant documents, thereby streamlining the generation of potential queries. This sets the stage for our novel hybrid process, which synergistically combines hypothesis formulation with satisfying decision-making strategy to determine content adequacy, leveraging a chain of thought-based prompting technique. This unified hypothesize-satisfied phase intelligently distills information to ascertain whether user queries have been satisfactorily addressed. Upon reaching this criterion, the system refines its output into a concise representation, maximizing conceptual density with minimal verbosity. The iterative nature of the workflow enhances process efficiency and accuracy. Crucially, the concurrency within the brainstorming phase significantly accelerates recursive operations, facilitating rapid convergence to solution satisfaction. Compared to conventional methods, our system demonstrates a marked improvement in computational time and cost-effectiveness. This research advances the state-of-the-art in intelligent retrieval systems, setting a new benchmark for resource-efficient information extraction and abstraction in knowledge-intensive applications.
Open AccessConcurrent Brainstorming & Hypothesis Satisfying: An Iterative Framework for Enhanced Retrieval-Augmented Generation (R2CBR3H-SR)
Addressing the complexity of comprehensive information retrieval, this study introduces an innovative, iterative retrieval-augmented generation system. Our approach uniquely integrates a vector-space driven re-ranking mechanism with concurrent brainstorming to expedite the retrieval of highly relevant documents, thereby streamlining the generation of potential queries. This sets the stage for our novel hybrid process, which synergistically combines hypothesis formulation with satisfying decision-making strategy to determine content adequacy, leveraging a chain of thought-based prompting technique. This unified hypothesize-satisfied phase intelligently distills information to ascertain whether user queries have been satisfactorily addressed. Upon reaching this criterion, the system refines its output into a concise representation, maximizing conceptual density with minimal verbosity. The iterative nature of the workflow enhances process efficiency and accuracy. Crucially, the concurrency within the brainstorming phase significantly accelerates recursive operations, facilitating rapid convergence to solution satisfaction. Compared to conventional methods, our system demonstrates a marked improvement in computational time and cost-effectiveness. This research advances the state-of-the-art in intelligent retrieval systems, setting a new benchmark for resource-efficient information extraction and abstraction in knowledge-intensive applications.
- Open Access
- 3 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (12) , 18538-18552
Dynamic Recognition of Speakers for Consent Management by Contrastive Embedding Replay
Voice assistants overhear conversations, and a consent management mechanism is required. Consent management can be implemented using speaker recognition. Users that do not give consent enroll their voice, and all their further recordings are discarded. Building speaker recognition-based consent management is challenging as dynamic registration, removal, and reregistration of speakers must be efficiently handled. This work proposes a consent management system addressing the aforementioned challenges. A contrastive-based training is applied to learn the underlying speaker equivariance inductive bias. The contrastive features for buckets of speakers are trained a few steps into each iteration and act as replay buffers. These features are progressively selected using a multi-strided random sampler for classification. Moreover, new methods for dynamic registration using a portion of old utterances, removal, and reregistration of speakers are proposed. The results verify memory efficiency and dynamic capabilities of the proposed methods and outperform the existing approaches from the literature in terms of convergence rate and number of required parameters.
- 3 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (12) , 18538-18552
Open AccessDynamic Recognition of Speakers for Consent Management by Contrastive Embedding Replay
Voice assistants overhear conversations, and a consent management mechanism is required. Consent management can be implemented using speaker recognition. Users that do not give consent enroll their voice, and all their further recordings are discarded. Building speaker recognition-based consent management is challenging as dynamic registration, removal, and reregistration of speakers must be efficiently handled. This work proposes a consent management system addressing the aforementioned challenges. A contrastive-based training is applied to learn the underlying speaker equivariance inductive bias. The contrastive features for buckets of speakers are trained a few steps into each iteration and act as replay buffers. These features are progressively selected using a multi-strided random sampler for classification. Moreover, new methods for dynamic registration using a portion of old utterances, removal, and reregistration of speakers are proposed. The results verify memory efficiency and dynamic capabilities of the proposed methods and outperform the existing approaches from the literature in terms of convergence rate and number of required parameters.
- 14 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (6) , 871-874
Sparse Bayesian Multi-Task Learning of Time-Varying Massive MIMO Channels With Dynamic Filtering
Sparsity of channel in the next generation of wireless communication for massive multiple-input-multiple-output (MIMO) systems can be exploited to reduce the overhead in the training. The multi-task (MT)-sparse Bayesian learning (SBL) is applied for learning time-varying sparse channels in the uplink for multi-user massive MIMO orthogonal frequency division multiplexing systems. In particular, the dynamic information of the sparse channel is used to initialize the hyperparameters in the MT-SBL procedure for the next time step. Then, the expectation maximization based updates are applied to estimate the underlying parameters for different subcarriers. Through the simulation studies, it is observed that using the dynamic information from the previous time step considerably reduces the complexity and the required time for the convergence of MT-SBL algorithm with negligible sacrifice of the estimation accuracy. Finally, the power leakage is reduced due to considering angular refinement in the proposed algorithm.
- 14 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (6) , 871-874
Sparse Bayesian Multi-Task Learning of Time-Varying Massive MIMO Channels With Dynamic Filtering
Sparsity of channel in the next generation of wireless communication for massive multiple-input-multiple-output (MIMO) systems can be exploited to reduce the overhead in the training. The multi-task (MT)-sparse Bayesian learning (SBL) is applied for learning time-varying sparse channels in the uplink for multi-user massive MIMO orthogonal frequency division multiplexing systems. In particular, the dynamic information of the sparse channel is used to initialize the hyperparameters in the MT-SBL procedure for the next time step. Then, the expectation maximization based updates are applied to estimate the underlying parameters for different subcarriers. Through the simulation studies, it is observed that using the dynamic information from the previous time step considerably reduces the complexity and the required time for the convergence of MT-SBL algorithm with negligible sacrifice of the estimation accuracy. Finally, the power leakage is reduced due to considering angular refinement in the proposed algorithm.
- Open Access
Sparse Bayesian Multi-Task Learning of Time-Varying Massive MIMO Channels with Dynamic Filtering
Sparsity of channel in the next generation of wireless communication for massive multiple-input-multiple-output (MIMO) systems can be exploited to reduce the overhead in the training. The multitask (MT)-sparse Bayesian learning (SBL) is applied for learning time-varying sparse channels in the uplink for multi-user massive MIMO orthogonal frequency division multiplexing systems. In particular, the dynamic information of the sparse channel is used to initialize the hyperparameters in the MT-SBL procedure for the next time step. Then, the expectation maximization based updates are applied to estimate the underlying parameters for different subcarriers. Through the simulation studies, it is observed that using the dynamic information from the previous time step considerably reduces the complexity and the required time for the convergence of MT-SBL algorithm with negligible sacrificing of the estimation accuracy. Finally, the power leakage is reduced due to considering angular refinement in the proposed algorithm.
Open AccessSparse Bayesian Multi-Task Learning of Time-Varying Massive MIMO Channels with Dynamic Filtering
Sparsity of channel in the next generation of wireless communication for massive multiple-input-multiple-output (MIMO) systems can be exploited to reduce the overhead in the training. The multitask (MT)-sparse Bayesian learning (SBL) is applied for learning time-varying sparse channels in the uplink for multi-user massive MIMO orthogonal frequency division multiplexing systems. In particular, the dynamic information of the sparse channel is used to initialize the hyperparameters in the MT-SBL procedure for the next time step. Then, the expectation maximization based updates are applied to estimate the underlying parameters for different subcarriers. Through the simulation studies, it is observed that using the dynamic information from the previous time step considerably reduces the complexity and the required time for the convergence of MT-SBL algorithm with negligible sacrificing of the estimation accuracy. Finally, the power leakage is reduced due to considering angular refinement in the proposed algorithm.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 26 (8) , 1222-1226
Tracking Position and Orientation Through Millimeter Wave Lens MIMO in 5G Systems
Millimeter wave signals and large antenna arrays are considered enabling technologies for future 5G networks. Despite their benefits for achieving high data rate communications, their potential advantages for tracking of the location and rotation angle of the user terminals are not well investigated. A joint heuristic beam selection and user position and orientation tracking approach is proposed. First, the user location is tracked in the uplink by joint beam selection together with time-of-arrival (TOA) and angle-of-arrival (AOA) tracking at the base station (BS). Then, the user rotation angle is obtained using the location information by joint beam selection and tracking at the mobile station (MS). The beam selection, TOA and AOA tracking, at the BS and MS are performed during the data transmission phase. Numerical results demonstrate that the proposed method performs close to the estimated position and rotation angle in the training phase with reduced complexity and reduced number of required pilots for the estimation.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 26 (8) , 1222-1226
Tracking Position and Orientation Through Millimeter Wave Lens MIMO in 5G Systems
Millimeter wave signals and large antenna arrays are considered enabling technologies for future 5G networks. Despite their benefits for achieving high data rate communications, their potential advantages for tracking of the location and rotation angle of the user terminals are not well investigated. A joint heuristic beam selection and user position and orientation tracking approach is proposed. First, the user location is tracked in the uplink by joint beam selection together with time-of-arrival (TOA) and angle-of-arrival (AOA) tracking at the base station (BS). Then, the user rotation angle is obtained using the location information by joint beam selection and tracking at the mobile station (MS). The beam selection, TOA and AOA tracking, at the BS and MS are performed during the data transmission phase. Numerical results demonstrate that the proposed method performs close to the estimated position and rotation angle in the training phase with reduced complexity and reduced number of required pilots for the estimation.
- Top Cited Papers
- 27 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 17 (3) , 1822-1835
Position and Orientation Estimation Through Millimeter-Wave MIMO in 5G Systems
Millimeter-wave (mm-wave) signals and large antenna arrays are considered enabling technologies for future 5G networks. While their benefits for achieving high-data rate communications are well-known, their potential advantages for accurate positioning are largely undiscovered. We derive the Cramér-Rao bound (CRB) on position and rotation angle estimation uncertainty from mm-wave signals from a single transmitter, in the presence of scatterers. We also present a novel two-stage algorithm for position and rotation angle estimation that attains the CRB for average to high signal-to-noise ratio. The algorithm is based on multiple measurement vectors matching pursuit for coarse estimation, followed by a refinement stage based on the space-alternating generalized expectation maximization algorithm. We find that accurate position and rotation angle estimation is possible using signals from a single transmitter, in either line-of-sight, non-line-of-sight, or obstructed-line-of-sight conditions.
- 27 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 17 (3) , 1822-1835
Top Cited PapersPosition and Orientation Estimation Through Millimeter-Wave MIMO in 5G Systems
Millimeter-wave (mm-wave) signals and large antenna arrays are considered enabling technologies for future 5G networks. While their benefits for achieving high-data rate communications are well-known, their potential advantages for accurate positioning are largely undiscovered. We derive the Cramér-Rao bound (CRB) on position and rotation angle estimation uncertainty from mm-wave signals from a single transmitter, in the presence of scatterers. We also present a novel two-stage algorithm for position and rotation angle estimation that attains the CRB for average to high signal-to-noise ratio. The algorithm is based on multiple measurement vectors matching pursuit for coarse estimation, followed by a refinement stage based on the space-alternating generalized expectation maximization algorithm. We find that accurate position and rotation angle estimation is possible using signals from a single transmitter, in either line-of-sight, non-line-of-sight, or obstructed-line-of-sight conditions.
- 8 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (3) , 2027-2038
Power Allocation for OFDM Wireless Network Localization Under Expectation and Robustness Constraints
In location-aware wireless networks, mobile nodes (agents) can obtain their positions using range measurements to other nodes with known positions (anchors). Optimal subcarrier power allocation at the anchors reduces positioning error and improves network lifetime and throughput. We present an optimization framework for subcarrier power allocations in network localization with the imperfect knowledge of network parameters based on the fundamental statistical limits. Power allocations with expectation and robustness constraints are obtained using semidefinite optimization problems in non-iterative and iterative forms with both unicast and multicast transmissions. Results show that the allocations provide more accurate localization than non-robust designs under channel and agents positions uncertainty.
- 8 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (3) , 2027-2038
Power Allocation for OFDM Wireless Network Localization Under Expectation and Robustness Constraints
In location-aware wireless networks, mobile nodes (agents) can obtain their positions using range measurements to other nodes with known positions (anchors). Optimal subcarrier power allocation at the anchors reduces positioning error and improves network lifetime and throughput. We present an optimization framework for subcarrier power allocations in network localization with the imperfect knowledge of network parameters based on the fundamental statistical limits. Power allocations with expectation and robustness constraints are obtained using semidefinite optimization problems in non-iterative and iterative forms with both unicast and multicast transmissions. Results show that the allocations provide more accurate localization than non-robust designs under channel and agents positions uncertainty.