arXiv subjects

Keshav Singh

Publications and source records attributed to Keshav Singh.

26 records · Page 2Linked to original sources

arXiv2021

Multiple Antenna Selection and Successive Signal Detection for SM-based IRS-aided Communication

Intelligent reflecting surface (IRS) is being considered as a prospective candidate for next-generation wireless communication due to its ability to significantly improve coverage and spectral efficiency by controlling the propagation environment. One of the ways IRS increases spectral efficiency is by adjusting phase shifts to perform passive beamforming. In this letter, we integrate the concept of IRS-aided communication to the domain of multi-direction beamforming, whereby multiple receive antennas are selected to convey more information bits than existing spatial modulation (SM) techniques at any specific time. To complement this system, we also propose a successive signal detection (SSD) technique at the receiver. Numerical results show that the proposed design is able to improve the average successful bits transmitted (ASBT) by the system, which outperforms other state-of-the-art methods proposed in the literature.

eess.SP↗

arXiv2021

A Comparative Study on Collecting High-Quality Implicit Reasonings at a Large-scale

Explicating implicit reasoning (i.e. warrants) in arguments is a long-standing challenge for natural language understanding systems. While recent approaches have focused on explicating warrants via crowdsourcing or expert annotations, the quality of warrants has been questionable due to the extreme complexity and subjectivity of the task. In this paper, we tackle the complex task of warrant explication and devise various methodologies for collecting warrants. We conduct an extensive study with trained experts to evaluate the resulting warrants of each methodology and find that our methodologies allow for high-quality warrants to be collected. We construct a preliminary dataset of 6,000 warrants annotated over 600 arguments for 3 debatable topics. To facilitate research in related downstream tasks, we release our guidelines and preliminary dataset.

cs.CL↗

arXiv2020

Kondo Effect Route to Probing Majorana-Kramers Pairs Coupled to Quantum Dot

In this paper, we study a set-up in which quantum dot is tunnel-coupled to Majorana-Kramers pair(MKP) which are the edge modes of time reversal invariant topological superconductor (TRITOPS), which is an experimental realization of time reversal invariant Kitaev chain model. Our motivation is to study the effect of Majorana-Kramers pair on Kondo fixed point and conversely the effect of Kondo interaction on Majorana-Kramers pair. This way we can capture the signatures of Majorana fermions on Kondo effect in quantum dots which can be probed feasibly in experiments. Employing the renormalization group method, we report the first study of the signatures of Majorana-Kramers pair in the dynamical spin susceptibility of the quantum dot electrons. We not only calculate the flow equations for coupling constants but also study the renormalization of observables and especially calculate dynamical spin susceptibility. We propose that since these dynamical quantities have signatures of Majorana-Kramers pair, so they provide an unambiguous experimental probe for detection of Majorana fermions in TRITOPS.

cond-mat.str-el↗

arXiv2020

A systematic method for Schrieffer-Wolff transformation and its generalizations

Schrieffer-Wolff transformation is extensively used in quantum many-body physics to calculate the low energy effective Hamiltonian. It offers a perturbative method to understand the renormalization effects in the strong coupling regime of the quantum many-body models. The generator for Schrieffer-Wolff transformation is calculated using heuristic methods. It is highly desirable to have a rigorous, systematic and simple method for the calculation of generator for this highly important transformation. In this paper, we put forward such a method. We demonstrate our method by applying it to few well-known models from various fields like strongly correlated electron systems, quantum optics and cavity quantum electrodynamics. Our method can be applied to a broad class of quantum many-body Hamiltonians.

cond-mat.str-el↗

arXiv2019

When Choosing Plausible Alternatives, Clever Hans can be Clever

Pretrained language models, such as BERT and RoBERTa, have shown large improvements in the commonsense reasoning benchmark COPA. However, recent work found that many improvements in benchmarks of natural language understanding are not due to models learning the task, but due to their increasing ability to exploit superficial cues, such as tokens that occur more often in the correct answer than the wrong one. Are BERT's and RoBERTa's good performance on COPA also caused by this? We find superficial cues in COPA, as well as evidence that BERT exploits these cues. To remedy this problem, we introduce Balanced COPA, an extension of COPA that does not suffer from easy-to-exploit single token cues. We analyze BERT's and RoBERTa's performance on original and Balanced COPA, finding that BERT relies on superficial cues when they are present, but still achieves comparable performance once they are made ineffective, suggesting that BERT learns the task to a certain degree when forced to. In contrast, RoBERTa does not appear to rely on superficial cues.

cs.CL↗

arXiv2019

Coexistence of MIMO Radar and FD MIMO Cellular Systems with QoS Considerations

In this work, the feasibility of spectrum sharing between a multiple-input multiple-output (MIMO) radar system (RS) and a MIMO cellular system (CS), comprising of a full duplex (FD) base station (BS) serving multiple downlink and uplink users at the same time and frequency is investigated. While a joint transceiver design technique at the CS's BS and users is proposed to maximise the probability of detection (PoD) of the MIMO RS, subject to constraints of quality of service (QoS) of users and transmit power at the CS, null-space based waveform projection is used to mitigate the interference from RS towards CS. In particular, the proposed technique optimises the performance of PoD of RS by maximising its lower bound, which is obtained by exploiting the monotonically increasing relationship of PoD and its non-centrality parameter. Numerical results show the utility of the proposed spectrum sharing framework, but with certain trade-offs in performance corresponding to RS's transmit power, RS's PoD, CS's residual self interference power at the FD BS and QoS of users.

eess.SP↗

arXiv2019

Analysis of Cached-Enabled Hybrid Millimter Wave & Sub-6 GHz Massive MIMO Networks

This paper focuses on edge caching in mm/μWave hybrid wireless networks, in which all mmWave SBSs and μWave MBSs are capable of storing contents to alleviate the traffic burden on the backhaul link that connect the BSs and the core network to retrieve the non-cached contents. The main aim of this work is to address the effect of capacity-limited backhaul on the average success probability (ASP) of file delivery and latency. In particular, we consider a more practical mmWave hybrid beamforming in small cells and massive MIMO communication in macro cells. Based on stochastic geometry and a simple retransmission protocol, we derive the association probabilities by which the ASP of file delivery and latency are derived. Taking no caching event as the benchmark, we evaluate these QoS performance metrics under MC and UC placement policies. The theoretical results demonstrate that backhaul capacity indeed has a significant impact on network performance especially under weak backhaul capacity. Besides, we also show the tradeoff among cache size, retransmission attempts, ASP of file delivery, and latency. The interplay shows that cache size and retransmission under different caching placement schemes alleviates the backhaul requirements. Simulation results are present to valid our analysis.

eess.SP↗

arXiv2018

An Analysis on Caching Placement for Millimeter/Micro Wave Hybrid Networks

In this paper, we consider a hybrid millimeter wave (mmWave) and micro wave ($μ$Wave) network from the perspective of \emph{wireless caching} and study the optimal probabilistic content/file caching placement at desirable base stations (BSs) using a stochastic geometric framework. Considering the average success probability (ASP) of file delivery as the performance metric, we derive expressions for the association probability of the typical user to the mmWave and $μ$Wave networks. Accordingly, we provide an upper bound for the ASP of file delivery and formulate the content caching placement scheme as an optimization problem with respect to caching probabilities, that jointly optimizes the ASP of file delivery considering both content placement and delivery phases. In particular, we consider the caching placement strategy under both noise-limited and interference-limited environments. We numerically evaluate the performance of the proposed caching schemes under essential factors, such as blockages in the mmWave network, cluster radius, BS density, and path loss and compare it with uniform caching placement, caching $M$ most popular contents, and random caching placement. Numerical results demonstrate the superiority of the proposed caching scheme over others, albeit certain trade-offs.

eess.SP↗