Results 61-80 of 760.
Bookmark and Share    
Full Text
Peer Reviewed
See detailEfficient Federated Learning Algorithm for Resource Allocation in Wireless IoT Networks
Nguyen, van Dinh UL; Sharma, Shree Krishna UL; Vu, Thang Xuan UL et al

in IEEE Internet of Things Journal (2021), 8(5), 3394-3409

Federated learning (FL) allows multiple edge computing nodes to jointly build a shared learning model without having to transfer their raw data to a centralized server, thus reducing communication ... [more ▼]

Federated learning (FL) allows multiple edge computing nodes to jointly build a shared learning model without having to transfer their raw data to a centralized server, thus reducing communication overhead. However, FL still faces a number of challenges such as non-iid distributed data and heterogeneity of user equipments (UEs). Enabling a large number of UEs to join the training process in every round raises a potential issue of the heavy global communication burden. To address these issues, we generalize the current state-of-the-art Federated Averaging (FedAvg) by adding a weight-based proximal term to the local loss function. The proposed FL algorithm runs stochastic gradient descent in parallel on a sampled subset of the total UEs with replacement during each global round. We provide a convergence upper bound characterizing the trade-off between convergence rate and global rounds, showing that a small number of active UEs per round still guarantees convergence. Next, we employ the proposed FL algorithm in wireless Internet-of-Things (IoT) networks to minimize either total energy consumption or completion time of FL, where a simple yet efficient path-following algorithm is developed for its solutions. Finally, numerical results on unbalanced datasets are provided to demonstrate the performance improvement and robustness on the convergence rate of the proposed FL algorithm over FedAvg. They also reveal that the proposed algorithm requires much less training time and energy consumption than the FL algorithm with full user participation. These observations advocate the proposed FL algorithm for a paradigm shift in bandwidth- constrained learning wireless IoT networks. [less ▲]

Detailed reference viewed: 366 (51 UL)
Full Text
Peer Reviewed
See detailJoint Symbol Level Precoding and Combining for MIMO-OFDM Transceiver Architectures Based on One-Bit DACs and ADCs
Domouchtsidis, Stavros UL; Tsinos, Christos UL; Chatzinotas, Symeon UL et al

in IEEE Transactions on Wireless Communications (2021), 20(7), 4601-4613

Herein, a precoding scheme is developed for orthogonal frequency division multiplexing (OFDM) transmission in multiple-input multiple-output (MIMO) systems that use one-bit digital-to-analog converters ... [more ▼]

Herein, a precoding scheme is developed for orthogonal frequency division multiplexing (OFDM) transmission in multiple-input multiple-output (MIMO) systems that use one-bit digital-to-analog converters (DACs) and analog-to-digital converters (ADCs) at the transmitter and receiver, respectively, as a means to reduce the power consumption. Two different one-bit architectures are presented. In the first, a single user MIMO system is considered where the DACs and ADCs of the transmitter and the receiver are assumed to be one-bit and in the second, a network of analog phase shifters is added at the receiver as an additional analog-only processing step with the view to mitigate some of the effects of coarse quantization. The precoding design problem is formulated and then split into two NP-hard optimization problems, which are solved by an algorithmic solution based on the Cyclic Coordinate Descent (CCD) framework. The design of the analog post-coding matrix for the second architecture is decoupled from the precoding design and is solved by an algorithm based on the alternating direction method of multipliers (ADMM). Numerical results show that the proposed precoding scheme successfully mitigates the effects of coarse quantization and the proposed systems achieve a performance close to that of systems equipped with full resolution DACs/ADCs. [less ▲]

Detailed reference viewed: 43 (1 UL)
Full Text
Peer Reviewed
See detailDesign Optimization for Low-Complexity FPGA Implementation of Symbol-Level Multiuser Precoding
Haqiqatnejad, Alireza UL; Krivochiza, Jevgenij UL; Merlano Duncan, Juan Carlos UL et al

in IEEE Access (2021), 9

This paper proposes and validates a low-complexity FPGA design for symbol-level precoding (SLP) in multiuser multiple-input single-output (MISO) downlink communication systems. In the optimal case, the ... [more ▼]

This paper proposes and validates a low-complexity FPGA design for symbol-level precoding (SLP) in multiuser multiple-input single-output (MISO) downlink communication systems. In the optimal case, the symbol-level precoded transmit signal is obtained as the solution to an optimization problem tailored for a given set of users’ data symbols. This symbol-by-symbol design, however, imposes excessive computational complexity on the system. To alleviate this issue, we aim to reduce the per-symbol complexity of the SLP scheme by developing an approximate yet computationally-efficient closed-form solution. The proposed solution allows us to achieve a high symbol throughput in real-time implementations. To develop the FPGA design, we express the proposed solution in an algorithmic way and translate it to hardware description language (HDL). We then optimize the processing to accelerate the performance and generate the corresponding intellectual property (IP) core. We provide the synthesis report for the generated IP core, including performance and resource utilization estimates and interface descriptions. To validate our design, we simulate an uncoded transmission over a downlink multiuser channel using the LabVIEW software, where the SLP IP core is implemented as a clock-driven logic (CDL) unit. Our simulation results show that a throughput of 100 Mega symbols per second per user can be achieved via the proposed SLP design. We further use the MATLAB software to produce numerical results for the conventional zero-forcing (ZF) and the optimal SLP techniques as benchmarks for comparison. Thereby, it is shown that the proposed FPGA implementation of SLP offers an improvement of up to 50 percent in power efficiency compared to the ZF precoding. Remarkably, it enjoys the same per-symbol complexity order as that of the ZF technique. We also evaluate the loss of the real-time SLP design, introduced by the algebraic approximations and arithmetic inaccuracies, with respect to the optimal scheme. [less ▲]

Detailed reference viewed: 88 (10 UL)
Full Text
Peer Reviewed
See detailEnergy-Efficient Hybrid Symbol-Level Precoding for Large-Scale mmWave Multiuser MIMO Systems
Haqiqatnejad, Alireza UL; Kayhan, Farbod UL; Ottersten, Björn UL

in IEEE Transactions on Communications (2021), 69(5), 3119-3134

We address the symbol-level precoding design problem for the downlink of a multiuser millimeter wave (mmWave) multiple-input multiple-output (MIMO) wireless system where the transmitter is equipped with a ... [more ▼]

We address the symbol-level precoding design problem for the downlink of a multiuser millimeter wave (mmWave) multiple-input multiple-output (MIMO) wireless system where the transmitter is equipped with a large-scale antenna array. The high cost and power consumption associated with the massive use of radio frequency (RF) chains prohibit fully-digital implementation of the precoder, and therefore, we consider a hybrid analog-digital architecture where a small-sized baseband precoder is followed by two successive networks of analog on-off switches and variable phase shifters according to a fully-connected structure. We jointly optimize the digital baseband precoder and the states of the switching network on a symbol-level basis, i.e., by exploiting both the channel state information (CSI) and the instantaneous data symbols, whereas the phase-shifting network is designed only based on the CSI due to practical considerations. Our approach to this joint optimization is to minimize the Euclidean distance between the optimal fully-digital and the hybrid symbol-level precoders. Remarkably, the use of a switching network allows for power-savings in the analog precoder by switching some of the phase shifters off according to the instantaneously optimized states of the switches. Our numerical results indicate that, on average, up to 50 percent of the phase shifters can be switched off. We provide an analysis of energy efficiency by adopting appropriate power dissipation models for the analog precoder, where it is shown that the energy efficiency of precoding can substantially be improved thanks to the phase shifter selection approach, compared to the fully-digital and the state-of-the-art hybrid symbol-level schemes. [less ▲]

Detailed reference viewed: 60 (12 UL)
Full Text
Peer Reviewed
See detailMachine Learning-Enabled Joint Antenna Selection and Precoding Design: From Offline Complexity to Online Performance
Vu, Thang Xuan UL; Chatzinotas, Symeon UL; Nguyen, van Dinh UL et al

in IEEE Transactions on Wireless Communications (2021), 20(6), 3710-3722

We investigate the performance of multi-user multiple-antenna downlink systems in which a base station (BS) serves multiple users via a shared wireless medium. In order to fully exploit the spatial ... [more ▼]

We investigate the performance of multi-user multiple-antenna downlink systems in which a base station (BS) serves multiple users via a shared wireless medium. In order to fully exploit the spatial diversity while minimizing the passive energy consumed by radio frequency (RF) components, the BS is equipped with M RF chains and N antennas, where M < N. Upon receiving pilot sequences to obtain the channel state information (CSI), the BS determines the best subset of M antennas for serving the users. We propose a joint antenna selection and precoding design (JASPD) algorithm to maximize the system sum rate subject to a transmit power constraint and quality of service (QoS) requirements. The JASPD overcomes the non-convexity of the formulated problem via a doubly iterative algorithm, in which an inner loop successively optimizes the precoding vectors, followed by an outer loop that tries all valid antenna subsets. Although approaching the (near) global optimality, the JASPD suffers from a combinatorial complexity, which may limit its application in real-time network operations. To overcome this limitation, we propose a learning-based antenna selection and precoding design algorithm (L-ASPA), which employs a deep neural network (DNN) to establish underlaying relations between the key system parameters and the selected antennas. The proposed L-ASPD is robust against the number of users and their locations, BS's transmit power, as well as the small-scale channel fading. With a well-trained learning model, it is shown that the L-ASPD significantly outperforms baseline schemes based on the block diagonalization and a learning-assisted solution for broadcasting systems and achieves higher effective sum rate than that of the JASPA under limited processing time. In addition, we observed that the proposed L-ASPD can reduce the computation complexity by 95% while retaining more than 95% of the optimal performance. [less ▲]

Detailed reference viewed: 138 (34 UL)
Full Text
Peer Reviewed
See detailEnergy-Efficient Hybrid Symbol-Level Precoding via Phase Shifter Selection in mmWave MU-MIMO Systems
Haqiqatnejad, Alireza UL; Kayhan, Farbod UL; Ottersten, Björn UL

in Energy-Efficient Hybrid Symbol-Level Precoding via Phase Shifter Selection in mmWave MU-MIMO Systems (2021, January 25)

We address the symbol-level precoding design problem for the downlink of a multiuser millimeter wave (mmWave) multiple-input multiple-output wireless system. We consider a hybrid analog-digital ... [more ▼]

We address the symbol-level precoding design problem for the downlink of a multiuser millimeter wave (mmWave) multiple-input multiple-output wireless system. We consider a hybrid analog-digital architecture with phase shifter selection where a small-sized baseband precoder is followed by two successive networks of analog on-off switches and variable phase shifters according to a fully-connected structure. We jointly optimize the digital baseband precoder and the states of the switching network on a symbol-level basis, i.e., by exploiting both the channel state information (CSI) and the instantaneous data symbols, while the phase-shifting network is designed only based on the CSI. Our approach to this joint optimization is to minimize the Euclidean distance between the optimal fully-digital and the hybrid symbol-level precoders. It is shown via numerical results that using the proposed approach, up to 50 percent of the phase shifters can be switched off on average, allowing for reductions in the power consumption of the phase-shifting network. Adopting appropriate power consumption models for the analog precoder, our energy efficiency analysis further shows that this power reduction can substantially improve the energy efficiency of the hybrid precoding compared to the fully-digital and the state-of-the-art schemes. [less ▲]

Detailed reference viewed: 69 (14 UL)
Full Text
Peer Reviewed
See detailCompletion Time Minimization in NOMA Systems:Learning for Combinatorial Optimization
Wang, Anyue UL; Lei, Lei UL; Lagunas, Eva UL et al

in IEEE Networking Letters (2021)

In this letter, we study a completion-time minimization problem by jointly optimizing time slots (TSs) and power allocation for time-critical non-orthogonal multiple access (NOMA) systems. The original ... [more ▼]

In this letter, we study a completion-time minimization problem by jointly optimizing time slots (TSs) and power allocation for time-critical non-orthogonal multiple access (NOMA) systems. The original problem is non-linear/non-convex with discrete variables, leading to high computational complexity in conventional iterative methods. Towards an efficient solution, we train deep neural networks to perform fast and high-accuracy predictions to tackle the difficult combinatorial parts, i.e., determining the minimum consumed TSs and user-TS allocation. Based on the learning-based predictions, we develop a low-complexity post-process procedure to provide feasible power allocation. The numerical results demonstrate promising improvements of the proposed scheme compared to other baseline schemes in terms of computational efficiency, approximating optimum, and feasibility guarantee. [less ▲]

Detailed reference viewed: 122 (33 UL)
Full Text
Peer Reviewed
See detailFeasible Point Pursuit and Successive Convex Approximation for Transmit Power Minimization in SWIPT-Multigroup Multicasting Systems
Gautam, Sumit UL; Lagunas, Eva UL; Chatzinotas, Symeon UL et al

in IEEE Transactions on Green Communications and Networking (2021)

We consider three wireless multi-group (MG) multicasting (MC) systems capable of handling heterogeneous user types viz., information decoding (ID) specific users with conventional receiver architectures ... [more ▼]

We consider three wireless multi-group (MG) multicasting (MC) systems capable of handling heterogeneous user types viz., information decoding (ID) specific users with conventional receiver architectures, energy harvesting (EH) only users with non-linear EH module, and users with joint ID and EH capabilities having separate units for the two operations, respectively. Each user is categorized under unique group(s), which can be of MC type specifically meant for ID users, and/or an energy group consisting of EH explicit users. The joint ID and EH users are a part of both EH group and single MC group. We formulate an optimization problem to minimize the total transmit power with optimal precoder designs for the three aforementioned scenarios, under certain quality-of-service constraints. The problem may be adapted to the well-known semidefinite program and solved via relaxation of rank-1 constraint. However, this process leads to performance degradation in some cases, which increases with the rank of solution obtained from the relaxed problem. Hence, we develop a novel technique motivated by the feasible-point pursuit successive convex approximation method in order to address the rank-related issue. The benefits of proposed method are illustrated under various operating conditions and parameter values, with comparison between the three above-mentioned scenarios. [less ▲]

Detailed reference viewed: 128 (18 UL)
Full Text
Peer Reviewed
See detailCoverage Probability and Ergodic Capacity of Intelligent Reflecting Surface-Enhanced Communication Systems
Trinh, van Chien UL; Tu, Lam Thanh; Chatzinotas, Symeon UL et al

in IEEE Communications Letters (2021), 25(1), 69-73

This paper studies the performance of a single-input single-output (SISO) system enhanced by the assistance of an intelligent reflecting surface (IRS), which is equipped with a finite number of elements ... [more ▼]

This paper studies the performance of a single-input single-output (SISO) system enhanced by the assistance of an intelligent reflecting surface (IRS), which is equipped with a finite number of elements under Rayleigh fading channels. From the instantaneous channel capacity, we compute a closed-form expression of the coverage probability as a function of statistical channel information only. A scaling law of the coverage probability and the number of phase shifts is further obtained. The ergodic capacity is derived, then a simple upper bound to simplify matters of utilizing the symbolic functions and can be applied for a long period of time. Numerical results manifest the tightness and effectiveness of our closed-form expressions compared with Monte-Carlo simulations. [less ▲]

Detailed reference viewed: 141 (22 UL)
Full Text
Peer Reviewed
See detailNOMA-Enabled Multi-Beam Satellite Systems: Joint Optimization to Overcome Offered-Requested Data Mismatches
Wang, Anyue UL; Lei, Lei UL; Lagunas, Eva UL et al

in IEEE Transactions on Vehicular Technology (2021), 70(1), 900-913

Non-orthogonal multiple access (NOMA) has potentials to improve the performance of multi-beam satellite systems. The performance optimization in satellite-NOMA systems could be different from that in ... [more ▼]

Non-orthogonal multiple access (NOMA) has potentials to improve the performance of multi-beam satellite systems. The performance optimization in satellite-NOMA systems could be different from that in terrestrial-NOMA systems, e.g., considering distinctive channel models, performance metrics, power constraints, and limited flexibility in resource management. In this paper, we adopt a metric, offered capacity to requested traffic ratio (OCTR), to measure the requested-offered data rate mismatch in multi-beam satellite systems. In the considered system, NOMA is applied to mitigate intra-beam interference while precoding is implemented to reduce inter-beam interference. We jointly optimize power, decoding orders, and terminal-timeslot assignment to improve the max-min fairness of OCTR. The problem is inherently difficult due to the presence of combinatorial and non-convex aspects. We first fix the terminal-timeslot assignment, and develop an optimal fast-convergence algorithmic framework based on Perron-Frobenius theory (PF) for the remaining joint power-allocation and decoding-order optimization problem. Under this framework, we propose a heuristic algorithm for the original problem, which iteratively updates the terminal-timeslot assignment and improves the overall OCTR performance. Numerical results show that the proposed algorithm improves the max-min OCTR by 40.2% over orthogonal multiple access (OMA) in average. [less ▲]

Detailed reference viewed: 273 (55 UL)
Full Text
Peer Reviewed
See detailSymbol-Level Precoding with Constellation Rotation in the Finite Block Length Regime
Kisseleff, Steven UL; Alves Martins, Wallace UL; Chatzinotas, Symeon UL et al

in IEEE Communications Letters (2021)

This paper tackles the problem of optimizing the parameters of a symbol-level precoder for downlink multiantenna multi-user systems in the finite block length regime. Symbol-level precoding (SLP) is a non ... [more ▼]

This paper tackles the problem of optimizing the parameters of a symbol-level precoder for downlink multiantenna multi-user systems in the finite block length regime. Symbol-level precoding (SLP) is a non-linear technique for multiuser wireless networks, which exploits constructive interference among co-channel links. Current SLP designs, however, implicitly assume asymptotically infinite blocks, since they do not take into account that the design rules for finite and especially short blocks might significantly differ. This paper fills this gap by introducing a novel SLP design based on discrete constellation rotations. The rotations are the added degree of freedom that can be optimized for every block to be transmitted, for instance, to save transmit power. Numerical evaluations of the proposed method indicate substantial power savings, which might be over 99% compared to the traditional SLP, at the expense of a single additional pilot symbol per block for constellation de-rotation. [less ▲]

Detailed reference viewed: 100 (8 UL)
Full Text
Peer Reviewed
See detailData-driven Precoded MIMO Detection Robust to Channel Estimation Errors
Mayouche, Abderrahmane UL; Alves Martins, Wallace UL; Chatzinotas, Symeon UL et al

in IEEE Open Journal of the Communications Society (2021)

We study the problem of symbol detection in downlink coded multiple-input multiple-output (MIMO) systems with precoding and without the explicit knowledge of the channel-state information (CSI) at the ... [more ▼]

We study the problem of symbol detection in downlink coded multiple-input multiple-output (MIMO) systems with precoding and without the explicit knowledge of the channel-state information (CSI) at the receiver. In this context, we investigate the impact of imperfect CSI at the transmitter (CSIT) on the detection performance. We first model the CSIT degradation based on channel estimation errors to investigate its impact on the detection performance at the receiver. To mitigate the effect of CSIT deterioration at the latter, we propose learning based techniques for hard and soft detection that use downlink precoded pilot symbols as training data. We note that these pilots are originally intended for signal-to-interference-plus-noise ratio (SINR) estimation. We validate the approach by proposing a lightweight implementation that is suitable for online training using several state-of-the-art classifiers. We compare the bit error rate (BER) and the runtime complexity of the proposed approaches where we achieve superior detection performance in harsh channel conditions while maintaining low computational requirements. Specifically, numerical results show that severe CSIT degradation impedes the correct detection when a conventional detector is used. However, the proposed learning-based detectors can achieve good detection performance even under severe CSIT deterioration, and can yield 4-8 dB power gain for BER values lower than 10-4 when compared to the classic linear minimum mean square error (MMSE) detector. [less ▲]

Detailed reference viewed: 80 (9 UL)
Full Text
Peer Reviewed
See detailPrecoding for Satellite Communications: Why, How and What next?
Mysore Rama Rao, Bhavani Shankar UL; Lagunas, Eva UL; Chatzinotas, Symeon UL et al

in IEEE Communications Letters (2021)

Detailed reference viewed: 126 (17 UL)
Full Text
Peer Reviewed
See detailSatellite Broadband Capacity-on-Demand: Dynamic Beam Illumination with Selective Precoding
Chen, Lin UL; Lagunas, Eva UL; Chatzinotas, Symeon UL et al

in European Signal Processing Conference (EUSIPCO), Dublin, Ireland, Aug. 2021 (2021)

Efficient satellite resource utilization is one of the key challenges in next generation high-throughput satellite communication system. In this context, dynamic coverage scheduling based on traffic ... [more ▼]

Efficient satellite resource utilization is one of the key challenges in next generation high-throughput satellite communication system. In this context, dynamic coverage scheduling based on traffic demand has emerged as a promising solution, focusing system capacity into geographical areas where it is needed. Conventional Beam Hopping (BH) satellite system exploit the time-domain flexibility, which provides all available spectrum to a selected set of beams as long as they are not adjacent to each other. However, large geographical areas involving more than one adjacent beam may require full access to the available spectrum during particular instances of time. In this paper, we address this problem by proposing a dynamic beam illumination scheme combined with selective precoding, where only sub-sets of beams that are subject to strong inter-beam interference are precoded. With selective precoding, complexity at the groundsegment is reduced and only considered when needed. Supporting results based on numerical simulations show that the proposed scheme outperforms the relevant benchmarks in terms of demand matching performance. [less ▲]

Detailed reference viewed: 251 (117 UL)
Full Text
Peer Reviewed
See detailDynamic Bandwidth Allocation and Precoding Design for Highly-Loaded Multiuser MISO in Beyond 5G Networks
Vu, Thang Xuan UL; Chatzinotas, Symeon UL; Ottersten, Björn UL

in IEEE Transactions on Wireless Communications (2021)

Multiuser techniques play a central role in the fifth-generation (5G) and beyond 5G (B5G) wireless networks that exploit spatial diversity to serve multiple users simultaneously in the same frequency ... [more ▼]

Multiuser techniques play a central role in the fifth-generation (5G) and beyond 5G (B5G) wireless networks that exploit spatial diversity to serve multiple users simultaneously in the same frequency resource. It is well known that a multi-antenna base station (BS) can efficiently serve a number of users not exceeding the number of antennas at the BS via precoding design. However, when there are more users than the number of antennas at the BS, conventional precoding design methods perform poorly because inter-user interference cannot be efficiently eliminated. In this paper, we investigate the performance of a highly-loaded multiuser system in which a BS simultaneously serves a number of users that is larger than the number of antennas. We propose a dynamic bandwidth allocation and precoding design framework and apply it to two important problems in multiuser systems: i) User fairness maximization and ii) Transmit power minimization, both subject to predefined quality of service (QoS) requirements. The premise of the proposed framework is to dynamically assign orthogonal frequency channels to different user groups and carefully design the precoding vectors within every user group. Since the formulated problems are non-convex, we propose two iterative algorithms based on successive convex approximations (SCA), whose convergence is theoretically guaranteed. Furthermore, we propose a low-complexity user grouping policy based on the singular value decomposition (SVD) to further improve the system performance. Finally, we demonstrate via numerical results that the proposed framework significantly outperforms existing designs in the literature. [less ▲]

Detailed reference viewed: 51 (6 UL)
Full Text
Peer Reviewed
See detailVertex Feature Encoding and Hierarchical Temporal Modeling in a Spatio-Temporal Graph Convolutional Network for Action Recognition
Papadopoulos, Konstantinos UL; Ghorbel, Enjie UL; Aouada, Djamila UL et al

in International Conference on Pattern Recognition, Milan 10-15 January 2021 (2021)

Detailed reference viewed: 144 (28 UL)
Full Text
Peer Reviewed
See detailOn the Performance of One-Bit DoA Estimation via Sparse Linear Arrays
Sedighi, Saeid UL; Mysore Rama Rao, Bhavani Shankar UL; Soltanalian, Mojtaba et al

in IEEE Transactions on Signal Processing (2021)

Direction of Arrival (DoA) estimation using Sparse Linear Arrays (SLAs) has recently gained considerable attention in array processing thanks to their capability to provide enhanced degrees of freedom in ... [more ▼]

Direction of Arrival (DoA) estimation using Sparse Linear Arrays (SLAs) has recently gained considerable attention in array processing thanks to their capability to provide enhanced degrees of freedom in resolving uncorrelated source signals. Additionally, deployment of one-bit Analog-to-Digital Converters (ADCs) has emerged as an important topic in array processing, as it offers both a low-cost and a low-complexity implementation. In this paper, we study the problem of DoA estimation from one-bit measurements received by an SLA. Specifically, we first investigate the identifiability conditions for the DoA estimation problem from one-bit SLA data and establish an equivalency with the case when DoAs are estimated from infinite-bit unquantized measurements. Towards determining the performance limits of DoA estimation from one-bit quantized data, we derive a pessimistic approximation of the corresponding Cram\'{e}r-Rao Bound (CRB). This pessimistic CRB is then used as a benchmark for assessing the performance of one-bit DoA estimators. We also propose a new algorithm for estimating DoAs from one-bit quantized data. We investigate the analytical performance of the proposed method through deriving a closed-form expression for the covariance matrix of the asymptotic distribution of the DoA estimation errors and show that it outperforms the existing algorithms in the literature. Numerical simulations are provided to validate the analytical derivations and corroborate the resulting performance improvement. [less ▲]

Detailed reference viewed: 109 (7 UL)