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

36th IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, DFT 2023

作者： Chaurasia, Rahul Reddy Asireddy, Abhinav Sengupta, Anirban Indian Institute of Technology Computer Science and Engineering Indore India Indian Institute of Technology Department of Computer Science and Engineering Indore India Indian Statistical Institute Advanced Computing and Microelectronics Unit Kolkata India

ISBN: (纸本)9798350315004

This paper presents a novel methodology to design fault secured JPEG-compression-decompression (codec) hardware accelerator with piracy detective control using secure fingerprint template of intellectual property (IP) vendor. In the proposed approach, firstly, the fault secured schedule for JPEG-codec design is generated from its behavioral description. Subsequently, in order to enable detective control against piracy, secure digital template corresponding to fingerprint biometric of IP vendor is generated and implanted into the design. In order to do so, firstly, fingerprint features are transformed based on IP vendor specified key-set. Subsequently, the generated secure fingerprint template in the form of encoded hardware security constraints is implanted into the design during behavioral/ high-level synthesis phase of integrated circuit (IC) design. The implanted hardware security constraints thereby ensure the seamless detection and isolation of fake/pirated design versions during piracy detection process, before their conjunction into system on chip (SoC) of electronic systems. The proposed approach achieves the following: i) fault secured hardware accelerator for JPEG-codec with integrated piracy detective control at negligible design cost overhead ii) higher resiliency against tampering attack and iii) lower probability of coincidence (indicating definitive proof of ownership for genuine IP vendor). © 2023 IEEE.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

A Study on the Problems of Dispersion and Exploration on Graph Topology 22

A Study on the Problems of Dispersion and Exploration on Gra...

引用

23rd International Conference on Distributed computing and Networking, ICDCN 2022

作者： Das, Archak Bose, Kaustav Sau, Buddhadeb Mathematics Jadavpur University India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781450395601

In this paper we discuss two important problems: Dispersion and Exploration. We have provided two optimal algorithms for each of them. For Dispersion we have provided an algorithm which is optimal in terms of memory complexity and for Exploration we have given an algorithm which is optimal in terms of number of robots in a dynamic ring. We give a brief idea about our algorithms and novelty of our techniques. © 2022 ACM.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Constructing Rectilinear Steiner Minimum Tree with Conditional Generative Adversarial Network 38

Constructing Rectilinear Steiner Minimum Tree with Condition...

引用

38th International Conference on VLSI Design, VLSID 2025

作者： Saha, Kritanta Banerjee, Pritha Sur-Kolay, Susmita Indian Statistical Institute Advanced Computing and Microelectronics Unit Kolkata India Sister Nivedita University Department of Computer Science and Engineering Kolkata India University of Calcutta Department of Computer Science and Engineering Kolkata India

ISBN: (纸本)9798331522445

Given n points in the 2D plane which are the pins of a net, a Rectilinear Steiner Minimum Tree (RSMT) which consists only of vertical and horizontal line segments is the shortest network to interconnect the pins along with a few extra (Steiner) points. An RSMT for a net has a minimum total wirelength in Manhattan distance and acts as a backbone to many state-of-the-art global routers. However, finding an RSMT is NPcomplete. In this work, we propose a method for constructing an RSMT with an image-to-image translation using a conditional generative adversarial network (cGAN) based model. Images of RSMTs with optimal wirelength for randomly generated nets form our training dataset. Experimental results show that, after training, our model generates RSMTs with = 0.348% wirelength error on average compared with the optimal solution for nets with degrees up to 50. This is the first successful attempt to solve the RSMT construction problem as an image-to-image translation problem using a cGAN based model. © 2025 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Priority aware grouping-based multihop routing scheme for RIS-assisted wireless networks

arXiv

引用

arXiv 2024年

作者： Sau, Lakshmikanta Mukherjee, Priyadarshi Ghosh, Sasthi C. The Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata700108 India

Reconfigurable intelligent surfaces (RISs) is a novel communication technology that has been recognized and recently presented as a candidate for beyond fifth generation wireless communication technology. In this paper, we propose a priority aware user traffic dependent grouping based multihop routing scheme for a RIS-assisted millimeter wave (mmWave) device-to-device (D2D) communication network with spatially correlated channels. Specifically, the proposed scheme exploits the priority of the users (based on their respective delay constrained applications) and the aspect of spatial correlation in the narrowly spaced reflecting elements of the RISs. In this context, we establish a multihop connection for information transfer from one of the users to its desired receiver based on the other users in the neighbourhood, their respective traffic characteristics, and the already deployed RISs in the surroundings. Moreover, we also take into account the impact of considering practical discrete phase shifts at the RIS patches instead of its ideal continuous counterpart. Furthermore, we claim as well as demonstrate that the existing classic least remaining distance (LRD)-based approach is not always the optimal solution. Finally, numerical results demonstrate the advantages of the proposed strategy and that it significantly outperforms the existing benchmark schemes in terms of system performance metrics such as data throughput, energy consumption, as well as energy efficiency. © 2024, CC BY-NC-SA.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Analysis of the Delay in RIS Assisted SISO D2D Communication Using Chernoff’s Bounds 3rd

A Probabilistic Analysis of the Delay in RIS Assisted SIS...

引用

3rd International Conference on Computer and Communication Engineering, CCCE 2023

作者： Singh, Durgesh Ghosh, Sasthi C. School of Computer Science University of Petroleum and Energy Studies Dehradun248007 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India

ISBN: (纸本)9783031352980

Reflecting intelligent surface (RIS) assisted millimeter wave (mmWave) device to device (D2D) communication in single input single output (SISO) mode is considered. RIS can bypass the blocked D2D pairs since mmWaves are highly susceptible to blockages. However, the RIS is composed of passive elements which cannot accurately measure the state of the given channel and may suffer outages from moving obstacles (blockages) or due to moving devices (communication out of range) causing uncertainty in link quality. Each data packet will have some probability to be successfully transmitted towards the destination device via a RIS in each time unit. When a packet is lost it has to be re-transmitted which will induce extra delay. In this paper, the impact of link success probability on delay is studied. A lower bound on delay such that all packets are received successfully for the given link success probability has been derived. Later, we have derived a new term called apparent success probability which captures the trade-off between delay and link success probability. Simulations are performed which conforms with the derived theoretical results. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits 22

Message Complexity of Multi-Valued Implicit Agreement with S...

引用

23rd International Conference on Distributed computing and Networking, ICDCN 2022

作者： Bose, Kaustav Molla, Anisur Rahaman Advanced Computing and Microelectronics Unit Indian Statistical Institute India R. C. Bose Centre for Cryptology and Security Indian Statistical Institute India

ISBN: (纸本)9781450395601

An agreement protocol enables a system of n nodes in a distributed network to agree on a common input value. In the implicit version of the problem, only a subset of the nodes are required to decide the common value. This paper focuses on the message complexity of randomized implicit agreement in synchronous distributed networks. It has been shown by Augustine et al. [PODC 2018] that if the nodes have access to a shared coin, then implicit agreement can be solved with high probability1 using messages2 in expectation. However, their algorithm works only for binary input values, i.e, the input values given to the nodes are from the set {0, 1}. In this paper, we extended the result to the multi-valued setting where the input values may come from a larger but constant sized domain. We present an algorithm that solves the multi-valued implicit agreement problem with matching performance guarantees as in binary agreement. © 2022 ACM.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Pattern Formation by Autonomous Robot Swarm 22

Distributed Pattern Formation by Autonomous Robot Swarm

引用

23rd International Conference on Distributed computing and Networking, ICDCN 2022

作者： Bose, Kaustav Adhikary, Ranendu Kundu, Manash Kumar Das, Archak Sau, Buddhadeb Advanced Computing and Microelectronics Unit Indian Statistical Institute India Jadavpur University India Gayeshpur Government Polytechnic India

ISBN: (纸本)9781450395601

Arbitrary Pattern Formation is a fundamental robot coordination problem. The problem asks for a distributed algorithm that allows a swarm of autonomous mobile robots to form any pattern given as input. The majority of the works in the literature investigate the problem under models with very idealistic assumptions regarding motion and sensing capabilities of the robots. We investigate the problem, aiming towards removing these assumptions and understanding their effect on the solvability of the problem. © 2022 ACM.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Pattern Formation by Robots with Inaccurate Movements 25

Pattern Formation by Robots with Inaccurate Movements

引用

25th International Conference on Principles of Distributed Systems, OPODIS 2021

作者： Bose, Kaustav Das, Archak Sau, Buddhadeb Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Mathematics Jadavpur University Kolkata India

ISBN: (纸本)9783959772198

Arbitrary Pattern Formation is a fundamental problem in autonomous mobile robot systems. The problem asks to design a distributed algorithm that moves a team of autonomous, anonymous and identical mobile robots to form any arbitrary pattern F given as input. In this paper, we study the problem for robots whose movements can be inaccurate. Our movement model assumes errors in both direction and extent of the intended movement. Forming the given pattern exactly is not possible in this setting. So we require that the robots must form a configuration which is close to the given pattern F. We call this the Approximate Arbitrary Pattern Formation problem. With no agreement in coordinate system, the problem is unsolvable, even by fully synchronous robots, if the initial configuration 1) has rotational symmetry and there is no robot at the center of rotation or 2) has reflectional symmetry and there is no robot on the reflection axis. From all other initial configurations, we solve the problem by 1) oblivious, silent and semi-synchronous robots and 2) oblivious, asynchronous robots that can communicate using externally visible lights. © Kaustav Bose, Archak Das, and Buddhadeb Sau.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Time varying channel estimation for RIS assisted network with outdated CSI: Looking beyond coherence time

arXiv

引用

arXiv 2024年

作者： Deb, Souvik Ghosh, Sasthi C. Advanced Computing & Microelectronics Unit Indian Statistical Institute West Bengal Kolkata700108 India

The channel estimation (CE) overhead for unstructured multipath-rich channels increases linearly with the number of reflective elements of reconfigurable intelligent surface (RIS). This results in a significant portion of the channel coherence time being spent on CE, reducing data communication time. Furthermore, due to the mobility of the user equipment (UE) and the time consumed during CE, the estimated channel state information (CSI) may become outdated during actual data communication. In recent studies, the timing for CE has been primarily determined based on the coherence time interval, which is dependent on the velocity of the UE. However, the effect of the current channel condition and pathloss of the UEs can also be utilized to control the duration between successive CE to reduce the overhead while still maintaining the quality of service. Furthermore, for muti-user systems, the appropriate coherence time intervals of different users may be different depending on their velocities. Therefore CE carried out ignoring the difference in coherence time of different UEs may result in the estimated CSI being detrimentally outdated for some users. In contrast, others may not have sufficient time for data communication. To this end, based on the throughput analysis on outdated CSI, an algorithm has been designed to dynamically predict the next time instant for CE after the current CSI acquisition. In the first step, optimal RIS phase shifts to maximise channel gain is computed. Based on this and the amount of degradation of SINR due to outdated CSI, transmit powers are allocated for the UEs and finally the next time instant for CE is predicted such that the aggregated throughput is maximized. Simulation results confirm that our proposed algorithm outperforms the coherence time-based strategies. © 2024, CC BY.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Joint Base Station and Reflector Placement in an urban mmWave Network

Joint Base Station and Reflector Placement in an urban mmWav...

引用

Communications and Networking (MeditCom), IEEE International Mediterranean Conference on

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

Millimeter-wave (mmWave) technology is expected to be the backbone of future communication networks. However, for all its benefits, mmWave communication comes with its fair share of challenges. In this context, the obstacle free strict line-of-sight (LOS) requirement is one of the primary hurdles that has to be crossed. One way to deal with this problem is to densely deploy small range base stations, called gNBs, to overcome outage due to obstacles. Reflectors have been proposed to augment the transmission environment, and reflect mmWaves bypassing the obstacles. Evidently, they can be used to increase the coverage area that do not have LOS with the available gNBs. We argue that considering the placement of gNBs and reflectors independently may lead to suboptimal solution. In this paper, we consider an urban deployment scenario, and attempt to maximally cover it by jointly placing the gNBs and reflectors. Given the hardness of the joint problem, we first develop a set cover based greedy solution and also provide a linear programming (LP) relaxation based solution. With extensive simulations, we show that with fixed number of available gNBs and reflectors to be placed, both our joint placement solutions can achieve a larger coverage compared to an existing approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：