发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
A new set of codes with swift decoding for overloaded synchronous CDMA 一种用于过载同步CDMA的快速译码新方法
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561097
Amiya Singh, Poonam Singh, A. Amini, F. Marvasti
{"title":"A new set of codes with swift decoding for overloaded synchronous CDMA","authors":"Amiya Singh, Poonam Singh, A. Amini, F. Marvasti","doi":"10.1109/NCC.2016.7561097","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561097","url":null,"abstract":"We consider the designing of a new set of uniquely decodable codes for uncoded synchronous overloaded CDMA system that exists for arbitrary values of spreading gain (code length). A fast and recursive method of construction is proposed where the orthogonal Hadamard matrix of least dimension (two), as the basis of construction regularizes a ternary pattern which is further leveraged to attain a rich simplicity in decoder design. The simplicity gained in designing of the proposed Comparison Aided Decoder (CAD) is prominent enough to neglect the marginal sacrifice in Bit Error Rate (BER) as compared to the optimum Maximum Likelihood Decoder (MLD) for noisy transmission. Despite its low complex nature, the detection retains it uniquely decodable (errorless) attribute in the absence of noise. Moreover, for large dimension of the proposed matrices, the loading capacity of the system as compared to the conventional CDMA gets a two fold enhancement.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"47 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":"134461294","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
Blind forensics method for GOP period detection in motion compensated video 运动补偿视频中GOP周期检测的盲取证方法
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561208
P. Ramakrishna, A. Mazumdar, P. Bora
{"title":"Blind forensics method for GOP period detection in motion compensated video","authors":"P. Ramakrishna, A. Mazumdar, P. Bora","doi":"10.1109/NCC.2016.7561208","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561208","url":null,"abstract":"Any tampering in an image or a video is followed by re-compression, thus resulting in double compression. Detecting double compression is a challenge in video forensics. Estimating the period of the Group of Pictures (GOP) in first compression is a clue to detect the double compression, as it gives a way to trace the processing history of the video. This paper, proposes a new method based on the mean absolute motion error sequence for blind GOP period detection in motion compensated video. A cyclo-stationary signal based algorithm, which computes for the largest variability in an n-fold blocked sequence, is adopted for the GOP period extraction. This method gives better results than the existing noise variance method. The proposed method is based on the periodic increase in motion error at the beginning of each GOP, when its motion is estimated from the reference frame in previous GOP. Thus, this method is extended for double encoding detection in a video when GOPs used in both the compressions are not equal, and the GOP period used in first encoding is estimated.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"44 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":"130092247","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}
引用次数: 1
On the use of variational mode decomposition for removal of baseline wander in ECG signals 利用变分模态分解去除心电信号中的基线漂移
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561133
Eedara Prabhakararao, M. Manikandan
{"title":"On the use of variational mode decomposition for removal of baseline wander in ECG signals","authors":"Eedara Prabhakararao, M. Manikandan","doi":"10.1109/NCC.2016.7561133","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561133","url":null,"abstract":"Automatic detection and removal of baseline wanders is most important for accurate measurement of clinical features of local waves including, P-wave, QRS complex, T-wave and U-wave of the ECG signals. In this paper, we investigate on the use of variational mode decomposition (VMD) technique for removal of baseline wander in ECG signals. The proposed method consists of three stages: VMD based ECG signal decomposition, baseline wander extraction using frequency criterion, and base-line wander subtraction. The method is tested and evaluated using a wide variety of ECG signals including different kinds of PQRST morphologies corrupted with different patterns of baseline wanders. Performance evaluation results show that the VMD based method can adequately remove the baseline wanders without significantly distorting local components (P-wave, QRS complex, ST-segment, T-wave) of the ECG signal. The noise reduction capability of the VMD-based method is compared with the existing methods using the wavelet transform and Fourier transform. The subjective and objective quality assessment results show that the VMD based method outperforms the existing methods in terms achieving better objective quality metric values for various noisy ECG signals.","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":"123289031","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
Learned dictionaries for sparse representation based unit selection speech synthesis 学习字典稀疏表示为基础的单位选择语音合成
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561084
Pulkit Sharma, V. Abrol, A. Sao
{"title":"Learned dictionaries for sparse representation based unit selection speech synthesis","authors":"Pulkit Sharma, V. Abrol, A. Sao","doi":"10.1109/NCC.2016.7561084","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561084","url":null,"abstract":"In this paper, we have employed learned dictionaries to compute sparse representation of speech utterances, which will be used to reduce the footprint of unit selection based speech synthesis (USS) systems. Speech database labeled at phoneme level is used to obtain multiple examples of the same phoneme, and all the examples (of each phoneme) are then used to learn a single overcomplete dictionary for the same phoneme. Two dictionary learning algorithms namely KSVD (K-singular value decomposition) and GAD (greedy adaptive dictionary) are employed to obtain respective sparse representations. The learned dictionaries are then used to compute the sparse vector for all the speech units corresponding to a speech utterance. Significant coefficients (along with their index locations) of the sparse vector and the learned dictionaries are stored instead of entire speech utterance. During synthesis, the speech waveform is synthesized using the significant coefficients of sparse vector and the corresponding dictionary. Experimental results demonstrate that the quality of the synthesized speech is better using the proposed approach while it achieves comparable compression to the existing compression methods employed in the USS systems.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"9 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":"130862546","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
On energy cooperation in energy harvesting underlay cognitive radio network 基于认知无线网络的能量采集能源合作研究
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561123
K. Pathak, Adrish Banerjee
{"title":"On energy cooperation in energy harvesting underlay cognitive radio network","authors":"K. Pathak, Adrish Banerjee","doi":"10.1109/NCC.2016.7561123","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561123","url":null,"abstract":"In this paper, we consider an energy harvesting cognitive radio network (EH-CRN), where a primary and a secondary user coexist in underlay mode. Both the transmitters have energy harvesting capability and are equipped with finite capacity battery to store the harvested energy. In addition, the secondary user (SU) has an independent energy transfer unit such that it can transfer some portion of it's harvested energy to the primary user (PU). We obtain an optimal transmit power and energy transfer policy for single-slot and a suboptimal policy for multi-slot scenario maximizing the number of bits transmitted by SU under the primary sum-rate constraint in an offline setting. For both cases, the effect of energy cooperation on the system performance is studied and it is observed that energy cooperation results in higher SU throughput.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"105 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":"122672476","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}
引用次数: 8
Adaptive propagation-based skin segmentation method for color images 基于自适应传播的彩色图像皮肤分割方法
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561108
B. Chakraborty, M. Bhuyan, Sunil Kumar
{"title":"Adaptive propagation-based skin segmentation method for color images","authors":"B. Chakraborty, M. Bhuyan, Sunil Kumar","doi":"10.1109/NCC.2016.7561108","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561108","url":null,"abstract":"Segmentation of skin regions from color images has many important Computer Vision applications. But, accuracy of existing skin detection methods are severely affected by the color similarity between the background and actual skin regions. Probabilistic approaches using skin probability maps (SPMs) can solve this problem to an extent. In this paper, a novel method has been proposed which uses seeded region growing method. Region growing is implemented by an adaptive cost propagation and neighborhood analysis scheme. The initial seeds are obtained from the SPM. It is observed from the experimental results that the proposed method can perform better compared to the existing skin segmentation methods for different illumination and background conditions.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"81 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":"122808901","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
A capacity-achieving coding scheme for the AWGN channel with polynomial encoding and decoding complexity 一种具有多项式编解码复杂度的AWGN信道容量实现编码方案
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561091
Shashank Vatedka, N. Kashyap
{"title":"A capacity-achieving coding scheme for the AWGN channel with polynomial encoding and decoding complexity","authors":"Shashank Vatedka, N. Kashyap","doi":"10.1109/NCC.2016.7561091","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561091","url":null,"abstract":"A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. In this article, we study a simple capacity-achieving nested lattice coding scheme whose encoding and decoding complexities are polynomial in the blocklength. Specifically, we show that by concatenating an inner nested lattice code with an outer Reed-Solomon code over an appropriate finite field, we can achieve the capacity of the AWGN channel. The main feature of this technique is that the encoding and decoding complexities grow as O(N2), while the probability of error decays exponentially in N, where N denotes the blocklength. We also show that this gives us a recipe to extend a high-complexity nested lattice code for a Gaussian channel to low-complexity concatenated code without any loss in the asymptotic rate. As examples, we describe polynomial-time coding schemes for the wiretap channel, and the compute-and-forward scheme for computing integer linear combinations of messages.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"17 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":"129037476","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
Two-tier peer selection strategy to minimize delay in P2P live streaming systems 最小化P2P直播系统延迟的两层对等选择策略
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561203
Shilpa Budhkar, V. Tamarapalli
{"title":"Two-tier peer selection strategy to minimize delay in P2P live streaming systems","authors":"Shilpa Budhkar, V. Tamarapalli","doi":"10.1109/NCC.2016.7561203","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561203","url":null,"abstract":"The increase in popularity of online video streaming services and the self-scalability property of peer-to-peer (P2P) overlays contributed to the development of P2P live streaming systems. In these systems, peers connect with each other to retrieve video content. The store-and-forward strategy to distribute stream induces forwarding delay at each hop from the source to a peer. Therefore, designing peer selection strategy to minimize end-to-end delay is an important research problem in P2P live streaming systems. In this paper, we develop a two-tier peer selection strategy which minimizes playback lag and startup delay. In the proposed two-tier peer selection strategy, peers are selected at both the levels (tracker and peer) based on propagation delay, upload capacity, playback lag and buffering level. The proposed two-tier peer selection strategy is compared with an existing system, Fast-Mesh using simulations. The results show that playback lag is reduced by 20-25% and startup delay is reduced by 10-15%.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"56 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":"121659567","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
Power control over Gilbert-Elliot channel with no observable states 对吉尔伯特-艾略特频道的控制没有可观察到的状态
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561087
R. Meshram
{"title":"Power control over Gilbert-Elliot channel with no observable states","authors":"R. Meshram","doi":"10.1109/NCC.2016.7561087","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561087","url":null,"abstract":"A dynamic communication channel is modeled as Markov chain where states describe the quality of channel. One such example is two state Gilbert-Elliot channel. The states of a channel is never observed by transmitter, but success and failure is observed with probability depending on state of channel. The information available to transmitter is the current belief about states and it is updated based on action and observation of a signal. The transmitter want to send a packet over channel with different power control schemes in each slot to maximise long term discounted reward. We formulate this as infinite horizon discounted reward problem. We write a dynamic program, and derive the properties of value function. For a special case, we show that the optimal policy has a single threshold. Further, we present few numerical examples to illustrate this.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"21 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":"133714680","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
Design and analysis of wearable patch antenna array for MBAN applications MBAN应用中可穿戴贴片天线阵列的设计与分析
2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561201
D. Rano, M. Hashmi
{"title":"Design and analysis of wearable patch antenna array for MBAN applications","authors":"D. Rano, M. Hashmi","doi":"10.1109/NCC.2016.7561201","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561201","url":null,"abstract":"Design idea of wearable rectangular patch antenna and its array for MBAN (2.36 - 2.4 GHz) applications are proposed in this paper. Microstrip line with quarter wave transformer is used for feeding purpose. Polyamide lossy (Nylon-6) is used as dielectric substrate whereas the conductive parts i.e. patch and ground plane consists of nickel - copper - nickel coating on the textile substrate. The presence of highly conductive coating on substrate (i.e., surface resistance of 0.1 ohms/m2) aids in the reduction of losses. Five layer model consisting of bottom textile, air gap, skin, fat and bone is considered here. Since the wearable antennas are body worn devices effect of body curvature is also considered by conforming the antennas on cylindrical surface.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"82 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":"134447806","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
首页 上一页 下一页 尾页
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学术官方微信