{"title":"Nonparametric techniques for graphical model-based target tracking in collaborative sensor groups","authors":"P. V. Paul, V. Rajbabu","doi":"10.1109/NCC.2010.5430180","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430180","url":null,"abstract":"Target tracking using collaborative sensor groups is an effective mechanism for reducing the scalability issues in distributed sensor networks. Using graphical models for such a sensor group together with appropriate class of nonparametric message passing algorithms, we explore efficient approaches to handle the related data fusion problems characterized by spatially distributed observations. Messages consisting of multiple Gaussian components have been efficiently handled with the help of nonparametric belief propagation techniques. The advantage of such an approach in a myopic radar network has been verified here using Monte Carlo simulations by comparing the tracking performance obtained with centralized and distributed fusion schemes.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125808995","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}
{"title":"Speech synthesis using artificial neural networks","authors":"E. V. Raghavendra, P. Vijayaditya, K. Prahallad","doi":"10.1109/NCC.2010.5430190","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430190","url":null,"abstract":"Statistical parametric synthesis becoming more popular in recent years due to its adaptability and size of the synthesis. Mel cepstral coefficients, fundamental frequency (f0) and duration are the main components for synthesizing speech in statistical parametric synthesis. The current study mainly concentrates on mel cesptral coefficients. Durations and f0 are taken from the original data. In this paper, we are attempting on two fold problem. First problem is how to predict mel cepstral coefficient from text using artificial neural networks. The second problem is predicting formants from the text.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125404725","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}
Vikrant Singh Tomar, Himanshu Asnani, A. Karandikar, Vinay Chander, Swati Agrawal, P. Kapadia
{"title":"Social network analysis of the Short Message Service","authors":"Vikrant Singh Tomar, Himanshu Asnani, A. Karandikar, Vinay Chander, Swati Agrawal, P. Kapadia","doi":"10.1109/NCC.2010.5430162","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430162","url":null,"abstract":"In this paper, we analyze patterns in the Short Message Service (SMS) behavior of customers in a large telecom service provider network. Toward this, we construct SMS Graphs, which are graphs induced by people exchanging SMSs, from the SMS Call Detail Records of the concerned service provider. These patterns are modeled by a weighted graph G(V, E, W), in which the vertices represent the customers, and the edges and weights characterize the SMS transactions. We analyze properties of this graph, such as the distribution of component sizes, cliques, and vertex degrees. It is our belief that this study should enable the telecom operators to utilize the social behavior of their customers to design better service plans, and generate optimum incentives.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125907369","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}
{"title":"Closed-form error analysis of noncoherent FSK for dual hop relay network in Nakagami-m fading channel","authors":"S. N. Datta, S. Chakrabarti, R. Roy","doi":"10.1109/NCC.2010.5430222","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430222","url":null,"abstract":"We analyze the end-to-end error performance of Mary frequency shift keying (MFSK) with noncoherent detection over independent and non-identical flat Nakagami-m fading channels. A dual-hop relay transmission using amplify-and-forward (AF) protocol with average power scaling (APS) mechanism [1] is considered. Generalized closed-form expressions for the average symbol error probability (ASEP) of noncoherent MFSK has been obtained following the cumulative distribution function (CDF) approach. Moreover, we derive a simplified closed-form expression for the ASEP over high signal-to-noise ratio (SNR) over the source-relay link. Computer simulations are performed to validate our proposed mathematical analysis. The obtained error probability expressions will help the design of two-hop relay networks adopting MFSK in determining various system parameters such as the transmission power at the source and the gain factor at the relay.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"381 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128171697","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}
M. Madhavan, A. Thangaraj, Kapali Viswanathan, Y. Sankarasubramaniam
{"title":"NLHB : A light-weight, provably-secure variant of the HB protocol using simple non-linear functions","authors":"M. Madhavan, A. Thangaraj, Kapali Viswanathan, Y. Sankarasubramaniam","doi":"10.1109/NCC.2010.5430152","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430152","url":null,"abstract":"In this paper, we propose a light-weight provably-secure authentication protocol called the NLHB protocol, which is a variant of the HB protocol [6]. The HB protocol uses the complexity of decoding linear codes for security against passive attacks. In contrast, security for the NLHB protocol is proved by reducing the provably hard problem of decoding a class of nonlinear codes to passive attacks. We demonstrate that the existing passive attacks([10],[3]) on the HB protocol family, which have contributed to considerable reduction in its effective key-size, do not work against the NLHB protocol. From the evidence, we conclude that smaller-key sizes are sufficient for the NLHB protocol to achieve the same level of passive attack security as the HB Protocol. Further, for this choice of parameters, we provide an implementation instance for the NLHB protocol for which the Prover/Verifier complexity is lower than the HB protocol, enabling authentication on very low-cost devices like RFID tags.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128175422","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}
{"title":"Fusion based object detection","authors":"T. Suja, M. John","doi":"10.1109/NCC.2010.5430203","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430203","url":null,"abstract":"Fusion based object detection method presented herein combines local and global features for object detection. The cluster based part detection facilitates adequate representation for the individual local parts of an image that carry the significant features of the object. The chain code is used for deriving the local and global information. The genetic algorithm is used to combine all the local and global features. The algorithm is tested on a set of real-world images which contain side views of cars and found to yield very good results with no false alarm within the data base that was used for testing.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126515049","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}
{"title":"Implications of the half-duplex constraint on relay-aided cooperation using rateless codes","authors":"R. Meshram, N. Mehta","doi":"10.1109/NCC.2010.5430224","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430224","url":null,"abstract":"The half-duplex constraint, which mandates that a cooperative relay cannot transmit and receive simultaneously, considerably simplifies the demands made on the hardware and signal processing capabilities of a relay. However, the very inability of a relay to transmit and receive simultaneously leads to a potential under-utilization of time and bandwidth resources available to the system. We analyze the impact of the half-duplex constraint on the throughput of a cooperative relay system that uses rateless codes to harness spatial diversity and efficiently transmit information from a source to a destination. We derive closed-form expressions for the throughput of the system, and show that as the number of relays increases, the throughput approaches that of a system that uses more sophisticated full-duplex nodes. Thus, half-duplex nodes are well suited for cooperation using rateless codes despite the simplicity of both the cooperation protocol and the relays.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114520814","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}
{"title":"Improved array processing for two-user detection of Alamouti code","authors":"M. Bhatnagar","doi":"10.1109/NCC.2010.5430215","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430215","url":null,"abstract":"Recently, it is shown in [1] that by interference cancellation through zero-forcing a diversity order of 2(M −1) can be achieved in a multiple access channels (MAC) based uplink two-user MIMO system with two transmit antennas at each user and M >2 receive antennas at the base-station. In this paper, we show that by using improved array processing technique a diversity order of 2M can be achieved in a two-user interference cancellation system with two transmit and more than two receive antennas. We derive pairwise error probability (PEP) bounds for different number of receive antennas and prove the diversity order for different cases theoretically.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116711149","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}
{"title":"Capacity analysis of dual -SC and -MRC systems over correlated Nakagami-m fading channels with non-identical and arbitrary fading parameters","authors":"R. Subadar, P. R. Sahu","doi":"10.1109/NCC.2010.5430210","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430210","url":null,"abstract":"Closed-form expressions for the capacity of dual branch, selection combining (SC) and maximal-ratio combining (MRC) diversity systems operating in correlated Nakagami-m fading channels with non-identical and arbitrary fading parameters have been presented. Different power and rate adaptation techniques available in literature has been considered for the capacity analysis. A study on the effects of correlation and fading parameters on the channel capacity of the systems for different techniques has been presented.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114887696","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}
{"title":"VHDL implementation of two-state multiple turbo codes","authors":"V. Bhatia, Adrish Banerjee","doi":"10.1109/NCC.2010.5430238","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430238","url":null,"abstract":"With increasing demand for different data rates and services for communication systems, reconfigurability is of utmost importance. Field Programmable Gate Arrays (FPGAs) provide the flexibility in operation and function by a simple change in the configuration bit stream. Low complexity turbo-like codes based on simple two-state trellis or simple graph structure results in decoder with low complexity. Two-state multiple turbo code is one such example. In this paper, we present the VHDL implementation of a 2-state multiple turbo code architecture targeted towards the Xilinx Vertex-5 FPGAs and compared its implementation with 8-state 3GPP turbo code in terms of hardware complexity and speed.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128802052","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}