2013 National Conference on Communications (NCC)最新文献

筛选
英文 中文
Power allocation for OFDM-based cognitive radio systems under average interference constraint 平均干扰约束下ofdm认知无线电系统的功率分配
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6487934
K. Kulkarni, Adrish Banerjee
{"title":"Power allocation for OFDM-based cognitive radio systems under average interference constraint","authors":"K. Kulkarni, Adrish Banerjee","doi":"10.1109/NCC.2013.6487934","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487934","url":null,"abstract":"Power loading algorithms discussed in literature assume a static spectrum scenario where number of primary users remains constant in transmission period of cognitive user. In practice, new primary users can arrive or active primary users can depart at any time. In this paper we propose a new centralized power allocation technique taking into consideration arrival and departure of primary users that maximizes total capacity of cognitive user while honoring an average interference constraint. We also present numerical results to show that for known arrival and departure probabilities, the proposed method provides better primary protection than other static scenario based methods.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126853125","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}
引用次数: 6
Performance analysis of BitTorrent protocol BitTorrent协议性能分析
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6488040
Parul Sharma, Anuja Bhakuni, Rishabh Kaushal
{"title":"Performance analysis of BitTorrent protocol","authors":"Parul Sharma, Anuja Bhakuni, Rishabh Kaushal","doi":"10.1109/NCC.2013.6488040","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488040","url":null,"abstract":"BitTorrent protocol has been quite successful in capturing majority of Internet traffic since its inception due to its various mechanisms to improve the download performance of the network. The mechanisms like tit-for-tat, optimistic unchoking, anti-snubbing and various piece selection strategy, etc. have been working very well. This work is an attempt to study the performance of BitTorrent protocol and its networking infrastructure through two strategies, namely, (A) Simulations based using BitTorrent patch in ns-2 simulator and (B) Real networks using client implementation based on libtorrent library. Empirical results thus obtained are used to infer various performance parameters of BitTorrent protocols.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"973 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114426411","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}
引用次数: 10
Call admission control for real-time traffic in OFDMA based cellular networks 基于OFDMA的蜂窝网络实时业务的呼叫接纳控制
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6488020
S. Batabyal, Suvra Shekhar Das
{"title":"Call admission control for real-time traffic in OFDMA based cellular networks","authors":"S. Batabyal, Suvra Shekhar Das","doi":"10.1109/NCC.2013.6488020","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488020","url":null,"abstract":"We evaluate the Grade of Service (GoS) provided by some call admission control (CAC) schemes for real-time traffic in OFDMA cellular networks. We consider simple first come first served (FCFS) based CAC as the reference and compare schemes such as GoS fair, proportional channel fair allocation etc. These schemes are static bandwidth partitioning based CAC schemes. A dynamic CAC scheme that improves GoS fairness within the cell is also proposed. It is shown to provide increased fairness without the steep reduction in Erlang capacity entailed by the static bandwidth partitioning schemes. Discrete event simulations are used to verify the performance improvement with this dynamic CAC scheme.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"83 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123433943","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
Development of a remote lab with micro-processor & DSP with FPGA accelerator 基于FPGA加速器的微处理器和DSP远程实验室的开发
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6488029
A. Kulkarni, A. Jhunjhunwala
{"title":"Development of a remote lab with micro-processor & DSP with FPGA accelerator","authors":"A. Kulkarni, A. Jhunjhunwala","doi":"10.1109/NCC.2013.6488029","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488029","url":null,"abstract":"This paper describes and discusses the setting up of a DSP Cloud Lab, a setup to execute programs remotely. The programs can be executed on a variety of DSP boards; they could be microprocessor assembly language programs or programs written in assembly language requiring powerful DSP boards or even DSP boards with an FPGA accelerator. The boards used are based on Blackfin Architecture. For a student / developer who writes codes and tests on it, it appears as if they have exclusive use of the boards. However, the boards are highly shared, enabling a large number of students / developers to use them simultaneously. This paper also discusses the design choices made at different stages and the extent to which it facilitates or restricts the use of the DSP boards for a developer.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129868326","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
Performance analysis of double correlated selection combining for cooperative diversity systems 合作分集系统双相关选择组合性能分析
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6487899
S. R., M. D. Selvaraj, R. Roy
{"title":"Performance analysis of double correlated selection combining for cooperative diversity systems","authors":"S. R., M. D. Selvaraj, R. Roy","doi":"10.1109/NCC.2013.6487899","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487899","url":null,"abstract":"Cooperative diversity is a viable technique to improve the communication reliability and the system throughput. We consider a system comprising of a source (S), a relay (R) and a destination (D). Relay cooperation is achieved through decode and forward protocol. A realistic scenario which considers correlation between SD and RD links is a hardly dealt topic in the literature. Hence, in this paper, a comprehensive effort has been taken to analyse a single-relay cooperative diversity system with selection combining over correlated Nakagami-m fading environment by assuming the correlation between SD and RD links. We derive the end-to-end symbol error probability (SEP) in closed form for M-ary phase shift keying (MPSK) signalling using paired error approach. The analytical results are validated through Monte-Carlo simulations.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125288686","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}
引用次数: 4
Low complexity detail preserving multi-exposure image fusion for images with balanced exposure 低复杂度细节保留多曝光图像融合图像平衡曝光
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6488013
Ashish V. Vanmali, Sanket Deshmukh, V. Gadre
{"title":"Low complexity detail preserving multi-exposure image fusion for images with balanced exposure","authors":"Ashish V. Vanmali, Sanket Deshmukh, V. Gadre","doi":"10.1109/NCC.2013.6488013","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488013","url":null,"abstract":"Multi-exposure image fusion has undergone considerable growth in the last few years, but the challenge still remains to design an algorithm which is efficient in fusion yet low in complexity, such that it can be implemented for real time applications on embedded platforms which have low computational power. A simple, low complexity algorithm for multi-exposure image fusion is proposed in this paper to cater to this need. The algorithm is designed for the image sequences that spread evenly over the exposure range, without any bias towards under or overexposedness. The fusion algorithm assigns weights to pixels of images to be fused, based on the exposure of the input images. The fusion algorithm is free from filtering and transformation, and is carried out on per pixel basis, thus making it highly efficient in terms of computational complexity. The experimental results show that our algorithm produces visually comparable results with some of the commonly used algorithms, which are computationally much more complex. Also, the proposed algorithm is immune to ghosting artifacts caused due to spatial misalignment of the input images.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125296954","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}
引用次数: 16
Speaker verification in noisy environment using GMM supervectors 基于GMM超向量的噪声环境下说话人验证
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6487995
Sourjya Sarkar, K. S. Rao
{"title":"Speaker verification in noisy environment using GMM supervectors","authors":"Sourjya Sarkar, K. S. Rao","doi":"10.1109/NCC.2013.6487995","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487995","url":null,"abstract":"This paper explores the GMM-SVM combined approach for Text-Independent speaker verification in noisy environment. In recent years supervectors constructed by stacking the means of adapted Gaussian Mixture Models (GMMs) have been used successfully for deriving sequence kernels. Support Vector Machines (SVMs) trained using such kernels provide further improvement in classification accuracy. Analysis of the behavior of such hybrid systems towards simulated noisy data is the object of our study. In our work we have used the KL-divergence and GMM-UBM mean interval kernels for SVM training. All experiments are conducted on NIST-SRE-2003 database with training and test utterances degraded by noises (car, factory & pink) collected from the NOISEX-92 database, at 5dB & 10dB SNRs. A significant improvement of performance is observed in comparison to the traditional GMM-UBM based system.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128751662","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}
引用次数: 7
Broadband sectoral antenna array using printed dipole with reflector for wider beam coverage in H-plane 采用带反射面印刷偶极子的宽带扇形天线阵列,可在h平面上实现更宽的波束覆盖
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6487908
P. Mishra, G. Kumar
{"title":"Broadband sectoral antenna array using printed dipole with reflector for wider beam coverage in H-plane","authors":"P. Mishra, G. Kumar","doi":"10.1109/NCC.2013.6487908","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487908","url":null,"abstract":"This paper presents design of broadband sectoral antenna array using printed dipole with reflector to achieve wider beam coverage in H-plane. The antenna is designed for 5.8 GHz frequency band. The parametric analysis of printed dipole antenna with reflector is carried out to optimize antenna design for achieving wider coverage in H-plane. The 16×1 antenna array is designed using tapered integrated balun on each dipole element and corporate feed network. 16×1 antenna array achieves VSWR<2 bandwidth of 12% and maximum gain of 15 dBi at 5.8 GHz with back lobe level<15 dB. The measured results of a printed dipole antenna with reflector are presented.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127822014","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
Novel rate-jitter control algorithms for TDMoIP 一种新的TDMoIP速率抖动控制算法
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6488028
M. Sikha, M. R
{"title":"Novel rate-jitter control algorithms for TDMoIP","authors":"M. Sikha, M. R","doi":"10.1109/NCC.2013.6488028","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488028","url":null,"abstract":"TDMoIP is the emulation of Time Division Multiplexing (TDM) over Packet Switched Network (PSN), say IP. When TDM traffic is packetized and injected into a PSN for transportation, packets arrive at the destination with different inter-arrival times, due to variable delay (jitter) introduced by PSN. This network induced jitter should be minimized, because TDM traffic is highly synchronous. Problem of jitter from theoretical (competitive and statistical analysis) to more practical view point had been well studied [1], [6]–[9]. In this paper, we have proposed two on-line algorithms, algorithm-A and algorithm-B to control the rate-jitter. We have shown both analytically and by simulation that the rate-jitter achieved by algorithm-A is strictly less than the rate-jitter of on-line algorithm proposed in [1] and through simulations, it is shown that algorithm-B also achieves less rate-jitter compared with [1]. We also undertake the statistical analysis of above algorithms, in particular, we modeled jitter buffer as an M/D̃/1/Bon queue and steady state queue length distribution is calculated. The correctness of the analytical results corresponding to our proposed algorithms is verified with simulation results. From the simulation results, it is also shown that the mean waiting time of a packet in the buffer is less for both the proposed algorithms compared with [1].","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126146464","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
Matrix adaptive synthesis filter for uniform filter bank 均匀滤波器组的矩阵自适应合成滤波器
2013 National Conference on Communications (NCC) Pub Date : 2013-03-28 DOI: 10.1109/NCC.2013.6487978
Sandeep Patel, R. Dhuli, Brejesh Lall
{"title":"Matrix adaptive synthesis filter for uniform filter bank","authors":"Sandeep Patel, R. Dhuli, Brejesh Lall","doi":"10.1109/NCC.2013.6487978","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487978","url":null,"abstract":"In this paper, we use a matrix adaptive filter as the synthesis stage of a Uniform Filter Bank (UFB) to reconstruct the input signal. We first develop the mathematical theory behind it by applying the model of optimal filtering at the synthesis stage of the UFB and obtaining an expression for the matrix Wiener filter. We have developed a theorem which we use to simplify the expression further. In the absence of required information about the analysis stage, we use adaptive filtering to arrive at the Wiener solution. We use the Least Mean Square (LMS) algorithm to update the filter coefficients. Through experimental results, we find that the adaptive filter is convergent for a stable Wiener filter.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126087273","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
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学术文献互助群
群 号:481959085
Book学术官方微信