Bhargav Gokalgandhi

Dr. Bhargav Gokalgandhi

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
19 August 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
BGBhargav Gokalgandhi
Bhargav Gokalgandhi
MTMarcos Tavares
Marcos Tavares
DSDragan Samardzija
Dragan Samardzija
ISIvan Seskar
Ivan Seskar
HGHaris Gacanin
Haris Gacanin
We propose reliability and latency quantities as metrics to be used in the routing tree optimization procedure for Wi-Fi mesh networks. In contrast to state-of-the-art routing optimization methods, our proposal involves directly optimizing the data rates of individual mesh links according to underlying channel conditions such that reliability and latency requirements are satisfied for entire mesh paths. Moreover, to mitigate the channel contention problem that is common in Wi-Fi networks, we propose a multichannel (MC) assignment method. In this method, bandwidth is allocated to the individual mesh nodes based on the expected traffic load that they are expected to handle. Once the bandwidth for each node is determined, specific channels are assigned in a way to avoid co-channel interference. Furthermore, considerable efforts were spent for developing a system-level simulator that captures the features of the physical (PHY) layer and medium access layer defined in the IEEE 802.11 standard (Wi-Fi). Using this simulator, we were able to show that Wi-Fi mesh networks using the proposed routing metric based on reliability and latency quantities significantly outperform the state of the art. Finally, the mitigation of channel contention through the proposed MC assignment method results in further dramatic gains in performance.

2 May 2022
Verified
Conference Paper
Open access
BGBhargav Gokalgandhi
Bhargav Gokalgandhi
ISIvan Seskar
Ivan Seskar
For efficient use of Massive MIMO systems, fast and accurate channel estimation is very important. But the Large-scale antenna array presence requires high pilot overhead for high accuracy of estimation. Also, when used with software-based processing systems like CPUs and GPUs, high processing latency becomes a major issue. To reduce Pilot overhead, a Pilot transmission scheme in combination with PN Sequence correlation based channel estimation scheme is implemented. Then, to deal with the issue of high processing latency, Tensor Cores in Nvidia GPUs are used for computing the channel estimation. Experiments are performed by using Nvidia V100 GPU in the ORBIT Testbed to show the performance of the Pilot transmission scheme. By varying factors like PN sequence length, Channel Impulse Response length, number of multiplexed transmitters, and scale of MIMO, the accuracy and processing latency of Tensor Core implementation of the Channel Estimation is evaluated.

15 July 2024 in Electronics
Verified
Journal Article
Open access
PDF file
BGBhargav Gokalgandhi
Bhargav Gokalgandhi
JLJonathan Ling
Jonathan Ling
ZLZoran Latinović
Zoran Latinović
DSDragan Samardzija
Dragan Samardzija
ISIvan Seskar
Ivan Seskar
Massive MIMO (Multiple Input Multiple Output) systems impose significant processing burdens along with strict latency requirements. The combination of large-scale antenna arrays and wide bandwidth requirements for next-generation wireless systems creates an exponential increase in frontend to backend data. Balancing the processing latency and reliability is critical for baseband processing tasks such as QAM detection. While linear detection algorithms have low computational complexity, their use in Massive MIMO scenario has heavy degradation in error performance. Nonlinear detection methods such as Maximum Likelihood and Sphere Decoding have good error performance, but they suffer from high, variable, and uncontrollable computational complexity. For such cases, the K-best QAM detection algorithm can provide required control over the system performance while maintaining near-ML error performance. In this paper, hard-output, as well as soft-output K-best QAM detection, is implemented in a CPU by utilizing the multiple cores combined with vector processing. Similarly, hard-output detection in a GPU is implemented by leveraging the SIMD (Single Instruction, Multiple Data) architecture and Warp-based execution model. The processing time per bit and the energy consumption per bit are compared for CPU and GPU implementations for QAM constellation density and MIMO array size. The GPU implementation shows up to 5× processing latency per bit improvement and up to 120× energy consumption per bit improvement over the CPU implementation for typical QAM constellations such as 4, 16, and 64 QAM. GPU implementation also shows up to 125× improvement over CPU implementation in energy consumption per bit for larger MIMO configurations such as 24 × 24 and 32 × 32. Finally, the soft-output detector is combined with a LDPC (Low-Density Parity Check) decoder to obtain the FER (Frame Error Rate) performance for CPU implementation. The FER is then combined with frame processing latency to form a Goodput metric to demonstrate the latency and reliability tradeoff.