检索结果-内蒙古大学图书馆

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Ritajit Majumdar Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata

ISBN: (数字)9781728197104

ISBN: (纸本)9781728197111

Large-scale quantum computers mandate error correction and fault tolerance. Due to constraints on the number of qubits, fault tolerance is difficult to achieve in near-term quantum systems. Therefore, error correction should require minimal resources. Gates in the near-term devices are also noisy. Quantum error correction code blocks built with these noisy gates can inject further error in the circuit. The goals for error correction in near-term systems are as follows: (i) using a small number of qubits for encoding, and (ii) keeping cost of circuits for encoding and decoding low. In this paper, we propose two techniques to achieve these mutually orthogonal goals. For a binary quantum system we propose an error estimation method that can aid in reducing the number of error correcting blocks via sparse scheduling. For ternary quantum systems, we propose an approximate code that can correct errors with high probability while significantly reducing the circuit cost. These techniques are expected to be helpful for error mitigation in near-term systems in the absence of fault tolerance.

关键词： Fault tolerance Fault tolerant systems Qubit Logic gates Error correction Error correction codes Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Approximate Ternary Quantum Error Correcting Code with Low Circuit Cost

Approximate Ternary Quantum Error Correcting Code with Low C...

引用

International Symposium on Multiple-Valued Logic

作者： Ritajit Majumdar Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata

ISBN: (数字)9781728154060

ISBN: (纸本)9781728154077

Quantum error correcting code (QECC) with encoding and decoding circuits having low gate count, is an important criterion for realizing quantum computing systems. CSS QECCs are known to have simple circuits. Shaw et al. showed that it is not possible to have a 6-qubit CSS type QECC without sharing entanglement between the encoder and the decoder. In this paper, we propose a 6-qutrit approximate QECC (AQECC) of CSS structure which can simultaneously correct phase errors in upto six qutrits, and one bit error in only four of the six qutrits, without sharing prior entanglement. Our AQECC corrects a single error with probability 0.75 for symmetric error model, and probability 0.9988 for asymmetric error model. It also maintains CSS structure without sharing prior entanglement. Furthermore, the quantum cost of a circuit for this AQECC is 55.72% less than that for the 9-qutrit exact QECC. Overall, low qutrit count, low cost circuit realization with low depth and the ability to correct multiple phase errors make our proposed AQECC a suitable candidate for real life quantum channels.

关键词： Cascading style sheets Qubit Encoding Quantum computing Error correction codes Logic gates Error correction

来源：评论

学校读者我要写书评

暂无评论

Voting in Watts-Strogatz Small-World Network

Voting in Watts-Strogatz Small-World Network

引用

International Conference on Frontiers in computing and Systems, COMSYS 2020

作者： Ray, Soujanya Chatterjee, Kingshuk Majumdar, Ritaji Ganguly, Debayan Department of Computer Science and Engineering Netaji Subhash Engineering College Kolkata India Department of Computer Science Government College of Engineering and Ceramic Technology Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science Government College of Engineering and Leather Technology Kolkata India

ISBN: (纸本)9789811578335

Social network science and social interaction science is an interesting and steadily growing field of research in current time. Social network influences the lives of millions, and therefore the propagation of influence in such a network deserves study. In this paper, we have studied voting in a Watts-Strogatz small-world network for two parties. In our model, each node has an initial bias towards one of the parties (or can be neutral) and are influenced by their neighbours to vote for a particular party. We show via simulation that (i) for linear of logarithmic voting function, the small-scale variation is minimum, but the majority of the nodes tend to align towards one of the parties in the long term, (ii) for periodic voting function, the small-scale variations are sharp and oscillating, but in the long term the number of voters in each party roughly remains the same, (iii) the degree of the graph does not seem to have a strong influence on the result, and (iv) networks with higher small-world probability tend to resist the alignment of voters towards a particular party for a longer time as compared to networks with lower small-world probability. This majority voting model seems to efficiently capture the potential behaviour of voters on small-world network over a campaigning period. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Small-world networks

来源：评论

学校读者我要写书评

暂无评论

Gathering over Meeting Nodes in Infinite Grid

arXiv

引用

arXiv 2021年

作者： Bhagat, Subhash Chakraborty, Abhinav Das, Bibhuti Mukhopadhyaya, Krishnendu Département d’Informatique Université du Québec en Outaouais Canada Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

The gathering over meeting nodes problem asks the robots to gather at one of the predefined meeting nodes. The robots are deployed on the nodes of an anonymous two-dimensional infinite grid, which has a subset of nodes marked as meeting nodes. Robots are identical, autonomous, anonymous and oblivious. They operate under an asynchronous scheduler. They do not have any agreement on a global coordinate system. All the initial configurations for which the problem is deterministically unsolvable have been characterized. A deterministic distributed algorithm has been proposed to solve the problem for the remaining configurations. The efficiency of the proposed algorithm is studied in terms of the number of moves required for gathering. A lower bound concerning the total number of moves required to solve the gathering problem has been derived. Copyright © 2021, The Authors. All rights reserved.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Multihop D2D Communication to Minimize and Balance SAR in 5G

Multihop D2D Communication to Minimize and Balance SAR in 5G

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Avirup Das Nabanita Das Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9781728131870

ISBN: (纸本)9781728131887

To cope with the exponential growth in wireless traffic to be induced by the advancement of 5G and IoT technologies, higher frequency bands will be in use to achieve high performance. But this will enhance the associated electromagnetic field (EMF) around us and may have harmful effects on all living creatures and the environment, unless necesSARy precautionary measures are followed to limit it. In this paper, we propose an elegant method of band selection with appropriate data rate for multi-hop packet routing, to minimize and also to balance the transmission power and hence the associated EMF effect on us in terms of the Specific Absorption Rate (SAR). Theoretical analysis has been presented for linear networks that results an upper bound on the number of hops permitted for a given spectrum band. Simulation results on random networks show that the proposed technique achieves a 30 - 70% improvement in terms of SAR, compared to the conventional direct communication via base station.

关键词： Routing Wireless communication Spread spectrum communication Receivers Transmitters 5G mobile communication Base stations

来源：评论

学校读者我要写书评

暂无评论

Largest triangle inside a terrain 31

Largest triangle inside a terrain

引用

31st Canadian Conference on Computational Geometry, CCCG 2019

作者： Das, Arun Kumar Das, Sandip Mukherjee, Joydeep Advanced Computing and Microelectronics Unit Indian Statistical Institute Calcutta India

In this paper, we present an O(n2) time algorithm to find a largest area triangle contained inside a terrain with n vertices. We also present an O(n log n) time 1/2-factor approximation for the same. © CCCG 2019....

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mutual visibility by robots with persistent memory 1

引用

13th International Workshop on Frontiers in Algorithmics, FAW 2019

作者： Bhagat, Subhash Mukhopadhyaya, Krishnendu Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9783030181260

ISBN: (纸本)9783030181253

This paper addresses one of the fundamental geometric formation problems, namely the mutual visibility problem, for a set of semi-synchronous, opaque robots occupying distinct positions in the Euclidean plane. Since robots are opaque, if three robots lie on a line, the middle robot obstructs the visions of the two other robots. The mutual visibility problem requires the robots to coordinate their movements to form a configuration, within finite time and without collision, in which no three robots are collinear. We assume that robots are endowed with constant bits of persistent memory. We consider the computational model [4] in which the persistent memory is used by the robots only to remember their previous internal states. This piece of information is not communicated or visible to the other robots. Except from this persistent memory, robots are oblivious i.e., they do not carry forward any other information from their previous computational cycles. The paper presents a distributed algorithm to solve the mutual visibility problem for a set of semi-synchronous robots using only 1 bit of persistent memory. The proposed algorithm also provides a self-stabilizing solution to the problem. The algorithm does not impose any other restriction on the capability of the robots and guarantees collision-free movements for the robots. © Springer Nature Switzerland AG 2019.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Relay Selection in Millimeter Wave D2D Communications Through Obstacle Learning

Relay Selection in Millimeter Wave D2D Communications Throug...

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Subhojit Sarkar Sasthi C. Ghosh Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9781728131870

ISBN: (纸本)9781728131887

There has been growing interest in device to device (D2D) millimeterwave (mmwave) communication, due to the promising high speeds and immense amounts of unused bandwidth available. However, mmwaves suffer from unusually high attenuation, through free space, and especially through obstacles. The accepted way to avoid such attenuation is to break up the transmission path into multiple short hops, such that there are no obstacles between nodes. We extend the possibility of using a global positioning system (GPS) based, location aware, centralized approach to the problem of relay selection. Satellite imagery can be used to avoid static obstacles in the transmission path. However, satellite imagery cannot acquire smaller obstacles ones like bushes, trees and signboards. Moreover, depending on the size of the obstacle with respect to the heights of the mmwave base station (BS) and an user equipment (UE), presence of an obstacle does not guarantee obstruction. We propose a simple learning based approach to detect the presence of static as well as dynamic obstacles, without resorting to satellite imagery. We then use this knowledge to efficiently select an appropriate relay for a UE, lowering the chance of allocating an obstacle prone link. Finally we compare our relay selection algorithm with an existing algorithm and show that there is a significant improvement in the quality of link allocation.

关键词： Relays Long Term Evolution Global Positioning System Satellites Interference Attenuation Millimeter wave communication

来源：评论

学校读者我要写书评

暂无评论

Inter-AP Communication Protocol based Frequency Assignment in IEEE 802.11 WLAN

Inter-AP Communication Protocol based Frequency Assignment i...

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Babul P. Tewari Sasthi C. Ghosh Indian Institute of Information Technology Bhagalpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata India

ISBN: (数字)9781728191270

ISBN: (纸本)9781728191287

In IEEE 802. 11 wireless local area network (WLAN), dense deployment of access points (APs) often increases co-channel interference. This paper addresses an inter-hP communication protocol (IACP) based frequency assignment for dense WLAN. With the help of existing wired backbone the proposed approach considers a suitable IACP to design a new frequency assignment metric for the APs. The objective is to maximize the aggregate throughput of the network while avoiding the co-channel interference. The metric jointly considers the inter-AP communication delay and the obtained aggregate throughput while assigning a frequency to an AP. We first design a model describing the required parameters and protocol service primitives and then mathematically formulate the problem. As the problem is hard to solve, we have proposed a suitable greedy algorithm for the same. The proposed approach is simulated considering different network parameters and superiority of it over an existing approach is also established.

关键词： Measurement Wireless LAN Protocols Aggregates Throughput Delays Interchannel interference

来源：评论

学校读者我要写书评

暂无评论

Faster search of clustered marked states with lackadaisical quantum walks

arXiv

引用

arXiv 2021年

作者： Saha, Amit Majumdar, Ritajit Saha, Debasri Chakrabarti, Amlan Sur-Kolay, Susmita A. K. Choudhury School of Information Technology University of Calcutta India Advanced Computing & Microelectronics Unit Indian Statistical Institute India Atos Pune India

The nature of discrete-time quantum walk in the presence of multiple marked states has been studied by Nahimovs and Rivosh. They introduced an exceptional configuration of clustered marked states i.e., if the marked states are arranged in a √k × √k cluster within a √N × √N grid, where k = n2 and n an odd integer. They showed that finding a single marked state among the multiple ones using quantum walk with AKR (Ambainis, Kempe and Rivosh) coin requires Ω(√N − √k) time. Furthermore, Nahimov and Rivosh also showed that the Grover's coin can find the same configuration of marked state both faster and with higher probability compared to that with the AKR coin. In this article, we show that using lackadaisical quantum walk, a variant of a three-state discrete-time quantum walk on a line, the success probability of finding all the clustered marked states of this exceptional configuration is nearly 1 with smaller run-time. We also show that the weights of the self-loop suggested for multiple marked states in the state-of-the-art works are not optimal for this exceptional configuration of clustered mark states. We propose a range of weights of the self-loop from which only one can give the desired result for this configuration. © 2021, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：