Danijela Cabric

Danijela Cabric

Auto-generated profile, based on publicly available information

Danijela Cabric

Department of Electrical and Computer Engineering, University of California, Los Angeles, CA, USA

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 July 2019 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Open access
HYHan Yan
Han Yan
DCDanijela Cabric
Danijela Cabric
Initial access (IA) is a fundamental procedure in cellular systems where user equipment (UE) detects base station (BS) and acquires synchronization. Due to the necessity of using antenna arrays for IA in millimeter-wave (mmW) systems, BS simultaneously performs beam training to acquire angular channel state information. The state-of-the-art directional IA (DIA) uses a set of narrow sounding beams in IA, where different beam pairs are sequentially measured and the best candidate is determined. However, the directional beam training accuracy depends on scanning beam angular resolution, and consequently its improvement requires additional dedicated radio resources, access latency and overhead. To remedy the problem of access latency and overhead in DIA, this work proposes to use a quasi-omni pseudorandom sounding beams for IA, and develops algorithm for joint initial access and fine resolution initial beam training without requiring additional radio resources. It comprehensively models realistic timing and frequency synchronization errors encountered in IA. We provide the analysis of the proposed algorithm miss detection rate under timing synchronization errors, and further derive Cram\'er-Rao lower bound of angular estimation under frequency offset, considering the 5G-NR compliant IA procedure. To accommodate the ever increasing bandwidth for beam training in standard evolution beyond 5G, we design the beam squint robust algorithm. For realistic performance evaluation under mmW channels, we use QuaDRiGa simulator with mmMAGIC model at 28 GHz to show that the proposed approach is advantageous to DIA. The proposed algorithm offers orders of magnitude access latency saving compared to DIA, when the same discovery, post training SNR, and overhead performance are targeted. This conclusion holds true in various propagation environments and 3D locations of a mmW pico-cell with up to 140m radius. Further, our results demonstrate that the proposed beam squint robust algorithm is able to retain unaffected performance with increased beam training bandwidth.

25 December 2017 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
MLMihir Laghate
Mihir Laghate
DCDanijela Cabric
Danijela Cabric
Sharing spectrum with a communicating incumbent user (IU) network requires avoiding interference to IU receivers. But since receivers are passive when in the receive mode and cannot be detected, the network topology can be used to predict the potential receivers of a currently active transmitter. For this purpose, this paper proposes a method to detect the directed links between IUs of time multiplexing communication networks from their transmission start and end times. It models the response mechanism of commonly used communication protocols using Granger causality: the probability of an IU starting a transmission after another IU's transmission ends increases if the former is a receiver of the latter. This paper proposes a non-parametric test statistic for detecting such behavior. To help differentiate between a response and the opportunistic access of available spectrum, the same test statistic is used to estimate the response time of each link. The causal structure of the response is studied through a discrete time Markov chain that abstracts the IUs' medium access protocol and focuses on the response time and response probability of 2 IUs. Through NS-3 simulations, it is shown that the proposed algorithm outperforms existing methods in accurately learning the topologies of infrastructure-based networks and that it can infer the directed data flow in ad hoc networks with finer time resolution than an existing method.

18 March 2024 in IEEE Open Journal of Signal Processing
Verified
Journal Article
Open access
HSHazem Sallouha
Hazem Sallouha
SSShamik Sarkar
Shamik Sarkar
EKEnes Krijestorac
Enes Krijestorac
DCDanijela Cabric
Danijela Cabric
Radio environment maps (REMs) hold a central role in optimizing wireless network deployment, enhancing network performance, and ensuring effective spectrum management. Conventional REM prediction methods are either excessively time-consuming, e.g., ray tracing, or inaccurate, e.g., statistical models, limiting their adoption in modern inherently dynamic wireless networks. Deep learning-based REM prediction has recently attracted considerable attention as an appealing, accurate, and time-efficient alternative. However, existing works on REM prediction using deep learning are either confined to 2D maps or use a relatively small dataset. In this paper, we introduce a runtime-efficient REM prediction framework based on U-Nets, trained on a large-scale 3D maps dataset. In addition, data preprocessing steps are investigated to further refine the REM prediction accuracy. The proposed U-Net framework, along with preprocessing steps, are evaluated in the context of the 2023 IEEE ICASSP Signal Processing Grand Challenge, namely, the First Pathloss Radio Map Prediction Challenge . The evaluation results demonstrate that the proposed method achieves an average normalized root-mean-square error (RMSE) of 0.045 with an average of 14 milliseconds (ms) runtime. Finally, we position our achieved REM prediction accuracy in the context of a relevant cell-free massive multiple-input multiple-output (CF-mMIMO) use case. We demonstrate that one can obviate consuming energy on large-scale fading LSF measurements and rely on predicted REM instead to decide which sleep access points (APs) to switch on in a CF-mMIMO network that adopts a minimum propagation loss AP switch ON/OFF strategy.

13 September 2021
Verified
Conference Paper
Open access
CLChung-Ching Lin
Chung-Ching Lin
CPChase Puglisi
Chase Puglisi
EGErfan Ghaderi
Erfan Ghaderi
SMSoumen Mohapatra
Soumen Mohapatra
DHDeukhyoun Heo
Deukhyoun Heo
DCDanijela Cabric
Danijela Cabric
Spatial signal processors (SSP) for emerging millimeter-wave wireless networks are critically dependent on link discovery. To avoid loss in communication, mobile devices need to locate narrow directional beams with millisecond latency. In this work, we demonstrate a true-time-delay (TTD) array with digitally reconfigurable delay elements enabling both fast beam-training at the receiver with wideband data communications. In beam-training mode, large delay-bandwidth products are implemented to accelerate beam training using frequency-dependent probing beams. In data communications mode, precise beam alignment is achieved to mitigate spatial effects during beam-forming for wideband signals. The 4-element switched-capacitor based time-interleaved array uses a compact closed-loop integrator for signal combining with the delay compensation implemented in the clock domain to achieve high precision and large delay range. Prototyped in TSMC 65nm CMOS, the TTD SSP successfully demonstrates unique frequency-to-angle mapping with 3.8ns maximum delay and 800MHz bandwidth in the beam-training mode. In the data communications mode, a ~ 12dB uniform beamforming gain is achieved from 80MHz to 800MHz. The TTD SSP consumes 29mW at 1V supply achieving 122MB/s with 16-QAM at 9.8% EVM.

17 January 2018 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Open access
SCShailesh Chaudhari
Shailesh Chaudhari
DCDanijela Cabric
Danijela Cabric
We address the problem of power allocation and secondary user (SU) selection in the downlink from a secondary base station (SBS) equipped with a large number of antennas in an underlay cognitive radio network. A new optimization framework is proposed in order to select the maximum number of SUs and compute power allocations in order to satisfy instantaneous rate or QoS requirements of SUs. The optimization framework also aims to restrict the interference to primary users (PUs) below a predefined threshold using available imperfect CSI at the SBS. In order to obtain a feasible solution for power allocation and user selection, we propose a low-complexity algorithm called Delete-su-with-Maximum-Power-allocation (DMP). Theoretical analysis is provided to compute the interference to PUs and the number of SUs exceeding the required rate. The analysis and simulations show that the proposed DMP algorithm outperforms the state-of-the art selection algorithm in terms of serving more users with minimum rate constraints, and it approaches the optimal solution if the number of antennas is an order of magnitude greater than the number of users.

17 October 2013 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
CLChun-Hao Liu
Chun-Hao Liu
JTJason A. Tran
Jason A. Tran
PPPrzemyslaw Pawelczak
Przemyslaw Pawelczak
DCDanijela Cabric
Danijela Cabric
In this paper we present new results on the problem of finding the best channel sensing order for multi-channel Dynamic Spectrum Access (DSA) networks. We start with the general assumption that all Secondary Users (SUs) cooperatively sense each Primary User (PU) channel at one time. Then, the SU sensing results are reported to a DSA base station that schedules SU transmissions in order to maximize DSA network throughput. We then assume that PU traffic parameters are not perfectly known to DSA network and change over time, and propose a novel PU channel sensing order scheme based on the quality of PU traffic estimation. We adopt a maximum likelihood estimator to estimate the traffic statistics of PU channels and derive the Cramer-Rao (CR) bounds for the PU traffic estimation performance. Based on the CR bound and its Gaussian approximation, we analyze the impact of the estimation error on the DSA network throughput by computing a new metric called sensing order confidence, i.e., the probability that the best selected sensing order is not affected by PU traffic estimation errors. Finally, we formulate a convex optimization problem to determine the minimum number of PU channel state samples required for estimating PU traffic parameters after determining a certain constraint on the sensing order confidence metric to achieve the best sensing order.