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

IEEE International Symposium on Network computing and Applications

作者： Subhankar Ghosal Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

This paper presents a probabilistic greedy algorithm for solving the channel assignment problem (CAP) in cellular networks. We took each call as a vertex of a complete edge weighed graph, termed as CAP graph, where an edge weight represents the minimum frequency separation needed between the calls represented by the terminal vertices of that edge. Our objective is to assign non-negative integers representing colors or frequencies to the vertices of the CAP graph such that the required span (maximum frequency - minimum frequency) is minimized while satisfying the frequency separation constraints represented by the edge weights. We begin with a probabilistic ordering of the vertices and apply frequency exhaustive strategy to color them. During the coloring, when color of a vertex exceeds the maximum color of previously allocated vertices, we apply a forced assignment phase to reduce the so far obtained span. Finally we propose an iterative compression phase to further reduce the span obtained from applying the frequency exhaustive strategy with forced assignment phase. The proposed polynomial time algorithm is then applied over the well-known benchmark instances and the obtained spans are measured. The obtained results show that the proposed algorithm performs better that the existing assignment strategies with respect to deviation from optimality and computation time. The time taken by our algorithm is less than 1.77 seconds (HP Z400 Workstation) even for the most difficult benchmark instances and thus is very much suitable where fast channel assignment is of primary importance while a marginal deviation from optimality may be tolerated.

关键词： Color Benchmark testing Vectors Probabilistic logic Base stations Interference Greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

Minimal degenerate CSS quantum code with low cost circuit

arXiv

引用

arXiv 2019年

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

Error correction is of utmost necessity for large-scale quantum computing. Quantum error correcting codes can be degenerate, if more than one type of error can map the input state to the same error state. In this paper, we propose a 6-qubit degenerate CSS code. We show that our proposed code can correct a single bit flip error, but arbitrarily many phase flip errors occurring on the codeword. Furthermore, it follows from a bound on CSS codes that the proposed code is the minimal binary CSS code which can encode a single qubit of information. We also perform a comparative study of the gate count required for a fault tolerant decomposition of the error correction circuit for the proposed code, with that for the existing 9-qubit, 7-qubit and 5-qubit binary QEC codes. Our results show, on an average over the different technologies a savings of 98.14% in the gate count for the proposed code over that for the 5-qubit code. Significant improvement of around 50% in gate count is also obtained when compared to those for the 9-qubit and 7-qubit codes. Copyright © 2019, The Authors. All rights reserved.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

An RIS Deployment Strategy to Overcome Static Obstacles in Millimeter Wave D2D Communication

An RIS Deployment Strategy to Overcome Static Obstacles in M...

引用

IEEE International Symposium on Network computing and Applications

作者： Souvik Deb Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781665495516

Use of millimeter waves for short range device to device (D2D) communication is one of the most promising ways to provide high data rates. But millimeter waves are susceptible to blockages due to high penetration losses and hence require almost a line of sight (LoS) communication to provide such high data rates. When the direct LoS of a pair of devices is blocked by an obstacle, a reconfigurable intelligent surfaces (RIS) in the vicinity can be exploited to bypass the obstacle and achieve an indirect LoS between them. In this paper, we develop a strategy for placing minimum number of RISs in an environment filled with obstacles such that any pair of devices in the environment who does not have direct LoS can communicate via these RISs by establishing an indirect LoS. We convert this RIS placement problem to a set cover problem and give a greedy algorithm to get a near optimal but practical solution. This is done as a preprocessing step before the actual devices are deployed in the region. Next we present a strategy which knowing the actual deployment of the devices, selects a subset of the deployed RISs for operation together with their channel coefficients and phase shifts such that the system sum throughput of the devices is maximised. Finally simulation results show that strategically placed RISs can significantly improve system throughput in comparison to the existing deployment strategies.

关键词： Performance evaluation Greedy algorithms Millimeter wave devices Surface waves Simulation Reconfigurable intelligent surfaces Throughput

来源：评论

学校读者我要写书评

暂无评论

A Unified Approach for IP Protection across Design Phases in a Packaged Chip

A Unified Approach for IP Protection across Design Phases in...

引用

International Conference on VLSI Design

作者： Debasri Saha Susmita Sur-Kolay Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781424455416

IP values contributed by the distinct design tools in specific design phases, are recognized by observing the signature of the owner of each tool as functional or scan mode output of the fabricated chip, for certain input vector secret to the owner. An existing approach inserts watermark through reordering of single scan chain, and solely identifies the owner of the logic design tool. Here we propose a novel scheme to watermark the recent reconfigurable scan architectures, operating in both scan tree and single scan mode. The signature of the owner of physical design tool along with that of logic design tool can separately be embedded while designing the scan tree and also verified from the packaged chip without conflict using two distinct modes. A bi-objective minimization of overhead in routing and power is supported through our scheme. Experimental results on design overhead and robustness for ISCAS'89 benchmarks are encouraging.

关键词： Protection Packaging Watermarking Logic design Very large scale integration Intellectual property Observability Circuits Hardware Design optimization

来源：评论

学校读者我要写书评

暂无评论

LazyUAV: A Minimal Displacement Coverage Strategy for Multi-UAV mmWave Networks

LazyUAV: A Minimal Displacement Coverage Strategy for Multi-...

引用

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

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

Unmanned Aerial Vehicles (UAVs) are a potential platform for deploying millimeter wave (mmWave) base stations. Their high spatial flexibility makes them an attractive choice for the deployment in disaster management scenarios, and for offloading in crowded areas. Apart from the stringent propagation requirements of mmWaves, one challenge that has to be addressed is the limited power onboard a UAV, which is used to hover and move the device, and of course, to transmit data. In this paper, we deal with the deployment of UAVs with an aim to minimising their displacement in subsequent time. We take into consideration user mobility, and propose LazyUAV, a Set-Cover based geometric approach to minimise UAV displacement, while maintaining maximal coverage. Via extensive simulations, we demonstrate the effectiveness of our approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for D2D communication in 5G using stochastic model

A distributed algorithm for D2D communication in 5G using st...

引用

IEEE International Symposium on Network computing and Applications

作者： Durgesh Singh Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

Device to device (D2D) communication in 5G is on the spurge to compensate for the exponential increase in mobile users and their data requirements. In D2D communication, proximity users can communicate and control the links among themselves without the need of base station. This brings a real challenge to model the network to incorporate uncertainty which arises due to the mobility of users. We have developed a stochastic integer programming (SIP) based model to optimize the average network delay while keeping the packet loss below a threshold. This SIP model involves a probabilistic constraint which deals with conditional probability of link breakage in the next time instance given it was active at current time instance. By exploiting the SIP model, we have developed a greedy metric termed as connectivity factor (CF) which captures the nodes' mobility and hence takes care of link reliability which in turn controls packet loss and delay per hop. Based on CF we give a pure distributed greedy algorithm for forwarding the packets to an appropriate next hop node. Advantage of our algorithm to find an appropriate next hop node is that it requires only to compute the expectation and variance of path loss, which in turn can be computed from the distributions of mobility related parameters. Here we have used random walk mobility model for simplicity, but it can be extended to other mobility model with known relevant distributions. Through simulation we have shown that our proposed algorithm gives a significant improvement in packet loss due to mobility of nodes over the traditional received signal strength (RSS) based approach and an existing contention based forwarding (CBF) approach.

关键词： Packet loss Device-to-device communication Delays Mobile nodes

来源：评论

学校读者我要写书评

暂无评论

Non-optimal is Good! Resource Allocation in Presence of Dynamic Obstacles in D2D Networks

Non-optimal is Good! Resource Allocation in Presence of Dyna...

引用

Conference on Local Computer Networks (LCN)

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

To cope with high bandwidth demands of modern applications, device-to-device (D2D) communications using millimeter-wave (mmWave) signals are being harnessed. The major challenge of mmWave signals is that they require a strict, obstacle-free line-of-sight communication. Static obstacles are easier to avoid; dynamic obstacles pose the main hurdle, their movement not being known. In this work, we propose a way to learn link blockages due to dynamic obstacles, using the link activation history. For this, one might have to explore non-optimal link activations. This ensures that all links are tried a sufficient number of times, ensuring adequate knowledge about link failures, thus creating an exploration-exploitation dilemma. To this end, we propose a systematic way of exploring such non-optimal channel allocations, so that the number of link failures is minimized. Given the hardness of this problem, we devise a greedy solution, and show its effectiveness over existing strategies through simulations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Analytical Approach to Direct IP Protection of VLSI Floorplans

An Analytical Approach to Direct IP Protection of VLSI Floor...

引用

International Conference on Industrial and Information Systems, ICIIS

作者： Debasri Saha Susmita Sur-Kolay Advanced Computing & Microelectronics Unit Indian Statistical Institute Calcutta India

In the DSM VLSI technology, wide-spread design reuse to meet customer's requirements in time enhances the probability of infringement of intellectual property (IP) of VLSI physical design. In design storage or during design transmission between two parties, encryption of a design file is a well-known technique to protect a design against hacking, although it takes significantly long time to encrypt large design files. While encryption basically substitutes and shuffles the bits/ASCII values of a file to conceal the contents of the file, the IP value of a design obtained from optimized partitioning, floorplanning and placement can be protected by redistribution of design elements in the modules and exchanging the locations and orientations of the design modules. As security of design through perturbation exploits the basic properties of physical design, this technique is applicable to protect any intermediate phase, not restricted to binary/ASCII GDSII/OASIS file format only. In this paper, encoding moves for various floorplan representations are analyzed in terms of their time and space requirements. Experimental results on MCNC benchmarks are encouraging.

关键词： Protection Very large scale integration Cryptography Intellectual property Design optimization Encoding Space technology Degradation Field programmable gate arrays Region 10

来源：评论

学校读者我要写书评

暂无评论

A Randomized Algorithm for Joint Power and Channel Allocation in 5G D2D Communication

A Randomized Algorithm for Joint Power and Channel Allocatio...

引用

IEEE International Symposium on Network computing and Applications

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

We formulate the joint power and channel allocation problem (JPCAP) for device to device (D2D) communication as a cost minimization problem, where cost is defined as a linear combination of the number of channels used and total power requirement. We first show that JPCAP is NP-hard and then propose a greedy channel and power allocation (GCPA) algorithm to assign channels and powers to the links. We design GCPA in such a fashion that there exists an order of the links for which it produces optimum solution. Finally using GCPA we develop a randomized algorithm (RA) that increase the optimum hitting probability by an exponential factor of total number of links. Through simulation, we evaluate the performance of RA and show that RA outperforms an existing approach.

关键词： Device-to-device communication Interference Resource management Receivers Transmitters Channel allocation Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Optimal channel assignment in cellular networks with non-homogeneous demands

Optimal channel assignment in cellular networks with non-hom...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： S.C. Ghosh B.P. Sinha N. Das Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

This paper deals with the channel assignment problem (CAP) in a hexagonal cellular network with 2-band buffering, where the interference does not extend beyond two cells. Here, we first present new lower bounds on the required bandwidth for a cellular network with homogeneous demand /spl omega/, for various relative values of s/sub 0/, s/sub 1/, and s/sub 2/, the minimum frequency separations required to avoid interference for calls in the same cell, or in cells at distances one and two respectively, where s/sub 0//spl ges/s/sub 1//spl ges/s/sub 2/. Next we present some novel strategies for assigning channels to the cells of the entire cellular network with a homogeneous demand w using a genetic algorithm. We then show how these strategies for homogeneous demand can be extended to the cases with nonhomogeneous demand vector W=(w/sub i/), where w/sub i/ represents the channel requirement for cell i. Most interestingly, it shows that in some cases depending on s/sub 0/, s/sub 1/ and s/sub 2/ the required bandwidth is mainly determined by the maximum demand w/sub max/ in W. It shows that in terms of bandwidth requirement the case is almost equivalent with cellular networks having homogeneous demand w/sub max/. The technique also results optimal bandwidth solutions for all the eight well-known benchmark instances including the most difficult two.

关键词： Intelligent networks Land mobile radio cellular systems Bandwidth Interference Genetic algorithms Frequency Neural networks Simulated annealing Computer networks microelectronics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：