{"title":"Performance Comparision of Autocorrelation and CPRDIC Algorithm Implemented on FPGA for OFDM Based WLAN","authors":"P. Reddy, G. Ramachandra Reddy","doi":"10.1109/ICCSN.2009.172","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.172","url":null,"abstract":"This paper deals with design and implementation of Autocorrelator and CORDIC algorithm for OFDM based WLAN on FPGA. The autocorrelator is used for frame detection and carrier frequency offset estimation. The CORDIC is used to estimate the frequency offset and to calculate the division in the channel estimation algorithm. A fast pipelined CORDIC architecture and autocorrelator is designed and implemented on FPGA. HDL and test bench is developed to simulate and verify the functionality of both the modules. The design is implemented on Spartan-2 100K, Spartan-3 100K and Virtex-2 2 Million gate capacity devices to check the performances of hardware implementation. It is found that as the technology changes from 130nm FPGA to 90nm FPGA the design speed increases from 100 MHz to 229 MHz for autocorrelator and 24 MHz to 55 MHz, at the same time the design consumes more power this is due to the fact that Virtex devices have more gate capacity and hence more power consumption. The sequential logic also reduces drastically. The design consumes almost equal number of macros on the entire implementation platform. The design is optimized for area and power requirements.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124764723","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":"Substitution Encryption Algorithm Study for Embedded Mobile Code Protection","authors":"Huang Jingde, Shin-Gak Gang","doi":"10.1109/ICCSN.2009.46","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.46","url":null,"abstract":"Protecting against software attacks is becoming a major concern in embedded systems since many of them have more and more functionality added. In this paper, an obfuscation-based approach for providing security of programming a remote embedded Java device is proposed. The basic idea of the proposed approach is that the programming system and the authorized embedded node exchange a Java bytecode substitution table using standard encryption techniques.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123296611","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":"Clothes Image Searching System Based on CTS","authors":"O. Yi, Sanyuan Zhang","doi":"10.1109/ICCSN.2009.34","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.34","url":null,"abstract":"One of the main difficulties in Clothes image searching is the variability of appearance of an object of interest. Clothes image feature extraction is a very active research area under this situation. Through build a Clothes concept semantic structure Clothes Tree Semantic Structure, the Clothes Image Searching System based on Scale Invariant Feature Transform(SIFT) is proposed in the paper. Experiment on an image database of about 5,000 general-purpose images, results show that our algorithm is more efficient than existing algorithms based on color histogram or corners features","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131489426","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":"Mining Frequent Flows Based on Adaptive Threshold with a Sliding Window over Online Packet Stream","authors":"Zhen Zhang, Binqiang Wang, Shuqiao Chen, Ke Zhu","doi":"10.1109/ICCSN.2009.43","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.43","url":null,"abstract":"Traffic measurement is an important component of network applications including usage-based charging, anomaly detection and traffic engineering. With high-speed links¿the main problem with traffic measurement is its lack of scalability. Aiming at circumvent this deficiency, we develop a novel and scalable sketch to mine frequent flows over online packet stream. Dividing the sliding window into buckets, the sketch can not only be easily-implemented, but also remove obsolete data to identify recent usage trends. Besides, an unbiased estimator is introduced based on a pruning function to preserve large flows. In particular, we illustrate a mechanism of configuring adaptive thresholds which are bound to the actual data without artificial behavior. The adaptive threshold can be regulated to target the mean number of the reserved flows in order to protect memory resources. Experiments are also conducted based on real network traces. Results demonstrate that the proposed method can achieve adaptability and controllability of resource consumption without sacrificing accuracy.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131756639","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}
Hongyun Xie, Lijian He, Pei Shen, J. Gan, Jia Li, Yi-wen Huang, Lu Huang, Wanrong Zhang
{"title":"A Novel Dual-Band Power Amplifier for Wireless Communication","authors":"Hongyun Xie, Lijian He, Pei Shen, J. Gan, Jia Li, Yi-wen Huang, Lu Huang, Wanrong Zhang","doi":"10.1109/ICCSN.2009.152","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.152","url":null,"abstract":"A dual-band power amplifier (PA) which operates at two specific frequencies of 1.8GHz and 2.0GHz simultaneously is designed. The input matching circuit has one access with a special matching network which resonates at two frequencies. The output matching circuit is the simple L-type matching network and was designed under the guide of load-pull methodology. The simulated results show that, at the two frequencies, the S21 achieves 12.63dB and 13.64dB respectively, the S11 reaches -11.88dB and -10.76dB. The 1-dB power compressions of the two frequencies both achieve 6 dBm and the power gain achieves 10dB.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"435 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128275593","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":"Short-Term Traffic Flow Prediction Based on ANFIS","authors":"Chen Bao-ping, Ma Zeng-qiang","doi":"10.1109/ICCSN.2009.140","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.140","url":null,"abstract":"Accurate short-term traffic flow prediction has become a critical problem in intelligent transportation systems (ITS). In the paper, a kind of adaptive prediction method for short-term traffic flow based on ANFIS (adaptive-network-based fuzzy interference system) model was presented. ANFIS is a fuzzy interference tool implemented in the framework of adaptive network. It combines the comprehensibility of fuzzy rules and the adaptability and self-learning algorithms of neural networks. The traffic flow prediction model with 104 changeable parameters will be established through the training process, the goal of which is reduce the prediction errors between real predicting output the ANFIS model and the desired output. The result of simulation research demonstrates that this method has the advantage of high precision and good adaptability. This scheme is novel and advanced in the domain of the road traffic flow prediction. The application of the scheme will remarkably improve the response efficiency and precision degree of the road traffic inducement and control system in our country.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122277256","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 Fair MAC Algorithm with Dynamic Priority for 802.11e WLANs","authors":"Rong He, X. Fang","doi":"10.1109/ICCSN.2009.10","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.10","url":null,"abstract":"This paper proposed a new multi-metric dynamic priority MAC algorithm for 802.11e WLAN in order to fairly distribute the bandwidth among different kinds of traffic. Our main contribution is to dynamically adjust the priority of each queue and assign corresponding access parameters according to the value of priority function during update period. The waiting time of a packet in the queue and the ratio of actual bandwidth occupied time proportion (BP) to its promised BP share threshold are adopted as two metrics for calculating the value of priority function. The simulation result indicates that our proposed scheme could attain fairness among different kinds of traffic and decrease the ratio of packet loss, thereby improve the throughput of network.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121344435","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":"Wireless Ad Hoc Networks Remote Meter Reading System Based on GPRS","authors":"JingJing Wang","doi":"10.1109/ICCSN.2009.169","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.169","url":null,"abstract":"Characteristics of GPRS and ad hoc networks are briefly introduced and a novel design of a wireless ad hoc network remote meter reading system based on GPRS is proposed. With the implementation of the system and relevant techniques being thoroughly investigated, system performance analysis and pros and cons of this system are presented at the end.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129588530","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":"Inter-Carrier Interference Cancellation in OFDM via Independent Component Analysis","authors":"A. Homayounzadeh, M. Shirazi","doi":"10.1109/ICCSN.2009.86","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.86","url":null,"abstract":"Inter-carrier Interference is a severe problem in OFDM systems. Frequency offset is a factor which destroys the orthogonality of subcarriers and causes Inter-carrier Interference (ICI). In the case of insufficient Cyclic Prefix (CP), delay dispersion of the channel can also lead to ICI. Time variations of the channel over an OFDM symbol duration can be considered as another factor causing ICI. In this paper the ICI mathematical formulation is derived and a blind cancellation method, which is based on Independent Component Analysis (ICA) is proposed. Practical solutions for the ICA ambiguities are also considered. The effectiveness of the method in various situations, including the mentioned ones is demonstrated via simulation.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133948580","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 Multi Objective Programming Algorithm for Wireless Sensor Networks","authors":"Guomin Zhou","doi":"10.1109/ICCSN.2009.25","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.25","url":null,"abstract":"With multimedia technology rapid development and popular application in the wireless sensor networks (WSN), it become a facing problem necessarily that the wireless sensor network need to support quality of service (Qos) for all kinds of services. Accordingly, this paper builds a multi objective programming model and presents a Qos routing algorithm for WSN, which can also run efficiently with best-effort traffic.Simulations and comparisons with some typical route algorithms show that our algorithm is robust and effective.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134264425","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}