2016 Twenty Second National Conference on Communication (NCC)最新文献_第7页

SBL-based data-aided channel estimation for spatially evolving STTC MIMO systems 空间演化STTC MIMO系统中基于sbl的数据辅助信道估计

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561199

Amrita Mishra, A. Jagannatham

{"title":"SBL-based data-aided channel estimation for spatially evolving STTC MIMO systems","authors":"Amrita Mishra, A. Jagannatham","doi":"10.1109/NCC.2016.7561199","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561199","url":null,"abstract":"In this paper, a spatially sparse representation of the multiple-input multiple-output (MIMO) channel matrix is considered in terms of the overcomplete spatial signature dictionary comprising of the basis signature matrices which correspond to the various directional cosines at the transmit and receive antenna arrays. Further, the spatial evolution of the MIMO channel matrices is suitably captured by modeling the sparse weight vector corresponding to the significant directional cosines as a first order auto-regressive model. Towards this end, the sparse Bayesian learning (SBL) framework is employed to develop a novel pilot-based channel estimation scheme for space-time trellis coded (STTC) MIMO systems based on a time-varying spatially sparse representation of the MIMO channel. Subsequently, an enhanced data-aided channel estimation scheme is also developed by utilizing the expectation-maximization (EM) framework, which culminates in an optimal Kalman filter and smoother (KFS)-based minimum mean squared error channel estimate in the E-step followed by a modified path metric-based trellis decoder in the M-step. Additionally, the Bayesian Cramér-Rao bounds (BCRBs) corresponding to the proposed SBL-based channel estimation schemes are also developed. Finally, simulation results are presented to illustrate the superior performance of the proposed techniques and validate the analytical bounds.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"91 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":"132008791","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

Connectivity in CRNs with bounded tree-width potential graph and its fixed parameter tractability 有界树宽势图crn的连通性及其参数可跟踪性

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561104

Akhil Sehrawat, R. Misra, R. Yadav

{"title":"Connectivity in CRNs with bounded tree-width potential graph and its fixed parameter tractability","authors":"Akhil Sehrawat, R. Misra, R. Yadav","doi":"10.1109/NCC.2016.7561104","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561104","url":null,"abstract":"Cognitive Radio Networks (CRNs) are considered as a promising solution to the spectrum shortage problem in wireless communication. We model the network of secondary users (SUs) as an undirected potential graph PG = (V (PG),E(PG)), where v ∈ V (PG) correspond to a secondary user and each edge (u, v) ∈ E(PG) represents link between nodes u and v (nodes are in within the transmission range). Two nodes having an edge between them are connected if their spectrum assignments have a common channel. In general, it is NP-complete to determine whether the network is connectable through spectrum assignment in CRN. In this paper, we propose a dynamic programming algorithm to check κ-channel connectivity of CRNs through spectrum assignment for the special case in which PG is a bounded tree-width graph. We also show that the κ-channel connectivity problems are fixed-parameter tractable. We have studied our proposed algorithm theoretically as well practically. The complexity of proposed algorithm is O(k)O(k)nO(1), where is k is the number of channels and n is number of SUs in CRN. Through simulation results, we have analysed that the channel connectivity depends on the available channels, spectrum map of each SU, antenna budget, tree-width of networks.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"1 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":"133877200","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

Coded cooperation over wireless optical links in weak turbulence with misalignment fading 弱湍流中无线光链路的编码合作

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561125

P. Sharma, P. Garg, Ankita Gupta

引用次数: 2

Model-based interference cartography and visualization 基于模型的干涉制图与可视化

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561174

P. Karthik, Raksha Ramakrishna, Geethu Joseph, C. Murthy, Joyson Sebastian, N. Mehta

{"title":"Model-based interference cartography and visualization","authors":"P. Karthik, Raksha Ramakrishna, Geethu Joseph, C. Murthy, Joyson Sebastian, N. Mehta","doi":"10.1109/NCC.2016.7561174","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561174","url":null,"abstract":"In this work, we present a tool to construct and visualize the spatio-temporal variations of power. A dataset of real-world power measurements is collected over a geographical area of interest. Relevant parameters of the environment such as the path loss exponent and the decorrelation time of the lognormal shadow fading are extracted from the dataset. Also, the average powers measured at a finite set of known locations are interpolated to obtain the average power distribution over the area. Using the parameters of the lognormal shadow fading, synthetic data with the same temporal behavior of the dataset is generated, and multiplied with the average power distribution. The resulting spatio-temporal power map is displayed on the screen through a graphical user interface developed in-house. The proposed approaches for interpolation and parameter extraction are validated using test datasets generated using the well-accepted modified Gudmundson model for the spatio-temporal correlation of lognormal shadow fading. We also undertake a comparative study of three different interpolation techniques: linear interpolation, inverse distance weighing and ordinary kriging. Further, we compare a model-based approach with a model-free approach for interpolation, and find that model-based ordinary kriging provides the best mean absolute percentage error performance.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"49 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":"131611321","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

Spoken term detection from continuous speech using ANN posteriors and image processing techniques 使用人工神经网络后验和图像处理技术从连续语音中检测口语术语

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561151

R. Shankar, Arpit Jain, K. Deepak, C. Vikram, S. Prasanna

{"title":"Spoken term detection from continuous speech using ANN posteriors and image processing techniques","authors":"R. Shankar, Arpit Jain, K. Deepak, C. Vikram, S. Prasanna","doi":"10.1109/NCC.2016.7561151","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561151","url":null,"abstract":"The objective of current work is to demonstrate the significance of morphological image processing techniques in the spoken term detection from continuous speech. The phone posterior probabilities for the reference speech data and query word are obtained from the Hidden Markov Model (HMM)- Artificial Neural Network (ANN) based hybrid phoneme recognizer. The phone posteriors of query word and reference data are matched by using the non-segmental Dynamic Time Warping (DTW) technique. In order to make the decision about the presence or absence of a keyword in a particular reference file, image processing based approach is proposed. The DTW accumulation matrix is viewed as a gray scale image and processed using binarization and skeletonization operations. The decision about the presence of keyword is taken by observing a diagonal streak of dark patch in the processed image. The phoneme recognizer is trained on the TIMIT training set and a set of twenty randomly chosen words from the TIMIT test data are considered as keywords. The algorithm is evaluated for each keyword against the entire TIMIT test data as the reference and an accuracy of about 85% with an error rate of less than 8% is noted.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"4 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":"114316355","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

On the transmit diversity of Time Successive SSK-BPSK system 时变SSK-BPSK系统的发射分集

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561093

P. Maheswaran, M. D. Selvaraj

引用次数: 2

Achievable throughput in relay-powered RF harvesting cooperative sensor networks 中继供电射频采集协同传感器网络中可实现的吞吐量

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561155

Deepak Mishra, S. De

引用次数: 1

CoSEL: Control-plane Only Scalable Efficient and Lightweight SDN Debugger CoSEL:控制平面仅可扩展的高效轻量级SDN调试器

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561171

Nihal Srivastava, G. Singh, H. Saran, V. Ribeiro, Suresh C. Gupta

{"title":"CoSEL: Control-plane Only Scalable Efficient and Lightweight SDN Debugger","authors":"Nihal Srivastava, G. Singh, H. Saran, V. Ribeiro, Suresh C. Gupta","doi":"10.1109/NCC.2016.7561171","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561171","url":null,"abstract":"Network debugging has always been a challenging task primarily because the original design of the Internet architecture gave little importance to debugging and management. In addition, the Internet makes forwarding decisions in a distributed manner, which is hard to track. With the advent of Software Defined Networks (SDNs), network debugging has potentially become easier because solely the control plane makes forwarding decisions, which is often centrally located. In this paper, we propose Control-plane Only Scalable Efficient and Lightweight SDN Debugger (CoSEL), which is to the best of our knowledge the first control-plane only, network debugger for SDN. Unlike earlier proposed debuggers, which rely on information specially obtained from the data-plane or a combination of the data and control planes, CoSEL does not require the use of any additional network bandwidth for its operation and hence outperforms existing schemes in terms of scalability. In terms of completeness, however, CoSEL does not perform as well as some existing schemes, although this loss in completeness does not prevent it from capturing most of the bugs in the network, which have1 been observed to be caused mainly by the control plane. We implement CoSEL on the Floodlight controller as a network application and present results of CoSEL in action over a network emulated by mininet. However, CoSEL is controller independent and utilizes a common programming API provided by POX, NOX and OpenDaylight. In addition, the control plane debugging of CoSEL enables it to be an effective debugging tool for network applications that are built on top of controllers utilizing Northbound APIs and interacting with network by injecting rules.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"46 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":"114075970","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

Robust photoplethysmographic (PPG) based biometric authentication for wireless body area networks and m-health applications 基于健壮光体积脉搏波(PPG)的生物识别认证，用于无线身体区域网络和移动健康应用

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561152

Tilendra Choudhary, M. Manikandan

引用次数: 31

Network based offloading in LTE-WLAN Heterogeneous Networks LTE-WLAN异构网络中基于网络的卸载

2016 Twenty Second National Conference on Communication (NCC) Pub Date : 2016-03-04 DOI: 10.1109/NCC.2016.7561136

Arijit Bhattacharjee, Mahima Mehta, N. Akhtar, A. Karandikar

引用次数: 9