2016 Twenty Second National Conference on Communication (NCC)最新文献

筛选
英文 中文
A high efficiency 2.4GHz RF to DC converter using 130nm CMOS Cross-Coupled Rectifier 采用130nm CMOS交叉耦合整流器的高效率2.4GHz RF - DC变换器
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561175
K. Sanjeev, M. Machnoor, K. Vinoy, T. Prabhakar
{"title":"A high efficiency 2.4GHz RF to DC converter using 130nm CMOS Cross-Coupled Rectifier","authors":"K. Sanjeev, M. Machnoor, K. Vinoy, T. Prabhakar","doi":"10.1109/NCC.2016.7561175","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561175","url":null,"abstract":"This paper presents a design of a high efficiency RF-DC converter which can operate at an RF input power of -20 dBm (10 μW) at 2.4 GHz. The design is done in UMC 130nm MM/RF CMOS technology. RF to DC Power Conversion Efficiency (PCE) is considered as the performance metric. Fully Gate Cross-Coupled Rectifier (FGCCR) is used for RF-DC conversion, impedance matched to 50 Ω and the circuit parameters are optimized. Simulation results show that the circuit gives a DC output of 5.5 μW (55% PCE) at 0.267 V for a load of 13 kΩ. A protection circuit to limit internal voltages at high input power is designed.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127901030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Convergence rate analysis of smoothed LASSO 光滑LASSO的收敛速度分析
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561090
Subhadip Mukherjee, C. Seelamantula
{"title":"Convergence rate analysis of smoothed LASSO","authors":"Subhadip Mukherjee, C. Seelamantula","doi":"10.1109/NCC.2016.7561090","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561090","url":null,"abstract":"The LASSO regression has been studied extensively in the statistics and signal processing community, especially in the realm of sparse parameter estimation from linear measurements. We analyze the convergence rate of a first-order method applied on a smooth, strictly convex, and parametric upper bound on the LASSO objective function. The upper bound approaches the true non-smooth objective as the parameter tends to infinity. We show that a gradient-based algorithm, applied to minimize the smooth upper bound, yields a convergence rate of O (1/K), where K denotes the number of iterations performed. The analysis also reveals the optimum value of the parameter that achieves a desired prediction accuracy, provided that the total number of iterations is decided a priori. The convergence rate of the proposed algorithm and the amount of computation required in each iteration are same as that of the iterative soft thresholding technique. However, the proposed algorithm does not involve any thresholding operation. The performance of the proposed technique, referred to as smoothed LASSO, is validated on synthesized signals. We also deploy smoothed LASSO for estimating an image from its blurred and noisy measurement, and compare the performance with the fast iterative shrinkage thresholding algorithm for a fixed run-time budget, in terms of the reconstruction peak signal-to-noise ratio and structural similarity index.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126892961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Coded caching in hybrid networks 混合网络中的编码缓存
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561083
Abhinav Sridhar, N. Karamchandani, V. Prabhakaran
{"title":"Coded caching in hybrid networks","authors":"Abhinav Sridhar, N. Karamchandani, V. Prabhakaran","doi":"10.1109/NCC.2016.7561083","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561083","url":null,"abstract":"Caching networks have been extensively studied from an information-theoretic perspective for various network topologies. In particular device-to-device (D2D) topologies have been considered and it has been shown that rates similar to a centralized server setup can be achieved. Hierarchical networks with an intermediate layer of cache called mirrors between the server and the users have been looked at previously and approximately optimal schemes have been developed. In this paper we consider a more general hybrid network, where the mirrors in hierarchical network are connected to form a D2D network in between the server and the end users. We study the trade-off between the sum-rate in the D2D network and the server transmission rate, to understand the extent to which the D2D network can act as a substitute for the server. To this end, we propose an achievable scheme to operate the network for any values of mirror and user cache memory, and prove that is optimal up to a constant additive and multiplicative gap.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122241536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel pCDC ROADM architecture using MxN WSS 采用MxN WSS的新型pCDC ROADM架构
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561085
A. Gumaste, S. Mahale, Aniruddha Kushwaha, N. Bajaj, V. Tamarapalli
{"title":"A novel pCDC ROADM architecture using MxN WSS","authors":"A. Gumaste, S. Mahale, Aniruddha Kushwaha, N. Bajaj, V. Tamarapalli","doi":"10.1109/NCC.2016.7561085","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561085","url":null,"abstract":"A novel partial Colorless-Directionless-Contentionless and gridless ROADM architecture using a MxN Wavelength Selective Switch (WSS) as a base building block is proposed. The MxN WSS allows us to create an interesting trade-off between cost and features in a contentionless environment. An argument is placed for a partial CDC-gridless ROADM architecture that is of a lower cost than all other combinations and achieves almost similar functionality compared to a full CDC design. Extensive simulations verify our claim over three different core network topologies as well as test our architecture for 100Gbps transmission requirements.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131807507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
IIIT-S CSSD: A Cough Speech Sounds Database 咳嗽语音数据库
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561190
Vishwanath P. Singh, J. Rohith, Yash Mittal, V. K. Mittal
{"title":"IIIT-S CSSD: A Cough Speech Sounds Database","authors":"Vishwanath P. Singh, J. Rohith, Yash Mittal, V. K. Mittal","doi":"10.1109/NCC.2016.7561190","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561190","url":null,"abstract":"Paralinguistic sounds such as laughter, cry and cough etc. communicate different messages as well, apart from the linguistic content in speech. These non-verbal speech sounds may possibly communicate some emotion, gesture or physiological condition of a human being. Cough sounds mostly indicate symptoms of a disease and are used sometimes as a gesture to draw attention. Analysing cough sounds using speech signal processing methods can be useful for assisting the medical experts in ailment diagnosis, and also for making machines more intelligent and human-like. This paper describes a database collected for cough speech sounds, named as IIIT-S CSSD. The database consists of three categories, namely, ailment cough, simulated cough and normal speech. Normal speech is recorded for each speaker, as a reference. Spectrograms are used as ground truth reference for preliminary analysis. This database can be helpful in analysing further the differences in cough sounds of different categories such as dry and wet cough, involuntary and voluntary cough, ailment and simulated cough, or age-wise differences in cough sounds etc. Few signal processing methods and initial analysis results indicating the differences in characteristics of different cough sounds are also discussed.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129127237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
K-mean clustering based cooperative spectrum sensing in generalized к-μ fading channels 基于k均值聚类的广义衰落信道协同频谱感知
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561130
Vaibhav Kumar, Deepika Kandpal, Monika Jain, R. Gangopadhyay, Soumitra Debnath
{"title":"K-mean clustering based cooperative spectrum sensing in generalized к-μ fading channels","authors":"Vaibhav Kumar, Deepika Kandpal, Monika Jain, R. Gangopadhyay, Soumitra Debnath","doi":"10.1109/NCC.2016.7561130","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561130","url":null,"abstract":"Machine learning based approaches for spectrum sensing and spectrum occupancy prediction in cognitive radio applications appear to have attracted sufficient interest in the current literature. In this paper, K-mean clustering based unsupervised learning method has been adopted for the performance enhancement of cooperative spectrum sensing in generalized κ-μ fading channels. Extensive simulation has been carried out for different system parameter trade-off in characterizing the receiver operating characteristics.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126362507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
Mask Region Grow segmentation algorithm for low-computing devices 低计算设备的掩码区域增长分割算法
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561200
S. Prasad, S. K. Peddoju, D. Ghosh
{"title":"Mask Region Grow segmentation algorithm for low-computing devices","authors":"S. Prasad, S. K. Peddoju, D. Ghosh","doi":"10.1109/NCC.2016.7561200","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561200","url":null,"abstract":"In this paper, we present an efficient and accurate mobile-based mask region grow (MRG) algorithm for natural scene segmentation. The algorithm is divided into three modules: first the captured RGB image is transformed to L*a*b* color space, then a suitable mask is generated and finally MRG is applied. The proposed MRG is best suitable for segmenting multiple foreground objects of single type from complex background, as compared to other existing segmentation algorithms. For validation MRG is tested with different types of challenging datasets including natural plant leaf, flowers and other images available from Internet sources. It is found that MRG is one very fast and accurate segmentation algorithm.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133244527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Denial of service attack on low rate wireless personal area networks 低速率无线个人区域网络的拒绝服务攻击
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-01 DOI: 10.1109/NCC.2016.7561148
Rakesh Matam, S. Tripathy
{"title":"Denial of service attack on low rate wireless personal area networks","authors":"Rakesh Matam, S. Tripathy","doi":"10.1109/NCC.2016.7561148","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561148","url":null,"abstract":"IEEE 802.15.4 standard is used for low data rate, low power and short-range radio frequency transmission devices to form a personal area network (PAN). As part of the standard, the MAC sublayer provides security services to protect MAC frames while recommends the implementation of security features at higher layers of protocol stack. This work presents a denial of service attack exploiting the PAN ID conflict notification MAC command frame. Further, some simple but effective solutions to address this form of attack is discussed and analysed.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124394824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Segmentation of Carnatic music items using KL2, GMM and CFB energy feature 利用KL2、GMM和CFB能量特征对卡纳蒂克音乐项目进行分割
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-01 DOI: 10.1109/NCC.2016.7561209
Krishnaraj Sekhar Pv, Sridharan Sankaran, H. Murthy
{"title":"Segmentation of Carnatic music items using KL2, GMM and CFB energy feature","authors":"Krishnaraj Sekhar Pv, Sridharan Sankaran, H. Murthy","doi":"10.1109/NCC.2016.7561209","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561209","url":null,"abstract":"Every Carnatic music concert is made up of many musical items. Every musical item has a lyrical composition (kriti) which can be optionally preceded by an a̅la̅pana̅ segment. The duration of the a̅la̅pana̅ along with the ra̅ga̅ in which the a̅la̅pana̅ has been rendered is a strong indication of an artist's creativity and musical knowledge. Hence automatic segmentation of an item to extract the a̅la̅pana̅ segment is of great value in qualitative assessment of a concert. Segmenting a musical item into a̅la̅pana̅ and kriti has applications in musical retrieval. To find the boundary between a̅la̅pana̅ and kriti, KL2 distance on Cent Filterbank Energy feature is used that locates change in timbre property. A GMM is used to verify the boundary. To further improve the accuracy of segmentation, rules based on musical domain knowledge are automatically applied. Using this approach a frame-level accuracy of 91.34% was obtained.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129823559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Intrusion detection system for identification of throughput degradation attack on TCP 入侵检测系统用于识别对TCP的吞吐量退化攻击
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-01 DOI: 10.1109/NCC.2016.7561150
A. Bhandari, Mayank Agarwal, S. Biswas, Sukumar Nandi
{"title":"Intrusion detection system for identification of throughput degradation attack on TCP","authors":"A. Bhandari, Mayank Agarwal, S. Biswas, Sukumar Nandi","doi":"10.1109/NCC.2016.7561150","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561150","url":null,"abstract":"Improving Transmission Control Protocol (TCP) robustness and evaluation of its performance under attacks such as Denial-of-Service, Degradation-of-Service etc. has always been an area of active research. In this paper, we analyze a variant of degradation of service attacks against TCP that makes use of forged duplicate acknowledgments in order to degrade the throughput of an on-going connection. The receipt of three (forged) duplicate acknowledgments is an indicator towards the presence of congestion on the route between the server and client. To cope up with the congestion, the server reduces the congestion window resulting in throughput reduction. As the semantics of the attack remains the same under normal and attack conditions, the signature and anomaly based Intrusion Detection System (IDS) fail to detect the throughput degradation attack. We also propose an active IDS in order to detect the attack. An active IDS is capable of injecting packets in to the network in order to create difference between normal and attack scenarios. The simulation experiments are carried out to check the validity of proposed detection scheme. The proposed scheme is light weight and can be easily deployed on existing systems.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115941070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信