{"title":"Adaptive Multi-rate Wideband Speech Codec Based on CELP Algorithm: Architectural Study, Implementation & Performance Analysis","authors":"D. Bhagat, N. Bhatt, Y. Kosta","doi":"10.1109/CSNT.2012.124","DOIUrl":"https://doi.org/10.1109/CSNT.2012.124","url":null,"abstract":"This paper investigates application of Code Excited Linear Prediction algorithm on Adaptive Multi Rate Wideband coder. The proposed coder can adaptively change its bit-rate based on C/I ratio depending on channel conditions. The coder has nine bit-rates from 6.6 kbps to 23.85 kbps. An e-test bench using MATLAB is created to implement proposed coder and series of simulations are carried out to judge the performance of implemented coder using Subjective and Objective analysis. Simulation results clearly advocate that it is possible to produce variable bit rate (by tuning to channel conditions) in CELP coder by affecting coefficients of coder while still maintaining comparable speech quality with reference to AMR WB coder standardized by 3GPP and ITU-T [5]. It is also evident from the simulation results that Signal to Noise Ratio (SNR), Segmented SNR, Perceptual Evaluation of Speech Quality (PESQ) and Mean Opinion Score (MOS) increases with increase in bit rates of proposed coder and Absolute Error (Abs Err), Mean Square Error (MSE), Root Mean Square Error (RMSE) reduces with increase in bitrates.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125041586","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":"E Shaped Patch Microstrip Antenna for WLAN Application Using Probe Feed and Aperture Feed","authors":"M. Sharma, A. Katariya, R. Meena","doi":"10.1109/CSNT.2012.24","DOIUrl":"https://doi.org/10.1109/CSNT.2012.24","url":null,"abstract":"Microstrip patch antennas have been widely used in a various useful applications, due to their low weight and low profile, conformability, easy and cheap realization. A low profile patch antenna for WLAN application is proposed in this paper. This proposed antenna is made by using the probe feeding and aperture coupled feeding methods. This antenna is designed in order to improve the impedance bandwidth and obtain the circular polarization without using truncated corners in patch. The impedance bandwidth will be increased by making slots onto the patch. This unequal parallel slots patch antenna is the modified structure of E patch antenna and U slot Patch antenna. This patch antenna provides a bandwidth of around 16.4% with 1.5 VSWR. The simulation process has been done through high frequency structure simulator (HFSS). The properties of antenna such as bandwidth, S parameter, VSWR have been investigated. This paper also aims at comparing between different feeding methods.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134578887","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":"SoDesktop: A Desktop Search Engine","authors":"Zhiwang Cen, Jungang Xu, Jian Sun","doi":"10.1109/CSNT.2012.106","DOIUrl":"https://doi.org/10.1109/CSNT.2012.106","url":null,"abstract":"The number of files stored in a personal computer is increasing very quickly, so it is difficult for users to find the information they want. One desktop search engine named SoDesktop is proposed in this paper, which is composed of four modules including Data crawler, Task scheduler, Data indexer and Data searcher. The implementations of these four modules are described in details, and the implementation of user interface of SoDesktop is also introduced.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116502408","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":"Selecting the Most Favorable Wavelet for Compressing ECG Signals Using Compressive Sensing Approach","authors":"Akanksha Mishra, F. Thakkar, C. Modi, Rahul Kher","doi":"10.1109/CSNT.2012.37","DOIUrl":"https://doi.org/10.1109/CSNT.2012.37","url":null,"abstract":"Compressed Sensing (CS) is a novel approach of reconstructing a sparse signal much below the significant Nyquist rate of sampling. Due to the fact that ECG signals can be well approximated by the few linear combinations of wavelet basis, this work introduces a comparison of the reconstructed ECG signal based on different wavelet families, by evaluating the performance measures as MSE (Mean Square Error), PSNR (Peak Signal To Noise Ratio), PRD (Percentage Root Mean Square Difference) and CoC (Correlation Coefficient). Reconstruction of the ECG signal is a linear optimization process which consider the sparsity in the wavelet domain, perceived by the fact that higher the sparsity, more better the recovery. L1 minimization is used as the recovery algorithm. The reconstruction results are comprehensively analyzed for five compression ratios, i.e. 2:1, 4:1, 6:1, 8:1 and 10:1. The results indicate that reverse biorthogonal wavelet family can give better results for all (Compression Ratio's)CRs compared to other families.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115222875","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":"Feature Preserving Interpolation of Multispectral Images Using Local Binary Patterns","authors":"I. K. Suthar, P. Gajjar, K. A. Mehta","doi":"10.1109/CSNT.2012.40","DOIUrl":"https://doi.org/10.1109/CSNT.2012.40","url":null,"abstract":"In this paper, we propose a novel technique for feature preserving interpolation of multi spectral (MS) images. Given an MS image and a panchromatic (PAN), high resolution MS image is obtained by estimating the details from the PAN image. We exploit the fact that the local geometry of the low resolution MS image is similar to that of the PAN image. The image features such as edges, corners, and curves carry crucial information in remote sensing applications. We models by using local binary patterns that best capture underlying geometric information and obtain high resolution enhancement for the MS images by learning discrete wavelet coefficients of the high resolution features present in PAN image. The proposed technique has been tested on various remotely sensed images. The results show the superiority of the proposed technique over existing interpolation techniques.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121793396","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":"A Novel Proposed Approach for an Equitable Payment Distribution Using Genetic Algorithm","authors":"S. R. Vasant, A. Vasant, N. N. Jani","doi":"10.1109/CSNT.2012.141","DOIUrl":"https://doi.org/10.1109/CSNT.2012.141","url":null,"abstract":"A very common and typical problem faced by many big companies i.e. executing multiple projects at the same time. They have a huge pool of similarly skilled human resource (experts) which needs to be allocated to different projects with different payment rates. To allocate these resources to different projects such that there is not too much variation in their average compensation over a period of time means they get an equitable pay. The above problem is considered to be hard and no polynomial-time algorithm exists to solve this optimally. This paper concerns the development of innovative approach to solve the equitable payment distribution problem. The simple and foremost solution in adoption is round robin approach. This approach has a set of limitations. The problems which are constrained with equitable distribution objective finds round robin approach a non-suitable approach. For such problems to be solved optimally needs a novel approach to the equitable payment distribution. In this paper a Genetic Algorithm (GA) based novel approach has been proposed to find the optimal solution for the equitable payment distribution.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123310363","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":"Research of Pavement Performance Evaluation and Prediction System of Highway Based on Linear Regression Method","authors":"Weiwei Yan, W. Peng, Huaiyu Xu","doi":"10.1109/CSNT.2012.209","DOIUrl":"https://doi.org/10.1109/CSNT.2012.209","url":null,"abstract":"Highway evaluation and prediction system of highway pavement is used for evaluating and predicting utilization performance on the structure of the highway pavement by adopting computer technology. Performance evaluation and prevention system of highway pavement based on linear regression method is put forward in the article. Firstly, it is to analyze the detection data on actual road and establish an evaluation index model to influence the utilization performance of the pavement to work out each performance evaluation index. Secondly, it is to establish a performance index prediction model according to the performance evaluation index and adopt the liner regression method to fit model parameters so as to obtain the optimum fitting parameters. Finally, it is to finish performance prediction in accordance with the optimum fitting parameters and draw the performance index prediction curve. The test result shows that the method can effectively predict pavement performance.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123733406","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":"Fast Authentication during Handover in NGN","authors":"S. Ganti, B. Ambudkar","doi":"10.1109/CSNT.2012.85","DOIUrl":"https://doi.org/10.1109/CSNT.2012.85","url":null,"abstract":"Next Generation Networks (NGN) is the evolution of the telecommunication core. It aims at the integration of various wired and wireless technologies to satisfy user requirements and to provide ubiquitous coverage anywhere, anytime. This integration of heterogeneous networks requires efficient and fast switching from one network to another which needs a proactive handover and authentication process that maintains QoS. Handoff is a critical function that enables mobile nodes to stay connected to the network by switching the connection from one network to another. Authentication during handover is one of the main challenges. The user has to execute multi-pass Authentication procedures in order to get access to the other network. This causes overhead on the AAA server and increases the delay of authenticating the user and that is because of unnecessary and repeated procedures and protocols. This paper presents an enhanced holistic approach that eliminates the repeated steps without affecting the security level, to optimize QoS parameters during handover. This idea is in its conception stage that reduces the handover latency by using a new authentication process. The presented mechanism has minimal impact on the network infrastructure.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123729695","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":"Lost Target Recovery in Wireless Sensor Network Using Tracking","authors":"A. Gupta, S. Patil, M. Zaveri","doi":"10.1109/CSNT.2012.83","DOIUrl":"https://doi.org/10.1109/CSNT.2012.83","url":null,"abstract":"Among vast number of applications of Wireless Sensor Networks, target tracking is considered as one of the important application. The target to be tracked may go unnoticed due to problems like node failures, communication failures amongst nodes and localization errors. Recovery mechanism needs to be initiated to find the exact location of the lost target. In this paper, we are proposing an energy efficient and fast recovery mechanism. From the performance comparison with existing algorithm, it is evident that our proposed approach is quicker in recovery of lost target.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128456599","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":"Comparison of a Time Efficient Modified K-mean Algorithm with K-Mean and K-Medoid Algorithm","authors":"Saurabh Shah, Manmohan Singh","doi":"10.1109/CSNT.2012.100","DOIUrl":"https://doi.org/10.1109/CSNT.2012.100","url":null,"abstract":"Clustering analysis is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. This paper proposes a new algorithm for Modified K-Means clustering which executes like the K-means algorithm and k-medoids algorithms and tests several methods for selecting initial cluster. Modified K-Mean Algorithm is better in terms of number of clusters and execution time comparisons with K-Mean and K-Mediod. Proposed algorithm is evaluated using real data and results are compared with k-Means and k-medoids where it takes reduced time in computation and better performance compared to K-Means and K-Medoids algorithms.","PeriodicalId":174433,"journal":{"name":"2012 International Conference on Communication Systems and Network Technologies","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129465653","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}