Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350770
C. Sivakumar, A. Velmurugan
The advanced encryption standard (AES) algorithm has become the default choice for various security services in numerous applications. In this paper, we propose a high speed, non-pipelined FPGA implementation of the AES-CCMP (counter-mode/CBC-MAC protocol) cipher for wireless LAN using Xilinx development tools and Virtex-II Pro FPGA circuits. IEEE 802.11i defines the AES-based cipher system, which is operated on CCMP Mode. All the modules in this core are described by using Verilog 2001 language. The developed AES CCMP core is aimed at providing high speed with sufficient security. The encryption/decryption data path operates at 194/148 MHz resulting in a throughput of 2.257 Gbits/sec for the encryption and 1.722 Gbits/sec for decryption. Compared to software implementation, migrating to hardware provides higher level of security and faster encryption speed. A comparison is provided between our design and similar existing implementations
{"title":"High Speed VLSI Design CCMP AES Cipher for WLAN (IEEE 802.11i)","authors":"C. Sivakumar, A. Velmurugan","doi":"10.1109/ICSCN.2007.350770","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350770","url":null,"abstract":"The advanced encryption standard (AES) algorithm has become the default choice for various security services in numerous applications. In this paper, we propose a high speed, non-pipelined FPGA implementation of the AES-CCMP (counter-mode/CBC-MAC protocol) cipher for wireless LAN using Xilinx development tools and Virtex-II Pro FPGA circuits. IEEE 802.11i defines the AES-based cipher system, which is operated on CCMP Mode. All the modules in this core are described by using Verilog 2001 language. The developed AES CCMP core is aimed at providing high speed with sufficient security. The encryption/decryption data path operates at 194/148 MHz resulting in a throughput of 2.257 Gbits/sec for the encryption and 1.722 Gbits/sec for decryption. Compared to software implementation, migrating to hardware provides higher level of security and faster encryption speed. A comparison is provided between our design and similar existing implementations","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129418461","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350738
M. Sumalatha, V. Vaidehi, A. Kannan, S. Anandhi
The semantic Web browsing offers several benefits for the users. The researchers have done lots of work in this area. The proposals specified by them are not used much effectively for accessing the information. The search engines built today serve all users, independent of the special needs of any individual user. Personalization of Web search for each user incorporating his/her interests would give effective information retrieval. A user may associate one or more categories to their query manually. We have improved the existing, Rocchio based algorithm to construct the general profile and user profile for personalization. In our proposed method, we have constructed a Web browser; the information is retrieved through the browser with the aid of category hierarchy. The category hierarchy information will be frequently updated and ranked as per the user's interest during his/her Web search dynamically, the information retrieved is also cached on the client side using semantic cache mechanism which improves the response time. We have experimentally proved that our technique personalizes the Web search and reduces the hits made by the search engine providing appropriate results and improves the retrieval efficiency
{"title":"Information Retrieval using Semantic Web Browser - Personalized and Categorical Web Search","authors":"M. Sumalatha, V. Vaidehi, A. Kannan, S. Anandhi","doi":"10.1109/ICSCN.2007.350738","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350738","url":null,"abstract":"The semantic Web browsing offers several benefits for the users. The researchers have done lots of work in this area. The proposals specified by them are not used much effectively for accessing the information. The search engines built today serve all users, independent of the special needs of any individual user. Personalization of Web search for each user incorporating his/her interests would give effective information retrieval. A user may associate one or more categories to their query manually. We have improved the existing, Rocchio based algorithm to construct the general profile and user profile for personalization. In our proposed method, we have constructed a Web browser; the information is retrieved through the browser with the aid of category hierarchy. The category hierarchy information will be frequently updated and ranked as per the user's interest during his/her Web search dynamically, the information retrieved is also cached on the client side using semantic cache mechanism which improves the response time. We have experimentally proved that our technique personalizes the Web search and reduces the hits made by the search engine providing appropriate results and improves the retrieval efficiency","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130279924","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350708
F. Jing, R. Bhuvaneswaran, Y. Katayama, N. Takahashi
Multipath routing selection strategy has been studied in the context of ad hoc networks. It has been shown that this selection strategy is categorized into two parts according to the utilization of multiple routes: best routing selection strategy and load balancing selection strategy. The best routing selection strategy use one route and save backup routes information for fault tolerance. The load balancing selection strategy uses route diversity to balance network load. In this paper, we show that many complicated reasons decide the effects of the multipath routing selection strategies in various load conditions. The effects of the strategies reverse some time. We show that unless a dynamic multipath routing selection strategy is used, the effect of the multipath does not have the perfect impact
{"title":"Multipath Routing Selection Strategies in Wireless Mobile Ad Hoc Networks","authors":"F. Jing, R. Bhuvaneswaran, Y. Katayama, N. Takahashi","doi":"10.1109/ICSCN.2007.350708","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350708","url":null,"abstract":"Multipath routing selection strategy has been studied in the context of ad hoc networks. It has been shown that this selection strategy is categorized into two parts according to the utilization of multiple routes: best routing selection strategy and load balancing selection strategy. The best routing selection strategy use one route and save backup routes information for fault tolerance. The load balancing selection strategy uses route diversity to balance network load. In this paper, we show that many complicated reasons decide the effects of the multipath routing selection strategies in various load conditions. The effects of the strategies reverse some time. We show that unless a dynamic multipath routing selection strategy is used, the effect of the multipath does not have the perfect impact","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124912260","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350673
K. Satya Prasad, K. Anitha Sheela, M. Sridevi
This paper deals with implementing an efficient optimization technique for designing an automatic speaker recognition (ASR) System, which uses average F-ratio score of TESPAR features, to yield high recognition accuracy even in adverse noisy conditions. A new ranking scheme is also proposed in order to stabilize the rank of features in various noise levels by taking arithmetic mean of the F-Ratio scores obtained from various levels of signal to noise ratio (SNR). The result is presented for a text-dependent ASR system with 20 speaker database. An RBF (radial basis function) neural network is used for recognition purpose
{"title":"Optimization of TESPAR Features using Robust F-Ratio for Speaker Recognition","authors":"K. Satya Prasad, K. Anitha Sheela, M. Sridevi","doi":"10.1109/ICSCN.2007.350673","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350673","url":null,"abstract":"This paper deals with implementing an efficient optimization technique for designing an automatic speaker recognition (ASR) System, which uses average F-ratio score of TESPAR features, to yield high recognition accuracy even in adverse noisy conditions. A new ranking scheme is also proposed in order to stabilize the rank of features in various noise levels by taking arithmetic mean of the F-Ratio scores obtained from various levels of signal to noise ratio (SNR). The result is presented for a text-dependent ASR system with 20 speaker database. An RBF (radial basis function) neural network is used for recognition purpose","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122934571","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350669
A. T. Kalghatgi
Ultra wide band (UWB) is one of the key emerging short-range wireless technology that can answer many of the problems faced by narrow band technologies. UWB offers all the advantages of spread spectrum including GHz of RF bandwidth and high data rate. UWB signals are virtually undetectable operating at noise like low power levels. UWB offers very fine range resolution and also immune to multipath fading. Conventionally UWB is defined as carrier free, impulse based radio, which communicates in time domain by only using sharp rising pulses of the order of fraction of nano seconds. In this paper challenges in the design and development of impulse radio based ultra wide band transceiver is explained. Antennas that work in time domain, UWB impulses that meet the required FCC mask on EIRP and digitizer that has to sample and process at the rate of Gigasamples per second are some of the key challenges
{"title":"Challenges in the Design of an Impulse Radio Based Ultra Wide Band Transceiver","authors":"A. T. Kalghatgi","doi":"10.1109/ICSCN.2007.350669","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350669","url":null,"abstract":"Ultra wide band (UWB) is one of the key emerging short-range wireless technology that can answer many of the problems faced by narrow band technologies. UWB offers all the advantages of spread spectrum including GHz of RF bandwidth and high data rate. UWB signals are virtually undetectable operating at noise like low power levels. UWB offers very fine range resolution and also immune to multipath fading. Conventionally UWB is defined as carrier free, impulse based radio, which communicates in time domain by only using sharp rising pulses of the order of fraction of nano seconds. In this paper challenges in the design and development of impulse radio based ultra wide band transceiver is explained. Antennas that work in time domain, UWB impulses that meet the required FCC mask on EIRP and digitizer that has to sample and process at the rate of Gigasamples per second are some of the key challenges","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121851978","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350743
D.U. Perumal, Shylendra Kumar, S. Prasanth, P. Kumar, M. Kannan, V. Vaidehi
This paper describes the development of a novel image compression architecture on runtime reconfigurable FPGAs. The partially reconfigurable discrete cosine transform architecture (PRDCT) is implemented by creating a difference bit stream between two possible architectures using flexible multiplier and accumulator (MAC) units. The non-reconfigurable modules make use of a multiplexed bus system to communicate with the reconfigurable modules. This scheme helps the user achieve significant reduction in area and power during run-time
{"title":"An Efficient Reconfigurable Image Compression Architecture","authors":"D.U. Perumal, Shylendra Kumar, S. Prasanth, P. Kumar, M. Kannan, V. Vaidehi","doi":"10.1109/ICSCN.2007.350743","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350743","url":null,"abstract":"This paper describes the development of a novel image compression architecture on runtime reconfigurable FPGAs. The partially reconfigurable discrete cosine transform architecture (PRDCT) is implemented by creating a difference bit stream between two possible architectures using flexible multiplier and accumulator (MAC) units. The non-reconfigurable modules make use of a multiplexed bus system to communicate with the reconfigurable modules. This scheme helps the user achieve significant reduction in area and power during run-time","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127536672","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350753
Yew Kuan, Min, Varun Jeotil
New techniques for the reduction of peak to average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems are presented. These techniques are based on precoding the constellation symbols with Zadoff-Chu and generalized chirp-like (GCL) precoders. The proposed techniques can achieve a PAPR reduction of up to 4.5 dB for OFDM systems. The techniques have been shown to be effective and have low complexity
{"title":"A Novel Signal Independent Technique for PAPR Reduction in OFDM Systems","authors":"Yew Kuan, Min, Varun Jeotil","doi":"10.1109/ICSCN.2007.350753","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350753","url":null,"abstract":"New techniques for the reduction of peak to average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems are presented. These techniques are based on precoding the constellation symbols with Zadoff-Chu and generalized chirp-like (GCL) precoders. The proposed techniques can achieve a PAPR reduction of up to 4.5 dB for OFDM systems. The techniques have been shown to be effective and have low complexity","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126508971","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350784
R.L. Qureshi, Jean-Yves Ramel, H. Cardot, P. Mukherji
In this article, we have tried to explore a new hybrid approach which well integrates the advantages of structural and statistical approaches and avoids their weaknesses. In the proposed approach, the graphic symbols are first segmented into high-level primitive like quadrilaterals. Then, a graph is built by utilizing these quadrilaterals as nodes and their spatial relationships as edges. Additional information like relative length of the quadrilaterals and their relative angles with neighbouring quadrilaterals are associated as attributes to the nodes and edges of the graph respectively. However, the observed graphs are subject to deformations due to noise and/or vectorial distortion (in case of hand-drawn images) hence differs somewhat from their ideal models by either missing or extra nodes and edges appearance. Therefore, we propose a method that computes a measure of similarity between two given graphs instead of looking for exact isomorphism. The approach is based on comparing feature vectors extracted from the graphs. The idea is to use features that can be quickly computed from a graph on the one hand, but are, on the other hand, effective in discriminating between the various graphs in the database. The nearest neighbour rule is used as a classifier due to its simplicity and good behaviour
{"title":"Combination of Symbolic and Statistical Features for Symbols Recognition","authors":"R.L. Qureshi, Jean-Yves Ramel, H. Cardot, P. Mukherji","doi":"10.1109/ICSCN.2007.350784","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350784","url":null,"abstract":"In this article, we have tried to explore a new hybrid approach which well integrates the advantages of structural and statistical approaches and avoids their weaknesses. In the proposed approach, the graphic symbols are first segmented into high-level primitive like quadrilaterals. Then, a graph is built by utilizing these quadrilaterals as nodes and their spatial relationships as edges. Additional information like relative length of the quadrilaterals and their relative angles with neighbouring quadrilaterals are associated as attributes to the nodes and edges of the graph respectively. However, the observed graphs are subject to deformations due to noise and/or vectorial distortion (in case of hand-drawn images) hence differs somewhat from their ideal models by either missing or extra nodes and edges appearance. Therefore, we propose a method that computes a measure of similarity between two given graphs instead of looking for exact isomorphism. The approach is based on comparing feature vectors extracted from the graphs. The idea is to use features that can be quickly computed from a graph on the one hand, but are, on the other hand, effective in discriminating between the various graphs in the database. The nearest neighbour rule is used as a classifier due to its simplicity and good behaviour","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121351774","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350666
G. Lavanya, R. Parimalam, J. Uma Maheswari
Ad hoc mobile networks are very dynamic, self organizing, self healing distributed networks which supports data networking without an infrastructure. The user can use the network services efficiently and securely while moving, by using our proposed scheme. This technique is used to store backup routes from multiple routes available between source and destination. Furthermore, it also supports heterogeneous interfaces between the nodes with a secured data transmission using voice
{"title":"Secured Data Transmission in Adhoc Networks Supporting Heterogeneous Interfaces","authors":"G. Lavanya, R. Parimalam, J. Uma Maheswari","doi":"10.1109/ICSCN.2007.350666","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350666","url":null,"abstract":"Ad hoc mobile networks are very dynamic, self organizing, self healing distributed networks which supports data networking without an infrastructure. The user can use the network services efficiently and securely while moving, by using our proposed scheme. This technique is used to store backup routes from multiple routes available between source and destination. Furthermore, it also supports heterogeneous interfaces between the nodes with a secured data transmission using voice","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129369039","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350705
K. Sudha, R. Rao
Frequency-hopped (FH) CDMA is a digital multiple access system in which individual users selects one of Q frequencies within a wideband channel as carrier frequency. Main drawback of FH CDMA is, it is interference limited. In this paper we analyze the performance of frequency-hopped spread spectrum networks (FHSS) with turbo block codes. After the development of turbo code, using block component codes have received less attention. Block component codes are particularly suited for high rate applications with short block lengths and allow high degree of parallel processing which is desirable for delay sensitive applications. Rate compatible coding is appropriate for communication systems that experience a range of operating SNRs but seek to adhere to a single under laying codec structure. This paper suggests the performance improvement of FH SS signals by using rate compatible parallel-concatenated block codes using BCH (Bose, Chaudhuri, Hocquenghem) codes as component codes and usage of puncturing for making it rate compatible. These codes enjoy more freedom in puncturing pattern selection thus allowing for an almost continuous spectrum of code rates
{"title":"Performance Improvement of FH CDMA Signals using Rate Compatible Parallel Concatenated Block Codes","authors":"K. Sudha, R. Rao","doi":"10.1109/ICSCN.2007.350705","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350705","url":null,"abstract":"Frequency-hopped (FH) CDMA is a digital multiple access system in which individual users selects one of Q frequencies within a wideband channel as carrier frequency. Main drawback of FH CDMA is, it is interference limited. In this paper we analyze the performance of frequency-hopped spread spectrum networks (FHSS) with turbo block codes. After the development of turbo code, using block component codes have received less attention. Block component codes are particularly suited for high rate applications with short block lengths and allow high degree of parallel processing which is desirable for delay sensitive applications. Rate compatible coding is appropriate for communication systems that experience a range of operating SNRs but seek to adhere to a single under laying codec structure. This paper suggests the performance improvement of FH SS signals by using rate compatible parallel-concatenated block codes using BCH (Bose, Chaudhuri, Hocquenghem) codes as component codes and usage of puncturing for making it rate compatible. These codes enjoy more freedom in puncturing pattern selection thus allowing for an almost continuous spectrum of code rates","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129056505","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：